Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20041220182709

Diff

Diff from 1.121 to:

Annotations

Annotate by Age | Author | Mixed | None
/fisheye/browse/pcc/pcc/cc/ccom/trees.c

Annotated File View

ragge
1.121
1 /*      $Id: trees.c,v 1.121 2004/12/20 18:27:10 ragge Exp $    */
ragge
1.51
2 /*
3  * Copyright (c) 2003 Anders Magnusson (ragge@ludd.luth.se).
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  * 3. The name of the author may not be used to endorse or promote products
15  *    derived from this software without specific prior written permission
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27  */
28
29 /*
30  * Copyright(C) Caldera International Inc. 2001-2002. All rights reserved.
31  *
32  * Redistribution and use in source and binary forms, with or without
33  * modification, are permitted provided that the following conditions
34  * are met:
35  *
36  * Redistributions of source code and documentation must retain the above
37  * copyright notice, this list of conditions and the following disclaimer.
38  * Redistributions in binary form must reproduce the above copyright
39  * notice, this list of conditionsand the following disclaimer in the
40  * documentation and/or other materials provided with the distribution.
41  * All advertising materials mentioning features or use of this software
42  * must display the following acknowledgement:
43  *      This product includes software developed or owned by Caldera
44  *      International, Inc.
45  * Neither the name of Caldera International, Inc. nor the names of other
46  * contributors may be used to endorse or promote products derived from
47  * this software without specific prior written permission.
48  *
49  * USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
50  * INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
51  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
52  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
53  * DISCLAIMED.  IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE
54  * FOR ANY DIRECT, INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
55  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
56  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
57  * HOWEVER CAUSED AND ON ANY THEORY OFLIABILITY, WHETHER IN CONTRACT,
58  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
59  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
60  * POSSIBILITY OF SUCH DAMAGE.
61  */
62 /*
63  * Some of the changes from 32V include:
64  * - Understand "void" as type.
65  * - Handle enums as ints everywhere.
ragge
1.57
66  * - Convert some C-specific ops into branches.
ragge
1.51
67  */
68
ragge
1.1
69 # include "pass1.h"
ragge
1.51
70 # include "pass2.h"
ragge
1.1
71
ragge
1.16
72 # include <stdarg.h>
ragge
1.1
73
ragge
1.51
74 static void chkpun(NODE *p);
75 static int opact(NODE *p);
76 static int moditype(TWORD);
ragge
1.45
77 static NODE *strargs(NODE *);
ragge
1.57
78 static void rmcops(NODE *p);
ragge
1.2
79
ragge
1.77
80 int lastloc = -1;
ragge
1.1
81
82 /*      some special actions, used in finding the type of nodes */
83 # define NCVT 01
84 # define PUN 02
85 # define TYPL 04
86 # define TYPR 010
87 # define TYMATCH 040
88 # define LVAL 0100
89 # define CVTO 0200
90 # define CVTL 0400
91 # define CVTR 01000
92 # define PTMATCH 02000
93 # define OTHER 04000
94 # define NCVTR 010000
95
96 /* node conventions:
97
98         NAME:   rval>0 is stab index for external
99                 rval<0 is -inlabel number
100                 lval is offset in bits
101         ICON:   lval has the value
102                 rval has the STAB index, or - label number,
103                         if a name whose address is in the constant
104                 rval = NONAME means no name
105         REG:    rval is reg. identification cookie
106
107         */
108
ragge
1.30
109 int bdebug = 0;
110
ragge
1.1
111 NODE *
ragge
1.2
112 buildtree(int oNODE *lNODE *r)
113 {
114         NODE *p, *q;
115         int actions;
116         int opty;
ragge
1.119
117         struct symtab *sp = NULL/* XXX gcc */
ragge
1.2
118         NODE *lr, *ll;
ragge
1.23
119         char *name;
ragge
1.26
120         struct symtab **elem;
ragge
1.1
121
ragge
1.68
122 #ifdef PCC_DEBUG
ragge
1.2
123         if (bdebug)
ragge
1.58
124                 printf("buildtree(%s, %p, %p)\n"copst(o), lr);
ragge
1.68
125 #endif
ragge
1.58
126         opty = coptype(o);
ragge
1.1
127
128         /* check for constants */
129
ragge
1.22
130         ifopty == UTYPE && l->n_op == ICON ){
ragge
1.1
131
132                 switcho ){
133
134                 case NOT:
ragge
1.94
135                 case UMINUS:
ragge
1.1
136                 case COMPL:
137                         ifconvallol ) ) return(l);
138                         break;
139                 }
ragge
1.71
140         } else if (o == NOT && l->n_op == FCON) {
141                 l = clocal(block(SCONVlNILINT0MKSUE(INT)));
ragge
1.94
142         } else ifo == UMINUS && l->n_op == FCON ){
ragge
1.71
143                         l->n_dcon = -l->n_dcon;
ragge
1.1
144                         return(l);
145
ragge
1.44
146         } else ifo==QUEST && l->n_op==ICON ) {
ragge
1.41
147                 CONSZ c = l->n_lval;
148                 nfree(l);
149                 if (c) {
150                         tfree(r->n_right);
151                         l = r->n_left;
152                         nfree(r);
153                         return(l);
154                 } else {
155                         tfree(r->n_left);
156                         l = r->n_right;
157                         nfree(r);
158                         return(l);
ragge
1.1
159                 }
ragge
1.44
160         } else if( (o==ANDAND || o==OROR) && (l->n_op==ICON||r->n_op==ICON) )
161                 goto ccwarn;
ragge
1.1
162
ragge
1.22
163         else ifopty == BITYPE && l->n_op == ICON && r->n_op == ICON ){
ragge
1.1
164
165                 switcho ){
166
167                 case ULT:
168                 case UGT:
169                 case ULE:
170                 case UGE:
171                 case LT:
172                 case GT:
173                 case LE:
174                 case GE:
175                 case EQ:
ragge
1.48
176                 case NE:
ragge
1.1
177                 case ANDAND:
178                 case OROR:
179
180                 ccwarn:
181
182                 case PLUS:
183                 case MINUS:
184                 case MUL:
185                 case DIV:
186                 case MOD:
187                 case AND:
188                 case OR:
189                 case ER:
190                 case LS:
191                 case RS:
192                         ifconvallor ) ) {
ragge
1.41
193                                 nfree(r);
ragge
1.1
194                                 return(l);
ragge
1.44
195                         }
ragge
1.1
196                         break;
197                 }
ragge
1.44
198         } else if (opty == BITYPE && (l->n_op == FCON || l->n_op == ICON) &&
199             (r->n_op == FCON || r->n_op == ICON) && (o == PLUS || o == MINUS ||
200             o == MUL || o == DIV)) {
201                 switch(o){
202                 case PLUS:
203                 case MINUS:
204                 case MUL:
205                 case DIV:
206                         if (l->n_op == ICON)
207                                 l->n_dcon = l->n_lval;
208                         if (r->n_op == ICON)
209                                 r->n_dcon = r->n_lval;
210                         switch (o) {
211                         case PLUS:
212                                 l->n_dcon += r->n_dconbreak;
213                         case MINUS:
214                                 l->n_dcon -= r->n_dconbreak;
215                         case MUL:
216                                 l->n_dcon *= r->n_dconbreak;
217                         case DIV:
218                                 if (r->n_dcon == 0)
219                                         uerror("division by 0.");
220                                 else
221                                         l->n_dcon /= r->n_dcon;
222                         }
223                         l->n_op = FCON;
224                         l->n_type = DOUBLE;
225                         l->n_sue = MKSUE(DOUBLE);
226                         nfree(r);
227                         return(l);
ragge
1.1
228                 }
ragge
1.44
229         }
ragge
1.1
230
ragge
1.30
231         /* its real; we must make a new node */
ragge
1.1
232
ragge
1.26
233         p = block(olrINT0MKSUE(INT));
ragge
1.1
234
235         actions = opact(p);
236
ragge
1.66
237         if (actions & LVAL) { /* check left descendent */
238                 if (notlval(p->n_left)) {
239                         uerror("lvalue required");
ragge
1.68
240 #ifdef notyet
ragge
1.67
241                 } else {
242                         if ((l->n_type > BTMASK && ISCON(l->n_qual)) ||
243                             (l->n_type <= BTMASK && ISCON(l->n_qual << TSHIFT)))
244                                 if (blevel > 0)
245                                         uerror("lvalue is declared const");
ragge
1.68
246 #endif
ragge
1.67
247                 }
ragge
1.66
248         }
ragge
1.1
249
250         ifactions & NCVTR ){
ragge
1.22
251                 p->n_left = pconvertp->n_left );
ragge
1.1
252                 }
253         else if( !(actions & NCVT ) ){
254                 switchopty ){
255
256                 case BITYPE:
ragge
1.22
257                         p->n_right = pconvertp->n_right );
ragge
1.1
258                 case UTYPE:
ragge
1.22
259                         p->n_left = pconvertp->n_left );
ragge
1.1
260
261                         }
262                 }
263
ragge
1.64
264         if ((actions&PUN) && (o!=CAST))
ragge
1.1
265                 chkpun(p);
266
267         ifactions & (TYPL|TYPR) ){
268
ragge
1.22
269                 q = (actions&TYPL) ? p->n_left : p->n_right;
ragge
1.1
270
ragge
1.22
271                 p->n_type = q->n_type;
ragge
1.66
272                 p->n_qual = q->n_qual;
ragge
1.29
273                 p->n_df = q->n_df;
ragge
1.26
274                 p->n_sue = q->n_sue;
ragge
1.1
275                 }
276
277         ifactions & CVTL ) p = convertpCVTL );
278         ifactions & CVTR ) p = convertpCVTR );
279         ifactions & TYMATCH ) p = tymatch(p);
280         ifactions & PTMATCH ) p = ptmatch(p);
281
282         ifactions & OTHER ){
ragge
1.22
283                 l = p->n_left;
284                 r = p->n_right;
ragge
1.1
285
286                 switch(o){
287
288                 case NAME:
ragge
1.23
289                         sp = spname;
ragge
1.115
290 #ifdef GCC_COMPAT
291                         /* Get a label name */
292                         if (sp->sflags == SLBLNAME) {
293                                 p->n_type = VOID;
294                                 p->n_sue = MKSUE(VOID);
295                                 p->n_lval = 0;
296                                 p->n_sp = sp;
297                                 break;
298                         } else
299 #endif
ragge
1.23
300                         if (sp->stype == UNDEF) {
301                                 uerror("%s undefined"sp->sname);
ragge
1.1
302                                 /* make p look reasonable */
ragge
1.26
303                                 p->n_type = INT;
304                                 p->n_sue = MKSUE(INT);
ragge
1.29
305                                 p->n_df = NULL;
ragge
1.23
306                                 p->n_sp = sp;
ragge
1.22
307                                 p->n_lval = 0;
ragge
1.23
308                                 defid(pSNULL);
ragge
1.1
309                                 break;
ragge
1.23
310                         }
ragge
1.22
311                         p->n_type = sp->stype;
ragge
1.66
312                         p->n_qual = sp->squal;
ragge
1.29
313                         p->n_df = sp->sdf;
ragge
1.26
314                         p->n_sue = sp->ssue;
ragge
1.22
315                         p->n_lval = 0;
ragge
1.23
316                         p->n_sp = sp;
ragge
1.1
317                         /* special case: MOETY is really an ICON... */
ragge
1.23
318                         if (p->n_type == MOETY) {
319                                 p->n_sp = NULL;
320                                 p->n_lval = sp->soffset;
ragge
1.29
321                                 p->n_df = NULL;
ragge
1.22
322                                 p->n_type = ENUMTY;
323                                 p->n_op = ICON;
ragge
1.23
324                         }
ragge
1.1
325                         break;
326
327                 case STREF:
328                         /* p->x turned into *(p+offset) */
329                         /* rhs must be a name; check correctness */
330
ragge
1.23
331                         /* Find member symbol struct */
332                         if (l->n_type != PTR+STRTY && l->n_type != PTR+UNIONTY){
333                                 uerror("struct or union required");
334                                 break;
335                         }
336
ragge
1.26
337                         if ((elem = l->n_sue->suelem) == NULL)
ragge
1.23
338                                 uerror("undefined struct or union");
339
340                         name = r->n_name;
ragge
1.26
341                         for (; *elem != NULLelem++) {
342                                 sp = *elem;
ragge
1.23
343                                 if (sp->sname == name)
344                                         break;
345                         }
ragge
1.26
346                         if (*elem == NULL)
ragge
1.23
347                                 uerror("member '%s' not declared"name);
348
349                         r->n_sp = sp;
350                         p = stref(p);
351                         break;
352
ragge
1.94
353                 case UMUL:
ragge
1.93
354                         if (l->n_op == ADDROF) {
ragge
1.41
355                                 nfree(p);
ragge
1.22
356                                 p = l->n_left;
ragge
1.41
357                                 nfree(l);
358                         }
ragge
1.22
359                         if( !ISPTR(l->n_type))uerror("illegal indirection");
360                         p->n_type = DECREF(l->n_type);
ragge
1.67
361                         p->n_qual = DECREF(l->n_qual);
ragge
1.29
362                         p->n_df = l->n_df;
ragge
1.26
363                         p->n_sue = l->n_sue;
ragge
1.1
364                         break;
365
ragge
1.93
366                 case ADDROF:
ragge
1.22
367                         switchl->n_op ){
ragge
1.1
368
ragge
1.94
369                         case UMUL:
ragge
1.41
370                                 nfree(p);
ragge
1.22
371                                 p = l->n_left;
ragge
1.41
372                                 nfree(l);
ragge
1.1
373                         case NAME:
ragge
1.68
374                                 p->n_type = INCREF(l->n_type);
375                                 p->n_qual = INCQAL(l->n_qual);
ragge
1.29
376                                 p->n_df = l->n_df;
ragge
1.26
377                                 p->n_sue = l->n_sue;
ragge
1.1
378                                 break;
379
380                         case COMOP:
ragge
1.41
381                                 nfree(p);
ragge
1.93
382                                 lr = buildtree(ADDROFl->n_rightNIL);
ragge
1.22
383                                 p = buildtreeCOMOPl->n_leftlr );
ragge
1.41
384                                 nfree(l);
ragge
1.1
385                                 break;
386
387                         case QUEST:
ragge
1.93
388                                 lr = buildtreeADDROFl->n_right->n_rightNIL );
389                                 ll = buildtreeADDROFl->n_right->n_leftNIL );
ragge
1.41
390                                 nfree(p); nfree(l->n_right);
ragge
1.22
391                                 p = buildtreeQUESTl->n_leftbuildtreeCOLONlllr ) );
ragge
1.41
392                                 nfree(l);
ragge
1.1
393                                 break;
394
395                         default:
ragge
1.22
396                                 uerror("unacceptable operand of &: %d"l->n_op );
ragge
1.1
397                                 break;
398                                 }
399                         break;
400
401                 case LS:
ragge
1.50
402                 case RS:
ragge
1.95
403                 case LSEQ:
404                 case RSEQ:
ragge
1.50
405                         if(tsize(p->n_right->n_typep->n_right->n_dfp->n_right->n_sue) > SZINT)
ragge
1.68
406                                 p->n_right = r = makety(rINT00MKSUE(INT));
ragge
1.1
407                         break;
408
409                 case RETURN:
410                 case ASSIGN:
411                 case CAST:
412                         /* structure assignment */
413                         /* take the addresses of the two sides; then make an
ragge
1.2
414                          * operator using STASG and
415                          * the addresses of left and right */
ragge
1.1
416
417                         {
ragge
1.26
418                                 struct suedef *sue;
ragge
1.2
419                                 TWORD t;
ragge
1.29
420                                 union dimfun *d;
ragge
1.1
421
ragge
1.26
422                                 if (l->n_sue != r->n_sue)
423                                         uerror("assignment of different structures");
ragge
1.1
424
ragge
1.93
425                                 r = buildtree(ADDROFrNIL);
ragge
1.22
426                                 t = r->n_type;
ragge
1.29
427                                 d = r->n_df;
ragge
1.26
428                                 sue = r->n_sue;
ragge
1.1
429
ragge
1.28
430                                 l = block(STASGlrtdsue);
ragge
1.1
431
432                                 ifo == RETURN ){
ragge
1.41
433                                         nfree(p);
ragge
1.1
434                                         p = l;
435                                         break;
ragge
1.28
436                                 }
ragge
1.1
437
ragge
1.94
438                                 p->n_op = UMUL;
ragge
1.22
439                                 p->n_left = l;
440                                 p->n_right = NIL;
ragge
1.1
441                                 break;
442                                 }
443                 case COLON:
444                         /* structure colon */
445
ragge
1.26
446                         if (l->n_sue != r->n_sue)
447                                 uerror"type clash in conditional" );
ragge
1.1
448                         break;
449
450                 case CALL:
ragge
1.45
451                         p->n_right = r = strargs(p->n_right);
ragge
1.95
452                 case UCALL:
ragge
1.23
453                         if (!ISPTR(l->n_type))
454                                 uerror("illegal function");
ragge
1.22
455                         p->n_type = DECREF(l->n_type);
ragge
1.23
456                         if (!ISFTN(p->n_type))
457                                 uerror("illegal function");
458                         p->n_type = DECREF(p->n_type);
ragge
1.29
459                         p->n_df = l->n_df;
ragge
1.26
460                         p->n_sue = l->n_sue;
ragge
1.93
461                         if (l->n_op == ADDROF && l->n_left->n_op == NAME &&
ragge
1.23
462                             l->n_left->n_sp != NULL && l->n_left->n_sp != NULL &&
463                             (l->n_left->n_sp->sclass == FORTRAN ||
464                             l->n_left->n_sp->sclass == UFORTRAN)) {
ragge
1.22
465                                 p->n_op += (FORTCALL-CALL);
ragge
1.23
466                         }
467                         if (p->n_type == STRTY || p->n_type == UNIONTY) {
ragge
1.1
468                                 /* function returning structure */
469                                 /*  make function really return ptr to str., with * */
470
ragge
1.22
471                                 p->n_op += STCALL-CALL;
ragge
1.23
472                                 p->n_type = INCREF(p->n_type);
ragge
1.94
473                                 p = buildtree(UMULpNIL);
ragge
1.1
474
475                                 }
476                         break;
477
478                 default:
479                         cerror"other code %d"o );
480                         }
481
482                 }
483
ragge
1.11
484         /*
485          * Allow (void)0 casts.
486          * XXX - anything on the right side must be possible to cast.
487          * XXX - remove void types further on.
488          */
ragge
1.50
489         if (p->n_op == CAST && p->n_type == VOID &&
ragge
1.22
490             p->n_right->n_op == ICON)
ragge
1.50
491                 p->n_right->n_type = VOID;
ragge
1.11
492
ragge
1.68
493         if (actions & CVTO)
494                 p = oconvert(p);
ragge
1.1
495         p = clocal(p);
496
ragge
1.30
497 #ifdef PCC_DEBUG
ragge
1.74
498         if (bdebug) {
499                 printf("End of buildtree:\n");
ragge
1.68
500                 fwalk(peprint0);
ragge
1.74
501         }
ragge
1.30
502 #endif
ragge
1.1
503
504         return(p);
505
506         }
507
ragge
1.107
508 /*
509  * Do a conditional branch.
510  */
511 void
512 cbranch(NODE *pNODE *q)
513 {
514         p = buildtree(CBRANCHpq);
515         if (p->n_left->n_op == ICON) {
516                 if (p->n_left->n_lval != 0)
517                         branch(q->n_lval); /* branch always */
518                 tfree(p);
519                 tfree(q);
520                 return;
521         }
522         ecomp(p);
523 }
524
ragge
1.1
525 NODE *
ragge
1.45
526 strargsp ) register NODE *p;  { /* rewrite structure flavored arguments */
ragge
1.1
527
ragge
1.45
528         ifp->n_op == CM ){
529                 p->n_left = strargsp->n_left );
530                 p->n_right = strargsp->n_right );
ragge
1.1
531                 returnp );
532                 }
533
ragge
1.22
534         ifp->n_type == STRTY || p->n_type == UNIONTY ){
ragge
1.29
535                 p = block(STARGpNILp->n_typep->n_dfp->n_sue);
ragge
1.93
536                 p->n_left = buildtreeADDROFp->n_leftNIL );
ragge
1.1
537                 p = clocal(p);
538                 }
539         returnp );
ragge
1.2
540 }
ragge
1.1
541
ragge
1.2
542 /*
543  * apply the op o to the lval part of p; if binary, rhs is val
544  */
545 int
546 conval(NODE *pint oNODE *q)
547 {
ragge
1.1
548         int iu;
549         CONSZ val;
550
ragge
1.22
551         val = q->n_lval;
552         u = ISUNSIGNED(p->n_type) || ISUNSIGNED(q->n_type);
ragge
1.1
553         ifu && (o==LE||o==LT||o==GE||o==GT)) o += (UGE-GE);
554
ragge
1.23
555         if (p->n_sp != NULL && q->n_sp != NULL)
556                 return(0);
557         if (q->n_sp != NULL && o != PLUS)
558                 return(0);
559         if (p->n_sp != NULL && o != PLUS && o != MINUS)
560                 return(0);
ragge
1.1
561
562         switcho ){
563
564         case PLUS:
ragge
1.22
565                 p->n_lval += val;
ragge
1.23
566                 if (p->n_sp == NULL) {
ragge
1.22
567                         p->n_rval = q->n_rval;
568                         p->n_type = q->n_type;
ragge
1.23
569                 }
ragge
1.1
570                 break;
571         case MINUS:
ragge
1.22
572                 p->n_lval -= val;
ragge
1.1
573                 break;
574         case MUL:
ragge
1.22
575                 p->n_lval *= val;
ragge
1.1
576                 break;
577         case DIV:
ragge
1.46
578                 if (val == 0)
579                         uerror("division by 0");
580                 else 
581                         p->n_lval /= val;
ragge
1.1
582                 break;
583         case MOD:
ragge
1.46
584                 if (val == 0)
585                         uerror("division by 0");
586                 else 
587                         p->n_lval %= val;
ragge
1.1
588                 break;
589         case AND:
ragge
1.22
590                 p->n_lval &= val;
ragge
1.1
591                 break;
592         case OR:
ragge
1.22
593                 p->n_lval |= val;
ragge
1.1
594                 break;
595         case ER:
ragge
1.22
596                 p->n_lval ^= val;
ragge
1.1
597                 break;
598         case LS:
599                 i = val;
ragge
1.22
600                 p->n_lval = p->n_lval << i;
ragge
1.1
601                 break;
602         case RS:
603                 i = val;
ragge
1.46
604                 p->n_lval = p->n_lval >> i;
ragge
1.1
605                 break;
606
ragge
1.94
607         case UMINUS:
ragge
1.22
608                 p->n_lval = - p->n_lval;
ragge
1.1
609                 break;
610         case COMPL:
ragge
1.22
611                 p->n_lval = ~p->n_lval;
ragge
1.1
612                 break;
613         case NOT:
ragge
1.22
614                 p->n_lval = !p->n_lval;
ragge
1.1
615                 break;
616         case LT:
ragge
1.22
617                 p->n_lval = p->n_lval < val;
ragge
1.1
618                 break;
619         case LE:
ragge
1.22
620                 p->n_lval = p->n_lval <= val;
ragge
1.1
621                 break;
622         case GT:
ragge
1.22
623                 p->n_lval = p->n_lval > val;
ragge
1.1
624                 break;
625         case GE:
ragge
1.22
626                 p->n_lval = p->n_lval >= val;
ragge
1.1
627                 break;
628         case ULT:
ragge
1.46
629                 p->n_lval = (p->n_lval-val)<0;
ragge
1.1
630                 break;
631         case ULE:
ragge
1.46
632                 p->n_lval = (p->n_lval-val)<=0;
ragge
1.1
633                 break;
634         case UGT:
ragge
1.46
635                 p->n_lval = (p->n_lval-val)>=0;
ragge
1.1
636                 break;
637         case UGE:
ragge
1.46
638                 p->n_lval = (p->n_lval-val)>0;
ragge
1.1
639                 break;
640         case EQ:
ragge
1.22
641                 p->n_lval = p->n_lval == val;
ragge
1.1
642                 break;
643         case NE:
ragge
1.22
644                 p->n_lval = p->n_lval != val;
ragge
1.1
645                 break;
646         default:
647                 return(0);
648                 }
649         return(1);
650         }
651
ragge
1.7
652 /*
653  * Checks p for the existance of a pun.  This is called when the op of p
654  * is ASSIGN, RETURN, CAST, COLON, or relational.
655  * One case is when enumerations are used: this applies only to lint.
656  * In the other case, one operand is a pointer, the other integer type
657  * we check that this integer is in fact a constant zero...
658  * in the case of ASSIGN, any assignment of pointer to integer is illegal
659  * this falls out, because the LHS is never 0.
660  */
ragge
1.2
661 void
ragge
1.7
662 chkpun(NODE *p)
663 {
ragge
1.29
664         union dimfun *d1, *d2;
ragge
1.2
665         NODE *q;
ragge
1.47
666         int t1t2;
ragge
1.1
667
ragge
1.22
668         t1 = p->n_left->n_type;
669         t2 = p->n_right->n_type;
ragge
1.1
670
ragge
1.56
671         switch (p->n_op) {
672         case RETURN:
673                 /* return of void allowed but nothing else */
ragge
1.52
674                 if (t1 == VOID && t2 == VOID)
675                         return;
676                 if (t1 == VOID)
ragge
1.113
677                         return werror("returning value from void function");
ragge
1.52
678                 if (t2 == VOID)
679                         return uerror("using void value");
ragge
1.56
680         case COLON:
681                 if (t1 == VOID && t2 == VOID)
682                         return;
683                 break;
684         default:
685                 if ((t1 == VOID && t2 != VOID) || (t1 != VOID && t2 == VOID))
686                         return uerror("value of void expression used");
687                 break;
ragge
1.52
688         }
689
690         /* allow void pointer assignments in any direction */
691         if (BTYPE(t1) == VOID && (t2 & TMASK))
692                 return;
693         if (BTYPE(t2) == VOID && (t1 & TMASK))
694                 return;
695
ragge
1.111
696 #ifdef notdef
697         /* C99 says that enums always should be handled as ints */
ragge
1.7
698         /* check for enumerations */
699         if (t1==ENUMTY || t2==ENUMTY) {
ragge
1.58
700                 ifclogopp->n_op ) && p->n_op != EQ && p->n_op != NE ) {
ragge
1.79
701                         werror"comparison of enums" );
ragge
1.47
702                         return;
703                         }
ragge
1.7
704                 if (t1==ENUMTY && t2==ENUMTY) {
ragge
1.26
705                         if (p->n_left->n_sue!=p->n_right->n_sue)
ragge
1.7
706                                 werror("enumeration type clash, "
ragge
1.58
707                                     "operator %s"copst(p->n_op));
ragge
1.1
708                         return;
709                 }
ragge
1.87
710                 if ((t1 == ENUMTY && t2 <= BTMASK) ||
711                     (t2 == ENUMTY && t1 <= BTMASK))
712                         return;
ragge
1.7
713         }
ragge
1.111
714 #endif
ragge
1.1
715
ragge
1.52
716         if (ISPTR(t1) || ISARY(t1))
717                 q = p->n_right;
718         else
719                 q = p->n_left;
ragge
1.1
720
ragge
1.52
721         if (!ISPTR(q->n_type) && !ISARY(q->n_type)) {
ragge
1.22
722                 if (q->n_op != ICON || q->n_lval != 0)
ragge
1.47
723                         werror("illegal combination of pointer and integer");
724         } else {
725                 d1 = p->n_left->n_df;
726                 d2 = p->n_right->n_df;
ragge
1.52
727                 if (t1 == t2) {
728                         if (p->n_left->n_sue != p->n_right->n_sue)
729                                 werror("illegal structure pointer combination");
730                         return;
731                 }
ragge
1.47
732                 for (;;) {
ragge
1.52
733                         if (ISARY(t1) || ISPTR(t1)) {
734                                 if (!ISARY(t2) && !ISPTR(t2))
735                                         break;
ragge
1.47
736                                 if (ISARY(t1) && ISARY(t2) && d1->ddim != d2->ddim) {
737                                         werror("illegal array size combination");
738                                         return;
739                                 }
ragge
1.52
740                                 if (ISARY(t1))
741                                         ++d1;
742                                 if (ISARY(t2))
743                                         ++d2;
ragge
1.47
744                         } else if (ISFTN(t1)) {
745                                 if (chkftn(d1->dfund2->dfun)) {
746                                         werror("illegal function "
747                                             "pointer combination");
748                                         return;
749                                 }
750                                 ++d1;
751                                 ++d2;
ragge
1.52
752                         } else
753                                 break;
ragge
1.47
754                         t1 = DECREF(t1);
755                         t2 = DECREF(t2);
756                 }
757                 werror("illegal pointer combination");
ragge
1.1
758         }
ragge
1.5
759 }
ragge
1.1
760
761 NODE *
ragge
1.10
762 stref(NODE *p)
763 {
ragge
1.41
764         NODE *r;
ragge
1.26
765         struct suedef *sue;
ragge
1.29
766         union dimfun *d;
ragge
1.68
767         TWORD tq;
ragge
1.49
768         int dsc;
ragge
1.1
769         OFFSZ off;
ragge
1.68
770         struct symtab *s;
ragge
1.1
771
772         /* make p->x */
773         /* this is also used to reference automatic variables */
774
ragge
1.68
775         s = p->n_right->n_sp;
ragge
1.41
776         nfree(p->n_right);
777         r = p->n_left;
778         nfree(p);
779         p = pconvert(r);
ragge
1.1
780
781         /* make p look like ptr to x */
782
ragge
1.22
783         if (!ISPTR(p->n_type))
784                 p->n_type = PTR+UNIONTY;
ragge
1.1
785
ragge
1.68
786         t = INCREF(s->stype);
787         q = INCQAL(s->squal);
788         d = s->sdf;
789         sue = s->ssue;
ragge
1.1
790
ragge
1.68
791         p = makety(ptqdsue);
ragge
1.1
792
793         /* compute the offset to be added */
794
ragge
1.68
795         off = s->soffset;
796         dsc = s->sclass;
ragge
1.1
797
ragge
1.49
798         if (dsc & FIELD) {  /* make fields look like ints */
799                 off = (off/ALINT)*ALINT;
ragge
1.26
800                 sue = MKSUE(INT);
ragge
1.10
801         }
ragge
1.68
802         if (off != 0) {
803                 p = block(PLUSpoffcon(offtdsue), tdsue);
804                 p->n_qual = q;
ragge
1.81
805                 p = optim(p);
ragge
1.68
806         }
ragge
1.1
807
ragge
1.94
808         p = buildtree(UMULpNIL);
ragge
1.1
809
810         /* if field, build field info */
811
ragge
1.10
812         if (dsc & FIELD) {
ragge
1.68
813                 p = block(FLDpNILs->stype0s->ssue);
814                 p->n_qual = q;
815                 p->n_rval = PKFIELD(dsc&FLDSIZs->soffset%ALINT);
ragge
1.10
816         }
ragge
1.1
817
ragge
1.19
818         p = clocal(p);
819         return p;
ragge
1.10
820 }
ragge
1.1
821
ragge
1.2
822 int
ragge
1.1
823 notlval(pregister NODE *p; {
824
825         /* return 0 if p an lvalue, 1 otherwise */
826
827         again:
828
ragge
1.22
829         switchp->n_op ){
ragge
1.1
830
831         case FLD:
ragge
1.22
832                 p = p->n_left;
ragge
1.1
833                 goto again;
834
835         case NAME:
836         case OREG:
ragge
1.94
837         case UMUL:
ragge
1.22
838                 ifISARY(p->n_type) || ISFTN(p->n_type) ) return(1);
ragge
1.1
839         case REG:
840                 return(0);
841
842         default:
843                 return(1);
844
845                 }
846
847         }
ragge
1.23
848 /* make a constant node with value i */
ragge
1.1
849 NODE *
ragge
1.23
850 bcon(int i)
851 {
ragge
1.1
852         register NODE *p;
853
ragge
1.26
854         p = block(ICONNILNILINT0MKSUE(INT));
ragge
1.22
855         p->n_lval = i;
ragge
1.23
856         p->n_sp = NULL;
857