1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/***********************************************************************/
/* */
/* OCaml */
/* */
/* Xavier Leroy, projet Cristal, INRIA Rocquencourt */
/* */
/* Copyright 1996 Institut National de Recherche en Informatique et */
/* en Automatique. All rights reserved. This file is distributed */
/* under the terms of the Q Public License version 1.0. */
/* */
/***********************************************************************/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void caml_ml_array_bound_error(void)
{
fprintf(stderr, "Fatal error: out-of-bound access in array or string\n");
exit(2);
}
void print_string(char * s)
{
fputs(s, stdout);
}
void printf_int(char * fmt, int arg)
{
printf(fmt, arg);
}
#ifdef SORT
int cmpint(const void * i, const void * j)
{
long vi = *((long *) i);
long vj = *((long *) j);
if (vi == vj) return 0;
if (vi < vj) return -1;
return 1;
}
#endif
int main(int argc, char **argv)
{
#ifdef UNIT_INT
{ extern int FUN();
extern int call_gen_code();
printf("%d\n", call_gen_code(FUN));
}
#else
if (argc < 2) {
fprintf(stderr, "Usage: %s [int arg]\n", argv[0]);
exit(2);
}
#ifdef INT_INT
{ extern int FUN();
extern int call_gen_code();
printf("%d\n", call_gen_code(FUN, atoi(argv[1])));
}
#endif
#ifdef INT_FLOAT
{ extern double FUN();
#ifdef __mc68020__
#define call_gen_code call_gen_code_float
#endif
extern double call_gen_code();
printf("%f\n", call_gen_code(FUN, atoi(argv[1])));
}
#endif
#ifdef SORT
{ extern void FUN();
extern void call_gen_code();
long n;
long * a, * b;
long i;
srand(argc >= 3 ? atoi(argv[2]) : time((time_t *) 0));
n = atoi(argv[1]);
a = (long *) malloc(n * sizeof(long));
for (i = 0 ; i < n; i++) a[i] = rand() & 0xFFF;
#ifdef DEBUG
for (i = 0; i < n; i++) printf("%ld ", a[i]); printf("\n");
#endif
b = (long *) malloc(n * sizeof(long));
for (i = 0; i < n; i++) b[i] = a[i];
call_gen_code(FUN, 0, n-1, a);
#ifdef DEBUG
for (i = 0; i < n; i++) printf("%ld ", a[i]); printf("\n");
#endif
qsort(b, n, sizeof(long), cmpint);
for (i = 0; i < n; i++) {
if (a[i] != b[i]) { printf("Bug!\n"); return 2; }
}
printf("OK\n");
}
#endif
#endif
#ifdef CHECKBOUND
{ extern void checkbound1(), checkbound2();
extern void call_gen_code();
long x, y;
x = atoi(argv[1]);
if (argc >= 3) {
y = atoi(argv[2]);
if ((unsigned long) x < (unsigned long) y)
printf("Should not trap\n");
else
printf("Should trap\n");
call_gen_code(checkbound2, y, x);
} else {
if (2 < (unsigned long) x)
printf("Should not trap\n");
else
printf("Should trap\n");
call_gen_code(checkbound1, x);
}
printf("OK\n");
}
#endif
return 0;
}
|
