| /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
90 Nodes.assign(I, E); in initialize()
93 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
94 unsigned size() const { return Nodes.size(); } in size()
101 iterator begin() const { return Nodes.begin(); } in begin()
102 iterator end() const { return Nodes.end(); } in end()
|
| D | BlockFrequencyInfoImpl.h | 215 NodeList Nodes; ///< Header and the members of the loop.
221 : Parent(Parent), IsPackaged(false), NumHeaders(1), Nodes(1, Header) {}
225 : Parent(Parent), IsPackaged(false), Nodes(FirstHeader, LastHeader) {
226 NumHeaders = Nodes.size();
227 Nodes.insert(Nodes.end(), FirstOther, LastOther);
231 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
233 return Node == Nodes[0];
235 BlockNode getHeader() const { return Nodes[0]; }
239 return Nodes.begin() + NumHeaders;
241 NodeList::const_iterator members_end() const { return Nodes.end(); }
[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 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes)); in addNodeToInterval()
|
| /external/chromium_org/components/bookmarks/browser/ |
| D | bookmark_expanded_state_tracker.cc | 27 void BookmarkExpandedStateTracker::SetExpandedNodes(const Nodes& nodes) { in SetExpandedNodes()
31 BookmarkExpandedStateTracker::Nodes
33 Nodes nodes; in GetExpandedNodes()
69 SetExpandedNodes(Nodes()); in BookmarkModelLoaded()
101 void BookmarkExpandedStateTracker::UpdatePrefs(const Nodes& nodes) { in UpdatePrefs()
106 for (Nodes::const_iterator i = nodes.begin(); i != nodes.end(); ++i) { in UpdatePrefs()
|
| D | bookmark_expanded_state_tracker.h | 23 typedef std::set<const BookmarkNode*> Nodes; typedef
30 void SetExpandedNodes(const Nodes& nodes);
31 Nodes GetExpandedNodes();
50 void UpdatePrefs(const Nodes& nodes);
|
| D | bookmark_index.h | 55 typedef std::vector<const BookmarkNode*> Nodes; typedef
64 void SortMatches(const Matches& matches, Nodes* sorted_nodes) const;
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchFinder.h | 73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
78 const BoundNodes Nodes; member
232 Nodes.push_back(Result.Nodes); in run()
234 SmallVector<BoundNodes, 1> Nodes; variable
246 return Callback.Nodes; in match()
|
| /external/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 69 BoundNodesTreeBuilder Nodes; member
387 *Builder = I->second.Nodes; in memoizedMatchesRecursively()
392 Result.Nodes = *Builder; in memoizedMatchesRecursively()
393 Result.ResultOfMatch = matchesRecursively(Node, Matcher, &Result.Nodes, in memoizedMatchesRecursively()
396 *Builder = Result.Nodes; in memoizedMatchesRecursively()
514 *Builder = I->second.Nodes; in memoizedMatchesAncestorOfRecursively()
519 Result.Nodes = *Builder; in memoizedMatchesAncestorOfRecursively()
523 if (Matcher.matches(Parent, this, &Result.Nodes)) { in memoizedMatchesAncestorOfRecursively()
528 Result.Nodes = *Builder; in memoizedMatchesAncestorOfRecursively()
530 Parent, Matcher, &Result.Nodes, MatchMode); in memoizedMatchesAncestorOfRecursively()
[all …]
|
| /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/chromium_org/tools/clang/empty_string/ |
| D | EmptyStringConverter.cpp | 123 result.Nodes.getNodeAs<clang::StringLiteral>("literal"); in run()
128 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call"); in run()
136 result.Nodes.getNodeAs<clang::StringLiteral>("literal"); in run()
141 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call"); in run()
147 result.Nodes.getNodeAs<clang::StringLiteral>("literal"); in run()
152 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call"); in run()
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
333 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
347 if (Nodes == 0) in adjustSiblingSizes()
351 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
354 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
366 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
404 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1170 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1173 unsigned size[Nodes]; in branchRoot()
1177 if (Nodes == 1) in branchRoot()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 102 NodeType Nodes[N]; member in llvm::Graph
110 Nodes[i].first = i; in Graph()
117 Nodes[FromIdx].second.AddNode(ToIdx); in AddEdge()
124 Nodes[FromIdx].second.DeleteNode(ToIdx); in DeleteEdge()
132 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
150 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
|
| /external/chromium_org/tools/clang/rewrite_scoped_ptr_ctor_null/ |
| D | RewriteScopedPtrCtorNull.cpp | 124 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg"); in run()
129 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call"); in run()
136 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg"); in run()
141 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call"); in run()
146 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg"); in run()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 180 NodeVector Nodes; variable
190 NodeEntry& getNode(NodeId NId) { return Nodes[NId]; } in getNode()
191 const NodeEntry& getNode(NodeId NId) const { return Nodes[NId]; } in getNode()
201 Nodes[NId] = std::move(N); in addConstructedNode()
203 NId = Nodes.size(); in addConstructedNode()
204 Nodes.push_back(std::move(N)); in addConstructedNode()
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
292 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
293 bool empty() const { return G.Nodes.empty(); } in empty()
295 return G.Nodes.size() - G.FreeNodeIds.size(); in size()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | BlockFrequencyInfoImpl.cpp | 368 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
465 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
545 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
546 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
558 for (auto &I : Nodes) in indexNodes()
674 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
705 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
706 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
709 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
|
| 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 | 267 llvm::FoldingSet<ExplodedNode> Nodes; variable
336 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin()
338 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
340 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin()
342 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end()
375 ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes,
|
| /external/chromium_org/ui/gfx/geometry/ |
| D | r_tree_base.h | 32 typedef ScopedVector<NodeBase> Nodes; typedef
137 void RemoveNodesForReinsert(size_t number_to_remove, Nodes* nodes);
144 scoped_ptr<NodeBase> RemoveChild(NodeBase* child_node, Nodes* orphans);
264 Nodes children_;
|
| D | r_tree_base.cc | 106 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i) in AppendIntersectingRecords()
111 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i) in AppendAllRecords()
116 Nodes* nodes) { in RemoveNodesForReinsert()
131 NodeBase* child_node, Nodes* orphans) { in RemoveChild()
140 Nodes::iterator i = std::find(children_.begin(), children_.end(), child_node); in RemoveChild()
171 for (Nodes::iterator i = children_.begin(); i != children_.end(); ++i) in ChooseSubtree()
422 for (Nodes::const_iterator it = children_.begin(); in OverlapIncreaseToAdd()
549 Nodes reinserts; in InsertNode()
590 Nodes::iterator last_element = reinserts.end() - 1; in InsertNode()
606 Nodes orphans; in RemoveNode()
[all …]
|
| /external/llvm/lib/IR/ |
| D | AttributeImpl.h | 255 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) { in Profile()
256 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { in Profile()
257 ID.AddInteger(Nodes[i].first); in Profile()
258 ID.AddPointer(Nodes[i].second); in Profile()
|