| /external/swiftshader/third_party/subzero/src/ |
| D | IceTimerTree.cpp | 38 Nodes.resize(1); // Reserve Nodes[0] for the root node (sentinel). in TimerStack()
84 for (const TimerTreeNode &SrcNode : Src.Nodes) { in mergeFrom()
93 Nodes[MyIndex].Time += SrcNode.Time; in mergeFrom()
94 Nodes[MyIndex].UpdateCount += SrcNode.UpdateCount; in mergeFrom()
112 Path.push_back(Mapping[Nodes[Index].Interior]); in getPath()
113 assert(Nodes[Index].Parent < Index); in getPath()
114 Index = Nodes[Index].Parent; in getPath()
123 if (Nodes[Parent].Children.size() <= ID) in getChildIndex()
124 Nodes[Parent].Children.resize(ID + 1); in getChildIndex()
125 if (Nodes[Parent].Children[ID] == 0) { in getChildIndex()
[all …]
|
| D | IceLiveness.h | 80 return NumGlobals + Nodes[Node->getIndex()].NumLocals; in getNumVarsInNode()
83 return Nodes[Node->getIndex()].NumNonDeadPhis; in getNumNonDeadPhis()
88 return Nodes[Index].LiveIn; in getLiveIn()
93 return Nodes[Index].LiveOut; in getLiveOut()
99 return &Nodes[Index].LiveBegin; in getLiveBegin()
104 return &Nodes[Index].LiveEnd; in getLiveEnd()
130 if (Index >= Nodes.size()) { in resize()
132 Nodes.resize(Index + 1); in resize()
141 LivenessVector<LivenessNode> Nodes; variable
|
| D | IceCfg.cpp | 107 SizeT LabelIndex = Nodes.size(); in makeNode()
109 Nodes.push_back(Node); in makeNode()
114 assert(Nodes.size() == NewNodes.size()); in swapNodes()
115 Nodes.swap(NewNodes); in swapNodes()
117 Nodes[I]->resetIndex(I); in swapNodes()
184 for (CfgNode *Node : Nodes) { in profileBlocks()
277 for (auto *Node : Nodes) { in fixPhiNodes()
294 for (CfgNode *Node : Nodes) { in computeInOutEdges()
309 CfgNode *Node = Nodes[Index]; in computeInOutEdges()
320 Nodes[Dest] = Nodes[Source]; in computeInOutEdges()
[all …]
|
| D | IceLiveness.cpp | 44 Nodes.resize(NumNodes); in initInternal()
55 ++Nodes[Index].NumLocals; in initInternal()
66 LivenessNode &N = Nodes[(*I)->getIndex()]; in initInternal()
90 LiveIndex = Nodes[NodeIndex].NumLocals++; in initInternal()
91 Nodes[NodeIndex].LiveToVarMap[LiveIndex] = Var; in initInternal()
112 LivenessNode &Node = Nodes[(*I)->getIndex()]; in initInternal()
139 return Nodes[NodeIndex].LiveToVarMap[LiveIndex - NumGlobals]; in getVariable()
|
| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 160 std::vector<std::string> Nodes; in TEST() local
163 Nodes.push_back(E.getFunction().getName()); in TEST()
164 std::sort(Nodes.begin(), Nodes.end()); in TEST()
165 EXPECT_EQ("a2", Nodes[0]); in TEST()
166 EXPECT_EQ("b2", Nodes[1]); in TEST()
167 EXPECT_EQ("c3", Nodes[2]); in TEST()
168 Nodes.clear(); in TEST()
176 Nodes.push_back(E.getFunction().getName()); in TEST()
177 std::sort(Nodes.begin(), Nodes.end()); in TEST()
178 EXPECT_EQ("b2", Nodes[0]); in TEST()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
| D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
125 if (!Nodes) in distribute()
129 const unsigned PerNode = (Elements + Grow) / Nodes; in distribute()
130 const unsigned Extra = (Elements + Grow) % Nodes; in distribute()
131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute()
133 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
149 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
|
| /external/llvm/lib/Support/ |
| D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
125 if (!Nodes) in distribute()
129 const unsigned PerNode = (Elements + Grow) / Nodes; in distribute()
130 const unsigned Extra = (Elements + Grow) % Nodes; in distribute()
131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute()
133 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
149 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 263 std::vector<std::string> Nodes; in TEST() local
266 Nodes.push_back(E.getFunction().getName()); in TEST()
267 llvm::sort(Nodes.begin(), Nodes.end()); in TEST()
268 EXPECT_EQ("a2", Nodes[0]); in TEST()
269 EXPECT_EQ("b2", Nodes[1]); in TEST()
270 EXPECT_EQ("c3", Nodes[2]); in TEST()
271 Nodes.clear(); in TEST()
281 Nodes.push_back(E.getFunction().getName()); in TEST()
282 llvm::sort(Nodes.begin(), Nodes.end()); in TEST()
283 EXPECT_EQ("b2", Nodes[0]); in TEST()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraphSCCPass.h | 92 std::vector<CallGraphNode*> Nodes; variable
98 Nodes.assign(I, E); in initialize()
101 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
102 unsigned size() const { return Nodes.size(); } in size()
109 iterator begin() const { return Nodes.begin(); } in begin()
110 iterator end() const { return Nodes.end(); } in end()
|
| D | 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]; }
236 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) -
237 Nodes.begin();
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| D | CallGraphSCCPass.h | 91 std::vector<CallGraphNode *> Nodes; variable
97 Nodes.assign(NewNodes.begin(), NewNodes.end()); in initialize()
100 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
101 unsigned size() const { return Nodes.size(); } in size()
109 iterator begin() const { return Nodes.begin(); } in begin()
110 iterator end() const { return Nodes.end(); } in end()
|
| D | BlockFrequencyInfoImpl.h | 228 NodeList Nodes; ///< Header and the members of the loop.
234 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {}
239 : Parent(Parent), Nodes(FirstHeader, LastHeader) {
240 NumHeaders = Nodes.size();
241 Nodes.insert(Nodes.end(), FirstOther, LastOther);
247 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
249 return Node == Nodes[0];
252 BlockNode getHeader() const { return Nodes[0]; }
258 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) -
259 Nodes.begin();
[all …]
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchFinder.h | 76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member
273 Nodes.push_back(Result.Nodes); in run()
275 SmallVector<BoundNodes, 1> Nodes; variable
287 return std::move(Callback.Nodes); in match()
303 return std::move(Callback.Nodes); in match()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| D | TestGraph.h | 105 NodeType Nodes[N];
113 Nodes[i].first = i; in Graph()
120 Nodes[FromIdx].second.AddNode(ToIdx); in AddEdge()
127 Nodes[FromIdx].second.DeleteNode(ToIdx); in DeleteEdge()
135 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
153 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
|
| /external/clang/lib/Tooling/ |
| D | RefactoringCallbacks.cpp | 42 if (const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId)) { in run()
55 const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId); in run()
56 const Stmt *ToMatch = Result.Nodes.getStmtAs<Stmt>(ToId); in run()
68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) { in run()
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 331 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
334 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
348 if (Nodes == 0) in adjustSiblingSizes()
352 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
355 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
367 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
405 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1160 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1163 unsigned size[Nodes]; in branchRoot()
1167 if (Nodes == 1) in branchRoot()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 337 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
340 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
354 if (Nodes == 0) in adjustSiblingSizes()
358 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
361 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
373 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1162 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1165 unsigned size[Nodes]; in branchRoot()
1169 if (Nodes == 1) in branchRoot()
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 183 NodeVector Nodes; variable
194 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
195 return Nodes[NId]; in getNode()
198 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
199 return Nodes[NId]; in getNode()
210 Nodes[NId] = std::move(N); in addConstructedNode()
212 NId = Nodes.size(); in addConstructedNode()
213 Nodes.push_back(std::move(N)); in addConstructedNode()
254 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
307 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 169 NodeVector Nodes; variable
182 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
183 return Nodes[NId]; in getNode()
186 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
187 return Nodes[NId]; in getNode()
198 Nodes[NId] = std::move(N); in addConstructedNode()
200 NId = Nodes.size(); in addConstructedNode()
201 Nodes.push_back(std::move(N)); in addConstructedNode()
240 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
290 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
[all …]
|
| /external/clang/unittests/ASTMatchers/ |
| D | ASTMatchersTest.h | 45 *Verified |= FindResultReviewer->run(&Result.Nodes, Result.Context); in run()
325 bool run(const BoundNodes *Nodes) override { in run() argument
326 const BoundNodes::IDToNodeMap &M = Nodes->getMap(); in run()
327 if (Nodes->getNodeAs<T>(Id)) { in run()
329 if (const NamedDecl *Named = Nodes->getNodeAs<NamedDecl>(Id)) { in run()
332 Nodes->getNodeAs<NestedNameSpecifier>(Id)) { in run()
339 EXPECT_EQ(Nodes->getNodeAs<T>(Id), I->second.get<T>()); in run()
347 bool run(const BoundNodes *Nodes, ASTContext *Context) override { in run() argument
348 return run(Nodes); in run()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 100 NodeType Nodes[N]; member in llvm::Graph
108 Nodes[i].first = i; in Graph()
115 Nodes[FromIdx].second.AddNode(ToIdx); in AddEdge()
122 Nodes[FromIdx].second.DeleteNode(ToIdx); in DeleteEdge()
130 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
148 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 133 NodeVect Nodes; member in __anone44d4d9b0111::HexagonCommonGEP
354 Nodes.push_back(N); in processGepInst()
369 Nodes.push_back(Nx); in processGepInst()
408 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
413 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
416 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
427 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) { in nodes_for_root() argument
430 Nodes.insert(Root); in nodes_for_root()
439 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
520 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 150 NodeVect Nodes; member in __anon6f09b6330111::HexagonCommonGEP
376 Nodes.push_back(N); in processGepInst()
391 Nodes.push_back(Nx); in processGepInst()
429 LLVM_DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
432 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
436 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
448 NodeSet &Nodes) { in nodes_for_root() argument
451 Nodes.insert(Root); in nodes_for_root()
460 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
541 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | CallGraph.cpp | 94 SmallVector<CallGraphNode *, 16> Nodes; in print() local
95 Nodes.reserve(FunctionMap.size()); in print()
98 Nodes.push_back(I.second.get()); in print()
100 llvm::sort(Nodes.begin(), Nodes.end(), in print()
109 for (CallGraphNode *CN : Nodes) in print()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 265 llvm::FoldingSet<ExplodedNode> Nodes; variable
332 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } in reserve()
344 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin()
346 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
348 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin()
350 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end()
384 trim(ArrayRef<const NodeTy *> Nodes,
|