Home
last modified time | relevance | path

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

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon13880fec0111::ShadowStackGCLowering
109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
110 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
161 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots()
246 Roots.push_back(Pair); in CollectRoots()
253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots()
297 if (Roots.empty()) in runOnFunction()
[all …]
DGCRootLowering.cpp144 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) { in InsertRootInitializers() argument
161 for (AllocaInst *Root : Roots) in InsertRootInitializers()
194 SmallVector<AllocaInst *, 32> Roots; in DoLowering() local
227 Roots.push_back( in DoLowering()
234 if (Roots.size()) in DoLowering()
235 MadeChange |= InsertRootInitializers(F, Roots); in DoLowering()
DTargetRegisterInfo.cpp135 MCRegUnitRootIterator Roots(Unit, TRI); in printRegUnit() local
136 assert(Roots.isValid() && "Unit has no roots."); in printRegUnit()
137 OS << TRI->getName(*Roots); in printRegUnit()
138 for (++Roots; Roots.isValid(); ++Roots) in printRegUnit()
139 OS << '~' << TRI->getName(*Roots); in printRegUnit()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGenericDomTree.h240 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
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.end(), Other.Roots.begin()))
439 assert(this->Roots.size() == 1 && "Should always have entry node!");
440 return this->Roots[0];
589 if (Roots.empty()) {
592 assert(Roots.size() == 1);
[all …]
DGenericDomTreeConstruction.h57 using RootsT = decltype(DomTreeT::Roots);
385 RootsT Roots; in FindRoots() local
389 Roots.push_back(GetEntryNode(DT)); in FindRoots()
390 return Roots; in FindRoots()
413 Roots.push_back(N); in FindRoots()
463 Roots.push_back(FurthestAway); in FindRoots()
491 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots); in FindRoots()
495 : Roots) dbgs() in FindRoots()
499 return Roots; in FindRoots()
511 RootsT &Roots) { in RemoveRedundantRoots()
[all …]
DVirtualFileSystem.h666 std::vector<std::unique_ptr<Entry>> Roots; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
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
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DLoopRerollPass.cpp370 SmallInstructionVector Roots; member
407 std::map<int64_t,Instruction*> &Roots);
411 void collectInLoopUserSet(const SmallInstructionVector &Roots,
722 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
726 for (Instruction *Root : Roots) in collectInLoopUserSet()
779 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { in collectPossibleRoots() argument
812 if (Roots.find(V) != Roots.end()) in collectPossibleRoots()
816 Roots[V] = cast<Instruction>(I); in collectPossibleRoots()
820 if (Roots.empty() || (Roots.size() == 1 && BaseUsers.empty())) in collectPossibleRoots()
827 if (Roots.find(0) != Roots.end()) { in collectPossibleRoots()
[all …]
DFloat2Int.cpp124 SmallPtrSet<Instruction*,8> &Roots) { in findRoots() argument
138 Roots.insert(&I); in findRoots()
143 Roots.insert(&I); in findRoots()
187 void Float2IntPass::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) { in walkBackwards() argument
188 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards()
376 if (Roots.count(I) == 0) { in validateAndTransform()
505 if (Roots.count(I)) in convert()
524 Roots.clear(); in runImpl()
528 findRoots(F, DT, Roots); in runImpl()
530 walkBackwards(Roots); in runImpl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DAMDGPUPropagateAttributes.cpp74 SmallSet<Function *, 32> Roots; member in __anon7bdec0060111::AMDGPUPropagateAttributes
171 Roots.insert(&F); in process()
177 Roots.insert(&F); in process()
186 if (Roots.empty()) in process()
188 Module &M = *(*Roots.begin())->getParent(); in process()
191 Roots.insert(NewRoots.begin(), NewRoots.end()); in process()
195 if (F.isDeclaration() || Roots.count(&F) || Roots.count(&F)) in process()
212 if (!Roots.count(Caller)) in process()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DGCMetadata.h87 std::vector<GCRoot> Roots; variable
114 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
119 return Roots.erase(position); in removeStackRoot()
139 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
140 roots_iterator roots_end() { return Roots.end(); } in roots_end()
141 size_t roots_size() const { return Roots.size(); } in roots_size()
DMachineDominators.h33 this->Roots.push_back(MBB); in addRoot()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DDominanceFrontier.h51 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; variable
60 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } in getRoots()
63 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
64 return Roots[0]; in getRoot()
135 this->Roots = {DT.getRoot()}; in analyze()
136 calculate(DT, DT[this->Roots[0]]); in analyze()
DLazyCallGraph.h1191 static void buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp65 std::vector<change_ty> Roots; member in __anond57456840111::DAGDeltaAlgorithmImpl
198 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
201 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
249 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
250 ie = Roots.end(); in DAGDeltaAlgorithmImpl()
252 if (it != Roots.begin()) in DAGDeltaAlgorithmImpl()
311 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()
DVirtualFileSystem.cpp1124 for (const auto &Root : Roots) in dump()
1231 for (const auto &Root : FS->Roots) { in lookupOrCreateEntry()
1258 FS->Roots.push_back(std::move(E)); in lookupOrCreateEntry()
1259 ParentEntry = FS->Roots.back().get(); in lookupOrCreateEntry()
1540 auto *Roots = dyn_cast<yaml::SequenceNode>(I.getValue()); in parse() local
1541 if (!Roots) { in parse()
1546 for (auto &I : *Roots) { in parse()
1669 for (const auto &Root : Roots) { in lookupPath()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Scalar/
DFloat2Int.h34 SmallPtrSet<Instruction *, 8> &Roots);
39 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
46 SmallPtrSet<Instruction *, 8> Roots; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp434 NodeVect &Roots) { in invert_find_roots() argument
440 Roots.push_back(N); in invert_find_roots()
1060 NodeVect Roots; in computeNodePlacement() local
1061 invert_find_roots(Nodes, NCM, Roots); in computeNodePlacement()
1065 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) in computeNodePlacement()
1071 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) in computeNodePlacement()
1078 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) in computeNodePlacement()
1166 NodeVect Roots; in materialize() local
1169 invert_find_roots(Nodes, NCM, Roots); in materialize()
1171 while (!Roots.empty()) { in materialize()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/XRay/
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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLazyCallGraph.cpp1572 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin, in buildGenericSCCs() argument
1581 for (Node *RootN : Roots) { in buildGenericSCCs()
1707 SmallVector<Node *, 16> Roots; in buildRefSCCs() local
1709 Roots.push_back(&E.getNode()); in buildRefSCCs()
1713 std::reverse(Roots.begin(), Roots.end()); in buildRefSCCs()
1716 Roots, in buildRefSCCs()
DVectorUtils.cpp377 SmallPtrSet<Value *, 4> Roots; in computeMinimumValueSizes() local
403 Roots.insert(&I); in computeMinimumValueSizes()
500 if (Roots.count(*MI)) in computeMinimumValueSizes()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DSLPVectorizer.cpp581 void buildTree(ArrayRef<Value *> Roots,
588 void buildTree(ArrayRef<Value *> Roots,
1384 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth,
2350 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, in buildTree() argument
2353 buildTree(Roots, ExternallyUsedValues, UserIgnoreLst); in buildTree()
2356 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, in buildTree() argument
2361 if (!allSameType(Roots)) in buildTree()
2363 buildTree_rec(Roots, 0, EdgeInfo()); in buildTree()
5333 SmallVectorImpl<Value *> &Roots) { in collectValuesToDemote() argument
5351 Roots.push_back(I->getOperand(0)); in collectValuesToDemote()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.h153 const DominatorTreeNodeList& Roots() const { return roots_; } in Roots() function
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Ddominator_tree.h153 const DominatorTreeNodeList& Roots() const { return roots_; } in Roots() function
/third_party/spirv-tools/source/opt/
Ddominator_tree.h153 const DominatorTreeNodeList& Roots() const { return roots_; } in Roots() function

12