Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20070819192522

Diff

Diff from 1.53 to:

Annotations

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

Annotated File View

ragge
1.53
1 /*      $Id: local.c,v 1.53 2007/08/19 19:25:22 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
ragge
1.48
30 #include "pass1.h"
ragge
1.1
31
32 /*      this file contains code which is dependent on the target machine */
33
ragge
1.48
34 /* clocal() is called to do local transformations on
35  * an expression tree preparitory to its being
36  * written out in intermediate code.
37  *
38  * the major essential job is rewriting the
39  * automatic variables and arguments in terms of
40  * REG and OREG nodes
41  * conversion ops which are not necessary are also clobbered here
42  * in addition, any special features (such as rewriting
43  * exclusive or) are easily handled here as well
44  */
ragge
1.1
45 NODE *
46 clocal(NODE *p)
47 {
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.52
197                         case BOOL:
198                                 l->n_lval = l->n_lval != 0;
199                                 break;
ragge
1.1
200                         case CHAR:
201                                 l->n_lval = (char)val;
202                                 break;
203                         case UCHAR:
204                                 l->n_lval = val & 0377;
205                                 break;
ragge
1.15
206                         case SHORT:
ragge
1.1
207                                 l->n_lval = (short)val;
208                                 break;
ragge
1.15
209                         case USHORT:
ragge
1.1
210                                 l->n_lval = val & 0177777;
211                                 break;
ragge
1.15
212                         case ULONG:
ragge
1.1
213                         case UNSIGNED:
214                                 l->n_lval = val & 0xffffffff;
215                                 break;
216                         case ENUMTY:
217                         case MOETY:
ragge
1.15
218                         case LONG:
ragge
1.1
219                         case INT:
220                                 l->n_lval = (int)val;
221                                 break;
222                         case LONGLONG:
223                                 l->n_lval = (long long)val;
ragge
1.15
224                                 break;
ragge
1.1
225                         case ULONGLONG:
226                                 l->n_lval = val;
227                                 break;
228                         case VOID:
229                                 break;
ragge
1.14
230                         case LDOUBLE:
ragge
1.1
231                         case DOUBLE:
232                         case FLOAT:
233                                 l->n_op = FCON;
234                                 l->n_dcon = val;
235                                 break;
236                         default:
237                                 cerror("unknown type %d"m);
238                         }
239                         l->n_type = m;
ragge
1.44
240                         l->n_sue = MKSUE(m);
ragge
1.1
241                         nfree(p);
242                         return l;
243                 }
ragge
1.17
244                 if (DEUNSIGN(p->n_type) == SHORT &&
245                     DEUNSIGN(l->n_type) == SHORT) {
246                         nfree(p);
247                         p = l;
248                 }
ragge
1.36
249                 if ((p->n_type == CHAR || p->n_type == UCHAR ||
250                     p->n_type == SHORT || p->n_type == USHORT) &&
251                     (l->n_type == FLOAT || l->n_type == DOUBLE ||
252                     l->n_type == LDOUBLE)) {
253                         p = block(SCONVpNILp->n_typep->n_dfp->n_sue);
254                         p->n_left->n_type = INT;
255                         return p;
256                 }
ragge
1.1
257                 break;
258
ragge
1.15
259         case MOD:
260         case DIV:
261                 if (o == DIV && p->n_type != CHAR && p->n_type != SHORT)
262                         break;
ragge
1.16
263                 if (o == MOD && p->n_type != CHAR && p->n_type != SHORT)
ragge
1.15
264                         break;
265                 /* make it an int division by inserting conversions */
266                 p->n_left = block(SCONVp->n_leftNILINT0MKSUE(INT));
267                 p->n_right = block(SCONVp->n_rightNILINT0MKSUE(INT));
268                 p = block(SCONVpNILp->n_type0MKSUE(p->n_type));
269                 p->n_left->n_type = INT;
270                 break;
271
ragge
1.1
272         case PMCONV:
273         case PVCONV:
274                 ifp->n_right->n_op != ICON ) cerror"bad conversion"0);
275                 nfree(p);
276                 return(buildtree(o==PMCONV?MUL:DIVp->n_leftp->n_right));
277
ragge
1.31
278         case FORCE:
ragge
1.32
279                 /* put return value in return reg */
280                 p->n_op = ASSIGN;
281                 p->n_right = p->n_left;
282                 p->n_left = block(REGNILNILp->n_type0MKSUE(INT));
ragge
1.53
283                 p->n_left->n_rval = p->n_left->n_type == BOOL ? 
284                     RETREG(CHAR) : RETREG(p->n_type);
ragge
1.31
285                 break;
ragge
1.39
286
287         case LS:
288         case RS:
289                 /* shift count must be in a char
290                  * unless longlong, where it must be int */
291                 if (p->n_right->n_op == ICON)
292                         break/* do not do anything */
293                 if (p->n_type == LONGLONG || p->n_type == ULONGLONG) {
294                         if (p->n_right->n_type != INT)
295                                 p->n_right = block(SCONVp->n_rightNIL,
296                                     INT0MKSUE(INT));
297                         break;
298                 }
299                 if (p->n_right->n_type == CHAR || p->n_right->n_type == UCHAR)
300                         break;
301                 p->n_right = block(SCONVp->n_rightNIL,
302                     CHAR0MKSUE(CHAR));
303                 break;
ragge
1.1
304         }
ragge
1.24
305 //printf("ut:\n");
306 //fwalk(p, eprint, 0);
ragge
1.1
307
308         return(p);
309 }
310
311 void
312 myp2tree(NODE *p)
313 {
314 }
315
316 /*ARGSUSED*/
317 int
318 andable(NODE *p)
319 {
320         return(1);  /* all names can have & taken on them */
321 }
322
323 /*
324  * at the end of the arguments of a ftn, set the automatic offset
325  */
326 void
327 cendarg()
328 {
329         autooff = AUTOINIT;
330 }
331
332 /*
ragge
1.36
333  * Return 1 if a variable of type type is OK to put in register.
334  */
335 int
336 cisreg(TWORD t)
337 {
338         if (t == FLOAT || t == DOUBLE || t == LDOUBLE)
339                 return 0/* not yet */
340         return 1;
341 }
342
343 /*
ragge
1.1
344  * return a node, for structure references, which is suitable for
345  * being added to a pointer of type t, in order to be off bits offset
346  * into a structure
347  * t, d, and s are the type, dimension offset, and sizeoffset
348  * For pdp10, return the type-specific index number which calculation
349  * is based on its size. For example, short a[3] would return 3.
350  * Be careful about only handling first-level pointers, the following
351  * indirections must be fullword.
352  */
353 NODE *
354 offcon(OFFSZ offTWORD tunion dimfun *dstruct suedef *sue)
355 {
356         register NODE *p;
357
358         if (xdebug)
359                 printf("offcon: OFFSZ %lld type %x dim %p siz %d\n",
360                     offtdsue->suesize);
361
362         p = bcon(0);
363         p->n_lval = off/SZCHAR/* Default */
364         return(p);
365 }
366
367 /*
368  * Allocate off bits on the stack.  p is a tree that when evaluated
ragge
1.45
369  * is the multiply count for off, t is a storeable node where to write
ragge
1.1
370  * the allocated address.
371  */
372 void
373 spalloc(NODE *tNODE *pOFFSZ off)
374 {
375         NODE *sp;
376
ragge
1.45
377         p = buildtree(MULpbcon(off/SZCHAR)); /* XXX word alignment? */
378
379         /* sub the size from sp */
380         sp = block(REGNILNILp->n_type00);
381         sp->n_lval = 0;
382         sp->n_rval = STKREG;
383         ecomp(buildtree(MINUSEQspp));
ragge
1.1
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 }
393
ragge
1.49
394 #if 0
ragge
1.48
395 /*
396  * Print out an integer constant of size size.
397  * can only be sizes <= SZINT.
398  */
ragge
1.47
399 void
400 indata(CONSZ valint size)
401 {
402         switch (size) {
403         case SZCHAR:
404                 printf("\t.byte %d\n", (int)val & 0xff);
405                 break;
406         case SZSHORT:
407                 printf("\t.word %d\n", (int)val & 0xffff);
408                 break;
409         case SZINT:
410                 printf("\t.long %d\n", (int)val & 0xffffffff);
411                 break;
412         default:
413                 cerror("indata");
414         }
415 }
ragge
1.49
416 #endif
ragge
1.47
417
ragge
1.1
418 /*
ragge
1.48
419  * Print out a string of characters.
420  * Assume that the assembler understands C-style escape
421  * sequences.  Location is already set.
422  */
423 void
424 instring(char *str)
425 {
426         char *s;
427
428         /* be kind to assemblers and avoid long strings */
429         printf("\t.ascii \"");
ragge
1.51
430         for (s = str; *s != 0; ) {
431                 if (*s++ == '\\') {
ragge
1.48
432                         (void)esccon(&s);
ragge
1.51
433                 }
ragge
1.48
434                 if (s - str > 64) {
435                         fwrite(str1s - strstdout);
436                         printf("\"\n\t.ascii \"");
437                         str = s;
438                 }
439         }
440         fwrite(str1s - strstdout);
441         printf("\\0\"\n");
442 }
443
ragge
1.49
444 static int inbitsinval;
445
446 /*
447  * set fsz bits in sequence to zero.
448  */
449 void
450 zbits(OFFSZ offint fsz)
451 {
452         int m;
453
454         if (idebug)
ragge
1.51
455                 printf("zbits off %lld, fsz %d inbits %d\n"offfszinbits);
ragge
1.49
456         if ((m = (inbits % SZCHAR))) {
457                 m = SZCHAR - m;
458                 if (fsz < m) {
ragge
1.51
459                         inbits += fsz;
ragge
1.49
460                         return;
461                 } else {
462                         fsz -= m;
463                         printf("\t.byte %d\n"inval);
464                         inval = inbits = 0;
465                 }
466         }
467         if (fsz >= SZCHAR) {
468                 printf("\t.zero %d\n"fsz/SZCHAR);
ragge
1.51
469                 fsz -= (fsz/SZCHAR) * SZCHAR;
ragge
1.49
470         }
471         if (fsz) {
472                 inval = 0;
473                 inbits = fsz;
474         }
475 }
476
477 /*
478  * Initialize a bitfield.
479  */
480 void
481 infld(CONSZ offint fszCONSZ val)
482 {
483         if (idebug)
ragge
1.51
484                 printf("infld off %lld, fsz %d, val %lld inbits %d\n",
485                     offfszvalinbits);
ragge
1.49
486         val &= (1 << fsz)-1;
487         while (fsz + inbits >= SZCHAR) {
488                 inval |= (val << inbits);
489                 printf("\t.byte %d\n"inval & 255);
490                 fsz -= (SZCHAR - inbits);
491                 val >>= (SZCHAR - inbits);
492                 inval = inbits = 0;
493         }
ragge
1.51
494         if (fsz) {
495                 inval |= (val << inbits);
496                 inbits += fsz;
497         }
ragge
1.49
498 }
499
ragge
1.48
500 /*
ragge
1.46
501  * print out a constant node, may be associated with a label.
502  * Do not free the node after use.
ragge
1.49
503  * off is bit offset from the beginning of the aggregate
504  * fsz is the number of bits this is referring to
ragge
1.21
505  */
506 void
ragge
1.49
507 ninval(CONSZ offint fszNODE *p)
ragge
1.21
508 {
ragge
1.46
509         union { float fdouble dlong double lint i[3]; } u;
ragge
1.24
510         struct symtab *q;
ragge
1.23
511         TWORD t;
ragge
1.46
512         int i;
ragge
1.23
513
514         t = p->n_type;
515         if (t > BTMASK)
516                 t = INT/* pointer */
517
ragge
1.46
518         if (p->n_op != ICON && p->n_op != FCON)
ragge
1.40
519                 cerror("ninval: init node not constant");
520
ragge
1.49
521         if (p->n_op == ICON && p->n_sp != NULL && DEUNSIGN(t) != INT)
ragge
1.46
522                 uerror("element not constant");
523
ragge
1.23
524         switch (t) {
ragge
1.21
525         case LONGLONG:
526         case ULONGLONG:
ragge
1.46
527                 i = (p->n_lval >> 32);
528                 p->n_lval &= 0xffffffff;
ragge
1.51
529                 p->n_type = INT;
ragge
1.49
530                 ninval(off32p);
ragge
1.46
531                 p->n_lval = i;
ragge
1.49
532                 ninval(off+3232p);
ragge
1.21
533                 break;
534         case INT:
535         case UNSIGNED:
536                 printf("\t.long 0x%x", (int)p->n_lval);
ragge
1.24
537                 if ((q = p->n_sp) != NULL) {
538                         if ((q->sclass == STATIC && q->slevel > 0) ||
539                             q->sclass == ILABEL) {
540                                 printf("+" LABFMTq->soffset);
ragge
1.21
541                         } else
ragge
1.24
542                                 printf("+%s"exname(q->sname));
ragge
1.21
543                 }
544                 printf("\n");
545                 break;
ragge
1.46
546         case SHORT:
547         case USHORT:
548                 printf("\t.short 0x%x\n", (int)p->n_lval & 0xffff);
549                 break;
ragge
1.52
550         case BOOL:
551                 if (p->n_lval > 1)
552                         p->n_lval = p->n_lval != 0;
553                 /* FALLTHROUGH */
ragge
1.46
554         case CHAR:
555         case UCHAR:
ragge
1.50
556                 printf("\t.byte %d\n", (int)p->n_lval & 0xff);
ragge
1.46
557                 break;
558         case LDOUBLE:
559                 u.i[2] = 0;
560                 u.l = (long double)p->n_dcon;
561                 printf("\t.long\t0x%x,0x%x,0x%x\n"u.i[0], u.i[1], u.i[2]);
562                 break;
563         case DOUBLE:
564                 u.d = (double)p->n_dcon;
565                 printf("\t.long\t0x%x,0x%x\n"u.i[0], u.i[1]);
566                 break;
567         case FLOAT:
568                 u.f = (float)p->n_dcon;
569                 printf("\t.long\t0x%x\n"u.i[0]);
570                 break;
ragge
1.21
571         default:
572                 cerror("ninval");
573         }
574 }
575
ragge
1.46
576 #if 0
ragge
1.21
577 /*
ragge
1.17
578  * print out an integer.
ragge
1.1
579  */
580 void
ragge
1.17
581 inval(CONSZ word)
ragge
1.1
582 {
ragge
1.17
583         word &= 0xffffffff;
584         printf("        .long 0x%llx\n"word);
ragge
1.1
585 }
586
ragge
1.17
587 /* output code to initialize a floating point value */
ragge
1.1
588 /* the proper alignment has been obtained */
589 void
ragge
1.17
590 finval(NODE *p)
ragge
1.1
591 {
ragge
1.43
592         union { float fdouble dlong double lint i[3]; } u;
593
ragge
1.17
594         switch (p->n_type) {
595         case LDOUBLE:
ragge
1.43
596                 u.i[2] = 0;
597                 u.l = (long double)p->n_dcon;
598                 printf("\t.long\t0x%x,0x%x,0x%x\n"u.i[0], u.i[1], u.i[2]);
ragge
1.14
599                 break;
ragge
1.17
600         case DOUBLE:
ragge
1.43
601                 u.d = (double)p->n_dcon;
602                 printf("\t.long\t0x%x,0x%x\n"u.i[0], u.i[1]);
ragge
1.14
603                 break;
ragge
1.17
604         case FLOAT:
ragge
1.43
605                 u.f = (float)p->n_dcon;
606                 printf("\t.long\t0x%x\n"u.i[0]);
ragge
1.14
607                 break;
608         }
ragge
1.1
609 }
ragge
1.46
610 #endif
ragge
1.1
611
612 /* make a name look like an external name in the local machine */
613 char *
614 exname(char *p)
615 {
616         if (p == NULL)
617                 return "";
618         return p;
619 }
620
621 /*
622  * map types which are not defined on the local machine
623  */
ragge
1.15
624 TWORD
ragge
1.1
625 ctype(TWORD type)
626 {
627         switch (BTYPE(type)) {
628         case LONG:
629                 MODTYPE(type,INT);
630                 break;
631
632         case ULONG:
633                 MODTYPE(type,UNSIGNED);
ragge
1.13
634
ragge
1.1
635         }
636         return (type);
637 }
638
639 /* curid is a variable which is defined but
640  * is not initialized (and not a function );
ragge
1.17
641  * This routine returns the storage class for an uninitialized declaration
ragge
1.1
642  */
643 int
644 noinit()
645 {
646         return(EXTERN);
647 }
648
pj
1.30
649 void
650 calldec(NODE *pNODE *q
651 {
652 }
653
654 void
655 extdec(struct symtab *q)
656 {
657 }
658
ragge
1.1
659 /* make a common declaration for id, if reasonable */
660 void
661 commdec(struct symtab *q)
662 {
663         int off;
664
665         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
666         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.7
667 #ifdef GCC_COMPAT
668         printf("        .comm %s,0%o\n"gcc_findname(q), off);
669 #else
ragge
1.1
670         printf("        .comm %s,0%o\n"exname(q->sname), off);
ragge
1.7
671 #endif
ragge
1.1
672 }
673
674 /* make a local common declaration for id, if reasonable */
675 void
676 lcommdec(struct symtab *q)
677 {
678         int off;
679
680         off = tsize(q->stypeq->sdfq->ssue);
ragge
1.8
681         off = (off+(SZCHAR-1))/SZCHAR;
ragge
1.1
682         if (q->slevel == 0)
ragge
1.7
683 #ifdef GCC_COMPAT
684                 printf("        .lcomm %s,0%o\n"gcc_findname(q), off);
685 #else
ragge
1.1
686                 printf("        .lcomm %s,0%o\n"exname(q->sname), off);
ragge
1.7
687 #endif
ragge
1.1
688         else
689                 printf("        .lcomm " LABFMT ",0%o\n"q->soffsetoff);
690 }
ragge
1.22
691
692 /*
693  * print a (non-prog) label.
694  */
695 void
696 deflab1(int label)
697 {
698         printf(LABFMT ":\n"label);
699 }
700
ragge
1.28
701 static char *loctbl[] = { "text""data""section .rodata""section .rodata" };
ragge
1.27
702
ragge
1.23
703 void
704 setloc1(int locc)
705 {
706         if (locc == lastloc)
707                 return;
708         lastloc = locc;
ragge
1.27
709         printf("        .%s\n"loctbl[locc]);
ragge
1.23
710 }
ragge
1.48
711
ragge
1.49
712 #if 0
ragge
1.48
713 int
714 ftoint(NODE *pCONSZ **c)
715 {
716         static CONSZ cc[3];
717         union { float fdouble dlong double lint i[3]; } u;
718         int n;
719
720         switch (p->n_type) {
721         case LDOUBLE:
722                 u.i[2] = 0;
723                 u.l = (long double)p->n_dcon;
724                 n = SZLDOUBLE;
725                 break;
726         case DOUBLE:
727                 u.d = (double)p->n_dcon;
728                 n = SZDOUBLE;
729                 break;
730         case FLOAT:
731                 u.f = (float)p->n_dcon;
732                 n = SZFLOAT;
733                 break;
734         }
735         cc[0] = u.i[0];
736         cc[1] = u.i[1];
737         cc[2] = u.i[2];
738         *c = cc;
739         return n;
740 }
ragge
1.49
741 #endif
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-09-24 04:25 +0200