| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 94 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
97 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
115 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
132 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
136 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
142 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
148 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
160 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
165 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
170 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| D | ASTDumper.cpp | 340 void VisitLambdaExpr(const LambdaExpr *Node) { in VisitLambdaExpr()
1523 void ASTDumper::VisitStmt(const Stmt *Node) { in VisitStmt()
1532 void ASTDumper::VisitDeclStmt(const DeclStmt *Node) { in VisitDeclStmt()
1543 void ASTDumper::VisitAttributedStmt(const AttributedStmt *Node) { in VisitAttributedStmt()
1554 void ASTDumper::VisitLabelStmt(const LabelStmt *Node) { in VisitLabelStmt()
1559 void ASTDumper::VisitGotoStmt(const GotoStmt *Node) { in VisitGotoStmt()
1565 void ASTDumper::VisitCXXCatchStmt(const CXXCatchStmt *Node) { in VisitCXXCatchStmt()
1574 void ASTDumper::VisitExpr(const Expr *Node) { in VisitExpr()
1613 static void dumpBasePath(raw_ostream &OS, const CastExpr *Node) { in dumpBasePath()
1638 void ASTDumper::VisitCastExpr(const CastExpr *Node) { in VisitCastExpr()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | ilistTest.cpp | 20 struct Node : ilist_node<Node> { struct
21 int Value;
23 Node() {} in Node() argument
24 Node(int _Value) : Value(_Value) {} in Node() argument
25 ~Node() { Value = -1; } in ~Node()
|
| /external/skia/src/core/ |
| D | SkQuadTree.h | 85 struct Node { struct
86 Node() { in Node() argument
94 Node* fChildren[kChildCount]; argument
|
| D | SkPictureStateTree.h | 142 struct Node { struct
143 Node* fParent; argument
154 Node fRoot; argument
|
| D | SkRTree.h | 117 struct Node { struct
118 uint16_t fNumChildren;
119 uint16_t fLevel;
120 bool isLeaf() { return 0 == fLevel; } in isLeaf()
123 Branch* child(size_t index) { in child()
|
| /external/libcxx/test/containers/associative/ |
| D | tree_right_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node() : __left_(), __right_(), __parent_() {} in Node() argument
|
| D | tree_left_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node() : __left_(), __right_(), __parent_() {} in Node() argument
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | collection.h | 40 struct Node { // Trie node struct
41 I node_id; // Root is kNoNodeId; argument
44 Node() : node_id(kNoNodeId), element(T()) {} in Node() function
45 Node(I i, const T &t) : node_id(i), element(t) {} in Node() function
|
| /external/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 93 struct SpillPlacement::Node { struct in SpillPlacement
95 BlockFrequency BiasN;
97 BlockFrequency BiasP;
102 int Value;
104 typedef SmallVector<std::pair<BlockFrequency, unsigned>, 4> LinkVector;
108 LinkVector Links;
111 BlockFrequency SumLinkWeights;
114 bool preferReg() const { in preferReg()
120 bool mustSpill() const { in mustSpill()
129 void clear() { in clear()
[all …]
|
| D | MachinePassRegistry.cpp | 36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) { in Add()
47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) { in Remove()
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkPictureStateTree.h | 144 struct Node { struct
145 Node* fParent; argument
156 Node fRoot; argument
|
| D | SkRTree.h | 117 struct Node { struct
118 uint16_t fNumChildren;
119 uint16_t fLevel;
120 bool isLeaf() { return 0 == fLevel; } in isLeaf()
123 Branch* child(size_t index) { in child()
|
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| D | p3.cpp | 4 template<typename T> struct Node { struct
8 Node<T> n[1]; in splay() argument
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 65 void addNode(StringRef ID, const T* Node) { in addNode()
129 template <typename T> void setBinding(const std::string &Id, const T *Node) { in setBinding()
195 bool matches(const T &Node, in matches()
237 bool matches(const T &Node, in matches()
268 bool matches(const QualType &Node, ASTMatchFinder *Finder, in matches()
287 bool matches(const T &Node, ASTMatchFinder *Finder, in matches()
416 if (const T *Node = DynNode.get<T>()) { in matches() local
529 bool matchesNode(const T &Node) const override { in matchesNode()
538 bool matchesSpecialized(const CXXOperatorCallExpr &Node) const { in matchesSpecialized()
544 bool matchesSpecialized(const CXXMethodDecl &Node) const { in matchesSpecialized()
[all …]
|
| D | ASTMatchFinder.h | 159 template <typename T> void match(const T &Node, ASTContext &Context) { in match()
222 if (NodeT *Node = I->getNodeAs<NodeT>(BoundTo)) in selectFirst() local
240 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, in match()
251 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
|
| /external/chromium_org/cc/resources/ |
| D | task_graph_runner.h | 43 struct Node { struct
46 explicit TaskComparator(const Task* task) : task_(task) {} in TaskComparator()
48 bool operator()(const Node& node) const { return node.task == task_; } in operator()
54 typedef std::vector<Node> Vector;
56 Node(Task* task, unsigned priority, size_t dependencies) in Node() argument
59 Task* task;
60 unsigned priority;
61 size_t dependencies;
|
| /external/chromium_org/chrome/browser/sync_file_system/ |
| D | subtree_set.h | 39 struct Node { struct
43 Node(); argument
|
| /external/llvm/include/llvm/Support/ |
| D | GraphWriter.h | 70 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
148 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
152 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
156 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
160 void writeNode(NodeType& Node) { in writeNode()
164 void writeNode(NodeType *const *Node) { in writeNode()
168 void writeNode(NodeType *Node) { in writeNode()
239 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
|
| /external/clang/unittests/AST/ |
| D | MatchVerifier.h | 58 const NodeType &Node) {} in verify()
118 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run() local
155 void verify(const MatchFinder::MatchResult &Result, const NodeType &Node) { in verify()
170 virtual SourceLocation getLocation(const NodeType &Node) { in getLocation()
194 void verify(const MatchFinder::MatchResult &Result, const NodeType &Node) { in verify()
216 virtual SourceRange getRange(const NodeType &Node) { in getRange()
233 const ast_type_traits::DynTypedNode &Node) { in verify()
260 const ast_type_traits::DynTypedNode &Node) { in verify()
|
| /external/chromium_org/net/spdy/ |
| D | spdy_priority_tree.h | 54 struct Node { struct
58 NodeId id; argument
59 NodeId parent_id; argument
66 // on calls to PropagateNodeState(node.id). argument
75 struct NodePriorityComparator { argument
173 SpdyPriorityTree<NodeId>::Node::Node() : in Node() function
|
| D | spdy_priority_forest.h | 114 struct Node { struct
115 Node() : type(ROOT_NODE), flags(0), child() { in Node() function
118 NodeType type; argument
124 NodeId child; // node ID of child (or NodeId() for no child) argument
127 typedef base::hash_map<NodeId, Node> NodeMap; argument
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 85 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin()
89 pred_iterator_ty pred_end(change_ty Node) { in pred_end()
94 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { in pred_closure_begin()
98 pred_closure_iterator_ty pred_closure_end(change_ty Node) { in pred_closure_end()
103 succ_iterator_ty succ_begin(change_ty Node) { in succ_begin()
107 succ_iterator_ty succ_end(change_ty Node) { in succ_end()
112 succ_closure_iterator_ty succ_closure_begin(change_ty Node) { in succ_closure_begin()
116 succ_closure_iterator_ty succ_closure_end(change_ty Node) { in succ_closure_end()
|
| /external/zopfli/src/zopfli/ |
| D | katajainen.c | 30 typedef struct Node Node; typedef
35 struct Node { struct
37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */ argument
46 Node* nodes; /* The pool. */ argument
|
| /external/chromium_org/courgette/ |
| D | adjustment_method.cc | 134 struct Node { struct
135 Node(LabelInfo* in_edge, Node* prev) in Node() argument
140 LabelInfo* in_edge_; //
141 Node* prev_; // Node at shorter length.
142 int count_; // Frequency of this path in Trie.
143 int length_;
144 typedef std::map<LabelInfo*, Node*> Edges;
145 Edges edges_;
146 std::vector<int> places_; // Indexes into sequence of this item.
147 std::list<Node*> edges_in_frequency_order;
[all …]
|