Lines Matching refs:permutations
277 // clear cache between permutations
296 size_t permutations;
328 // first figure out the total size of override permutations
330 size_t permutations = 1;
341 permutations *= test_overrides[i].permutations;
347 test_override_define_permutations = permutations;
350 if (count * permutations > test_override_define_capacity) {
352 size_t ncapacity = 1 << lfs_npw2(count * permutations);
361 sizeof(test_define_t) * count * permutations);
363 // compute permutations
374 // scatter the define permutations based on already
375 // seen permutations
376 for (size_t j = 0; j < permutations; j++) {
379 % test_overrides[i].permutations]);
382 // keep track of how many permutations we've seen so far
383 p *= test_overrides[i].permutations;
605 // a quick trie for keeping track of permutations we've seen
678 // iterate through permutations in a test case
725 for (size_t k = 0; k < case_->permutations; k++) {
768 // how many permutations are there actually in a test case
1855 "Run a all permutations of power-losses, this may take a while.",
1856 "Run a all permutations of n power-losses.",
2035 "Comma-separated range of test permutations to run (start,stop,step).",
2165 // parse comma-separated permutations
2168 override->permutations = 0;
2242 &override->permutations,
2255 &override->permutations,
2266 assert(override->permutations > 0);
2520 // exhaustive permutations