Rim Chaabane. Analyse dynamique de ... - Université Paris 8

Analyse dynamique de programmes C
264 case jmpFdbl:
265 jmpfTYPE(dval); if(EiC_traceON) printf("jmpftype dval\n");
266 break;
267 case jmpFptr:
268 jmpfTYPE(p.p); if(EiC_traceON) {printf("jmpftype p.p\n");}
269 break;
270 case jmpFllng:
271 jmpfTYPE(llval); /*if(EiC_traceON) {printf("jmpftype
llval"); }*/
272 break;
273
274 case jmpTint:
275 jmptTYPE(ival); /*if(EiC_traceON) {printf("jmptTint "); }*/
276 break;
277 case jmpTlng:
278 jmptTYPE(lval); /*if(EiC_traceON) {printf("jmpTlng "); }*/
279 break;
280 case jmpTdbl:
281 jmptTYPE(dval);/* if(EiC_traceON) {printf("jmpTdbl "); }*/
282 break;
283 case jmpTptr:
284 jmptTYPE(p.p);/*if(EiC_traceON) { printf("jmpTptr "); }*/
285 break;
286 case jmpTllng:
287 jmptTYPE(llval); /*if(EiC_traceON) {printf("jmpTllng "); }*/
288 break;
289
290 case jmpu: p += InSt[p].val.ival - 1;
291 /*if(EiC_traceON) { printf("jmpu \n"); }*/
292 break;
293 case dupval:
294 /* should really adjustTop here !!*/
295 STK[ToP + 1].v = STK[ToP].v;
296 ToP += InSt[p].val.ival;
297 /*if(EiC_traceON) {printf("dupval "); }*/
298 break;
299 case jmptab:
300 {
301 /*if(EiC_traceON) {printf("jmptab "); }*/
302 struct {
303 int n;
304 val_t *loc;
305 } *tab;
306 int i;
307 tab = InSt[p].val.p.p;
308 for (i = 1; i < tab->n; i += 2)
309 if (tab->loc[i].ival == STK[ToP].v.ival) {
310 p += tab->loc[i + 1].ival - 1;
311 break;
312 }
313 if (i >= tab->n)
314 p += tab->loc[0].ival - 1;
315 }
316 break;
317
318
319 /* specific float stuff */
320
321 case dreffloat:
322 drefTYPE(float, dval); /*if(EiC_traceON) { printf("dreffloat
");}*/
323 break;
324 case reffloat: refTYPE(float, dval);/* if(EiC_traceON)
{printf("reffloat ");} */
325 break;
326 case rvalfloat:
327 STK[ToP].v.dval=AR[InSt[p].ext][InSt[p].val.ival].v.fval;
/*if(EiC_traceON) { printf("rvalfloat ");}*/
104