Quick Search:

Mode

Context

Displaying 3 lines of context. None | Less | More | Full

Other Diffs

Ignore

Blank Lines Whitespace: Expand:

Diff

1.131
 
1.132
 
MAIN:ragge:20050220124042
 
trees.c
_>924924         rv = bcon(1);
 925925         df = s->n_df;
 926926         while (ISARY(ty)) {
<>927 -                int u = -df->ddim;
928927                 rv = buildtree(MUL, rv, df->ddim >= 0 ? bcon(df->ddim) :
<>929 -                    tempnode(&u, INT, 0, MKSUE(INT)));
  928+                    tempnode(-df->ddim, INT, 0, MKSUE(INT)));
930929                 df++;
 931930                 ty = DECREF(ty);
 932931         }
     
 !
15231522  * XXX - nr should not be a pointer.
 15241523  */
 15251524 NODE *
<>1526 -tempnode(int *nr, TWORD type, union dimfun *df, struct suedef *sue)
  1525+tempnode(int nr, TWORD type, union dimfun *df, struct suedef *sue)
15271526 {
 15281527         NODE *p, *r;
 15291528 
 15301529         r = block(TEMP, NIL, NIL, type, df, sue);
<>1531 -        r->n_lval = *nr == 0 ? ++tvaloff : *nr;
  1530+        r->n_lval = nr == 0 ? ++tvaloff : nr;
15321531         return r;
 15331532 
 15341533 #if 0
     
 !
15691568         p = block(OREG, NIL, NIL, type, df, sue);
 15701569         p->n_rval = FPREG;
 15711570         p->n_qual = 0;
<>1572 -        r = offcon(*nr, type, df, sue);
  1571+        r = offcon(nr, type, df, sue);
15731572         p->n_lval = r->n_lval;
 15741573         nfree(r);
 15751574         return p;
     
 !
16031602         df = p->n_df;
 16041603         ty = p->n_type;
 16051604         while (ISARY(ty)) {
<>1606 -                int u = -df->ddim;
16071605                 rv = buildtree(MUL, rv, df->ddim >= 0 ? bcon(df->ddim) :
<>1608 -                    tempnode(&u, INT, 0, MKSUE(INT)));
  1606+                    tempnode(-df->ddim, INT, 0, MKSUE(INT)));
16091607                 df++;
 16101608                 ty = DECREF(ty);
 16111609         }
     
 !
18701868                 /* Only if type is not void */
 18711869                 q = p->n_right->n_left;
 18721870                 if (type != VOID) {
<>1873 -                        r = tempnode(&tval, q->n_type, q->n_df, q->n_sue);
  1871+                        r = tempnode(0, q->n_type, q->n_df, q->n_sue);
  1872+                        tval = r->n_lval;
18741873                         q = buildtree(ASSIGN, r, q);
 18751874                 }
 18761875                 rmcops(q);
     
 !
18801879 
 18811880                 q = p->n_right->n_right;
 18821881                 if (type != VOID) {
<>1883 -                        r = tempnode(&tval, q->n_type, q->n_df, q->n_sue);
  1882+                        r = tempnode(tval, q->n_type, q->n_df, q->n_sue);
18841883                         q = buildtree(ASSIGN, r, q);
 18851884                 }
 18861885                 rmcops(q);
     
 !
18901889 
 18911890                 nfree(p->n_right);
 18921891                 if (p->n_type != VOID) {
<>1893 -                        r = tempnode(&tval, p->n_type, p->n_df, p->n_sue);
  1892+                        r = tempnode(tval, p->n_type, p->n_df, p->n_sue);
18941893                         *p = *r;
 18951894                         nfree(r);
 18961895                 } else
     
 !
19161915                 r = talloc();
 19171916                 *r = *p;
 19181917                 andorbr(r, -1, lbl = getlab());
<>1919 -                q = tempnode(&tval, p->n_type, p->n_df, p->n_sue);
 1920 -                r = tempnode(&tval, p->n_type, p->n_df, p->n_sue);
  1918+                q = tempnode(0, p->n_type, p->n_df, p->n_sue);
  1919+                tval = q->n_lval;
  1920+                r = tempnode(tval, p->n_type, p->n_df, p->n_sue);
19211921                 ecode(buildtree(ASSIGN, q, bcon(1)));
 19221922                 branch(lbl2 = getlab());
 19231923                 plabel( lbl);
 19241924                 ecode(buildtree(ASSIGN, r, bcon(0)));
 19251925                 plabel( lbl2);
<>1926 -                r = tempnode(&tval, p->n_type, p->n_df, p->n_sue);
  1926+                r = tempnode(tval, p->n_type, p->n_df, p->n_sue);
19271927                 *p = *r;
 19281928                 nfree(r);
 19291929 #endif
     
 !
19851985                 NODE *ll = l->n_left;
 19861986 
 19871987                 if (has_se(l)) {
<>1988 -                        tval = 0;
 1989 -                        q = tempnode(&tval, ll->n_type, ll->n_df, ll->n_sue);
 1990 -                        r = tempnode(&tval, ll->n_type, ll->n_df,ll->n_sue);
  1988+                        q = tempnode(0, ll->n_type, ll->n_df, ll->n_sue);
  1989+                        tval = q->n_lval;
  1990+                        r = tempnode(tval, ll->n_type, ll->n_df,ll->n_sue);
<_19911991                         l->n_left = q;
 19921992                         /* Now the left side of node p has no side effects. */
 19931993                         /* side effects on the right side must be obeyed */
FishEye: Open Source License registered to PCC.
Your maintenance has expired. You can renew your license at http://www.atlassian.com/fisheye/renew
Atlassian FishEye, CVS analysis. (Version:1.6.3 Build:build-336 2008-11-04) - Administration - Page generated 2014-07-11 05:28 +0200