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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
// Specialized i686 versions of the cache line search functions.
#include "defs.h"
static inline int32_t mask(int32_t a, int32_t b) { return -(a == b); }
#if defined(__GNUC__)
static inline int32_t first_bit_set(int32_t a) {
return __builtin_ffs(a) - 1;
}
#else
static uint8_t de_bruijn_table[] = {
0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
};
static inline int32_t first_bit_set(int32_t a) {
int32_t zero_case = mask(0, a);
uint32_t x = (uint32_t) (a & -a);
x *= 0x077CB531;
x >>= 27;
return zero_case | de_bruijn_table[x];
}
#endif
static inline uint32_t line_mask(small_hash_t* array, int start,
small_hash_t x1) {
small_hash_t* p = array + start;
uint32_t m1 = 0;
uint32_t m2 = 0;
uint32_t m3 = 0;
int offset = start & 0x1f;
#define M (mask(*p, x1))
switch (offset) {
case 0: m1 |= M & 0x1; ++p;
case 1: m2 |= M & 0x2; ++p;
case 2: m3 |= M & 0x4; ++p;
case 3: m1 |= M & 0x8; ++p;
case 4: m2 |= M & 0x10; ++p;
case 5: m3 |= M & 0x20; ++p;
case 6: m1 |= M & 0x40; ++p;
case 7: m2 |= M & 0x80; ++p;
case 8: m3 |= M & 0x100; ++p;
case 9: m1 |= M & 0x200; ++p;
case 10: m2 |= M & 0x400; ++p;
case 11: m3 |= M & 0x800; ++p;
case 12: m1 |= M & 0x1000; ++p;
case 13: m2 |= M & 0x2000; ++p;
case 14: m3 |= M & 0x4000; ++p;
case 15: m1 |= M & 0x8000; ++p;
case 16: m2 |= M & 0x10000; ++p;
case 17: m3 |= M & 0x20000; ++p;
case 18: m1 |= M & 0x40000; ++p;
case 19: m2 |= M & 0x80000; ++p;
case 20: m3 |= M & 0x100000; ++p;
case 21: m1 |= M & 0x200000; ++p;
case 22: m2 |= M & 0x400000; ++p;
case 23: m3 |= M & 0x800000; ++p;
case 24: m1 |= M & 0x1000000; ++p;
case 25: m2 |= M & 0x2000000; ++p;
case 26: m3 |= M & 0x4000000; ++p;
case 27: m1 |= M & 0x8000000; ++p;
case 28: m2 |= M & 0x10000000; ++p;
case 29: m3 |= M & 0x20000000; ++p;
case 30: m1 |= M & 0x40000000; ++p;
case 31: m2 |= M & 0x80000000; ++p;
}
#undef M
return (m1 | m2 | m3) >> offset;
}
static inline uint32_t line_mask_2(small_hash_t* array, int start,
small_hash_t x1, small_hash_t x2) {
small_hash_t* p = array + start;
uint32_t m1 = 0;
uint32_t m2 = 0;
uint32_t m3 = 0;
int offset = start & 0x1f;
#define M (mask(*p, x1) | mask(*p, x2))
switch (offset) {
case 0: m1 |= M & 0x1; ++p;
case 1: m2 |= M & 0x2; ++p;
case 2: m3 |= M & 0x4; ++p;
case 3: m1 |= M & 0x8; ++p;
case 4: m2 |= M & 0x10; ++p;
case 5: m3 |= M & 0x20; ++p;
case 6: m1 |= M & 0x40; ++p;
case 7: m2 |= M & 0x80; ++p;
case 8: m3 |= M & 0x100; ++p;
case 9: m1 |= M & 0x200; ++p;
case 10: m2 |= M & 0x400; ++p;
case 11: m3 |= M & 0x800; ++p;
case 12: m1 |= M & 0x1000; ++p;
case 13: m2 |= M & 0x2000; ++p;
case 14: m3 |= M & 0x4000; ++p;
case 15: m1 |= M & 0x8000; ++p;
case 16: m2 |= M & 0x10000; ++p;
case 17: m3 |= M & 0x20000; ++p;
case 18: m1 |= M & 0x40000; ++p;
case 19: m2 |= M & 0x80000; ++p;
case 20: m3 |= M & 0x100000; ++p;
case 21: m1 |= M & 0x200000; ++p;
case 22: m2 |= M & 0x400000; ++p;
case 23: m3 |= M & 0x800000; ++p;
case 24: m1 |= M & 0x1000000; ++p;
case 25: m2 |= M & 0x2000000; ++p;
case 26: m3 |= M & 0x4000000; ++p;
case 27: m1 |= M & 0x8000000; ++p;
case 28: m2 |= M & 0x10000000; ++p;
case 29: m3 |= M & 0x20000000; ++p;
case 30: m1 |= M & 0x40000000; ++p;
case 31: m2 |= M & 0x80000000; ++p;
}
#undef M
return (m1 | m2 | m3) >> offset;
}
static inline uint32_t line_mask_3(small_hash_t* array, int start,
small_hash_t x1, small_hash_t x2,
small_hash_t x3) {
small_hash_t* p = array + start;
uint32_t m1 = 0;
uint32_t m2 = 0;
uint32_t m3 = 0;
int offset = start & 0x1f;
#define M (mask(*p, x1) | mask(*p, x2) | mask(*p, x3))
switch (offset) {
case 0: m1 |= M & 0x1; ++p;
case 1: m2 |= M & 0x2; ++p;
case 2: m3 |= M & 0x4; ++p;
case 3: m1 |= M & 0x8; ++p;
case 4: m2 |= M & 0x10; ++p;
case 5: m3 |= M & 0x20; ++p;
case 6: m1 |= M & 0x40; ++p;
case 7: m2 |= M & 0x80; ++p;
case 8: m3 |= M & 0x100; ++p;
case 9: m1 |= M & 0x200; ++p;
case 10: m2 |= M & 0x400; ++p;
case 11: m3 |= M & 0x800; ++p;
case 12: m1 |= M & 0x1000; ++p;
case 13: m2 |= M & 0x2000; ++p;
case 14: m3 |= M & 0x4000; ++p;
case 15: m1 |= M & 0x8000; ++p;
case 16: m2 |= M & 0x10000; ++p;
case 17: m3 |= M & 0x20000; ++p;
case 18: m1 |= M & 0x40000; ++p;
case 19: m2 |= M & 0x80000; ++p;
case 20: m3 |= M & 0x100000; ++p;
case 21: m1 |= M & 0x200000; ++p;
case 22: m2 |= M & 0x400000; ++p;
case 23: m3 |= M & 0x800000; ++p;
case 24: m1 |= M & 0x1000000; ++p;
case 25: m2 |= M & 0x2000000; ++p;
case 26: m3 |= M & 0x4000000; ++p;
case 27: m1 |= M & 0x8000000; ++p;
case 28: m2 |= M & 0x10000000; ++p;
case 29: m3 |= M & 0x20000000; ++p;
case 30: m1 |= M & 0x40000000; ++p;
case 31: m2 |= M & 0x80000000; ++p;
}
#undef M
return (m1 | m2 | m3) >> offset;
}
static inline int32_t line_result(uint32_t m, int start) {
int32_t p = first_bit_set((int32_t) m);
int32_t mm = mask(p, -1);
return mm | (start + p);
}
int line_search(small_hash_t* array, int start, small_hash_t x1) {
uint32_t m = line_mask(array, start, x1);
return line_result(m, start);
}
int line_search_2(small_hash_t* array, int start, small_hash_t x1,
small_hash_t x2) {
uint32_t m = line_mask_2(array, start, x1, x2);
return line_result(m, start);
}
int line_search_3(small_hash_t* array, int start, small_hash_t x1,
small_hash_t x2, small_hash_t x3) {
uint32_t m = line_mask_3(array, start, x1, x2, x3);
return line_result(m, start);
}
void check_impl_specific(int* num_tests, int* num_errors) {
}
|
