Home
last modified time | relevance | path

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

/llvm-project/llvm/include/llvm/Analysis/
H A DTrace.h33 BasicBlockListType BasicBlocks; variable
39 Trace(const std::vector<BasicBlock *> &vBB) : BasicBlocks (vBB) {} in Trace()
43 BasicBlock *getEntryBasicBlock () const { return BasicBlocks[0]; } in getEntryBasicBlock()
46 BasicBlock *operator[](unsigned i) const { return BasicBlocks[i]; }
47 BasicBlock *getBlock(unsigned i) const { return BasicBlocks[i]; } in getBlock()
59 for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i) in getBlockIndex()
60 if (BasicBlocks[i] == X) in getBlockIndex()
85 iterator begin() { return BasicBlocks.begin(); } in begin()
86 const_iterator begin() const { return BasicBlocks.begin(); } in begin()
87 iterator end () { return BasicBlocks.end(); } in end()
[all …]
/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h140 createFlowFunction(const std::vector<const BasicBlockT *> &BasicBlocks,
146 void findUnlikelyJumps(const std::vector<const BasicBlockT *> &BasicBlocks,
184 std::vector<const BasicBlockT *> BasicBlocks; in apply() local
186 BasicBlocks.reserve(Reachable.size()); in apply()
189 BlockIndex[&BB] = BasicBlocks.size(); in apply()
190 BasicBlocks.push_back(&BB); in apply()
197 for (const auto *BB : BasicBlocks) { in apply()
205 if (BasicBlocks.size() <= 1 || !HasSamples) { in apply()
210 FlowFunction Func = createFlowFunction(BasicBlocks, BlockIndex); in apply()
218 for (const auto *BB : BasicBlocks) { in apply()
243 createFlowFunction(const std::vector<const BasicBlockT * > & BasicBlocks,DenseMap<const BasicBlockT *,uint64_t> & BlockIndex) createFlowFunction() argument
302 findUnlikelyJumps(const std::vector<const BasicBlockT * > & BasicBlocks,BlockEdgeMap & Successors,FlowFunction & Func) findUnlikelyJumps() argument
[all...]
/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineFunction.h324 BasicBlockListType BasicBlocks;
937 return &MachineFunction::BasicBlocks;
947 iterator begin() { return BasicBlocks.begin(); }
948 const_iterator begin() const { return BasicBlocks.begin(); }
949 iterator end () { return BasicBlocks.end(); }
950 const_iterator end () const { return BasicBlocks.end(); }
952 reverse_iterator rbegin() { return BasicBlocks.rbegin(); }
953 const_reverse_iterator rbegin() const { return BasicBlocks.rbegin(); }
954 reverse_iterator rend () { return BasicBlocks.rend(); }
955 const_reverse_iterator rend () const { return BasicBlocks
[all...]
/llvm-project/llvm/include/llvm/IR/
H A DFunction.h78 BasicBlockListType BasicBlocks; ///< The basic blocks
767 Function::iterator FIt = BasicBlocks.insert(Position, BB);
794 /// Erases a range of BasicBlocks from \p FromIt to (not including) \p ToIt.
813 const BasicBlockListType &getBasicBlockList() const { return BasicBlocks; }
814 BasicBlockListType &getBasicBlockList() { return BasicBlocks; }
817 return &Function::BasicBlocks; in begin()
865 iterator begin() { return BasicBlocks.begin(); } in arg_empty()
866 const_iterator begin() const { return BasicBlocks.begin(); }
867 iterator end () { return BasicBlocks.end(); }
868 const_iterator end () const { return BasicBlocks
[all...]
/llvm-project/bolt/lib/Core/
H A DBinaryFunctionProfile.cpp82 for (BinaryBasicBlock *BB : BasicBlocks) { in postProcessProfile()
87 for (BinaryBasicBlock *BB : BasicBlocks) { in postProcessProfile()
93 Succ != BasicBlocks.front()) in postProcessProfile()
100 for (BinaryBasicBlock *BB : BasicBlocks) { in postProcessProfile()
122 for (BinaryBasicBlock *BB : BasicBlocks) { in postProcessProfile()
152 for (BinaryBasicBlock *BB : BasicBlocks) { in postProcessProfile()
211 for (BinaryBasicBlock *BB : BasicBlocks) { in mergeProfileDataInto()
279 for (BinaryBasicBlock *BB : BasicBlocks) { in inferFallThroughCounts()
349 for (BinaryBasicBlock *BB : BasicBlocks) { in clearProfile()
H A DBinaryFunction.cpp307 for (BinaryBasicBlock *BB : BasicBlocks) { in markUnreachableBlocks()
345 for (BinaryBasicBlock *const BB : BasicBlocks) { in eraseInvalidBBs()
357 for (auto I = BasicBlocks.begin(), E = BasicBlocks.end(); I != E; ++I) { in eraseInvalidBBs()
367 BasicBlocks = std::move(NewBasicBlocks); in eraseInvalidBBs()
369 assert(BasicBlocks.size() == Layout.block_size()); in eraseInvalidBBs()
494 if (BasicBlocks.empty() && !Instructions.empty()) { in print()
1901 if (BasicBlocks.size() == 1) { in postProcessIndirectBranches()
2018 for (BinaryBasicBlock *BB : BasicBlocks) { in buildCFG()
2023 for (BinaryBasicBlock *BB : BasicBlocks) { in buildCFG()
[all...]
/llvm-project/bolt/include/bolt/Core/
H A DBinaryFunction.h436 assert(BB->getIndex() < BasicBlocks.size()); in clearList()
564 // layout (if BasicBlocksLayout stores a different order than BasicBlocks), in operator()
567 BasicBlockListType BasicBlocks; in operator()
710 BasicBlocks.emplace_back(createBasicBlock(Label).release());
711 BinaryBasicBlock *BB = BasicBlocks.back();
713 BB->setIndex(BasicBlocks.size() - 1);
730 for (BinaryBasicBlock *BB : BasicBlocks) in releaseCFG()
759 iterator begin() { return BasicBlocks.begin(); } in front()
760 const_iterator begin() const { return BasicBlocks.begin(); } in back()
761 iterator end () { return BasicBlocks in back()
554 BasicBlockListType BasicBlocks; global() variable
[all...]
/llvm-project/llvm/unittests/Analysis/
H A DDomTreeUpdaterTest.cpp376 std::vector<BasicBlock *> BasicBlocks; in TEST()
377 BasicBlocks.push_back(BB1); in TEST()
378 BasicBlocks.push_back(BB2); in TEST()
379 auto Eraser = [&](BasicBlock *BB) { llvm::erase(BasicBlocks, BB); }; in TEST()
380 ASSERT_EQ(BasicBlocks.size(), static_cast<size_t>(2)); in TEST()
422 ASSERT_EQ(BasicBlocks.size(), static_cast<size_t>(2)); in TEST()
424 ASSERT_EQ(BasicBlocks.size(), static_cast<size_t>(0)); in TEST()
375 std::vector<BasicBlock *> BasicBlocks; TEST() local
/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.h127 std::vector<const BasicBlock *> BasicBlocks; variable
215 return BasicBlocks; in getBasicBlocks()
H A DDXILValueEnumerator.cpp1057 BasicBlocks.push_back(&BB); in incorporateFunction()
1058 ValueMap[&BB] = BasicBlocks.size(); in incorporateFunction()
1115 for (const BasicBlock *BB : BasicBlocks) in purgeFunction()
1120 BasicBlocks.clear(); in purgeFunction()
/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.h126 std::vector<const BasicBlock*> BasicBlocks; variable
215 return BasicBlocks; in getBasicBlocks()
H A DValueEnumerator.cpp1088 BasicBlocks.push_back(&BB); in incorporateFunction()
1089 ValueMap[&BB] = BasicBlocks.size(); in incorporateFunction()
1165 for (const BasicBlock *BB : BasicBlocks) in purgeFunction()
1170 BasicBlocks.clear(); in purgeFunction()
/llvm-project/llvm/lib/CodeGen/
H A DStackColoring.cpp406 DenseMap<const MachineBasicBlock *, int> BasicBlocks;
730 BasicBlocks[MBB] = BasicBlockNumbering.size(); in collectMarkers()
1209 BasicBlocks.clear(); in runOnMachineFunction()
405 DenseMap<const MachineBasicBlock *, int> BasicBlocks; global() member in __anon00fe5d1a0111::StackColoring
H A DMachineFunction.cpp269 for (iterator I = begin(), E = end(); I != E; I = BasicBlocks.erase(I)) in clear()
/llvm-project/llvm/test/Transforms/SCCP/
H A Ddangling-block-address.ll5 ; If BasicBlocks are unreachable, IPSCCP should convert them to unreachable.
/llvm-project/llvm/lib/IR/
H A DFunction.cpp379 for (const BasicBlock &BB : BasicBlocks) in createWithDefaultAttr()
471 BasicBlocks.splice(ToIt, FromF->BasicBlocks, FromBeginIt, FromEndIt); in Function()
476 return BasicBlocks.erase(FromIt, ToIt); in Function()
615 while (!BasicBlocks.empty())
616 BasicBlocks.begin()->eraseFromParent(); in addRetAttr()
/llvm-project/polly/test/CodeGen/
H A Dscev_expansion_in_nonaffine.ll8 ; is expanded independently for both BasicBlocks instead of just once for the
/llvm-project/llvm/lib/Target/ARM/
H A DARMLowOverheadLoops.cpp537 SmallPtrSet<MachineBasicBlock*, 2> BasicBlocks; in INITIALIZE_PASS()
539 BasicBlocks.insert(Dead->getParent()); in INITIALIZE_PASS()
543 for (auto *MBB : BasicBlocks) { in INITIALIZE_PASS()
540 SmallPtrSet<MachineBasicBlock*, 2> BasicBlocks; INITIALIZE_PASS() local
/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp624 const std::vector<const BasicBlockT *> &BasicBlocks, in findUnlikelyJumps()
627 const auto *BB = BasicBlocks[Jump.Source];
628 const auto *Succ = BasicBlocks[Jump.Target]; in computeDominanceAndLoopInfo()
604 findUnlikelyJumps(const std::vector<const BasicBlockT * > & BasicBlocks,BlockEdgeMap & Successors,FlowFunction & Func) findUnlikelyJumps() argument
/llvm-project/llvm/test/Transforms/LoopVectorize/
H A Dpr37248.ll7 ; more than one BasicBlocks in the loop body (emulated masked scatter)
/llvm-project/polly/lib/Analysis/
H A DScopBuilder.cpp145 enum class GranularityChoice { BasicBlocks, ScalarIndependence, Stores }; enumerator
151 cl::values(clEnumValN(GranularityChoice::BasicBlocks, "bb",
2049 case GranularityChoice::BasicBlocks: in buildStmts()
3561 /// from the BasicBlocks instructions resides in) to be same as the "virtual" in buildScop()
/llvm-project/bolt/lib/Profile/
H A DDataReader.cpp478 for (BinaryBasicBlock *BB : BF.BasicBlocks) { in fetchProfileForOtherEntryPoints()
/llvm-project/llvm/include/llvm-c/
H A DCore.h3386 * This operates on a function value. The BasicBlocks parameter is a
3391 void LLVMGetBasicBlocks(LLVMValueRef Fn, LLVMBasicBlockRef *BasicBlocks);
/llvm-project/llvm/docs/
H A DPasses.rst879 * Assumes BasicBlocks are dead unless proven otherwise
H A DProgrammersManual.rst1421 made out of LLVM :ref:`BasicBlocks <BasicBlock>`, CFGs made out of LLVM