| /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...] |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
15 // 2. An IntervalPartition& object, composed of Interval nodes.
69 Int->Nodes.push_back(BB);
80 // Add all of the nodes in I as new nodes in Int.
81 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes));
161 // the ProcessNode method to add all of the nodes to the interval.
182 // ProcessNode - This method is called by ProcessInterval to add nodes to th
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
125 if (!Nodes)
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
131 IdxPair PosPair = IdxPair(Nodes, 0);
133 for (unsigned n = 0; n != Nodes; ++n) {
135 if (PosPair.first == Nodes && Sum > Position)
142 assert(PosPair.first < Nodes && "Bad algebra");
149 for (unsigned n = 0; n != Nodes; ++n)
[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/llvm/lib/Analysis/ |
| Interval.cpp | 45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46 E = Nodes.end(); I != E; ++I)
|
| IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
|
| /external/clang/lib/Tooling/ |
| RefactoringCallbacks.cpp | 42 if (const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId)) {
55 const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId);
56 const Stmt *ToMatch = Result.Nodes.getStmtAs<Stmt>(ToId);
68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) {
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
32 /// NodeSubset - A subset of the graph's nodes.
101 /// Nodes - The list of nodes for this graph.
102 NodeType Nodes[N];
108 // the Nodes array given a pointer to any element of it.
110 Nodes[i].first = i;
117 Nodes[FromIdx].second.AddNode(ToIdx);
124 Nodes[FromIdx].second.DeleteNode(ToIdx);
132 return const_cast<NodeType *>(&Nodes[Idx])
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 189 // Both leaf and branch nodes store vectors of pairs.
196 // The nodes don't know how many elements they contain - that information is
201 // wasted space when nodes are sized to fit in three cache lines (192 bytes):
324 /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
325 /// @param Node Array of pointers to sibling nodes.
326 /// @param Nodes Number of nodes.
330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
333 for (int n = Nodes - 1; n; --n) {
347 if (Nodes == 0
[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/llvm/lib/IR/ |
| AttributeImpl.h | 265 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) {
266 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
267 ID.AddInteger(Nodes[i].first);
268 ID.AddPointer(Nodes[i].second);
|
| /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/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 68 // First, we only consider nodes for reclamation of the following
77 // After these prerequisites, we discard all "filler" nodes that
83 // We then discard all other nodes where *all* of the following conditions
95 // FIXME: It may be safe to reclaim PreCall and PostCall nodes as well.
109 // Now reclaim any nodes that are (by definition) not essential to
137 // Do not collect nodes for "interesting" lvalue expressions since they are
143 // Do not collect nodes for non-consumed Stmt or Expr to ensure precise
170 Nodes.RemoveNode(node);
179 // Only periodically reclaim nodes so that we can build up a set of
180 // nodes that meet the reclamation criteria. Freshly created node
[all...] |
| /external/clang/unittests/AST/ |
| StmtPrinterTest.cpp | 47 const Stmt *S = Result.Nodes.getStmtAs<Stmt>("id");
|
| MatchVerifier.h | 30 /// \brief Base class for verifying some property of nodes found by a matcher.
103 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>("");
|
| /external/clang/unittests/ASTMatchers/ |
| ASTMatchersTest.h | 32 // running 'FindResultVerifier' with the bound nodes as argument.
41 *Verified |= FindResultReviewer->run(&Result.Nodes, Result.Context);
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 328 /// an SDNode and any nodes flagged to it.
368 /// \brief Boundary nodes are placeholders for the boundary of the
373 /// valid ID. Consequently, always check for boundary nodes before accessing
437 /// recursively marks successor nodes dirty.
442 /// recursively marks predecessor nodes dirty.
494 /// the interface of a standard priority queue, where nodes are inserted in
527 void push_all(const std::vector<SUnit *> &Nodes) {
528 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
529 E = Nodes.end(); I != E; ++I)
541 /// unscheduled nodes, for example
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 178 << " nodes:\n";
515 assert(i != Nodes.size() && "Node not in SCC");
516 if (Nodes[i] != Old) continue;
517 Nodes[i] = New;
|
| /external/webkit/LayoutTests/dom/html/level2/html/ |
| HTMLCollection08.js | 78 Nodes in a HTMLCollection object are numbered in tree order.
|
| HTMLOptionsCollection02.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
83 Nodes are numbered in tree order. The index origin is 0.
|
| HTMLOptionsCollection07.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
82 The item() method retrieves a node specified by ordinal index. Nodes
|
| /external/webkit/LayoutTests/dom/xhtml/level2/html/ |
| HTMLCollection08.js | 78 Nodes in a HTMLCollection object are numbered in tree order.
|
| HTMLOptionsCollection02.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
83 Nodes are numbered in tree order. The index origin is 0.
|
| HTMLOptionsCollection07.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
82 The item() method retrieves a node specified by ordinal index. Nodes
|
