Home
last modified time | relevance | path

Searched refs:Block (Results 1 – 25 of 1130) sorted by relevance

12345678910>>...46

/llvm-project-15.0.7/bolt/lib/Passes/
H A DExtTSPReorderAlgorithm.cpp153 Block(const Block &) = delete;
154 Block(Block &&) = default;
156 Block &operator=(Block &&) = default;
219 explicit Chain(size_t Id, Block *Block) in Chain() argument
481 for (Block &Block : AllBlocks) { in initialize()
502 for (Block &Block : AllBlocks) { in initialize()
513 for (Block &Block : AllBlocks) { in initialize()
522 for (Block &Block : AllBlocks) { in initialize()
547 for (Block &Block : AllBlocks) { in mergeFallthroughs()
574 for (Block &Block : AllBlocks) { in mergeFallthroughs()
[all …]
/llvm-project-15.0.7/mlir/lib/IR/
H A DBlock.cpp19 Block::~Block() { in ~Block()
30 Operation *Block::getParentOp() { in getParentOp()
39 void Block::insertBefore(Block *block) { in insertBefore()
47 void Block::moveBefore(Block *block) { in moveBefore()
54 void Block::erase() { in erase()
103 bool Block::verifyOpOrder() { in verifyOpOrder()
240 Block *Block::getSuccessor(unsigned i) { in getSuccessor()
251 Block *Block::getSinglePredecessor() { in getSinglePredecessor()
262 Block *Block::getUniquePredecessor() { in getUniquePredecessor()
289 Block *Block::splitBlock(iterator splitBefore) { in splitBlock()
[all …]
H A DDominance.cpp23 template class llvm::DominatorTreeBase<Block, /*IsPostDom=*/false>;
24 template class llvm::DominatorTreeBase<Block, /*IsPostDom=*/true>;
25 template class llvm::DomTreeNodeBase<Block>;
88 static Block *getAncestorBlock(Block *block) { in getAncestorBlock()
100 static Block *traverseAncestors(Block *block, const FuncT &func) { in traverseAncestors()
111 static bool tryGetBlocksInSameRegion(Block *&a, Block *&b) { in tryGetBlocksInSameRegion()
123 if (Block *aResult = traverseAncestors(a, [&](Block *block) { in tryGetBlocksInSameRegion()
135 if (Block *bResult = traverseAncestors(b, [&](Block *block) { in tryGetBlocksInSameRegion()
175 Block *
202 bool DominanceInfoBase<IsPostDom>::properlyDominates(Block *a, Block *b) const { in properlyDominates()
[all …]
H A DRegion.cpp97 for (Block &block : *this) { in cloneInto()
98 Block *newBlock = new Block(); in cloneInto()
123 Block &sourceBlock = std::get<0>(zippedBlocks); in cloneInto()
124 Block &clonedBlock = std::get<1>(zippedBlocks); in cloneInto()
154 Block *Region::findAncestorBlockInRegion(Block &block) { in findAncestorBlockInRegion()
155 Block *currBlock = &block; in findAncestorBlockInRegion()
182 for (Block &b : *this) in dropAllReferences()
186 Region *llvm::ilist_traits<::mlir::Block>::getParentRegion() { in getParentRegion()
189 iplist<Block> *anchor(static_cast<iplist<Block> *>(this)); in getParentRegion()
195 void llvm::ilist_traits<::mlir::Block>::addNodeToList(Block *block) { in addNodeToList()
[all …]
/llvm-project-15.0.7/lldb/source/Symbol/
H A DBlock.cpp24 Block::Block(lldb::user_id_t uid) in Block() function in Block
29 Block::~Block() = default;
112 Block *Block::FindBlockByID(user_id_t block_id) { in FindBlockByID()
160 Block *Block::CalculateSymbolContextBlock() { return this; } in CalculateSymbolContextBlock()
184 bool Block::Contains(const Block *block) const { in Contains()
202 Block *Block::GetParent() const { in GetParent()
208 Block *Block::GetContainingInlinedBlock() { in GetContainingInlinedBlock()
214 Block *Block::GetInlinedParent() { in GetInlinedParent()
225 Block *Block::GetContainingInlinedBlockWithCallSite( in GetContainingInlinedBlockWithCallSite()
505 Block *Block::GetSibling() const { in GetSibling()
[all …]
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DBlockSupport.h22 class Block; variable
52 static Block *unwrap(BlockOperand &value);
73 SuccessorRange, BlockOperand *, Block *, Block *, Block *> {
77 SuccessorRange(Block *block);
106 Block *, Block *, Block *> {
117 : BlockRange(ArrayRef<Block *>(blocks)) {} in BlockRange()
238 mlir::Block *getContainingBlock();
246 struct ilist_traits<::mlir::Block> : public ilist_alloc_traits<::mlir::Block> {
247 using Block = ::mlir::Block;
250 void addNodeToList(Block *block);
[all …]
H A DBlockAndValueMapping.h30 void map(Block *from, Block *to) { blockMap[from] = to; } in map()
36 !std::is_assignable<Block *, S>::value> * = nullptr>
43 void erase(Block *from) { blockMap.erase(from); } in erase()
47 bool contains(Block *from) const { return blockMap.count(from); } in contains()
52 Block *lookupOrNull(Block *from) const { in lookupOrNull()
53 return lookupOrValue(from, (Block *)nullptr); in lookupOrNull()
59 Block *lookupOrDefault(Block *from) const { in lookupOrDefault()
80 const DenseMap<Block *, Block *> &getBlockMap() const { return blockMap; } in getBlockMap()
85 Block *lookupOrValue(Block *from, Block *value) const { in lookupOrValue()
95 DenseMap<Block *, Block *> blockMap;
H A DDominance.h29 using DominanceInfoNode = llvm::DomTreeNodeBase<Block>;
35 using DomTree = llvm::DominatorTreeBase<Block, IsPostDom>;
54 Block *findNearestCommonDominator(Block *a, Block *b) const;
66 DominanceInfoNode *getNode(Block *a) { in getNode()
72 bool isReachableFromEntry(Block *a) const;
76 bool hasSSADominance(Block *block) const { in hasSSADominance()
101 bool properlyDominates(Block *a, Block *b) const;
153 bool dominates(Block *a, Block *b) const { in dominates()
163 bool properlyDominates(Block *a, Block *b) const { in properlyDominates()
189 bool properlyPostDominates(Block *a, Block *b) { in properlyPostDominates()
[all …]
H A DBlock.h32 explicit Block() = default;
33 ~Block();
60 void insertBefore(Block *block);
64 void moveBefore(Block *block);
241 Block *getSinglePredecessor();
245 Block *getUniquePredecessor();
249 Block *getSuccessor(unsigned i);
290 walk(Block::iterator begin, Block::iterator end, FnT &&callback) { in walk()
309 walk(Block::iterator begin, Block::iterator end, FnT &&callback) { in walk()
337 return &Block::operations; in getSublistAccess()
[all …]
H A DBuilders.h208 OpBuilder(Block *block, Block::iterator insertPoint,
271 InsertPoint(Block *insertBlock, Block::iterator insertPt) in InsertPoint()
277 Block *getBlock() const { return block; } in getBlock()
281 Block *block = nullptr;
282 Block::iterator point;
319 insertPoint = Block::iterator(); in clearInsertionPoint()
336 void setInsertionPoint(Block *block, Block::iterator insertPoint) { in setInsertionPoint()
386 Block *getBlock() const { return block; } in getBlock()
404 Block *createBlock(Block *insertBefore, TypeRange argTypes = llvm::None,
527 Block *block = nullptr;
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Symbol/
H A DBlock.h61 Block(lldb::user_id_t uid);
64 ~Block() override;
156 Block *GetParent() const;
165 Block *GetContainingInlinedBlock();
172 Block *GetInlinedParent();
187 Block *
195 Block *GetSibling() const;
202 Block *GetFirstChild() const { in GetFirstChild()
378 Block *GetSiblingForChild(const Block *child_block) const;
381 Block(const Block &) = delete;
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-profgen/
H A Dpseudoprobe-decoding.test18 ; CHECK: [Probe]: FUNC: bar Index: 1 Type: Block
19 ; CHECK-NEXT: [Probe]: FUNC: bar Index: 4 Type: Block
23 ; CHECK: [Probe]: FUNC: foo Index: 1 Type: Block
24 ; CHECK-NEXT: [Probe]: FUNC: foo Index: 2 Type: Block
27 ; CHECK: [Probe]: FUNC: foo Index: 5 Type: Block
29 ; CHECK: [Probe]: FUNC: foo Index: 6 Type: Block
30 ; CHECK-NEXT: [Probe]: FUNC: foo Index: 2 Type: Block
33 ; CHECK: [Probe]: FUNC: foo Index: 3 Type: Block
36 ; CHECK: [Probe]: FUNC: foo Index: 4 Type: Block
42 ; CHECK: [Probe]: FUNC: foo Index: 6 Type: Block
[all …]
/llvm-project-15.0.7/llvm/unittests/XRay/
H A DProfileTest.cpp56 Profile::Block{Profile::ThreadID{1}, in TEST()
66 Profile::Block{Profile::ThreadID{1}, in TEST()
75 Field(&Profile::Block::PathData, in TEST()
90 Profile::Block{Profile::ThreadID{1}, in TEST()
99 Field(&Profile::Block::PathData, in TEST()
117 Profile::Block{Profile::ThreadID{1}, in TEST()
121 Profile::Block{Profile::ThreadID{2}, in TEST()
126 Profile::Block{Profile::ThreadID{1}, in TEST()
129 Profile::Block{Profile::ThreadID{2}, in TEST()
165 Profile::Block{Profile::ThreadID{1}, in TEST()
[all …]
H A DFDRBlockVerifierTest.cpp73 auto Block = LogBuilder() in TEST() local
82 for (auto &R : Block) in TEST()
88 auto Block = LogBuilder() in TEST() local
96 for (auto &R : Block) in TEST()
102 auto Block = LogBuilder() in TEST() local
111 for (auto &R : Block) in TEST()
117 auto Block = LogBuilder() in TEST() local
127 ASSERT_THAT(Block, SizeIs(6u)); in TEST()
128 EXPECT_THAT_ERROR(Block[0]->apply(Verifier), Succeeded()); in TEST()
129 EXPECT_THAT_ERROR(Block[1]->apply(Verifier), Succeeded()); in TEST()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp165 class Block { class
167 Block(const Block &) = delete;
168 Block(Block &&) = default;
169 Block &operator=(const Block &) = delete;
170 Block &operator=(Block &&) = default;
208 Block *Source;
210 Block *Target;
215 explicit Jump(Block *Source, Block *Target, uint64_t ExecutionCount) in Jump()
227 explicit Chain(uint64_t Id, Block *Block) in Chain() argument
507 AllChains.emplace_back(Block.Index, &Block); in initialize()
[all …]
H A DSampleProfileInference.cpp925 fillInDegree(Block); in isAcyclicSubgraph()
942 if (Block->UnknownWeight && Block != SrcBlock) in isAcyclicSubgraph()
1058 assert((!Block.UnknownWeight || Block.Weight == 0 || Block.isEntry()) && in initializeNetwork()
1065 if (Block.Weight > 0) { in initializeNetwork()
1071 assert((!Block.isEntry() || !Block.isExit()) && in initializeNetwork()
1073 if (Block.isEntry()) { in initializeNetwork()
1096 if (Block.isEntry()) { in initializeNetwork()
1103 if (Block.HasSelfEdge) { in initializeNetwork()
1109 if (Block.Weight > 0) { in initializeNetwork()
1148 Block.Flow = Flow; in extractWeights()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h52 for (BlockT *Block : blocks()) { in getExitBlocks()
153 auto MapIt = BlockMap.find(Block);
160 BlockMapTopLevel.try_emplace(Block, C);
235 NewCycle->appendEntry(Block); in run()
243 if (Block == HeaderCandidate) in run()
270 ProcessPredecessors(Block); in run()
309 if (!BlockDFSInfo.count(Block)) { in dfs()
323 BlockPreorder.push_back(Block); in dfs()
374 auto MapIt = BlockMap.find(Block);
386 CycleT *Cycle = getCycle(Block); in getCycleDepth()
[all …]
/llvm-project-15.0.7/mlir/lib/Dialect/Transform/Transforms/
H A DCheckUses.cpp31 const llvm::SmallPtrSet<Block *, 4> &
33 DenseMap<Block *, llvm::SmallPtrSet<Block *, 4>> &cache) { in getReachableImpl() argument
39 SmallVector<Block *> worklist; in getReachableImpl()
42 Block *current = worklist.pop_back_val(); in getReachableImpl()
206 Block *from = in isUseLive()
265 PotentialDeleters isMaybeFreedOnPaths(Block *from, Block *to, Value value, in isMaybeFreedOnPaths()
285 for (Block *block : reachable) { in isMaybeFreedOnPaths()
297 const llvm::SmallPtrSet<Block *, 4> &getReachable(Block *block) { in getReachable()
304 const llvm::SmallPtrSet<Block *, 4> &getReachableFrom(Block *block) { in getReachableFrom()
360 DenseMap<Block *, llvm::SmallPtrSet<Block *, 4>> reachableCache;
[all …]
/llvm-project-15.0.7/mlir/lib/Dialect/Bufferization/Transforms/
H A DBufferOptimizations.cpp112 Block *placementBlock;
146 Block *dominatorBlock = in hoist()
152 Block *dependencyBlock = nullptr; in hoist()
165 Block *placementBlock = findPlacementBlock( in hoist()
180 Block *findPlacementBlock(StateT &state, Block *upperBound) { in findPlacementBlock()
181 Block *currentBlock = state.placementBlock; in findPlacementBlock()
190 Block *parentBlock; in findPlacementBlock()
250 Block *computeUpperBound(Block *dominatorBlock, Block *dependencyBlock) { in computeUpperBound()
286 Block *aliasDominatorBlock = nullptr;
289 Block *computeUpperBound(Block *dominatorBlock, Block *dependencyBlock) { in computeUpperBound()
[all …]
/llvm-project-15.0.7/clang/docs/
H A DBlockLanguageSpec.rst16 - 2008/8/13 --- revised, Block globals
28 The Block Type
50 Block Variable Declarations
55 valid Block variable declarations:
74 Block Literal Expressions
91 The following Block literal:
156 statement of a Block are imported and captured by the Block as const
178 Block literal expressions may occur within Block literal expressions
183 Block variables at global or local static scope.
199 the following are all legal Block invocations:
[all …]
/llvm-project-15.0.7/clang/lib/Analysis/
H A DCFG.cpp2691 if (Block) { in VisitCallExpr()
3001 B = Block; in VisitDeclSubExpr()
3032 if (Block) { in VisitIfStmt()
3270 if (Block) { in VisitSEHTryStmt()
3416 if (Block) { in VisitGCCAsmStmt()
3455 if (Block) { in VisitForStmt()
3661 if (Block) { in VisitObjCForCollectionStmt()
3686 if (Block) { in VisitObjCForCollectionStmt()
3808 if (Block) { in VisitWhileStmt()
4001 if (Block) { in VisitObjCAtTryStmt()
[all …]
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DLiveness.cpp34 BlockInfoBuilder(Block *block) : block(block) { in BlockInfoBuilder()
41 Block *ownerBlock = useOp->getBlock(); in BlockInfoBuilder()
108 Block *block{nullptr};
127 SetVector<Block *> toProcess; in buildBlockMapping()
139 Block *current = toProcess.pop_back_val(); in buildBlockMapping()
179 SmallPtrSet<Block *, 32> visited; in resolveLiveness()
180 SmallVector<Block *, 8> toProcess; in resolveLiveness()
183 Block *currentBlock; in resolveLiveness()
200 Block *block = toProcess.back(); in resolveLiveness()
242 Block *block = operation->getBlock(); in isDeadAfter()
[all …]
/llvm-project-15.0.7/mlir/test/lib/IR/
H A DTestDominance.cpp23 static bool dominatesOrPostDominates(DominanceInfo &dominanceInfo, Block *a, in dominatesOrPostDominates()
24 Block *b) { in dominatesOrPostDominates()
28 static bool dominatesOrPostDominates(PostDominanceInfo &dominanceInfo, Block *a, in dominatesOrPostDominates()
29 Block *b) { in dominatesOrPostDominates()
52 DenseSet<Block *> parentVisited; in printDominance()
54 Block *block = op->getBlock(); in printDominance()
58 DenseSet<Block *> visited; in printDominance()
60 Block *nestedBlock = nested->getBlock(); in printDominance()
66 Block *dom = in printDominance()
91 DenseMap<Block *, size_t> blockIds;
/llvm-project-15.0.7/clang/lib/Analysis/FlowSensitive/
H A DTypeErasedDataflowAnalysis.cpp168 const CFGBlock &Block, const Environment &InitEnv, in computeBlockInputState() argument
171 Preds.insert(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
172 if (Block.getTerminator().isTemporaryDtorsBranch()) { in computeBlockInputState()
307 const CFGBlock &Block, const Environment &InitEnv, in transferBlock() argument
314 for (const CFGElement &Element : Block) { in transferBlock()
365 while (const CFGBlock *Block = Worklist.dequeue()) { in runTypeErasedDataflowAnalysis() local
372 BlockStates[Block->getBlockID()]; in runTypeErasedDataflowAnalysis()
388 if (Block->hasNoReturnElement()) in runTypeErasedDataflowAnalysis()
391 Worklist.enqueueSuccessors(Block); in runTypeErasedDataflowAnalysis()
397 for (const CFGBlock *Block : CFCtx.getCFG()) { in runTypeErasedDataflowAnalysis() local
[all …]
/llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/tests/
H A Dchunk_test.cpp28 void *Block = malloc(HeaderSize + Size); in TEST() local
29 void *P = reinterpret_cast<void *>(reinterpret_cast<scudo::uptr>(Block) + in TEST()
37 free(Block); in TEST()
48 void *Block = malloc(HeaderSize + Size); in TEST() local
49 void *P = reinterpret_cast<void *>(reinterpret_cast<scudo::uptr>(Block) + in TEST()
60 free(Block); in TEST()
67 void *Block = malloc(HeaderSize + Size); in TEST() local
68 void *P = reinterpret_cast<void *>(reinterpret_cast<scudo::uptr>(Block) + in TEST()
75 *(reinterpret_cast<scudo::u8 *>(Block) + I) ^= 0x42U; in TEST()
77 *(reinterpret_cast<scudo::u8 *>(Block) + I) ^= 0x42U; in TEST()
[all …]

12345678910>>...46