/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | TruncInstCombine.cpp | 484 for (auto Incoming : zip(OldPN->incoming_values(), OldPN->blocks()))
|
/freebsd-current/sys/fs/fuse/ |
H A D | fuse_vfsops.c | 665 sbp->f_blocks = fsfo->st.blocks;
|
/freebsd-current/contrib/lib9p/ |
H A D | utils.c | 571 sbuf_printf(sb, "%stype=0x%04lx bsize=%lu blocks=%" PRIu64 574 str, (u_long)st->type, (u_long)st->bsize, st->blocks, 1100 sbuf_printf(sb, " blksize=%" PRIu64 " blocks=%" PRIu64, 1101 fcall->rgetattr.blksize, fcall->rgetattr.blocks);
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineTraceMetrics.cpp | 258 /// by all blocks preceding MBB in its trace. It does not include instructions 272 /// by this block and all blocks following it in its trace. 290 // pickTracePred() is called on the post-ordered blocks. During the downwards 441 // revisit blocks. 451 LoopBounds(MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> blocks, 452 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {} 472 // Skip already visited To blocks. 545 // Invalidate height resources of blocks above MBB. 570 // Invalidate depth resources of blocks below MBB. 596 // because the instructions in that block may change. Other blocks ma [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | DFAJumpThreading.cpp | 11 // blocks unconditionally branch to the next correct case based on what is 26 // a list of basic blocks, the exit state, and the block that determines 52 // the basic blocks where the next state is decided. 90 STATISTIC(NumCloned, "Number of blocks cloned"); 100 cl::desc("Max number of blocks searched to find a threading path"), 194 /// created basic blocks into \p NewBBs. 210 // These are the new basic blocks for the conditional branch. 318 // This data structure keeps track of all blocks that have been cloned. If two 324 // information is needed when restoring SSA form after cloning blocks. 342 /// by cloning necessary basic blocks an [all...] |
H A D | LoopPredication.cpp | 224 // profitability analysis to find other exiting blocks that have a much higher 235 "expressed as widenable branches to deoptimize blocks"), 888 // Heuristic for profitability: If any of the exiting blocks' probability of 975 // Walk back through any unconditional executed blocks and see if we can find 1016 "We should only have known counts for exiting blocks that " 1035 // exits branching to deoptimizing blocks are rarely taken. It relies on the 1227 for (const auto BB : L->blocks()) {
|
/freebsd-current/sys/netpfil/ipfw/ |
H A D | ip_fw_sockopt.c | 95 uint32_t max_blocks; /* number of "long" blocks in bitmask */ 4277 ipfw_objhash_bitmap_merge(struct namedobj_instance *ni, void **idx, int *blocks) argument 4286 new_blocks = *blocks; 4298 ipfw_objhash_bitmap_swap(struct namedobj_instance *ni, void **idx, int *blocks) argument 4307 ni->max_blocks = *blocks; 4311 *blocks = old_blocks; 4315 ipfw_objhash_bitmap_free(void *idx, int blocks) argument
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 422 /// predicated blocks. If we return X, we are assuming the predicated block 426 /// we always assume predicated blocks have a 50% chance of executing. 659 /// Emit basic blocks (prefixed with \p Prefix) for the iteration check, 751 /// A list of all bypass blocks. The first block is the entry of the loop. 1631 /// Returns true if all loop blocks should be masked to fold tail loop. 1785 /// All blocks of loop are to be masked to fold tail of scalar iterations. 1930 /// The runtime checks are created up-front in temporary blocks to allow better 1933 /// temporary blocks are completely removed. 1970 /// accurately estimate the cost of the runtime checks. The blocks are 1972 /// there is no vector code generation, the check blocks ar [all...] |
/freebsd-current/crypto/openssl/crypto/modes/ |
H A D | gcm128.c | 1786 unsigned blocks = (mres + 15) & -16; local 1788 memset(ctx->Xn + mres, 0, blocks - mres); 1789 mres = blocks;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 2003 for (auto *B : L->blocks()) 2252 // added blocks are dominated by the old preheader). 2312 for (auto *B : L->blocks()) 2338 for (auto *B : L->blocks()) { 2365 // to dominate all the exit blocks of the loop. Verify this now. 2402 // Scan all the blocks in the loop that are not in subloops. 2404 // Ignore blocks in subloops.
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | ControlHeightReduction.cpp | 9 // This pass merges conditional blocks of code and reduces the number of 143 // sequence of conditional blocks. It can have subscopes which correspond to 144 // nested conditional blocks. Nested CHRScopes form a tree. 264 // True-biased and false-biased regions (conditional blocks), 738 // If any of the basic blocks have address taken, we must skip this region 739 // because we cannot clone basic blocks that have address taken. 740 for (BasicBlock *BB : R->blocks()) { 789 // Try to look for selects in the direct child blocks (as opposed to in 854 // selects in the first blocks. 1560 for (BasicBlock *BB : RI.R->blocks()) { // Thi [all...] |
/freebsd-current/crypto/openssl/crypto/aes/asm/ |
H A D | aesv8-armx.pl | 411 # data size smaller than 5 blocks, but not smaller than 3 blocks, 413 # If the input data size dsize >= 5*16 bytes, then take 5 blocks 415 # If 5*16 > lsize >= 3*16 bytes, take 3 blocks as one iteration, 418 # two blocks AES instructions. 2217 # data size smaller than 5 blocks, but not smaller than 3 blocks, 2219 # If the input data size dsize >= 5*16 bytes, then take 5 blocks 2654 // If left 4 blocks, borrow the five block's processing. 3338 // If x2($len) equal to -0x10, the left blocks i [all...] |
H A D | aes-c64xplus.pl | 986 my ($inp,$out,$blocks,$key,$ivp)=("A4","B4","A6","B6","A8"); 992 || MV $blocks,A2 ; reassign $blocks 1030 || [A2] SUB A2,1,A2 ; $blocks--
|
/freebsd-current/sys/dev/mmc/ |
H A D | mmcsd.c | 120 u_int max_data; /* Maximum data size [blocks] */ 121 u_int erase_sector; /* Device native erase sector size [blocks] */ 912 len = mic->blksz * mic->blocks; 978 err = mmcsd_set_blockcount(sc, mic->blocks,
|
/freebsd-current/stand/libsa/zfs/ |
H A D | zfs.c | 89 uint64_t f_num_leafs; /* number of fzap leaf blocks */ 727 zfs_diskread(void *arg, void *buf, size_t blocks, uint64_t offset) argument 733 offset * ppa->secsz, buf, blocks * ppa->secsz));
|
/freebsd-current/contrib/llvm-project/clang/include/clang-c/ |
H A D | Index.h | 823 * Tells the preprocessor not to skip excluded conditional blocks. 3878 #if __has_feature(blocks) 5891 #if __has_feature(blocks)
|
/freebsd-current/sys/fs/p9fs/ |
H A D | p9fs_vnops.c | 917 vap->va_bytes = inode->blocks * P9PROTO_TGETATTR_BLK; 977 inode->blocks = stat->st_blocks;
|
/freebsd-current/sys/crypto/openssl/amd64/ |
H A D | ossl_aes_gcm.c | 16 * blocks, ported from gcm128.c with OPENSSL_SMALL_FOOTPRINT defined. 163 /* Finalize GHASH(AAD) if AAD partial blocks left unprocessed */ 229 size_t blocks, void *ks, const unsigned char *iv);
|
/freebsd-current/tests/sys/fs/fusefs/ |
H A D | lookup.cc | 82 out.body.entry.attr.blocks = 2;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FalkorHWPFFix.cpp | 151 for (BasicBlock *BB : L.blocks()) { 709 // Go through all the basic blocks in the current loop and fix any streaming
|
H A D | AArch64LoopIdiomTransform.cpp | 346 // Ensure that when the Found and End blocks are identical the PHIs have the 360 // loop blocks, but not actually defined in the loop. This requires extra 372 // any other values we only allow ones that are same for both blocks. 407 // Create the blocks that we're going to need: 470 // Add the new basic blocks to their associated loops. 802 // 1. Be for blocks outside the loop, which aren't interesting. Or .. 803 // 2. These are from blocks in the loop with values defined outside 805 for (BasicBlock *BB : PN.blocks())
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 354 for (BasicBlock *BB : L->blocks())
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | RegionInfoImpl.h | 481 for (const auto *BB : blocks()) 729 // BBtoRegion relation. Only the child basic blocks have to be updated.
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollRuntime.cpp | 117 // two or more blocks that have the LatchExit as the target in the 246 // Exits from non-latch blocks point to the original exit block and the 284 // Skip this as we already updated phis in exit blocks. 332 /// Create a clone of the blocks in a loop and connect them together. A new 333 /// loop will be created including all cloned blocks, and the iterator of the 335 /// The cloned blocks should be inserted between InsertTop and InsertBot. 474 // we will not be able to merge all blocks into a straight line code. 485 // We avoid unrolling loops that have more than two exiting blocks. This 487 // the unroll factor (since one of the exiting blocks is the latch block). 493 // Allow unrolling of loops with no non latch exit blocks [all...] |
H A D | LoopUnrollAndJam.cpp | 67 // Partition blocks in an outer/inner loop pair into blocks before and after 74 for (BasicBlock *BB : L.blocks()) { 83 // Check that all blocks in ForeBlocks together dominate the subloop 98 /// Partition blocks in a loop nest into blocks before and after each inner 132 // Aft blocks that need to be moved before the subloop. It is used in two 204 We do this by spliting the blocks in the loop into Fore, Subloop and Aft. 205 Fore blocks are those before the inner loop, Aft are those after. Normal 206 Unroll code is used to copy each of these sets of blocks an [all...] |