* geht nicht, weil verschachtelte macros deaktiviert sind */
@end
+@macro lblcountinout()
+ @i @Statement.lblcnt_out@ = @Statement.lblcnt_in@;
+@end
+
/* beschreibung der attribute
* s: symboltabelle
* f: symboltabelle fuer quirks mit structur und parameter
@attributes { struct symbol *f; } Program Structdef;
@attributes { struct symbol *f; int offsetcount; } FeldID
@attributes { struct symbol *s; } Methoddef
-@attributes { struct symbol *s; int gparamges; } Statseq Exprs
+@attributes { struct symbol *s; int gparamges; } Exprs
+@attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; } Statseq
+@attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int reallblcnt; } Elsestat
@attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; } Expr Minusterm Multerm Orterm Feld Term
@attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
-@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
+@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars; int lblcnt_in; int lblcnt_out; } Statement
@traversal @postorder c
@traversal @preorder reg
@i @Parms.parms@ = 1;
@i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
@i @Statseq.gparamges@ = @Parms.paramges@;
+ @i @Statseq.lblcnt_in@ = 0;
@gen func_header(@IDENT.name@);
@}
;
Statement ';' Statseq
@{
@i @Statement.sin@ = @Statseq.0.s@;
+ @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
+
@i @Statseq.1.s@ = @Statement.sout@;
- @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
+ @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
+ @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@ + @Statement.vars@;
+
+ @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
@}
|
+ @{
+ @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
+ @}
;
Statement:
Lexpr ASSIGN Expr
@{
statinout()
+ lblcountinout()
xxputsin(@Lexpr.s@,)
xxputsin(@Expr.s@,)
- @i @Statement.node@ = TREENULL;
+ @i @Statement.node@ = new_node(O_ASSIGN, @Lexpr.node@, @Expr.node@);
+ @i @Statement.vars@ = 0;
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+
+ @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
@}
| VAR IDENT ASSIGN Expr
@{
/* tab_clone ist hier noetig, vgl. folgendes statement
* > var x := x - 1; */
- @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, -1, -1);
+ @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@, -1);
+ lblcountinout()
xxputsin(@Expr.s@,)
- @i @Statement.node@ = TREENULL;
+
+ @i @Statement.node@ = new_node(O_ASSIGN, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@), @Expr.node@);
+ @i @Statement.vars@ = 1;
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+
+ @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
@}
| Expr
@{
statinout()
+ lblcountinout()
xxputsin(@Expr.s@,)
@i @Statement.node@ = TREENULL;
+ @i @Statement.vars@ = 0;
@}
| IF Expr THEN Statseq END
@{
statinout()
+ @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
+ @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
xxputsin(@Expr.s@,)
xxputsin(@Statseq.s@,)
- @i @Statement.node@ = TREENULL;
+
+ @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
+ @i @Statement.vars@ = 0;
+
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+ @gen {
+ 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 %s1, %%rax\n\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@);
@}
- | IF Expr THEN Statseq ELSE Statseq END
+ | IF Expr THEN Statseq Elsestat END
@{
statinout()
+ @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
+ @i @Elsestat.lblcnt_in@ = @Statseq.lblcnt_out@;
+ @i @Statement.lblcnt_out@ = @Elsestat.lblcnt_out@;
+
+ /* im Elsestat muss noch ein label numeriert werden */
+ @i @Elsestat.reallblcnt@ = @Statement.lblcnt_in@;
+
xxputsin(@Expr.s@,)
xxputsin(@Statseq.0.s@,)
- xxputsin(@Statseq.1.s@,)
- @i @Statement.node@ = TREENULL;
+ xxputsin(@Elsestat.s@,)
+
+ @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
+ @i @Statement.vars@ = 0;
+
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+ @gen {
+ 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 %s1, %%rax\n\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@);
@}
| WHILE Expr DO Statseq END
@{
statinout()
+ lblcountinout()
+ /* TODO */
+ @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
xxputsin(@Expr.s@,)
xxputsin(@Statseq.s@,)
@i @Statement.node@ = TREENULL;
+ @i @Statement.vars@ = 0;
@}
| RETURN Expr
@{
statinout()
+ lblcountinout()
xxputsin(@Expr.s@,)
+
+ @i @Statement.vars@ = 0;
@i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
@reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+
+ @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
@}
;
+Elsestat:
+ ELSE Statseq
+ @{
+ @i @Statseq.lblcnt_in@ = @Elsestat.lblcnt_in@;
+ @i @Elsestat.lblcnt_out@ = @Statseq.lblcnt_out@;
+
+ @gen printf("\tjmp %s_ifend_%d\n%s_ifelse_%d:\n", get_func_name(), @Elsestat.reallblcnt@, get_func_name(), @Elsestat.reallblcnt@);
+ @}
+
Lexpr:
IDENT
@{
- @i @Lexpr.node@ = TREENULL;
@c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
- /* this.feldname */
- /* TODO fuer zuweisungen ... (codeb?) */
+
+ /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
+ @i {
+ @Lexpr.node@ = TREENULL;
+ if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
+ /* es handelt sich um ein feldzugriff auf this */
+ @Lexpr.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD)->soffset);
+ } else { /* param oder var */
+ int tmp = tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
+ @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
+ }
+ }
+
+ @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
+ /* TODO: kein schoener hack? */
+ @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
+ }
@}
| Feld
/* es handelt sich um ein feldzugriff auf this */
@Term.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_FIELD)->soffset);
} else { /* param oder var */
- @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_PARM)->param_index);
+ int tmp = tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
+ @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
}
}