Home
last modified time | relevance | path

Searched refs:permutation (Results 1 – 25 of 30) sorted by relevance

12

/freebsd/contrib/llvm-project/libunwind/src/
H A DCompactUnwinder.hpp128 uint32_t permutation = in stepWithCompactEncodingFrameless() local
140 permunreg[0] = permutation / 120; in stepWithCompactEncodingFrameless()
141 permutation -= (permunreg[0] * 120); in stepWithCompactEncodingFrameless()
142 permunreg[1] = permutation / 24; in stepWithCompactEncodingFrameless()
143 permutation -= (permunreg[1] * 24); in stepWithCompactEncodingFrameless()
144 permunreg[2] = permutation / 6; in stepWithCompactEncodingFrameless()
145 permutation -= (permunreg[2] * 6); in stepWithCompactEncodingFrameless()
146 permunreg[3] = permutation / 2; in stepWithCompactEncodingFrameless()
147 permutation -= (permunreg[3] * 2); in stepWithCompactEncodingFrameless()
148 permunreg[4] = permutation; in stepWithCompactEncodingFrameless()
[all …]
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DCompactUnwindInfo.cpp805 uint32_t permutation = EXTRACT_BITS( in CreateUnwindPlan_x86_64() local
867 permunreg[0] = permutation / 120; // 120 == 5! in CreateUnwindPlan_x86_64()
868 permutation -= (permunreg[0] * 120); in CreateUnwindPlan_x86_64()
869 permunreg[1] = permutation / 24; // 24 == 4! in CreateUnwindPlan_x86_64()
870 permutation -= (permunreg[1] * 24); in CreateUnwindPlan_x86_64()
871 permunreg[2] = permutation / 6; // 6 == 3! in CreateUnwindPlan_x86_64()
872 permutation -= (permunreg[2] * 6); in CreateUnwindPlan_x86_64()
873 permunreg[3] = permutation / 2; // 2 == 2! in CreateUnwindPlan_x86_64()
874 permutation -= (permunreg[3] * 2); in CreateUnwindPlan_x86_64()
875 permunreg[4] = permutation; // 1 == 1! in CreateUnwindPlan_x86_64()
[all …]
/freebsd/contrib/llvm-project/lldb/tools/compact-unwind/
H A Dcompact-unwind-dumper.c473 uint32_t permutation = in print_encoding_x86_64() local
518 permunreg[0] = permutation / 120; // 120 == 5! in print_encoding_x86_64()
519 permutation -= (permunreg[0] * 120); in print_encoding_x86_64()
520 permunreg[1] = permutation / 24; // 24 == 4! in print_encoding_x86_64()
521 permutation -= (permunreg[1] * 24); in print_encoding_x86_64()
522 permunreg[2] = permutation / 6; // 6 == 3! in print_encoding_x86_64()
523 permutation -= (permunreg[2] * 6); in print_encoding_x86_64()
524 permunreg[3] = permutation / 2; // 2 == 2! in print_encoding_x86_64()
525 permutation -= (permunreg[3] * 2); in print_encoding_x86_64()
526 permunreg[4] = permutation; // 1 == 1! in print_encoding_x86_64()
[all …]
/freebsd/tests/sys/cddl/zfs/tests/txg_integrity/
H A Dtxg_integrity.c96 int permutation[NUM_CHUNKS]; //the order in which to write the chunks member
428 int chunk_idx = p_pat->permutation[perm_idx]; in follower()
457 int chunk_idx = p_pat->permutation[perm_idx]; in leader()
H A Dfsync_integrity.c104 int permutation[NUM_CHUNKS]; //the order in which to write the chunks member
388 int chunk_idx = data->pat->permutation[perm_idx]; in worker()
/freebsd/crypto/openssl/crypto/des/asm/
H A Ddes_enc.m4113 ! After the original LibDES initial permutation, the resulting left
260 ! into 32 bits according to the P permutation.
529 ! The final permutation logic switches the halves, meaning that
537 ! initially undo the rotate 3 left done after initial permutation
611 ! Does initial permutation for next block mixed with
612 ! final permutation for current block.
1169 ! encrypts/decrypts without initial/final permutation
1431 ! we combine final permutation for this block with initial
1432 ! permutation for next block. Load next block:
1633 ! we combine final permutation for this block with initial
[all …]
/freebsd/contrib/llvm-project/libcxx/modules/std/
H A Dalgorithm.cppm
H A Dalgorithm.inc135 // [alg.is.permutation], is permutation
605 // [alg.permutation.generators], permutations
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCScheduleG4.td19 def G4_VPU : FuncUnit; // vector permutation unit
H A DPPCScheduleG4Plus.td21 def G4P_VPU : FuncUnit; // vector permutation unit
H A DPPCScheduleG5.td20 def G5_VPU : FuncUnit; // vector permutation unit
/freebsd/usr.sbin/cron/doc/
H A DCHANGES104 every possible combination and permutation of #ifdef options, but meanwhile
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVFeatures.td525 "'Zbkx' (Crossbar permutation instructions)">,
529 "'Zbkx' (Crossbar permutation instructions)">;
/freebsd/contrib/googletest/docs/reference/
H A Dmatchers.md135 …(e0, e1, ..., en)` | `argument` has `n + 1` elements, and under *some* permutation of the elements…
/freebsd/crypto/heimdal/doc/
H A Dcopyright.texi427 Thanks to: Dan Hoey for his excellent Initial and Inverse permutation
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64Features.td384 "Enable bit permutation SVE2 instructions", [FeatureSVE2]>;
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DIntrinsicsX86.td948 // Vector permutation
1568 // Vector permutation
H A DIntrinsicsAArch64.td2686 // SVE2 - Optional bit permutation
/freebsd/crypto/heimdal/
H A DChangeLog.2006843 permutation of clients
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DVOP3PInstructions.td326 // Define non-associative/commutative add/mul to prevent permutation in the dot8
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.in4312 …n of a pair of adjacent vertices where the position of the pair in the permutation is determined b…
4316 …torial algebra; graph theory; Hamiltonian; nonoriented complete graph; permutation; rosary permuta…
10181 …osition algorithms; combinatorial analysis; combinatorial mathematics; permutation; reflection fre…
11433 …keywords = "ALGOL; analysis; binary model; group theory; lattice; outer product; permutation; …
12381 …keywords = "algorithm; bandwidth; eigenvalues; graph; matrix algebra; permutation; sparse matr…
12382 kwds = "nla, tridiagonal matrix, permutation matrix",
13379 …er and primary memories for a mono-programmed computer system. A basic permutation algorithm and s…
13386 …ng; memory hierarchy; model; monoprogrammed; operating systems; permutation; permutation algorithm…
17799 …permutation enumeration algorithms encounter special cases requiring additional computation every …
17805 … "combinatorial mathematics; computer programming; enumeration; loop free algorithms; permutation",
[all …]
H A Dfunstack.ok2845 M. K. Roy A note on reflection-free permutation
/freebsd/contrib/file/magic/Magdir/
H A Dwindows1005 # bCryptMethod: 0~No encryption 1~encryption with permutation 2~encryption with cyclic 16~encryptio…
/freebsd/sys/contrib/openzfs/tests/zfs-tests/include/
H A Dlibtest.shlib3639 # Produce a random permutation of the integers in a given range (inclusive).
/freebsd/contrib/googletest/docs/
H A Dgmock_cook_book.md1396 It means that the container must have 4 elements, which (under some permutation)

12