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

  /external/clang/include/clang/ASTMatchers/
ASTMatchFinder.h 18 // AST nodes that the subexpressions matched on to output information about
26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
69 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
71 /// \brief Contains the nodes bound on the current match.
73 /// This allows user code to easily extract matched AST nodes.
74 const BoundNodes Nodes;
  /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/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 67 /// common case in an ExplodedGraph, where most nodes have only one
71 /// empty and no nodes may be added.
75 // for the nodes in the group.
265 /// The nodes in the simulation graph which have been
269 /// Nodes - The nodes in the graph.
270 llvm::FoldingSet<ExplodedNode> Nodes;
272 /// BVC - Allocator and context for allocating nodes and their predecessor
276 /// NumNodes - The number of nodes in the graph.
279 /// A list of recently allocated nodes that can potentially be recycled
    [all...]
  /external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 10 // Implements an algorithm to efficiently search for matches on AST nodes.
13 // The general idea is to visit all AST nodes with a RecursiveASTVisitor,
32 /// \brief A \c RecursiveASTVisitor that builds a map from nodes to their
39 /// FIXME: Currently only builds up the map using \c Stmt and \c Decl nodes.
93 // We currently only memoize on nodes whose pointers identify the
94 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
97 // FIXME: Benchmark whether memoization of non-pointer typed nodes
101 // Used to store the result of a match and possibly bound nodes.
104 BoundNodesTree Nodes;
231 // such that other nodes at the current level can be visited)
    [all...]
  /external/llvm/lib/VMCore/
AsmWriter.cpp     [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 353 // handle nodes which have multiple types, where some types are
715 // Count children in the count if they are also nodes.
735 /// corresponds to the number of nodes that are covered.
835 /// constraint to the nodes operands. This returns true if it makes a
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.jasper_5.5.17.v201004212143.jar 

Completed in 137 milliseconds