/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIOptimizeExecMaskingPreRA.cpp | 332 SmallVector<MachineBasicBlock*, 4> Blocks({&MBB}); 334 while (!Blocks.empty()) { 335 auto CurBB = Blocks.pop_back_val(); 376 Blocks.push_back(Pred);
|
H A D | SILowerI1Copies.cpp | 325 ArrayRef<MachineBasicBlock *> Blocks = {}) { 329 for (MachineBasicBlock *MBB : Blocks) 332 if (!inLoopLevel(*Dom, LoopLevel, Blocks)) { 338 if (!inLoopLevel(*Pred, LoopLevel, Blocks)) 346 ArrayRef<MachineBasicBlock *> Blocks) const { 351 if (llvm::find(Blocks, &MBB) != Blocks.end())
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/ |
H A D | Profile.cpp | 29 Blocks.push_back({Block.Thread, {}}); 30 auto &B = Blocks.back(); 127 Blocks.emplace_back(std::move(B));
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/MSF/ |
H A D | MappedBlockStream.h | 75 uint32_t getNumBlocks() const { return StreamLayout.Blocks.size(); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 53 /// Blocks which contain instructions which may have unknown side-effects 99 SetVector<BasicBlock *> Blocks; member in class:llvm::CodeExtractor
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | CodeViewDebug.h | 349 SmallVectorImpl<LexicalBlock *> &Blocks, 369 void emitLexicalBlockList(ArrayRef<LexicalBlock *> Blocks,
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 1647 unsigned topologicalSort(SimpleArray<BasicBlock *> &Blocks, unsigned ID); 1648 unsigned topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, unsigned ID); 1693 : SExpr(COP_SCFG), Arena(A), Blocks(A, Nblocks) { 1704 : SExpr(COP_SCFG), Arena(Cfg.Arena), Blocks(std::move(Ba)) { 1711 bool valid() const { return Entry && Exit && Blocks.size() > 0; } 1718 iterator begin() { return Blocks.begin(); } 1719 iterator end() { return Blocks.end(); } 1724 const_iterator cbegin() const { return Blocks.cbegin(); } 1725 const_iterator cend() const { return Blocks.cend(); } 1734 size_t numBlocks() const { return Blocks 1776 BlockArray Blocks; member in class:clang::threadSafety::SCFG [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RDFGraph.cpp | 347 Blocks.push_back(P); 351 assert((Blocks.size() < ((size_t)1 << (8*sizeof(NodeId)-BitsPerIndex))) && 357 if (Blocks.empty()) 360 char *ActiveBegin = Blocks.back(); 369 uint32_t ActiveB = Blocks.size()-1; 370 uint32_t Index = (ActiveEnd - Blocks[ActiveB])/NodeMemSize; 379 for (unsigned i = 0, n = Blocks.size(); i != n; ++i) { 380 uintptr_t B = reinterpret_cast<uintptr_t>(Blocks[i]); 391 Blocks.clear(); 886 NodeList Blocks local [all...] |
H A D | MachineBlockPlacement.cpp | 223 SmallVector<MachineBasicBlock *, 4> Blocks; member in class:__anon1747::BlockChain 240 : Blocks(1, BB), BlockToChain(BlockToChain) { 250 iterator begin() { return Blocks.begin(); } 251 const_iterator begin() const { return Blocks.begin(); } 254 iterator end() { return Blocks.end(); } 255 const_iterator end() const { return Blocks.end(); } 260 Blocks.erase(i); 275 assert(!Blocks.empty() && "Can't merge into an empty chain."); 281 Blocks.push_back(BB); 292 Blocks [all...] |
H A D | RDFLiveness.cpp | 430 NodeList Blocks = FA.Addr->members(DFG); local 431 for (NodeAddr<BlockNode*> BA : Blocks) { 721 NodeList Blocks = FA.Addr->members(DFG); local 724 for (NodeAddr<BlockNode*> BA : Blocks) { 742 for (NodeAddr<BlockNode*> BA : Blocks) { 793 } // for B : Blocks
|
H A D | RegAllocGreedy.cpp | 1258 /// live-through blocks in Blocks. 1260 ArrayRef<unsigned> Blocks) { 1266 for (unsigned i = 0; i != Blocks.size(); ++i) { 1267 unsigned Number = Blocks[i]; 1327 ArrayRef<unsigned> Blocks = Bundles->getBlocks(Bundle); local 1328 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end(); 1739 ArrayRef<unsigned> Blocks = GlobalCand[UsedCands[c]].ActiveBlocks; local 1740 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) { 1741 unsigned Number = Blocks[ 1259 addThroughConstraints(InterferenceCache::Cursor Intf, ArrayRef<unsigned> Blocks) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/tools/bugpoint/ |
H A D | Miscompilation.cpp | 543 std::vector<BasicBlock *> Blocks; 546 Blocks.push_back(&BB); 549 // obscuring the bug. The Blocks list will end up containing blocks that must 551 unsigned OldSize = Blocks.size(); 559 Blocks.clear(); 563 .reduceList(Blocks); 566 if (Blocks.size() == OldSize) 575 BD.extractMappedBlocksFromModule(Blocks, ToExtract.get());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 653 static void findUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, argument 663 Blocks.push_back(Pred); 677 SmallVector<BasicBlock *, 16> Blocks; local 678 Blocks.push_back(F->getParent()); 681 while (!Blocks.empty()) { 682 BasicBlock *BB = Blocks.pop_back_val(); 721 findUnconditionalPreds(Blocks, BB, DT);
|
H A D | SimpleLoopUnswitch.cpp | 1739 auto &Blocks = L.getBlocksVector(); local 1742 ? Blocks.begin() 1744 Blocks.begin(), Blocks.end(), 1748 SmallPtrSet<BasicBlock *, 16> UnloopedBlocks(BlocksSplitI, Blocks.end()); 1753 for (auto *BB : make_range(BlocksSplitI, Blocks.end())) 1755 Blocks.erase(BlocksSplitI, Blocks.end()); 1877 if (Blocks.empty()) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 357 Blocks.insert(std::make_pair(&BB, GCOVBlock(i++, os))); 370 return Blocks.find(BB)->second; 380 Function *F = Blocks.begin()->first->getParent(); 415 write(Blocks.size() + 1); 416 for (int i = 0, e = Blocks.size() + 1; i != e; ++i) { 419 LLVM_DEBUG(dbgs() << Blocks.size() << " blocks.\n"); 422 if (Blocks.empty()) return; 423 Function *F = Blocks.begin()->first->getParent(); 450 DenseMap<BasicBlock *, GCOVBlock> Blocks;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CloneFunction.cpp | 737 /// Remaps instructions in \p Blocks using the mapping in \p VMap. 739 const SmallVectorImpl<BasicBlock *> &Blocks, ValueToValueMapTy &VMap) { 741 for (auto *BB : Blocks) 748 /// Blocks. 756 SmallVectorImpl<BasicBlock *> &Blocks) { 773 Blocks.push_back(NewPH); 814 Blocks.push_back(NewBB); 738 remapInstructionsInBlocks( const SmallVectorImpl<BasicBlock *> &Blocks, ValueToValueMapTy &VMap) argument 752 cloneLoopWithPreheader(BasicBlock *Before, BasicBlock *LoopDomBB, Loop *OrigLoop, ValueToValueMapTy &VMap, const Twine &NameSuffix, LoopInfo *LI, DominatorTree *DT, SmallVectorImpl<BasicBlock *> &Blocks) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86FlagsCopyLowering.cpp | 542 SmallVector<MachineBasicBlock *, 2> Blocks; local 544 Blocks.push_back(&MBB); 547 MachineBasicBlock &UseMBB = *Blocks.pop_back_val(); 704 Blocks.push_back(SuccMBB); 709 } while (!Blocks.empty());
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 120 DenseMap<BasicBlock*, BasicBlock*> Blocks; member in class:__anon2844::FunctionDifferenceEngine 127 if (!Blocks.count(*I)) Count++; 155 BasicBlock *&Ref = Blocks[L]; 407 return Blocks[cast<BlockAddress>(L)->getBasicBlock()] 476 return Blocks[cast<BasicBlock>(L)] != R;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonCommonGEP.cpp | 670 static BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) { argument 673 for (typename T::iterator I = Blocks.begin(), E = Blocks.end(); I != E; 683 // Allow null basic blocks in Blocks. In such cases, return nullptr. 684 typename T::iterator I = Blocks.begin(), E = Blocks.end(); 699 static BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) { argument 702 typename T::iterator I = Blocks.begin(), E = Blocks.end();
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | ScopeInfo.cpp | 56 Blocks.clear();
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | CommentSema.h | 182 FullComment *actOnFullComment(ArrayRef<BlockContentComment *> Blocks);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MIRYamlMapping.h | 436 std::vector<FlowStringValue> Blocks; member in struct:llvm::yaml::MachineJumpTable::Entry 439 return ID == Other.ID && Blocks == Other.Blocks; 454 YamlIO.mapOptional("blocks", Entry.Blocks, std::vector<FlowStringValue>());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/MIRParser/ |
H A D | MIRParser.cpp | 851 std::vector<MachineBasicBlock *> Blocks; local 852 for (const auto &MBBSource : Entry.Blocks) { 856 Blocks.push_back(MBB); 858 unsigned Index = JTI->createJumpTableIndex(Blocks);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | JITLink.cpp | 148 for (auto *B : Blocks)
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/ |
H A D | SymbolFile.h | 56 Blocks = (1u << 3), enumerator in enum:lldb_private::SymbolFile::Abilities
|