| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 159 std::vector<std::string> Nodes; in TEST() local
162 Nodes.push_back(N.getFunction().getName()); in TEST()
163 std::sort(Nodes.begin(), Nodes.end()); in TEST()
164 EXPECT_EQ("a2", Nodes[0]); in TEST()
165 EXPECT_EQ("b2", Nodes[1]); in TEST()
166 EXPECT_EQ("c3", Nodes[2]); in TEST()
167 Nodes.clear(); in TEST()
175 Nodes.push_back(N.getFunction().getName()); in TEST()
176 std::sort(Nodes.begin(), Nodes.end()); in TEST()
177 EXPECT_EQ("b2", Nodes[0]); in TEST()
[all …]
|
| /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/llvm/include/llvm/Analysis/ |
| D | CallGraphSCCPass.h | 85 std::vector<CallGraphNode*> Nodes; variable
91 Nodes.assign(I, E); in initialize()
94 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
95 unsigned size() const { return Nodes.size(); } in size()
102 iterator begin() const { return Nodes.begin(); } in begin()
103 iterator end() const { return Nodes.end(); } in end()
|
| D | 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]; }
232 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) -
233 Nodes.begin();
[all …]
|
| D | Interval.h | 48 Nodes.push_back(Header); in Interval()
55 std::vector<BasicBlock*> Nodes; variable
70 for (unsigned i = 0; i < Nodes.size(); ++i) in contains()
71 if (Nodes[i] == BB) return true; in contains()
|
| D | IntervalIterator.h | 69 Int->Nodes.push_back(BB); in addNodeToInterval()
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end()); in addNodeToInterval()
|
| D | LazyCallGraph.h | 216 SmallVector<Node *, 1> Nodes; variable
231 iterator begin() const { return Nodes.begin(); } in begin()
232 iterator end() const { return Nodes.end(); } in end()
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchFinder.h | 76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member
268 Nodes.push_back(Result.Nodes); in run()
270 SmallVector<BoundNodes, 1> Nodes; variable
282 return std::move(Callback.Nodes); in match()
|
| /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()
|
| D | JSONCompilationDatabase.cpp | 214 nodeToCommandLine(const std::vector<llvm::yaml::ScalarNode *> &Nodes) { in nodeToCommandLine() argument
216 if (Nodes.size() == 1) { in nodeToCommandLine()
217 return unescapeCommandLine(Nodes[0]->getValue(Storage)); in nodeToCommandLine()
220 for (auto *Node : Nodes) { in nodeToCommandLine()
|
| /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/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 184 NodeVector Nodes; variable
195 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
196 return Nodes[NId]; in getNode()
199 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
200 return Nodes[NId]; in getNode()
211 Nodes[NId] = std::move(N); in addConstructedNode()
213 NId = Nodes.size(); in addConstructedNode()
214 Nodes.push_back(std::move(N)); in addConstructedNode()
255 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
308 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
[all …]
|
| /external/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 73 BoundNodesTreeBuilder Nodes; member
393 *Builder = I->second.Nodes; in memoizedMatchesRecursively()
398 Result.Nodes = *Builder; in memoizedMatchesRecursively()
399 Result.ResultOfMatch = matchesRecursively(Node, Matcher, &Result.Nodes, in memoizedMatchesRecursively()
405 *Builder = CachedResult.Nodes; in memoizedMatchesRecursively()
628 *Builder = I->second.Nodes; in memoizedMatchesAncestorOfRecursively()
634 Result.Nodes = *Builder; in memoizedMatchesAncestorOfRecursively()
641 if (Matcher.matches(Parent, this, &Result.Nodes)) { in memoizedMatchesAncestorOfRecursively()
646 Result.Nodes = *Builder; in memoizedMatchesAncestorOfRecursively()
648 Parent, Matcher, &Result.Nodes, MatchMode); in memoizedMatchesAncestorOfRecursively()
[all …]
|
| /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 __anonae14147c0111::HexagonCommonGEP
355 Nodes.push_back(N); in processGepInst()
370 Nodes.push_back(Nx); in processGepInst()
409 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
414 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
417 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
428 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) { in nodes_for_root() argument
431 Nodes.insert(Root); in nodes_for_root()
440 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
521 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CallGraph.cpp | 111 SmallVector<CallGraphNode *, 16> Nodes; in print() local
112 Nodes.reserve(FunctionMap.size()); in print()
115 Nodes.push_back(I->second.get()); in print()
117 std::sort(Nodes.begin(), Nodes.end(), in print()
126 for (CallGraphNode *CN : Nodes) in print()
|
| D | BlockFrequencyInfoImpl.cpp | 373 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
479 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
566 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
567 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
579 for (auto &I : Nodes) in indexNodes()
696 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
728 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
729 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
732 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
749 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()
|
| D | Interval.cpp | 45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(), in print()
46 E = Nodes.end(); I != E; ++I) in print()
|
| D | LazyCallGraph.cpp | 161 Nodes.push_back(&N); in insert()
290 unsigned NewNodeBeginIdx = Nodes.size(); in insertIncomingEdge()
306 Nodes.push_back(N); in insertIncomingEdge()
308 C->Nodes.clear(); in insertIncomingEdge()
310 for (auto I = Nodes.begin() + NewNodeBeginIdx, E = Nodes.end(); I != E; ++I) in insertIncomingEdge()
471 Worklist.swap(Nodes); in removeIntraSCCEdge()
503 for (Node *N : Nodes) { in removeIntraSCCEdge()
598 for (Node *SCCN : NewSCC->Nodes) in formSCC()
|
| D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 265 llvm::FoldingSet<ExplodedNode> Nodes; variable
334 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin()
336 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
338 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin()
340 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end()
374 trim(ArrayRef<const NodeTy *> Nodes,
|
| /external/llvm/lib/IR/ |
| D | AttributeImpl.h | 269 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) { in Profile()
270 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { in Profile()
271 ID.AddInteger(Nodes[i].first); in Profile()
272 ID.AddPointer(Nodes[i].second); in Profile()
|
| /external/ImageMagick/MagickCore/ |
| D | histogram.c | 95 } Nodes; typedef
115 Nodes
390 register Nodes in DestroyCubeInfo()
400 cube_info->node_queue=(Nodes *) in DestroyCubeInfo()
403 } while (cube_info->node_queue != (Nodes *) NULL); in DestroyCubeInfo()
587 Nodes in GetNodeInfo()
593 nodes=(Nodes *) AcquireMagickMemory(sizeof(*nodes)); in GetNodeInfo()
594 if (nodes == (Nodes *) NULL) in GetNodeInfo()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | ExplodedGraph.cpp | 175 Nodes.RemoveNode(node); in collectNode()
310 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos); in getNode()
328 Nodes.InsertNode(V, InsertPos); in getNode()
344 if (Nodes.empty()) in trim()
|
| /external/jsoncpp/include/json/ |
| D | reader.h | 230 typedef std::stack<Value*> Nodes; typedef
231 Nodes nodes_;
|