Lines Matching refs:permutations
264 // clear cache between permutations
283 size_t permutations;
315 // first figure out the total size of override permutations
317 size_t permutations = 1;
328 permutations *= bench_overrides[i].permutations;
334 bench_override_define_permutations = permutations;
337 if (count * permutations > bench_override_define_capacity) {
339 size_t ncapacity = 1 << lfs_npw2(count * permutations);
348 sizeof(bench_define_t) * count * permutations);
350 // compute permutations
361 // scatter the define permutations based on already
362 // seen permutations
363 for (size_t j = 0; j < permutations; j++) {
366 % bench_overrides[i].permutations]);
369 // keep track of how many permutations we've seen so far
370 p *= bench_overrides[i].permutations;
625 // a quick trie for keeping track of permutations we've seen
687 // iterate through permutations in a bench case
715 for (size_t k = 0; k < case_->permutations; k++) {
743 // how many permutations are there actually in a bench case
1470 "Comma-separated range of bench permutations to run (start,stop,step).",
1596 // parse comma-separated permutations
1599 override->permutations = 0;
1673 &override->permutations,
1686 &override->permutations,
1697 assert(override->permutations > 0);