| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 85 std::vector<CallGraphNode*> Nodes;
91 Nodes.assign(I, E);
94 bool isSingular() const { return Nodes.size() == 1; }
95 unsigned size() const { return Nodes.size(); }
102 iterator begin() const { return Nodes.begin(); }
103 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);
53 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes;
57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
59 /// These nodes necessarily must be header nodes for other intervals.
70 for (unsigned i = 0; i < Nodes.size(); ++i)
71 if (Nodes[i] == BB) return true
[all...] |
| BlockFrequencyInfoImpl.h | 204 NodeList Nodes; ///< Header and the members of the loop.
210 : Parent(Parent), IsPackaged(false), NumHeaders(1), Nodes(1, Header),
215 : Parent(Parent), IsPackaged(false), Nodes(FirstHeader, LastHeader) {
216 NumHeaders = Nodes.size();
217 Nodes.insert(Nodes.end(), FirstOther, LastOther);
222 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
224 return Node == Nodes[0];
226 BlockNode getHeader() const { return Nodes[0];
[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 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
170 // the ProcessNode method to add all of the nodes to the interval
[all...] |
| ScopedNoAliasAA.h | 47 SmallPtrSetImpl<const MDNode *> &Nodes) const;
|
| /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/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 127 // The order of the entry nodes should be stable w.r.t. the source order of
159 std::vector<std::string> Nodes;
162 Nodes.push_back(N.getFunction().getName());
163 std::sort(Nodes.begin(), Nodes.end());
164 EXPECT_EQ("a2", Nodes[0]);
165 EXPECT_EQ("b2", Nodes[1]);
166 EXPECT_EQ("c3", Nodes[2]);
167 Nodes.clear();
175 Nodes.push_back(N.getFunction().getName())
[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();
|
| CallGraph.cpp | 111 SmallVector<CallGraphNode *, 16> Nodes;
112 Nodes.reserve(FunctionMap.size());
115 Nodes.push_back(I->second.get());
117 std::sort(Nodes.begin(), Nodes.end(),
126 for (CallGraphNode *CN : Nodes)
|
| /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)) {
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Integer>> nodes = new ArrayList<>(); local
49 nodes.add(Nodes.node(array));
50 nodes.add(Nodes.node(Arrays.asList(array)));
51 nodes.add(degenerateTree(Arrays.asList(array).iterator()));
52 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()]))));
53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l)))
[all...] |
| DoubleNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Double>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l))));
53 nodes.add(fill(array, Nodes.doubleBuilder(array.length)));
54 nodes.add(fill(array, Nodes.doubleBuilder()))
[all...] |
| IntNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Integer>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l))));
53 nodes.add(fill(array, Nodes.intBuilder(array.length)));
54 nodes.add(fill(array, Nodes.intBuilder()))
[all...] |
| LongNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Long>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l))));
53 nodes.add(fill(array, Nodes.longBuilder(array.length)));
54 nodes.add(fill(array, Nodes.longBuilder()))
[all...] |
| NodeBuilderTest.java | 56 s -> Nodes.builder(),
57 s -> Nodes.builder(s, LambdaTestHelpers.integerArrayGenerator)
101 s -> Nodes.intBuilder(),
102 s -> Nodes.intBuilder(s)
151 s -> Nodes.longBuilder(),
152 s -> Nodes.longBuilder(s)
201 s -> Nodes.doubleBuilder(),
202 s -> Nodes.doubleBuilder(s)
|
| /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");
76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
78 /// \brief Contains the nodes bound on the current match.
80 /// This allows user code to easily extract matched AST nodes.
81 const BoundNodes Nodes;
268 Nodes.push_back(Result.Nodes);
270 SmallVector<BoundNodes, 1> Nodes;
282 return std::move(Callback.Nodes);
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| SortedOps.java | 159 return Nodes.node(flattenedData);
198 return Nodes.node(content);
237 return Nodes.node(content);
276 return Nodes.node(content);
341 if (size >= Nodes.MAX_ARRAY_SIZE)
342 throw new IllegalArgumentException(Nodes.BAD_SIZE);
380 if (size >= Nodes.MAX_ARRAY_SIZE)
381 throw new IllegalArgumentException(Nodes.BAD_SIZE);
438 if (size >= Nodes.MAX_ARRAY_SIZE)
439 throw new IllegalArgumentException(Nodes.BAD_SIZE)
[all...] |
| Node.java | 53 * contained in the leaf nodes. The use of {@code Node} within the stream
83 * Returns the number of child nodes of this node.
87 * @return the number of child nodes
102 * than or equal to the number of child nodes
118 * for reference nodes.
126 Node.Builder<T> nodeBuilder = Nodes.builder(size, generator);
269 if (size >= Nodes.MAX_ARRAY_SIZE)
270 throw new IllegalArgumentException(Nodes.BAD_SIZE);
361 Node.Builder.OfInt nodeBuilder = Nodes.intBuilder(size);
434 Node.Builder.OfLong nodeBuilder = Nodes.longBuilder(size)
[all...] |
| /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.
99 /// Nodes - The list of nodes for this graph.
100 NodeType Nodes[N];
106 // the Nodes array given a pointer to any element of it.
108 Nodes[i].first = i;
115 Nodes[FromIdx].second.AddNode(ToIdx);
122 Nodes[FromIdx].second.DeleteNode(ToIdx);
130 return const_cast<NodeType *>(&Nodes[Idx])
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 190 // Both leaf and branch nodes store vectors of pairs.
197 // The nodes don't know how many elements they contain - that information is
202 // wasted space when nodes are sized to fit in three cache lines (192 bytes):
325 /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
326 /// @param Node Array of pointers to sibling nodes.
327 /// @param Nodes Number of nodes.
331 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
334 for (int n = Nodes - 1; n; --n) {
348 if (Nodes == 0
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 184 NodeVector Nodes;
195 assert(NId < Nodes.size() && "Out of bound NodeId");
196 return Nodes[NId];
199 assert(NId < Nodes.size() && "Out of bound NodeId");
200 return Nodes[NId];
211 Nodes[NId] = std::move(N);
213 NId = Nodes.size();
214 Nodes.push_back(std::move(N));
234 // Add the edge to the adjacency sets of its nodes.
255 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds)
[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.
260 /// The nodes in the simulation graph which have been
264 /// Nodes - The nodes in the graph.
265 llvm::FoldingSet<ExplodedNode> Nodes;
267 /// BVC - Allocator and context for allocating nodes and their predecessor
271 /// NumNodes - The number of nodes in the graph.
274 /// 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,
51 // bound nodes before the matcher was executed.
53 // We currently only memoize on nodes whose pointers identify the
54 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
57 // FIXME: Benchmark whether memoization of non-pointer typed nodes
70 // Used to store the result of a match and possibly bound nodes.
73 BoundNodesTreeBuilder Nodes;
131 // It's OK to always overwrite the bound nodes, as if there was
380 // For AST-nodes that don't have an identity, we can't memoize
[all...] |
| /external/llvm/lib/IR/ |
| AttributeImpl.h | 269 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) {
270 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
271 ID.AddInteger(Nodes[i].first);
272 ID.AddPointer(Nodes[i].second);
|
