/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | Float2Int.h | 34 SmallPtrSet<Instruction *, 8> &Roots); 39 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots); 46 SmallPtrSet<Instruction *, 8> Roots; member in class:llvm::Float2IntPass
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/XRay/ |
H A D | Profile.h | 90 Roots(std::move(O.Roots)), PathIDMap(std::move(O.PathIDMap)), 96 Roots = std::move(O.Roots); 109 swap(L.Roots, R.Roots); 131 SmallVector<TrieNode *, 4> Roots; member in class:llvm::xray::Profile
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 60 /// Roots - GC roots in the current function. Each is a pair of the 62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in class:__anon1824::ShadowStackGCLowering 109 for (unsigned I = 0; I != Roots.size(); ++I) { 110 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); 120 ConstantInt::get(Int32Ty, Roots.size(), false), 160 for (size_t I = 0; I != Roots.size(); I++) 161 EltTys.push_back(Roots[I].second->getAllocatedType()); 195 // void *Roots[]; // Stack roots (in-place array, so we pretend). 233 assert(Roots.empty() && "Not cleaned up?"); 246 Roots [all...] |
H A D | GCRootLowering.cpp | 144 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) { argument 161 for (AllocaInst *Root : Roots) 194 SmallVector<AllocaInst *, 32> Roots; local 227 Roots.push_back( 234 if (Roots.size()) 235 MadeChange |= InsertRootInitializers(F, Roots);
|
H A D | TargetRegisterInfo.cpp | 135 MCRegUnitRootIterator Roots(Unit, TRI); 136 assert(Roots.isValid() && "Unit has no roots."); 137 OS << TRI->getName(*Roots); 138 for (++Roots; Roots.isValid(); ++Roots) 139 OS << '~' << TRI->getName(*Roots);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 87 std::vector<GCRoot> Roots; member in class:llvm::GCFunctionInfo 114 Roots.push_back(GCRoot(Num, Metadata)); 119 return Roots.erase(position); 139 roots_iterator roots_begin() { return Roots.begin(); } 140 roots_iterator roots_end() { return Roots.end(); } 141 size_t roots_size() const { return Roots.size(); }
|
H A D | MachineDominators.h | 33 this->Roots.push_back(MBB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 51 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominanceFrontierBase 60 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } 63 assert(Roots.size() == 1 && "Should always have entry node!"); 64 return Roots[0]; 135 this->Roots = {DT.getRoot()}; 136 calculate(DT, DT[this->Roots[0]]);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPropagateAttributes.cpp | 74 SmallSet<Function *, 32> Roots; member in class:__anon2463::AMDGPUPropagateAttributes 93 // Propagate attributes from Roots. 171 Roots.insert(&F); 177 Roots.insert(&F); 186 if (Roots.empty()) 188 Module &M = *(*Roots.begin())->getParent(); 191 Roots.insert(NewRoots.begin(), NewRoots.end()); 195 if (F.isDeclaration() || Roots.count(&F) || Roots.count(&F)) 212 if (!Roots [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 352 // ST[y1] +1 +2 <-- Roots 370 SmallInstructionVector Roots; member in struct:__anon2706::LoopReroll::DAGRootSet 407 std::map<int64_t,Instruction*> &Roots); 411 void collectInLoopUserSet(const SmallInstructionVector &Roots, 722 const SmallInstructionVector &Roots, 726 for (Instruction *Root : Roots) 779 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { argument 812 if (Roots.find(V) != Roots.end()) 816 Roots[ 721 collectInLoopUserSet( const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument [all...] |
H A D | Float2Int.cpp | 124 SmallPtrSet<Instruction*,8> &Roots) { 138 Roots.insert(&I); 143 Roots.insert(&I); 187 void Float2IntPass::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) { argument 188 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); 376 if (Roots.count(I) == 0) { 505 if (Roots.count(I)) 524 Roots.clear(); 528 findRoots(F, DT, Roots); 123 findRoots(Function &F, const DominatorTree &DT, SmallPtrSet<Instruction*,8> &Roots) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 240 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominatorTreeBase 257 : Roots(std::move(Arg.Roots)), 267 Roots = std::move(RHS.Roots); 284 const SmallVectorImpl<NodeT *> &getRoots() const { return Roots; } 295 if (Roots.size() != Other.Roots.size()) 298 if (!std::is_permutation(Roots.begin(), Roots [all...] |
H A D | GenericDomTreeConstruction.h | 57 using RootsT = decltype(DomTreeT::Roots); 368 // are always selected as tree roots. Roots with forward successors correspond 385 RootsT Roots; local 389 Roots.push_back(GetEntryNode(DT)); 390 return Roots; 413 Roots.push_back(N); 463 Roots.push_back(FurthestAway); 491 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots); 495 : Roots) dbgs() 499 return Roots; 510 RemoveRedundantRoots(const DomTreeT &DT, BatchUpdatePtr BUI, RootsT &Roots) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 65 std::vector<change_ty> Roots; member in class:__anon2338::DAGDeltaAlgorithmImpl 198 Roots.push_back(*it); 201 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); 248 llvm::errs() << "Roots: ["; 249 for (std::vector<change_ty>::const_iterator it = Roots.begin(), 250 ie = Roots.end(); 252 if (it != Roots.begin()) 311 changeset_ty CurrentSet(Roots.begin(), Roots [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/ |
H A D | xray_function_call_trie.h | 323 RootArray Roots; member in class:__xray::FunctionCallTrie 331 Roots(*A.RootAllocator), member in class:__xray::FunctionCallTrie 342 Roots(std::move(O.Roots)), 349 Roots = std::move(O.Roots); 376 if (Roots.AppendEmplace(NewRoot) == nullptr) { 382 Roots.trim(1); 465 const RootArray &getRoots() const XRAY_NEVER_INSTRUMENT { return Roots; } 505 if (UNLIKELY(O.Roots [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 315 NodeVector Roots; 372 Roots.push_back(V); 382 unsigned num_roots() const { return Roots.size(); } 408 roots_iterator roots_begin() { return Roots.begin(); } 410 roots_iterator roots_end() { return Roots.end(); } 412 const_roots_iterator roots_begin() const { return Roots.begin(); } 414 const_roots_iterator roots_end() const { return Roots.end(); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.h | 485 const CodeGenRegister *Roots[2]; member in struct:llvm::RegUnit 495 Roots[0] = Roots[1] = nullptr; 499 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); 500 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); 672 RU.Roots[0] = R0; 673 RU.Roots[ [all...] |
H A D | GICombinerEmitter.cpp | 147 std::vector<RootInfo> Roots; member in class:__anon2928::CombineRule 203 size_t getNumRoots() const { return Roots.size(); } 209 const_root_iterator roots_begin() const { return Roots.begin(); } 210 const_root_iterator roots_end() const { return Roots.end(); } 212 return llvm::make_range(Roots.begin(), Roots.end()); 230 SmallSet<const GIMatchDagInstr *, 5> Roots; local 235 Roots.insert(I); 247 if (Roots.count((*EI)->getToMI())) 359 // Roots shoul [all...] |
H A D | RegisterInfoEmitter.cpp | 1019 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); local 1020 assert(!Roots.empty() && "All regunits must have a root register."); 1021 assert(Roots.size() <= 2 && "More than two roots not supported yet."); 1022 OS << " { " << getQualifiedName(Roots.front()->TheDef); 1023 for (unsigned r = 1; r != Roots.size(); ++r) 1024 OS << ", " << getQualifiedName(Roots[r]->TheDef);
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-stacks.cpp | 321 DenseMap<uint32_t, RootVector> Roots; 336 Roots[ThreadId].push_back(Node); 341 const auto &RootsByThread = Roots[ThreadId]; 445 bool isEmpty() const { return Roots.empty(); } 480 for (auto iter : Roots) { 491 for (auto iter : Roots) { 506 using RootsType = decltype(Roots.begin())::value_type; 510 make_range(map_iterator(Roots.begin(), MapValueFn), 511 map_iterator(Roots.end(), MapValueFn))) { 523 for (auto MapIter : Roots) { [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 216 Roots.push_back(NewModule.get()); 243 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim), 244 Roots.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonCommonGEP.cpp | 434 NodeVect &Roots) { 440 Roots.push_back(N); 1060 NodeVect Roots; local 1061 invert_find_roots(Nodes, NCM, Roots); 1065 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) 1071 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) 1078 for (NodeVect::iterator I = Roots.begin(), E = Roots 433 invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, NodeVect &Roots) argument 1166 NodeVect Roots; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/ |
H A D | Profile.cpp | 153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); 157 if (RootIt == Roots.end()) { 161 Roots.push_back(Node);
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Serialization/ |
H A D | ModuleManager.h | 60 SmallVector<ModuleFile *, 2> Roots; member in class:clang::serialization::ModuleManager
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 1572 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin, 1581 for (Node *RootN : Roots) { 1707 SmallVector<Node *, 16> Roots; 1709 Roots.push_back(&E.getNode()); 1713 std::reverse(Roots.begin(), Roots.end()); 1716 Roots,
|