Quick Search:

Mode

Context

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

Other Diffs

Ignore

Blank Lines Whitespace: Expand:

Diff

1.93
 
1.94
 
MAIN:ragge:20030802112243
 
pftn.c
_>18771877 
 18781878         /* Remove initial QUALIFIERs */
 18791879         if (p && p->n_op == QUALIFIER) {
<>1880 -                qual = p->n_type == CONST ? CON : VOL;
  1880+                qual = p->n_type;
18811881                 l = p->n_left;
 18821882                 nfree(p);
 18831883                 p = l;
     
 !
18931893 
 18941894         /* Remove more QUALIFIERs */
 18951895         if (p && p->n_op == QUALIFIER) {
<>1896 -                qual |= p->n_type == CONST ? CON : VOL;
  1896+                qual |= p->n_type;
18971897                 l = p->n_left;
 18981898                 nfree(p);
 18991899                 p = l;
     
 !
19111911 
 19121912         while (p != NIL) {
 19131913                 if (p->n_op == QUALIFIER) {
<>1914 -                        qual |= p->n_type == CONST ? CON : VOL;
  1914+                        qual |= p->n_type;
19151915                         goto next;
 19161916                 }
 19171917                 if (p->n_op == CLASS) {
     
 !
20262026 #endif
 20272027 
 20282028         idp->n_type = typ->n_type;
<>2029 -        idp->n_qual = typ->n_qual;
  2029+        idp->n_qual = INCQAL(typ->n_qual) | idp->n_qual;
20302030 
 20312031         tylkp = &tylnk;
 20322032         tylkp->next = NULL;
     
 !
20512051         /* now idp is a single node: fix up type */
 20522052 
 20532053         idp->n_type = ctype(idp->n_type);
<> 2054+        idp->n_qual = DECQAL(idp->n_qual);
20542055 
 20552056         /* in case ctype has rewritten things */
 20562057         if ((t = BTYPE(idp->n_type)) != STRTY && t != UNIONTY && t != ENUMTY)
     
 !
21492150 tyreduce(NODE *p, struct tylnk **tylkp, int *ntdim)
 21502151 {
 21512152         union dimfun dim;
<>2152 -        NODE *q;
  2153+        NODE *r;
21532154         int o;
<>2154 -        unsigned int t;
  2155+        TWORD t, q;
21552156 
 21562157         o = p->n_op;
 21572158         if (o == NAME)
 21582159                 return;
 21592160 
 21602161         t = INCREF(p->n_type);
<> 2162+        q = p->n_qual;
21612163         switch (o) {
 21622164         case CALL:
 21632165                 t += (FTN-PTR);
     
 !
21702172         case LB:
 21712173                 t += (ARY-PTR);
 21722174                 if (p->n_right->n_op != ICON) {
<>2173 -                        q = p->n_right;
  2175+                        r = p->n_right;
21742176                         o = RB;
 21752177                 } else {
 21762178                         dim.ddim = p->n_right->n_lval;
     
 !
21822184         }
 21832185 
 21842186         p->n_left->n_type = t;
<> 2187+        p->n_left->n_qual = INCQAL(q) | p->n_left->n_qual;
21852188         tyreduce(p->n_left, tylkp, ntdim);
 21862189 
 21872190         if (o == LB || o == (UNARY CALL) || o == CALL)
 21882191                 tylkadd(dim, tylkp, ntdim);
 21892192         if (o == RB) {
 21902193                 dim.ddim = -1;
 21912194                 tylkadd(dim, tylkp, ntdim);
<>2192 -                arrstk[arrstkp++] = q;
  2195+                arrstk[arrstkp++] = r;
21932196         }
 21942197 
 21952198         p->n_sp = p->n_left->n_sp;
 21962199         p->n_type = p->n_left->n_type;
<> 2200+        p->n_qual = p->n_left->n_qual;
21972201 }
 21982202 
 21992203 static NODE *
     
 !
22032207 
 22042208         r->n_op = NAME;
 22052209         r->n_type = t;
<> 2210+        r->n_qual = 0; /* XXX */
<_22062211         r->n_df = d;
 22072212         r->n_sue = sue;
 22082213 
FishEye: Open Source License registered to PCC.
Atlassian FishEye, CVS analysis. (Version:1.6.3 Build:build-336 2008-11-04) - Administration - Page generated 2014-12-28 12:35 +0100