boundtest.c

   1 #include <stdlib.h>
   2 #include <stdio.h>
   3
   4 #define NB_ITS 1000000
   5 //#define NB_ITS 1
   6 #define TAB_SIZE 100
   7
   8 int tab[TAB_SIZE];
   9 int ret_sum;
  10 char tab3[256];
  11
  12 int test1(void)
  13 {
  14     int i, sum = 0;
  15     for(i=0;i<TAB_SIZE;i++) {
  16         sum += tab[i];
  17     }
  18     return sum;
  19 }
  20
  21 /* error */
  22 int test2(void)
  23 {
  24     int i, sum = 0;
  25     for(i=0;i<TAB_SIZE + 1;i++) {
  26         sum += tab[i];
  27     }
  28     return sum;
  29 }
  30
  31 int test3(void)
  32 {
  33     int sum;
  34     int i, it;
  35
  36     sum = 0;
  37     for(it=0;it<NB_ITS;it++) {
  38         for(i=0;i<TAB_SIZE;i++) {
  39             sum += tab[i];
  40         }
  41     }
  42     return sum;
  43 }
  44
  45 /* ok */
  46 int test4(void)
  47 {
  48     int i, sum = 0;
  49     int *tab4;
  50
  51     tab4 = malloc(20 * sizeof(int));
  52     for(i=0;i<20;i++) {
  53         sum += tab4[i];
  54     }
  55     free(tab4);
  56
  57     return sum;
  58 }
  59
  60 /* error */
  61 int test5(void)
  62 {
  63     int i, sum = 0;
  64     int *tab4;
  65
  66     tab4 = malloc(20 * sizeof(int));
  67     for(i=0;i<21;i++) {
  68         sum += tab4[i];
  69     }
  70     free(tab4);
  71
  72     return sum;
  73 }
  74
  75 /* error */
  76 int test6(void)
  77 {
  78     int i, sum = 0;
  79     int *tab4;
  80
  81     tab4 = malloc(20 * sizeof(int));
  82     free(tab4);
  83     for(i=0;i<21;i++) {
  84         sum += tab4[i];
  85     }
  86
  87     return sum;
  88 }
  89
  90 /* error */
  91 int test7(void)
  92 {
  93     int i, sum = 0;
  94     int *p;
  95
  96     for(i=0;i<TAB_SIZE + 1;i++) {
  97         p = &tab[i];
  98         if (i == TAB_SIZE)
  99             printf("i=%d %x\n", i, p);
 100         sum += *p;
 101     }
 102     return sum;
 103 }
 104
 105 /* ok */
 106 int test8(void)
 107 {
 108     int i, sum = 0;
 109     int tab[10];
 110
 111     for(i=0;i<10;i++) {
 112         sum += tab[i];
 113     }
 114     return sum;
 115 }
 116
 117 /* error */
 118 int test9(void)
 119 {
 120     int i, sum = 0;
 121     char tab[10];
 122
 123     for(i=0;i<11;i++) {
 124         sum += tab[i];
 125     }
 126     return sum;
 127 }
 128
 129 /* ok */
 130 int test10(void)
 131 {
 132     char tab[10];
 133     char tab1[10];
 134
 135     memset(tab, 0, 10);
 136     memcpy(tab, tab1, 10);
 137     memmove(tab, tab1, 10);
 138     return 0;
 139 }
 140
 141 /* error */
 142 int test11(void)
 143 {
 144     char tab[10];
 145
 146     memset(tab, 0, 11);
 147     return 0;
 148 }
 149
 150 /* error */
 151 int test12(void)
 152 {
 153     void *ptr;
 154     ptr = malloc(10);
 155     free(ptr);
 156     free(ptr);
 157     return 0;
 158 }
 159
 160 int (*table_test[])(void) = {
 161     test1,
 162     test1,
 163     test2,
 164     test3,
 165     test4,
 166     test5,
 167     test6,
 168     test7,
 169     test8,
 170     test9,
 171     test10,
 172     test11,
 173     test12,
 174 };
 175
 176 int main(int argc, char **argv)
 177 {
 178     int index;
 179     int (*ftest)(void);
 180
 181     if (argc < 2) {
 182         printf("usage: boundtest n\n"
 183                "test TCC bound checking system\n"
 184                );
 185         exit(1);
 186     }
 187
 188     index = 0;
 189     if (argc >= 2)
 190         index = atoi(argv[1]);
 191     /* well, we also use bounds on this ! */
 192     ftest = table_test[index];
 193     ftest();
 194
 195     return 0;
 196 }
 197
 198 /*
 199  * without bound   0.77 s
 200  * with bounds    4.73
 201  */