| /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| Profile.h | 90 Roots(std::move(O.Roots)), PathIDMap(std::move(O.PathIDMap)),
96 Roots = std::move(O.Roots);
109 swap(L.Roots, R.Roots);
130 // List of call stack roots.
131 SmallVector<TrieNode *, 4> Roots;
|
| /src/external/gpl3/gcc.old/dist/libphobos/testsuite/libphobos.gc/ |
| precisegc.d | 39 struct Roots
46 Roots* roots;
51 roots = new Roots;
52 roots.c = new C;
53 roots.c.next = new C;
55 roots.s = new S;
56 roots.s.next = new S;
58 roots.l = new L
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ShadowStackGCLowering.cpp | 55 /// roots.
62 /// Roots - GC roots in the current function. Each is a pair of the
64 std::vector<std::pair<CallInst *, AllocaInst *>> Roots;
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());
184 // int32_t NumRoots; // Number of roots in stack frame
[all...] |
| GCRootLowering.cpp | 142 static bool InsertRootInitializers(Function &F, ArrayRef<AllocaInst *> Roots) {
159 for (AllocaInst *Root : Roots)
184 /// already done so...), and insert initializing stores to roots as a defensive
185 /// measure. Given we're going to report all roots live at all safepoints, we
191 SmallVector<AllocaInst *, 32> Roots;
224 Roots.push_back(
231 if (Roots.size())
232 MadeChange |= InsertRootInitializers(F, Roots);
327 // Find the concrete stack offsets for all roots (stack slots)
|
| TargetRegisterInfo.cpp | 156 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);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 49 // Postdominators can have multiple roots.
50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
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]]);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 18 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
20 // As a refinement, liveness analysis calculates the set of live roots at each
22 // generator, so all roots are assumed live.
87 std::vector<GCRoot> Roots;
97 // The bit vector is the more compact representation where >3.2% of roots
114 Roots.push_back(GCRoot(Num, Metadata));
119 return Roots.erase(position);
138 /// roots_begin/roots_end - Iterators for all roots in the function.
139 roots_iterator roots_begin() { return Roots.begin(); }
140 roots_iterator roots_end() { return Roots.end();
[all...] |
| MachineDominators.h | 32 this->Roots.push_back(MBB);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | 362 // ST[y1] +1 +2 <-- Roots
380 SmallInstructionVector Roots;
386 // The set of all DAG roots, and state tracking of all roots
399 /// Stage 1: Find all the DAG roots for the induction variable.
402 /// Stage 2: Validate if the found roots are valid.
417 std::map<int64_t,Instruction*> &Roots);
421 void collectInLoopUserSet(const SmallInstructionVector &Roots,
462 // The roots themselves.
731 const SmallInstructionVector &Roots,
[all...] |
| Float2Int.cpp | 120 // Find the roots - instructions that convert from the FP domain to
136 Roots.insert(&I);
141 Roots.insert(&I);
176 // the roots. Populate "SeenInsts" with interesting
186 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
373 // Don't count the roots, as they terminate the graphs.
374 if (Roots.count(I) == 0) {
503 if (Roots.count(I))
522 Roots.clear()
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| GenericDomTree.h | 249 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
266 : Roots(std::move(Arg.Roots)),
276 Roots = std::move(RHS.Roots);
289 /// Iteration over 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();
304 iterator_range<root_iterator> roots() { function in class:llvm::DominatorTreeBase
307 iterator_range<const_root_iterator> roots() const { function in class:llvm::DominatorTreeBase
[all...] |
| GenericDomTreeConstruction.h | 59 using RootsT = decltype(DomTreeT::Roots);
334 // For postdominators, nodes with no forward successors are trivial roots that
335 // are always selected as tree roots. Roots with forward successors correspond
347 // Finds all roots without relaying on the set of roots already stored in the
349 // We define roots to be some non-redundant set of the CFG nodes
352 RootsT Roots;
356 Roots.push_back(GetEntryNode(DT));
357 return Roots;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUPropagateAttributes.cpp | 116 // Option propagation roots.
117 SmallSet<Function *, 32> Roots;
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)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 46 SmallSetVector<Instruction *, 8> Roots;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 65 std::vector<change_ty> Roots;
194 // Compute the roots.
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())
310 // The current set of changes we are minimizing, starting at the roots
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_function_call_trie.h | 324 RootArray Roots;
332 Roots(*A.RootAllocator),
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; }
471 // roots, and while doing so recreating the traversal in the provide
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 311 /// The roots of the simulation graph. Usually there will be only
314 /// different roots reach the same state at the same program location.
315 NodeVector Roots;
370 /// addRoot - Add an untyped node to the set of 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();
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-stacks.cpp | 322 // We maintain pointers to the roots of the tries we see.
323 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)))
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 493 const CodeGenRegister *Roots[2];
498 // A register unit is artificial if at least one of its roots is
503 Roots[0] = Roots[1] = nullptr;
507 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
508 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1])
[all...] |
| GICombinerEmitter.cpp | 144 /// The roots of a match. These are the leaves of the DAG that are closest to
148 std::vector<RootInfo> Roots;
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(); }
212 iterator_range<const_root_iterator> roots() const { function in class:__anon5800::CombineRule
213 return llvm::make_range(Roots.begin(), Roots.end());
226 /// The matcher will begin from the roots and will perform the match by
231 SmallSet<const GIMatchDagInstr *, 5> Roots;
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| ModuleManager.cpp | 246 Roots.push_back(NewModule.get());
273 Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),
274 Roots.end());
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 424 NodeVect &Roots) {
430 Roots.push_back(N);
1050 NodeVect Roots;
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.end(); I != E; ++I
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/XRay/ |
| Profile.cpp | 153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; });
157 if (RootIt == Roots.end()) {
161 Roots.push_back(Node);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Serialization/ |
| ModuleManager.h | 58 // The roots of the dependency DAG of AST files. This is used
60 SmallVector<ModuleFile *, 2> Roots;
|
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ |
| ppevvmath.h | 71 static void SolveQuadracticEqn(fInt, fInt, fInt, fInt[]); /* Returns the 2 roots via the array */
455 static void SolveQuadracticEqn(fInt A, fInt B, fInt C, fInt Roots[])
457 fInt *pRoots = &Roots[0];
|
