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