|
297
|
1 /* Micro-C Switch Code generation Part */
|
|
607
|
2
|
|
|
3 /************************************************************************
|
|
|
4 ** Copyright (C) 2006 Shinji Kono
|
|
|
5 ** 連絡先： 琉球大学情報工学科 河野 真治
|
|
|
6 ** （E-Mail Address: kono@ie.u-ryukyu.ac.jp）
|
|
|
7 **
|
|
|
8 ** このソースのいかなる複写，改変，修正も許諾します。ただし、
|
|
|
9 ** その際には、誰が貢献したを示すこの部分を残すこと。
|
|
|
10 ** 再配布や雑誌の付録などの問い合わせも必要ありません。
|
|
|
11 ** 営利利用も上記に反しない範囲で許可します。
|
|
|
12 ** バイナリの配布の際にはversion messageを保存することを条件とします。
|
|
|
13 ** このプログラムについては特に何の保証もしない、悪しからず。
|
|
|
14 **
|
|
|
15 ** Everyone is permitted to do anything on this program
|
|
|
16 ** including copying, modifying, improving,
|
|
|
17 ** as long as you don't try to pretend that you wrote it.
|
|
|
18 ** i.e., the above copyright notice has to appear in all copies.
|
|
|
19 ** Binary distribution requires original version messages.
|
|
|
20 ** You don't have to ask before copying, redistribution or publishing.
|
|
|
21 ** THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
|
|
|
22 ***********************************************************************/
|
|
297
|
23
|
|
327
|
24 #include <stdio.h>
|
|
297
|
25 #include "mc.h"
|
|
327
|
26 #include "mc-parse.h"
|
|
|
27 #include "mc-codegen.h"
|
|
297
|
28 #include "mc-code.h"
|
|
|
29
|
|
|
30 #if CASE_CODE
|
|
|
31
|
|
299
|
32 extern void genswitch(int cslist,int cslabel);
|
|
297
|
33
|
|
|
34 /*
|
|
|
35 value label pair
|
|
|
36 cslist = list3(value,next,label) label==0 means skip
|
|
|
37 continuous cslist
|
|
|
38 chunks: list4(cslist,next,delta,list3(count,min,max))
|
|
|
39 mergeable chunks count list
|
|
|
40 merge: list4(continuous number of chunk,next,delta,case_count);
|
|
|
41 index list
|
|
|
42 index: list4(label,next,max,min);
|
|
|
43 */
|
|
|
44
|
|
|
45 #define chunk_max(chunks) caddr(cadddr(chunks))
|
|
|
46 #define chunk_min(chunks) cadr(cadddr(chunks))
|
|
|
47 #define index_max(index) caddr(index)
|
|
|
48 #define index_min(index) cadddr(index)
|
|
298
|
49 #define index_label(index) car(index)
|
|
|
50
|
|
300
|
51 #define CASE_TABLE_COUNT 10
|
|
302
|
52 #define CASE_INDEX_COUNT CASE_TABLE_COUNT // have to be equal
|
|
298
|
53
|
|
361
|
54 static int djmp;
|
|
|
55
|
|
|
56 static void
|
|
|
57 check_djmp()
|
|
|
58 {
|
|
|
59 if (control && dlabel && djmp)
|
|
|
60 jmp(dlabel);
|
|
|
61 djmp = 0;
|
|
|
62 }
|
|
297
|
63
|
|
|
64 /*
|
|
326
|
65 group continuous case value
|
|
297
|
66 */
|
|
|
67
|
|
|
68 static int
|
|
|
69 make_chunk(int cslist)
|
|
|
70 {
|
|
303
|
71 register int delta,delta1,list,p,count;
|
|
297
|
72 // cslist is already sorted
|
|
|
73 delta = 0;
|
|
|
74 list = list4(cslist,0,1,list3(0,car(cslist) /* min */,0));
|
|
|
75 count=1;
|
|
|
76 for(p=0;cadr(cslist);cslist = cadr(cslist),count++) {
|
|
|
77 // compute new delta
|
|
|
78 delta1 = car(cadr(cslist))-car(cslist);
|
|
|
79 // empty case
|
|
|
80 if (!caddr(cslist)) count--;
|
|
|
81 if (delta==0) {
|
|
|
82 // 2nd element
|
|
|
83 caddr(list) = delta = delta1;
|
|
|
84 if (p) cadr(p)=0; // terminate previous chunk
|
|
|
85 } else if (delta1!=delta) {
|
|
|
86 // not contiguous, start new list
|
|
|
87 caddr(cadddr(list)) = car(cslist); // max
|
|
|
88 car(cadddr(list)) = count; count=0;
|
|
|
89 delta = 0;
|
|
|
90 list = list4(cadr(cslist),list,1,list3(0,0,0));
|
|
|
91 cadr(cadddr(list)) = car(cadr(cslist)); // min
|
|
|
92 // prepare terminate point for next turn
|
|
|
93 p=cslist;
|
|
|
94 }
|
|
|
95 }
|
|
|
96 if (p) cadr(p)=0; // terminate previous chunk
|
|
|
97 car(cadddr(list)) = count;
|
|
|
98 caddr(cadddr(list)) = car(cslist); // max
|
|
|
99 return list;
|
|
|
100 }
|
|
|
101
|
|
592
|
102 #define CASE_MERGE_RATE 50
|
|
297
|
103
|
|
303
|
104 static int gcd(int i0,int j0)
|
|
297
|
105 {
|
|
303
|
106 register int k,i=i0,j=j0;
|
|
297
|
107 if (i<j) { k=i; i=j; j=k;}
|
|
|
108 for(;;) {
|
|
|
109 if ((k=i%j)==0) return j;
|
|
|
110 i = j; j = k;
|
|
|
111 }
|
|
|
112 }
|
|
|
113
|
|
|
114 /*
|
|
|
115 check two chunks are mergeable or not.
|
|
|
116 */
|
|
|
117
|
|
|
118 static int
|
|
|
119 merge_chunk_p(int *delta,int max,int min,int *count,int delta1,int count1)
|
|
|
120 {
|
|
|
121 int range = max-min;
|
|
|
122 int g;
|
|
623
|
123 int c = 128*CASE_MERGE_RATE/100;
|
|
297
|
124 // compute possible merge delta
|
|
|
125 g = gcd(*delta,delta1);
|
|
|
126 g = gcd(g,range);
|
|
|
127 range /= g;
|
|
|
128 *count = count1 = count1+*count;
|
|
|
129 *delta = g;
|
|
311
|
130 #if 0
|
|
297
|
131 if (count1*128>(range*128*CASE_MERGE_RATE/100)) {
|
|
468
|
132 printf("## min %d, max %d, count %d, delta %d, rate %g t=%d\n",
|
|
297
|
133 min,max,count1,g,
|
|
|
134 ((double)count1)*100.0/range,
|
|
|
135 count1*128>(range*128*CASE_MERGE_RATE/100)
|
|
|
136 );
|
|
|
137 }
|
|
|
138 #endif
|
|
|
139 // count/((max-min)/delta) > 0.8
|
|
623
|
140 return count1*128>(range*c);
|
|
297
|
141 }
|
|
|
142
|
|
311
|
143 static void
|
|
468
|
144 free_chunks(int chunks)
|
|
311
|
145 {
|
|
|
146 int p;
|
|
|
147 while(chunks) {
|
|
|
148 p = car(chunks);
|
|
|
149 chunks = cadr(chunks); // free_glist3 will destroy cadr
|
|
|
150 free_glist3(p);
|
|
|
151 }
|
|
|
152 }
|
|
297
|
153
|
|
|
154 static int
|
|
|
155 merge_chunk(int chunks)
|
|
|
156 {
|
|
303
|
157 register int list = chunks;
|
|
|
158 register int tail,last,max,min,i;
|
|
|
159 register int c_count,p,widest;
|
|
|
160 register int merge = 0;
|
|
|
161 int count,delta=1;
|
|
|
162
|
|
297
|
163 while(cadr(list)) {
|
|
|
164 p = cadddr(list);
|
|
|
165 c_count = count = car(p); max=caddr(p);
|
|
|
166 widest = 1; last = list;
|
|
|
167 delta = caddr(list);
|
|
|
168 // check possible merge against the end of the chunks
|
|
|
169 for(i=1,tail=cadr(list);cadr(tail); tail=cadr(tail),i++) {
|
|
|
170 p = cadddr(tail);
|
|
|
171 min = cadr(p);
|
|
|
172 if (merge_chunk_p(&delta,max,min,&count,caddr(tail),car(p))) {
|
|
|
173 // It is mergeable.
|
|
|
174 widest = i+1; last = tail; c_count=count;
|
|
|
175 }
|
|
|
176 }
|
|
|
177 merge = list4(widest,merge,delta,c_count);
|
|
|
178 // skip merged chunks
|
|
|
179 list = cadr(last);
|
|
|
180 }
|
|
|
181 // last one can remain.
|
|
|
182 if (list) merge = list4(1,merge,caddr(list),car(cadddr(list)));
|
|
|
183 return merge;
|
|
|
184 }
|
|
|
185
|
|
|
186 static int
|
|
|
187 cascade_compare(int count,int cslist)
|
|
|
188 {
|
|
|
189 int list;
|
|
|
190 for(;count-->0;cslist=cadr(cslist)) {
|
|
|
191 list = car(cslist);
|
|
609
|
192 #ifdef DEBUG_MERGE
|
|
468
|
193 printf("## cascade cases delta=%d count=%d min=%d max=%d\n",
|
|
297
|
194 caddr(cslist),car(cadddr(cslist)),
|
|
|
195 cadr(cadddr(cslist)),caddr(cadddr(cslist))
|
|
|
196 );
|
|
609
|
197 #endif
|
|
297
|
198 for(;list; list=cadr(list)) {
|
|
|
199 if (caddr(list))
|
|
|
200 cmpdimm(car(list),csvalue1,caddr(list),0);
|
|
|
201 // value register label mode
|
|
|
202 }
|
|
|
203 }
|
|
302
|
204 // have to be fall thru
|
|
297
|
205 return cslist;
|
|
|
206 }
|
|
|
207
|
|
300
|
208 static int
|
|
|
209 table_jump(int count,int delta,int chunks)
|
|
|
210 {
|
|
|
211 int list,i;
|
|
569
|
212 int l,max=0,min;
|
|
382
|
213 if (!code_table_jump_p(delta))
|
|
300
|
214 return cascade_compare(count,chunks);
|
|
|
215
|
|
|
216 min=cadr(cadddr(chunks));
|
|
|
217 // find max
|
|
|
218 for(i=0,list=chunks;i<count;list=cadr(list),i++) {
|
|
|
219 max=caddr(cadddr(list));
|
|
|
220 }
|
|
|
221
|
|
468
|
222 printf("## table count %d delta %d max %d min %d\n",
|
|
300
|
223 count,delta,max,min);
|
|
|
224
|
|
|
225 l = fwdlabel();
|
|
458
|
226 if (car(csvalue1)!=REGISTER) error(-1);
|
|
|
227 code_table_jump(l,cadr(csvalue1),delta,max,min,dlabel);
|
|
302
|
228 control=0;
|
|
300
|
229 code_table_open(l);
|
|
|
230 i = min;
|
|
|
231 for(;count-->0;chunks=cadr(chunks)) {
|
|
|
232 list = car(chunks);
|
|
|
233 for(;list; list=cadr(list)) {
|
|
|
234 if (caddr(list)) {
|
|
|
235 for(;i<car(list);i+=delta) {
|
|
|
236 code_table_value(dlabel,l);
|
|
|
237 }
|
|
|
238 code_table_value(caddr(list),l);
|
|
|
239 i+=delta;
|
|
|
240 }
|
|
|
241 }
|
|
|
242 }
|
|
|
243 code_table_close();
|
|
|
244 return chunks;
|
|
|
245 }
|
|
|
246
|
|
297
|
247
|
|
|
248 /*
|
|
|
249 generate index jmp
|
|
|
250 */
|
|
|
251
|
|
|
252 static void
|
|
|
253 switch_index_jmp(int index,int label)
|
|
|
254 {
|
|
298
|
255 int value = index_min(index);
|
|
297
|
256 cmpdimm(value,csvalue1,label,LT);
|
|
|
257 // value register label mode
|
|
|
258 }
|
|
|
259
|
|
|
260 /*
|
|
|
261 generate leaf index branch
|
|
|
262 */
|
|
|
263
|
|
|
264 static int
|
|
298
|
265 switch_make_index_leaf(int count,int index,int level)
|
|
297
|
266 {
|
|
298
|
267 control=1;
|
|
468
|
268 printf("## index leaf count=%d level=%d\n",count,level);
|
|
297
|
269 for(;count-- !=0 && cadr(index);index=cadr(index)) {
|
|
298
|
270 switch_index_jmp( cadr(index), index_label(index) );
|
|
297
|
271 }
|
|
|
272 if (!cadr(index)) {
|
|
|
273 // don't check max boundary
|
|
298
|
274 jmp(index_label(index));
|
|
297
|
275 return 0;
|
|
|
276 }
|
|
298
|
277 if (count!= -1) error(-1);
|
|
361
|
278 djmp = 1;
|
|
297
|
279 return index;
|
|
|
280 }
|
|
|
281
|
|
|
282 /*
|
|
|
283 generate index switch branch (no table).
|
|
|
284 if necessary generate higher index.
|
|
|
285 */
|
|
|
286
|
|
|
287 static void
|
|
299
|
288 switch_make_index(int index0,int count,int cslabel,int gmax,int level)
|
|
297
|
289 {
|
|
|
290 int index=0;
|
|
|
291 int icount=0;
|
|
|
292 int l,min,max;
|
|
298
|
293 control=1;
|
|
299
|
294 if (count <= CASE_INDEX_COUNT) {
|
|
361
|
295 check_djmp();
|
|
297
|
296 fwddef(cslabel);
|
|
298
|
297 switch_make_index_leaf(-1,index0,level);
|
|
299
|
298 } else {
|
|
|
299 while (index0) {
|
|
361
|
300 check_djmp();
|
|
299
|
301 l = backdef();
|
|
|
302 min = index_min(index0);
|
|
|
303 index0=switch_make_index_leaf(CASE_INDEX_COUNT,index0,level);
|
|
|
304 if (index0) {
|
|
|
305 max = index_min(index0)-1;
|
|
|
306 } else {
|
|
|
307 max = gmax;
|
|
|
308 }
|
|
|
309 index = list4(l,index,max,min);
|
|
|
310 count-=CASE_INDEX_COUNT;
|
|
|
311 icount++;
|
|
|
312 }
|
|
|
313 switch_make_index(reverse0(index),icount,cslabel,gmax,level+1);
|
|
297
|
314 }
|
|
|
315 }
|
|
|
316
|
|
|
317 /*
|
|
|
318 generate leaf switch branch or table jump
|
|
|
319 */
|
|
|
320
|
|
|
321 static int
|
|
300
|
322 switch_leaf(int count,int merge,int chunks)
|
|
297
|
323 {
|
|
298
|
324 control=1;
|
|
297
|
325 for(;count-- !=0 && merge;merge=cadr(merge)) {
|
|
609
|
326 #ifdef DEBUG_MERGE
|
|
468
|
327 printf("## merge count %d delta %d c_count %d\n",
|
|
297
|
328 car(merge),caddr(merge),cadddr(merge));
|
|
609
|
329 #endif
|
|
302
|
330 if (cadddr(merge)>CASE_TABLE_COUNT) {
|
|
300
|
331 chunks = table_jump(car(merge),caddr(merge),chunks);
|
|
302
|
332 } else {
|
|
300
|
333 chunks = cascade_compare(car(merge),chunks);
|
|
302
|
334 }
|
|
297
|
335 }
|
|
302
|
336 // table_jump has no fall thru, but cascade_compare does.
|
|
361
|
337 if (control) djmp = 1;
|
|
300
|
338 return chunks;
|
|
297
|
339 }
|
|
|
340
|
|
|
341 /*
|
|
|
342 make index if necessary or
|
|
|
343 generate case branch or table jump
|
|
|
344 */
|
|
|
345
|
|
|
346 static void
|
|
299
|
347 switch_index(int merge,int chunks,int cslabel,int gmax)
|
|
297
|
348 {
|
|
|
349 int m,l,max,min;
|
|
|
350 int chnkcnt = 0;
|
|
|
351 int icount = 0;
|
|
|
352 int count = 0;
|
|
|
353 int index = 0;
|
|
|
354 for(m=merge;m;m=cadr(m)) {
|
|
298
|
355 if (!index && !cadr(m)) break; // no index for single chunk
|
|
297
|
356 chnkcnt++;
|
|
|
357 count += cadddr(m);
|
|
|
358 if (count > CASE_INDEX_COUNT || (index && !cadr(m))) {
|
|
|
359 icount++;
|
|
|
360 min = car(car(chunks));
|
|
361
|
361 check_djmp();
|
|
297
|
362 l = backdef();
|
|
|
363 chunks= switch_leaf(chnkcnt,merge,chunks);
|
|
|
364 max = chunks?car(car(chunks)):gmax;
|
|
|
365 index = list4(l,index,max,min);
|
|
|
366 merge = cadr(m); count = 0; chnkcnt = 0;
|
|
|
367 }
|
|
|
368 }
|
|
|
369 if (index) {
|
|
|
370 index = reverse0(index);
|
|
|
371 // check lower bound
|
|
298
|
372 // switch_index_jmp(index,dlabel?dlabel:blabel);
|
|
|
373 // nonsense because no control here.
|
|
299
|
374 switch_make_index(index,icount,cslabel,gmax,0);
|
|
297
|
375 } else {
|
|
|
376 fwddef(cslabel);
|
|
|
377 switch_leaf(-1,merge,chunks);
|
|
|
378 }
|
|
361
|
379 if (control&&dlabel) djmp = 1;
|
|
297
|
380 }
|
|
|
381
|
|
|
382 /* generate switch table, index, cascading branch */
|
|
|
383
|
|
|
384
|
|
|
385 void
|
|
299
|
386 genswitch(int cslist,int cslabel)
|
|
297
|
387 {
|
|
|
388 int chunks,merge,gmax;
|
|
312
|
389 #if 0
|
|
311
|
390 int i;
|
|
|
391 int j;
|
|
297
|
392 for(i=cslist;i;i=cadr(i)) {
|
|
468
|
393 printf("## case %d L_%d\n",car(i),caddr(i));
|
|
297
|
394 }
|
|
|
395 #endif
|
|
311
|
396 control=1;
|
|
456
|
397 if (chk) return;
|
|
297
|
398 /* find stepwise chunks */
|
|
|
399 chunks=make_chunk(cslist);
|
|
311
|
400 #if 0
|
|
298
|
401 j = 0;
|
|
297
|
402 for(i=cslist;i;i=cadr(i)) {
|
|
298
|
403 j++;
|
|
297
|
404 }
|
|
|
405 #endif
|
|
|
406 /* possible merge of loose stepwise chunks */
|
|
|
407 merge = merge_chunk(chunks);
|
|
|
408 #if 0
|
|
|
409 // chunks: list3(widest,next,delta);
|
|
468
|
410 printf("## chunks %d = sum ",j);
|
|
297
|
411 j = 0;
|
|
|
412 for(i=merge;i;i=cadr(i)) {
|
|
|
413 printf(" %d/%d",car(i),caddr(i));
|
|
|
414 j+=car(i);
|
|
|
415 }
|
|
|
416 printf(" sum = %d\n",j);
|
|
|
417 #endif
|
|
|
418 /* make index branch or table jump */
|
|
|
419 gmax = chunk_max(chunks);
|
|
|
420 chunks = reverse0(chunks);
|
|
299
|
421 if (!dlabel) dlabel = blabel;
|
|
361
|
422 djmp = 0;
|
|
299
|
423 switch_index(merge,chunks,cslabel,gmax);
|
|
311
|
424 free_chunks(chunks);
|
|
361
|
425 if (dlabel!=blabel)
|
|
|
426 check_djmp();
|
|
297
|
427 }
|
|
|
428
|
|
|
429 #endif
|
|
|
430
|
|
|
431
|
|
|
432
|
|
|
433 /* end */
|
