| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | ShadowStackGC.cpp | 53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anon3b7d80280111::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 …]
|
| D | GCStrategy.cpp | 49 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/ |
| D | ShadowStackGCLowering.cpp | 45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon7772e8a30111::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 …]
|
| D | GCRootLowering.cpp | 152 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()
|
| D | TargetRegisterInfo.cpp | 82 MCRegUnitRootIterator Roots(Unit, TRI); in PrintRegUnit() local
83 assert(Roots.isValid() && "Unit has no roots."); in PrintRegUnit()
84 OS << TRI->getName(*Roots); in PrintRegUnit()
85 for (++Roots; Roots.isValid(); ++Roots) in PrintRegUnit()
86 OS << '~' << TRI->getName(*Roots); in PrintRegUnit()
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | DominanceFrontier.h | 37 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()
|
| D | DominatorInternals.h | 40 InfoRec &VInfo = DT.Info[DT.Roots[i]]; in DFSPass()
156 bool MultipleRoots = (DT.Roots.size() > 1); in Calculate()
168 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size()); in Calculate()
170 N = DFSPass<GraphT>(DT, DT.Roots[i], N); in Calculate()
246 if (DT.Roots.empty()) return; in Calculate()
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : 0; in Calculate()
|
| D | Dominators.h | 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {} in DominatorBase()
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; } in getRoots()
219 this->Roots.clear(); in reset()
421 assert(this->Roots.size() == 1 && "Should always have entry node!"); in getRoot()
422 return this->Roots[0]; in getRoot()
649 this->Roots.push_back(BB); in addRoot()
661 this->Roots.push_back(&F.front()); in recalculate()
|
| /external/llvm/include/llvm/Analysis/ |
| D | DominanceFrontier.h | 42 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/llvm/include/llvm/CodeGen/ |
| D | GCMetadata.h | 84 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/ |
| D | LoopRerollPass.cpp | 344 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 …]
|
| D | Float2Int.cpp | 120 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/include/llvm/CodeGen/ |
| D | GCMetadata.h | 92 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/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 66 std::vector<change_ty> Roots; member in __anon7ef96bbb0111::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/ |
| D | DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots; member in __anon4343b8670111::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/llvm/include/llvm/Transforms/Scalar/ |
| D | Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots; variable
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.h | 444 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/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 37 std::vector<NodeT *> Roots;
40 : Roots(), IsPostDominators(isPostDom) {} in DominatorBase()
42 : Roots(std::move(Arg.Roots)), in DominatorBase()
44 Arg.Roots.clear(); in DominatorBase()
47 Roots = std::move(RHS.Roots);
49 RHS.Roots.clear();
58 const std::vector<NodeT *> &getRoots() const { return Roots; } in getRoots()
244 this->Roots.clear(); in reset()
477 assert(this->Roots.size() == 1 && "Should always have entry node!"); in getRoot()
478 return this->Roots[0]; in getRoot()
[all …]
|
| D | GenericDomTreeConstruction.h | 39 InfoRec &VInfo = DT.Info[DT.Roots[i]]; in DFSPass()
155 bool MultipleRoots = (DT.Roots.size() > 1); in Calculate()
167 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size()); in Calculate()
169 N = DFSPass<GraphT>(DT, DT.Roots[i], N); in Calculate()
245 if (DT.Roots.empty()) return; in Calculate()
251 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr; in Calculate()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 258 NodeVector Roots; variable
312 Roots.push_back(V); in addRoot()
326 unsigned num_roots() const { return Roots.size(); } in num_roots()
352 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
354 roots_iterator roots_end() { return Roots.end(); } in roots_end()
356 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
358 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 101 Roots.push_back(New); in addModule()
166 if (Roots.back() == ModuleEntry) in addModule()
167 Roots.pop_back(); in addModule()
210 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim), in removeModules()
211 Roots.end()); in removeModules()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 414 NodeVect &Roots) { in invert_find_roots() argument
419 Roots.push_back(N); in invert_find_roots()
1053 NodeVect Roots; in computeNodePlacement() local
1054 invert_find_roots(Nodes, NCM, Roots); in computeNodePlacement()
1058 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I) in computeNodePlacement()
1064 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()
1160 NodeVect Roots; in materialize() local
1163 invert_find_roots(Nodes, NCM, Roots); in materialize()
1165 while (!Roots.empty()) { in materialize()
[all …]
|
| /external/eigen/bench/ |
| D | eig33.cpp | 48 template<typename Matrix, typename Roots>
49 inline void computeRoots(const Matrix& m, Roots& roots) in computeRoots()
|
| /external/llvm/lib/Analysis/ |
| D | VectorUtils.cpp | 318 SmallPtrSet<Value *, 4> Roots; in computeMinimumValueSizes() local
344 Roots.insert(&I); in computeMinimumValueSizes()
441 if (Roots.count(*MI)) in computeMinimumValueSizes()
|
| /external/clang/lib/Basic/ |
| D | VirtualFileSystem.cpp | 840 std::vector<std::unique_ptr<Entry>> Roots; member in __anon393354d90711::RedirectingFileSystem
942 for (const std::unique_ptr<Entry> &Root : Roots) in dump()
1045 for (const std::unique_ptr<Entry> &Root : FS->Roots) { in lookupOrCreateEntry()
1067 FS->Roots.push_back(std::move(E)); in lookupOrCreateEntry()
1068 ParentEntry = FS->Roots.back().get(); in lookupOrCreateEntry()
1322 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue()); in parse() local
1323 if (!Roots) { in parse()
1328 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end(); in parse()
1451 for (const std::unique_ptr<Entry> &Root : Roots) { in lookupPath()
|