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