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

Analyse dynamique de programmes C
796 break;
797 case ledouble: leTYPE(dval);
798 break;
799 case eqdouble: eqTYPE(dval);
800 break;
801 case nedouble: neTYPE(dval);
802 break;
803 case gtdouble: gtTYPE(dval);
804 break;
805 case gedouble: geTYPE(dval);
806 break;
807 case lordouble: lorTYPE(dval);
808 break;
809 case landdouble: landTYPE(dval);
810 break;
811 case notdouble: notTYPE(dval);
812 break;
813
814 case double2int: castTYPES(dval, uival, unsigned int);
815 break;
816 case double2long: castTYPES(dval, ulval, unsigned long);
817 break;
818 case double2llong: castTYPES(dval, llval, eic_llong);
819 break;
820 case double2float: castTYPES(dval, fval, float);
821 break;
822
823
824 /*specific pointer stuff */
825 case incptr: STK[ToP].v.p.p = (char *) STK[ToP].v.p.p +
826 InSt[p].val.ival; /*if(EiC_traceON) {printf("incptr "); }*/
827 break;
828 case decptr: STK[ToP].v.p.p = (char *) STK[ToP].v.p.p -
829 InSt[p].val.ival; /*if(EiC_traceON) {printf("decptr "); }*/
830 break;
831 case lda:
832 #if 0
833 STK[ToP].v.p = AR[1][InSt[p].val.ival].v.p;
834 STK[ToP].v.p.p = (char*)STK[ToP].v.p.sp + InSt[p].ext;
835 STK[ToP].v.p.sp = STK[ToP].v.p.p;
836 if(EiC_traceON) {printf("lda if 0\n"); }
837 #else
838
839 {
840 if(EiC_traceON) {printf("lda if non 0\n"); }
841 ptr_t *q = &AR[1][InSt[p].val.ival].v.p;
842 ptr_t *a = &STK[ToP].v.p;
843
844 a->p = a->sp = (char*)q->sp + InSt[p].ext;
845 a->ep = q->ep;
846
847 if(vp) { /* patch previous lda assignment */
848 ((ptr_t*)vp)->ep = (char*)a->p;
849 }
850 /* Take advantage of the fact that the next InSt
851 * has the location of where `a' is to be stored.
852 */
853 vp = &AR[1][InSt[p+1].val.ival].v.p;
854
855 }
856
857 #endif
858
859 break;
860 case ixa:
861 ToP--;
862 STK[ToP].v.p.p = (char *) STK[ToP].v.p.p +
STK[ToP+1].v.ival*InSt[p].val.ival;
113