Rim Chaabane. Analyse dynamique de ... - UniversitÃ© Paris 8

More documents

Recommendations

Info

Analyse dynamique de programmes C 728 break; 729 case lshtllong: lshtTYPE(llval); 730 break; 731 case rshtllong: rshtTYPE(llval); 732 break; 733 case ltllong: ltTYPE(llval); 734 break; 735 case lellong: leTYPE(llval); 736 break; 737 case eqllong: eqTYPE(llval); 738 break; 739 case nellong: neTYPE(llval); 740 break; 741 case gtllong: gtTYPE(llval); 742 break; 743 case gellong: geTYPE(llval); 744 break; 745 case lorllong: lorTYPE(llval); 746 break; 747 case landllong: landTYPE(llval); 748 break; 749 case notllong: notTYPE(llval); 750 break; 751 case borllong: borTYPE(llval); 752 break; 753 case xorllong: xorTYPE(llval); 754 break; 755 case andllong: andTYPE(llval); 756 break; 757 case compllong: compTYPE(llval); 758 break; 759 case llong2double: castTYPES(llval, dval, double); 760 break; 761 case llong2ptr: castTYPES(llval, p.p, void *); 762 break; 763 case llong2int: castTYPES(llval, ival, int); 764 break; 765 case llong2long: castTYPES(llval, lval, long); 766 break; 767 768 769 /* specific double stuff */ 770 case incdouble:STK[ToP].v.dval += InSt[p].val.ival; 771 break; 772 case decdouble:STK[ToP].v.dval -= InSt[p].val.ival; 773 break; 774 case drefdouble: 775 drefTYPE(double, dval); 776 break; 777 case refdouble: refTYPE(double, dval); 778 break; 779 case stodouble: stoTYPE(dval); 780 break; 781 case rvaldouble: rvalTYPE(dval); 782 break; 783 case pushdouble: pushTYPE(dval); 784 break; 785 case negdouble: negTYPE(dval); 786 break; 787 case adddouble: addTYPE(dval); 788 break; 789 case subdouble: subTYPE(dval); 790 break; 791 case divdouble: divTYPE(dval); 792 break; 793 case multdouble: multTYPE(dval); 794 break; 795 case ltdouble: ltTYPE(dval); 112
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
Page 1:
Rapport de stage de DEA Intelligenc
Page 5:
Résumé Ce sujet se place dans le
Page 8 and 9:
6.2.1. L instruction if............
Page 10 and 11:
Chapitre 1 - Introduction Le monito
Page 12 and 13:
Analyse dynamique de programmes C 4
Page 14 and 15:
avec un ensemble de propriétés qu
Page 17 and 18:
Analyse dynamique de programmes C C
Page 19 and 20:
Chapitre 2 Approche de la probléma
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Chapitre 3 Les interprètes C exist
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Chapitre 4 Exploration de l interpr
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Analyse dynamique de programmes C 5
Page 47 and 48:
Analyse dynamique de programmes C e
Page 49 and 50:
Chapitre 5 - Description technique
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62: Chapitre 6 - Exemples de résultats
Page 71 and 72: Chapitre 7 - Comparaison avec l exi
Page 77 and 78: Chapitre 8 - Conclusion et perspect
Page 79 and 80: Chapitre 8 - Conclusion et perspect
Page 82 and 83: Analyse dynamique de programmes C B
Page 84 and 85: Analyse dynamique de programmes C [
Page 86 and 87: Analyse dynamique de programmes C A
Page 90 and 91: Analyse dynamique de programmes C F
Page 102 and 103: Analyse dynamique de programmes C 1
Page 126: This document was created with Win2
show all

Rim Chaabane. Analyse dynamique de ... - UniversitÃ© Paris 8

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?