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