HomeSort by relevance Sort by last modified time
    Searched defs:Roots (Results 1 - 7 of 7) sorted by null

  /external/llvm/include/llvm/Analysis/
DominanceFrontier.h 37 std::vector<BasicBlock*> Roots;
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
166 assert(Roots.size() == 1 && "Should always have entry node!");
167 return Roots[0];
173 Roots = DT.getRoots();
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
175 calculate(DT, DT[Roots[0]]);
Dominators.h 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
231 this->Roots.clear();
417 assert(this->Roots.size() == 1 && "Should always have entry node!");
418 return this->Roots[0];
643 this->Roots.push_back(BB);
657 this->Roots.push_back(entry);
663 // Initialize the roots list
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 67 std::vector<change_ty> Roots;
201 // Compute the roots.
205 Roots.push_back(*it);
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
253 llvm::errs() << "Roots: [";
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
255 ie = Roots.end(); it != ie; ++it) {
256 if (it != Roots.begin()) llvm::errs() << ", ";
309 // The current set of changes we are minimizing, starting at the roots
    [all...]
  /external/llvm/include/llvm/CodeGen/
GCMetadata.h 19 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
21 // As a refinement, liveness analysis calculates the set of live roots at each
23 // generator, so all roots are assumed live.
92 std::vector<GCRoot> Roots;
102 // The bit vector is the more compact representation where >3.2% of roots
121 Roots.push_back(GCRoot(Num, Metadata));
142 /// roots_begin/roots_end - Iterators for all roots in the function.
144 roots_iterator roots_begin() { return Roots.begin(); }
145 roots_iterator roots_end () { return Roots.end(); }
146 size_t roots_size() const { return Roots.size();
    [all...]
  /external/llvm/lib/CodeGen/
GCStrategy.cpp 14 // Roots are identified in SelectionDAGISel.
49 AllocaInst **Roots, unsigned Count);
180 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
197 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
211 // action. The default for roots is no action.
285 SmallVector<AllocaInst*, 32> Roots;
315 Roots.push_back(cast<AllocaInst>(
328 if (Roots.size())
329 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size())
    [all...]
ShadowStackGC.cpp 13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
43 /// roots.
51 /// Roots - GC roots in the current function. Each is a pair of the
53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots;
209 for (unsigned I = 0; I != Roots.size(); ++I) {
210 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
220 ConstantInt::get(Int32Ty, Roots.size(), false),
262 for (size_t I = 0; I != Roots.size(); I++
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 251 /// The roots of the simulation graph. Usually there will be only
254 /// different roots reach the same state at the same program location.
255 NodeVector Roots;
297 /// addRoot - Add an untyped node to the set of roots.
299 Roots.push_back(V);
313 unsigned num_roots() const { return Roots.size(); }
337 roots_iterator roots_begin() { return Roots.begin(); }
339 roots_iterator roots_end() { return Roots.end(); }
341 const_roots_iterator roots_begin() const { return Roots.begin(); }
343 const_roots_iterator roots_end() const { return Roots.end();
    [all...]

Completed in 836 milliseconds