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

  /external/llvm/include/llvm/
CallGraphSCCPass.h 82 std::vector<CallGraphNode*> Nodes;
87 Nodes.assign(I, E);
90 bool isSingular() const { return Nodes.size() == 1; }
91 unsigned size() const { return Nodes.size(); }
98 iterator begin() const { return Nodes.begin(); }
99 iterator end() const { return Nodes.end(); }
  /external/llvm/include/llvm/Analysis/
Interval.h 11 // represents a set of CFG nodes and is a portion of an interval partition.
33 /// Interval Class - An Interval is a set of nodes defined such that every node
48 Nodes.push_back(Header);
52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {}
56 /// Nodes - The basic blocks in this interval.
58 std::vector<BasicBlock*> Nodes;
60 /// Successors - List of BasicBlocks that are reachable directly from nodes in
62 /// These nodes necessarily must be header nodes for other intervals
    [all...]
  /external/clang/include/clang/Sema/
Ownership.h 10 // This file contains classes for managing ownership of Stmt and Expr nodes.
302 /// ASTMultiPtr - A moveable smart pointer to multiple AST nodes. Only owns
308 PtrTy *Nodes;
313 ASTMultiPtr() : Nodes(0), Count(0) {}
314 explicit ASTMultiPtr(Sema &) : Nodes(0), Count(0) {}
315 ASTMultiPtr(Sema &, PtrTy *nodes, unsigned count)
316 : Nodes(nodes), Count(count) {}
318 ASTMultiPtr(PtrTy *nodes, unsigned count) : Nodes(nodes), Count(count) {
    [all...]
  /external/llvm/include/llvm/ADT/
Trie.h 156 std::vector<Node*> Nodes;
161 Nodes.push_back(N);
192 for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
193 delete Nodes[i];
196 inline Node* getRoot() const { return Nodes[0]; }
295 return G.Nodes.begin();
298 return G.Nodes.end();
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 249 /// EndNodes - The nodes in the simulation graph which have been
253 /// Nodes - The nodes in the graph.
254 llvm::FoldingSet<ExplodedNode> Nodes;
256 /// BVC - Allocator and context for allocating nodes and their predecessor
260 /// NumNodes - The number of nodes in the graph.
263 /// A list of recently allocated nodes that can potentially be recycled.
266 /// A list of nodes that can be reused.
269 /// A flag that indicates whether nodes should be recycled.
291 /// addEndOfPath - Add an untyped node to the set of EOP nodes
    [all...]
  /external/llvm/lib/VMCore/
AsmWriter.cpp     [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 350 // handle nodes which have multiple types, where some types are
712 // Count children in the count if they are also nodes.
732 /// corresponds to the number of nodes that are covered.
832 /// constraint to the nodes operands. This returns true if it makes a
    [all...]

Completed in 53 milliseconds