/
a2test.c
183 lines (161 loc) · 5.32 KB
/
a2test.c
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#include <stdbool.h>
#include <stdio.h>
#include "assert.h"
#include "a2methods.h"
#include "a2plain.h"
#include "a2blocked.h"
#define W 13
#define H 15
#define BS 4
static A2Methods_T methods;
typedef A2Methods_UArray2 A2;
static void check_and_increment(int i, int j, A2 a, void *elem, void *cl)
{
(void)i;
(void)j;
(void)a;
int *p = elem;
int *counter = cl;
assert(*p == *counter);
*counter += 1; /* NOT *counter++! */
}
static void small_check_and_increment(void *elem, void *cl)
{
int *p = elem;
int *counter = cl;
assert(*p == *counter);
*counter += 1; // NOT *counter++!
}
static void double_row_major_plus()
{
/* store increasing integers in row-major order */
A2 array = methods->new_with_blocksize(W, H, sizeof(int), BS);
int counter = 1;
for (int j = 0; j < H; j++) {
for (int i = 0; i < W; i++) { /* col index varies faster */
int *p = methods->at(array, i, j);
*p = counter++;
}
}
counter = 1;
for (int j = 0; j < H; j++) {
for (int i = 0; i < W; i++) {
int *p = methods->at(array, i, j);
assert(*p == counter);
counter++;
}
}
if (methods->map_row_major) {
counter = 1;
methods->map_row_major(array, check_and_increment, &counter);
}
if (methods->small_map_row_major) {
counter = 1;
methods->small_map_row_major(array,
small_check_and_increment,
&counter);
}
methods->free(&array);
}
#if 0
static void show(int i, int j, A2 a, void *elem, void *cl)
{
(void)a; (void)cl;
printf("A[%02d][%02d] == %05u -- should be %05d\n",
i, j, *(unsigned *)elem, 1000 * i + j);
}
#endif
static inline void check(A2 a, int i, int j, unsigned n)
{
unsigned *p = methods->at(a, i, j);
assert(*p == n);
}
bool has_minimum_methods(A2Methods_T m)
{
return m->new != NULL && m->new_with_blocksize != NULL
&& m->free != NULL && m->width != NULL && m->height != NULL
&& m->size != NULL && m->blocksize != NULL && m->at != NULL;
}
bool has_small_plain_methods(A2Methods_T m)
{
return m->small_map_default != NULL
&& m->small_map_row_major != NULL
&& m->small_map_col_major != NULL;
}
bool has_plain_methods(A2Methods_T m)
{
return m->map_default != NULL
&& m->map_row_major != NULL
&& m->map_col_major != NULL;
}
bool has_small_blocked_methods(A2Methods_T m)
{
return m->small_map_default != NULL
&& m->small_map_block_major != NULL;
}
bool has_blocked_methods(A2Methods_T m)
{
return m->map_default != NULL && m->map_block_major != NULL;
}
static inline void copy_unsigned(A2Methods_T methods, A2 a,
int i, int j, unsigned n)
{
unsigned *p = methods->at(a, i, j);
*p = n;
}
static void test_methods(A2Methods_T methods_under_test)
{
methods = methods_under_test;
assert(methods);
assert(has_minimum_methods(methods));
assert(has_small_plain_methods(methods)
|| has_small_blocked_methods(methods));
assert(!(has_small_plain_methods(methods)
&& has_small_blocked_methods(methods)));
assert(!(has_plain_methods(methods)
&& has_blocked_methods(methods)));
if (!(has_plain_methods(methods) || has_blocked_methods(methods)))
fprintf(stderr, "Some full mapping methods are missing\n");
A2 array = methods->new_with_blocksize(W, H, sizeof(unsigned), BS);
<<<<<<< HEAD
=======
>>>>>>> 35c34b0400371f61d82ad4ec0a7a7597d6238204
copy_unsigned(methods, array, 2, 1, 99);
copy_unsigned(methods, array, 3, 3, 88);
copy_unsigned(methods, array, 10, 10, 77);
check(array, 2, 1, 99);
check(array, 3, 3, 88);
check(array, 10, 10, 77);
for (int i = 0; i < W; i++) {
for (int j = 0; j < H; j++) {
unsigned n = 1000 * i + j;
copy_unsigned(methods, array, i, j, n);
unsigned *p = methods->at(array, i, j);
assert(*p == n);
}
}
for (int i = 0; i < W; i++) {
for (int j = 0; j < H; j++) {
unsigned n = 1000 * i + j;
unsigned *p = methods->at(array, i, j);
assert(*p == n);
}
}
double_row_major_plus();
methods->free(&array);
}
int main(int argc, char *argv[])
{
assert(argc == 1);
(void)argv;
test_methods(uarray2_methods_plain);
<<<<<<< HEAD
test_methods(uarray2_methods_blocked);
=======
/* test_methods(uarray2_methods_blocked); */
>>>>>>> 35c34b0400371f61d82ad4ec0a7a7597d6238204
printf("Passed.\n"); /* only if we reach this point without
* assertion failure
*/
return 0;
}