| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_expanded_state_tracker.h | 18 // BookmarkExpandedStateTracker is used to track a set of expanded nodes. The
19 // nodes are persisted in preferences. If an expanded node is removed from the
23 typedef std::set<const BookmarkNode*> Nodes;
29 // The set of expanded nodes.
30 void SetExpandedNodes(const Nodes& nodes);
31 Nodes GetExpandedNodes();
50 void UpdatePrefs(const Nodes& nodes);
|
| bookmark_index.h | 52 typedef std::vector<const BookmarkNode*> Nodes;
59 // Extracts |matches.nodes| into Nodes, sorts the pairs in decreasing order of
61 void SortMatches(const Matches& matches, Nodes* sorted_nodes) const;
77 // Iterates over |matches| updating each Match's nodes to contain the
78 // intersection of the Match's current nodes and the nodes at |index_i|.
86 // Match's nodes and the nodes at |index_i|. If the intersection between the
|
| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 85 std::vector<CallGraphNode*> Nodes;
90 Nodes.assign(I, E);
93 bool isSingular() const { return Nodes.size() == 1; }
94 unsigned size() const { return Nodes.size(); }
101 iterator begin() const { return Nodes.begin(); }
102 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 (unsigned i = 0; i < Nodes.size(); ++i)
71 if (Nodes[i] == BB) return true
[all...] |
| LazyCallGraph.h | 110 /// \brief A lazy iterator used for both the entry nodes and child nodes.
159 /// a callee, and facilitate iteration of child nodes in the graph.
208 /// a collection of call graph nodes. While the order of nodes in the SCC is
216 SmallVector<Node *, 1> Nodes;
231 iterator begin() const { return Nodes.begin(); }
232 iterator end() const { return Nodes.end(); }
333 /// where V is the number of nodes in this SCC and E is the number of edges
334 /// leaving the nodes in this SCC. Note that E includes both edges withi
[all...] |
| 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];
[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");
73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
75 /// \brief Contains the nodes bound on the current match.
77 /// This allows user code to easily extract matched AST nodes.
78 const BoundNodes Nodes;
232 Nodes.push_back(Result.Nodes);
234 SmallVector<BoundNodes, 1> Nodes;
246 return Callback.Nodes;
[all...] |
| /external/chromium_org/third_party/cython/src/Cython/Compiler/Tests/ |
| TestTreePath.py | 5 from Cython.Compiler import Nodes, ExprNodes
54 self.assertEquals(Nodes.ReturnStatNode,
62 self.assertEquals(Nodes.ReturnStatNode,
|
| /external/chromium_org/ui/gfx/geometry/ |
| r_tree_base.h | 8 // internal objects of an RTree, namely Nodes (internal nodes of the tree) and
32 typedef ScopedVector<NodeBase> Nodes;
37 // Protected data structure class for storing internal Nodes or leaves with
56 // Returns -1 for Records, or the height of this subtree for Nodes. The
63 // recursively on our parent so that ultimately all nodes up to the root
124 // this Node as its sole child. Valid to call only on root Nodes, meaning
125 // Nodes with |parent_| NULL. Note that ownership of this Node is
130 // the supplied list. Does not repair bounds upon completion. Nodes are
136 // nodes that have exceeded the maximum number of children during an Insert
[all...] |
| /external/jsoncpp/include/json/ |
| reader.h | 171 typedef std::stack<Value *> Nodes;
172 Nodes nodes_;
|
| /external/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 127 // The order of the entry nodes should be stable w.r.t. the source order of
159 std::vector<std::string> Nodes;
162 Nodes.push_back(N.getFunction().getName());
163 std::sort(Nodes.begin(), Nodes.end());
164 EXPECT_EQ("a2", Nodes[0]);
165 EXPECT_EQ("b2", Nodes[1]);
166 EXPECT_EQ("c3", Nodes[2]);
167 Nodes.clear();
175 Nodes.push_back(N.getFunction().getName())
[all...] |
| /external/chromium_org/third_party/cython/src/Cython/Compiler/ |
| TypeInference.py | 3 import Nodes
34 if isinstance(lhs, (ExprNodes.NameNode, Nodes.PyArgDeclNode)):
|
| UtilNodes.py | 2 # Nodes used as utilities and support for transforms etc.
3 # These often make up sets including both Nodes and ExprNodes
7 import Nodes
9 from Nodes import Node
288 class LetNode(Nodes.StatNode, LetNodeMixin):
|
| Visitor.py | 10 from Cython.Compiler import Nodes
23 containing child nodes or lists of child nodes. Lists are not considered
24 part of the tree structure (i.e. contained nodes are considered direct
104 nodes = []
108 if isinstance(node, Nodes.Node):
113 nodes.append((node, method_name, pos))
116 return (last_traceback, nodes)
224 It requires the visitor methods to return the nodes which should take
232 - A list of nodes; the visited nodes will be replaced by all the nodes in th
[all...] |
| FlowControl.py | 2 cython.declare(PyrexTypes=object, ExprNodes=object, Nodes=object,
11 import Nodes
38 children set of children nodes
39 parents set of parent nodes
108 blocks set children nodes
168 """Mark position, will be used to draw graph nodes."""
[all...] |
| ModuleNode.py | 18 import Nodes
41 class ModuleNode(Nodes.Node, Nodes.BlockNode):
64 assert isinstance(self.body, Nodes.StatListNode)
65 if isinstance(tree, Nodes.StatListNode):
94 env.doc = EncodedString(u'File: %s (starting at line %s)' % Nodes.relative_position(self.pos))
648 code.put(Nodes.branch_prediction_macros)
[all...] |
| Optimize.py | 5 Nodes=object, ExprNodes=object, PyrexTypes=object, Builtin=object,
8 import Nodes
89 if_body = Nodes.StatListNode(
91 stats = [Nodes.SingleAssignmentNode(pos, lhs=result_ref, rhs=ExprNodes.BoolNode(pos, value=1)),
92 Nodes.BreakStatNode(pos)])
93 if_node = Nodes.IfStatNode(
95 if_clauses=[Nodes.IfClauseNode(pos, condition=cmp_node, body=if_body)],
100 body = Nodes.ForInStatNode(
105 else_clause=Nodes.SingleAssignmentNode(pos, lhs=result_ref, rhs=ExprNodes.BoolNode(pos, value=0))))
339 target_assign = Nodes.SingleAssignmentNode
[all...] |
| ParseTreeTransforms.py | 2 cython.declare(PyrexTypes=object, Naming=object, ExprNodes=object, Nodes=object,
10 import Nodes
45 Declaration nodes are removed after AnalyseDeclarationsTransform, so there
105 return Nodes.StatListNode(pos=node.pos, stats=[node])
127 return Nodes.StatListNode(pos=node.pos, stats=[])
161 Some nodes take compile-time arguments (currently:
202 body = Nodes.ExprStatNode(
205 body = Nodes.ReturnStatNode(
207 node.def_node = Nodes.DefNode(
221 node.def_node = Nodes.DefNode(node.pos, name=node.name
[all...] |
| Parsing.py | 8 cython.declare(Nodes=object, ExprNodes=object, EncodedString=object,
19 import Nodes
305 is_memslice = isinstance(base_type, Nodes.MemoryViewSliceTypeNode)
306 is_template = isinstance(base_type, Nodes.TemplatedTypeNode)
307 is_const = isinstance(base_type, Nodes.CConstTypeNode)
371 return Nodes.ExprStatNode(yield_expr.pos, expr=yield_expr)
943 return Nodes.ForStatNode(pos, **kw)
950 return Nodes.IfStatNode(pos,
951 if_clauses = [Nodes.IfClauseNode(pos, condition = test,
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 67 /// common case in an ExplodedGraph, where most nodes have only one
71 /// empty and no nodes may be added.
75 // for the nodes in the group.
262 /// The nodes in the simulation graph which have been
266 /// Nodes - The nodes in the graph.
267 llvm::FoldingSet<ExplodedNode> Nodes;
269 /// BVC - Allocator and context for allocating nodes and their predecessor
273 /// NumNodes - The number of nodes in the graph.
276 /// A list of recently allocated nodes that can potentially be recycled
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 10 // Implements an algorithm to efficiently search for matches on AST nodes.
13 // The general idea is to visit all AST nodes with a RecursiveASTVisitor,
47 // bound nodes before the matcher was executed.
49 // We currently only memoize on nodes whose pointers identify the
50 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
53 // FIXME: Benchmark whether memoization of non-pointer typed nodes
66 // Used to store the result of a match and possibly bound nodes.
69 BoundNodesTreeBuilder Nodes;
127 // It's OK to always overwrite the bound nodes, as if there was
374 // For AST-nodes that don't have an identity, we can't memoize
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 180 NodeVector Nodes;
190 NodeEntry& getNode(NodeId NId) { return Nodes[NId]; }
191 const NodeEntry& getNode(NodeId NId) const { return Nodes[NId]; }
201 Nodes[NId] = std::move(N);
203 NId = Nodes.size();
204 Nodes.push_back(std::move(N));
224 // Add the edge to the adjacency sets of its nodes.
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) {
292 NodeItr end() const { return NodeItr(G.Nodes.size(), G); }
293 bool empty() const { return G.Nodes.empty();
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 157 /// consist of a network of PHI nodes where the true incoming values expresses
279 /// \brief Build up the general order of nodes
283 const std::vector<RegionNode *> &Nodes = *I;
284 Order.append(Nodes.begin(), Nodes.end());
434 // Reset the visited nodes
798 /// branches and PHI nodes only have undefined conditions.
821 /// Handle a rare case where the disintegrated nodes instructions
|
| /external/llvm/lib/IR/ |
| AsmWriter.cpp | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| portcls.h | 385 const PCNODE_DESCRIPTOR* Nodes;
[all...] |
