| /external/llvm/lib/CodeGen/ |
| D | ShadowStackGC.cpp | 53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anonb574e1a20111::ShadowStackGC
209 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
210 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
220 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
262 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
263 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
326 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots()
338 Roots.push_back(Pair); in CollectRoots()
345 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots()
382 if (Roots.empty()) in performCustomLowering()
[all …]
|
| D | TargetRegisterInfo.cpp | 67 MCRegUnitRootIterator Roots(Unit, TRI); in print() local
68 assert(Roots.isValid() && "Unit has no roots."); in print()
69 OS << TRI->getName(*Roots); in print()
70 for (++Roots; Roots.isValid(); ++Roots) in print()
71 OS << '~' << TRI->getName(*Roots); in print()
|
| D | GCStrategy.cpp | 50 AllocaInst **Roots, unsigned Count);
181 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots, in InsertRootInitializers() argument
198 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) in InsertRootInitializers()
286 SmallVector<AllocaInst*, 32> Roots; in PerformDefaultLowering() local
316 Roots.push_back(cast<AllocaInst>( in PerformDefaultLowering()
329 if (Roots.size()) in PerformDefaultLowering()
330 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size()); in PerformDefaultLowering()
|
| D | LiveIntervalAnalysis.cpp | 231 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { in computeRegUnitInterval() local
232 unsigned Root = *Roots; in computeRegUnitInterval()
243 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { in computeRegUnitInterval() local
244 unsigned Root = *Roots; in computeRegUnitInterval()
|
| /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()
166 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
167 return Roots[0]; in getRoot()
173 Roots = DT.getRoots(); in runOnFunction()
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!"); in runOnFunction()
175 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()
231 this->Roots.clear(); in reset()
417 assert(this->Roots.size() == 1 && "Should always have entry node!"); in getRoot()
418 return this->Roots[0]; in getRoot()
643 this->Roots.push_back(BB); in addRoot()
657 this->Roots.push_back(entry); in recalculate()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | GCMetadata.h | 93 std::vector<GCRoot> Roots; variable
122 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
127 return Roots.erase(position); in removeStackRoot()
150 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
151 roots_iterator roots_end () { return Roots.end(); } in roots_end()
152 size_t roots_size() const { return Roots.size(); } in roots_size()
|
| D | MachineDominators.h | 28 this->Roots.push_back(MBB); in addRoot()
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.h | 404 const CodeGenRegister *Roots[2]; member
410 RegUnit() : Weight(0), RegClassUnitSetsIdx(0) { Roots[0] = Roots[1] = 0; } in RegUnit()
413 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
414 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
563 RegUnits.back().Roots[0] = R0;
564 RegUnits.back().Roots[1] = R1;
|
| D | RegisterInfoEmitter.cpp | 829 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); in runMCDesc() local
830 assert(!Roots.empty() && "All regunits must have a root register."); in runMCDesc()
831 assert(Roots.size() <= 2 && "More than two roots not supported yet."); in runMCDesc()
832 OS << " { " << getQualifiedName(Roots.front()->TheDef); in runMCDesc()
833 for (unsigned r = 1; r != Roots.size(); ++r) in runMCDesc()
834 OS << ", " << getQualifiedName(Roots[r]->TheDef); in runMCDesc()
|
| D | CodeGenRegisters.cpp | 562 ArrayRef<const CodeGenRegister*> Roots = RU.getRoots(); in computeOverlaps() local
563 for (unsigned ri = 0, re = Roots.size(); ri != re; ++ri) { in computeOverlaps()
564 const CodeGenRegister *Root = Roots[ri]; in computeOverlaps()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots; member in __anonc4a346e10111::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 | 256 NodeVector Roots; variable
302 Roots.push_back(V); in addRoot()
316 unsigned num_roots() const { return Roots.size(); } in num_roots()
340 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
342 roots_iterator roots_end() { return Roots.end(); } in roots_end()
344 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
346 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
|
| /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/docs/ |
| D | GarbageCollection.rst | 224 void *Roots[0]; //< Stack roots (in-place array).
247 Visitor(&R->Roots[i], R->Map->Meta[i]);
251 Visitor(&R->Roots[i], NULL);
|
| /external/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 5438 std::pair<const SCEV *,const SCEV *> Roots = in HowFarToZero() local
5440 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in HowFarToZero()
5441 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); in HowFarToZero()
6495 std::pair<const SCEV *,const SCEV *> Roots = in getNumIterationsInRange() local
6497 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in getNumIterationsInRange()
6498 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.
|