Lines Matching defs:define

8 #define _POSIX_C_SOURCE 199309L
143 #define TEST_SUITE_COUNT \
147 // test define management
162 #define TEST_CONST(x) {test_define_lit, (void*)(uintptr_t)(x)}
163 #define TEST_LIT(x) ((test_define_t)TEST_CONST(x))
166 #define TEST_DEF(k, v) \
175 #define TEST_DEFINE_MAP_OVERRIDE 0
176 #define TEST_DEFINE_MAP_EXPLICIT 1
177 #define TEST_DEFINE_MAP_PERMUTATION 2
178 #define TEST_DEFINE_MAP_GEOMETRY 3
179 #define TEST_DEFINE_MAP_IMPLICIT 4
180 #define TEST_DEFINE_MAP_COUNT 5
185 #define TEST_DEF(k, v) \
195 #define TEST_DEFINE_NAMES_SUITE 0
196 #define TEST_DEFINE_NAMES_IMPLICIT 1
197 #define TEST_DEFINE_NAMES_COUNT 2
202 #define TEST_DEF(k, v) \
216 const char *test_define_name(size_t define) {
219 if (define < test_define_names[i].count
221 && test_define_names[i].names[define]) {
222 return test_define_names[i].names[define];
229 bool test_define_ispermutation(size_t define) {
230 // is this define specific to the permutation?
232 if (define < test_define_maps[i].count
233 && test_define_maps[i].defines[define].cb) {
241 intmax_t test_define(size_t define) {
242 // is the define in our cache?
243 if (define < test_define_cache_count
244 && (test_define_cache_mask[define/(8*sizeof(unsigned))]
245 & (1 << (define%(8*sizeof(unsigned)))))) {
246 return test_define_cache[define];
251 if (define < test_define_maps[i].count
252 && test_define_maps[i].defines[define].cb) {
253 intmax_t v = test_define_maps[i].defines[define].cb(
254 test_define_maps[i].defines[define].data);
257 test_define_cache[define] = v;
258 test_define_cache_mask[define / (8*sizeof(unsigned))]
259 |= 1 << (define%(8*sizeof(unsigned)));
268 const char *name = test_define_name(define);
269 fprintf(stderr, "error: undefined define %s (%zd)\n",
271 define);
337 // define name match?
371 // define name match?
374 // scatter the define permutations based on already
419 // test define management can allocate a few things
459 #define TEST_TRACE_BACKTRACE_BUFFER_SIZE 8192
613 intmax_t define;
631 intmax_t define = test_define_ispermutation(d) ? TEST_DEFINE(d) : 0;
636 if (seen->branches[i].define == define) {
650 branch->define = define;
697 // define override permutation
726 // define permutation
730 // define override permutation
734 // define geometry
1064 // define already in defines?
1084 // new define?
1085 struct list_defines_define *define = mappend(
1090 define->name = name;
1091 define->values = malloc(sizeof(intmax_t));
1092 define->values[0] = value;
1093 define->value_count = 1;
1094 define->value_capacity = 1;
1241 // yes we do need to define a suite, this does a bit of bookeeping
1242 // such as setting up the define cache
1301 // yes we do need to define a suite, this does a bit of bookeeping
1302 // such as setting up the define cache
2005 {"define", required_argument, NULL, OPT_DEFINE},
2032 "Override a test define.",
2247 intmax_t define = strtoimax(optarg, &parsed, 0);
2256 &override_capacity) = define;
2270 fprintf(stderr, "error: invalid define: %s\n", optarg);