#include "tree.h"
#define MAX(A,B) (A > B ? A : B)
+
+ /* funktioniert nicht fuer skinner33_00.0 @ gesamt (aber dafuer fuer ca.0) */
+ int ret_opt(struct treenode *x, int call)
+ {
+ if(x->op == O_RET && x->kids[0] != TREENULL) {
+ x = x->kids[0];
+ if(x->op == O_CALL && x->kids[0] != TREENULL && x->kids[1] !=
+ TREENULL && x->kids[0]->op == O_NOTHING) {
+ x = x->kids[1];
+ if(x->op == O_ARG && x->kids[0] != TREENULL && x->kids[1] !=
+ TREENULL && x->kids[0]->op == O_NOTHING &&
+ x->kids[1]->op == O_NOTHING) {
+ return -1;
+ }
+ }
+ }
+ return call;
+ }
%}
%start Input
* node: baum fuer iburg
* sin: symboltabelle fuer statement ("eingabe")
* sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
+ * lblcnt_{in,out}: label counter
+ * vars_{in,out}: counter fuer lokale variablen
+ * call: enthaelt block einen call? (sonst kann man sich stack setup sparen)
+ * imm: fuer ein paar quirks mit immediates im ast
+ * paramcount: zum zaehlen der paramter eines methodenaufrufes
*/
@autoinh s gparamges vars_in
@autosyn node imm call
@attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int vars_in; int vars_out; int call; } Statseq
@attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int reallblcnt; int vars_in; int vars_out; int call; } Elsestat
@attributes { struct symbol *s; int gparamges; int vars_in; struct treenode *node; short imm; int call; } Expr Minusterm Multerm Orterm Feld Term
-@attributes { struct symbol *s; int gparamges; int vars_in; struct treenode *node; } Lexpr
+@attributes { struct symbol *s; int gparamges; int vars_in; struct treenode *node; } Lexpr IdentCommon
@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars_in; int vars_out; int lblcnt_in; int lblcnt_out; int call; } Statement
@traversal @postorder c
@i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
@i @Statseq.0.vars_out@ = @Statseq.1.vars_out@;
- @i @Statseq.0.call@ = @Statement.call@ || @Statseq.1.call@;
+ @i @Statseq.0.call@ = @Statement.call@ | @Statseq.1.call@;
@}
|
varsinout()
lblcountinout()
xxputsin(@Expr.s@,)
- @i @Statement.node@ = TREENULL;
+ @i @Statement.node@ = new_node(O_EXPR, @Expr.node@, TREENULL);
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
+
+ @gen {
+ just_calls(@Statement.node@);
+ }
@}
| IF Expr THEN Statseq END
@gen {
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("\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@);
@gen {
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("\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@);
@gen {
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("\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@);
xxputsin(@Expr.s@,)
@i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
+ @i @Statement.call@ = ret_opt(@Statement.node@, @Expr.call@);
+
@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); func_footer();
@}
Lexpr:
+ IdentCommon
+ | Feld
+ ;
+
+IdentCommon:
IDENT
@{
- @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
+ @c check(@IdentCommon.s@, @IDENT.name@, S_VAR|S_PARM);
- /* 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) {
+ @IdentCommon.node@ = TREENULL;
+ if(tab_lookup(@IdentCommon.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);
+ @IdentCommon.node@ = new_field(@IDENT.name@, new_param(O_ID, "this", TREENULL, TREENULL, 0), TREENULL, tab_lookup(@IdentCommon.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@IdentCommon.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);
+ int tmp = tab_lookup(@IdentCommon.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@IdentCommon.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
+ @IdentCommon.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
}
}
- @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
+ @reg if(tab_lookup(@IdentCommon.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
/* TODO: kein schoener hack? */
- @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
+ @IdentCommon.node@->kids[0]->reg = @IdentCommon.node@->reg;
}
@}
-
- | Feld
;
+
Feld: Term '.' IDENT
@{
@c check(@Feld.s@, @IDENT.name@, S_FIELD);
| THIS
@{
- @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
+ @i @Term.node@ = new_param(O_ID, "this", TREENULL, TREENULL, 0);
@i @Term.imm@ = 0;
@i @Term.call@ = 0;
@}
- | IDENT
+ | IdentCommon
@{
- @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
-
@i @Term.imm@ = 0;
@i @Term.call@ = 0;
- @i {
- @Term.node@ = TREENULL;
- if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
- /* 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 */
- 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);
- }
- }
-
- @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
- /* TODO: kein schoener hack? */
- @Term.node@->kids[0]->reg = @Term.node@->reg;
- }
@}
| Feld
| IDENT '(' Exprs ')'
@{
@i {
- @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, new_nothing(), 0) /*this*/,
- TREENULL, @Term.gparamges@, @Term.vars_in@);
- @Term.node@->soffset = @Exprs.paramcount@;
+ @Term.node@ = new_call(@IDENT.name@, @Exprs.node@, new_arg(new_nothing(), new_nothing(), 0) /*this*/,
+ @Term.gparamges@, @Term.vars_in@);
+ @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
+ @Term.node@->sc = @Term.node@->kids[1]->sc = @Exprs.node@->sc;
}
@i @Exprs.cnt@ = 1;
@i @Term.imm@ = 0;
| Term '.' IDENT '(' Exprs ')'
@{
@i {
- @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, @Term.1.node@, 0) /*this*/,
- TREENULL, @Term.gparamges@, @Term.vars_in@);
- @Term.node@->soffset = @Exprs.paramcount@;
+ @Term.node@ = new_call(@IDENT.name@, @Exprs.node@, new_arg(@Term.1.node@, new_nothing(), 0) /*this*/,
+ @Term.gparamges@, @Term.vars_in@);
+ @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
+ @Term.node@->sc = @Term.node@->kids[1]->sc = @Exprs.node@->sc;
}
@i @Exprs.cnt@ = 1;
@i @Term.imm@ = 0;
@i @Term.call@ = 1;
- @reg @Exprs.node@->reg = @Term.1.node@->reg = @Term.node@->kids[0]->reg = @Term.node@->reg;
+ @reg @Exprs.node@->reg = @Term.1.node@->reg = @Term.node@->kids[1]->reg = @Term.node@->reg;
@}
;
Exprs:
Expr ',' Exprs
@{
- @i @Exprs.0.node@ = new_arg(@Expr.0.node@, @Exprs.1.node@, @Exprs.0.cnt@);
+ @i {
+ @Exprs.0.node@ = new_arg(@Exprs.1.node@, @Expr.0.node@, @Exprs.0.cnt@);
+ @Exprs.0.node@->sc = @Exprs.1.node@->sc;
+ }
@i @Exprs.0.paramcount@ = @Exprs.1.paramcount@;
@i @Exprs.1.cnt@ = @Exprs.0.cnt@ + 1;
- @reg @Expr.node@->reg = @Exprs.0.node@->reg; @Exprs.1.node@->reg = next_reg(@Exprs.0.node@->reg, @Exprs.gparamges@);
+ @reg {
+ @Expr.node@->reg = @Exprs.0.node@->reg;
+ @Exprs.1.node@->reg = next_reg(@Exprs.0.node@->reg, @Exprs.gparamges@);
+ }
@}
| Expr
@{
- @i @Exprs.0.node@ = new_arg(@Expr.0.node@, new_nothing(), @Exprs.cnt@);
+ @i {
+ @Exprs.0.node@ = new_arg(@Expr.0.node@, new_nothing(), @Exprs.cnt@);
+ @Exprs.0.node@->sc = malloc(8 * sizeof(short));
+ }
@i @Exprs.paramcount@ = @Exprs.cnt@ + 1;
@reg @Expr.node@->reg = @Exprs.0.node@->reg;
@}
|
@{
- @i @Exprs.0.node@ = new_nothing();
+ @i {
+ @Exprs.0.node@ = new_nothing();
+ @Exprs.0.node@->sc = malloc(8 * sizeof(short));
+ }
@i @Exprs.paramcount@ = @Exprs.cnt@;
@}
;
projects / uebersetzerbau-ss10.git / blobdiff