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

/freebsd-11-stable/contrib/llvm-project/libunwind/src/
H A DCompactUnwinder.hpp127 uint32_t permutation = local
135 // decompress permutation
139 permunreg[0] = permutation / 120;
140 permutation -= (permunreg[0] * 120);
141 permunreg[1] = permutation / 24;
142 permutation -= (permunreg[1] * 24);
143 permunreg[2] = permutation / 6;
144 permutation -= (permunreg[2] * 6);
145 permunreg[3] = permutation / 2;
146 permutation
358 uint32_t permutation = local
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/tools/compact-unwind/
H A Dcompact-unwind-dumper.c516 uint32_t permutation = local
551 // This is done with Lehmer code permutation, e.g. see
552 // http://stackoverflow.com/questions/1506078/fast-permutation-number-permutation-mapping-algorithms
561 permunreg[0] = permutation / 120; // 120 == 5!
562 permutation -= (permunreg[0] * 120);
563 permunreg[1] = permutation / 24; // 24 == 4!
564 permutation -= (permunreg[1] * 24);
565 permunreg[2] = permutation / 6; // 6 == 3!
566 permutation
732 uint32_t permutation = local
[all...]
/freebsd-11-stable/contrib/llvm-project/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...]

Completed in 71 milliseconds