Searched refs:Roots (Results 1 - 25 of 32) sorted by relevance

12

/freebsd-current/contrib/llvm-project/llvm/include/llvm/XRay/
H A DProfile.h90 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-current/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h52 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominanceFrontierBase
61 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; }
64 assert(Roots.size() == 1 && "Should always have entry node!");
65 return Roots[0];
136 this->Roots = {DT.getRoot()};
137 calculate(DT, DT[this->Roots[0]]);
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DGCMetadata.h88 std::vector<GCRoot> Roots; member in class:llvm::GCFunctionInfo
119 Roots.push_back(GCRoot(Num, Metadata));
124 return Roots.erase(position);
144 roots_iterator roots_begin() { return Roots.begin(); }
145 roots_iterator roots_end() { return Roots.end(); }
146 size_t roots_size() const { return Roots.size(); }
H A DMachineDominators.h37 this->Roots.push_back(MBB);
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DShadowStackGCLowering.cpp64 /// Roots - GC roots in the current function. Each is a pair of the
66 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in class:__anon1960::ShadowStackGCLoweringImpl
156 for (unsigned I = 0; I != Roots.size(); ++I) {
157 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
167 ConstantInt::get(Int32Ty, Roots.size(), false),
207 for (const std::pair<CallInst *, AllocaInst *> &Root : Roots)
242 // void *Roots[]; // Stack roots (in-place array, so we pretend).
280 assert(Roots.empty() && "Not cleaned up?");
293 Roots.push_back(Pair);
300 Roots
[all...]
H A DGCRootLowering.cpp160 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) { argument
177 for (AllocaInst *Root : Roots)
202 SmallVector<AllocaInst *, 32> Roots; local
235 Roots.push_back(
242 if (Roots.size())
243 MadeChange |= InsertRootInitializers(F, Roots);
H A DTargetRegisterInfo.cpp158 MCRegUnitRootIterator Roots(Unit, TRI);
159 assert(Roots.isValid() && "Unit has no roots.");
160 OS << TRI->getName(*Roots);
161 for (++Roots; Roots.isValid(); ++Roots)
162 OS << '~' << TRI->getName(*Roots);
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp339 // ST[y1] +1 +2 <-- Roots
357 SmallInstructionVector Roots; member in struct:__anon2786::LoopReroll::DAGRootSet
394 std::map<int64_t,Instruction*> &Roots);
398 void collectInLoopUserSet(const SmallInstructionVector &Roots,
692 const SmallInstructionVector &Roots,
696 for (Instruction *Root : Roots)
749 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { argument
782 if (Roots.find(V) != Roots.end())
786 Roots[
691 collectInLoopUserSet( const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument
[all...]
H A DFloat2Int.cpp103 Roots.insert(&I);
108 Roots.insert(&I);
153 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
336 if (!Roots.contains(I)) {
466 if (Roots.count(I))
485 Roots.clear();
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h265 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominatorTreeBase
282 : Roots(std::move(Arg.Roots)),
292 Roots = std::move(RHS.Roots);
313 root_iterator root_begin() { return Roots.begin(); }
314 const_root_iterator root_begin() const { return Roots.begin(); }
315 root_iterator root_end() { return Roots.end(); }
316 const_root_iterator root_end() const { return Roots.end(); }
318 size_t root_size() const { return Roots
[all...]
H A DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
332 // are always selected as tree roots. Roots with forward successors correspond
349 RootsT Roots; local
353 Roots.push_back(GetEntryNode(DT));
354 return Roots;
377 Roots.push_back(N);
456 Roots.push_back(FurthestAway);
484 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots);
488 : Roots) dbgs()
492 return Roots;
503 RemoveRedundantRoots(const DomTreeT &DT, BatchUpdatePtr BUI, RootsT &Roots) argument
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp64 std::vector<change_ty> Roots; member in class:__anon2051::DAGDeltaAlgorithmImpl
194 Roots.push_back(Change);
197 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
243 llvm::errs() << "Roots: [";
244 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
245 ie = Roots.end();
247 if (it != Roots.begin())
303 changeset_ty CurrentSet(Roots.begin(), Roots
[all...]
H A DVirtualFileSystem.cpp1525 R.reserve(Roots.size());
1526 for (const auto &Root : Roots)
1539 for (const auto &Root : Roots)
1697 for (const auto &Root : FS->Roots) {
1722 FS->Roots.push_back(std::move(E));
1723 ParentEntry = FS->Roots.back().get();
2034 auto *Roots = dyn_cast<yaml::SequenceNode>(I.getValue());
2035 if (!Roots) {
2040 for (auto &I : *Roots) {
2269 for (const auto &Root : Roots) {
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h323 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-current/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DFloat2Int.h52 SmallSetVector<Instruction *, 8> Roots; member in class:llvm::Float2IntPass
/freebsd-current/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h314 NodeVector Roots;
371 Roots.push_back(V);
381 unsigned num_roots() const { return Roots.size(); }
403 roots_iterator roots_begin() { return Roots.begin(); }
405 roots_iterator roots_end() { return Roots.end(); }
407 const_roots_iterator roots_begin() const { return Roots.begin(); }
409 const_roots_iterator roots_end() const { return Roots.end(); }
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenRegisters.h526 const CodeGenRegister *Roots[2]; member in struct:llvm::RegUnit
536 Roots[0] = Roots[1] = nullptr;
540 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
541 return ArrayRef(Roots, !!Roots[0] + !!Roots[1]);
725 RU.Roots[0] = R0;
726 RU.Roots[
[all...]
H A DRegisterInfoEmitter.cpp1004 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); local
1005 assert(!Roots.empty() && "All regunits must have a root register.");
1006 assert(Roots.size() <= 2 && "More than two roots not supported yet.");
1009 for (const CodeGenRegister *R : Roots)
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp323 DenseMap<uint32_t, RootVector> Roots;
338 Roots[ThreadId].push_back(Node);
343 const auto &RootsByThread = Roots[ThreadId];
447 bool isEmpty() const { return Roots.empty(); }
481 for (const auto &iter : Roots) {
492 for (const auto &iter : Roots)
503 using RootsType = decltype(Roots.begin())::value_type;
507 make_range(map_iterator(Roots.begin(), MapValueFn),
508 map_iterator(Roots.end(), MapValueFn))) {
520 for (const auto &MapIter : Roots) {
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp432 NodeVect &Roots) {
435 Roots.push_back(N);
1047 NodeVect Roots; local
1048 invert_find_roots(Nodes, NCM, Roots);
1052 for (GepNode *Root : Roots)
1058 for (GepNode *Root : Roots)
1065 for (GepNode *Root : Roots)
1151 NodeVect Roots; local
1154 invert_find_roots(Nodes, NCM, Roots);
1156 while (!Roots
431 invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, NodeVect &Roots) argument
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/XRay/
H A DProfile.cpp153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; });
157 if (RootIt == Roots.end()) {
161 Roots.push_back(Node);
/freebsd-current/contrib/llvm-project/clang/include/clang/Serialization/
H A DModuleManager.h59 SmallVector<ModuleFile *, 2> Roots; member in class:clang::serialization::ModuleManager
/freebsd-current/contrib/llvm-project/clang/lib/Serialization/
H A DModuleManager.cpp235 Roots.push_back(NewModule.get());
262 llvm::erase_if(Roots, IsVictim);
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1796 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,
1805 for (Node *RootN : Roots) {
1929 SmallVector<Node *, 16> Roots;
1931 Roots.push_back(&E.getNode());
1935 Roots,
H A DVectorUtils.cpp552 SmallPtrSet<Value *, 4> Roots; local
578 Roots.insert(&I);
673 if (Roots.count(M))

Completed in 483 milliseconds

12