Searched refs:Roots (Results 1 - 19 of 19) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h37 std::vector<BasicBlock*> Roots; member in class:llvm::DominanceFrontierBase
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
166 assert(Roots.size() == 1 && "Should always have entry node!");
167 return Roots[0];
173 Roots = DT.getRoots();
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
175 calculate(DT, DT[Roots[0]]);
/external/llvm/lib/CodeGen/
H A DShadowStackGC.cpp52 /// Roots - GC roots in the current function. Each is a pair of the
54 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in class:__anon25819::ShadowStackGC
210 for (unsigned I = 0; I != Roots.size(); ++I) {
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
221 ConstantInt::get(Int32Ty, Roots.size(), false),
263 for (size_t I = 0; I != Roots.size(); I++)
264 EltTys.push_back(Roots[I].second->getAllocatedType());
288 // void *Roots[]; // Stack roots (in-place array, so we pretend).
327 assert(Roots.empty() && "Not cleaned up?");
339 Roots
[all...]
H A DTargetRegisterInfo.cpp69 MCRegUnitRootIterator Roots(Unit, TRI);
70 assert(Roots.isValid() && "Unit has no roots.");
71 OS << TRI->getName(*Roots);
72 for (++Roots; Roots.isValid(); ++Roots)
73 OS << '~' << TRI->getName(*Roots);
H A DGCStrategy.cpp14 // Roots are identified in SelectionDAGISel.
49 AllocaInst **Roots, unsigned Count);
172 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots, argument
189 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
278 SmallVector<AllocaInst*, 32> Roots; local
308 Roots.push_back(cast<AllocaInst>(
321 if (Roots.size())
322 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots
[all...]
H A DLiveIntervalAnalysis.cpp246 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
247 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
256 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
257 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
/external/llvm/include/llvm/CodeGen/
H A DGCMetadata.h95 std::vector<GCRoot> Roots; member in class:llvm::GCFunctionInfo
124 Roots.push_back(GCRoot(Num, Metadata));
129 return Roots.erase(position);
152 roots_iterator roots_begin() { return Roots.begin(); }
153 roots_iterator roots_end () { return Roots.end(); }
154 size_t roots_size() const { return Roots.size(); }
H A DMachineDominators.h28 this->Roots.push_back(MBB);
/external/llvm/utils/TableGen/
H A DCodeGenRegisters.h412 const CodeGenRegister *Roots[2]; member in struct:llvm::RegUnit
419 Roots[0] = Roots[1] = nullptr;
423 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
424 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
580 RegUnits.back().Roots[0] = R0;
581 RegUnits.back().Roots[
[all...]
H A DRegisterInfoEmitter.cpp836 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); local
837 assert(!Roots.empty() && "All regunits must have a root register.");
838 assert(Roots.size() <= 2 && "More than two roots not supported yet.");
839 OS << " { " << getQualifiedName(Roots.front()->TheDef);
840 for (unsigned r = 1; r != Roots.size(); ++r)
841 OS << ", " << getQualifiedName(Roots[r]->TheDef);
H A DCodeGenRegisters.cpp1563 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName();
1577 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName();
1624 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName();
1640 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName();
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h260 NodeVector Roots; member in class:clang::ento::ExplodedGraph
306 Roots.push_back(V);
320 unsigned num_roots() const { return Roots.size(); }
344 roots_iterator roots_begin() { return Roots.begin(); }
346 roots_iterator roots_end() { return Roots.end(); }
348 const_roots_iterator roots_begin() const { return Roots.begin(); }
350 const_roots_iterator roots_end() const { return Roots.end(); }
/external/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp69 std::vector<change_ty> Roots; member in class:__anon25907::DAGDeltaAlgorithmImpl
207 Roots.push_back(*it);
210 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
255 llvm::errs() << "Roots: [";
256 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
257 ie = Roots.end(); it != ie; ++it) {
258 if (it != Roots.begin()) llvm::errs() << ", ";
312 changeset_ty CurrentSet(Roots.begin(), Roots
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp320 const SmallInstructionVector &Roots,
333 SmallVector<SmallInstructionVector, 32> &Roots,
510 const SmallInstructionVector &Roots,
514 for (SmallInstructionVector::const_iterator I = Roots.begin(),
515 IE = Roots.end(); I != IE; ++I)
612 SmallVector<SmallInstructionVector, 32> &Roots,
630 Roots[Idx-1].push_back(UI);
638 if (Roots[0].empty())
642 if (Roots[i].size() != Roots[
509 collectInLoopUserSet(Loop *L, const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument
610 collectAllRoots(Loop *L, uint64_t Inc, uint64_t Scale, Instruction *IV, SmallVector<SmallInstructionVector, 32> &Roots, SmallInstructionSet &AllRoots, SmallInstructionVector &LoopIncs) argument
[all...]
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
156 bool MultipleRoots = (DT.Roots.size() > 1);
168 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size());
170 N = DFSPass<GraphT>(DT, DT.Roots[i], N);
246 if (DT.Roots.empty()) return;
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr;
H A DGenericDomTree.h39 std::vector<NodeT*> Roots; member in class:llvm::DominatorBase
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
225 this->Roots.clear();
431 assert(this->Roots.size() == 1 && "Should always have entry node!");
432 return this->Roots[0];
672 this->Roots.push_back(BB);
686 this->Roots.push_back(entry);
/external/eigen/bench/
H A Deig33.cpp48 template<typename Matrix, typename Roots>
49 inline void computeRoots(const Matrix& m, Roots& roots)
/external/clang/lib/Basic/
H A DVirtualFileSystem.cpp478 std::vector<Entry *> Roots; ///< The root(s) of the virtual file system. member in class:__anon17804::VFSFromYAML
501 /// \brief Looks up \p Path in \c Roots.
811 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue()); local
812 if (!Roots) {
817 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end();
820 FS->Roots.push_back(E);
866 VFSFromYAML::~VFSFromYAML() { llvm::DeleteContainerPointers(Roots); }
906 for (std::vector<Entry *>::iterator I = Roots.begin(), E = Roots
[all...]
/external/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp406 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
408 void buildTree(ArrayRef<Value *> Roots,
433 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
592 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, argument
596 if (!getSameType(Roots))
598 buildTree_rec(Roots, 0);
/external/llvm/lib/Analysis/
H A DScalarEvolution.cpp5705 std::pair<const SCEV *,const SCEV *> Roots =
5707 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
5708 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
6844 std::pair<const SCEV *,const SCEV *> Roots =
6846 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
6847 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);

Completed in 1567 milliseconds