Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h263 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
280 : Roots(std::move(Arg.Roots)),
290 Roots = std::move(RHS.Roots);
311 root_iterator root_begin() { return Roots.begin(); }
312 const_root_iterator root_begin() const { return Roots.begin(); }
313 root_iterator root_end() { return Roots.end(); }
314 const_root_iterator root_end() const { return Roots.end(); }
316 size_t root_size() const { return Roots.size(); }
334 if (Roots.size() != Other.Roots.size())
337 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin()))
[all …]
H A DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
338 RootsT Roots; in FindRoots() local
342 Roots.push_back(GetEntryNode(DT)); in FindRoots()
343 return Roots; in FindRoots()
366 Roots.push_back(N); in FindRoots()
445 Roots.push_back(FurthestAway); in FindRoots()
473 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots); in FindRoots()
477 : Roots) dbgs() in FindRoots()
481 return Roots; in FindRoots()
493 RootsT &Roots) { in RemoveRedundantRoots()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DShadowStackGCLowering.cpp64 /// Roots - GC roots in the current function. Each is a pair of the member in __anonc14dba810111::ShadowStackGCLowering
66 std::vector<std::pair<CallInst *, AllocaInst *>> Roots;
156 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
157 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
167 ConstantInt::get(Int32Ty, Roots.size(), false), in GetConcreteStackEntryType()
207 for (const std::pair<CallInst *, AllocaInst *> &Root : Roots) in doInitialization()
242 // void *Roots[]; // Stack roots (in-place array, so we pretend). in CollectRoots()
280 assert(Roots.empty() && "Not cleaned up?"); in CreateGEP()
293 Roots.push_back(Pair); in runOnFunction()
300 Roots in runOnFunction()
[all...]
H A DGCRootLowering.cpp163 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) { in InsertRootInitializers() argument
180 for (AllocaInst *Root : Roots) in InsertRootInitializers()
205 SmallVector<AllocaInst *, 32> Roots; in DoLowering() local
239 Roots.push_back( in DoLowering()
246 if (Roots.size()) in DoLowering()
247 MadeChange |= InsertRootInitializers(F, Roots); in DoLowering()
H A DTargetRegisterInfo.cpp154 MCRegUnitRootIterator Roots(Unit, TRI); in printRegUnit() local
155 assert(Roots.isValid() && "Unit has no roots."); in printRegUnit()
156 OS << TRI->getName(*Roots); in printRegUnit()
157 for (++Roots; Roots.isValid(); ++Roots) in printRegUnit()
158 OS << '~' << TRI->getName(*Roots); in printRegUnit()
/freebsd/contrib/llvm-project/llvm/include/llvm/XRay/
H A DProfile.h90 Roots(std::move(O.Roots)), PathIDMap(std::move(O.PathIDMap)), in Profile()
96 Roots = std::move(O.Roots);
109 swap(L.Roots, R.Roots); in swap()
131 SmallVector<TrieNode *, 4> Roots; variable
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DGCMetadata.h88 std::vector<GCRoot> Roots;
119 Roots.push_back(GCRoot(Num, Metadata)); in removeStackRoot()
124 return Roots.erase(position);
144 roots_iterator roots_begin() { return Roots.begin(); } in live_begin()
145 roots_iterator roots_end() { return Roots.end(); } in live_end()
146 size_t roots_size() const { return Roots.size(); } in live_size()
87 std::vector<GCRoot> Roots; global() variable
H A DMachineDominators.h38 this->Roots.push_back(MBB); in addRoot()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h53 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; variable
62 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } in getRoots()
65 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
66 return Roots[0]; in getRoot()
137 this->Roots = {DT.getRoot()}; in analyze()
138 calculate(DT, DT[this->Roots[0]]); in analyze()
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h319 RootArray Roots; variable
327 Roots(*A.RootAllocator), in FunctionCallTrie()
338 Roots(std::move(O.Roots)), in FunctionCallTrie()
345 Roots = std::move(O.Roots);
372 if (Roots.AppendEmplace(NewRoot) == nullptr) { in enterFunction()
378 Roots.trim(1); in enterFunction()
461 const RootArray &getRoots() const XRAY_NEVER_INSTRUMENT { return Roots; } in getRoots()
501 if (UNLIKELY(O.Roots.Append(NewRoot) == nullptr)) in deepCopyInto()
551 auto R = O.Roots.find_element( in mergeInto()
560 O.Roots.Append(TargetRoot); in mergeInto()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp64 std::vector<change_ty> Roots; member in __anoncf29fe990111::DAGDeltaAlgorithmImpl
194 Roots.push_back(Change); in DAGDeltaAlgorithmImpl()
197 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
244 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
245 ie = Roots.end(); in DAGDeltaAlgorithmImpl()
247 if (it != Roots.begin()) in DAGDeltaAlgorithmImpl()
303 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()
H A DVirtualFileSystem.cpp1549 R.reserve(Roots.size()); in getRoots()
1550 for (const auto &Root : Roots) in getRoots()
1563 for (const auto &Root : Roots) in printImpl()
1728 for (const auto &Root : FS->Roots) { in lookupOrCreateEntry()
1753 FS->Roots.push_back(std::move(E)); in lookupOrCreateEntry()
1754 ParentEntry = FS->Roots.back().get(); in lookupOrCreateEntry()
2065 auto *Roots = dyn_cast<yaml::SequenceNode>(I.getValue()); in parse() local
2066 if (!Roots) { in parse()
2071 for (auto &I : *Roots) { in parse()
2308 for (const auto &Root : Roots) { in lookupPath()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp
H A DGlobalISelCombinerMatchTableEmitter.cpp
H A DRegisterInfoEmitter.cpp989 ArrayRef<const CodeGenRegister *> Roots = RegBank.getRegUnit(i).getRoots(); in runMCDesc() local
990 assert(!Roots.empty() && "All regunits must have a root register."); in runMCDesc()
991 assert(Roots.size() <= 2 && "More than two roots not supported yet."); in runMCDesc()
994 for (const CodeGenRegister *R : Roots) in runMCDesc()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.h543 const CodeGenRegister *Roots[2]; member
553 Roots[0] = Roots[1] = nullptr; in RegUnit()
557 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
558 return ArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
738 RU.Roots[0] = R0;
739 RU.Roots[1] = R1;
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h314 NodeVector Roots; variable
371 Roots.push_back(V); in addRoot()
381 unsigned num_roots() const { return Roots.size(); } in num_roots()
403 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
405 roots_iterator roots_end() { return Roots.end(); } in roots_end()
407 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
409 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp323 DenseMap<uint32_t, RootVector> Roots; member in StackTrie
338 Roots[ThreadId].push_back(Node); in createTrieNode()
343 const auto &RootsByThread = Roots[ThreadId]; in findRootNode()
447 bool isEmpty() const { return Roots.empty(); } in isEmpty()
481 for (const auto &iter : Roots) { in printPerThread()
492 for (const auto &iter : Roots) in printAllPerThread()
503 using RootsType = decltype(Roots.begin())::value_type; in printIgnoringThreads()
507 make_range(map_iterator(Roots.begin(), MapValueFn), in printIgnoringThreads()
508 map_iterator(Roots.end(), MapValueFn))) { in printIgnoringThreads()
520 for (const auto &MapIter : Roots) {
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DFloat2Int.cpp103 Roots.insert(&I); in findRoots()
108 Roots.insert(&I); in findRoots()
153 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards()
336 if (!Roots.contains(I)) { in validateAndTransform()
472 if (Roots.count(I)) in convert()
491 Roots.clear(); in runImpl()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp432 NodeVect &Roots) { in invert_find_roots() argument
435 Roots.push_back(N); in invert_find_roots()
1047 NodeVect Roots; in computeNodePlacement() local
1048 invert_find_roots(Nodes, NCM, Roots); in computeNodePlacement()
1052 for (GepNode *Root : Roots) in computeNodePlacement()
1058 for (GepNode *Root : Roots) in computeNodePlacement()
1065 for (GepNode *Root : Roots) in computeNodePlacement()
1151 NodeVect Roots; in materialize() local
1154 invert_find_roots(Nodes, NCM, Roots); in materialize()
1156 while (!Roots.empty()) { in materialize()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULowerBufferFatPointers.cpp721 void getPossibleRsrcRoots(Instruction *I, SmallPtrSetImpl<Value *> &Roots,
830 SmallPtrSetImpl<Value *> &Roots, in getPossibleRsrcRoots() argument
837 Roots.insert(In); in getPossibleRsrcRoots()
839 getPossibleRsrcRoots(cast<Instruction>(In), Roots, Seen); in getPossibleRsrcRoots()
846 Roots.insert(TrueVal); in getPossibleRsrcRoots()
847 Roots.insert(FalseVal); in getPossibleRsrcRoots()
849 getPossibleRsrcRoots(cast<Instruction>(TrueVal), Roots, Seen); in getPossibleRsrcRoots()
851 getPossibleRsrcRoots(cast<Instruction>(FalseVal), Roots, Seen); in getPossibleRsrcRoots()
859 SmallPtrSet<Value *, 4> Roots; in processConditionals() local
873 Roots.clear(); in processConditionals()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DFloat2Int.h52 SmallSetVector<Instruction *, 8> Roots; variable
/freebsd/contrib/llvm-project/llvm/lib/XRay/
H A DProfile.cpp153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); in internPath()
157 if (RootIt == Roots.end()) { in internPath()
161 Roots.push_back(Node); in internPath()
/freebsd/contrib/llvm-project/clang/include/clang/Serialization/
H A DModuleManager.h58 SmallVector<ModuleFile *, 2> Roots; variable
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1807 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin, in buildGenericSCCs() argument
1816 for (Node *RootN : Roots) { in buildGenericSCCs()
1940 SmallVector<Node *, 16> Roots; in buildRefSCCs() local
1942 Roots.push_back(&E.getNode()); in buildRefSCCs()
1946 Roots, in buildRefSCCs()

12