| /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...] |
| LazyCallGraph.h | 110 /// \brief A lazy iterator used for both the entry nodes and child nodes.
159 /// a callee, and facilitate iteration of child nodes in the graph.
208 /// a collection of call graph nodes. While the order of nodes in the SCC is
216 SmallVector<Node *, 1> Nodes;
231 iterator begin() const { return Nodes.begin(); }
232 iterator end() const { return Nodes.end(); }
339 /// where V is the number of nodes in this SCC and E is the number of edges
340 /// leaving the nodes in this SCC. Note that E includes both edges withi
[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...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBodyHelpers.h | 27 Nodes = 0x0001,
|
| /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...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| fDrawFlags.java | 68 public final static int Nodes = 0x0001;
|
| /external/llvm/lib/Analysis/ |
| 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/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...] |
| /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...] |
| /external/jsoncpp/include/json/ |
| reader.h | 230 typedef std::stack<Value*> Nodes;
231 Nodes nodes_;
|
| /external/ImageMagick/MagickCore/ |
| histogram.c | 94 nodes[NodesInAList];
98 } Nodes;
118 Nodes
397 register Nodes
398 *nodes;
406 nodes=cube_info->node_queue->next;
407 cube_info->node_queue=(Nodes *)
409 cube_info->node_queue=nodes;
410 } while (cube_info->node_queue != (Nodes *) NULL);
598 Nodes
91 nodes[NodesInAList]; member in struct:_Nodes
391 *nodes; local
588 *nodes; local
[all...] |
| quantize.c | 89 % prohibitive because the tree's total number of nodes is 1 +
92 % A complete tree would require 19,173,961 nodes for k = 8, Cmax = 255.
94 % Initializes data structures for nodes only as they are needed; (2)
108 % lower depth in the tree; initially, n2 = 0 for all nodes except
117 % within a node and the nodes' center. This represents the
120 % Reduction repeatedly prunes the tree until the number of nodes with n2
123 % those nodes whose E count is minimal for pruning and merges their color
128 % while number of nodes with (n2 > 0) > required maximum number of colors
129 % prune all nodes such that E <= Ep
130 % Set Ep to minimum E in remaining nodes
253 *nodes; member in struct:_Nodes
283 nodes, member in struct:_CubeInfo
1343 *nodes; local
2112 *nodes; local
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| Nodes.java | 52 final class Nodes {
54 private Nodes() {
108 * @return a {@code Node} covering the elements of the input nodes
182 // Int nodes
219 // Long nodes
256 // Double nodes
293 // Parallel evaluation of pipelines to nodes
447 // Parallel flattening of nodes
788 return new Nodes.InternalNodeSpliterator.OfRef<>(this);
826 return Nodes.conc(getShape(), left.truncate(from, leftCount, generator)
[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/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/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 60 // Numbering map for gep nodes. Used to keep track of ordering for
61 // gep nodes.
133 NodeVect Nodes;
355 Nodes.push_back(N);
370 Nodes.push_back(Nx);
394 // The creation of gep nodes requires DT-traversal. When processing a GEP
409 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes);
414 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM,
417 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I)
[all...] |
| HexagonISelDAGToDAG.cpp | [all...] |
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 277 MDNode *Nodes[] = {N0, N1, N2};
278 for (auto *Node : Nodes)
543 // Create a couple of distinct nodes to observe what's going on.
565 // under us. Just check that the other nodes are sane.
591 // Check code for replacing resolved nodes.
644 // collision with any other nodes above).
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| portcls.h | 385 const PCNODE_DESCRIPTOR* Nodes;
[all...] |
| /external/llvm/lib/IR/ |
| AsmWriter.cpp | [all...] |
