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