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;
18 new->val = new->exprcount = 0;
19 new->param_index = -1;
23 struct treenode *new_node(int op, struct treenode *l, struct treenode *r, int exprcount)
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, exprcount);
37 new->exprcount = exprcount;
39 new->name = (char *)NULL;
43 struct treenode *new_param(int op, char *name, struct treenode *l, struct treenode *r, int param_index, int exprcount)
45 struct treenode *new = new_node(op, l, r, exprcount);
48 fprintf(stderr, "new_param: %i (index)\n", param_index);
50 new->param_index = param_index;
55 struct treenode *new_field(char *name, struct treenode *l, struct treenode *r, int soffset, int exprcount)
57 struct treenode *new = new_node(O_FIELD, l, r, exprcount);
60 fprintf(stderr, "new_field: %i (soffset)\n", soffset);
62 new->soffset = soffset;
67 struct treenode *new_number(long val, int exprcount)
70 /* TODO: maximal groesse? */
72 char *t = (char*) malloc(BUFMAX);
75 new = _new_plain(O_NULL);
76 } else if(val == -1) {
77 new = _new_plain(O_MONE);
78 } else if(val == -2) {
79 new = _new_plain(O_MTWO);
80 } else if(val == -4) {
81 new = _new_plain(O_MFOUR);
82 } else if(val == -8) {
83 new = _new_plain(O_MEIGHT);
85 new = _new_plain(O_NUM);
89 fprintf(stderr, "new_number: %i\n", val);
92 new->exprcount = exprcount;
94 sprintf(t, "%li", val);
100 static void write_indent(int i)
103 for(a = 0; a < i; a++) {
104 fprintf(stderr, "| ");
108 void write_tree(struct treenode *node, int indent)
110 if(node == TREENULL) return;
111 write_indent(indent);
112 fprintf(stderr, "%s @ %%%s (%i). \"%s\"\n", o_names[node->op], node->reg, node->exprcount, node->name == (char*) NULL ? "" : node->name);
113 if(node->kids[0] != TREENULL) {
114 write_tree(node->kids[0], indent+1);
116 if(node->kids[1] != TREENULL) {
117 write_tree(node->kids[1], indent+1);