| /external/llvm/lib/CodeGen/ |
| D | ShadowStackGC.cpp | 53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anon4f10565f0111::ShadowStackGC
198 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
199 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
209 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
251 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
252 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
315 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots()
327 Roots.push_back(Pair); in CollectRoots()
334 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots()
371 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/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/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()
|
| D | MachineDominators.h | 28 this->Roots.push_back(MBB); in addRoot()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots; member in __anonf434d21e0111::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/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 247 RootsTy Roots; variable
287 Roots.push_back(V); in addRoot()
303 unsigned num_roots() const { return Roots.size(); } in num_roots()
327 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
329 roots_iterator roots_end() { return Roots.end(); } in roots_end()
331 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
333 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
|
| /external/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 4968 std::pair<const SCEV *,const SCEV *> Roots = in HowFarToZero() local
4970 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in HowFarToZero()
4971 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); in HowFarToZero()
5972 std::pair<const SCEV *,const SCEV *> Roots = in getNumIterationsInRange() local
5974 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in getNumIterationsInRange()
5975 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); in getNumIterationsInRange()
|
| /external/webkit/Source/JavaScriptCore/ |
| D | ChangeLog | 5359 are not uniqued. Also, "Roots" is more specific about what's in the set.
|