Searched refs:permutation (Results 1 - 3 of 3) sorted by relevance

/openbsd-current/gnu/llvm/libunwind/src/
H A DCompactUnwinder.hpp128 uint32_t permutation = local
136 // decompress permutation
140 permunreg[0] = permutation / 120;
141 permutation -= (permunreg[0] * 120);
142 permunreg[1] = permutation / 24;
143 permutation -= (permunreg[1] * 24);
144 permunreg[2] = permutation / 6;
145 permutation -= (permunreg[2] * 6);
146 permunreg[3] = permutation / 2;
147 permutation
359 uint32_t permutation = local
[all...]
/openbsd-current/gnu/llvm/lldb/source/Symbol/
H A DCompactUnwindInfo.cpp805 uint32_t permutation = EXTRACT_BITS( local
857 // This is done with Lehmer code permutation, e.g. see
858 // http://stackoverflow.com/questions/1506078/fast-permutation-number-
859 // permutation-mapping-algorithms
867 permunreg[0] = permutation / 120; // 120 == 5!
868 permutation -= (permunreg[0] * 120);
869 permunreg[1] = permutation / 24; // 24 == 4!
870 permutation -= (permunreg[1] * 24);
871 permunreg[2] = permutation / 6; // 6 == 3!
872 permutation
1070 uint32_t permutation = EXTRACT_BITS( local
[all...]
/openbsd-current/gnu/llvm/lldb/tools/compact-unwind/
H A Dcompact-unwind-dumper.c473 uint32_t permutation = local
508 // This is done with Lehmer code permutation, e.g. see
509 // http://stackoverflow.com/questions/1506078/fast-permutation-number-permutation-mapping-algorithms
518 permunreg[0] = permutation / 120; // 120 == 5!
519 permutation -= (permunreg[0] * 120);
520 permunreg[1] = permutation / 24; // 24 == 4!
521 permutation -= (permunreg[1] * 24);
522 permunreg[2] = permutation / 6; // 6 == 3!
523 permutation
689 uint32_t permutation = local
[all...]

Completed in 215 milliseconds