Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20060128072712

Diff

Diff from 1.36 to:

Annotations

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

Annotated File View

ragge
1.36
1 /*      $Id: local.c,v 1.36 2006/01/28 07:27:12 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;
52         register int mml;
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.10
90         case FUNARG:
91                 /* Args smaller than int are given as int */
92                 if (p->n_type != CHAR && p->n_type != UCHAR && 
93                     p->n_type != SHORT && p->n_type != USHORT)
94                         break;
95                 p->n_left = block(SCONVp->n_leftNILINT0MKSUE(INT));
96                 p->n_type = INT;
97                 p->n_sue = MKSUE(INT);
98                 p->n_rval = SZINT;
99                 break;
100
ragge
1.8
101         case CBRANCH:
102                 l = p->n_left;
103
104                 /*
105                  * Remove unneccessary conversion ops.
106                  */
ragge
1.10
107                 if (clogop(l->n_op) && l->n_left->n_op == SCONV) {
ragge
1.12
108                         if (coptype(l->n_op) != BITYPE)
109                                 break;
ragge
1.8
110                         if (l->n_right->n_op == ICON) {
111                                 r = l->n_left->n_left;
ragge
1.24
112                                 if (r->n_type >= FLOAT && r->n_type <= LDOUBLE)
113                                         break;
ragge
1.18
114                                 /* Type must be correct */
ragge
1.19
115                                 t = r->n_type;
ragge
1.8
116                                 nfree(l->n_left);
117                                 l->n_left = r;
ragge
1.19
118                                 l->n_type = t;
119                                 l->n_right->n_type = t;
ragge
1.17
120                         }
121 #if 0
122                           else if (l->n_right->n_op == SCONV &&
ragge
1.8
123                             l->n_left->n_type == l->n_right->n_type) {
124                                 r = l->n_left->n_left;
125                                 nfree(l->n_left);
126                                 l->n_left = r;
127                                 r = l->n_right->n_left;
128                                 nfree(l->n_right);
129                                 l->n_right = r;
130                         }
ragge
1.17
131 #endif
ragge
1.8
132                 }
133                 break;
134
ragge
1.1
135         case PCONV:
ragge
1.2
136                 ml = p->n_left->n_type;
ragge
1.1
137                 l = p->n_left;
138                 if ((ml == CHAR || ml == UCHAR || ml == SHORT || ml == USHORT)
139                     && l->n_op != ICON)
140                         break;
141                 l->n_type = p->n_type;
142                 l->n_qual = p->n_qual;
143                 l->n_df = p->n_df;
144                 l->n_sue = p->n_sue;
145                 nfree(p);
146                 p = l;
147                 break;
148
149         case SCONV:
150                 l = p->n_left;
ragge
1.4
151
ragge
1.25
152                 if (p->n_type == l->n_type) {
153                         nfree(p);
154                         return l;
155                 }
156
ragge
1.4
157                 if ((p->n_type & TMASK) == 0 && (l->n_type & TMASK) == 0 &&
pj
1.30
158                     btdims[p->n_type].suesize == btdims[l->n_type].suesize) {
ragge
1.4
159                         if (p->n_type != FLOAT && p->n_type != DOUBLE &&
ragge
1.15
160                             l->n_type != FLOAT && l->n_type != DOUBLE &&
161                             l->n_type != LDOUBLE && p->n_type != LDOUBLE) {
162                                 if (l->n_op == NAME || l->n_op == UMUL) {
163                                         l->n_type = p->n_type;
164                                         nfree(p);
165                                         return l;
166                                 }
ragge
1.4
167                         }
ragge
1.6
168                 }
169
ragge
1.3
170                 o = l->n_op;
ragge
1.4
171                 m = p->n_type;
ragge
1.1
172
173                 if (o == ICON) {
174                         CONSZ val = l->n_lval;
175
ragge
1.29
176                         if (!ISPTR(m)) /* Pointers don't need to be conv'd */
177                             switch (m) {
ragge
1.1
178                         case CHAR:
179                                 l->n_lval = (char)val;
180                                 break;
181                         case UCHAR:
182                                 l->n_lval = val & 0377;
183                                 break;
ragge
1.15
184                         case SHORT:
ragge
1.1
185                                 l->n_lval = (short)val;
186                                 break;
ragge
1.15
187                         case USHORT:
ragge
1.1
188                                 l->n_lval = val & 0177777;
189                                 break;
ragge
1.15
190                         case ULONG:
ragge
1.1
191                         case UNSIGNED:
192                                 l->n_lval = val & 0xffffffff;
193                                 break;
194                         case ENUMTY:
195                         case MOETY:
ragge
1.15
196                         case LONG:
ragge
1.1
197                         case INT:
198                                 l->n_lval = (int)val;
199                                 break;
200                         case LONGLONG:
201                                 l->n_lval = (long long)val;
ragge
1.15
202                                 break;
ragge
1.1
203                         case ULONGLONG:
204                                 l->n_lval = val;
205                                 break;
206                         case VOID:
207                                 break;
ragge
1.14
208                         case LDOUBLE:
ragge
1.1
209                         case DOUBLE:
210                         case FLOAT:
211                                 l->n_op = FCON;
212                                 l->n_dcon = val;
213                                 break;
214                         default:
215                                 cerror("unknown type %d"m);
216                         }
217                         l->n_type = m;
218                         nfree(p);
219                         return l;
220                 }
ragge
1.17
221                 if (DEUNSIGN(p->n_type) == SHORT &&
222                     DEUNSIGN(l->n_type) == SHORT) {
223                         nfree(p);
224                         p = l;
225                 }
ragge
1.36
226                 if ((p->n_type == CHAR || p->n_type == UCHAR ||
227                     p->n_type == SHORT || p->n_type == USHORT) &&
228                     (l->n_type == FLOAT || l->n_type == DOUBLE ||
229                     l->n_type == LDOUBLE)) {
230                         p = block(SCONVpNILp->n_typep->n_dfp->n_sue);
231                         p->n_left->n_type = INT;
232                         return p;
233                 }
ragge
1.1
234                 break;
235
ragge
1.15
236         case MOD:
237         case DIV:
238                 if (o == DIV && p->n_type != CHAR && p->n_type != SHORT)
239                         break;
ragge
1.16
240                 if (o == MOD && p->n_type != CHAR && p->n_type != SHORT)
ragge
1.15
241                         break;
242                 /* make it an int division by inserting conversions */
243                 p->n_left = block(SCONVp->n_leftNILINT0MKSUE(INT));
244                 p->n_right = block(SCONVp->n_rightNILINT0MKSUE(INT));
245                 p = block(SCONVpNILp->n_type0MKSUE(p->n_type));
246                 p->n_left->n_type = INT;
247                 break;
248
ragge
1.1
249         case PMCONV:
250         case PVCONV:
251                 ifp->n_right->n_op != ICON ) cerror"bad conversion"0);
252                 nfree(p);
253                 return(buildtree(o==PMCONV?MUL:DIVp->n_leftp->n_right));
254
ragge
1.31
255         case FORCE:
ragge
1.32
256                 /* put return value in return reg */
257                 p->n_op = ASSIGN;
258                 p->n_right = p->n_left;
259                 p->n_left = block(REGNILNILp->n_type0MKSUE(INT));
ragge
1.35
260                 p->n_left->n_rval = RETREG(p->n_type);
ragge
1.31
261                 break;
ragge
1.1
262         }
ragge
1.24
263 //printf("ut:\n");
264 //fwalk(p, eprint, 0);
ragge
1.1
265
266         return(p);
267 }
268
269 void
270 myp2tree(NODE *p)
271 {
272 }
273
274 /*ARGSUSED*/
275 int
276 andable(NODE *p)
277 {
278         return(1);  /* all names can have & taken on them */
279 }
280
281 /*
282  * at the end of the arguments of a ftn, set the automatic offset
283  */
284 void
285 cendarg()
286 {
287         autooff = AUTOINIT;
288 }
289
290 /*
ragge
1.36
291  * Return 1 if a variable of type type is OK to put in register.
292  */
293 int
294 cisreg(TWORD t)
295 {
296         if (t == FLOAT || t == DOUBLE || t == LDOUBLE)
297                 return 0/* not yet */
298         return 1;
299 }
300
301 /*
ragge
1.1
302  * return a node, for structure references, which is suitable for
303  * being added to a pointer of type t, in order to be off bits offset
304  * into a structure
305  * t, d, and s are the type, dimension offset, and sizeoffset
306  * For pdp10, return the type-specific index number which calculation
307  * is based on its size. For example, short a[3] would return 3.
308  * Be careful about only handling first-level pointers, the following
309  * indirections must be fullword.
310  */
311 NODE *
312 offcon(OFFSZ offTWORD tunion dimfun *dstruct suedef *sue)
313 {
314         register NODE *p;
315
316         if (xdebug)
317                 printf("offcon: OFFSZ %lld type %x dim %p siz %d\n",
318                     offtdsue->suesize);
319
320         p = bcon(0);
321         p->n_lval = off/SZCHAR/* Default */
322         return(p);
323 }
324
325 /*
326  * Allocate off bits on the stack.  p is a tree that when evaluated
327  * is the multiply count for off, t is a NAME node where to write
328  * the allocated address.
329  */
330 void
331 spalloc(NODE *tNODE *pOFFSZ off)
332 {
333         NODE *sp;
334
335         if ((off % SZINT) == 0)
336                 p =  buildtree(MULpbcon(off/SZINT));
337         else if ((off % SZSHORT) == 0) {
338                 p = buildtree(MULpbcon(off/SZSHORT));
339                 p = buildtree(PLUSpbcon(1));
340                 p = buildtree(RSpbcon(1));
341         } else if ((off % SZCHAR) == 0) {
342                 p = buildtree(MULpbcon(off/SZCHAR));
343                 p = buildtree(PLUSpbcon(3));
344                 p = buildtree(RSpbcon(2));
345         } else
346                 cerror("roundsp");
347
348         /* save the address of sp */
349         sp = block(REGNILNILPTR+INTt->n_dft->n_sue);
350         sp->n_lval = 0;
351         sp->n_rval = STKREG;
352         t->n_type = sp->n_type;
353         ecomp(buildtree(ASSIGNtsp)); /* Emit! */
354
355         /* add the size to sp */
356         sp = block(REGNILNILp->n_type00);
357         sp->n_lval = 0;
358         sp->n_rval = STKREG;
359         ecomp(buildtree(PLUSEQspp));
360 }
361
362 /*
ragge
1.21
363  * print out a constant node
364  * mat be associated with a label
365  */
366 void
367 ninval(NODE *p)
368 {
ragge
1.24
369         struct symtab *q;
ragge
1.23
370         TWORD t;
371
ragge
1.21
372         p = p->n_left;
ragge
1.23
373         t = p->n_type;
374         if (t > BTMASK)
375                 t = INT/* pointer */
376
377         switch (t) {
ragge
1.21
378         case LONGLONG:
379         case ULONGLONG:
380                 inval(p->n_lval & 0xffffffff);
381                 inval(p->n_lval >> 32);
382                 break;
383         case INT:
384         case UNSIGNED:
385                 printf("\t.long 0x%x", (int)p->n_lval);
ragge
1.24
386                 if ((q = p->n_sp) != NULL) {
387                         if ((q->sclass == STATIC && q->slevel > 0) ||
388                             q->sclass == ILABEL) {
389                                 printf("+" LABFMTq->soffset);
ragge
1.21
390                         } else
ragge
1.24
391                                 printf("+%s"exname(q->sname));
ragge
1.21
392                 }
393                 printf("\n");
394                 break;
395         default:
396                 cerror("ninval");
397         }
398 }
399
400 /*
ragge
1.17
401  * print out an integer.
ragge
1.1
402  */
403 void
ragge
1.17
404 inval(CONSZ word)
ragge
1.1
405 {
ragge
1.17
406         word &= 0xffffffff;
407         printf("        .long 0x%llx\n"word);
ragge
1.1
408 }
409
ragge
1.17
410 /* output code to initialize a floating point value */
ragge
1.1
411 /* the proper alignment has been obtained */
412 void
ragge
1.17
413 finval(NODE *p)
ragge
1.1
414 {
ragge
1.17
415         switch (p->n_type) {
416         case LDOUBLE:
417                 printf("\t.tfloat\t0t%.20Le\n"p->n_dcon);
ragge
1.14
418                 break;
ragge
1.17
419         case DOUBLE:
420                 printf("\t.dfloat\t0d%.20e\n", (double)p->n_dcon);
ragge
1.14
421                 break;
ragge
1.17
422         case FLOAT:
423                 printf("\t.ffloat\t0f%.20e\n", (float)p->n_dcon);
ragge
1.14
424                 break;
425         }
ragge
1.1
426 }
427
428 /* make a name look like an external name in the local machine */
429 char *
430 exname(char *p)
431 {
432         if (p == NULL)
433                 return "";
434         return p;
435 }
436
437 /*
438  * map types which are not defined on the local machine
439  */
ragge
1.15
440 TWORD
ragge
1.1
441 ctype(TWORD type)
442 {
443         switch (BTYPE(type)) {
444         case LONG:
445                 MODTYPE(type,INT);
446                 break;
447
448         case ULONG:
449                 MODTYPE(type,UNSIGNED);
ragge
1.13
450
ragge
1.1
451         }
452         return (type);
453 }
454
455 /* curid is a variable which is defined but
456  * is not initialized (and not a function );
ragge
1.17
457  * This routine returns the storage class for an uninitialized declaration
ragge
1.1
458  */
459 int
460 noinit()
461 {
462         return(EXTERN);
463 }
464
pj
1.30
465 void
466 calldec(NODE *pNODE *q
467 {
468 }
469
470 void
471 extdec(struct symtab *q)
472 {
473 }
474
ragge
1.1
475 /* make a common declaration for id, if reasonable */
476 void
477 commdec(struct symtab *q)
478 {
479         int off;
480
481         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
482         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.7
483 #ifdef GCC_COMPAT
484         printf("        .comm %s,0%o\n"gcc_findname(q), off);
485 #else
ragge
1.1
486         printf("        .comm %s,0%o\n"exname(q->sname), off);
ragge
1.7
487 #endif
ragge
1.1
488 }
489
490 /* make a local common declaration for id, if reasonable */
491 void
492 lcommdec(struct symtab *q)
493 {
494         int off;
495
496         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
497         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.1
498         if (q->slevel == 0)
ragge
1.7
499 #ifdef GCC_COMPAT
500                 printf("        .lcomm %s,0%o\n"gcc_findname(q), off);
501 #else
ragge
1.1
502                 printf("        .lcomm %s,0%o\n"exname(q->sname), off);
ragge
1.7
503 #endif
ragge
1.1
504         else
505                 printf("        .lcomm " LABFMT ",0%o\n"q->soffsetoff);
506 }
ragge
1.22
507
508 /*
509  * print a (non-prog) label.
510  */
511 void
512 deflab1(int label)
513 {
514         printf(LABFMT ":\n"label);
515 }
516
ragge
1.28
517 static char *loctbl[] = { "text""data""section .rodata""section .rodata" };
ragge
1.27
518
ragge
1.23
519 void
520 setloc1(int locc)
521 {
522         if (locc == lastloc)
523                 return;
524         lastloc = locc;
ragge
1.27
525         printf("        .%s\n"loctbl[locc]);
ragge
1.23
526 }
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-10-31 14:35 +0100