Lines Matching defs:seen
362 // seen permutations
369 // keep track of how many permutations we've seen so far
625 // a quick trie for keeping track of permutations we've seen
638 bench_seen_t *seen,
653 // already seen?
655 for (size_t i = 0; i < seen->branch_count; i++) {
656 if (seen->branches[i].define == define) {
657 branch = &seen->branches[i];
666 (void**)&seen->branches,
668 &seen->branch_count,
669 &seen->branch_capacity);
674 seen = &branch->branch;
680 void bench_seen_cleanup(bench_seen_t *seen) {
681 for (size_t i = 0; i < seen->branch_count; i++) {
682 bench_seen_cleanup(&seen->branches[i].branch);
684 free(seen->branches);
713 bench_seen_t seen = {NULL, 0, 0};
728 // have we seen this permutation before?
729 bool was_seen = bench_seen_insert(&seen, suite, case_);
739 bench_seen_cleanup(&seen);