| /external/swiftshader/third_party/subzero/src/ |
| IceTimerTree.cpp | 38 Nodes.resize(1); // Reserve Nodes[0] for the root node (sentinel).
84 for (const TimerTreeNode &SrcNode : Src.Nodes) {
91 // creating new interior nodes as necessary.
93 Nodes[MyIndex].Time += SrcNode.Time;
94 Nodes[MyIndex].UpdateCount += SrcNode.UpdateCount;
112 Path.push_back(Mapping[Nodes[Index].Interior]);
113 assert(Nodes[Index].Parent < Index);
114 Index = Nodes[Index].Parent;
123 if (Nodes[Parent].Children.size() <= ID
[all...] |
| IceLiveness.h | 80 return NumGlobals + Nodes[Node->getIndex()].NumLocals;
83 return Nodes[Node->getIndex()].NumNonDeadPhis;
88 return Nodes[Index].LiveIn;
93 return Nodes[Index].LiveOut;
99 return &Nodes[Index].LiveBegin;
104 return &Nodes[Index].LiveEnd;
128 /// Resize Nodes so that Nodes[Index] is valid.
130 if (Index >= Nodes.size()) {
131 assert(false && "The Nodes array is not expected to be resized.")
[all...] |
| IceLiveness.cpp | 18 /// mapped to low indexes that are common across nodes, and local variables are
19 /// mapped to a higher index space that is shared across nodes.
44 Nodes.resize(NumNodes);
55 ++Nodes[Index].NumLocals;
66 LivenessNode &N = Nodes[(*I)->getIndex()];
90 LiveIndex = Nodes[NodeIndex].NumLocals++;
91 Nodes[NodeIndex].LiveToVarMap[LiveIndex] = Var;
112 LivenessNode &Node = Nodes[(*I)->getIndex()];
139 return Nodes[NodeIndex].LiveToVarMap[LiveIndex - NumGlobals];
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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(); }
|
| /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/swiftshader/third_party/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/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/LLVM/lib/Analysis/ |
| Interval.cpp | 45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46 E = Nodes.end(); I != E; ++I)
|
| /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/lib/Analysis/ |
| Interval.cpp | 45 for (const BasicBlock *Node : 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...] |
| /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/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/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;
280 Nodes.push_back(Result.Nodes);
282 SmallVector<BoundNodes, 1> Nodes;
294 return std::move(Callback.Nodes);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/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;
280 Nodes.push_back(Result.Nodes);
282 SmallVector<BoundNodes, 1> Nodes;
294 return std::move(Callback.Nodes);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/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;
280 Nodes.push_back(Result.Nodes);
282 SmallVector<BoundNodes, 1> Nodes;
294 return std::move(Callback.Nodes);
[all...] |
