codeb: (opt) unneotige test instrutkionen wegoptimiert

[uebersetzerbau-ss10.git] / codeb / parser.y

diff --git a/codeb/parser.y b/codeb/parser.y
index 279576d385a91f19119b485b6ed975c7a75e70fe..39cc35dbe86ea521fc84c18bcccc679ba47ae200 100644 (file)
--- a/codeb/parser.y
+++ b/codeb/parser.y
@@ -201,7 +201,7 @@ Statement:
                        printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
                        write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
                        /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
-                       printf("\ttest %s-1, %%rax\n\tjz .%s_ifend_%d\n", "$", get_func_name(), @Statement.lblcnt_in@);
+                       printf("\tjz .%s_ifend_%d\n", get_func_name(), @Statement.lblcnt_in@);
                }
                @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
          @}
@@ -228,7 +228,7 @@ Statement:
                        printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
                        write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
                        /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
-                       printf("\ttest %s-1, %%rax\n\tjz .%s_ifelse_%d\n", "$", get_func_name(), @Statement.lblcnt_in@);
+                       printf("\tjz .%s_ifelse_%d\n", get_func_name(), @Statement.lblcnt_in@);
                }
                @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
          @}
@@ -249,7 +249,7 @@ Statement:
                        printf(".%s_whilestart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
                        write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
                        /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
-                       printf("\ttest %s-1, %%rax\n\tjz .%s_whileend_%d\n", "$", get_func_name(), @Statement.lblcnt_in@);
+                       printf("\tjz .%s_whileend_%d\n", get_func_name(), @Statement.lblcnt_in@);
                }
                @gen @revorder(1) printf("\tjmp .%s_whilestart_%d\n.%s_whileend_%d:\n", get_func_name(), @Statement.lblcnt_in@, get_func_name(), @Statement.lblcnt_in@);
          @}
@@ -320,9 +320,9 @@ Expr:
 
        | NOT Term
          @{
-               @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
+               @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL)), TREENULL);
 
-               @reg @Term.node@->reg = @Expr.node@->reg;
+               @reg @Term.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
          @}
 
        | Term Minusterm
@@ -370,22 +370,22 @@ Expr:
 
        | Term '<' Term
          @{
-           @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
+           @i @Expr.node@ = new_node(O_BOOL, new_node(O_LESS, @Term.0.node@, @Term.1.node@), TREENULL);
                @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
 
                @reg {
-                       @Term.0.node@->reg = @Expr.node@->reg;
+                       @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
                        @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
                }
          @}
 
        | Term '=' Term
          @{
-           @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
+           @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.0.node@, @Term.1.node@), TREENULL);
                @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
 
                @reg {
-                       @Term.0.node@->reg = @Expr.node@->reg;
+                       @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
                        @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
                }
          @}