|
297
|
1 /* Micro-C Switch Code generation Part */
|
|
|
2 /* $Id$ */
|
|
|
3
|
|
|
4 #define EXTERN extern
|
|
|
5 #include "mc.h"
|
|
|
6 #include "mc-code.h"
|
|
|
7 #include "mc-codegen.h"
|
|
|
8
|
|
|
9 #if CASE_CODE
|
|
|
10
|
|
299
|
11 extern void genswitch(int cslist,int cslabel);
|
|
297
|
12
|
|
|
13 /*
|
|
|
14 value label pair
|
|
|
15 cslist = list3(value,next,label) label==0 means skip
|
|
|
16 continuous cslist
|
|
|
17 chunks: list4(cslist,next,delta,list3(count,min,max))
|
|
|
18 mergeable chunks count list
|
|
|
19 merge: list4(continuous number of chunk,next,delta,case_count);
|
|
|
20 index list
|
|
|
21 index: list4(label,next,max,min);
|
|
|
22 */
|
|
|
23
|
|
|
24 #define chunk_max(chunks) caddr(cadddr(chunks))
|
|
|
25 #define chunk_min(chunks) cadr(cadddr(chunks))
|
|
|
26 #define index_max(index) caddr(index)
|
|
|
27 #define index_min(index) cadddr(index)
|
|
298
|
28 #define index_label(index) car(index)
|
|
|
29
|
|
300
|
30 #define CASE_TABLE_COUNT 10
|
|
302
|
31 #define CASE_INDEX_COUNT CASE_TABLE_COUNT // have to be equal
|
|
298
|
32
|
|
297
|
33
|
|
|
34 /*
|
|
|
35 group continous case value
|
|
|
36 */
|
|
|
37
|
|
|
38 static int
|
|
|
39 make_chunk(int cslist)
|
|
|
40 {
|
|
303
|
41 register int delta,delta1,list,p,count;
|
|
297
|
42 // cslist is already sorted
|
|
|
43 delta = 0;
|
|
|
44 list = list4(cslist,0,1,list3(0,car(cslist) /* min */,0));
|
|
|
45 count=1;
|
|
|
46 for(p=0;cadr(cslist);cslist = cadr(cslist),count++) {
|
|
|
47 // compute new delta
|
|
|
48 delta1 = car(cadr(cslist))-car(cslist);
|
|
|
49 // empty case
|
|
|
50 if (!caddr(cslist)) count--;
|
|
|
51 if (delta==0) {
|
|
|
52 // 2nd element
|
|
|
53 caddr(list) = delta = delta1;
|
|
|
54 if (p) cadr(p)=0; // terminate previous chunk
|
|
|
55 } else if (delta1!=delta) {
|
|
|
56 // not contiguous, start new list
|
|
|
57 caddr(cadddr(list)) = car(cslist); // max
|
|
|
58 car(cadddr(list)) = count; count=0;
|
|
|
59 delta = 0;
|
|
|
60 list = list4(cadr(cslist),list,1,list3(0,0,0));
|
|
|
61 cadr(cadddr(list)) = car(cadr(cslist)); // min
|
|
|
62 // prepare terminate point for next turn
|
|
|
63 p=cslist;
|
|
|
64 }
|
|
|
65 }
|
|
|
66 if (p) cadr(p)=0; // terminate previous chunk
|
|
|
67 car(cadddr(list)) = count;
|
|
|
68 caddr(cadddr(list)) = car(cslist); // max
|
|
|
69 return list;
|
|
|
70 }
|
|
|
71
|
|
|
72 #define CASE_MERGE_RATE 70
|
|
|
73
|
|
303
|
74 static int gcd(int i0,int j0)
|
|
297
|
75 {
|
|
303
|
76 register int k,i=i0,j=j0;
|
|
297
|
77 if (i<j) { k=i; i=j; j=k;}
|
|
|
78 for(;;) {
|
|
|
79 if ((k=i%j)==0) return j;
|
|
|
80 i = j; j = k;
|
|
|
81 }
|
|
|
82 }
|
|
|
83
|
|
|
84 /*
|
|
|
85 check two chunks are mergeable or not.
|
|
|
86 */
|
|
|
87
|
|
|
88 static int
|
|
|
89 merge_chunk_p(int *delta,int max,int min,int *count,int delta1,int count1)
|
|
|
90 {
|
|
|
91 int range = max-min;
|
|
|
92 int g;
|
|
|
93 // compute possible merge delta
|
|
|
94 g = gcd(*delta,delta1);
|
|
|
95 g = gcd(g,range);
|
|
|
96 range /= g;
|
|
|
97 *count = count1 = count1+*count;
|
|
|
98 *delta = g;
|
|
|
99 #if 1
|
|
|
100 if (count1*128>(range*128*CASE_MERGE_RATE/100)) {
|
|
|
101 printf("# min %d, max %d, count %d, delta %d, rate %g t=%d\n",
|
|
|
102 min,max,count1,g,
|
|
|
103 ((double)count1)*100.0/range,
|
|
|
104 count1*128>(range*128*CASE_MERGE_RATE/100)
|
|
|
105 );
|
|
|
106 }
|
|
|
107 #endif
|
|
|
108 // count/((max-min)/delta) > 0.8
|
|
|
109 return count1*128>(range*128*CASE_MERGE_RATE/100);
|
|
|
110 }
|
|
|
111
|
|
|
112
|
|
|
113 static int
|
|
|
114 merge_chunk(int chunks)
|
|
|
115 {
|
|
303
|
116 register int list = chunks;
|
|
|
117 register int tail,last,max,min,i;
|
|
|
118 register int c_count,p,widest;
|
|
|
119 register int merge = 0;
|
|
|
120 int count,delta=1;
|
|
|
121
|
|
297
|
122 while(cadr(list)) {
|
|
|
123 p = cadddr(list);
|
|
|
124 c_count = count = car(p); max=caddr(p);
|
|
|
125 widest = 1; last = list;
|
|
|
126 delta = caddr(list);
|
|
|
127 // check possible merge against the end of the chunks
|
|
|
128 for(i=1,tail=cadr(list);cadr(tail); tail=cadr(tail),i++) {
|
|
|
129 p = cadddr(tail);
|
|
|
130 min = cadr(p);
|
|
|
131 if (merge_chunk_p(&delta,max,min,&count,caddr(tail),car(p))) {
|
|
|
132 // It is mergeable.
|
|
|
133 widest = i+1; last = tail; c_count=count;
|
|
|
134 }
|
|
|
135 }
|
|
|
136 merge = list4(widest,merge,delta,c_count);
|
|
|
137 // skip merged chunks
|
|
|
138 list = cadr(last);
|
|
|
139 }
|
|
|
140 // last one can remain.
|
|
|
141 if (list) merge = list4(1,merge,caddr(list),car(cadddr(list)));
|
|
|
142 return merge;
|
|
|
143 }
|
|
|
144
|
|
|
145 static int
|
|
|
146 cascade_compare(int count,int cslist)
|
|
|
147 {
|
|
|
148 int list;
|
|
|
149 for(;count-->0;cslist=cadr(cslist)) {
|
|
|
150 list = car(cslist);
|
|
|
151 printf("# cascade cases delta=%d count=%d min=%d max=%d\n",
|
|
|
152 caddr(cslist),car(cadddr(cslist)),
|
|
|
153 cadr(cadddr(cslist)),caddr(cadddr(cslist))
|
|
|
154 );
|
|
|
155 for(;list; list=cadr(list)) {
|
|
|
156 if (caddr(list))
|
|
|
157 cmpdimm(car(list),csvalue1,caddr(list),0);
|
|
|
158 // value register label mode
|
|
|
159 }
|
|
|
160 }
|
|
302
|
161 // have to be fall thru
|
|
297
|
162 return cslist;
|
|
|
163 }
|
|
|
164
|
|
300
|
165 static int
|
|
|
166 table_jump(int count,int delta,int chunks)
|
|
|
167 {
|
|
|
168 int list,i;
|
|
|
169 int l,max,min;
|
|
|
170 if (!code_table_jump_p())
|
|
|
171 return cascade_compare(count,chunks);
|
|
|
172
|
|
|
173 min=cadr(cadddr(chunks));
|
|
|
174 // find max
|
|
|
175 for(i=0,list=chunks;i<count;list=cadr(list),i++) {
|
|
|
176 max=caddr(cadddr(list));
|
|
|
177 }
|
|
|
178
|
|
|
179 printf("# table count %d delta %d max %d min %d\n",
|
|
|
180 count,delta,max,min);
|
|
|
181
|
|
|
182 l = fwdlabel();
|
|
302
|
183 code_table_jump(l,csvalue1,delta,max,min,dlabel);
|
|
|
184 control=0;
|
|
300
|
185 code_table_open(l);
|
|
|
186 i = min;
|
|
|
187 for(;count-->0;chunks=cadr(chunks)) {
|
|
|
188 list = car(chunks);
|
|
|
189 for(;list; list=cadr(list)) {
|
|
|
190 if (caddr(list)) {
|
|
|
191 for(;i<car(list);i+=delta) {
|
|
|
192 code_table_value(dlabel,l);
|
|
|
193 }
|
|
|
194 code_table_value(caddr(list),l);
|
|
|
195 i+=delta;
|
|
|
196 }
|
|
|
197 }
|
|
|
198 }
|
|
|
199 code_table_close();
|
|
|
200 return chunks;
|
|
|
201 }
|
|
|
202
|
|
297
|
203
|
|
|
204 /*
|
|
|
205 generate index jmp
|
|
|
206 */
|
|
|
207
|
|
|
208 static void
|
|
|
209 switch_index_jmp(int index,int label)
|
|
|
210 {
|
|
298
|
211 int value = index_min(index);
|
|
297
|
212 cmpdimm(value,csvalue1,label,LT);
|
|
|
213 // value register label mode
|
|
|
214 }
|
|
|
215
|
|
|
216 /*
|
|
|
217 generate leaf index branch
|
|
|
218 */
|
|
|
219
|
|
|
220 static int
|
|
298
|
221 switch_make_index_leaf(int count,int index,int level)
|
|
297
|
222 {
|
|
298
|
223 control=1;
|
|
|
224 printf("# index leaf count=%d level=%d\n",count,level);
|
|
297
|
225 for(;count-- !=0 && cadr(index);index=cadr(index)) {
|
|
298
|
226 switch_index_jmp( cadr(index), index_label(index) );
|
|
297
|
227 }
|
|
|
228 if (!cadr(index)) {
|
|
|
229 // don't check max boundary
|
|
298
|
230 jmp(index_label(index));
|
|
297
|
231 return 0;
|
|
|
232 }
|
|
298
|
233 if (count!= -1) error(-1);
|
|
302
|
234 jmp(dlabel);
|
|
297
|
235 return index;
|
|
|
236 }
|
|
|
237
|
|
|
238 /*
|
|
|
239 generate index switch branch (no table).
|
|
|
240 if necessary generate higher index.
|
|
|
241 */
|
|
|
242
|
|
|
243 static void
|
|
299
|
244 switch_make_index(int index0,int count,int cslabel,int gmax,int level)
|
|
297
|
245 {
|
|
|
246 int index=0;
|
|
|
247 int icount=0;
|
|
|
248 int l,min,max;
|
|
298
|
249 control=1;
|
|
299
|
250 if (count <= CASE_INDEX_COUNT) {
|
|
297
|
251 fwddef(cslabel);
|
|
298
|
252 switch_make_index_leaf(-1,index0,level);
|
|
299
|
253 } else {
|
|
|
254 while (index0) {
|
|
|
255 l = backdef();
|
|
|
256 min = index_min(index0);
|
|
|
257 index0=switch_make_index_leaf(CASE_INDEX_COUNT,index0,level);
|
|
|
258 if (index0) {
|
|
|
259 max = index_min(index0)-1;
|
|
|
260 } else {
|
|
|
261 max = gmax;
|
|
|
262 }
|
|
|
263 index = list4(l,index,max,min);
|
|
|
264 count-=CASE_INDEX_COUNT;
|
|
|
265 icount++;
|
|
|
266 }
|
|
|
267 switch_make_index(reverse0(index),icount,cslabel,gmax,level+1);
|
|
297
|
268 }
|
|
|
269 }
|
|
|
270
|
|
|
271 /*
|
|
|
272 generate leaf switch branch or table jump
|
|
|
273 */
|
|
|
274
|
|
|
275 static int
|
|
300
|
276 switch_leaf(int count,int merge,int chunks)
|
|
297
|
277 {
|
|
298
|
278 control=1;
|
|
297
|
279 for(;count-- !=0 && merge;merge=cadr(merge)) {
|
|
|
280 printf("# merge count %d delta %d c_count %d\n",
|
|
|
281 car(merge),caddr(merge),cadddr(merge));
|
|
302
|
282 if (cadddr(merge)>CASE_TABLE_COUNT) {
|
|
300
|
283 chunks = table_jump(car(merge),caddr(merge),chunks);
|
|
302
|
284 } else {
|
|
300
|
285 chunks = cascade_compare(car(merge),chunks);
|
|
302
|
286 }
|
|
297
|
287 }
|
|
302
|
288 // table_jump has no fall thru, but cascade_compare does.
|
|
|
289 if (control) jmp(dlabel);
|
|
300
|
290 return chunks;
|
|
297
|
291 }
|
|
|
292
|
|
|
293 /*
|
|
|
294 make index if necessary or
|
|
|
295 generate case branch or table jump
|
|
|
296 */
|
|
|
297
|
|
|
298 static void
|
|
299
|
299 switch_index(int merge,int chunks,int cslabel,int gmax)
|
|
297
|
300 {
|
|
|
301 int m,l,max,min;
|
|
|
302 int chnkcnt = 0;
|
|
|
303 int icount = 0;
|
|
|
304 int count = 0;
|
|
|
305 int index = 0;
|
|
|
306 for(m=merge;m;m=cadr(m)) {
|
|
298
|
307 if (!index && !cadr(m)) break; // no index for single chunk
|
|
297
|
308 chnkcnt++;
|
|
|
309 count += cadddr(m);
|
|
|
310 if (count > CASE_INDEX_COUNT || (index && !cadr(m))) {
|
|
|
311 icount++;
|
|
|
312 min = car(car(chunks));
|
|
|
313 l = backdef();
|
|
|
314 chunks= switch_leaf(chnkcnt,merge,chunks);
|
|
|
315 max = chunks?car(car(chunks)):gmax;
|
|
|
316 index = list4(l,index,max,min);
|
|
|
317 merge = cadr(m); count = 0; chnkcnt = 0;
|
|
|
318 }
|
|
|
319 }
|
|
|
320 if (index) {
|
|
|
321 index = reverse0(index);
|
|
|
322 // check lower bound
|
|
298
|
323 // switch_index_jmp(index,dlabel?dlabel:blabel);
|
|
|
324 // nonsense because no control here.
|
|
299
|
325 switch_make_index(index,icount,cslabel,gmax,0);
|
|
297
|
326 } else {
|
|
|
327 fwddef(cslabel);
|
|
|
328 switch_leaf(-1,merge,chunks);
|
|
|
329 }
|
|
298
|
330 if (control&&dlabel) jmp(dlabel);
|
|
297
|
331 }
|
|
|
332
|
|
|
333 /* generate switch table, index, cascading branch */
|
|
|
334
|
|
|
335
|
|
|
336 void
|
|
299
|
337 genswitch(int cslist,int cslabel)
|
|
297
|
338 {
|
|
|
339 int chunks,merge,gmax;
|
|
|
340 int i,j;
|
|
298
|
341 control=1;
|
|
297
|
342 #if 0
|
|
|
343 for(i=cslist;i;i=cadr(i)) {
|
|
|
344 printf("# case %d L_%d\n",car(i),caddr(i));
|
|
|
345 }
|
|
|
346 #endif
|
|
|
347 /* find stepwise chunks */
|
|
|
348 chunks=make_chunk(cslist);
|
|
|
349 #if 1
|
|
298
|
350 j = 0;
|
|
297
|
351 for(i=cslist;i;i=cadr(i)) {
|
|
298
|
352 j++;
|
|
297
|
353 }
|
|
|
354 #endif
|
|
|
355 /* possible merge of loose stepwise chunks */
|
|
|
356 merge = merge_chunk(chunks);
|
|
|
357 #if 0
|
|
|
358 // chunks: list3(widest,next,delta);
|
|
|
359 printf("# chunks %d = sum ",j);
|
|
|
360 j = 0;
|
|
|
361 for(i=merge;i;i=cadr(i)) {
|
|
|
362 printf(" %d/%d",car(i),caddr(i));
|
|
|
363 j+=car(i);
|
|
|
364 }
|
|
|
365 printf(" sum = %d\n",j);
|
|
|
366 #endif
|
|
|
367 /* make index branch or table jump */
|
|
|
368 gmax = chunk_max(chunks);
|
|
|
369 chunks = reverse0(chunks);
|
|
299
|
370 if (!dlabel) dlabel = blabel;
|
|
|
371 switch_index(merge,chunks,cslabel,gmax);
|
|
297
|
372 }
|
|
|
373
|
|
|
374 #endif
|
|
|
375
|
|
|
376
|
|
|
377
|
|
|
378 /* end */
|
