Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20050801163332

Diff

Diff from 1.31 to:

Annotations

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

Annotated File View

ragge
1.31
1 /*      $Id: local.c,v 1.31 2005/08/01 16:33:32 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.11
170 #if 0
ragge
1.6
171                 if ((p->n_type == INT || p->n_type == UNSIGNED) &&
172                     ISPTR(l->n_type)) {
173                         nfree(p);
174                         return l;
ragge
1.4
175                 }
ragge
1.11
176 #endif
ragge
1.4
177
ragge
1.3
178                 o = l->n_op;
ragge
1.4
179                 m = p->n_type;
ragge
1.1
180
181                 if (o == ICON) {
182                         CONSZ val = l->n_lval;
183
ragge
1.29
184                         if (!ISPTR(m)) /* Pointers don't need to be conv'd */
185                             switch (m) {
ragge
1.1
186                         case CHAR:
187                                 l->n_lval = (char)val;
188                                 break;
189                         case UCHAR:
190                                 l->n_lval = val & 0377;
191                                 break;
ragge
1.15
192                         case SHORT:
ragge
1.1
193                                 l->n_lval = (short)val;
194                                 break;
ragge
1.15
195                         case USHORT:
ragge
1.1
196                                 l->n_lval = val & 0177777;
197                                 break;
ragge
1.15
198                         case ULONG:
ragge
1.1
199                         case UNSIGNED:
200                                 l->n_lval = val & 0xffffffff;
201                                 break;
202                         case ENUMTY:
203                         case MOETY:
ragge
1.15
204                         case LONG:
ragge
1.1
205                         case INT:
206                                 l->n_lval = (int)val;
207                                 break;
208                         case LONGLONG:
209                                 l->n_lval = (long long)val;
ragge
1.15
210                                 break;
ragge
1.1
211                         case ULONGLONG:
212                                 l->n_lval = val;
213                                 break;
214                         case VOID:
215                                 break;
ragge
1.14
216                         case LDOUBLE:
ragge
1.1
217                         case DOUBLE:
218                         case FLOAT:
219                                 l->n_op = FCON;
220                                 l->n_dcon = val;
221                                 break;
222                         default:
223                                 cerror("unknown type %d"m);
224                         }
225                         l->n_type = m;
226                         nfree(p);
227                         return l;
228                 }
ragge
1.17
229                 if (DEUNSIGN(p->n_type) == SHORT &&
230                     DEUNSIGN(l->n_type) == SHORT) {
231                         nfree(p);
232                         p = l;
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:
256                 if (xnewreg) {
257                         /* put return value in return reg */
258                         p->n_op = ASSIGN;
259                         p->n_right = p->n_left;
260                         p->n_left = block(REGNILNILp->n_type,
261                             0MKSUE(INT));
262                 }
263                 break;
ragge
1.1
264         }
ragge
1.24
265 //printf("ut:\n");
266 //fwalk(p, eprint, 0);
ragge
1.1
267
268         return(p);
269 }
270
271 void
272 myp2tree(NODE *p)
273 {
274 }
275
276 /*ARGSUSED*/
277 int
278 andable(NODE *p)
279 {
280         return(1);  /* all names can have & taken on them */
281 }
282
283 /*
284  * at the end of the arguments of a ftn, set the automatic offset
285  */
286 void
287 cendarg()
288 {
289         autooff = AUTOINIT;
290 }
291
292 /*
293  * is an automatic variable of type t OK for a register variable
294  */
295 int
296 cisreg(TWORD t)
297 {
ragge
1.13
298         if (t == INT || t == UNSIGNED || t == LONG || t == ULONG)
299                 return(1);
300         return 0/* XXX - fix reg assignment in pftn.c */
ragge
1.1
301 }
302
303 /*
304  * return a node, for structure references, which is suitable for
305  * being added to a pointer of type t, in order to be off bits offset
306  * into a structure
307  * t, d, and s are the type, dimension offset, and sizeoffset
308  * For pdp10, return the type-specific index number which calculation
309  * is based on its size. For example, short a[3] would return 3.
310  * Be careful about only handling first-level pointers, the following
311  * indirections must be fullword.
312  */
313 NODE *
314 offcon(OFFSZ offTWORD tunion dimfun *dstruct suedef *sue)
315 {
316         register NODE *p;
317
318         if (xdebug)
319                 printf("offcon: OFFSZ %lld type %x dim %p siz %d\n",
320                     offtdsue->suesize);
321
322         p = bcon(0);
323         p->n_lval = off/SZCHAR/* Default */
324         return(p);
325 }
326
327 /*
328  * Allocate off bits on the stack.  p is a tree that when evaluated
329  * is the multiply count for off, t is a NAME node where to write
330  * the allocated address.
331  */
332 void
333 spalloc(NODE *tNODE *pOFFSZ off)
334 {
335         NODE *sp;
336
337         if ((off % SZINT) == 0)
338                 p =  buildtree(MULpbcon(off/SZINT));
339         else if ((off % SZSHORT) == 0) {
340                 p = buildtree(MULpbcon(off/SZSHORT));
341                 p = buildtree(PLUSpbcon(1));
342                 p = buildtree(RSpbcon(1));
343         } else if ((off % SZCHAR) == 0) {
344                 p = buildtree(MULpbcon(off/SZCHAR));
345                 p = buildtree(PLUSpbcon(3));
346                 p = buildtree(RSpbcon(2));
347         } else
348                 cerror("roundsp");
349
350         /* save the address of sp */
351         sp = block(REGNILNILPTR+INTt->n_dft->n_sue);
352         sp->n_lval = 0;
353         sp->n_rval = STKREG;
354         t->n_type = sp->n_type;
355         ecomp(buildtree(ASSIGNtsp)); /* Emit! */
356
357         /* add the size to sp */
358         sp = block(REGNILNILp->n_type00);
359         sp->n_lval = 0;
360         sp->n_rval = STKREG;
361         ecomp(buildtree(PLUSEQspp));
362 }
363
364 /*
ragge
1.21
365  * print out a constant node
366  * mat be associated with a label
367  */
368 void
369 ninval(NODE *p)
370 {
ragge
1.24
371         struct symtab *q;
ragge
1.23
372         TWORD t;
373
ragge
1.21
374         p = p->n_left;
ragge
1.23
375         t = p->n_type;
376         if (t > BTMASK)
377                 t = INT/* pointer */
378
379         switch (t) {
ragge
1.21
380         case LONGLONG:
381         case ULONGLONG:
382                 inval(p->n_lval & 0xffffffff);
383                 inval(p->n_lval >> 32);
384                 break;
385         case INT:
386         case UNSIGNED:
387                 printf("\t.long 0x%x", (int)p->n_lval);
ragge
1.24
388                 if ((q = p->n_sp) != NULL) {
389                         if ((q->sclass == STATIC && q->slevel > 0) ||
390                             q->sclass == ILABEL) {
391                                 printf("+" LABFMTq->soffset);
ragge
1.21
392                         } else
ragge
1.24
393                                 printf("+%s"exname(q->sname));
ragge
1.21
394                 }
395                 printf("\n");
396                 break;
397         default:
398                 cerror("ninval");
399         }
400 }
401
402 /*
ragge
1.17
403  * print out an integer.
ragge
1.1
404  */
405 void
ragge
1.17
406 inval(CONSZ word)
ragge
1.1
407 {
ragge
1.17
408         word &= 0xffffffff;
409         printf("        .long 0x%llx\n"word);
ragge
1.1
410 }
411
ragge
1.17
412 /* output code to initialize a floating point value */
ragge
1.1
413 /* the proper alignment has been obtained */
414 void
ragge
1.17
415 finval(NODE *p)
ragge
1.1
416 {
ragge
1.17
417         switch (p->n_type) {
418         case LDOUBLE:
419                 printf("\t.tfloat\t0t%.20Le\n"p->n_dcon);
ragge
1.14
420                 break;
ragge
1.17
421         case DOUBLE:
422                 printf("\t.dfloat\t0d%.20e\n", (double)p->n_dcon);
ragge
1.14
423                 break;
ragge
1.17
424         case FLOAT:
425                 printf("\t.ffloat\t0f%.20e\n", (float)p->n_dcon);
ragge
1.14
426                 break;
427         }
ragge
1.1
428 }
429
430 /* make a name look like an external name in the local machine */
431 char *
432 exname(char *p)
433 {
434         if (p == NULL)
435                 return "";
436         return p;
437 }
438
439 /*
440  * map types which are not defined on the local machine
441  */
ragge
1.15
442 TWORD
ragge
1.1
443 ctype(TWORD type)
444 {
445         switch (BTYPE(type)) {
446         case LONG:
447                 MODTYPE(type,INT);
448                 break;
449
450         case ULONG:
451                 MODTYPE(type,UNSIGNED);
ragge
1.13
452
ragge
1.1
453         }
454         return (type);
455 }
456
457 /* curid is a variable which is defined but
458  * is not initialized (and not a function );
ragge
1.17
459  * This routine returns the storage class for an uninitialized declaration
ragge
1.1
460  */
461 int
462 noinit()
463 {
464         return(EXTERN);
465 }
466
pj
1.30
467 void
468 calldec(NODE *pNODE *q
469 {
470 }
471
472 void
473 extdec(struct symtab *q)
474 {
475 }
476
ragge
1.1
477 /* make a common declaration for id, if reasonable */
478 void
479 commdec(struct symtab *q)
480 {
481         int off;
482
483         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
484         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.7
485 #ifdef GCC_COMPAT
486         printf("        .comm %s,0%o\n"gcc_findname(q), off);
487 #else
ragge
1.1
488         printf("        .comm %s,0%o\n"exname(q->sname), off);
ragge
1.7
489 #endif
ragge
1.1
490 }
491
492 /* make a local common declaration for id, if reasonable */
493 void
494 lcommdec(struct symtab *q)
495 {
496         int off;
497
498         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
499         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.1
500         if (q->slevel == 0)
ragge
1.7
501 #ifdef GCC_COMPAT
502                 printf("        .lcomm %s,0%o\n"gcc_findname(q), off);
503 #else
ragge
1.1
504                 printf("        .lcomm %s,0%o\n"exname(q->sname), off);
ragge
1.7
505 #endif
ragge
1.1
506         else
507                 printf("        .lcomm " LABFMT ",0%o\n"q->soffsetoff);
508 }
ragge
1.22
509
510 /*
511  * print a (non-prog) label.
512  */
513 void
514 deflab1(int label)
515 {
516         printf(LABFMT ":\n"label);
517 }
518
ragge
1.28
519 static char *loctbl[] = { "text""data""section .rodata""section .rodata" };
ragge
1.27
520
ragge
1.23
521 void
522 setloc1(int locc)
523 {
524         if (locc == lastloc)
525                 return;
526         lastloc = locc;
ragge
1.27
527         printf("        .%s\n"loctbl[locc]);
ragge
1.23
528 }
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-11-01 10:49 +0100