|
61
|
1 /* Micro-C Generic Code Generatation Part */
|
|
|
2 /* $Id$ */
|
|
|
3
|
|
|
4 #define EXTERN extern
|
|
|
5 #include "mc.h"
|
|
|
6 #include "mc-codegen.h"
|
|
|
7 #include "mc-code.h"
|
|
|
8
|
|
|
9 int creg; /* current register */
|
|
|
10 int reg_sp; /* REGister Stack-Pointer */
|
|
83
|
11 int reg_stack[MAX_MAX]; /* 実際のレジスタの領域 */
|
|
|
12
|
|
|
13 /* floating point registers */
|
|
|
14
|
|
81
|
15 int freg; /* current floating point register */
|
|
83
|
16 int freg_sp; /* floating point REGister Stack-Pointer */
|
|
|
17 int freg_stack[MAX_MAX]; /* 実際のレジスタの領域 */
|
|
|
18
|
|
|
19 int use; /* generated value will be used */
|
|
81
|
20
|
|
61
|
21 /*
|
|
|
22 creg currrent virtual register
|
|
|
23 regs[] virtual register usage
|
|
|
24 regv[] value in virtual register flag
|
|
83
|
25 freg current floating point register
|
|
|
26 fregv calue in floating point register
|
|
61
|
27 */
|
|
|
28
|
|
105
|
29 static void remove0(int *parent,int e) ;
|
|
|
30 /* static void remove0_all(int *parent,int e) ; */
|
|
|
31 static int is_same_type(int e1,int e2);
|
|
|
32 static void jump(int e1, int env);
|
|
|
33 static void machinop(int e1);
|
|
|
34 static void sassign(int e1);
|
|
|
35 static void assign(int e1);
|
|
|
36 static void assop(int e1);
|
|
|
37 static int g_expr0(int e1);
|
|
|
38 static int register_to_lvar(int e);
|
|
61
|
39
|
|
102
|
40 void
|
|
|
41 codegen_init()
|
|
|
42 {
|
|
|
43 code_init();
|
|
|
44 }
|
|
|
45
|
|
94
|
46 int
|
|
83
|
47 gexpr(int e1,int use0)
|
|
61
|
48 {
|
|
94
|
49 if (chk) return INT;
|
|
61
|
50 gexpr_init();
|
|
83
|
51 use = use0;
|
|
61
|
52 #if 0
|
|
|
53 if(lineno==2862) {
|
|
94
|
54 return g_expr0(e1); /*break here*/
|
|
61
|
55 }
|
|
|
56 #endif
|
|
94
|
57 return g_expr0(e1);
|
|
61
|
58 }
|
|
|
59
|
|
|
60 int
|
|
83
|
61 g_expr_u(int e1)
|
|
|
62 {
|
|
94
|
63 int t;
|
|
83
|
64 int suse = use; use=0;
|
|
94
|
65 t=g_expr0(e1);
|
|
83
|
66 use=suse;
|
|
94
|
67 return t;
|
|
83
|
68 }
|
|
|
69
|
|
94
|
70 int
|
|
61
|
71 g_expr(int e1)
|
|
|
72 {
|
|
94
|
73 int t;
|
|
83
|
74 int suse = use; use=1;
|
|
94
|
75 t=g_expr0(e1);
|
|
83
|
76 use=suse;
|
|
94
|
77 return t;
|
|
83
|
78 }
|
|
|
79
|
|
94
|
80 int
|
|
83
|
81 g_expr0(int e1)
|
|
|
82 {
|
|
94
|
83 int e2,e3,t;
|
|
61
|
84 NMTBL *n;
|
|
|
85
|
|
|
86 e2 = cadr(e1);
|
|
|
87 switch (car(e1)){
|
|
|
88 case GVAR:
|
|
|
89 code_gvar(e1);
|
|
|
90 regv[creg]=1;
|
|
94
|
91 return ADDRESS;
|
|
61
|
92 case RGVAR:
|
|
|
93 code_rgvar(e1);
|
|
|
94 regv[creg]=1;
|
|
94
|
95 return INT;
|
|
61
|
96 case CRGVAR:
|
|
|
97 code_crgvar(e1);
|
|
|
98 regv[creg]=1;
|
|
94
|
99 return CHAR;
|
|
61
|
100 case LVAR:
|
|
|
101 code_lvar(lvar(e2));
|
|
|
102 regv[creg]=1;
|
|
94
|
103 return ADDRESS;
|
|
61
|
104 case REGISTER:
|
|
|
105 /* this is of course redundant... */
|
|
|
106 /* or why not creg=e2? */
|
|
|
107 code_register(e2);
|
|
|
108 regv[creg]=1;
|
|
94
|
109 return INT;
|
|
|
110 case DREGISTER:
|
|
|
111 /* this is of course redundant... */
|
|
|
112 /* or why not creg=e2? */
|
|
97
|
113 code_fregister(e2);
|
|
94
|
114 fregv[freg]=1;
|
|
|
115 return DOUBLE;
|
|
61
|
116 case RLVAR:
|
|
94
|
117 code_rlvar(lvar(e2),creg);
|
|
61
|
118 regv[creg]=1;
|
|
94
|
119 return INT;
|
|
61
|
120 case CRLVAR:
|
|
94
|
121 code_crlvar(lvar(e2),creg);
|
|
61
|
122 regv[creg]=1;
|
|
94
|
123 return CHAR;
|
|
81
|
124 case FRLVAR:
|
|
82
|
125 code_drlvar(lvar(e2),0);
|
|
83
|
126 fregv[freg]=1;
|
|
94
|
127 return FLOAT;
|
|
81
|
128 case FRGVAR:
|
|
82
|
129 code_drgvar(e1,0);
|
|
83
|
130 fregv[freg]=1;
|
|
94
|
131 return FLOAT;
|
|
81
|
132 case DRLVAR:
|
|
82
|
133 code_drlvar(lvar(e2),1);
|
|
83
|
134 fregv[freg]=1;
|
|
94
|
135 return DOUBLE;
|
|
81
|
136 case DRGVAR:
|
|
82
|
137 code_drgvar(e1,1);
|
|
83
|
138 fregv[freg]=1;
|
|
94
|
139 return DOUBLE;
|
|
61
|
140 case FNAME:
|
|
|
141 code_fname(((NMTBL *)(e2))->nm);
|
|
|
142 regv[creg]=1;
|
|
94
|
143 return ADDRESS;
|
|
61
|
144 case CONST: /* 代入する値が0でも特別な処理はしない */
|
|
|
145 code_const(e2);
|
|
|
146 regv[creg]=1;
|
|
94
|
147 return INT;
|
|
81
|
148 case DCONST:
|
|
82
|
149 code_dconst(e1);
|
|
83
|
150 fregv[freg]=1;
|
|
94
|
151 return DOUBLE;
|
|
61
|
152 case STRING:
|
|
|
153 string(e1);
|
|
|
154 regv[creg]=1;
|
|
94
|
155 return ADDRESS;
|
|
61
|
156 case FUNCTION:
|
|
94
|
157 t = function(e1);
|
|
61
|
158 regv[creg]=1;
|
|
94
|
159 return t;
|
|
61
|
160 case CODE:
|
|
|
161 jump(e2,caddr(e1));
|
|
94
|
162 return VOID;
|
|
61
|
163 case INDIRECT:
|
|
94
|
164 return g_expr0(e2);
|
|
81
|
165 case RINDIRECT: case CRINDIRECT:
|
|
|
166 case DRINDIRECT: case FRINDIRECT:
|
|
94
|
167 return rindirect(e1);
|
|
61
|
168 case ADDRESS:
|
|
105
|
169 if (car(e2)==REGISTER||car(e2)==DREGISTER)
|
|
|
170 return register_to_lvar(e2);
|
|
|
171 else
|
|
|
172 return g_expr0(e2);
|
|
61
|
173 case MINUS: /* レジスタに対し、neglを実行すれば実現可能 */
|
|
85
|
174 g_expr0(e2); code_neg();
|
|
94
|
175 return INT;
|
|
81
|
176 case DMINUS:
|
|
85
|
177 g_expr0(e2); code_dneg();
|
|
94
|
178 return DOUBLE;
|
|
82
|
179 case I2D:
|
|
85
|
180 g_expr0(e2); code_i2d();
|
|
94
|
181 return DOUBLE;
|
|
82
|
182 case D2I:
|
|
85
|
183 g_expr0(e2); code_d2i();
|
|
94
|
184 return INT;
|
|
85
|
185 case U2D:
|
|
|
186 g_expr0(e2); code_u2d();
|
|
94
|
187 return DOUBLE;
|
|
85
|
188 case D2U:
|
|
|
189 g_expr0(e2); code_d2u();
|
|
94
|
190 return UNSIGNED;
|
|
61
|
191 case BNOT: /* ~ */
|
|
85
|
192 g_expr0(e2); code_not();
|
|
94
|
193 return INT;
|
|
61
|
194 case LNOT: /* ! */
|
|
85
|
195 g_expr0(e2); code_lnot();
|
|
94
|
196 return INT;
|
|
61
|
197 case PREINC:
|
|
|
198 code_preinc(e1,e2);
|
|
94
|
199 return INT;
|
|
61
|
200 case POSTINC:
|
|
|
201 code_postinc(e1,e2);
|
|
94
|
202 return INT;
|
|
83
|
203 case DPREINC:
|
|
|
204 code_dpreinc(e1,e2,1);
|
|
94
|
205 return DOUBLE;
|
|
83
|
206 case DPOSTINC:
|
|
|
207 code_dpostinc(e1,e2,1);
|
|
94
|
208 return DOUBLE;
|
|
83
|
209 case FPREINC:
|
|
|
210 code_dpreinc(e1,e2,0);
|
|
94
|
211 return FLOAT;
|
|
83
|
212 case FPOSTINC:
|
|
|
213 code_dpostinc(e1,e2,0);
|
|
94
|
214 return FLOAT;
|
|
61
|
215 case CPOSTINC:
|
|
|
216 /* char *p; *p++ */
|
|
|
217 code_cpostinc(e1,e2);
|
|
94
|
218 return CHAR;
|
|
61
|
219 case CPREINC:
|
|
|
220 code_cpreinc(e1,e2);
|
|
94
|
221 return CHAR;
|
|
61
|
222 case CPOSTDEC:
|
|
|
223 code_cpostdec(e1,e2);
|
|
94
|
224 return CHAR;
|
|
61
|
225 case CPREDEC:
|
|
|
226 code_cpredec(e1,e2);
|
|
94
|
227 return CHAR;
|
|
61
|
228 case MUL: case UMUL:
|
|
|
229 case DIV: case UDIV:
|
|
|
230 case MOD: case UMOD:
|
|
|
231 case LSHIFT: case ULSHIFT: case RSHIFT: case URSHIFT:
|
|
94
|
232 case ADD: case SUB: case BAND: case EOR: case BOR: case CMP:
|
|
61
|
233 machinop(e1);
|
|
94
|
234 return INT;
|
|
81
|
235 case DMUL: case DDIV:
|
|
|
236 case DADD: case DSUB:
|
|
91
|
237 case DCMP: case DCMPGE:
|
|
81
|
238 dmachinop(e1);
|
|
94
|
239 return DOUBLE;
|
|
61
|
240 case COND:
|
|
|
241 e2=fwdlabel();
|
|
|
242 b_expr(cadr(e1),0,e2,0);
|
|
|
243 code_set_fixed_creg(0);
|
|
83
|
244 g_expr0(caddr(e1));
|
|
61
|
245 code_set_fixed_creg(1);
|
|
|
246 jmp(e3=fwdlabel());
|
|
|
247 fwddef(e2);
|
|
|
248 code_set_fixed_creg(0);
|
|
94
|
249 t = g_expr0(cadddr(e1));
|
|
61
|
250 code_set_fixed_creg(1);
|
|
|
251 fwddef(e3);
|
|
94
|
252 return t;
|
|
61
|
253 case SASS:
|
|
|
254 sassign(e1);
|
|
94
|
255 return RSTRUCT;
|
|
82
|
256 case ASS: case CASS:
|
|
61
|
257 assign(e1);
|
|
94
|
258 return INT;
|
|
82
|
259 case FASS: case DASS: case LASS:
|
|
81
|
260 dassign(e1);
|
|
94
|
261 return DOUBLE;
|
|
61
|
262 case ASSOP: case CASSOP:
|
|
|
263 assop(e1);
|
|
94
|
264 return INT;
|
|
81
|
265 case DASSOP: case FASSOP:
|
|
|
266 dassop(e1);
|
|
94
|
267 return DOUBLE;
|
|
61
|
268 case RSTRUCT:
|
|
83
|
269 g_expr0(e2);
|
|
94
|
270 return RSTRUCT;
|
|
61
|
271 case COMMA:
|
|
83
|
272 g_expr_u(e2);
|
|
94
|
273 return g_expr0(caddr(e1));
|
|
61
|
274 case RETURN:
|
|
|
275 n = (NMTBL *)e2;
|
|
|
276 if (retcont==0)
|
|
|
277 retcont=fwdlabel();
|
|
|
278 code_return(creg);
|
|
|
279 regv[creg]=1;
|
|
94
|
280 return VOID;
|
|
61
|
281 case ENVIRONMENT:
|
|
|
282 code_environment(creg);
|
|
|
283 regv[creg]=1;
|
|
94
|
284 return ADDRESS;
|
|
61
|
285 default:
|
|
94
|
286 code_bool(e1); /* type? */
|
|
61
|
287 regv[creg]=1;
|
|
94
|
288 return INT;
|
|
61
|
289 }
|
|
|
290 }
|
|
|
291
|
|
94
|
292 #define dual_ops(op) \
|
|
|
293 (op==GT|| op==UGT|| op==GE|| op==UGE|| op==LT|| \
|
|
|
294 op==ULT|| op==LE|| op==ULE|| \
|
|
|
295 op==DOP+GT|| op==DOP+GE|| op==DOP+LT|| op==DOP+LE || \
|
|
|
296 op==EQ|| op==NEQ|| op==DOP+EQ|| op==DOP+NEQ)
|
|
|
297
|
|
|
298 int
|
|
|
299 rop_dual(op)
|
|
|
300 {
|
|
|
301 if (op==GT) return LT;
|
|
|
302 if (op==UGT) return ULT;
|
|
|
303 if (op==GE) return LE;
|
|
|
304 if (op==UGE) return ULE;
|
|
|
305 if (op==LT) return GT;
|
|
|
306 if (op==ULT) return UGT;
|
|
|
307 if (op==LE) return GE;
|
|
|
308 if (op==ULE) return UGE;
|
|
|
309 if (op==DOP+GT) return DOP+LT;
|
|
|
310 if (op==DOP+GE) return DOP+LE;
|
|
|
311 if (op==DOP+LT) return DOP+GT;
|
|
|
312 if (op==DOP+LE) return DOP+GE;
|
|
|
313 return op;
|
|
|
314 }
|
|
|
315
|
|
61
|
316 void
|
|
|
317 bexpr(int e1, char cond, int l1)
|
|
|
318 {
|
|
94
|
319 int op = car(e1);
|
|
66
|
320 if (chk) return;
|
|
61
|
321 gexpr_init();
|
|
94
|
322 if (dual_ops(op) && (car(caddr(e1))==CONST||(car(caddr(e1))==DCONST)))
|
|
|
323 b_expr(list3(rop_dual(op),caddr(e1),cadr(e1)),cond,l1,0);
|
|
|
324 else
|
|
|
325 b_expr(e1,cond,l1,0);
|
|
61
|
326 }
|
|
|
327
|
|
|
328 void
|
|
|
329 b_expr(int e1, char cond, int l1,int err)
|
|
|
330 {
|
|
94
|
331 int e2,l2,t;
|
|
61
|
332 e2=cadr(e1);
|
|
|
333 switch(car(e1)) {
|
|
|
334 case LNOT:
|
|
|
335 b_expr(e2,!cond,l1,0);
|
|
|
336 return;
|
|
|
337 case GT:
|
|
89
|
338 rexpr(e1,l1,code_gt(cond),INT);
|
|
61
|
339 return;
|
|
|
340 case UGT:
|
|
89
|
341 rexpr(e1,l1,code_ugt(cond),UNSIGNED);
|
|
61
|
342 return;
|
|
|
343 case GE:
|
|
89
|
344 rexpr(e1,l1,code_ge(cond),INT);
|
|
61
|
345 return;
|
|
|
346 case UGE:
|
|
89
|
347 rexpr(e1,l1,code_uge(cond),UNSIGNED);
|
|
61
|
348 return;
|
|
|
349 case LT:
|
|
89
|
350 rexpr(e1,l1,code_ge(!cond),INT);
|
|
61
|
351 return;
|
|
|
352 case ULT:
|
|
89
|
353 rexpr(e1,l1,code_uge(!cond),UNSIGNED);
|
|
61
|
354 return;
|
|
|
355 case LE:
|
|
89
|
356 rexpr(e1,l1,code_gt(!cond),INT);
|
|
61
|
357 return;
|
|
|
358 case ULE:
|
|
89
|
359 rexpr(e1,l1,code_ugt(!cond),UNSIGNED);
|
|
61
|
360 return;
|
|
|
361 case EQ:
|
|
89
|
362 rexpr(e1,l1,code_eq(cond),INT);
|
|
61
|
363 return;
|
|
|
364 case NEQ:
|
|
89
|
365 rexpr(e1,l1,code_eq(!cond),INT);
|
|
61
|
366 return;
|
|
82
|
367
|
|
|
368 case DOP+GT:
|
|
|
369 drexpr(cadr(e1),caddr(e1),l1,DOP+GT);
|
|
|
370 return;
|
|
|
371 case DOP+GE:
|
|
|
372 drexpr(cadr(e1),caddr(e1),l1,DOP+GE);
|
|
|
373 return;
|
|
|
374 case DOP+LT:
|
|
84
|
375 drexpr(caddr(e1),cadr(e1),l1,DOP+GT);
|
|
82
|
376 return;
|
|
|
377 case DOP+LE:
|
|
84
|
378 drexpr(caddr(e1),cadr(e1),l1,DOP+GE);
|
|
82
|
379 return;
|
|
|
380 case DOP+EQ:
|
|
|
381 drexpr(cadr(e1),caddr(e1),l1,DOP+EQ);
|
|
|
382 return;
|
|
|
383 case DOP+NEQ:
|
|
|
384 drexpr(cadr(e1),caddr(e1),l1,DOP+NEQ);
|
|
|
385 return;
|
|
|
386
|
|
61
|
387 case LAND:
|
|
|
388 b_expr(e2,0,cond?(l2=fwdlabel()):l1,0);
|
|
|
389 b_expr(caddr(e1),cond,l1,0);
|
|
|
390 if(cond) fwddef(l2);
|
|
|
391 return;
|
|
|
392 case LOR:
|
|
|
393 b_expr(e2,1,cond?l1:(l2=fwdlabel()),0);
|
|
|
394 b_expr(caddr(e1),cond,l1,0);
|
|
|
395 if(!cond) fwddef(l2);
|
|
|
396 return;
|
|
|
397 case CRGVAR:
|
|
|
398 code_cmp_crgvar(e1);
|
|
|
399 jcond(l1,cond);
|
|
|
400 return;
|
|
|
401 case CRLVAR:
|
|
|
402 code_cmp_crlvar(lvar(e2));
|
|
|
403 jcond(l1,cond);
|
|
|
404 return;
|
|
|
405 case RGVAR:
|
|
|
406 code_cmp_rgvar(e1);
|
|
|
407 jcond(l1,cond);
|
|
|
408 return;
|
|
|
409 case RLVAR:
|
|
|
410 code_cmp_rlvar(lvar(e2));
|
|
|
411 jcond(l1,cond);
|
|
|
412 return;
|
|
81
|
413 case DRLVAR:
|
|
|
414 code_cmp_drlvar(lvar(e2));
|
|
|
415 jcond(l1,cond);
|
|
|
416 return;
|
|
|
417 case DRGVAR:
|
|
|
418 code_cmp_drgvar(lvar(e2));
|
|
|
419 jcond(l1,cond);
|
|
|
420 return;
|
|
61
|
421 case REGISTER:
|
|
|
422 code_cmp_register(e2);
|
|
|
423 jcond(l1,cond);
|
|
|
424 return;
|
|
94
|
425 case DREGISTER:
|
|
97
|
426 code_cmp_fregister(e2);
|
|
94
|
427 jcond(l1,cond);
|
|
|
428 return;
|
|
61
|
429 case CONST:
|
|
|
430 if((cond&&e2)||(!cond&&!e2)) jmp(l1);
|
|
|
431 return;
|
|
81
|
432 case DCONST:
|
|
|
433 if((dcadr(e2)!=0.0)^cond) jmp(l1);
|
|
|
434 return;
|
|
61
|
435 default:
|
|
|
436 if(err) {
|
|
81
|
437 error(-1); return; /* recursive g_expr/b_expr */
|
|
94
|
438 }
|
|
|
439 t=g_expr(e1);
|
|
|
440 if(t==FLOAT||t==DOUBLE)
|
|
97
|
441 code_cmp_fregister(freg);
|
|
94
|
442 else
|
|
|
443 code_cmp_register(creg);
|
|
61
|
444 jcond(l1,cond);
|
|
|
445 return;
|
|
|
446 }
|
|
|
447 }
|
|
|
448
|
|
|
449
|
|
89
|
450 void
|
|
|
451 arg_register(NMTBL *fnptr)
|
|
|
452 {
|
|
103
|
453 int args = fnptr->dsp;
|
|
|
454 NMTBL *n;
|
|
|
455 int reg_var = 0;
|
|
|
456 int freg_var = 0;
|
|
|
457 int type;
|
|
|
458 int max_input_register_var;
|
|
|
459 int max_input_fregister_var;
|
|
|
460
|
|
|
461 if (is_function(fnptr)) {
|
|
|
462 max_input_register_var = MAX_INPUT_REGISTER_VAR;
|
|
|
463 max_input_fregister_var = MAX_INPUT_DREGISTER_VAR;
|
|
|
464 } else {
|
|
|
465 max_input_register_var = MAX_CODE_INPUT_REGISTER_VAR;
|
|
|
466 max_input_fregister_var = MAX_CODE_INPUT_DREGISTER_VAR;
|
|
|
467 }
|
|
|
468
|
|
|
469 while (args) {
|
|
|
470 /* process in reverse order */
|
|
|
471 n = (NMTBL*)caddr(args);
|
|
|
472 type = n->ty;
|
|
|
473 if (scalar(type)) {
|
|
|
474 if(reg_var<max_input_register_var) {
|
|
|
475 n->sc = REGISTER;
|
|
105
|
476 n->dsp = cadr(get_input_register_var(reg_var,n));
|
|
|
477 regv[n->dsp]= 1;
|
|
|
478 regs[n->dsp]= INPUT_REG;
|
|
103
|
479 reg_var++;
|
|
105
|
480 cadddr(args)=size_of_int; /* why we need this? */
|
|
103
|
481 }
|
|
|
482 } else if ((type==FLOAT||type==DOUBLE)&&stmode==REGISTER) {
|
|
|
483 if(freg_var<max_input_fregister_var) {
|
|
|
484 n->sc = DREGISTER;
|
|
105
|
485 n->dsp = cadr(get_input_fregister_var(freg_var,n));
|
|
|
486 fregv[n->dsp]= 1;
|
|
|
487 fregs[n->dsp]= INPUT_REG;
|
|
103
|
488 freg_var++;
|
|
105
|
489 cadddr(args)=size_of_double; /* why we need this? */
|
|
103
|
490 }
|
|
|
491 }
|
|
|
492 args = cadr(args);
|
|
|
493 }
|
|
89
|
494 }
|
|
|
495
|
|
105
|
496 static int
|
|
|
497 register_to_lvar(int e)
|
|
|
498 {
|
|
|
499 error(REG_ERR);
|
|
|
500 return 0;
|
|
|
501 #if 0
|
|
|
502 途中でレジスタからLVARに変更しても、間に合わない。
|
|
|
503
|
|
|
504 NMTBL *n = (NMTBL*)caddr(e);
|
|
|
505 int reg = cadr(e);
|
|
|
506 int tag = car(e);
|
|
|
507 int lvar;
|
|
|
508 int t;
|
|
|
509 if (!n||n==&null_nptr) error(REG_ERR);
|
|
|
510 if (tag==REGISTER) {
|
|
|
511 /* regs[reg]==INPUT_REG case should be considered */
|
|
|
512 n->dsp = new_lvar(size_of_int);
|
|
|
513 t = INT;
|
|
|
514 } else if (tag==DREGISTER) {
|
|
|
515 /* fregs[reg]==INPUT_REG case should be considered */
|
|
|
516 n->dsp = new_lvar(size_of_double);
|
|
|
517 t = DOUBLE;
|
|
|
518 } else error(-1);
|
|
|
519 n->sc = LVAR;
|
|
|
520 lvar = list2(LVAR,n->dsp);
|
|
|
521 g_expr_u(assign_expr0(list2(LVAR,n->dsp),list3(tag,reg,(int)n),t,t));
|
|
|
522 if (tag==REGISTER) {
|
|
|
523 free_register(reg);
|
|
|
524 } else if (tag==DREGISTER) {
|
|
|
525 free_fregister(reg);
|
|
|
526 }
|
|
|
527 return g_expr0(lvar);
|
|
|
528 #endif
|
|
|
529 }
|
|
|
530
|
|
61
|
531 /* goto arguments list */
|
|
|
532 /* target list4(list2(tag,disp),cdr,ty,source_expr) */
|
|
|
533 /* source expr=listn(tag,...) */
|
|
|
534 /* source (after) list2(tag,disp) */
|
|
|
535 /* source list list3(e,cdr,sz) */
|
|
|
536
|
|
|
537 #define DEBUG_PARALLEL_ASSIGN 1
|
|
|
538
|
|
|
539 int
|
|
|
540 overrap(int t,int sz,int source)
|
|
|
541 {
|
|
|
542 int s,s0,s1;
|
|
|
543 int t0=cadr(t);
|
|
|
544 int t1=t0+sz;
|
|
|
545 for(;source;source=cadr(source)) {
|
|
|
546 s=car(source); s0=cadr(s);
|
|
|
547 if(car(s)==REGISTER && car(t)==REGISTER) {
|
|
|
548 if(s0==t0) return s;
|
|
|
549 } else if (is_same_type(s,t)) {
|
|
|
550 s1=s0+caddr(source);
|
|
|
551 #if DEBUG_PARALLEL_ASSIGN>1
|
|
|
552 printf("# ovedrrap source %d t0 %d t1 %d\n",car(car(t)),t0,t1);
|
|
|
553 printf("# ovedrrap target %d s0 %d s1 %d\n",car(car(source)),s0,s1);
|
|
|
554 printf("# ovedrrap equal = %d\n",((t0<=s0&&s0<t1)||(t0<s1&&s1<=t1)));
|
|
|
555 #endif
|
|
|
556 if((t0<=s0&&s0<t1)||(t0<s1&&s1<=t1)) return s;
|
|
|
557 }
|
|
|
558 }
|
|
|
559 return 0;
|
|
|
560 }
|
|
|
561
|
|
|
562 void
|
|
|
563 remove_target(int *target,int t,int *use)
|
|
|
564 {
|
|
|
565 int use0=*use;
|
|
|
566 while(use0) {
|
|
|
567 if (car(use0)==t) {
|
|
99
|
568 if (car(caddr(use0))==REGISTER)
|
|
|
569 free_register(cadr(caddr(use0)));
|
|
|
570 else if (car(caddr(use0))==DREGISTER)
|
|
|
571 free_fregister(cadr(caddr(use0)));
|
|
61
|
572 break;
|
|
|
573 }
|
|
|
574 use0 = cadr(use0);
|
|
|
575 }
|
|
|
576 remove0(target,t);
|
|
|
577 }
|
|
|
578
|
|
|
579 void
|
|
|
580 save_target(int t,int s,int *target,int *use,int sz,int ty)
|
|
|
581 {
|
|
|
582 int e1;
|
|
|
583 /*新しいレジスタ(or スタック)を取得する*/
|
|
|
584 if (sz==size_of_int && (e1=get_register())!=-1) {
|
|
105
|
585 e1=list3(REGISTER,e1,0);
|
|
61
|
586 *use=list3(t,*use,e1);
|
|
99
|
587 g_expr_u(assign_expr0(e1,s,ty,ty));
|
|
|
588 *target = append4(*target,t,ty,e1);
|
|
|
589 } else if (sz==size_of_double && (e1=get_fregister())!=-1) {
|
|
105
|
590 e1=list3(DREGISTER,e1,0);
|
|
99
|
591 *use=list3(t,*use,e1);
|
|
83
|
592 g_expr_u(assign_expr0(e1,s,ty,ty));
|
|
61
|
593 *target = append4(*target,t,ty,e1);
|
|
|
594 } else {
|
|
94
|
595 g_expr_u(assign_expr0((e1=list2(LVAR,new_lvar(sz))),s,ty,ty));
|
|
61
|
596 *target = append4(*target,t,ty,e1);
|
|
|
597 }
|
|
|
598 }
|
|
|
599
|
|
|
600 int
|
|
|
601 circular_dependency(int t,int s,int *target,int *source)
|
|
|
602 {
|
|
|
603 int target0=*target;
|
|
|
604 int t1,sz,ty,s1;
|
|
|
605 while(target0) {
|
|
|
606 if (cadddr(target0)==s) {
|
|
|
607 t1=car(target0);
|
|
|
608 s=cadddr(target0);
|
|
|
609 sz=size(ty=caddr(target0));
|
|
|
610 if(t==t1) {
|
|
|
611 #if DEBUG_PARALLEL_ASSIGN
|
|
|
612 printf("# circular dependency %d ty %d+%d sz %d\n",car(t1),ty,cadr(t1),sz);
|
|
|
613 #endif
|
|
|
614 return 1;
|
|
|
615 }
|
|
|
616 if ((s1=overrap(t1,sz,*source))) {
|
|
|
617 /* another overrap start over */
|
|
|
618 return circular_dependency(t,s1,target,source);
|
|
|
619 }
|
|
|
620 }
|
|
|
621 target0=cadr(target0);
|
|
|
622 }
|
|
|
623 return 0;
|
|
|
624 }
|
|
|
625
|
|
|
626 void
|
|
|
627 parallel_assign(int *target,int *source,int *processing,int *use)
|
|
|
628 {
|
|
|
629 int t,s,sz,ty,target0,s1;
|
|
|
630 while(*target) {
|
|
|
631 target0=*target;
|
|
|
632 while(target0) {
|
|
|
633 t=car(target0); s=cadddr(target0);
|
|
|
634 sz=size(ty=caddr(target0));
|
|
|
635 if(car(t)==car(s) && cadr(t)==cadr(s)) {
|
|
|
636 /*書き込み先が自分自身*/
|
|
|
637 #if DEBUG_PARALLEL_ASSIGN
|
|
|
638 printf("# remove same %d ty %d+%d sz %d\n",car(t),ty,cadr(t),sz);
|
|
|
639 #endif
|
|
|
640 remove_target(target,t,use);
|
|
|
641 /* 破壊されては困るので、source listからは除かない */
|
|
|
642 } else if (!(s1=overrap(t,sz,*source))) {
|
|
|
643 /* 重なってないので安心して書き込める */
|
|
|
644 #if DEBUG_PARALLEL_ASSIGN
|
|
|
645 printf("# normal assign %d ty %d+%d sz %d\n",car(t),ty,cadr(t),sz);
|
|
|
646 #endif
|
|
83
|
647 g_expr_u(assign_expr0(t,s,ty,ty));
|
|
61
|
648 remove_target(target,t,use); remove0(source,s);
|
|
|
649 } else {
|
|
|
650 if(circular_dependency(t,s1,target,source)) {
|
|
|
651 #if DEBUG_PARALLEL_ASSIGN
|
|
|
652 printf("# saving %d ty %d+%d sz %d\n",car(t),ty,cadr(t),sz);
|
|
|
653 #endif
|
|
|
654 remove_target(target,t,use); remove0(source,s);
|
|
|
655 save_target(t,s,target,use,sz,ty);
|
|
|
656 }
|
|
|
657 }
|
|
|
658 target0=cadr(target0);
|
|
|
659 }
|
|
|
660 }
|
|
|
661 }
|
|
|
662
|
|
|
663 void
|
|
|
664 remove0(int *parent,int e)
|
|
|
665 {
|
|
|
666 int list;
|
|
|
667 while ((list=*parent)) {
|
|
|
668 if (car(list)==e) {
|
|
|
669 *parent= cadr(list); return;
|
|
|
670 } else {
|
|
|
671 parent=&cadr(list);
|
|
|
672 }
|
|
|
673 }
|
|
|
674 }
|
|
|
675
|
|
105
|
676 /*
|
|
61
|
677 void
|
|
|
678 remove0_all(int *parent,int e)
|
|
|
679 {
|
|
|
680 int list;
|
|
|
681 while ((list=*parent)) {
|
|
|
682 if (car(list)==e) {
|
|
|
683 *parent= cadr(list);
|
|
|
684 } else {
|
|
|
685 parent=&cadr(list);
|
|
|
686 }
|
|
|
687 }
|
|
|
688 }
|
|
105
|
689 */
|
|
61
|
690
|
|
|
691 int
|
|
|
692 is_simple(int e1)
|
|
|
693 {
|
|
|
694 return (
|
|
99
|
695 e1==CONST || e1==FNAME || e1==LVAR || e1==REGISTER ||e1==DREGISTER ||
|
|
81
|
696 e1==GVAR || e1==RGVAR || e1==RLVAR || e1==CRLVAR || e1==CRGVAR ||
|
|
|
697 e1==DRLVAR || e1==FRLVAR
|
|
61
|
698 );
|
|
|
699 }
|
|
|
700
|
|
|
701 int
|
|
|
702 is_same_type(int e1,int e2)
|
|
|
703 {
|
|
|
704 int ce1=car(e1);
|
|
|
705 int ce2=car(e2);
|
|
|
706 return (
|
|
81
|
707 (ce1==LVAR && (ce2==RLVAR||ce2==CRLVAR||ce2==FRLVAR||ce2==DRLVAR))
|
|
|
708 || (ce2==LVAR && (ce1==RLVAR||ce1==CRLVAR||ce1==FRLVAR||ce1==DRLVAR))
|
|
|
709 || (ce1==GVAR && (ce2==RGVAR||ce2==CRGVAR||ce2==FRGVAR||ce2==DRGVAR))
|
|
|
710 || (ce2==GVAR && (ce1==RGVAR||ce1==CRGVAR||ce1==FRGVAR||ce1==DRGVAR))
|
|
61
|
711 );
|
|
|
712 }
|
|
|
713
|
|
|
714 int
|
|
|
715 is_memory(int e1)
|
|
|
716 {
|
|
|
717 int ce1=car(e1);
|
|
|
718 return (
|
|
81
|
719 ce1==LVAR ||ce1==RLVAR||ce1==CRLVAR || ce1==DRLVAR ||
|
|
|
720 ce1==GVAR ||ce1==RGVAR||ce1==CRGVAR || ce1==DRGVAR ||
|
|
99
|
721 ce1==REGISTER|| ce1==DREGISTER
|
|
61
|
722 );
|
|
|
723 }
|
|
|
724
|
|
98
|
725 int
|
|
|
726 is_code(NMTBL *fnptr)
|
|
|
727 {
|
|
|
728 int type = fnptr->ty;
|
|
|
729 return type==CODE|| (type>0 && car(type)==CODE);
|
|
|
730 }
|
|
|
731
|
|
|
732 int
|
|
|
733 is_function(NMTBL *fnptr)
|
|
|
734 {
|
|
|
735 int type = fnptr->ty;
|
|
|
736 return type==FUNCTION || (type>0 && car(type)==FUNCTION);
|
|
|
737 }
|
|
|
738
|
|
|
739
|
|
61
|
740 void
|
|
|
741 jump(int e1, int env)
|
|
|
742 {
|
|
99
|
743 int e2,e3,e4,sz,arg_size,ty,regs,fregs;
|
|
61
|
744 int t0,s0;
|
|
|
745 NMTBL *code0;
|
|
|
746 int target = 0;
|
|
|
747 int source = 0;
|
|
|
748 int processing = 0;
|
|
|
749 int use = 0;
|
|
|
750
|
|
|
751 /* まず、サイズを計算しながら、決まった形に落す。 */
|
|
|
752
|
|
99
|
753 arg_size = 0; regs = 0;
|
|
|
754 fregs = 0;
|
|
61
|
755 for (e3 = reverse0(caddr(e1)); e3; e3 = cadr(e3)) {
|
|
|
756 e2 = car(e3); sz = size(ty=caddr(e3));
|
|
103
|
757 if (scalar(ty) &&
|
|
|
758 regs < MAX_CODE_INPUT_REGISTER_VAR) {
|
|
105
|
759 target=list4(get_input_register_var(regs++,0),
|
|
99
|
760 target,ty,e2);
|
|
103
|
761 } else if ((ty==DOUBLE||ty==FLOAT) &&
|
|
|
762 fregs < MAX_CODE_INPUT_DREGISTER_VAR) {
|
|
105
|
763 target=list4(get_input_fregister_var(fregs++,0),
|
|
99
|
764 target,ty,e2);
|
|
61
|
765 } else {
|
|
|
766 target=list4(list2(LVAR,0), target,ty,e2);
|
|
|
767 arg_size += sz;
|
|
|
768 }
|
|
|
769 #if DEBUG_PARALLEL_ASSIGN
|
|
|
770 printf("# target %d ty %d+%d sz %d\n",car(car(target)),ty,cadr(car(target)),sz);
|
|
|
771 #endif
|
|
|
772 }
|
|
|
773
|
|
|
774 /* disp を飛び先似合わせて修正 */
|
|
98
|
775 if (is_code(fnptr)) {
|
|
61
|
776 if (-arg_size<disp) disp = -arg_size;
|
|
|
777 } else {
|
|
|
778 if (disp_offset-arg_size<disp) disp = disp_offset-arg_size;
|
|
|
779 }
|
|
|
780
|
|
|
781 /* 複雑な式を前もって計算しておく */
|
|
|
782 /* 必要なら局所変数を用いる。 */
|
|
|
783 /* 局所変数へのオフセットを覚えておく */
|
|
|
784
|
|
|
785 for (e2 = target; e2; e2 = cadr(e2)) {
|
|
|
786 t0=car(e2); s0=cadddr(e2);
|
|
|
787 sz=size(ty=caddr(e2));
|
|
|
788 if(car(t0)==LVAR) {
|
|
|
789 /* ここで、書込先アドレスを決める */
|
|
|
790 cadr(t0)=-arg_size;
|
|
|
791 arg_size-=sz;
|
|
|
792 }
|
|
|
793 if (!is_simple(car(s0))) {
|
|
94
|
794 g_expr_u(assign_expr0((e4=list2(LVAR,new_lvar(sz))),s0,ty,ty));
|
|
61
|
795 cadddr(e2)=e4;
|
|
|
796 s0=e4;
|
|
|
797 } else if (is_same_type(t0,s0)) {
|
|
|
798 if(cadr(t0)==cadr(s0)) {
|
|
|
799 #if DEBUG_PARALLEL_ASSIGN
|
|
|
800 printf("# remove same memory %d ty %d+%d sz %d\n",car(t0),ty,cadr(t0),sz);
|
|
|
801 #endif
|
|
|
802 /* we should check size also (but currently useless */
|
|
|
803 remove0(&target,t0);
|
|
|
804 /* still we have source to avoid overwrite */
|
|
|
805 }
|
|
|
806 }
|
|
|
807 if(is_memory(s0)) {
|
|
|
808 source=list3(s0,source,sz);
|
|
|
809 #if DEBUG_PARALLEL_ASSIGN
|
|
|
810 printf("# source %d ty %d+%d sz %d\n",car(car(source)),ty,cadr(car(source)),sz);
|
|
|
811 #endif
|
|
|
812 }
|
|
|
813 }
|
|
|
814
|
|
|
815 /* compute jump address */
|
|
|
816 e2 = cadr(e1);
|
|
|
817 if (car(e2) == FNAME) {
|
|
|
818 code0=(NMTBL *)cadr(e2);
|
|
98
|
819 if (!is_code(code0)) {
|
|
61
|
820 error(TYERR); return;
|
|
|
821 }
|
|
|
822 } else { /* indirect */
|
|
|
823 g_expr(e2);
|
|
|
824 emit_push();
|
|
|
825 }
|
|
|
826 if (env) {
|
|
|
827 g_expr(env);
|
|
|
828 emit_push();
|
|
|
829 }
|
|
|
830
|
|
|
831 /* 並列代入を実行 */
|
|
|
832
|
|
|
833 parallel_assign(&target,&source,&processing,&use);
|
|
|
834 while (use) {
|
|
99
|
835 if (car(caddr(use))==REGISTER)
|
|
|
836 free_register(cadr(caddr(use)));
|
|
|
837 else if (car(caddr(use))==DREGISTER)
|
|
|
838 free_fregister(cadr(caddr(use)));
|
|
|
839 use=cadr(use);
|
|
61
|
840 }
|
|
|
841 if(target) error(-1);
|
|
|
842
|
|
|
843 if (env) {
|
|
|
844 /* change the frame pointer */
|
|
|
845 e3 = emit_pop(0);
|
|
|
846 code_frame_pointer(e3);
|
|
|
847 emit_pop_free(e3);
|
|
98
|
848 } else if (is_function(fnptr)) {
|
|
61
|
849 code_fix_frame_pointer(disp_offset);
|
|
|
850 }
|
|
|
851
|
|
|
852 if (car(e2) == FNAME) {
|
|
|
853 code_jmp(code0->nm);
|
|
|
854 } else {
|
|
|
855 e2 = emit_pop(0);
|
|
|
856 code_indirect_jmp(e2);
|
|
|
857 emit_pop_free(e2);
|
|
|
858 }
|
|
|
859 }
|
|
|
860
|
|
|
861 void
|
|
|
862 machinop(int e1)
|
|
|
863 {
|
|
|
864 int e2,e3,op;
|
|
|
865
|
|
|
866 e2 = cadr(e1);
|
|
|
867 op = car(e1);
|
|
|
868 e3 = caddr(e1);
|
|
|
869 g_expr(e3);
|
|
|
870 emit_push();
|
|
|
871 g_expr(e2);
|
|
|
872 tosop(car(e1),(e2=pop_register()));
|
|
|
873 emit_pop_free(e2);
|
|
|
874 regv[creg]=1;
|
|
|
875 return;
|
|
|
876 }
|
|
|
877
|
|
81
|
878 void
|
|
|
879 dmachinop(int e1)
|
|
|
880 {
|
|
|
881 int e2,e3,op;
|
|
|
882
|
|
|
883 e2 = cadr(e1);
|
|
|
884 op = car(e1);
|
|
|
885 e3 = caddr(e1);
|
|
|
886 g_expr(e3);
|
|
|
887 emit_dpush();
|
|
|
888 g_expr(e2);
|
|
94
|
889 dtosop(car(e1),(e2=emit_dpop(1)));
|
|
81
|
890 emit_dpop_free(e2);
|
|
83
|
891 fregv[freg]=1;
|
|
81
|
892 return;
|
|
|
893 }
|
|
|
894
|
|
61
|
895
|
|
|
896 void
|
|
|
897 sassign(int e1)
|
|
|
898 {
|
|
|
899 int e2,e3,e4,sz,xreg,det;
|
|
|
900
|
|
|
901 /* structure assignment */
|
|
|
902 e2 = cadr(e1); /* pointer variable to the struct */
|
|
|
903 e3 = cadr(e2); /* offset of the variable (distination) */
|
|
|
904 e4 = caddr(e1); /* right value (source) */
|
|
|
905 sz = cadddr(e1); /* size of struct or union */
|
|
|
906 g_expr(e4);
|
|
|
907 emit_push();
|
|
|
908 g_expr(e2);
|
|
|
909 xreg = emit_pop(0);
|
|
|
910 /* 一般的にはコピーのオーバラップの状況は実行時にしかわからない */
|
|
|
911 /* しかし、わかる場合もある */
|
|
|
912 if (car(e4)==RSTRUCT) e4=cadr(e4);
|
|
|
913 if (is_same_type(e2,e4)) {
|
|
|
914 if(cadr(e2)<cadr(e4)) sz=-sz;
|
|
|
915 det=1;
|
|
|
916 } else {
|
|
|
917 det = 0;
|
|
|
918 }
|
|
|
919 emit_copy(xreg,creg,sz,0,1,det);
|
|
|
920 emit_pop_free(xreg);
|
|
|
921 return;
|
|
|
922 }
|
|
|
923
|
|
|
924 void
|
|
|
925 assign(int e1)
|
|
|
926 {
|
|
|
927 int e2,e3,e4,byte;
|
|
|
928
|
|
|
929 byte=(car(e1) == CASS);
|
|
|
930 /* e2=e4 */
|
|
|
931 e2 = cadr(e1);
|
|
|
932 e3 = cadr(e2);
|
|
|
933 e4 = caddr(e1);
|
|
|
934 switch(car(e2)) {
|
|
|
935 case GVAR: /* i=3 */
|
|
|
936 g_expr(e4);
|
|
103
|
937 code_assign_gvar(e2,creg,byte);
|
|
61
|
938 return;
|
|
|
939 case LVAR:
|
|
|
940 g_expr(e4);
|
|
103
|
941 code_assign_lvar(lvar(cadr(e2)),creg,byte);
|
|
61
|
942 return;
|
|
|
943 case REGISTER:
|
|
|
944 g_expr(e4);
|
|
|
945 if (creg!=cadr(e2))
|
|
|
946 code_assign_register(cadr(e2),byte);
|
|
|
947 return;
|
|
|
948 }
|
|
|
949 g_expr(e2);
|
|
|
950 emit_push();
|
|
|
951 g_expr(e4);
|
|
|
952 e2 = emit_pop(0);
|
|
|
953 code_assign(e2,byte);
|
|
|
954 emit_pop_free(e2);
|
|
|
955 regv[creg]=1;
|
|
|
956 return;
|
|
|
957 }
|
|
|
958
|
|
|
959 void
|
|
81
|
960 dassign(int e1)
|
|
|
961 {
|
|
82
|
962 int e2,e3,e4,d;
|
|
81
|
963
|
|
|
964 /* e2=e4 */
|
|
|
965 e2 = cadr(e1);
|
|
|
966 e3 = cadr(e2);
|
|
|
967 e4 = caddr(e1);
|
|
82
|
968 d = (car(e1)==LASS)?2:(car(e1)==DASS)?1:0;
|
|
81
|
969 switch(car(e2)) {
|
|
82
|
970 case GVAR:
|
|
81
|
971 g_expr(e4);
|
|
103
|
972 code_dassign_gvar(e2,freg,d);
|
|
81
|
973 return;
|
|
|
974 case LVAR:
|
|
|
975 g_expr(e4);
|
|
103
|
976 code_dassign_lvar(lvar(cadr(e2)),freg,d);
|
|
81
|
977 return;
|
|
|
978 }
|
|
|
979 g_expr(e2);
|
|
82
|
980 emit_push();
|
|
81
|
981 g_expr(e4);
|
|
82
|
982 e2 = emit_pop(0);
|
|
103
|
983 code_dassign(e2,freg,d);
|
|
82
|
984 emit_pop_free(e2);
|
|
81
|
985 return;
|
|
|
986 }
|
|
|
987
|
|
|
988 void
|
|
61
|
989 assop(int e1)
|
|
|
990 {
|
|
|
991 int e2,e3,byte,op;
|
|
|
992
|
|
|
993 /* e2 op= e3 */
|
|
|
994 byte = (car(e1) == CASSOP);
|
|
|
995 e2 = cadr(e1);
|
|
|
996 if (car(e2)==INDIRECT) e2=cadr(e2);
|
|
|
997 e3 = caddr(e1);
|
|
|
998 op = cadddr(e1);
|
|
|
999
|
|
|
1000 g_expr(e3);
|
|
|
1001 if (car(e2)==REGISTER) {
|
|
|
1002 code_register_assop(cadr(e2),op,byte);
|
|
|
1003 regv[creg]=1;
|
|
|
1004 return;
|
|
|
1005 }
|
|
|
1006 emit_push();
|
|
|
1007 g_expr(e2);
|
|
|
1008 code_assop(op,byte);
|
|
|
1009 regv[creg]=1;
|
|
|
1010 return;
|
|
|
1011 }
|
|
|
1012
|
|
81
|
1013 void
|
|
|
1014 dassop(int e1)
|
|
|
1015 {
|
|
83
|
1016 int e2,e3,op,d;
|
|
81
|
1017
|
|
83
|
1018 /* e2 op= e3 */
|
|
|
1019 d = (car(e1) == DASSOP);
|
|
|
1020 e2 = cadr(e1);
|
|
|
1021 if (car(e2)==INDIRECT) e2=cadr(e2);
|
|
|
1022 e3 = caddr(e1);
|
|
|
1023 op = cadddr(e1);
|
|
|
1024
|
|
|
1025 g_expr(e3);
|
|
|
1026 emit_dpush();
|
|
|
1027 g_expr(e2);
|
|
|
1028 code_dassop(op,d);
|
|
|
1029 regv[creg]=1;
|
|
|
1030 return;
|
|
81
|
1031 }
|
|
61
|
1032
|
|
95
|
1033 void
|
|
|
1034 cmpdimm(int e, int csreg)
|
|
|
1035 {
|
|
|
1036 code_cmpdimm(e, csreg);
|
|
|
1037 }
|
|
|
1038
|
|
|
1039 int
|
|
|
1040 csvalue()
|
|
|
1041 {
|
|
|
1042 return code_csvalue();
|
|
|
1043 }
|
|
|
1044
|
|
|
1045
|
|
61
|
1046 int
|
|
|
1047 fwdlabel(void)
|
|
|
1048 {
|
|
|
1049 return labelno++;
|
|
|
1050 }
|
|
|
1051
|
|
|
1052 void
|
|
|
1053 fwddef(int l)
|
|
|
1054 {
|
|
|
1055 control=1;
|
|
66
|
1056 if (!chk)
|
|
92
|
1057 code_label(l);
|
|
61
|
1058 }
|
|
|
1059
|
|
|
1060 int
|
|
|
1061 backdef(void)
|
|
|
1062 {
|
|
|
1063 control=1;
|
|
66
|
1064 if (!chk)
|
|
92
|
1065 code_label(labelno);
|
|
61
|
1066 return labelno++;
|
|
|
1067 }
|
|
|
1068
|
|
|
1069 void
|
|
|
1070 def_label(int cslabel, int dlabel)
|
|
|
1071 {
|
|
|
1072 int fl;
|
|
|
1073
|
|
|
1074 fl = 0;
|
|
|
1075 if (control) {
|
|
|
1076 jmp(fl=fwdlabel());
|
|
|
1077 }
|
|
|
1078 fwddef(cslabel);
|
|
|
1079 if (dlabel)
|
|
|
1080 jmp(dlabel);
|
|
|
1081 if (fl) {
|
|
|
1082 fwddef(fl);
|
|
|
1083 }
|
|
|
1084 }
|
|
|
1085
|
|
|
1086 void
|
|
|
1087 gen_source(char *s)
|
|
|
1088 {
|
|
|
1089 printf("%s",s);
|
|
|
1090 }
|
|
|
1091
|
|
|
1092 void
|
|
|
1093 ret(void)
|
|
|
1094 {
|
|
|
1095 code_set_fixed_creg(1);
|
|
|
1096 jmp(retlabel);
|
|
|
1097 }
|
|
|
1098
|
|
66
|
1099 void
|
|
|
1100 opening(char *filename)
|
|
|
1101 {
|
|
|
1102 emit_init();
|
|
|
1103 if (!chk)
|
|
|
1104 code_opening(filename);
|
|
|
1105 }
|
|
|
1106
|
|
|
1107 void
|
|
|
1108 closing()
|
|
|
1109 {
|
|
|
1110 if (!chk)
|
|
|
1111 code_closing();
|
|
|
1112 }
|
|
|
1113
|
|
99
|
1114 int
|
|
|
1115 contains_in_list(int e,int type)
|
|
|
1116 {
|
|
|
1117 while(e) {
|
|
|
1118 if(contains(car(e),type)) return 1;
|
|
|
1119 e = cadr(e);
|
|
|
1120 }
|
|
|
1121 return 0;
|
|
|
1122 }
|
|
|
1123
|
|
|
1124 int
|
|
|
1125 contains(int e,int type)
|
|
|
1126 {
|
|
|
1127 while(e) {
|
|
|
1128 if (car(e)==type) return 1;
|
|
|
1129 switch (car(e)){
|
|
|
1130 /* list arguments */
|
|
|
1131 case FUNCTION: case CODE:
|
|
|
1132 return contains_in_list(caddr(e),type);
|
|
|
1133 /* unary operators */
|
|
|
1134 case INDIRECT: case RINDIRECT: case CRINDIRECT:
|
|
|
1135 case DRINDIRECT: case FRINDIRECT: case ADDRESS: case MINUS: case DMINUS:
|
|
|
1136 case I2D: case D2I: case U2D: case D2U: case BNOT: case LNOT:
|
|
|
1137 case PREINC: case POSTINC: case DPREINC: case DPOSTINC:
|
|
|
1138 case FPREINC: case FPOSTINC: case CPOSTINC:
|
|
|
1139 case CPREINC: case CPOSTDEC: case CPREDEC:
|
|
|
1140 case RSTRUCT:
|
|
|
1141 e = cadr(e);
|
|
|
1142 continue;
|
|
|
1143 /* biary operators */
|
|
|
1144 case MUL: case UMUL: case DIV: case UDIV: case MOD: case UMOD:
|
|
|
1145 case LSHIFT: case ULSHIFT: case RSHIFT: case URSHIFT:
|
|
|
1146 case ADD: case SUB: case BAND: case EOR: case BOR: case CMP:
|
|
|
1147 case DMUL: case DDIV: case DADD: case DSUB: case DCMP: case DCMPGE:
|
|
|
1148 case SASS: case ASS: case CASS: case FASS: case DASS: case LASS:
|
|
|
1149 case ASSOP: case CASSOP: case DASSOP: case FASSOP: case COMMA:
|
|
|
1150 if (contains(cadr(e),type)) return 1;
|
|
|
1151 e = caddr(e);
|
|
|
1152 continue;
|
|
|
1153 /* tarary operators */
|
|
|
1154 case COND:
|
|
|
1155 if (contains(cadr(e), type)) return 1;
|
|
|
1156 if (contains(caddr(e),type)) return 1;
|
|
|
1157 e = cadddr(e);
|
|
|
1158 continue;
|
|
|
1159 default:
|
|
|
1160 /* nullary operators
|
|
|
1161 case GVAR: case RGVAR: case CRGVAR: case LVAR:
|
|
|
1162 case REGISTER: case DREGISTER:
|
|
|
1163 case RLVAR: case CRLVAR: case FRLVAR: case FRGVAR:
|
|
|
1164 case DRLVAR: case DRGVAR:
|
|
|
1165 case FNAME: case CONST: case DCONST: case STRING:
|
|
|
1166 case RETURN: case ENVIRONMENT: */
|
|
|
1167 return 0;
|
|
|
1168 }
|
|
|
1169 }
|
|
|
1170 return 0;
|
|
|
1171 }
|
|
|
1172
|
|
61
|
1173 /* end */
|
