Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20060710075526

Diff

Diff from 1.43 to:

Annotations

Annotate by Age | Author | Mixed | None
/fisheye/browse/pcc/pcc/arch/i386/local.c

Annotated File View

ragge
1.43
1 /*      $Id: local.c,v 1.43 2006/07/10 07:55:26 ragge Exp $     */
ragge
1.1
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 # include "pass1.h"
31
32 /*      this file contains code which is dependent on the target machine */
33
34 NODE *
35 clocal(NODE *p)
36 {
37         /* this is called to do local transformations on
38            an expression tree preparitory to its being
39            written out in intermediate code.
40         */
41
42         /* the major essential job is rewriting the
43            automatic variables and arguments in terms of
44            REG and OREG nodes */
45         /* conversion ops which are not necessary are also clobbered here */
46         /* in addition, any special features (such as rewriting
47            exclusive or) are easily handled here as well */
48
49         register struct symtab *q;
ragge
1.2
50         register NODE *r, *l;
ragge
1.1
51         register int o;
ragge
1.40
52         register int m;
ragge
1.19
53         TWORD t;
ragge
1.1
54
ragge
1.24
55 //printf("in:\n");
56 //fwalk(p, eprint, 0);
ragge
1.1
57         switcho = p->n_op ){
58
59         case NAME:
60                 if ((q = p->n_sp) == NULL)
61                         return p/* Nothing to care about */
62
63                 switch (q->sclass) {
64
65                 case PARAM:
66                 case AUTO:
67                         /* fake up a structure reference */
68                         r = block(REGNILNILPTR+STRTY00);
69                         r->n_lval = 0;
70                         r->n_rval = FPREG;
71                         p = stref(block(STREFrp000));
72                         break;
73
74                 case STATIC:
75                         if (q->slevel == 0)
76                                 break;
77                         p->n_lval = 0;
78                         p->n_sp = q;
79                         break;
80
81                 case REGISTER:
82                         p->n_op = REG;
83                         p->n_lval = 0;
84                         p->n_rval = q->soffset;
85                         break;
86
87                         }
88                 break;
89
ragge
1.39
90         case STCALL:
ragge
1.37
91         case CALL:
92                 /* Fix function call arguments. On x86, just add funarg */
93                 for (r = p->n_rightr->n_op == CMr = r->n_left) {
ragge
1.38
94                         if (r->n_right->n_op != STARG &&
95                             r->n_right->n_op != FUNARG)
ragge
1.37
96                                 r->n_right = block(FUNARGr->n_rightNIL
97                                     r->n_right->n_typer->n_right->n_df,
98                                     r->n_right->n_sue);
99                 }
ragge
1.38
100                 if (r->n_op != STARG && r->n_op != FUNARG) {
ragge
1.37
101                         l = talloc();
102                         *l = *r;
103                         r->n_op = FUNARGr->n_left = lr->n_type = l->n_type;
104                 }
ragge
1.10
105                 break;
ragge
1.37
106                 
ragge
1.8
107         case CBRANCH:
108                 l = p->n_left;
109
110                 /*
111                  * Remove unneccessary conversion ops.
112                  */
ragge
1.10
113                 if (clogop(l->n_op) && l->n_left->n_op == SCONV) {
ragge
1.12
114                         if (coptype(l->n_op) != BITYPE)
115                                 break;
ragge
1.8
116                         if (l->n_right->n_op == ICON) {
117                                 r = l->n_left->n_left;
ragge
1.24
118                                 if (r->n_type >= FLOAT && r->n_type <= LDOUBLE)
119                                         break;
ragge
1.18
120                                 /* Type must be correct */
ragge
1.19
121                                 t = r->n_type;
ragge
1.8
122                                 nfree(l->n_left);
123                                 l->n_left = r;
ragge
1.19
124                                 l->n_type = t;
125                                 l->n_right->n_type = t;
ragge
1.17
126                         }
ragge
1.8
127                 }
128                 break;
129
ragge
1.1
130         case PCONV:
ragge
1.40
131                 /* Remove redundant PCONV's. Be careful */
ragge
1.1
132                 l = p->n_left;
ragge
1.40
133                 if (l->n_op == ICON) {
134                         l->n_lval = (unsigned)l->n_lval;
135                         goto delp;
136                 }
137                 if (l->n_type < INT || l->n_type == LONGLONG || 
138                     l->n_type == ULONGLONG) {
139                         /* float etc? */
140                         p->n_left = block(SCONVlNIL,
141                             UNSIGNED0MKSUE(UNSIGNED));
142                         break;
143                 }
144                 /* if left is SCONV, cannot remove */
145                 if (l->n_op == SCONV)
ragge
1.1
146                         break;
ragge
1.40
147                 /* if conversion to another pointer type, just remove */
148                 if (p->n_type > BTMASK && l->n_type > BTMASK)
149                         goto delp;
150                 break;
151
152         delp:   l->n_type = p->n_type;
ragge
1.1
153                 l->n_qual = p->n_qual;
154                 l->n_df = p->n_df;
155                 l->n_sue = p->n_sue;
156                 nfree(p);
157                 p = l;
158                 break;
ragge
1.40
159                 
ragge
1.1
160         case SCONV:
161                 l = p->n_left;
ragge
1.4
162
ragge
1.25
163                 if (p->n_type == l->n_type) {
164                         nfree(p);
165                         return l;
166                 }
167
ragge
1.4
168                 if ((p->n_type & TMASK) == 0 && (l->n_type & TMASK) == 0 &&
pj
1.30
169                     btdims[p->n_type].suesize == btdims[l->n_type].suesize) {
ragge
1.4
170                         if (p->n_type != FLOAT && p->n_type != DOUBLE &&
ragge
1.15
171                             l->n_type != FLOAT && l->n_type != DOUBLE &&
172                             l->n_type != LDOUBLE && p->n_type != LDOUBLE) {
ragge
1.41
173                                 if (l->n_op == NAME || l->n_op == UMUL ||
174                                     l->n_op == TEMP) {
ragge
1.15
175                                         l->n_type = p->n_type;
176                                         nfree(p);
177                                         return l;
178                                 }
ragge
1.4
179                         }
ragge
1.6
180                 }
181
ragge
1.42
182                 if (DEUNSIGN(p->n_type) == INT && DEUNSIGN(l->n_type) == INT &&
183                     coptype(l->n_op) == BITYPE) {
184                         l->n_type = p->n_type;
185                         nfree(p);
186                         return l;
187                 }
188
ragge
1.3
189                 o = l->n_op;
ragge
1.4
190                 m = p->n_type;
ragge
1.1
191
192                 if (o == ICON) {
193                         CONSZ val = l->n_lval;
194
ragge
1.29
195                         if (!ISPTR(m)) /* Pointers don't need to be conv'd */
196                             switch (m) {
ragge
1.1
197                         case CHAR:
198                                 l->n_lval = (char)val;
199                                 break;
200                         case UCHAR:
201                                 l->n_lval = val & 0377;
202                                 break;
ragge
1.15
203                         case SHORT:
ragge
1.1
204                                 l->n_lval = (short)val;
205                                 break;
ragge
1.15
206                         case USHORT:
ragge
1.1
207                                 l->n_lval = val & 0177777;
208                                 break;
ragge
1.15
209                         case ULONG:
ragge
1.1
210                         case UNSIGNED:
211                                 l->n_lval = val & 0xffffffff;
212                                 break;
213                         case ENUMTY:
214                         case MOETY:
ragge
1.15
215                         case LONG:
ragge
1.1
216                         case INT:
217                                 l->n_lval = (int)val;
218                                 break;
219                         case LONGLONG:
220                                 l->n_lval = (long long)val;
ragge
1.15
221                                 break;
ragge
1.1
222                         case ULONGLONG:
223                                 l->n_lval = val;
224                                 break;
225                         case VOID:
226                                 break;
ragge
1.14
227                         case LDOUBLE:
ragge
1.1
228                         case DOUBLE:
229                         case FLOAT:
230                                 l->n_op = FCON;
231                                 l->n_dcon = val;
232                                 break;
233                         default:
234                                 cerror("unknown type %d"m);
235                         }
236                         l->n_type = m;
237                         nfree(p);
238                         return l;
239                 }
ragge
1.17
240                 if (DEUNSIGN(p->n_type) == SHORT &&
241                     DEUNSIGN(l->n_type) == SHORT) {
242                         nfree(p);
243                         p = l;
244                 }
ragge
1.36
245                 if ((p->n_type == CHAR || p->n_type == UCHAR ||
246                     p->n_type == SHORT || p->n_type == USHORT) &&
247                     (l->n_type == FLOAT || l->n_type == DOUBLE ||
248                     l->n_type == LDOUBLE)) {
249                         p = block(SCONVpNILp->n_typep->n_dfp->n_sue);
250                         p->n_left->n_type = INT;
251                         return p;
252                 }
ragge
1.1
253                 break;
254
ragge
1.15
255         case MOD:
256         case DIV:
257                 if (o == DIV && p->n_type != CHAR && p->n_type != SHORT)
258                         break;
ragge
1.16
259                 if (o == MOD && p->n_type != CHAR && p->n_type != SHORT)
ragge
1.15
260                         break;
261                 /* make it an int division by inserting conversions */
262                 p->n_left = block(SCONVp->n_leftNILINT0MKSUE(INT));
263                 p->n_right = block(SCONVp->n_rightNILINT0MKSUE(INT));
264                 p = block(SCONVpNILp->n_type0MKSUE(p->n_type));
265                 p->n_left->n_type = INT;
266                 break;
267
ragge
1.1
268         case PMCONV:
269         case PVCONV:
270                 ifp->n_right->n_op != ICON ) cerror"bad conversion"0);
271                 nfree(p);
272                 return(buildtree(o==PMCONV?MUL:DIVp->n_leftp->n_right));
273
ragge
1.31
274         case FORCE:
ragge
1.32
275                 /* put return value in return reg */
276                 p->n_op = ASSIGN;
277                 p->n_right = p->n_left;
278                 p->n_left = block(REGNILNILp->n_type0MKSUE(INT));
ragge
1.35
279                 p->n_left->n_rval = RETREG(p->n_type);
ragge
1.31
280                 break;
ragge
1.39
281
282         case LS:
283         case RS:
284                 /* shift count must be in a char
285                  * unless longlong, where it must be int */
286                 if (p->n_right->n_op == ICON)
287                         break/* do not do anything */
288                 if (p->n_type == LONGLONG || p->n_type == ULONGLONG) {
289                         if (p->n_right->n_type != INT)
290                                 p->n_right = block(SCONVp->n_rightNIL,
291                                     INT0MKSUE(INT));
292                         break;
293                 }
294                 if (p->n_right->n_type == CHAR || p->n_right->n_type == UCHAR)
295                         break;
296                 p->n_right = block(SCONVp->n_rightNIL,
297                     CHAR0MKSUE(CHAR));
298                 break;
ragge
1.1
299         }
ragge
1.24
300 //printf("ut:\n");
301 //fwalk(p, eprint, 0);
ragge
1.1
302
303         return(p);
304 }
305
306 void
307 myp2tree(NODE *p)
308 {
309 }
310
311 /*ARGSUSED*/
312 int
313 andable(NODE *p)
314 {
315         return(1);  /* all names can have & taken on them */
316 }
317
318 /*
319  * at the end of the arguments of a ftn, set the automatic offset
320  */
321 void
322 cendarg()
323 {
324         autooff = AUTOINIT;
325 }
326
327 /*
ragge
1.36
328  * Return 1 if a variable of type type is OK to put in register.
329  */
330 int
331 cisreg(TWORD t)
332 {
333         if (t == FLOAT || t == DOUBLE || t == LDOUBLE)
334                 return 0/* not yet */
335         return 1;
336 }
337
338 /*
ragge
1.1
339  * return a node, for structure references, which is suitable for
340  * being added to a pointer of type t, in order to be off bits offset
341  * into a structure
342  * t, d, and s are the type, dimension offset, and sizeoffset
343  * For pdp10, return the type-specific index number which calculation
344  * is based on its size. For example, short a[3] would return 3.
345  * Be careful about only handling first-level pointers, the following
346  * indirections must be fullword.
347  */
348 NODE *
349 offcon(OFFSZ offTWORD tunion dimfun *dstruct suedef *sue)
350 {
351         register NODE *p;
352
353         if (xdebug)
354                 printf("offcon: OFFSZ %lld type %x dim %p siz %d\n",
355                     offtdsue->suesize);
356
357         p = bcon(0);
358         p->n_lval = off/SZCHAR/* Default */
359         return(p);
360 }
361
362 /*
363  * Allocate off bits on the stack.  p is a tree that when evaluated
364  * is the multiply count for off, t is a NAME node where to write
365  * the allocated address.
366  */
367 void
368 spalloc(NODE *tNODE *pOFFSZ off)
369 {
370         NODE *sp;
371
372         if ((off % SZINT) == 0)
373                 p =  buildtree(MULpbcon(off/SZINT));
374         else if ((off % SZSHORT) == 0) {
375                 p = buildtree(MULpbcon(off/SZSHORT));
376                 p = buildtree(PLUSpbcon(1));
377                 p = buildtree(RSpbcon(1));
378         } else if ((off % SZCHAR) == 0) {
379                 p = buildtree(MULpbcon(off/SZCHAR));
380                 p = buildtree(PLUSpbcon(3));
381                 p = buildtree(RSpbcon(2));
382         } else
383                 cerror("roundsp");
384
385         /* save the address of sp */
386         sp = block(REGNILNILPTR+INTt->n_dft->n_sue);
387         sp->n_lval = 0;
388         sp->n_rval = STKREG;
389         t->n_type = sp->n_type;
390         ecomp(buildtree(ASSIGNtsp)); /* Emit! */
391
392         /* add the size to sp */
393         sp = block(REGNILNILp->n_type00);
394         sp->n_lval = 0;
395         sp->n_rval = STKREG;
396         ecomp(buildtree(PLUSEQspp));
397 }
398
399 /*
ragge
1.21
400  * print out a constant node
401  * mat be associated with a label
402  */
403 void
404 ninval(NODE *p)
405 {
ragge
1.24
406         struct symtab *q;
ragge
1.23
407         TWORD t;
408
ragge
1.21
409         p = p->n_left;
ragge
1.23
410         t = p->n_type;
411         if (t > BTMASK)
412                 t = INT/* pointer */
413
ragge
1.40
414         if (p->n_op != ICON)
415                 cerror("ninval: init node not constant");
416
ragge
1.23
417         switch (t) {
ragge
1.21
418         case LONGLONG:
419         case ULONGLONG:
420                 inval(p->n_lval & 0xffffffff);
421                 inval(p->n_lval >> 32);
422                 break;
423         case INT:
424         case UNSIGNED:
425                 printf("\t.long 0x%x", (int)p->n_lval);
ragge
1.24
426                 if ((q = p->n_sp) != NULL) {
427                         if ((q->sclass == STATIC && q->slevel > 0) ||
428                             q->sclass == ILABEL) {
429                                 printf("+" LABFMTq->soffset);
ragge
1.21
430                         } else
ragge
1.24
431                                 printf("+%s"exname(q->sname));
ragge
1.21
432                 }
433                 printf("\n");
434                 break;
435         default:
436                 cerror("ninval");
437         }
438 }
439
440 /*
ragge
1.17
441  * print out an integer.
ragge
1.1
442  */
443 void
ragge
1.17
444 inval(CONSZ word)
ragge
1.1
445 {
ragge
1.17
446         word &= 0xffffffff;
447         printf("        .long 0x%llx\n"word);
ragge
1.1
448 }
449
ragge
1.17
450 /* output code to initialize a floating point value */
ragge
1.1
451 /* the proper alignment has been obtained */
452 void
ragge
1.17
453 finval(NODE *p)
ragge
1.1
454 {
ragge
1.43
455         union { float fdouble dlong double lint i[3]; } u;
456
ragge
1.17
457         switch (p->n_type) {
458         case LDOUBLE:
ragge
1.43
459                 u.i[2] = 0;
460                 u.l = (long double)p->n_dcon;
461                 printf("\t.long\t0x%x,0x%x,0x%x\n"u.i[0], u.i[1], u.i[2]);
ragge
1.14
462                 break;
ragge
1.17
463         case DOUBLE:
ragge
1.43
464                 u.d = (double)p->n_dcon;
465                 printf("\t.long\t0x%x,0x%x\n"u.i[0], u.i[1]);
ragge
1.14
466                 break;
ragge
1.17
467         case FLOAT:
ragge
1.43
468                 u.f = (float)p->n_dcon;
469                 printf("\t.long\t0x%x\n"u.i[0]);
ragge
1.14
470                 break;
471         }
ragge
1.1
472 }
473
474 /* make a name look like an external name in the local machine */
475 char *
476 exname(char *p)
477 {
478         if (p == NULL)
479                 return "";
480         return p;
481 }
482
483 /*
484  * map types which are not defined on the local machine
485  */
ragge
1.15
486 TWORD
ragge
1.1
487 ctype(TWORD type)
488 {
489         switch (BTYPE(type)) {
490         case LONG:
491                 MODTYPE(type,INT);
492                 break;
493
494         case ULONG:
495                 MODTYPE(type,UNSIGNED);
ragge
1.13
496
ragge
1.1
497         }
498         return (type);
499 }
500
501 /* curid is a variable which is defined but
502  * is not initialized (and not a function );
ragge
1.17
503  * This routine returns the storage class for an uninitialized declaration
ragge
1.1
504  */
505 int
506 noinit()
507 {
508         return(EXTERN);
509 }
510
pj
1.30
511 void
512 calldec(NODE *pNODE *q
513 {
514 }
515
516 void
517 extdec(struct symtab *q)
518 {
519 }
520
ragge
1.1
521 /* make a common declaration for id, if reasonable */
522 void
523 commdec(struct symtab *q)
524 {
525         int off;
526
527         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
528         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.7
529 #ifdef GCC_COMPAT
530         printf("        .comm %s,0%o\n"gcc_findname(q), off);
531 #else
ragge
1.1
532         printf("        .comm %s,0%o\n"exname(q->sname), off);
ragge
1.7
533 #endif
ragge
1.1
534 }
535
536 /* make a local common declaration for id, if reasonable */
537 void
538 lcommdec(struct symtab *q)
539 {
540         int off;
541
542         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
543         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.1
544         if (q->slevel == 0)
ragge
1.7
545 #ifdef GCC_COMPAT
546                 printf("        .lcomm %s,0%o\n"gcc_findname(q), off);
547 #else
ragge
1.1
548                 printf("        .lcomm %s,0%o\n"exname(q->sname), off);
ragge
1.7
549 #endif
ragge
1.1
550         else
551                 printf("        .lcomm " LABFMT ",0%o\n"q->soffsetoff);
552 }
ragge
1.22
553
554 /*
555  * print a (non-prog) label.
556  */
557 void
558 deflab1(int label)
559 {
560         printf(LABFMT ":\n"label);
561 }
562
ragge
1.28
563 static char *loctbl[] = { "text""data""section .rodata""section .rodata" };
ragge
1.27
564
ragge
1.23
565 void
566 setloc1(int locc)
567 {
568         if (locc == lastloc)
569                 return;
570         lastloc = locc;
ragge
1.27
571         printf("        .%s\n"loctbl[locc]);
ragge
1.23
572 }
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-10 21:29 +0200