/freebsd-current/crypto/openssl/crypto/modes/asm/ |
H A D | aes-gcm-armv8_64.pl | 20 # main loop to act on 4 16B blocks per iteration, and then do modulo of the accumulated intermediate hashes from the 4 blocks 388 cmp $input_ptr, $main_end_input_ptr @ check if we have <= 4 blocks 508 cmp $input_ptr, $main_end_input_ptr @ check if we have <= 8 blocks 933 .L128_enc_blocks_more_than_3: @ blocks left > 3 963 .L128_enc_blocks_more_than_2: @ blocks left > 2 1000 .L128_enc_blocks_more_than_1: @ blocks left > 1 1038 .L128_enc_blocks_less_than_1: @ blocks left <= 1 1314 cmp $input_ptr, $main_end_input_ptr @ check if we have <= 4 blocks 1339 cmp $input_ptr, $main_end_input_ptr @ check if we have <= 8 blocks [all...] |
/freebsd-current/contrib/lib9p/ |
H A D | pack.c | 612 l9p_pu64(msg, &fcall->rstatfs.statfs.blocks); 708 l9p_pu64(msg, &fcall->rgetattr.blocks);
|
/freebsd-current/sys/contrib/openzfs/module/zfs/ |
H A D | space_map.c | 42 * The data for a given space map can be kept on blocks of any size. 43 * Larger blocks entail fewer I/O operations, but they also cause the 45 * when only a few blocks have changed since the last transaction group. 58 * or two indirect blocks (16K-32K, rather than 128K). 127 * at the end of space map blocks in-order 129 * middle between two blocks. These entries 495 * map only cares about allocatable blocks (minimum of sm_shift) we 798 u_longlong_t blocks; local 804 dmu_object_size_from_db(sm->sm_dbuf, &sm->sm_blksz, &blocks); 1077 * of all subsequent blocks [all...] |
/freebsd-current/crypto/openssl/providers/implementations/ciphers/ |
H A D | cipher_aes_gcm_hw_s390x.inc | 181 /* Add any remaining 16 byte blocks (128 bit each) */
|
/freebsd-current/secure/lib/libcrypt/ |
H A D | blowfish.c | 472 blf_enc(blf_ctx *c, u_int32_t *data, u_int16_t blocks) argument 478 for (i = 0; i < blocks; i++) {
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | MVETPAndVPTOptimisationsPass.cpp | 10 /// and MVE VPT blocks before register allocation is performed. For VPT blocks 11 /// the goal is to maximize the sizes of the blocks that will be created by the 338 for (MachineBasicBlock *MBB : ML->blocks()) { 454 for (MachineBasicBlock *BB : ML->blocks()) { 1000 // Replace VPSEL with a predicated VMOV in blocks with a VCTP. This is a
|
/freebsd-current/crypto/openssl/crypto/evp/ |
H A D | e_aes.c | 110 unsigned char data_buf[16]; /* Store partial data blocks */ 111 unsigned char aad_buf[16]; /* Store partial AAD blocks */ 938 unsigned long long blocks; member in struct:__anon40::__anon41::__anon43 1754 ctx->aes.ccm.blocks += 2; 1760 ctx->aes.ccm.blocks += alen >> 4; 1770 ctx->aes.ccm.blocks++; 1789 ctx->aes.ccm.blocks++; 1812 ctx->aes.ccm.blocks += (((len + 15) >> 4) << 1) + 1; 1813 if (ctx->aes.ccm.blocks > (1ULL << 61)) 1944 cctx->aes.ccm.blocks [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | ELFNixPlatform.cpp | 746 // Make a pass over live symbols in the section: those blocks are already 758 // Add anonymous symbols to preserve any not-already-preserved blocks. 759 for (auto *B : InitSection.blocks()) 829 for (auto *B : TLSInfoEntrySection->blocks()) {
|
H A D | ObjectLinkingLayer.cpp | 365 // Lazily populated map of blocks to BlockSymbolDependencies values. 540 // First calculate the reachable-via-non-local-symbol blocks for each block. 551 for (auto *B : G.blocks()) 556 for (auto *B : G.blocks()) {
|
H A D | COFFPlatform.cpp | 865 for (auto *B : Sec.blocks()) 900 for (auto *B : S.blocks()) {
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | GenericUniformityImpl.h | 71 /// 2. Successors of the cycle header are replaced by the exit blocks 147 /// \brief Locate join blocks for disjoint paths starting at a divergent branch. 150 /// blocks whose phi nodes become divergent due to divergent control. 151 /// These are the blocks that are reachable by two disjoint paths from 209 // in the set of all blocks where each block is reachable from A 238 // The blocks D and F contain phi nodes and are thus each reachable 254 // identify join blocks. The "diverged entry" criterion is 255 // separately applied on join blocks to determine if an entire 293 // Labels assigned to blocks on diverged paths. 306 /// * The set of blocks whic [all...] |
H A D | GenericCycleImpl.h | 52 for (BlockT *Block : blocks()) { 189 // FixMe: Appending NewBlock is fine as a set of blocks in a cycle. When 312 /// \brief Compute a DFS of basic blocks starting at the function entry. 388 // cycles that had blocks Pred and Succ also get NewBlock.
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MemorySSA.h | 496 // basic blocks, which parallels the list of incoming values. 514 iterator_range<block_iterator> blocks() { function in class:llvm::final 518 iterator_range<const_block_iterator> blocks() const { function in class:llvm::final 610 "Cannot remove all incoming blocks in a MemoryPhi."); 613 // After deleting incoming block BB, the incoming blocks order may be changed. 639 /// values and pointers to the incoming blocks, all in one allocation. 773 /// Given two memory accesses in potentially different blocks,
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 57 // The name for newly created blocks. 151 /// of the blocks we remembered. 188 /// Is the BB returned by getResult() one of the blocks we added to the set 210 /// | / 3 = "Flow" blocks, newly inserted flow blocks, rejoins the flow 654 /// from some blocks as undefined. The function will find out all such blocks 676 // of B before structurization. F1/F2/F3 are flow blocks inserted during 1035 for (BasicBlock *BB : ParentRegion->blocks()) 1092 // their direct child basic blocks' terminator [all...] |
/freebsd-current/sys/dev/sound/pci/ |
H A D | emu10kx.c | 288 SLIST_HEAD(, emu_memblk) blocks; 1139 SLIST_INSERT_HEAD(&mem->blocks, blk, link); 1150 SLIST_FOREACH(i, &mem->blocks, link) { 1156 SLIST_REMOVE(&mem->blocks, blk, emu_memblk, link); 1173 SLIST_FOREACH(i, &mem->blocks, link) { 2706 SLIST_INIT(&sc->mem.blocks); 2921 if (!SLIST_EMPTY(&sc->mem.blocks)) 2924 SLIST_FOREACH(blk, &sc->mem.blocks, link)
|
/freebsd-current/sys/fs/p9fs/ |
H A D | p9_client.c | 1084 &stat->type, &stat->bsize, &stat->blocks, &stat->bfree, 1092 "blocks %ju bfree %ju bavail %ju files %ju ffree %ju " 1095 (uintmax_t)stat->bsize, (uintmax_t)stat->blocks, 1251 "blocks %ju st_atime_sec %ju, st_atime_nsec %ju "
|
/freebsd-current/crypto/openssl/crypto/aes/asm/ |
H A D | aesni-x86_64.pl | 43 # [-decrypt]' will exhibit 10-15% worse results for smaller blocks. 119 # independent blocks. In which case asymptotic limit for such modes 147 # processing adjacent triplets of independent blocks. In the 6x case 322 # of non-interleaved subroutine [for number of input blocks up to 3]. 647 movdqu ($inp),$inout0 # load 8 input blocks 660 movups $inout0,($out) # store 8 output blocks 662 movdqu ($inp),$inout0 # load 8 input blocks 687 movups $inout0,($out) # store 8 output blocks 720 movups $inout0,($out) # store 7 output blocks 738 movups $inout0,($out) # store 2 output blocks [all...] |
/freebsd-current/crypto/openssl/crypto/poly1305/asm/ |
H A D | poly1305-c64xplus.pl | 109 SHRU $LEN,4,A2 ; A2 is loop counter, number of blocks
|
/freebsd-current/stand/i386/boot2/ |
H A D | boot1.S | 102 movb %dh,%al # blocks to
|
/freebsd-current/sys/dev/qlnx/qlnxe/ |
H A D | ecore_hsi_debug_tools.h | 233 BIN_BUF_DBG_ATTN_BLOCKS /* Attention blocks */, 237 BIN_BUF_DBG_BUS_BLOCKS /* Debug Bus blocks */, 239 BIN_BUF_DBG_BUS_BLOCKS_USER_DATA /* Debug Bus blocks user data */, 251 #define DBG_ATTN_BIT_MAPPING_VAL_MASK 0x7FFF /* The index of an attention in the blocks attentions list (if is_unused_bit_cnt=0), or a number of consecutive unused attention bits (if is_unused_bit_cnt=1) */ 266 u16 regs_offset /* Offset of this blocks attention registers in the attention registers array (in dbg_attn_reg units) */; 287 u16 block_attn_offset /* The offset of this registers attentions within the blocks attentions list (a value in the range 0..number of block attentions-1) */; 326 u16 block_attn_offset /* The offset of this registers attentions within the blocks attentions list (a value in the range 0..number of block attentions-1) */; 353 u16 lines_offset /* Offset of this blocks lines in the Debug Bus lines array. */; 363 u16 names_offset /* Offset of this blocks lines in the debug bus line name offsets array. */; 697 u16 hw_id_mask /* The HW IDs of the recorded HW blocks, wher 716 struct dbg_bus_block_data blocks[88] /* Debug Bus data for each block */; member in struct:dbg_bus_data [all...] |
/freebsd-current/sys/geom/part/ |
H A D | g_part.c | 219 g_part_geometry_heads(off_t blocks, u_int sectors, off_t *bestchs, argument 231 cylinders = blocks / heads / sectors; 246 off_t blocks) 261 g_part_geometry_heads(blocks, sectors, &chs, &heads); 245 g_part_geometry(struct g_part_table *table, struct g_consumer *cp, off_t blocks) argument
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | HardwareLoops.cpp | 395 // Run through the basic blocks of the loop and see if any of them have dead 397 for (auto *I : L->blocks())
|
/freebsd-current/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | ELF_ppc64.cpp | 137 for (Block *B : dotTOCSection->blocks())
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericLoopInfo.h | 11 // blocks. A natural loop has exactly one entry-point, which is called the 17 // contained entirely within the loop and the basic blocks that make up the 25 // * the successor blocks of the loop 64 // The list of blocks in this loop. First entry is the header node. 80 /// for consistency with loop depth values used for basic blocks, where depth 81 /// 0 is used for blocks not inside any loops. 172 /// Get a list of the basic blocks which make up this loop. 180 inline iterator_range<block_iterator> blocks() const { function in class:llvm::LoopBase 185 /// Get the number of blocks in this loop in constant time. 192 /// Return a direct, mutable handle to the blocks vecto [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineNegator.cpp | 318 for (auto I : zip(NegatedIncomingValues, PHI->blocks()))
|