| /freebsd/contrib/llvm-project/libunwind/src/ |
| H A D | CompactUnwinder.hpp | 128 uint32_t permutation = in stepWithCompactEncodingFrameless() local
136 // decompress permutation in stepWithCompactEncodingFrameless()
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()
[all …]
|
| /freebsd/contrib/llvm-project/lldb/source/Symbol/ |
| H A D | CompactUnwindInfo.cpp | 805 uint32_t permutation = EXTRACT_BITS( in CreateUnwindPlan_x86_64() local
857 // This is done with Lehmer code permutation, e.g. see in CreateUnwindPlan_x86_64()
858 // http://stackoverflow.com/questions/1506078/fast-permutation-number- in CreateUnwindPlan_x86_64()
859 // permutation-mapping-algorithms in CreateUnwindPlan_x86_64()
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()
[all …]
|
| /freebsd/contrib/llvm-project/lldb/tools/compact-unwind/ |
| H A D | compact-unwind-dumper.c | 473 uint32_t permutation = in print_encoding_x86_64() local
508 // This is done with Lehmer code permutation, e.g. see in print_encoding_x86_64()
509 …// http://stackoverflow.com/questions/1506078/fast-permutation-number-permutation-mapping-algorith… in print_encoding_x86_64()
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()
[all …]
|
| /freebsd/sys/contrib/openzfs/include/sys/ |
| H A D | vdev_draid.h | 52 * dRAID permutation map.
55 uint64_t dm_children; /* # of permutation columns */
56 uint64_t dm_nperms; /* # of permutation rows */
59 uint8_t *dm_perms; /* base permutation array */
78 uint8_t *vdc_perms; /* permutation array */
87 * Functions for handling dRAID permutation maps.
|
| /freebsd/crypto/krb5/src/lib/crypto/builtin/des/ |
| H A D | f_tables.h | 131 * Macros to help deal with the initial permutation table. Note
136 * single table to compute the permutation of all bytes. This sounds
154 * The following macro does an in-place initial permutation given
175 * Now the final permutation stuff. The same comments apply to
176 * this as to the initial permutation, except that we use different
191 * Here is a sample final permutation. Note that there is a trick
193 * last cipher round but before the final permutation. We do this
|
| H A D | f_tables.c | 51 * The S boxes and the P permutation are precomputed into one table.
53 * this algorithmically as needed. The initial permutation and final
54 * (inverse initial) permutation are computed from tables designed to
61 * The initial permutation array. This is used to compute both the
62 * left and the right halves of the initial permutation using bytes
143 * The final permutation array. Like the IP array, used
224 * The SP table is actually the S boxes and the P permutation
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/cmd/ |
| H A D | draid.c | 35 * The number of rows to generate for new permutation maps.
404 * Allocate a new permutation map for evaluation.
434 * Allocate the fixed permutation map for N children.
466 * Free a permutation map.
599 * Evaluate the quality of the permutation mapping by considering possible
714 * generated permutation maps. Only the best version is kept. in eval_maps()
737 * order to get a sense of the average permutation quality. in eval_maps()
756 * permutation array. This checksum is verified when opening a dRAID in eval_maps()
929 * Verify each map in the file by generating its in-memory permutation array
976 printf("Verifying permutation maps: '%s'\n", filename); in draid_verify()
[all …]
|
| /freebsd/sys/crypto/rc4/ |
| H A D | rc4.c | 63 /* Initialize state with identity permutation */ in rc4_init()
69 /* Randomize the permutation using key data */ in rc4_init()
97 /* Modify permutation */ in rc4_crypt()
|
| /freebsd/secure/lib/libcrypt/ |
| H A D | crypt-des.c | 248 * initialise the inverted key permutation. in des_init()
256 * Invert the key permutation and initialise the inverted key in des_init()
257 * compression permutation. in des_init()
265 * Invert the key compression permutation. in des_init()
326 * Invert the P-box permutation, and convert into OR-masks for in des_init()
392 * Do key permutation and split into two 28-bit subkeys. in des_setkey()
411 * Rotate subkeys and do compression permutation. in des_setkey()
473 * Do initial permutation (IP). in do_des()
523 * and do the pbox permutation at the same time. in do_des()
540 * Do final permutation (inverse of IP). in do_des()
|
| /freebsd/contrib/bearssl/src/symcipher/ |
| H A D | des_support.c | 32 * Permutation algorithm is initially from Richard Outerbridge; in br_des_do_IP()
100 * Permutation PC-1 is quite similar to the IP permutation. in br_des_keysched_unit()
|
| /freebsd/contrib/llvm-project/libunwind/include/mach-o/ |
| H A D | compact_unwind_encoding.h | 62 // 15-bits (5*3-bits per reg) register permutation
68 // 10-bits register permutation
135 // The permutation encoding is a Lehmer code sequence encoded into a
139 // The following is the algorithm used to create the permutation encoding used
197 // 15-bits (5*3-bits per reg) register permutation
203 // 10-bits register permutation
|
| /freebsd/crypto/openssl/crypto/des/asm/ |
| H A D | des_enc.m4 | 113 ! 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/sys/contrib/openzfs/module/zfs/ |
| H A D | vdev_draid.c | 51 * permutation mapping is applied to the order of the dRAID children.
73 * which contain the target number of groups. The permutation mappings
141 * permutation numbers and drive offsets is more complicated).
143 * N.B. The following array describes all valid dRAID permutation maps.
144 * Each row is used to generate a permutation map for a different number
151 * with a given permutation map) is the ratio of the amounts of I/O that will
153 * imbalance ratio (of a given number of disks and permutation map) is the
429 * once in every row, and the permutation array checksum must match.
469 * Generate the permutation array for the draid_map_t. These maps control
497 /* Allocate the permutation array */ in vdev_draid_generate_perms()
[all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/fault/ |
| H A D | auto_spare_multiple.ksh | 80 # since the dRAID permutation at these offsets maps to
163 # since the dRAID permutation at these offsets maps to
|
| /freebsd/crypto/openssl/include/openssl/ |
| H A D | des.h | 126 * permutation (IP) and final permutation (FP) have been left out. As for
|
| /freebsd/contrib/llvm-project/libcxx/modules/std/ |
| H A D | algorithm.cppm | |
| H A D | algorithm.inc | 135 // [alg.is.permutation], is permutation
605 // [alg.permutation.generators], permutations
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zpool_create/ |
| H A D | zpool_create_draid_004_pos.ksh | 32 # Verify generated dRAID permutation maps against the authoritative
|
| /freebsd/contrib/llvm-project/lldb/source/Host/common/ |
| H A D | GetOptInc.cpp | 262 /* do permutation, if we have to */ in getopt_internal()
288 * If no permutation wanted, stop parsing in getopt_internal()
293 /* do permutation */ in getopt_internal()
|
| /freebsd/contrib/file/src/ |
| H A D | getopt_long.c | 206 /* do permutation, if we have to */
234 * if no permutation wanted, stop parsing
239 /* do permutation */
|
| /freebsd/contrib/libfido2/openbsd-compat/ |
| H A D | getopt_long.c | 324 /* do permutation, if we have to */ in getopt_internal()
352 * If no permutation wanted, stop parsing in getopt_internal()
357 /* do permutation */ in getopt_internal()
|
| /freebsd/crypto/openssh/openbsd-compat/ |
| H A D | getopt_long.c | 347 /* do permutation, if we have to */ in getopt_internal()
375 * If no permutation wanted, stop parsing in getopt_internal()
380 /* do permutation */ in getopt_internal()
|
| /freebsd/lib/libc/stdlib/ |
| H A D | getopt_long.c | 388 /* do permutation, if we have to */
420 * If no permutation wanted, stop parsing
425 /* do permutation */
|
| /freebsd/contrib/tcpdump/missing/ |
| H A D | getopt_long.c | 418 /* do permutation, if we have to */
449 * If no permutation wanted, stop parsing
454 /* do permutation */
|
| /freebsd/crypto/openssl/crypto/sha/asm/ |
| H A D | keccak1600-avx2.pl | 23 # dedicated to one axis*, Pi permutation is reduced to intra-register
53 # with vpermq() represent Pi circular permutation in chosen layout. Note
54 # that first step is permutation-free.] A[0][0] is loaded to register of
55 # its own, to all lanes. [A[0][0] is not part of Pi permutation or Rho.]
96 # And reverse post-Chi permutation:
|