/build/kati/ |
depgraph.go | 29 nodes []*DepNode 36 // Nodes returns all rules. 37 func (g *DepGraph) Nodes() []*DepNode { return g.nodes } 66 for _, n := range g.nodes { 182 nodes, err := db.Eval(req.Targets) 196 nodes: nodes, 204 err = evalCommands(nodes, vars)
|
/external/swiftshader/third_party/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/ |
CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes; 98 Nodes.assign(I, E); 101 bool isSingular() const { return Nodes.size() == 1; } 102 unsigned size() const { return Nodes.size(); } 109 iterator begin() const { return Nodes.begin(); } 110 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 (BasicBlock *Node : Nodes) 75 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end() [all...] |
LazyCallGraph.h | 193 /// a callee, and facilitate iteration of child nodes in the graph. 202 // stored directly within the node. These are both '-1' when nodes are part 267 /// A lazy iterator used for both the entry nodes and child nodes. 342 /// a collection of call graph nodes. While the order of nodes in the SCC is 354 SmallVector<Node *, 1> Nodes; 357 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) 358 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} [all...] |
BlockFrequencyInfoImpl.h | 208 NodeList Nodes; ///< Header and the members of the loop. 214 : Parent(Parent), IsPackaged(false), NumHeaders(1), Nodes(1, Header), 219 : Parent(Parent), IsPackaged(false), Nodes(FirstHeader, LastHeader) { 220 NumHeaders = Nodes.size(); 221 Nodes.insert(Nodes.end(), FirstOther, LastOther); 226 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, 228 return Node == Nodes[0]; 230 BlockNode getHeader() const { return Nodes[0]; [all...] |
/external/swiftshader/third_party/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/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; 273 Nodes.push_back(Result.Nodes); 275 SmallVector<BoundNodes, 1> Nodes; 287 return std::move(Callback.Nodes); [all...] |
/external/llvm/lib/Analysis/ |
CallGraph.cpp | 109 SmallVector<CallGraphNode *, 16> Nodes; 110 Nodes.reserve(FunctionMap.size()); 113 Nodes.push_back(I.second.get()); 115 std::sort(Nodes.begin(), Nodes.end(), 124 for (CallGraphNode *CN : Nodes)
|
/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/compiler-rt/lib/profile/ |
InstrProfilingValue.c | 75 * value profile counter nodes. The number of element of the array 270 ValueProfNode **Nodes = (ValueProfNode **)Data->Values; 280 RTRecord.NodesKind[I] = Nodes ? &Nodes[S] : INSTR_PROF_NULLPTR; 285 Nodes ? RTRecord.NodesKind[I][J] : INSTR_PROF_NULLPTR;
|
/external/jsoncpp/include/json/ |
reader.h | 230 typedef std::stack<Value*> Nodes; 231 Nodes nodes_;
|
/external/llvm/unittests/Analysis/ |
LazyCallGraphTest.cpp | 128 // The order of the entry nodes should be stable w.r.t. the source order of 160 std::vector<std::string> Nodes; 163 Nodes.push_back(E.getFunction().getName()); 164 std::sort(Nodes.begin(), Nodes.end()); 165 EXPECT_EQ("a2", Nodes[0]); 166 EXPECT_EQ("b2", Nodes[1]); 167 EXPECT_EQ("c3", Nodes[2]); 168 Nodes.clear(); 176 Nodes.push_back(E.getFunction().getName()) [all...] |
/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...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
Trie.h | 156 std::vector<Node*> Nodes; 161 Nodes.push_back(N); 192 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) 193 delete Nodes[i]; 196 inline Node* getRoot() const { return Nodes[0]; } 295 return G.Nodes.begin(); 298 return G.Nodes.end();
|
/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 | 68 /// common case in an ExplodedGraph, where most nodes have only one 72 /// empty and no nodes may be added. 76 // 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 | 183 NodeVector Nodes; 194 assert(NId < Nodes.size() && "Out of bound NodeId"); 195 return Nodes[NId]; 198 assert(NId < Nodes.size() && "Out of bound NodeId"); 199 return Nodes[NId]; 210 Nodes[NId] = std::move(N); 212 NId = Nodes.size(); 213 Nodes.push_back(std::move(N)); 233 // Add the edge to the adjacency sets of its nodes. 254 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) [all...] |
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
AsmWriter.cpp | [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; 354 Nodes.push_back(N); 369 Nodes.push_back(Nx); 393 // The creation of gep nodes requires DT-traversal. When processing a GEP 408 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); 413 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, 416 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) [all...] |