Searched refs:blocks (Results 276 - 291 of 291) sorted by relevance

<<1112

/freebsd-current/sys/dev/sound/pcm/
H A Dchannel.c753 c->blocks = 0;
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIInsertWaitcnts.cpp1640 #if 0 // TODO: the following blocks of logic when we have fence.
2388 for (MachineBasicBlock *MBB : ML->blocks()) {
2541 // Keep iterating over the blocks in reverse post order, inserting and
2623 // be improved by looking across blocks for flushes in postdominating
2624 // blocks from the stores but an explicitly requested flush is probably
H A DSIISelLowering.cpp5281 // want to break phis in successor blocks, so we can't just delete to the
15560 for (const MachineBasicBlock *MBB : ML->blocks()) {
15915 // used outside of divergent blocks. The phi users need to also be treated as
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp1202 if (!equal(LHS->blocks(), RHS->blocks()))
1729 // Match a pair of incoming constants for one of the predecessor blocks.
4255 // Do not sink into catchswitch blocks.
4426 // Bail out if we have uses in different blocks. We don't do any
4428 // these use blocks).
4713 // Remove instructions inside unreachable blocks. This prevents the
H A DInstCombineCompares.cpp472 // We cannot transform PHIs on unsplittable basic blocks.
1321 for (auto [V, Pred] : zip(Ops, Phi->blocks()))
4320 // blocks the transform as opposed to allowing it.
5993 /// other uses are in blocks dominated by a given block.
6000 /// and all other uses of \p DI are in blocks dominated by \p DB.
6012 // Protect from self-referencing blocks.
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1517 // PHI nodes use their value in their incoming blocks.
2474 // exits if there may be pre-inc users in intervening blocks.
3526 // blocks of the phi node since it is possible that the same incoming
3527 // value comes from multiple basic blocks, only some of which may end
3548 // Don't bother rewriting PHIs in catchswitch blocks.
5565 /// effectively happens in their predecessor blocks, so the expression may need
5680 // If fixup operand not found in any of the incoming blocks that
5682 for (const auto &Block : PN->blocks())
5837 // Only bother moving across blocks. Isel can handle block local case.
5885 for (BasicBlock *PredBB : PN->blocks())
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp142 "basic blocks are unlikely to be if-converted as a result"));
192 "Number of value comparisons folded into predecessor basic blocks");
197 "Number of common instruction 'blocks' hoisted up to the begin block");
201 "Number of common instruction 'blocks' sunk down to the end block");
206 "Number of invokes with empty resume blocks simplified into calls");
311 /// all of the predecessor blocks that are specified in \p IncomingBlocks.
320 "Only for a pair of incoming blocks at the time!");
347 // conflicting incoming values from the two switch blocks.
1100 // Note that there may be multiple predecessor blocks, so we cannot move
1529 /// Hoist any common code in the successor blocks u
[all...]
/freebsd-current/sys/contrib/openzfs/module/os/linux/zfs/
H A Dzfs_vnops_os.c120 * Thread B is in an already-assigned tx, and blocks for this lock.
121 * Thread A calls dmu_tx_assign(TXG_WAIT) and blocks in txg_wait_open()
1690 sp->blocks = nblocks;
2746 * super blocks.
3491 * super blocks.
4254 MODULE_PARM_DESC(zfs_delete_blocks, "Delete files larger than N blocks async");
/freebsd-current/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp1327 // blocks.
1591 // of little blocks will be needed and potentially a scalarized p0 mask,
2312 for (BasicBlock *BB : L->blocks()) {
2457 << "Exit blocks: " << ExitingBlocks.size() << "\n");
2465 // Allowing 4 blocks permits if-then-else diamonds in the body.
/freebsd-current/contrib/llvm-project/llvm/lib/IR/
H A DInstructions.cpp133 copyIncomingBlocks(drop_begin(blocks(), Idx + 1), Idx);
165 // Remove incoming blocks.
/freebsd-current/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstructions.h2751 // values and pointers to the incoming blocks, all in one allocation.
2774 // basic blocks, which parallels the list of incoming values.
2775 // Please note that we are not providing non-const iterators for blocks to
2789 iterator_range<const_block_iterator> blocks() const { function in class:llvm::CallInst::ShuffleVectorInst::PHINode
2846 /// Copies the basic blocks from \p BBRange to the incoming basic block list
3159 // BranchInst constructors (where {B, T, F} are blocks, and C is a condition):
3959 // get*Dest - Return the destination basic blocks...
4190 // Return the destination basic blocks...
/freebsd-current/sbin/camcontrol/
H A Dcamcontrol.c1793 printf("DSM - max 512byte blocks ");
4474 reassignblocks(struct cam_device *device, uint32_t *blocks, int num_blocks)
10155 "-N print the number of blocks instead of last block\n"
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp111 STATISTIC(NumBlocksElim, "Number of blocks eliminated");
204 cl::desc("Skip merging empty blocks if (frequency of empty block) / "
324 /// This allows us to avoid inserting duplicate code for blocks with
611 // optimization to those blocks.
621 // blocks, since there might be blocks that only contain @llvm.assume calls
625 // Eliminate blocks that contain only PHI nodes and an
719 // blocks are removed may affect whether or not PHI nodes in successors
733 // Delete the dead blocks and any of their dead successors.
746 // Merge pairs of basic blocks wit
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMPIRBuilder.cpp936 // LLVM utilities like blocks with terminators.
1078 // For a cancel barrier we create two new blocks.
1364 // Create an artificial insertion point that will also ensure the blocks we
1376 // Hide "open-ended" blocks from the given FiniCB by setting the right jump
1659 // The current basic block is split into four basic blocks. After outlining,
2127 // Create final reduction entry blocks for the atomic and non-atomic case.
2128 // Emit IR that dispatches control flow to one of the blocks based on the
2777 // Delete dead loop blocks
3142 /// Determine which blocks in \p BBs are reachable from outside and remove the
3190 // Loop control blocks tha
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp523 // Inv and CxtI are in different blocks.
1352 // Unreachable blocks may have zero-operand PHI nodes.
3022 for (const BasicBlock *IncomBB : PN1->blocks()) {
3024 continue; // Don't reprocess blocks that we have dealt with already.
3494 // Unreachable blocks may have zero-operand PHI nodes.
5267 // Unreachable blocks may have zero-operand PHI nodes.
7074 // FIXME: Relax this constraint to cover all basic blocks that are
7231 // blocks. The current limit is chosen arbitrarily.
H A DScalarEvolution.cpp5993 if (PN->getNumIncomingValues() == 2 && all_of(PN->blocks(), IsReachable)) {
6420 // even the values that are not available in these blocks may come from them,
7466 // Don't attempt to analyze instructions in blocks that aren't
7652 // Don't attempt to analyze instructions in blocks that aren't
8550 /// computable result can only be returned for loops with all exiting blocks
8563 // All exiting blocks we have collected must dominate the only backedge.
8567 // All exiting blocks we have gathered dominate loop's latch, so exact trip
8574 "We should only have known counts for exiting blocks that dominate "
13393 // relevant basic blocks, and not just terminators. Doing this is a waste of
14928 "We should only have known counts for exiting blocks tha
[all...]

Completed in 449 milliseconds

<<1112