/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopConstrainer.cpp | 496 // Exit blocks will now have one more predecessor and their PHI nodes need 708 // Add all of the blocks in Original to the new loop. 709 for (auto *BB : Original->blocks()) 849 // We need to first add all the pre and post loop blocks into the loop
|
H A D | LoopUnroll.cpp | 13 // The process of unrolling can produce extraneous basic blocks linked with 115 /// \param Blocks is a vector of basic blocks representing unrolled loop. 117 /// It's possible that some of the blocks are in L, and some are not. In this 430 for (auto &BB : L->blocks()) 519 // The current on-the-fly SSA update requires blocks to be processed in 525 // Stash the DFS iterators before adding blocks to the loop. 533 // share the same exit blocks). We'll keep track of loops for which we can 601 // Add phi entries for newly created values to all exit blocks. 632 // dominates all copied blocks. That means, dominance relations in the 687 // Update dominators of blocks w [all...] |
/freebsd-current/sys/ufs/ffs/ |
H A D | ffs_softdep.c | 1266 static int stat_emptyjblocks; /* Number of potentially empty journal blocks */ 1713 * that blocks of a file are freed before the inode itself is freed. This 1936 /* releasing blocks and/or fragments from a file */ 2186 * separately from the file blocks and inodes to which they correspond. 2191 * find newly allocated blocks when trying to associate them with 2785 int blocks; local 2787 blocks = bytes / DEV_BSIZE; 2797 if (freecnt > blocks) 2798 freecnt = blocks; 2832 int blocks) 2830 jblocks_add(struct jblocks *jblocks, ufs2_daddr_t daddr, int blocks) argument 8188 freeblks_free(struct ufsmount *ump, struct freeblks *freeblks, int blocks) argument [all...] |
/freebsd-current/contrib/lib9p/backend/ |
H A D | fs.c | 682 out->blocks = in->f_blocks; 2494 req->lr_resp.rgetattr.blocks = (uint64_t)st.st_blocks;
|
/freebsd-current/crypto/openssl/crypto/chacha/asm/ |
H A D | chacha-c64xplus.pl | 91 || CMPLTU A0,$STEP,A1 ; is length < 2*blocks? 570 || CMPLTU A0,$STEP,A1 ; is remaining length < 2*blocks?
|
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | IRSimilarityIdentifier.cpp | 81 for (BasicBlock *BB : PN->blocks()) 172 // Convert the incoming blocks of the PHINode to an integer value, based on 483 // Add the basic blocks contained in the set into the global value numbering. 751 // Get the basic blocks the label refers to. 755 // Get the basic blocks contained in each region. 765 // Both blocks need to be contained in the region, or both need to be outside 771 // distance to the target blocks are the same. 858 // basic blocks outside the region in the same corresponding locations. 860 // We are able to make the assumption about blocks outside of the region
|
H A D | BranchProbabilityInfo.cpp | 209 /// Weight to a 'cold' block. Cold blocks are the ones containing calls marked 218 // Record SCC numbers of blocks in the CFG to identify irreducible loops. 456 // reachable blocks. 561 // FIXME: We currently consider unlikely blocks to be half as likely as other 562 // blocks, but if we consider the example above the likelyhood is actually 564 // blocks to be, but it would require more careful examination of the form 604 for (BasicBlock *B : P->blocks()) { 605 // Skip blocks that aren't part of the loop 693 // thus 'false' status is used to track visited blocks. 720 // Starting from \p BB traverse through dominator blocks an [all...] |
H A D | MemorySSAUpdater.cpp | 243 // In cases without unreachable blocks, because uses do not create new 251 // In cases with unreachable blocks, where the unnecessary Phis were 293 for (const BasicBlock *BlockBB : llvm::drop_begin(MP->blocks(), i)) { 357 // single successor, and only used a straight line of single pred blocks 387 // Add the phis created into the IDF blocks to NonOptPhis, so they are not 452 // Existing Phi blocks may need renaming too, if an access was previously 752 // Update/insert phis in all successors of exit blocks. 887 // Get nearest IDom given a set of blocks. 898 // Get all blocks that dominate PrevIDom, stop when reaching CurrIDom. Do not 921 // blocks, s [all...] |
/freebsd-current/sys/fs/fuse/ |
H A D | fuse_internal.c | 348 vp_cache_at->va_bytes = attr->blocks * S_BLKSIZE;
|
/freebsd-current/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | ELF_riscv.cpp | 533 for (auto *B : S.blocks()) {
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCLoopInstrFormPrep.cpp | 867 for (const auto &BB : L->blocks())
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZTargetTransformInfo.cpp | 289 for (auto &BB : L->blocks())
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineLICM.cpp | 91 DisableHoistingToHotterBlocks("disable-hoisting-to-hotter-blocks", 93 " hotter blocks"), 144 // Exit blocks of each Loop. 179 // If a MBB does not dominate loop exiting blocks then it may not safe 547 // Funclet entry blocks will clobber all registers 664 // Check loop exiting blocks. 726 /// Walk the specified loop in the CFG (defined by all blocks dominated by the 1016 // that it dominates all exiting blocks. If it doesn't, then there is a path 1070 // For now, approximate by rejecting all exit blocks. 1175 // Update register pressure of blocks fro [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnrollPass.cpp | 342 /// dynamic cost we mean that we won't count costs of blocks that are known not 672 for (BasicBlock *BB : L->blocks())
|
H A D | IndVarSimplify.cpp | 1590 // Visit our exit blocks in order of dominance. We know from the fact that 1789 // the normal dominance relation, plus a tie breaker for blocks 1795 // Check to see if our exit blocks are a total order (i.e. a linear chain of 1821 // At this point, ExitingBlocks consists of only those blocks which are 1829 for (BasicBlock *BB : L->blocks()) 1836 // Finally, do the actual predication for all predicatable blocks. A couple
|
H A D | LoopIdiomRecognize.cpp | 341 // Scan all the blocks in the loop that are not in subloops. 343 // Ignore blocks in subloops. 553 // to dominate all the exit blocks of the loop. Verify this now. 959 for (BasicBlock *B : L->blocks()) 1765 // Give up if the loop has multiple blocks or multiple backedges. 1868 // Give up if the loop has multiple blocks or multiple backedges. 2209 // Give up if the loop has multiple blocks or multiple backedges. 2566 // Give up if the loop has multiple blocks or multiple backedges.
|
H A D | LICM.cpp | 11 // code into the preheader block, or by sinking code to the exit blocks if it is 96 STATISTIC(NumCreatedBlocks, "Number of blocks created"); 539 /// Walk the specified region of the CFG (defined by all blocks dominated by 584 // Check to see if we can sink this instruction to the exit blocks 648 // A map of blocks in the loop to the block their instructions will be hoisted 727 // If we have less predecessor blocks than predecessors then the phi will 736 // Which blocks are predecessors via this branch depends on if the 791 // Create hoisted versions of blocks that currently don't have them 811 // Link up these blocks with branches. 854 "Hoisting blocks shoul [all...] |
/freebsd-current/sys/sys/ |
H A D | soundcard.h | 923 int blocks; /* # of fragment transitions since last time */ member in struct:count_info 1389 * Sysex messages are sent in blocks of 1 to 6 bytes. Longer messages must be
|
/freebsd-current/sys/contrib/openzfs/lib/libzfs/ |
H A D | libzfs_sendrecv.c | 970 uint64_t blocks; local 1011 &blocks)) != 0) { 1035 (u_longlong_t)bytes, (u_longlong_t)blocks, 1042 buf, (u_longlong_t)blocks, zhp->zfs_name);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64TargetTransformInfo.cpp | 3300 for (const auto BB : L->blocks()) { 3980 for (BasicBlock *BB : TheLoop->blocks()) { 4029 for (BasicBlock *BB : TFI->LVL->getLoop()->blocks()) {
|
/freebsd-current/sys/dev/ocs_fc/ |
H A D | ocs_utils.c | 1246 * @return Returns the calculated CRC, which may be passed back in for partial blocks. 2270 * @return Returns the calculated CRC, which may be passed back in for partial blocks.
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | DataFlowSanitizer.cpp | 611 /// used at a post process where CFG blocks are split. So it does not cache 1720 // DFSanVisitor may create new basic blocks, which confuses df_iterator. 1758 // places (i.e. instructions in basic blocks we haven't even begun visiting 3441 for (BasicBlock *BB : PN.blocks()) 3451 for (BasicBlock *BB : PN.blocks())
|
/freebsd-current/sys/dev/qlnx/qlnxe/ |
H A D | ecore_cxt.c | 172 /* ILT client blocks for PF */ 176 /* ILT client blocks for VFs */ 2379 p_info->blocks[i] = p_mngr->ilt_shadow[shadow_line].p_virt;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUCodeGenPrepare.cpp | 1988 for (const auto &[Idx, BB] : enumerate(I.blocks())) {
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | BasicTTIImpl.h | 611 for (BasicBlock *BB : L->blocks()) {
|