Quick Search:

View

Revision:
Expand:  
Changeset: MAIN:ragge:20110604074111

Diff

Diff from 1.20 to:

Annotations

Annotate by Age | Author | Mixed | None
/fisheye/browse/pcc/pcc/arch/mips/code.c

Annotated File View

ragge
1.20
1 /*      $Id: code.c,v 1.20 2011/06/04 07:41:11 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 /*
31  * MIPS port by Jan Enoksson (janeno-1@student.ltu.se) and
32  * Simon Olsson (simols-1@student.ltu.se) 2005.
33  */
34
gmcgarry
1.7
35 #include <assert.h>
36 #include "pass1.h"
ragge
1.1
37
38 /*
ragge
1.13
39  * Define everything needed to print out some data (or text).
40  * This means segment, alignment, visibility, etc.
41  */
42 void
43 defloc(struct symtab *sp)
44 {
45         static char *loctbl[] = { "text""data""section .rodata" };
46         static int lastloc = -1;
47         TWORD t;
ragge
1.16
48         char *n;
ragge
1.13
49         int s;
50
51         if (sp == NULL) {
52                 lastloc = -1;
53                 return;
54         }
55         t = sp->stype;
56         s = ISFTN(t) ? PROG : ISCON(cqual(tsp->squal)) ? RDATA : DATA;
57         lastloc = s;
58         if (s == PROG)
59                 return/* text is written in prologue() */
60         if (s != lastloc)
61                 printf("        .%s\n"loctbl[s]);
ragge
1.17
62         printf("        .p2align %d\n"ispow2(talign(tsp->sap)));
ragge
1.16
63         n = sp->soname ? sp->soname : sp->sname;
ragge
1.13
64         if (sp->sclass == EXTDEF)
ragge
1.16
65                 printf("        .globl %s\n"n);
ragge
1.13
66         if (sp->slevel == 0) {
67 #ifdef USE_GAS
ragge
1.16
68                 printf("\t.type %s,@object\n"n);
69                 printf("\t.size %s," CONFMT "\n"n,
ragge
1.17
70                     tsize(sp->stypesp->sdfsp->sap));
ragge
1.13
71 #endif
ragge
1.16
72                 printf("%s:\n"n);
ragge
1.13
73         } else
74                 printf(LABFMT ":\n"sp->soffset);
75 }
76
77
78 #ifdef notdef
79 /*
ragge
1.1
80  * cause the alignment to become a multiple of n
81  * never called for text segment.
82  */
83 void
84 defalign(int n)
85 {
gmcgarry
1.10
86         n = ispow2(n / SZCHAR);
87         if (n == -1)
88                 cerror("defalign: n != 2^i");
89         printf("\t.p2align %d\n"n);
ragge
1.1
90 }
91
92 /*
93  * define the current location as the name p->sname
94  * never called for text segment.
95  */
96 void
97 defnam(struct symtab *p)
98 {
ragge
1.12
99         char *c = p->soname;
ragge
1.1
100
101         if (p->sclass == EXTDEF)
gmcgarry
1.4
102                 printf("\t.globl %s\n"c);
103 #ifdef USE_GAS
104         printf("\t.type %s,@object\n"c);
ragge
1.17
105         printf("\t.size %s," CONFMT "\n"ctsize(p->stypep->sdfp->sap));
gmcgarry
1.4
106 #endif
ragge
1.1
107         printf("%s:\n"c);
108 }
ragge
1.13
109 #endif
ragge
1.1
110
gmcgarry
1.7
111 static int rvnr;
112
ragge
1.1
113 /*
114  * code for the end of a function
115  * deals with struct return here
116  */
117 void
118 efcode()
119 {
gmcgarry
1.7
120         NODE *p, *q;
121         int tempnr;
122         int ty;
123
ragge
1.1
124         if (cftnsp->stype != STRTY+FTN && cftnsp->stype != UNIONTY+FTN)
125                 return;
gmcgarry
1.7
126
127         ty = cftnsp->stype - FTN;
128
ragge
1.17
129         q = block(REGNILNILINCREF(ty), 0cftnsp->sap);
gmcgarry
1.7
130         q->n_rval = V0;
ragge
1.17
131         p = tempnode(0INCREF(ty), 0cftnsp->sap);
ragge
1.11
132         tempnr = regno(p);
gmcgarry
1.7
133         p = buildtree(ASSIGNpq);
134         ecomp(p);
135
ragge
1.17
136         q = tempnode(tempnrINCREF(ty), 0cftnsp->sap);
gmcgarry
1.7
137         q = buildtree(UMULqNIL);
138
ragge
1.17
139         p = tempnode(rvnrINCREF(ty), 0cftnsp->sap);
gmcgarry
1.7
140         p = buildtree(UMULpNIL);
141
142         p = buildtree(ASSIGNpq);
143         ecomp(p);
144
ragge
1.17
145         q = tempnode(rvnrINCREF(ty), 0cftnsp->sap);
146         p = block(REGNILNILINCREF(ty), 0cftnsp->sap);
gmcgarry
1.7
147         p->n_rval = V0;
148         p = buildtree(ASSIGNpq);
149         ecomp(p);
ragge
1.1
150 }
151
gmcgarry
1.9
152 /* Put a symbol in a temporary
153  * used by bfcode() and its helpers */
154 static void
155 putintemp(struct symtab *sym)
156 {
157         NODE *p;
ragge
1.17
158         p = tempnode(0sym->stypesym->sdfsym->sap);
ragge
1.14
159         p = buildtree(ASSIGNpnametree(sym));
ragge
1.11
160         sym->soffset = regno(p->n_left);
gmcgarry
1.9
161         sym->sflags |= STNODE;
162         ecomp(p);
163 }
164
165 /* setup the hidden pointer to struct return parameter
166  * used by bfcode() */
167 static void
168 param_retptr(void)
169 {
170         NODE *p, *q;
171
ragge
1.17
172         p = tempnode(0PTR+STRTY0cftnsp->sap);
ragge
1.11
173         rvnr = regno(p);
ragge
1.17
174         q = block(REGNILNILPTR+STRTY0cftnsp->sap);
gmcgarry
1.9
175         q->n_rval = A0;
176         p = buildtree(ASSIGNpq);
177         ecomp(p);
178 }
179
180 /* setup struct parameter
181  * push the registers out to memory
182  * used by bfcode() */
183 static void
184 param_struct(struct symtab *symint *regp)
185 {
186         int reg = *regp;
187         NODE *p, *q;
188         int navail;
189         int sz;
190         int off;
191         int num;
192         int i;
193
194         navail = nargregs - (reg - A0);
ragge
1.17
195         sz = tsize(sym->stypesym->sdfsym->sap) / SZINT;
gmcgarry
1.9
196         off = ARGINIT/SZINT + (reg - A0);
197         num = sz > navail ? navail : sz;
198         for (i = 0i < numi++) {
ragge
1.18
199                 q = block(REGNILNILINT00);
gmcgarry
1.9
200                 q->n_rval = reg++;
ragge
1.18
201                 p = block(REGNILNILINT00);
gmcgarry
1.9
202                 p->n_rval = FP;
ragge
1.18
203                 p = block(PLUSpbcon(4*off++), INT00);
204                 p = block(UMULpNILINT00);
gmcgarry
1.9
205                 p = buildtree(ASSIGNpq);
206                 ecomp(p);
207         }
208
209         *regp = reg;
210 }
211
212 /* setup a 64-bit parameter (double/ldouble/longlong)
213  * used by bfcode() */
214 static void
215 param_64bit(struct symtab *symint *regpint dotemps)
216 {
217         int reg = *regp;
218         NODE *p, *q;
219         int navail;
220
221         /* alignment */
222         ++reg;
223         reg &= ~1;
224
225         navail = nargregs - (reg - A0);
226
gmcgarry
1.10
227         if (navail < 2) {
gmcgarry
1.9
228                 /* would have appeared half in registers/half
229                  * on the stack, but alignment ensures it
230                  * appears on the stack */
231                 if (dotemps)
232                         putintemp(sym);
gmcgarry
1.10
233                 *regp = reg;
234                 return;
235         }
236
ragge
1.17
237         q = block(REGNILNILsym->stypesym->sdfsym->sap);
gmcgarry
1.10
238         q->n_rval = A0A1 + (reg - A0);
239         if (dotemps) {
ragge
1.17
240                 p = tempnode(0sym->stypesym->sdfsym->sap);
ragge
1.11
241                 sym->soffset = regno(p);
gmcgarry
1.10
242                 sym->sflags |= STNODE;
gmcgarry
1.9
243         } else {
ragge
1.14
244                 p = nametree(sym);
gmcgarry
1.9
245         }
gmcgarry
1.10
246         p = buildtree(ASSIGNpq);
247         ecomp(p);
248         *regp = reg + 2;
gmcgarry
1.9
249 }
250
251 /* setup a 32-bit param on the stack
252  * used by bfcode() */
253 static void
254 param_32bit(struct symtab *symint *regpint dotemps)
255 {
256         NODE *p, *q;
257
ragge
1.17
258         q = block(REGNILNILsym->stypesym->sdfsym->sap);
gmcgarry
1.9
259         q->n_rval = (*regp)++;
260         if (dotemps) {
ragge
1.17
261                 p = tempnode(0sym->stypesym->sdfsym->sap);
ragge
1.11
262                 sym->soffset = regno(p);
gmcgarry
1.9
263                 sym->sflags |= STNODE;
264         } else {
ragge
1.14
265                 p = nametree(sym);
gmcgarry
1.9
266         }
267         p = buildtree(ASSIGNpq);
268         ecomp(p);
269 }
270
ragge
1.1
271 /*
gmcgarry
1.10
272  * XXX This is a hack.  We cannot have (l)doubles in more than one
273  * register class.  So we bounce them in and out of temps to
274  * move them in and out of the right registers.
275  */
276 static void
277 param_double(struct symtab *symint *regpint dotemps)
278 {
279         int reg = *regp;
280         NODE *p, *q, *t;
281         int navail;
282         int tmpnr;
283
284         /* alignment */
285         ++reg;
286         reg &= ~1;
287
288         navail = nargregs - (reg - A0);
289
290         if (navail < 2) {
291                 /* would have appeared half in registers/half
292                  * on the stack, but alignment ensures it
293                  * appears on the stack */
294                 if (dotemps)
295                         putintemp(sym);
296                 *regp = reg;
297                 return;
298         }
299
ragge
1.18
300         t = tempnode(0LONGLONG00);
ragge
1.11
301         tmpnr = regno(t);
ragge
1.18
302         q = block(REGNILNILLONGLONG00);
gmcgarry
1.10
303         q->n_rval = A0A1 + (reg - A0);
304         p = buildtree(ASSIGNtq);
305         ecomp(p);
306
307         if (dotemps) {
308                 sym->soffset = tmpnr;
309                 sym->sflags |= STNODE;
310         } else {
ragge
1.17
311                 q = tempnode(tmpnrsym->stypesym->sdfsym->sap);
ragge
1.15
312                 p = nametree(sym);
gmcgarry
1.10
313                 p = buildtree(ASSIGNpq);
314                 ecomp(p);
315         }
316         *regp = reg + 2;
317 }
318
319 /*
320  * XXX This is a hack.  We cannot have floats in more than one
321  * register class.  So we bounce them in and out of temps to
322  * move them in and out of the right registers.
323  */
324 static void
325 param_float(struct symtab *symint *regpint dotemps)
326 {
327         NODE *p, *q, *t;
328         int tmpnr;
329
ragge
1.18
330         t = tempnode(0INT00);
ragge
1.11
331         tmpnr = regno(t);
ragge
1.18
332         q = block(REGNILNILINT00);
gmcgarry
1.10
333         q->n_rval = (*regp)++;
334         p = buildtree(ASSIGNtq);
335         ecomp(p);
336
337         if (dotemps) {
338                 sym->soffset = tmpnr;
339                 sym->sflags |= STNODE;
340         } else {
ragge
1.17
341                 q = tempnode(tmpnrsym->stypesym->sdfsym->sap);
ragge
1.14
342                 p = nametree(sym);
gmcgarry
1.10
343                 p = buildtree(ASSIGNpq);
344                 ecomp(p);
345         }
346 }
347
348 /*
ragge
1.1
349  * code for the beginning of a function; a is an array of
350  * indices in symtab for the arguments; n is the number
351  */
352 void
gmcgarry
1.4
353 bfcode(struct symtab **spint cnt)
ragge
1.1
354 {
gmcgarry
1.9
355         union arglist *usym;
356         int lastreg = A0 + nargregs - 1;
357         int saveallargs = 0;
358         int ireg;
359
360         /*
361          * Detect if this function has ellipses and save all
362          * argument register onto stack.
363          */
364         usym = cftnsp->sdf->dfun;
365         while (usym && usym->type != TNULL) {
366                 if (usym->type == TELLIPSIS) {
367                         saveallargs = 1;
368                         break;
369                 }
370                 ++usym;
371         }
372
373         reg = A0;
ragge
1.1
374
gmcgarry
1.7
375         /* assign hidden return structure to temporary */
ragge
1.1
376         if (cftnsp->stype == STRTY+FTN || cftnsp->stype == UNIONTY+FTN) {
gmcgarry
1.9
377                 param_retptr();
378                 ++reg;
ragge
1.1
379         }
380
gmcgarry
1.4
381         /* recalculate the arg offset and create TEMP moves */
gmcgarry
1.9
382         for (i = 0i < cnti++) {
gmcgarry
1.7
383
gmcgarry
1.9
384                 if ((reg > lastreg) && !xtemps)
385                         break;
386                 else if (reg > lastreg
387                         putintemp(sp[i]);
388                 else if (sp[i]->stype == STRTY || sp[i]->stype == UNIONTY)
389                         param_struct(sp[i], &reg);
gmcgarry
1.10
390                 else if (DEUNSIGN(sp[i]->stype) == LONGLONG)
gmcgarry
1.9
391                         param_64bit(sp[i], &regxtemps && !saveallargs);
gmcgarry
1.10
392                 else if (sp[i]->stype == DOUBLE || sp[i]->stype == LDOUBLE)
393                         param_double(sp[i], &regxtemps && !saveallargs);
394                 else if (sp[i]->stype == FLOAT)
395                         param_float(sp[i], &regxtemps && !saveallargs);
gmcgarry
1.9
396                 else
397                         param_32bit(sp[i], &regxtemps && !saveallargs);
398         }
gmcgarry
1.7
399
gmcgarry
1.9
400         /* if saveallargs, save the rest of the args onto the stack */
401         if (!saveallargs)
402                 return;
403         while (reg <= lastreg) {
404                 NODE *p, *q;
405                 int off = ARGINIT/SZINT + (reg - A0);
ragge
1.18
406                 q = block(REGNILNILINT00);
gmcgarry
1.9
407                 q->n_rval = reg++;
ragge
1.18
408                 p = block(REGNILNILINT00);
gmcgarry
1.9
409                 p->n_rval = FP;
ragge
1.18
410                 p = block(PLUSpbcon(4*off), INT00);
411                 p = block(UMULpNILINT00);
gmcgarry
1.9
412                 p = buildtree(ASSIGNpq);
413                 ecomp(p);
414         }
ragge
1.1
415
416 }
417
418
419 /* called just before final exit */
420 /* flag is 1 if errors, 0 if none */
421 void
422 ejobcode(int flag )
423 {
424 }
425
426 void
427 bjobcode()
428 {
gmcgarry
1.7
429         printf("\t.section .mdebug.abi32\n");
430         printf("\t.previous\n");
431         printf("\t.abicalls\n");
ragge
1.1
432 }
433
ragge
1.13
434 #ifdef notdef
ragge
1.1
435 /*
436  * Print character t at position i in one string, until t == -1.
437  * Locctr & label is already defined.
438  */
439 void
440 bycode(int tint i)
441 {
gmcgarry
1.2
442         static int lastoctal = 0;
ragge
1.1
443
444         /* put byte i+1 in a string */
445
446         if (t < 0) {
447                 if (i != 0)
gmcgarry
1.10
448                         puts("\\000\"");
ragge
1.1
449         } else {
450                 if (i == 0)
gmcgarry
1.10
451                         printf("\t.ascii \"");
gmcgarry
1.2
452                 if (t == 0)
453                         return;
454                 else if (t == '\\' || t == '"') {
ragge
1.1
455                         lastoctal = 0;
456                         putchar('\\');
457                         putchar(t);
gmcgarry
1.10
458                 } else if (t == 011) {
459                         printf("\\t");
gmcgarry
1.2
460                 } else if (t == 012) {
461                         printf("\\n");
ragge
1.1
462                 } else if (t < 040 || t >= 0177) {
463                         lastoctal++;
464                         printf("\\%o",t);
465                 } else if (lastoctal && '0' <= t && t <= '9') {
466                         lastoctal = 0;
gmcgarry
1.10
467                         printf("\"\n\t.ascii \"%c"t);
ragge
1.1
468                 } else {        
469                         lastoctal = 0;
470                         putchar(t);
471                 }
472         }
473 }
ragge
1.13
474 #endif
ragge
1.1
475
476 /* fix up type of field p */
477 void
478 fldty(struct symtab *p)
479 {
480 }
481
stefan
1.5
482 /*
ragge
1.1
483  * XXX - fix genswitch.
484  */
stefan
1.5
485 int
486 mygenswitch(int numTWORD typestruct swents **pint n)
ragge
1.1
487 {
stefan
1.5
488         return 0;
ragge
1.1
489 }
gmcgarry
1.4
490
gmcgarry
1.9
491
492 /* setup call stack with a structure */
493 /* called from moveargs() */
494 static NODE *
495 movearg_struct(NODE *pNODE *parentint *regp)
496 {
497         int reg = *regp;
gmcgarry
1.10
498         NODE *l, *q, *t, *r;
499         int tmpnr;
gmcgarry
1.9
500         int navail;
501         int off;
502         int num;
503         int sz;
gmcgarry
1.10
504         int ty;
gmcgarry
1.9
505         int i;
506
507         navail = nargregs - (reg - A0);
ragge
1.17
508         sz = tsize(p->n_typep->n_dfp->n_ap) / SZINT;
gmcgarry
1.9
509         num = sz > navail ? navail : sz;
510
gmcgarry
1.10
511         l = p->n_left;
512         nfree(p);
513         ty = l->n_type;
ragge
1.17
514         t = tempnode(0l->n_typel->n_dfl->n_ap);
ragge
1.11
515         tmpnr = regno(t);
gmcgarry
1.10
516         l = buildtree(ASSIGNtl);
517
518         if (p != parent) {
gmcgarry
1.9
519                 q = parent->n_left;
gmcgarry
1.10
520         } else
gmcgarry
1.9
521                 q = NULL;
522
523         /* copy structure into registers */
524         for (i = 0i < numi++) {
ragge
1.18
525                 t = tempnode(tmpnrty00);
526                 t = block(SCONVtNILPTR+INT00);
527                 t = block(PLUStbcon(4*i), PTR+INT00);
gmcgarry
1.9
528                 t = buildtree(UMULtNIL);
529
ragge
1.18
530                 r = block(REGNILNILINT00);
gmcgarry
1.9
531                 r->n_rval = reg++;
532
533                 r = buildtree(ASSIGNrt);
534                 if (q == NULL)
535                         q = r;
gmcgarry
1.10
536                 else 
ragge
1.18
537                         q = block(CMqrINT00);
gmcgarry
1.9
538         }
539         off = ARGINIT/SZINT + nargregs;
540         for (i = numi < szi++) {
ragge
1.18
541                 t = tempnode(tmpnrty00);
542                 t = block(SCONVtNILPTR+INT00);
543                 t = block(PLUStbcon(4*i), PTR+INT00);
gmcgarry
1.9
544                 t = buildtree(UMULtNIL);
545
ragge
1.18
546                 r = block(REGNILNILINT00);
gmcgarry
1.9
547                 r->n_rval = FP;
ragge
1.18
548                 r = block(PLUSrbcon(4*off++), INT00);
549                 r = block(UMULrNILINT00);
gmcgarry
1.9
550
551                 r = buildtree(ASSIGNrt);
552                 if (q == NULL)
553                         q = r;
554                 else
ragge
1.18
555                         q = block(CMqrINT00);
gmcgarry
1.9
556         }
557
558         if (parent->n_op == CM) {
gmcgarry
1.10
559                 parent->n_left = q;
560                 q = l;
561         } else {
ragge
1.18
562                 q = block(CMqlINT00);
gmcgarry
1.9
563         }
564
565         *regp = reg;
566         return q;
567 }
568
569 /* setup call stack with 64-bit argument */
570 /* called from moveargs() */
571 static NODE *
572 movearg_64bit(NODE *pint *regp)
573 {
574         int reg = *regp;
575         NODE *q;
gmcgarry
1.10
576         int lastarg;
gmcgarry
1.9
577
578         /* alignment */
579         ++reg;
580         reg &= ~1;
581
gmcgarry
1.10
582         lastarg = A0 + nargregs - 1;
583         if (reg > lastarg) {
584                 *regp = reg;
ragge
1.17
585                 return block(FUNARGpNILp->n_typep->n_dfp->n_ap);
gmcgarry
1.10
586         }
587
ragge
1.17
588         q = block(REGNILNILp->n_typep->n_dfp->n_ap);
gmcgarry
1.10
589         q->n_rval = A0A1 + (reg - A0);
gmcgarry
1.9
590         q = buildtree(ASSIGNqp);
591
gmcgarry
1.10
592         *regp = reg + 2;
gmcgarry
1.9
593         return q;
594 }
595
596 /* setup call stack with 32-bit argument */
597 /* called from moveargs() */
598 static NODE *
599 movearg_32bit(NODE *pint *regp)
600 {
601         int reg = *regp;
602         NODE *q;
603
ragge
1.17
604         q = block(REGNILNILp->n_typep->n_dfp->n_ap);
gmcgarry
1.9
605         q->n_rval = reg++;
606         q = buildtree(ASSIGNqp);
607
608         *regp = reg;
609         return q;
610 }
611
612 static NODE *
613 moveargs(NODE *pint *regp)
gmcgarry
1.4
614 {
gmcgarry
1.9
615         NODE *r, **rp;
616         int lastreg;
617         int reg;
gmcgarry
1.7
618
gmcgarry
1.9
619         if (p->n_op == CM) {
620                 p->n_left = moveargs(p->n_leftregp);
621                 r = p->n_right;
622                 rp = &p->n_right;
gmcgarry
1.4
623         } else {
gmcgarry
1.9
624                 r = p;
625                 rp = &p;
gmcgarry
1.7
626         }
gmcgarry
1.4
627
gmcgarry
1.9
628         lastreg = A0 + nargregs - 1;
629         reg = *regp;
630
631         if (reg > lastreg && r->n_op != STARG)
ragge
1.17
632                 *rp = block(FUNARGrNILr->n_typer->n_dfr->n_ap);
gmcgarry
1.9
633         else if (r->n_op == STARG) {
634                 *rp = movearg_struct(rpregp);
gmcgarry
1.10
635         } else if (DEUNSIGN(r->n_type) == LONGLONG) {
gmcgarry
1.9
636                 *rp = movearg_64bit(rregp);
gmcgarry
1.10
637         } else if (r->n_type == DOUBLE || r->n_type == LDOUBLE) {
638                 /* XXX bounce in and out of temporary to change to longlong */
ragge
1.18
639                 NODE *t1 = tempnode(0LONGLONG00);
ragge
1.11
640                 int tmpnr = regno(t1);
ragge
1.17
641                 NODE *t2 = tempnode(tmpnrr->n_typer->n_dfr->n_ap);
gmcgarry
1.10
642                 t1 =  movearg_64bit(t1regp);
ragge
1.17
643                 r = block(ASSIGNt2rr->n_typer->n_dfr->n_ap);
gmcgarry
1.10
644                 if (p->n_op == CM) {
645                         p->n_left = buildtree(CMp->n_leftt1);
646                         p->n_right = r;
647                 } else {
648                         p = buildtree(CMt1r);
649                 }
650         } else if (r->n_type == FLOAT) {
651                 /* XXX bounce in and out of temporary to change to int */
ragge
1.18
652                 NODE *t1 = tempnode(0INT00);
ragge
1.11
653                 int tmpnr = regno(t1);
ragge
1.17
654                 NODE *t2 = tempnode(tmpnrr->n_typer->n_dfr->n_ap);
gmcgarry
1.10
655                 t1 =  movearg_32bit(t1regp);
ragge
1.17
656                 r = block(ASSIGNt2rr->n_typer->n_dfr->n_ap);
gmcgarry
1.10
657                 if (p->n_op == CM) {
658                         p->n_left = buildtree(CMp->n_leftt1);
659                         p->n_right = r;
660                 } else {
661                         p = buildtree(CMt1r);
662                 }
663         } else {
gmcgarry
1.9
664                 *rp = movearg_32bit(rregp);
gmcgarry
1.10
665         }
gmcgarry
1.9
666
667         return p;
gmcgarry
1.4
668 }
669
ragge
1.3
670 /*
671  * Called with a function call with arguments as argument.
672  * This is done early in buildtree() and only done once.
673  */
674 NODE *
675 funcode(NODE *p)
676 {
gmcgarry
1.4
677         int regnum = A0;
gmcgarry
1.7
678         NODE *l, *r, *t, *q;
679         int ty;
680
681         l = p->n_left;
682         r = p->n_right;
683
gmcgarry
1.9
684         /*
685          * if returning a structure, make the first argument
686          * a hidden pointer to return structure.
687          */
gmcgarry
1.7
688         ty = DECREF(l->n_type);
689         if (ty == STRTY+FTN || ty == UNIONTY+FTN) {
690                 ty = DECREF(l->n_type) - FTN;
ragge
1.17
691                 q = tempnode(0tyl->n_dfl->n_ap);
gmcgarry
1.7
692                 q = buildtree(ADDROFqNIL);
693                 if (r->n_op != CM) {
694                         p->n_right = block(CMqrINCREF(ty),
ragge
1.17
695                             l->n_dfl->n_ap);
gmcgarry
1.7
696                 } else {
697                         for (t = rt->n_left->n_op == CMt = t->n_left)
698                                 ;
699                         t->n_left = block(CMqt->n_leftINCREF(ty),
ragge
1.17
700                             l->n_dfl->n_ap);
gmcgarry
1.7
701                 }
702         }
703
gmcgarry
1.9
704         p->n_right = moveargs(p->n_right, &regnum);
705
ragge
1.3
706         return p;
707 }
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-02 15:59 +0200