Lines Matching defs:define
8 #define _POSIX_C_SOURCE 199309L
130 #define BENCH_SUITE_COUNT \
134 // bench define management
149 #define BENCH_CONST(x) {bench_define_lit, (void*)(uintptr_t)(x)}
150 #define BENCH_LIT(x) ((bench_define_t)BENCH_CONST(x))
153 #define BENCH_DEF(k, v) \
162 #define BENCH_DEFINE_MAP_OVERRIDE 0
163 #define BENCH_DEFINE_MAP_EXPLICIT 1
164 #define BENCH_DEFINE_MAP_PERMUTATION 2
165 #define BENCH_DEFINE_MAP_GEOMETRY 3
166 #define BENCH_DEFINE_MAP_IMPLICIT 4
167 #define BENCH_DEFINE_MAP_COUNT 5
172 #define BENCH_DEF(k, v) \
182 #define BENCH_DEFINE_NAMES_SUITE 0
183 #define BENCH_DEFINE_NAMES_IMPLICIT 1
184 #define BENCH_DEFINE_NAMES_COUNT 2
189 #define BENCH_DEF(k, v) \
203 const char *bench_define_name(size_t define) {
206 if (define < bench_define_names[i].count
208 && bench_define_names[i].names[define]) {
209 return bench_define_names[i].names[define];
216 bool bench_define_ispermutation(size_t define) {
217 // is this define specific to the permutation?
219 if (define < bench_define_maps[i].count
220 && bench_define_maps[i].defines[define].cb) {
228 intmax_t bench_define(size_t define) {
229 // is the define in our cache?
230 if (define < bench_define_cache_count
231 && (bench_define_cache_mask[define/(8*sizeof(unsigned))]
232 & (1 << (define%(8*sizeof(unsigned)))))) {
233 return bench_define_cache[define];
238 if (define < bench_define_maps[i].count
239 && bench_define_maps[i].defines[define].cb) {
240 intmax_t v = bench_define_maps[i].defines[define].cb(
241 bench_define_maps[i].defines[define].data);
244 bench_define_cache[define] = v;
245 bench_define_cache_mask[define / (8*sizeof(unsigned))]
246 |= 1 << (define%(8*sizeof(unsigned)));
255 const char *name = bench_define_name(define);
256 fprintf(stderr, "error: undefined define %s (%zd)\n",
258 define);
324 // define name match?
358 // define name match?
361 // scatter the define permutations based on already
406 // bench define management can allocate a few things
443 #define BENCH_TRACE_BACKTRACE_BUFFER_SIZE 8192
633 intmax_t define;
651 intmax_t define = bench_define_ispermutation(d) ? BENCH_DEFINE(d) : 0;
656 if (seen->branches[i].define == define) {
670 branch->define = define;
703 // define override permutation
716 // define permutation
720 // define override permutation
724 // define geometry
1031 // define already in defines?
1051 // new define?
1052 struct list_defines_define *define = mappend(
1057 define->name = name;
1058 define->values = malloc(sizeof(intmax_t));
1059 define->values[0] = value;
1060 define->value_count = 1;
1061 define->value_capacity = 1;
1200 // yes we do need to define a suite, this does a bit of bookeeping
1201 // such as setting up the define cache
1260 // yes we do need to define a suite, this does a bit of bookeeping
1261 // such as setting up the define cache
1443 {"define", required_argument, NULL, OPT_DEFINE},
1468 "Override a bench define.",
1678 intmax_t define = strtoimax(optarg, &parsed, 0);
1687 &override_capacity) = define;
1701 fprintf(stderr, "error: invalid define: %s\n", optarg);