/external/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 39 /// Roots - GC roots in the current function. Each is a pair of the 41 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in class:__anon10495::ShadowStackGCLowering 198 for (unsigned I = 0; I != Roots.size(); ++I) { 199 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); 209 ConstantInt::get(Int32Ty, Roots.size(), false), 249 for (size_t I = 0; I != Roots.size(); I++) 250 EltTys.push_back(Roots[I].second->getAllocatedType()); 284 // void *Roots[]; // Stack roots (in-place array, so we pretend). 322 assert(Roots.empty() && "Not cleaned up?"); 335 Roots [all...] |
H A D | TargetRegisterInfo.cpp | 70 MCRegUnitRootIterator Roots(Unit, TRI); 71 assert(Roots.isValid() && "Unit has no roots."); 72 OS << TRI->getName(*Roots); 73 for (++Roots; Roots.isValid(); ++Roots) 74 OS << '~' << TRI->getName(*Roots);
|
H A D | GCRootLowering.cpp | 152 static bool InsertRootInitializers(Function &F, AllocaInst **Roots, argument 170 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) 206 SmallVector<AllocaInst *, 32> Roots; local 236 Roots.push_back( 249 if (Roots.size()) 250 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size());
|
H A D | LiveIntervalAnalysis.cpp | 260 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { 261 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true); 270 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { 271 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 83 std::vector<GCRoot> Roots; member in class:llvm::GCFunctionInfo 112 Roots.push_back(GCRoot(Num, Metadata)); 117 return Roots.erase(position); 140 roots_iterator roots_begin() { return Roots.begin(); } 141 roots_iterator roots_end() { return Roots.end(); } 142 size_t roots_size() const { return Roots.size(); }
|
H A D | MachineDominators.h | 29 this->Roots.push_back(MBB);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 65 void findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots); 70 void walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots); 77 SmallPtrSet<Instruction*,8> Roots; member in struct:__anon11014::Float2Int 127 void Float2Int::findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots) { argument 133 Roots.insert(&I); 138 Roots.insert(&I); 181 void Float2Int::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) { argument 182 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); 375 if (Roots [all...] |
H A D | LoopRerollPass.cpp | 341 // ST[y1] +1 +2 <-- Roots 359 SmallInstructionVector Roots; member in struct:__anon11032::LoopReroll::DAGRootSet 388 std::map<int64_t,Instruction*> &Roots); 391 void collectInLoopUserSet(const SmallInstructionVector &Roots, 615 const SmallInstructionVector &Roots, 619 for (SmallInstructionVector::const_iterator I = Roots.begin(), 620 IE = Roots.end(); I != IE; ++I) 671 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { argument 703 if (Roots.find(V) != Roots 614 collectInLoopUserSet( const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 41 std::vector<BlockT *> Roots; member in class:llvm::DominanceFrontierBase 52 return Roots; 56 assert(Roots.size() == 1 && "Should always have entry node!"); 57 return Roots[0]; 127 this->Roots = DT.getRoots(); 128 assert(this->Roots.size() == 1 && 130 calculate(DT, DT[this->Roots[0]]);
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.h | 444 const CodeGenRegister *Roots[2]; member in struct:llvm::RegUnit 451 Roots[0] = Roots[1] = nullptr; 455 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); 456 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); 622 RegUnits.back().Roots[0] = R0; 623 RegUnits.back().Roots[ [all...] |
H A D | RegisterInfoEmitter.cpp | 939 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); local 940 assert(!Roots.empty() && "All regunits must have a root register."); 941 assert(Roots.size() <= 2 && "More than two roots not supported yet."); 942 OS << " { " << getQualifiedName(Roots.front()->TheDef); 943 for (unsigned r = 1; r != Roots.size(); ++r) 944 OS << ", " << getQualifiedName(Roots[r]->TheDef);
|
H A D | CodeGenRegisters.cpp | 1623 dbgs() << " " << RegUnits[U].Roots[0]->getName(); 1636 dbgs() << " " << RegUnits[U].Roots[0]->getName(); 1682 dbgs() << " " << RegUnits[U].Roots[0]->getName(); 1697 dbgs() << " " << RegUnits[U].Roots[0]->getName();
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 258 NodeVector Roots; member in class:clang::ento::ExplodedGraph 304 Roots.push_back(V); 318 unsigned num_roots() const { return Roots.size(); } 342 roots_iterator roots_begin() { return Roots.begin(); } 344 roots_iterator roots_end() { return Roots.end(); } 346 const_roots_iterator roots_begin() const { return Roots.begin(); } 348 const_roots_iterator roots_end() const { return Roots.end(); }
|
/external/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 66 std::vector<change_ty> Roots; member in class:__anon10593::DAGDeltaAlgorithmImpl 199 Roots.push_back(*it); 202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); 247 llvm::errs() << "Roots: ["; 248 for (std::vector<change_ty>::const_iterator it = Roots.begin(), 249 ie = Roots.end(); it != ie; ++it) { 250 if (it != Roots.begin()) llvm::errs() << ", "; 304 changeset_ty CurrentSet(Roots.begin(), Roots [all...] |
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 40 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 D | GenericDomTree.h | 37 std::vector<NodeT *> Roots; member in class:llvm::DominatorBase 40 : Roots(), IsPostDominators(isPostDom) {} 42 : Roots(std::move(Arg.Roots)), 44 Arg.Roots.clear(); 47 Roots = std::move(RHS.Roots); 49 RHS.Roots.clear(); 58 const std::vector<NodeT *> &getRoots() const { return Roots; } 243 this->Roots [all...] |
/external/eigen/bench/ |
H A D | eig33.cpp | 48 template<typename Matrix, typename Roots> 49 inline void computeRoots(const Matrix& m, Roots& roots)
|
/external/clang/lib/Basic/ |
H A D | VirtualFileSystem.cpp | 466 std::vector<Entry *> Roots; ///< The root(s) of the virtual file system. member in class:__anon925::VFSFromYAML 489 /// \brief Looks up \p Path in \c Roots. 796 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue()); local 797 if (!Roots) { 802 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end(); 805 FS->Roots.push_back(E); 851 VFSFromYAML::~VFSFromYAML() { llvm::DeleteContainerPointers(Roots); } 891 for (std::vector<Entry *>::iterator I = Roots.begin(), E = Roots [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 366 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for 368 void buildTree(ArrayRef<Value *> Roots, 403 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth); 896 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, argument 900 if (!getSameType(Roots)) 902 buildTree_rec(Roots, 0);
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 6072 std::pair<const SCEV *,const SCEV *> Roots = 6074 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); 6075 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); 7502 std::pair<const SCEV *,const SCEV *> Roots = 7504 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); 7505 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
|