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_number(long val)
69 /* TODO: maximal groesse? */
71 char *t = (char*) malloc(BUFMAX);
74 new = _new_plain(O_NULL);
75 } else if(val == -1) {
76 new = _new_plain(O_MONE);
77 } else if(val == -2) {
78 new = _new_plain(O_MTWO);
79 } else if(val == -4) {
80 new = _new_plain(O_MFOUR);
81 } else if(val == -8) {
82 new = _new_plain(O_MEIGHT);
84 new = _new_plain(O_NUM);
88 fprintf(stderr, "new_number: %i\n", val);
92 sprintf(t, "%li", val);
98 static void write_indent(int i)
101 for(a = 0; a < i; a++) {
102 fprintf(stderr, "| ");
106 void write_tree(struct treenode *node, int indent)
108 if(node == TREENULL) return;
109 write_indent(indent);
110 fprintf(stderr, "%s @ %%%s. \"%s\"\n", o_names[node->op], node->reg, node->name == (char*) NULL ? "" : node->name);
111 if(node->kids[0] != TREENULL) {
112 write_tree(node->kids[0], indent+1);
114 if(node->kids[1] != TREENULL) {
115 write_tree(node->kids[1], indent+1);