Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20030912135244

Diff

Diff from 1.92 to:

Annotations

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

Annotated File View

ragge
1.92
1 /*      $Id: trees.c,v 1.92 2003/09/12 13:52:44 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;
117         struct symtab *sp;
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:
135                 case UNARY MINUS:
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.44
142         } else ifo == UNARY MINUS && 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;
290                         if (sp->stype == UNDEF) {
291                                 uerror("%s undefined"sp->sname);
ragge
1.1
292                                 /* make p look reasonable */
ragge
1.26
293                                 p->n_type = INT;
294                                 p->n_sue = MKSUE(INT);
ragge
1.29
295                                 p->n_df = NULL;
ragge
1.23
296                                 p->n_sp = sp;
ragge
1.22
297                                 p->n_lval = 0;
ragge
1.23
298                                 defid(pSNULL);
ragge
1.1
299                                 break;
ragge
1.23
300                         }
ragge
1.22
301                         p->n_type = sp->stype;
ragge
1.66
302                         p->n_qual = sp->squal;
ragge
1.29
303                         p->n_df = sp->sdf;
ragge
1.26
304                         p->n_sue = sp->ssue;
ragge
1.22
305                         p->n_lval = 0;
ragge
1.23
306                         p->n_sp = sp;
ragge
1.1
307                         /* special case: MOETY is really an ICON... */
ragge
1.23
308                         if (p->n_type == MOETY) {
309                                 p->n_sp = NULL;
310                                 p->n_lval = sp->soffset;
ragge
1.29
311                                 p->n_df = NULL;
ragge
1.22
312                                 p->n_type = ENUMTY;
313                                 p->n_op = ICON;
ragge
1.23
314                         }
ragge
1.89
315                         if (sp->sflags & STNODE) {
316                                 p->n_lval = sp->soffset;
317                                 p->n_op = TEMP;
318                         }
ragge
1.1
319                         break;
320
321                 case STRING:
ragge
1.22
322                         p->n_op = NAME;
ragge
1.17
323 #ifdef CHAR_UNSIGNED
ragge
1.22
324                         p->n_type = UCHAR+ARY;
ragge
1.26
325                         p->n_sue = MKSUE(UCHAR);
ragge
1.17
326 #else
ragge
1.22
327                         p->n_type = CHAR+ARY;
ragge
1.26
328                         p->n_sue = MKSUE(CHAR);
ragge
1.17
329 #endif
ragge
1.22
330                         p->n_lval = 0;
ragge
1.23
331                         p->n_sp = NULL;
ragge
1.1
332                         break;
333
334                 case STREF:
335                         /* p->x turned into *(p+offset) */
336                         /* rhs must be a name; check correctness */
337
ragge
1.23
338                         /* Find member symbol struct */
339                         if (l->n_type != PTR+STRTY && l->n_type != PTR+UNIONTY){
340                                 uerror("struct or union required");
341                                 break;
342                         }
343
ragge
1.26
344                         if ((elem = l->n_sue->suelem) == NULL)
ragge
1.23
345                                 uerror("undefined struct or union");
346
347                         name = r->n_name;
ragge
1.26
348                         for (; *elem != NULLelem++) {
349                                 sp = *elem;
ragge
1.23
350                                 if (sp->sname == name)
351                                         break;
352                         }
ragge
1.26
353                         if (*elem == NULL)
ragge
1.23
354                                 uerror("member '%s' not declared"name);
355
356                         r->n_sp = sp;
357                         p = stref(p);
358                         break;
359
ragge
1.1
360                 case UNARY MUL:
ragge
1.41
361                         if (l->n_op == UNARY AND) {
362                                 nfree(p);
ragge
1.22
363                                 p = l->n_left;
ragge
1.41
364                                 nfree(l);
365                         }
ragge
1.22
366                         if( !ISPTR(l->n_type))uerror("illegal indirection");
367                         p->n_type = DECREF(l->n_type);
ragge
1.67
368                         p->n_qual = DECREF(l->n_qual);
ragge
1.29
369                         p->n_df = l->n_df;
ragge
1.26
370                         p->n_sue = l->n_sue;
ragge
1.1
371                         break;
372
373                 case UNARY AND:
ragge
1.22
374                         switchl->n_op ){
ragge
1.1
375
376                         case UNARY MUL:
ragge
1.41
377                                 nfree(p);
ragge
1.22
378                                 p = l->n_left;
ragge
1.41
379                                 nfree(l);
ragge
1.1
380                         case NAME:
ragge
1.68
381                                 p->n_type = INCREF(l->n_type);
382                                 p->n_qual = INCQAL(l->n_qual);
ragge
1.29
383                                 p->n_df = l->n_df;
ragge
1.26
384                                 p->n_sue = l->n_sue;
ragge
1.1
385                                 break;
386
387                         case COMOP:
ragge
1.41
388                                 nfree(p);
ragge
1.68
389                                 lr = buildtree(UNARY ANDl->n_rightNIL);
ragge
1.22
390                                 p = buildtreeCOMOPl->n_leftlr );
ragge
1.41
391                                 nfree(l);
ragge
1.1
392                                 break;
393
394                         case QUEST:
ragge
1.22
395                                 lr = buildtreeUNARY ANDl->n_right->n_rightNIL );
396                                 ll = buildtreeUNARY ANDl->n_right->n_leftNIL );
ragge
1.41
397                                 nfree(p); nfree(l->n_right);
ragge
1.22
398                                 p = buildtreeQUESTl->n_leftbuildtreeCOLONlllr ) );
ragge
1.41
399                                 nfree(l);
ragge
1.1
400                                 break;
401
402                         default:
ragge
1.22
403                                 uerror("unacceptable operand of &: %d"l->n_op );
ragge
1.1
404                                 break;
405                                 }
406                         break;
407
408                 case LS:
ragge
1.50
409                 case RS:
ragge
1.1
410                 case ASG LS:
411                 case ASG RS:
ragge
1.50
412                         if(tsize(p->n_right->n_typep->n_right->n_dfp->n_right->n_sue) > SZINT)
ragge
1.68
413                                 p->n_right = r = makety(rINT00MKSUE(INT));
ragge
1.1
414                         break;
415
416                 case RETURN:
417                 case ASSIGN:
418                 case CAST:
419                         /* structure assignment */
420                         /* take the addresses of the two sides; then make an
ragge
1.2
421                          * operator using STASG and
422                          * the addresses of left and right */
ragge
1.1
423
424                         {
ragge
1.26
425                                 struct suedef *sue;
ragge
1.2
426                                 TWORD t;
ragge
1.29
427                                 union dimfun *d;
ragge
1.1
428
ragge
1.26
429                                 if (l->n_sue != r->n_sue)
430                                         uerror("assignment of different structures");
ragge
1.1
431
ragge
1.26
432                                 r = buildtree(UNARY ANDrNIL);
ragge
1.22
433                                 t = r->n_type;
ragge
1.29
434                                 d = r->n_df;
ragge
1.26
435                                 sue = r->n_sue;
ragge
1.1
436
ragge
1.28
437                                 l = block(STASGlrtdsue);
ragge
1.1
438
439                                 ifo == RETURN ){
ragge
1.41
440                                         nfree(p);
ragge
1.1
441                                         p = l;
442                                         break;
ragge
1.28
443                                 }
ragge
1.1
444
ragge
1.22
445                                 p->n_op = UNARY MUL;
446                                 p->n_left = l;
447                                 p->n_right = NIL;
ragge
1.1
448                                 break;
449                                 }
450                 case COLON:
451                         /* structure colon */
452
ragge
1.26
453                         if (l->n_sue != r->n_sue)
454                                 uerror"type clash in conditional" );
ragge
1.1
455                         break;
456
457                 case CALL:
ragge
1.45
458                         p->n_right = r = strargs(p->n_right);
ragge
1.1
459                 case UNARY CALL:
ragge
1.23
460                         if (!ISPTR(l->n_type))
461                                 uerror("illegal function");
ragge
1.22
462                         p->n_type = DECREF(l->n_type);
ragge
1.23
463                         if (!ISFTN(p->n_type))
464                                 uerror("illegal function");
465                         p->n_type = DECREF(p->n_type);
ragge
1.29
466                         p->n_df = l->n_df;
ragge
1.26
467                         p->n_sue = l->n_sue;
ragge
1.23
468                         if (l->n_op == UNARY AND && l->n_left->n_op == NAME &&
469                             l->n_left->n_sp != NULL && l->n_left->n_sp != NULL &&
470                             (l->n_left->n_sp->sclass == FORTRAN ||
471                             l->n_left->n_sp->sclass == UFORTRAN)) {
ragge
1.22
472                                 p->n_op += (FORTCALL-CALL);
ragge
1.23
473                         }
474                         if (p->n_type == STRTY || p->n_type == UNIONTY) {
ragge
1.1
475                                 /* function returning structure */
476                                 /*  make function really return ptr to str., with * */
477
ragge
1.22
478                                 p->n_op += STCALL-CALL;
ragge
1.23
479                                 p->n_type = INCREF(p->n_type);
480                                 p = buildtree(UNARY MULpNIL);
ragge
1.1
481
482                                 }
483                         break;
484
485                 default:
486                         cerror"other code %d"o );
487                         }
488
489                 }
490
ragge
1.11
491         /*
492          * Allow (void)0 casts.
493          * XXX - anything on the right side must be possible to cast.
494          * XXX - remove void types further on.
495          */
ragge
1.50
496         if (p->n_op == CAST && p->n_type == VOID &&
ragge
1.22
497             p->n_right->n_op == ICON)
ragge
1.50
498                 p->n_right->n_type = VOID;
ragge
1.11
499
ragge
1.68
500         if (actions & CVTO)
501                 p = oconvert(p);
ragge
1.1
502         p = clocal(p);
503
ragge
1.30
504 #ifdef PCC_DEBUG
ragge
1.74
505         if (bdebug) {
506                 printf("End of buildtree:\n");
ragge
1.68
507                 fwalk(peprint0);
ragge
1.74
508         }
ragge
1.30
509 #endif
ragge
1.1
510
511         return(p);
512
513         }
514
515 NODE *
ragge
1.45
516 strargsp ) register NODE *p;  { /* rewrite structure flavored arguments */
ragge
1.1
517
ragge
1.45
518         ifp->n_op == CM ){
519                 p->n_left = strargsp->n_left );
520                 p->n_right = strargsp->n_right );
ragge
1.1
521                 returnp );
522                 }
523
ragge
1.22
524         ifp->n_type == STRTY || p->n_type == UNIONTY ){
ragge
1.29
525                 p = block(STARGpNILp->n_typep->n_dfp->n_sue);
ragge
1.22
526                 p->n_left = buildtreeUNARY ANDp->n_leftNIL );
ragge
1.1
527                 p = clocal(p);
528                 }
529         returnp );
ragge
1.2
530 }
ragge
1.1
531
ragge
1.2
532 /*
533  * apply the op o to the lval part of p; if binary, rhs is val
534  */
535 int
536 conval(NODE *pint oNODE *q)
537 {
ragge
1.1
538         int iu;
539         CONSZ val;
540
ragge
1.22
541         val = q->n_lval;
542         u = ISUNSIGNED(p->n_type) || ISUNSIGNED(q->n_type);
ragge
1.1
543         ifu && (o==LE||o==LT||o==GE||o==GT)) o += (UGE-GE);
544
ragge
1.23
545         if (p->n_sp != NULL && q->n_sp != NULL)
546                 return(0);
547         if (q->n_sp != NULL && o != PLUS)
548                 return(0);
549         if (p->n_sp != NULL && o != PLUS && o != MINUS)
550                 return(0);
ragge
1.1
551
552         switcho ){
553
554         case PLUS:
ragge
1.22
555                 p->n_lval += val;
ragge
1.23
556                 if (p->n_sp == NULL) {
ragge
1.22
557                         p->n_rval = q->n_rval;
558                         p->n_type = q->n_type;
ragge
1.23
559                 }
ragge
1.1
560                 break;
561         case MINUS:
ragge
1.22
562                 p->n_lval -= val;
ragge
1.1
563                 break;
564         case MUL:
ragge
1.22
565                 p->n_lval *= val;
ragge
1.1
566                 break;
567         case DIV:
ragge
1.46
568                 if (val == 0)
569                         uerror("division by 0");
570                 else 
571                         p->n_lval /= val;
ragge
1.1
572                 break;
573         case MOD:
ragge
1.46
574                 if (val == 0)
575                         uerror("division by 0");
576                 else 
577                         p->n_lval %= val;
ragge
1.1
578                 break;
579         case AND:
ragge
1.22
580                 p->n_lval &= val;
ragge
1.1
581                 break;
582         case OR:
ragge
1.22
583                 p->n_lval |= val;
ragge
1.1
584                 break;
585         case ER:
ragge
1.22
586                 p->n_lval ^= val;
ragge
1.1
587                 break;
588         case LS:
589                 i = val;
ragge
1.22
590                 p->n_lval = p->n_lval << i;
ragge
1.1
591                 break;
592         case RS:
593                 i = val;
ragge
1.46
594                 p->n_lval = p->n_lval >> i;
ragge
1.1
595                 break;
596
597         case UNARY MINUS:
ragge
1.22
598                 p->n_lval = - p->n_lval;
ragge
1.1
599                 break;
600         case COMPL:
ragge
1.22
601                 p->n_lval = ~p->n_lval;
ragge
1.1
602                 break;
603         case NOT:
ragge
1.22
604                 p->n_lval = !p->n_lval;
ragge
1.1
605                 break;
606         case LT:
ragge
1.22
607                 p->n_lval = p->n_lval < val;
ragge
1.1
608                 break;
609         case LE:
ragge
1.22
610                 p->n_lval = p->n_lval <= val;
ragge
1.1
611                 break;
612         case GT:
ragge
1.22
613                 p->n_lval = p->n_lval > val;
ragge
1.1
614                 break;
615         case GE:
ragge
1.22
616                 p->n_lval = p->n_lval >= val;
ragge
1.1
617                 break;
618         case ULT:
ragge
1.46
619                 p->n_lval = (p->n_lval-val)<0;
ragge
1.1
620                 break;
621         case ULE:
ragge
1.46
622                 p->n_lval = (p->n_lval-val)<=0;
ragge
1.1
623                 break;
624         case UGT:
ragge
1.46
625                 p->n_lval = (p->n_lval-val)>=0;
ragge
1.1
626                 break;
627         case UGE:
ragge
1.46
628                 p->n_lval = (p->n_lval-val)>0;
ragge
1.1
629                 break;
630         case EQ:
ragge
1.22
631                 p->n_lval = p->n_lval == val;
ragge
1.1
632                 break;
633         case NE:
ragge
1.22
634                 p->n_lval = p->n_lval != val;
ragge
1.1
635                 break;
636         default:
637                 return(0);
638                 }
639         return(1);
640         }
641
ragge
1.7
642 /*
643  * Checks p for the existance of a pun.  This is called when the op of p
644  * is ASSIGN, RETURN, CAST, COLON, or relational.
645  * One case is when enumerations are used: this applies only to lint.
646  * In the other case, one operand is a pointer, the other integer type
647  * we check that this integer is in fact a constant zero...
648  * in the case of ASSIGN, any assignment of pointer to integer is illegal
649  * this falls out, because the LHS is never 0.
650  */
ragge
1.2
651 void
ragge
1.7
652 chkpun(NODE *p)
653 {
ragge
1.29
654         union dimfun *d1, *d2;
ragge
1.2
655         NODE *q;
ragge
1.47
656         int t1t2;
ragge
1.1
657
ragge
1.22
658         t1 = p->n_left->n_type;
659         t2 = p->n_right->n_type;
ragge
1.1
660
ragge
1.56
661         switch (p->n_op) {
662         case RETURN:
663                 /* return of void allowed but nothing else */
ragge
1.52
664                 if (t1 == VOID && t2 == VOID)
665                         return;
666                 if (t1 == VOID)
667                         return uerror("returning value from void function");
668                 if (t2 == VOID)
669                         return uerror("using void value");
ragge
1.56
670         case COLON:
671                 if (t1 == VOID && t2 == VOID)
672                         return;
673                 break;
674         default:
675                 if ((t1 == VOID && t2 != VOID) || (t1 != VOID && t2 == VOID))
676                         return uerror("value of void expression used");
677                 break;
ragge
1.52
678         }
679
680         /* allow void pointer assignments in any direction */
681         if (BTYPE(t1) == VOID && (t2 & TMASK))
682                 return;
683         if (BTYPE(t2) == VOID && (t1 & TMASK))
684                 return;
685
ragge
1.7
686         /* check for enumerations */
687         if (t1==ENUMTY || t2==ENUMTY) {
ragge
1.58
688                 ifclogopp->n_op ) && p->n_op != EQ && p->n_op != NE ) {
ragge
1.79
689                         werror"comparison of enums" );
ragge
1.47
690                         return;
691                         }
ragge
1.7
692                 if (t1==ENUMTY && t2==ENUMTY) {
ragge
1.26
693                         if (p->n_left->n_sue!=p->n_right->n_sue)
ragge
1.7
694                                 werror("enumeration type clash, "
ragge
1.58
695                                     "operator %s"copst(p->n_op));
ragge
1.1
696                         return;
697                 }
ragge
1.87
698                 if ((t1 == ENUMTY && t2 <= BTMASK) ||
699                     (t2 == ENUMTY && t1 <= BTMASK))
700                         return;
ragge
1.7
701         }
ragge
1.1
702
ragge
1.52
703         if (ISPTR(t1) || ISARY(t1))
704                 q = p->n_right;
705         else
706                 q = p->n_left;
ragge
1.1
707
ragge
1.52
708         if (!ISPTR(q->n_type) && !ISARY(q->n_type)) {
ragge
1.22
709                 if (q->n_op != ICON || q->n_lval != 0)
ragge
1.47
710                         werror("illegal combination of pointer and integer");
711         } else {
712                 d1 = p->n_left->n_df;
713                 d2 = p->n_right->n_df;
ragge
1.52
714                 if (t1 == t2) {
715                         if (p->n_left->n_sue != p->n_right->n_sue)
716                                 werror("illegal structure pointer combination");
717                         return;
718                 }
ragge
1.47
719                 for (;;) {
ragge
1.52
720                         if (ISARY(t1) || ISPTR(t1)) {
721                                 if (!ISARY(t2) && !ISPTR(t2))
722                                         break;
ragge
1.47
723                                 if (ISARY(t1) && ISARY(t2) && d1->ddim != d2->ddim) {
724                                         werror("illegal array size combination");
725                                         return;
726                                 }
ragge
1.52
727                                 if (ISARY(t1))
728                                         ++d1;
729                                 if (ISARY(t2))
730                                         ++d2;
ragge
1.47
731                         } else if (ISFTN(t1)) {
732                                 if (chkftn(d1->dfund2->dfun)) {
733                                         werror("illegal function "
734                                             "pointer combination");
735                                         return;
736                                 }
737                                 ++d1;
738                                 ++d2;
ragge
1.52
739                         } else
740                                 break;
ragge
1.47
741                         t1 = DECREF(t1);
742                         t2 = DECREF(t2);
743                 }
744                 werror("illegal pointer combination");
ragge
1.1
745         }
ragge
1.5
746 }
ragge
1.1
747
748 NODE *
ragge
1.10
749 stref(NODE *p)
750 {
ragge
1.41
751         NODE *r;
ragge
1.26
752         struct suedef *sue;
ragge
1.29
753         union dimfun *d;
ragge
1.68
754         TWORD tq;
ragge
1.49
755         int dsc;
ragge
1.1
756         OFFSZ off;
ragge
1.68
757         struct symtab *s;
ragge
1.1
758
759         /* make p->x */
760         /* this is also used to reference automatic variables */
761
ragge
1.68
762         s = p->n_right->n_sp;
ragge
1.41
763         nfree(p->n_right);
764         r = p->n_left;
765         nfree(p);
766         p = pconvert(r);
ragge
1.1
767
768         /* make p look like ptr to x */
769
ragge
1.22
770         if (!ISPTR(p->n_type))
771                 p->n_type = PTR+UNIONTY;
ragge
1.1
772
ragge
1.68
773         t = INCREF(s->stype);
774         q = INCQAL(s->squal);
775         d = s->sdf;
776         sue = s->ssue;
ragge
1.1
777
ragge
1.68
778         p = makety(ptqdsue);
ragge
1.1
779
780         /* compute the offset to be added */
781
ragge
1.68
782         off = s->soffset;
783         dsc = s->sclass;
ragge
1.1
784
ragge
1.49
785         if (dsc & FIELD) {  /* make fields look like ints */
786                 off = (off/ALINT)*ALINT;
ragge
1.26
787                 sue = MKSUE(INT);
ragge
1.10
788         }
ragge
1.68
789         if (off != 0) {
790                 p = block(PLUSpoffcon(offtdsue), tdsue);
791                 p->n_qual = q;
ragge
1.81
792                 p = optim(p);
ragge
1.68
793         }
ragge
1.1
794
ragge
1.10
795         p = buildtree(UNARY MULpNIL);
ragge
1.1
796
797         /* if field, build field info */
798
ragge
1.10
799         if (dsc & FIELD) {
ragge
1.68
800                 p = block(FLDpNILs->stype0s->ssue);
801                 p->n_qual = q;
802                 p->n_rval = PKFIELD(dsc&FLDSIZs->soffset%ALINT);
ragge
1.10
803         }
ragge
1.1
804
ragge
1.19
805         p = clocal(p);
806         return p;
ragge
1.10
807 }
ragge
1.1
808
ragge
1.2
809 int
ragge
1.1
810 notlval(pregister NODE *p; {
811
812         /* return 0 if p an lvalue, 1 otherwise */
813
814         again:
815
ragge
1.22
816         switchp->n_op ){
ragge
1.1
817
818         case FLD:
ragge
1.22
819                 p = p->n_left;
ragge
1.1
820                 goto again;
821
822         case NAME:
823         case OREG:
ragge
1.49
824         case UNARY MUL:
ragge
1.22
825                 ifISARY(p->n_type) || ISFTN(p->n_type) ) return(1);
ragge
1.55
826         case TEMP:
ragge
1.1
827         case REG:
828                 return(0);
829
830         default:
831                 return(1);
832
833                 }
834
835         }
ragge
1.23
836 /* make a constant node with value i */
ragge
1.1
837 NODE *
ragge
1.23
838 bcon(int i)
839 {
ragge
1.1
840         register NODE *p;
841
ragge
1.26
842         p = block(ICONNILNILINT0MKSUE(INT));
ragge
1.22
843         p->n_lval = i;
ragge
1.23
844         p->n_sp = NULL;
845         return(clocal(p));
846 }
ragge
1.1
847
848 NODE *
ragge
1.10
849 bpsize(NODE *p)
850 {
ragge
1.29
851         return(offcon(psize(p), p->n_typep->n_dfp->n_sue));
ragge
1.10
852 }
ragge
1.1
853
ragge
1.10
854 /*
855  * p is a node of type pointer; psize returns the
856  * size of the thing pointed to
857  */
ragge
1.1
858