|
26 | 26 | #define FAST_RSEARCH 2
|
27 | 27 |
|
28 | 28 | #if LONG_BIT >= 128
|
29 |
| -#define STRINGLIB_BLOOM_WIDTH 128 |
30 |
| -#define STRINGLIB_BLOOM_FULL 127 |
| 29 | +# define STRINGLIB_BLOOM_MASK 127 |
31 | 30 | #elif LONG_BIT >= 64
|
32 |
| -#define STRINGLIB_BLOOM_WIDTH 64 |
33 |
| -#define STRINGLIB_BLOOM_FULL 63 |
| 31 | +# define STRINGLIB_BLOOM_MASK 63 |
34 | 32 | #elif LONG_BIT >= 32
|
35 |
| -#define STRINGLIB_BLOOM_WIDTH 32 |
36 |
| -#define STRINGLIB_BLOOM_FULL 31 |
| 33 | +# define STRINGLIB_BLOOM_MASK 31 |
37 | 34 | #else
|
38 |
| -#error "LONG_BIT is smaller than 32" |
| 35 | +# error "LONG_BIT is smaller than 32" |
39 | 36 | #endif
|
40 | 37 |
|
41 | 38 | #define STRINGLIB_BLOOM_ADD(mask, ch) \
|
42 |
| - ((mask |= (1UL << ((ch) & (STRINGLIB_BLOOM_FULL))))) |
| 39 | + ((mask |= (1UL << ((ch) & (STRINGLIB_BLOOM_MASK))))) |
43 | 40 | #define STRINGLIB_BLOOM(mask, ch) \
|
44 |
| - ((mask & (1UL << ((ch) & (STRINGLIB_BLOOM_FULL))))) |
| 41 | + ((mask & (1UL << ((ch) & (STRINGLIB_BLOOM_MASK))))) |
45 | 42 |
|
46 | 43 | #ifdef STRINGLIB_FAST_MEMCHR
|
47 | 44 | # define MEMCHR_CUT_OFF 15
|
@@ -360,9 +357,8 @@ STRINGLIB(_factorize)(const STRINGLIB_CHAR *needle,
|
360 | 357 | #define SHIFT_TYPE uint8_t
|
361 | 358 | #define MAX_SHIFT UINT8_MAX
|
362 | 359 |
|
363 |
| -#define TABLE_SIZE_BITS 6u |
364 |
| -#define TABLE_SIZE (1U << TABLE_SIZE_BITS) |
365 |
| -#define TABLE_MASK (TABLE_SIZE - 1U) |
| 360 | +#define TABLE_SIZE 128U |
| 361 | +#define TABLE_MASK 127U |
366 | 362 |
|
367 | 363 |
|
368 | 364 | typedef struct STRINGLIB(_pre) {
|
@@ -899,7 +895,6 @@ STRINGLIB(horspool_find)(const STRINGLIB_CHAR* haystack,
|
899 | 895 | #undef SHIFT_TYPE
|
900 | 896 | #undef NOT_FOUND
|
901 | 897 | #undef SHIFT_OVERFLOW
|
902 |
| -#undef TABLE_SIZE_BITS |
903 | 898 | #undef TABLE_SIZE
|
904 | 899 | #undef TABLE_MASK
|
905 | 900 |
|
|
0 commit comments