HomeSort by relevance Sort by last modified time
    Searched defs:Roots (Results 1 - 10 of 10) 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]]);
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 69 std::vector<change_ty> Roots;
203 // Compute the roots.
207 Roots.push_back(*it);
210 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
255 llvm::errs() << "Roots: [";
256 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
257 ie = Roots.end(); it != ie; ++it) {
258 if (it != Roots.begin()) llvm::errs() << ", ";
311 // 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.
95 std::vector<GCRoot> Roots;
105 // The bit vector is the more compact representation where >3.2% of roots
124 Roots.push_back(GCRoot(Num, Metadata));
129 return Roots.erase(position);
150 /// roots_begin/roots_end - Iterators for all roots in the function.
152 roots_iterator roots_begin() { return Roots.begin(); }
153 roots_iterator roots_end () { return Roots.end();
    [all...]
  /external/llvm/lib/CodeGen/
GCStrategy.cpp 14 // Roots are identified in SelectionDAGISel.
49 AllocaInst **Roots, unsigned Count);
172 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
189 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
203 // action. The default for roots is no action.
278 SmallVector<AllocaInst*, 32> Roots;
308 Roots.push_back(cast<AllocaInst>(
321 if (Roots.size())
322 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
44 /// roots.
52 /// Roots - GC roots in the current function. Each is a pair of the
54 std::vector<std::pair<CallInst*,AllocaInst*> > Roots;
210 for (unsigned I = 0; I != Roots.size(); ++I) {
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
221 ConstantInt::get(Int32Ty, Roots.size(), false),
263 for (size_t I = 0; I != Roots.size(); I++
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 256 /// The roots of the simulation graph. Usually there will be only
259 /// different roots reach the same state at the same program location.
260 NodeVector Roots;
304 /// addRoot - Add an untyped node to the set of roots.
306 Roots.push_back(V);
320 unsigned num_roots() const { return Roots.size(); }
344 roots_iterator roots_begin() { return Roots.begin(); }
346 roots_iterator roots_end() { return Roots.end(); }
348 const_roots_iterator roots_begin() const { return Roots.begin(); }
350 const_roots_iterator roots_end() const { return Roots.end();
    [all...]
  /external/llvm/include/llvm/Support/
GenericDomTree.h 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
225 this->Roots.clear();
431 assert(this->Roots.size() == 1 && "Should always have entry node!");
432 return this->Roots[0];
672 this->Roots.push_back(BB);
686 this->Roots.push_back(entry);
692 // Initialize the roots list
  /external/llvm/utils/TableGen/
RegisterInfoEmitter.cpp 832 // Emit the table of register unit roots. Each regunit has one or two root
836 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots();
837 assert(!Roots.empty() && "All regunits must have a root register.");
838 assert(Roots.size() <= 2 && "More than two roots not supported yet.");
839 OS << " { " << getQualifiedName(Roots.front()->TheDef);
840 for (unsigned r = 1; r != Roots.size(); ++r)
841 OS << ", " << getQualifiedName(Roots[r]->TheDef);
    [all...]
CodeGenRegisters.h 412 const CodeGenRegister *Roots[2];
419 Roots[0] = Roots[1] = nullptr;
423 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
424 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
580 RegUnits.back().Roots[0] = R0
    [all...]
  /external/clang/lib/Basic/
VirtualFileSystem.cpp 434 /// 'roots': [
478 std::vector<Entry *> Roots; ///< The root(s) of the virtual file system.
501 /// \brief Looks up \p Path in \c Roots.
793 KeyStatusPair("roots", true),
799 // Parse configuration and 'roots'
810 if (Key == "roots") {
811 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue());
812 if (!Roots) {
817 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end()
    [all...]

Completed in 482 milliseconds