10 static struct treenode *_new_plain(int op)
12 struct treenode *new = (TREECAST) malloc(TREESIZE);
14 new->kids[0] = new->kids[1] = TREENULL;
15 new->parent = TREENULL;
17 new->name = new->reg = (char *)NULL;
19 new->param_index = -1;
23 struct treenode *new_node(int op, struct treenode *l, struct treenode *r)
25 struct treenode *new = TREENULL;
28 fprintf(stderr, "new_node: %i (%s)\n", op, o_names[op]);
30 if(op == O_SUB && l != TREENULL && r != TREENULL && l->op == O_NUM && r->op == O_NUM) {
31 new = new_number(l->val - r->val);
38 new->name = (char *)NULL;
42 struct treenode *new_param(int op, char *name, struct treenode *l, struct treenode *r, int param_index)
44 struct treenode *new = new_node(op, l, r);
47 fprintf(stderr, "new_param: %i (index)\n", param_index);
49 new->param_index = param_index;
54 struct treenode *new_field(char *name, struct treenode *l, struct treenode *r, int soffset)
56 struct treenode *new = new_node(O_FIELD, l, r);
59 fprintf(stderr, "new_field: %i (soffset)\n", soffset);
61 new->soffset = soffset;
66 struct treenode *new_call(char *name, struct treenode *l, struct treenode *r)
68 struct treenode *new = new_node(O_CALL, l, r);
71 fprintf(stderr, "new_call\n");
77 struct treenode *new_number(long val)
80 /* TODO: maximal groesse? */
82 char *t = (char*) malloc(BUFMAX);
85 new = _new_plain(O_NULL);
86 } else if(val == -1) {
87 new = _new_plain(O_MONE);
88 } else if(val == -2) {
89 new = _new_plain(O_MTWO);
90 } else if(val == -4) {
91 new = _new_plain(O_MFOUR);
92 } else if(val == -8) {
93 new = _new_plain(O_MEIGHT);
95 new = _new_plain(O_NUM);
99 fprintf(stderr, "new_number: %i\n", val);
102 memset(t, 0, BUFMAX);
103 sprintf(t, "%li", val);
109 static void write_indent(int i)
112 for(a = 0; a < i; a++) {
113 fprintf(stderr, "| ");
117 void write_tree(struct treenode *node, int indent)
119 if(node == TREENULL) return;
120 write_indent(indent);
121 fprintf(stderr, "%s @ %%%s. \"%s\"\n", o_names[node->op], node->reg, node->name == (char*) NULL ? "" : node->name);
122 if(node->kids[0] != TREENULL) {
123 write_tree(node->kids[0], indent+1);
125 if(node->kids[1] != TREENULL) {
126 write_tree(node->kids[1], indent+1);