divremtest.c revision 1.2 1 1.1 ross #include <stdio.h>
2 1.1 ross #include <stdlib.h>
3 1.1 ross #include <unistd.h>
4 1.1 ross #include <fcntl.h>
5 1.1 ross #include <stdint.h>
6 1.2 ross #include <assert.h>
7 1.2 ross #include <time.h>
8 1.2 ross
9 1.2 ross #define KLE 3 // exponent for k and l salt values
10 1.2 ross #define NEARBY 600 // all numbers +-NEARBY 0 and INTxx_MIN will be tried
11 1.2 ross #define RANDOMCOUNT 300000 // number of random(3)-based cases to run
12 1.1 ross
13 1.1 ross #define IM(x) ((intmax_t)(x))
14 1.1 ross #define UIM(x) ((uintmax_t)(x))
15 1.1 ross
16 1.1 ross #define TEST(id, a, b, c) \
17 1.1 ross if (b) { \
18 1.1 ross c = (a) / (b); \
19 1.1 ross printf(id "%16jx / %16jx => %16jx\n", UIM(a), UIM(b), UIM(c)); \
20 1.1 ross c = (a) % (b); \
21 1.1 ross printf(id "%16jx / %16jx => %16jx\n", UIM(a), UIM(b), UIM(c)); \
22 1.1 ross }
23 1.1 ross
24 1.2 ross #define T64S(a, b, c) TEST("64 ", (a), (b), (c))
25 1.2 ross #define T64U(a, b, c) TEST("64U", (a), (b), (c))
26 1.2 ross
27 1.2 ross union {
28 1.2 ross char ranstate[128];
29 1.2 ross long alignme;
30 1.2 ross } ranalign;
31 1.2 ross
32 1.2 ross int enable_time_output;
33 1.2 ross
34 1.2 ross void mark_time(const int phase)
35 1.2 ross {
36 1.2 ross static time_t startphase;
37 1.2 ross time_t t;
38 1.2 ross
39 1.2 ross t = time(NULL);
40 1.2 ross if (enable_time_output && phase != 0) {
41 1.2 ross fprintf(stderr, "phase %d/6: %5d seconds\n", phase,
42 1.2 ross (int)(t - startphase));
43 1.2 ross fflush(stderr);
44 1.2 ross }
45 1.2 ross startphase = t;
46 1.2 ross }
47 1.1 ross
48 1.1 ross int main(int ac, char **av)
49 1.1 ross {
50 1.2 ross int32_t a32, b32, sr32;
51 1.1 ross uint32_t ur32;
52 1.2 ross intmax_t a64, b64, sr64;
53 1.1 ross uintmax_t ur64;
54 1.2 ross int i, j, k, l;
55 1.1 ross
56 1.2 ross enable_time_output = ac <= 1;
57 1.2 ross mark_time(0);
58 1.2 ross for(i = KLE; i <= 30; ++i) {
59 1.2 ross a32 = 1 << i;
60 1.2 ross for(j = KLE; j <= 30; ++j) {
61 1.2 ross b32 = 1 << j;
62 1.2 ross for(k = -(1 << KLE); k <= 1 << KLE; ++k) {
63 1.2 ross for(l = -(1 << KLE); l <= 1 << KLE; ++l) {
64 1.2 ross TEST("32 ", a32 + k, b32 + l, sr32);
65 1.2 ross TEST("32 ", a32 + k, -(b32 + l), sr32);
66 1.2 ross TEST("32 ", -(a32 + k), b32 + l, sr32);
67 1.2 ross TEST("32 ", -(a32 + k), -(b32 + l), sr32);
68 1.2 ross assert((1U << i) + k >= 0);
69 1.2 ross assert((1U << j) + l >= 0);
70 1.1 ross TEST("32U", (1U << i) + k, (1U << j) + l, ur32);
71 1.1 ross }
72 1.1 ross }
73 1.1 ross }
74 1.1 ross }
75 1.2 ross
76 1.2 ross mark_time(1);
77 1.2 ross for(a32 = -NEARBY; a32 < NEARBY; ++a32) {
78 1.2 ross for(b32 = -NEARBY; b32 < NEARBY; ++b32) {
79 1.2 ross TEST("32 ", a32, b32, sr32);
80 1.2 ross if (a32 >= 0 && b32 >= 0)
81 1.2 ross TEST("32U", (unsigned)a32, (unsigned)b32, ur32);
82 1.2 ross }
83 1.2 ross }
84 1.2 ross mark_time(2);
85 1.2 ross for(a32 = INT32_MIN; a32 < INT32_MIN + NEARBY; ++a32) {
86 1.2 ross for(b32 = INT32_MIN; b32 < INT32_MIN + NEARBY; ++b32)
87 1.2 ross TEST("32 ", a32, b32, sr32);
88 1.2 ross for(b32 = -NEARBY; b32 < NEARBY; ++b32)
89 1.2 ross if (a32 != INT32_MIN || b32 != -1)
90 1.2 ross TEST("32 ", a32, b32, sr32);
91 1.2 ross }
92 1.2 ross
93 1.2 ross mark_time(3);
94 1.1 ross if (sizeof(intmax_t) == 4)
95 1.1 ross exit(0);
96 1.2 ross for(i = KLE; i <= 62; ++i) {
97 1.2 ross a64 = IM(1) << i;
98 1.2 ross for(j = KLE; j <= 62; ++j) {
99 1.2 ross b64 = IM(1) << j;
100 1.2 ross for(k = -(1 << KLE); k <= 1 << KLE; ++k) {
101 1.2 ross for(l = -(1 << KLE); l <= 1 << KLE; ++l) {
102 1.2 ross T64S( a64 + k, b64 + l, sr64);
103 1.2 ross T64S( a64 + k, -b64 + l, sr64);
104 1.2 ross T64S(-a64 + k, b64 + l, sr64);
105 1.2 ross T64S(-a64 + k, -b64 + l, sr64);
106 1.2 ross T64U(UIM(a64) + k, UIM(b64) + l, ur64);
107 1.1 ross }
108 1.1 ross }
109 1.1 ross }
110 1.1 ross }
111 1.2 ross
112 1.2 ross mark_time(4);
113 1.2 ross for(a64 = -(1 << KLE); a64 < 1 << KLE; ++a64) {
114 1.2 ross for(b64 = -(1 << KLE); b64 < 1 << KLE; ++b64) {
115 1.2 ross TEST("64 ", a64, b64, sr64);
116 1.2 ross if (a64 >= 0 && b64 >= 0)
117 1.2 ross TEST("64U", (unsigned)a64, (unsigned)b64, ur64);
118 1.2 ross }
119 1.2 ross }
120 1.2 ross for(a64 = INT64_MIN; a64 < INT64_MIN + NEARBY; ++a64) {
121 1.2 ross for(b64 = INT64_MIN; b64 < INT64_MIN + NEARBY; ++b64)
122 1.2 ross TEST("64 ", a64, b64, sr64);
123 1.2 ross for(b64 = -NEARBY; b64 < NEARBY; ++b64)
124 1.2 ross if (a64 != INT64_MIN || b64 != -1)
125 1.2 ross TEST("64 ", a64, b64, sr64);
126 1.2 ross }
127 1.2 ross mark_time(5);
128 1.2 ross initstate(1UL, ranalign.ranstate, sizeof ranalign.ranstate);
129 1.2 ross for(i = 0; i < RANDOMCOUNT; ++i) {
130 1.2 ross int32_t low32 = random();
131 1.2 ross int64_t low64 = (intmax_t)random() << 32 | low32;
132 1.2 ross
133 1.2 ross a32 = random();
134 1.2 ross b32 = random();
135 1.2 ross a64 = ((intmax_t)random() << 32) | a32;
136 1.2 ross b64 = ((intmax_t)random() << 32) | b32;
137 1.2 ross TEST("32 ", a32, b32, sr32);
138 1.2 ross TEST("32u", (unsigned)a32 + low32, (unsigned)b32 + low32, ur32);
139 1.2 ross TEST("32 ", -a32 - 1, b32, sr32);
140 1.2 ross TEST("32 ", a32, -b32, sr32);
141 1.2 ross if (a32 != INT32_MAX || b32 != 1)
142 1.2 ross TEST("32 ", -a32 - 1, -b32, sr32);
143 1.2 ross TEST("64 ", a64, b64, sr64);
144 1.2 ross TEST("64u", (unsigned)a64 + low64, (unsigned)b64 + low64, ur64);
145 1.2 ross TEST("64 ", -a64 - 1, b64, sr64);
146 1.2 ross TEST("64 ", a64, -b64, sr64);
147 1.2 ross if (a64 != INT64_MAX || b64 != 1)
148 1.2 ross TEST("64 ", -a64 - 1, -b64, sr64);
149 1.2 ross }
150 1.2 ross mark_time(6);
151 1.1 ross exit(0);
152 1.1 ross return 0;
153 1.1 ross }
154