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

/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DShadowStackGCLowering.cpp39 /// Roots - GC roots in the current function. Each is a pair of the
41 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in class:__anon2545::ShadowStackGCLowering
202 for (unsigned I = 0; I != Roots.size(); ++I) {
203 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
213 ConstantInt::get(Int32Ty, Roots.size(), false),
253 for (size_t I = 0; I != Roots.size(); I++)
254 EltTys.push_back(Roots[I].second->getAllocatedType());
288 // void *Roots[]; // Stack roots (in-place array, so we pretend).
326 assert(Roots.empty() && "Not cleaned up?");
339 Roots
[all...]
H A DGCRootLowering.cpp152 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 DTargetRegisterInfo.cpp82 MCRegUnitRootIterator Roots(Unit, TRI);
83 assert(Roots.isValid() && "Unit has no roots.");
84 OS << TRI->getName(*Roots);
85 for (++Roots; Roots.isValid(); ++Roots)
86 OS << '~' << TRI->getName(*Roots);
H A DLiveIntervalAnalysis.cpp278 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
279 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
288 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
289 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DGCMetadata.h83 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 DMachineDominators.h29 this->Roots.push_back(MBB);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DFloat2Int.cpp68 void findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots);
73 void walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots);
80 SmallPtrSet<Instruction*,8> Roots; member in struct:__anon3184::Float2Int
132 void Float2Int::findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots) { argument
140 Roots.insert(&I);
145 Roots.insert(&I);
188 void Float2Int::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) { argument
189 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
382 if (Roots
[all...]
H A DLoopRerollPass.cpp329 // ST[y1] +1 +2 <-- Roots
347 SmallInstructionVector Roots; member in struct:__anon3207::LoopReroll::DAGRootSet
379 std::map<int64_t,Instruction*> &Roots);
382 void collectInLoopUserSet(const SmallInstructionVector &Roots,
610 const SmallInstructionVector &Roots,
614 for (SmallInstructionVector::const_iterator I = Roots.begin(),
615 IE = Roots.end(); I != IE; ++I)
666 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { argument
698 if (Roots.find(V) != Roots
609 collectInLoopUserSet( const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h41 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]]);
/freebsd-11.0-release/contrib/llvm/utils/TableGen/
H A DCodeGenRegisters.h444 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 DRegisterInfoEmitter.cpp939 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 DCodeGenRegisters.cpp1628 dbgs() << " " << RegUnits[U].Roots[0]->getName();
1641 dbgs() << " " << RegUnits[U].Roots[0]->getName();
1687 dbgs() << " " << RegUnits[U].Roots[0]->getName();
1702 dbgs() << " " << RegUnits[U].Roots[0]->getName();
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h258 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(); }
/freebsd-11.0-release/contrib/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp66 std::vector<change_ty> Roots; member in class:__anon2651::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...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h39 InfoRec &VInfo = DT.Info[DT.Roots[i]];
155 bool MultipleRoots = (DT.Roots.size() > 1);
167 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size());
169 N = DFSPass<GraphT>(DT, DT.Roots[i], N);
245 if (DT.Roots.empty()) return;
251 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr;
H A DGenericDomTree.h37 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...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/
H A DModuleManager.cpp101 Roots.push_back(New);
166 if (Roots.back() == ModuleEntry)
167 Roots.pop_back();
210 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),
211 Roots.end());
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp415 NodeVect &Roots) {
420 Roots.push_back(N);
1054 NodeVect Roots; local
1055 invert_find_roots(Nodes, NCM, Roots);
1059 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I)
1065 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I)
1072 for (NodeVect::iterator I = Roots.begin(), E = Roots
414 invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, NodeVect &Roots) argument
1161 NodeVect Roots; local
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Serialization/
H A DModuleManager.h44 SmallVector<ModuleFile *, 2> Roots; member in class:clang::serialization::ModuleManager
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DVectorUtils.cpp451 SmallPtrSet<Value *, 4> Roots; local
477 Roots.insert(&I);
559 if (Roots.count(*MI))
H A DScalarEvolution.cpp6579 std::pair<const SCEV *,const SCEV *> Roots =
6581 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
6582 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
8448 auto Roots = SolveQuadraticEquation(cast<SCEVAddRecExpr>(NewAddRec), SE);
8449 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first);
8450 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Basic/
H A DVirtualFileSystem.cpp815 std::vector<std::unique_ptr<Entry>> Roots; member in class:__anon3748::RedirectingFileSystem
838 /// \brief Looks up \p Path in \c Roots.
1154 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue()); local
1155 if (!Roots) {
1160 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end();
1163 FS->Roots.push_back(std::move(E));
1246 for (const std::unique_ptr<Entry> &Root : Roots) {
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp385 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
387 void buildTree(ArrayRef<Value *> Roots,
422 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
931 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, argument
935 if (!getSameType(Roots))
937 buildTree_rec(Roots, 0);

Completed in 312 milliseconds