Home
last modified time | relevance | path

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

1234

/external/llvm-project/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anonbb95b8580111::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 …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon047a504c0111::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 …]
/external/llvm-project/llvm/include/llvm/Support/
DGenericDomTree.h249 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
266 : Roots(std::move(Arg.Roots)),
276 Roots = std::move(RHS.Roots);
297 root_iterator root_begin() { return Roots.begin(); }
298 const_root_iterator root_begin() const { return Roots.begin(); }
299 root_iterator root_end() { return Roots.end(); }
300 const_root_iterator root_end() const { return Roots.end(); }
302 size_t root_size() const { return Roots.size(); }
320 if (Roots.size() != Other.Roots.size())
323 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin()))
[all …]
DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
352 RootsT Roots; in FindRoots() local
356 Roots.push_back(GetEntryNode(DT)); in FindRoots()
357 return Roots; in FindRoots()
380 Roots.push_back(N); in FindRoots()
461 Roots.push_back(FurthestAway); in FindRoots()
489 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots); in FindRoots()
493 : Roots) dbgs() in FindRoots()
497 return Roots; in FindRoots()
509 RootsT &Roots) { in RemoveRedundantRoots()
[all …]
/external/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
/external/llvm-project/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
/external/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon91d9d22a0111::ShadowStackGCLowering
206 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
207 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
217 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
257 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
258 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
330 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots()
343 Roots.push_back(Pair); in CollectRoots()
350 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots()
394 if (Roots.empty()) in runOnFunction()
[all …]
DGCRootLowering.cpp152 static bool InsertRootInitializers(Function &F, AllocaInst **Roots, in InsertRootInitializers() argument
170 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) in InsertRootInitializers()
205 SmallVector<AllocaInst *, 32> Roots; in PerformDefaultLowering() local
235 Roots.push_back( in PerformDefaultLowering()
248 if (Roots.size()) in PerformDefaultLowering()
249 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size()); in PerformDefaultLowering()
/external/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 …]
/external/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()
/external/llvm-project/llvm/lib/Transforms/Scalar/
DLoopRerollPass.cpp380 SmallInstructionVector Roots; member
417 std::map<int64_t,Instruction*> &Roots);
421 void collectInLoopUserSet(const SmallInstructionVector &Roots,
732 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
736 for (Instruction *Root : Roots) in collectInLoopUserSet()
789 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { in collectPossibleRoots() argument
822 if (Roots.find(V) != Roots.end()) in collectPossibleRoots()
826 Roots[V] = cast<Instruction>(I); in collectPossibleRoots()
830 if (Roots.empty() || (Roots.size() == 1 && BaseUsers.empty())) in collectPossibleRoots()
837 if (Roots.find(0) != Roots.end()) { in collectPossibleRoots()
[all …]
/external/llvm/include/llvm/Analysis/
DDominanceFrontier.h42 std::vector<BlockT *> Roots; variable
53 return Roots; in getRoots()
57 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
58 return Roots[0]; in getRoot()
128 this->Roots = DT.getRoots(); in analyze()
129 assert(this->Roots.size() == 1 && in analyze()
131 calculate(DT, DT[this->Roots[0]]); in analyze()
/external/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()
/external/llvm-project/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()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DAMDGPUPropagateAttributes.cpp74 SmallSet<Function *, 32> Roots; member in __anonf364f8660111::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()
/external/llvm/include/llvm/CodeGen/
DGCMetadata.h84 std::vector<GCRoot> Roots; variable
113 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
118 return Roots.erase(position); in removeStackRoot()
141 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
142 roots_iterator roots_end() { return Roots.end(); } in roots_end()
143 size_t roots_size() const { return Roots.size(); } in roots_size()
/external/llvm/lib/Transforms/Scalar/
DLoopRerollPass.cpp344 SmallInstructionVector Roots; member
378 std::map<int64_t,Instruction*> &Roots);
381 void collectInLoopUserSet(const SmallInstructionVector &Roots,
734 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
738 for (Instruction *Root : Roots) in collectInLoopUserSet()
791 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { in collectPossibleRoots() argument
823 if (Roots.find(V) != Roots.end()) in collectPossibleRoots()
827 Roots[V] = cast<Instruction>(I); in collectPossibleRoots()
830 if (Roots.empty()) in collectPossibleRoots()
837 if (Roots.find(0) != Roots.end()) { in collectPossibleRoots()
[all …]
DFloat2Int.cpp120 void Float2IntPass::findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots) { in findRoots() argument
128 Roots.insert(&I); in findRoots()
133 Roots.insert(&I); in findRoots()
176 void Float2IntPass::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) { in walkBackwards() argument
177 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards()
370 if (Roots.count(I) == 0) { in validateAndTransform()
494 if (Roots.count(I)) in convert()
513 Roots.clear(); in runImpl()
517 findRoots(F, Roots); in runImpl()
519 walkBackwards(Roots); in runImpl()
/external/llvm-project/llvm/include/llvm/Analysis/
DDominanceFrontier.h50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; variable
59 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } in getRoots()
62 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
63 return Roots[0]; in getRoot()
134 this->Roots = {DT.getRoot()}; in analyze()
135 calculate(DT, DT[this->Roots[0]]); in analyze()
/external/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()
/external/llvm-project/llvm/lib/Target/AMDGPU/
DAMDGPUPropagateAttributes.cpp120 SmallSet<Function *, 32> Roots; member in __anon723adf720111::AMDGPUPropagateAttributes
219 Roots.insert(&F); in process()
225 Roots.insert(&F); in process()
234 if (Roots.empty()) in process()
236 Module &M = *(*Roots.begin())->getParent(); in process()
239 Roots.insert(NewRoots.begin(), NewRoots.end()); in process()
260 if (!Roots.count(Caller) && !NewRoots.count(Caller)) in process()
266 if (!Roots.count(&F)) in process()
309 Roots.clear(); in process()
/external/llvm-project/compiler-rt/lib/xray/
Dxray_function_call_trie.h323 RootArray Roots; variable
331 Roots(*A.RootAllocator), in FunctionCallTrie()
342 Roots(std::move(O.Roots)), in FunctionCallTrie()
349 Roots = std::move(O.Roots);
376 if (Roots.AppendEmplace(NewRoot) == nullptr) { in enterFunction()
382 Roots.trim(1); in enterFunction()
465 const RootArray &getRoots() const XRAY_NEVER_INSTRUMENT { return Roots; } in getRoots()
505 if (UNLIKELY(O.Roots.Append(NewRoot) == nullptr)) in deepCopyInto()
555 auto R = O.Roots.find_element( in mergeInto()
564 O.Roots.Append(TargetRoot); in mergeInto()
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp66 std::vector<change_ty> Roots; member in __anon2272a9c20111::DAGDeltaAlgorithmImpl
199 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
248 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
249 ie = Roots.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
250 if (it != Roots.begin()) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
304 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()

1234