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

12

/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/XRay/
H A DProfile.h90 Roots(std::move(O.Roots)), PathIDMap(std::move(O.PathIDMap)),
96 Roots = std::move(O.Roots);
109 swap(L.Roots, R.Roots);
131 SmallVector<TrieNode *, 4> Roots; member in class:llvm::xray::Profile
/netbsd-current/external/gpl3/gcc/dist/libphobos/testsuite/libphobos.gc/
H A Dprecisegc.d39 struct Roots
46 Roots* roots;
51 roots = new Roots;
70 Roots makeFalsePointers()
79 return Roots(null, null, null); // try to spill register contents
82 Roots moveRoot()
87 return Roots(null, null, null); // try to spill register contents
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DShadowStackGCLowering.cpp62 /// Roots - GC roots in the current function. Each is a pair of the
64 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in class:__anon1890::ShadowStackGCLowering
113 for (unsigned I = 0; I != Roots.size(); ++I) {
114 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
124 ConstantInt::get(Int32Ty, Roots.size(), false),
164 for (size_t I = 0; I != Roots.size(); I++)
165 EltTys.push_back(Roots[I].second->getAllocatedType());
199 // void *Roots[]; // Stack roots (in-place array, so we pretend).
237 assert(Roots.empty() && "Not cleaned up?");
250 Roots
[all...]
H A DGCRootLowering.cpp142 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) { argument
159 for (AllocaInst *Root : Roots)
191 SmallVector<AllocaInst *, 32> Roots; local
224 Roots.push_back(
231 if (Roots.size())
232 MadeChange |= InsertRootInitializers(F, Roots);
H A DTargetRegisterInfo.cpp156 MCRegUnitRootIterator Roots(Unit, TRI);
157 assert(Roots.isValid() && "Unit has no roots.");
158 OS << TRI->getName(*Roots);
159 for (++Roots; Roots.isValid(); ++Roots)
160 OS << '~' << TRI->getName(*Roots);
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DDominanceFrontier.h50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominanceFrontierBase
59 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; }
62 assert(Roots.size() == 1 && "Should always have entry node!");
63 return Roots[0];
134 this->Roots = {DT.getRoot()};
135 calculate(DT, DT[this->Roots[0]]);
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DGCMetadata.h87 std::vector<GCRoot> Roots; member in class:llvm::GCFunctionInfo
114 Roots.push_back(GCRoot(Num, Metadata));
119 return Roots.erase(position);
139 roots_iterator roots_begin() { return Roots.begin(); }
140 roots_iterator roots_end() { return Roots.end(); }
141 size_t roots_size() const { return Roots.size(); }
H A DMachineDominators.h32 this->Roots.push_back(MBB);
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp362 // ST[y1] +1 +2 <-- Roots
380 SmallInstructionVector Roots; member in struct:__anon2968::LoopReroll::DAGRootSet
417 std::map<int64_t,Instruction*> &Roots);
421 void collectInLoopUserSet(const SmallInstructionVector &Roots,
731 const SmallInstructionVector &Roots,
735 for (Instruction *Root : Roots)
788 collectPossibleRoots(Instruction *Base, std::map<int64_t,Instruction*> &Roots) { argument
821 if (Roots.find(V) != Roots.end())
825 Roots[
730 collectInLoopUserSet( const SmallInstructionVector &Roots, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument
[all...]
H A DFloat2Int.cpp136 Roots.insert(&I);
141 Roots.insert(&I);
186 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
374 if (Roots.count(I) == 0) {
503 if (Roots.count(I))
522 Roots.clear();
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A DGenericDomTree.h249 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots; member in class:llvm::DominatorTreeBase
266 : Roots(std::move(Arg.Roots)),
276 Roots = std::move(RHS.Roots);
297 root_iterator root_begin() { return Roots.begin(); }
298 const_root_iterator root_begin() const { return Roots.begin(); }
299 root_iterator root_end() { return Roots.end(); }
300 const_root_iterator root_end() const { return Roots.end(); }
302 size_t root_size() const { return Roots
[all...]
H A DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
335 // are always selected as tree roots. Roots with forward successors correspond
352 RootsT Roots; local
356 Roots.push_back(GetEntryNode(DT));
357 return Roots;
380 Roots.push_back(N);
461 Roots.push_back(FurthestAway);
489 if (HasNonTrivialRoots) RemoveRedundantRoots(DT, BUI, Roots);
493 : Roots) dbgs()
497 return Roots;
508 RemoveRedundantRoots(const DomTreeT &DT, BatchUpdatePtr BUI, RootsT &Roots) argument
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DAMDGPUPropagateAttributes.cpp117 SmallSet<Function *, 32> Roots; member in class:__anon2221::AMDGPUPropagateAttributes
138 // Propagate attributes from Roots.
216 Roots.insert(&F);
222 Roots.insert(&F);
231 if (Roots.empty())
233 Module &M = *(*Roots.begin())->getParent();
236 Roots.insert(NewRoots.begin(), NewRoots.end());
257 if (!Roots.count(Caller) && !NewRoots.count(Caller))
263 if (!Roots.count(&F))
306 Roots
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
H A DFloat2Int.h46 SmallSetVector<Instruction *, 8> Roots; member in class:llvm::Float2IntPass
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp65 std::vector<change_ty> Roots; member in class:__anon2073::DAGDeltaAlgorithmImpl
198 Roots.push_back(*it);
201 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
248 llvm::errs() << "Roots: [";
249 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
250 ie = Roots.end();
252 if (it != Roots.begin())
311 changeset_ty CurrentSet(Roots.begin(), Roots
[all...]
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/xray/
H A Dxray_function_call_trie.h324 RootArray Roots; member in class:__xray::FunctionCallTrie
332 Roots(*A.RootAllocator), member in class:__xray::FunctionCallTrie
343 Roots(std::move(O.Roots)),
350 Roots = std::move(O.Roots);
377 if (Roots.AppendEmplace(NewRoot) == nullptr) {
383 Roots.trim(1);
466 const RootArray &getRoots() const XRAY_NEVER_INSTRUMENT { return Roots; }
506 if (UNLIKELY(O.Roots
[all...]
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h315 NodeVector Roots;
372 Roots.push_back(V);
382 unsigned num_roots() const { return Roots.size(); }
408 roots_iterator roots_begin() { return Roots.begin(); }
410 roots_iterator roots_end() { return Roots.end(); }
412 const_roots_iterator roots_begin() const { return Roots.begin(); }
414 const_roots_iterator roots_end() const { return Roots.end(); }
/netbsd-current/external/apache2/llvm/dist/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp323 DenseMap<uint32_t, RootVector> Roots;
338 Roots[ThreadId].push_back(Node);
343 const auto &RootsByThread = Roots[ThreadId];
447 bool isEmpty() const { return Roots.empty(); }
481 for (auto iter : Roots) {
492 for (auto iter : Roots) {
507 using RootsType = decltype(Roots.begin())::value_type;
511 make_range(map_iterator(Roots.begin(), MapValueFn),
512 map_iterator(Roots.end(), MapValueFn))) {
524 for (auto MapIter : Roots) {
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DCodeGenRegisters.h493 const CodeGenRegister *Roots[2]; member in struct:llvm::RegUnit
503 Roots[0] = Roots[1] = nullptr;
507 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
508 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
685 RU.Roots[0] = R0;
686 RU.Roots[
[all...]
H A DGICombinerEmitter.cpp148 std::vector<RootInfo> Roots; member in class:__anon3303::CombineRule
204 size_t getNumRoots() const { return Roots.size(); }
210 const_root_iterator roots_begin() const { return Roots.begin(); }
211 const_root_iterator roots_end() const { return Roots.end(); }
213 return llvm::make_range(Roots.begin(), Roots.end());
231 SmallSet<const GIMatchDagInstr *, 5> Roots; local
236 Roots.insert(I);
247 if (Roots.count(EI->getToMI()))
357 // Roots shoul
[all...]
/netbsd-current/external/apache2/llvm/dist/clang/lib/Serialization/
H A DModuleManager.cpp246 Roots.push_back(NewModule.get());
273 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),
274 Roots.end());
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp424 NodeVect &Roots) {
430 Roots.push_back(N);
1050 NodeVect Roots; local
1051 invert_find_roots(Nodes, NCM, Roots);
1055 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I)
1061 for (NodeVect::iterator I = Roots.begin(), E = Roots.end(); I != E; ++I)
1068 for (NodeVect::iterator I = Roots.begin(), E = Roots
423 invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, NodeVect &Roots) argument
1156 NodeVect Roots; local
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/lib/XRay/
H A DProfile.cpp153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; });
157 if (RootIt == Roots.end()) {
161 Roots.push_back(Node);
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/Serialization/
H A DModuleManager.h60 SmallVector<ModuleFile *, 2> Roots; member in class:clang::serialization::ModuleManager
/netbsd-current/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/
H A Dppevvmath.h455 static void SolveQuadracticEqn(fInt A, fInt B, fInt C, fInt Roots[]) argument
457 fInt *pRoots = &Roots[0];

Completed in 371 milliseconds

12