| /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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes;
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
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...] |
| /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/swiftshader/third_party/subzero/src/ |
| IceTimerTree.h | 43 /// The children are always at a higher index in the TimerTreeNode::Nodes
90 std::vector<TimerTreeNode> Nodes; /// indexed by TTindex
|
| /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...] |
