Home
last modified time | relevance | path

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

123

/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anondcdc57a40111::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.cpp151 static bool InsertRootInitializers(Function &F, AllocaInst **Roots, in InsertRootInitializers() argument
169 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) in InsertRootInitializers()
204 SmallVector<AllocaInst *, 32> Roots; in PerformDefaultLowering() local
234 Roots.push_back( in PerformDefaultLowering()
247 if (Roots.size()) in PerformDefaultLowering()
248 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size()); in PerformDefaultLowering()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DShadowStackGC.cpp53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anonb1b206d10111::ShadowStackGC
210 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
221 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
263 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
264 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
327 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots()
339 Roots.push_back(Pair); in CollectRoots()
346 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots()
383 if (Roots.empty()) in performCustomLowering()
[all …]
DGCStrategy.cpp49 AllocaInst **Roots, unsigned Count);
174 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots, in InsertRootInitializers() argument
191 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) in InsertRootInitializers()
279 SmallVector<AllocaInst*, 32> Roots; in PerformDefaultLowering() local
309 Roots.push_back(cast<AllocaInst>( in PerformDefaultLowering()
322 if (Roots.size()) in PerformDefaultLowering()
323 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size()); in PerformDefaultLowering()
/external/llvm/lib/CodeGen/
DShadowStackGCLowering.cpp45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anond1a93d4c0111::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-7.0/llvm/include/llvm/Support/
DGenericDomTree.h266 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
283 : Roots(std::move(Arg.Roots)),
293 Roots = std::move(RHS.Roots);
310 const SmallVectorImpl<NodeT *> &getRoots() const { return Roots; }
321 if (Roots.size() != Other.Roots.size())
324 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin()))
465 assert(this->Roots.size() == 1 && "Should always have entry node!");
466 return this->Roots[0];
615 if (Roots.empty()) {
618 assert(Roots.size() == 1);
[all …]
DGenericDomTreeConstruction.h55 using RootsT = decltype(DomTreeT::Roots);
376 RootsT Roots; in FindRoots() local
380 Roots.push_back(GetEntryNode(DT)); in FindRoots()
381 return Roots; in FindRoots()
404 Roots.push_back(N); in FindRoots()
454 Roots.push_back(FurthestAway); in FindRoots()
482 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots); in FindRoots()
486 : Roots) dbgs() in FindRoots()
490 return Roots; in FindRoots()
502 RootsT &Roots) { in RemoveRedundantRoots()
[all …]
/external/swiftshader/third_party/llvm-7.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.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()
355 if (Roots.count(I) == 0) { in validateAndTransform()
480 if (Roots.count(I)) in convert()
499 Roots.clear(); in runImpl()
503 findRoots(F, Roots); in runImpl()
505 walkBackwards(Roots); in runImpl()
/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/include/llvm/Analysis/
DDominanceFrontier.h37 std::vector<BasicBlock*> Roots; variable
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; } in getRoots()
165 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
166 return Roots[0]; in getRoot()
172 Roots = DT.getRoots(); in runOnFunction()
173 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!"); in runOnFunction()
174 calculate(DT, DT[Roots[0]]); in runOnFunction()
/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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DGCMetadata.h89 std::vector<GCRoot> Roots; variable
116 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
121 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/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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DDominanceFrontier.h52 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; variable
61 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } in getRoots()
64 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
65 return Roots[0]; in getRoot()
136 this->Roots = {DT.getRoot()}; in analyze()
137 calculate(DT, DT[this->Roots[0]]); in analyze()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DGCMetadata.h92 std::vector<GCRoot> Roots; variable
121 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
144 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
145 roots_iterator roots_end () { return Roots.end(); } in roots_end()
146 size_t roots_size() const { return Roots.size(); } in roots_size()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp66 std::vector<change_ty> Roots; member in __anonb529823c0111::DAGDeltaAlgorithmImpl
199 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
250 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
251 ie = Roots.end(); in DAGDeltaAlgorithmImpl()
253 if (it != Roots.begin()) in DAGDeltaAlgorithmImpl()
312 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp66 std::vector<change_ty> Roots; member in __anon2e55d3e40111::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()
/external/swiftshader/third_party/LLVM/lib/Support/
DDAGDeltaAlgorithm.cpp67 std::vector<change_ty> Roots; member in __anon383d6b900111::DAGDeltaAlgorithmImpl
205 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
255 ie = Roots.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
256 if (it != Roots.begin()) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
310 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()
/external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
DCodeGenRegisters.h481 const CodeGenRegister *Roots[2]; member
491 Roots[0] = Roots[1] = nullptr; in RegUnit()
495 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
496 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
666 RU.Roots[0] = R0;
667 RU.Roots[1] = R1;
/external/llvm/utils/TableGen/
DCodeGenRegisters.h444 const CodeGenRegister *Roots[2]; member
451 Roots[0] = Roots[1] = nullptr; in RegUnit()
455 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
456 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
622 RegUnits.back().Roots[0] = R0;
623 RegUnits.back().Roots[1] = R1;
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Scalar/
DFloat2Int.h33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots; variable
/external/llvm/include/llvm/Transforms/Scalar/
DFloat2Int.h33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots; variable

123