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

  /external/llvm/include/llvm/Analysis/
CallGraphSCCPass.h 85 std::vector<CallGraphNode*> Nodes;
90 Nodes.assign(I, E);
93 bool isSingular() const { return Nodes.size() == 1; }
94 unsigned size() const { return Nodes.size(); }
101 iterator begin() const { return Nodes.begin(); }
102 iterator end() const { return Nodes.end(); }
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/ASTMatchers/
ASTMatchFinder.h 18 // AST nodes that the subexpressions matched on to output information about
26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
75 /// \brief Contains the nodes bound on the current match.
77 /// This allows user code to easily extract matched AST nodes.
78 const BoundNodes Nodes;
213 Nodes.push_back(Result.Nodes);
215 SmallVector<BoundNodes, 1> Nodes;
227 return Callback.Nodes;
    [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.
258 /// The nodes in the simulation graph which have been
262 /// Nodes - The nodes in the graph.
263 llvm::FoldingSet<ExplodedNode> Nodes;
265 /// BVC - Allocator and context for allocating nodes and their predecessor
269 /// NumNodes - The number of nodes in the graph.
272 /// 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,
38 // We currently only memoize on nodes whose pointers identify the
39 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
42 // FIXME: Benchmark whether memoization of non-pointer typed nodes
46 // Used to store the result of a match and possibly bound nodes.
49 BoundNodesTree Nodes;
337 // For AST-nodes that don't have an identity, we can't memoize.
349 InsertResult.first->second.Nodes =
352 InsertResult.first->second.Nodes.copyTo(Builder)
    [all...]
  /external/llvm/lib/Target/R600/
AMDGPUStructurizeCFG.cpp 163 /// consist of a network of PHI nodes where the true incoming values expresses
280 /// \brief Build up the general order of nodes
285 std::vector<RegionNode *> &Nodes = *I;
286 Order.append(Nodes.begin(), Nodes.end());
435 // Reset the visited nodes
793 /// branches and PHI nodes only have undefined conditions.
817 /// Handle a rare case where the disintegrated nodes instructions
  /external/llvm/lib/IR/
AsmWriter.cpp     [all...]
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.cpp 379 // handle nodes which have multiple types, where some types are
749 // Count children in the count if they are also nodes.
769 /// corresponds to the number of nodes that are covered.
869 /// constraint to the nodes operands. This returns true if it makes a
    [all...]
  /prebuilts/tools/common/m2/internal/xom/xom/1.0/
xom-1.0.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.jasper_5.5.17.v201004212143.jar 

Completed in 349 milliseconds