| /freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
| D | ShadowStackGC.cpp | 53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anon0d97d2220111::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 | 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 | TargetRegisterInfo.cpp | 69 MCRegUnitRootIterator Roots(Unit, TRI); in print() local
70 assert(Roots.isValid() && "Unit has no roots."); in print()
71 OS << TRI->getName(*Roots); in print()
72 for (++Roots; Roots.isValid(); ++Roots) in print()
73 OS << '~' << TRI->getName(*Roots); in print()
|
| D | LiveIntervalAnalysis.cpp | 243 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { in computeRegUnitRange() local
244 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true); in computeRegUnitRange()
253 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) { in computeRegUnitRange() local
254 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true); in computeRegUnitRange()
|
| /freebsd-10-stable/contrib/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()
431 assert(this->Roots.size() == 1 && "Should always have entry node!"); in getRoot()
432 return this->Roots[0]; in getRoot()
657 this->Roots.push_back(BB); in addRoot()
671 this->Roots.push_back(entry); in recalculate()
|
| /freebsd-10-stable/contrib/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()
|
| /freebsd-10-stable/contrib/llvm/utils/TableGen/ |
| D | CodeGenRegisters.h | 416 const CodeGenRegister *Roots[2]; member
422 RegUnit() : Weight(0), RegClassUnitSetsIdx(0) { Roots[0] = Roots[1] = 0; } in RegUnit()
425 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
426 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
582 RegUnits.back().Roots[0] = R0;
583 RegUnits.back().Roots[1] = R1;
|
| D | RegisterInfoEmitter.cpp | 836 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots(); in runMCDesc() local
837 assert(!Roots.empty() && "All regunits must have a root register."); in runMCDesc()
838 assert(Roots.size() <= 2 && "More than two roots not supported yet."); in runMCDesc()
839 OS << " { " << getQualifiedName(Roots.front()->TheDef); in runMCDesc()
840 for (unsigned r = 1; r != Roots.size(); ++r) in runMCDesc()
841 OS << ", " << getQualifiedName(Roots[r]->TheDef); in runMCDesc()
|
| D | CodeGenRegisters.cpp | 1566 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName(); in computeRegUnitSets()
1580 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName(); in computeRegUnitSets()
1627 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName(); in computeRegUnitSets()
1643 dbgs() << " " << RegUnits[Units[i]].Roots[0]->getName(); in computeRegUnitSets()
|
| /freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 318 const SmallInstructionVector &Roots,
331 SmallVector<SmallInstructionVector, 32> &Roots,
514 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
518 for (SmallInstructionVector::const_iterator I = Roots.begin(), in collectInLoopUserSet()
519 IE = Roots.end(); I != IE; ++I) in collectInLoopUserSet()
616 SmallVector<SmallInstructionVector, 32> &Roots, in collectAllRoots() argument
635 Roots[Idx-1].push_back(User); in collectAllRoots()
643 if (Roots[0].empty()) in collectAllRoots()
647 if (Roots[i].size() != Roots[0].size()) { in collectAllRoots()
802 SmallVector<SmallInstructionVector, 32> Roots(Scale-1); in reroll() local
[all …]
|
| /freebsd-10-stable/contrib/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots; member in __anon5dca77610111::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()
|
| /freebsd-10-stable/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 260 NodeVector Roots; variable
306 Roots.push_back(V); in addRoot()
320 unsigned num_roots() const { return Roots.size(); } in num_roots()
344 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
346 roots_iterator roots_end() { return Roots.end(); } in roots_end()
348 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
350 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
|
| /freebsd-10-stable/contrib/gcc/doc/ |
| D | gty.texi | 70 * GGC Roots:: Making global variables GGC roots.
351 @node GGC Roots
352 @section Marking Roots for the Garbage Collector
358 at. Roots must be declared using one of the following syntaxes:
|
| /freebsd-10-stable/contrib/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 369 void buildTree(ArrayRef<Value *> Roots, ValueSet *RdxOps = 0);
393 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
544 void BoUpSLP::buildTree(ArrayRef<Value *> Roots, ValueSet *Rdx) { in buildTree() argument
547 if (!getSameType(Roots)) in buildTree()
549 buildTree_rec(Roots, 0); in buildTree()
|
| /freebsd-10-stable/contrib/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 5519 std::pair<const SCEV *,const SCEV *> Roots = in HowFarToZero() local
5521 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in HowFarToZero()
5522 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); in HowFarToZero()
6636 std::pair<const SCEV *,const SCEV *> Roots = in getNumIterationsInRange() local
6638 const SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); in getNumIterationsInRange()
6639 const SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); in getNumIterationsInRange()
|
| /freebsd-10-stable/contrib/gcc/ |
| D | ChangeLog-2002 | 11767 * doc/gty.texi (GGC Roots): Clarify that the list of syntaxes
17453 (GGC Roots): Likewise.
|
| /freebsd-10-stable/games/fortune/datfiles/ |
| D | fortunes | 45133 ... Now, all the SENSUAL and VIOLENT passions Roots couldn't show on TV!
|