| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 95 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
98 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
116 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
133 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
137 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
143 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
149 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
161 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
166 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
171 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| D | ASTDumper.cpp | 523 void VisitLambdaExpr(const LambdaExpr *Node) { in VisitLambdaExpr()
1655 void ASTDumper::VisitStmt(const Stmt *Node) { in VisitStmt()
1664 void ASTDumper::VisitDeclStmt(const DeclStmt *Node) { in VisitDeclStmt()
1672 void ASTDumper::VisitAttributedStmt(const AttributedStmt *Node) { in VisitAttributedStmt()
1680 void ASTDumper::VisitLabelStmt(const LabelStmt *Node) { in VisitLabelStmt()
1685 void ASTDumper::VisitGotoStmt(const GotoStmt *Node) { in VisitGotoStmt()
1691 void ASTDumper::VisitCXXCatchStmt(const CXXCatchStmt *Node) { in VisitCXXCatchStmt()
1700 void ASTDumper::VisitExpr(const Expr *Node) { in VisitExpr()
1739 static void dumpBasePath(raw_ostream &OS, const CastExpr *Node) { in dumpBasePath()
1764 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() function
26 ~Node() { Value = -1; } in ~Node()
|
| /external/libcxx/test/std/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() function
|
| 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() function
|
| D | tree_remove.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node() function
|
| /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() argument
45 Node(I i, const T &t) : node_id(i), element(t) {} in Node() function
|
| /external/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 72 struct SpillPlacement::Node { struct in SpillPlacement
74 BlockFrequency BiasN;
76 BlockFrequency BiasP;
81 int Value;
83 typedef SmallVector<std::pair<BlockFrequency, unsigned>, 4> LinkVector;
87 LinkVector Links;
90 BlockFrequency SumLinkWeights;
93 bool preferReg() const { in preferReg()
99 bool mustSpill() const { in mustSpill()
108 void clear(const BlockFrequency &Threshold) { in clear()
[all …]
|
| D | MachinePassRegistry.cpp | 36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) { in Add()
47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) { in Remove()
|
| /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/llvm/include/llvm/Support/ |
| D | GraphWriter.h | 69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
147 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
151 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
155 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
159 void writeNode(NodeType& Node) { in writeNode()
163 void writeNode(NodeType *const *Node) { in writeNode()
167 void writeNode(NodeType *Node) { in writeNode()
240 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
|
| /external/skia/src/core/ |
| D | SkRTree.h | 73 struct Node { struct
79 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const; argument
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 242 bool matches(const T &Node, in matches()
449 bool matches(const T &Node, in matches()
479 bool matches(const QualType &Node, ASTMatchFinder *Finder, in matches()
594 bool matchesNode(const T &Node) const override { in matchesNode()
603 bool matchesSpecialized(const CXXOperatorCallExpr &Node) const { in matchesSpecialized()
609 bool matchesSpecialized(const FunctionDecl &Node) const { in matchesSpecialized()
657 bool matches(const T &Node, ASTMatchFinder *Finder, in matches()
674 bool matchesSpecialized(const QualType &Node, ASTMatchFinder *Finder, in matchesSpecialized()
700 bool matchesSpecialized(const TemplateSpecializationType &Node, in matchesSpecialized()
709 bool matchesSpecialized(const CallExpr &Node, ASTMatchFinder *Finder, in matchesSpecialized()
[all …]
|
| D | ASTMatchFinder.h | 183 template <typename T> void match(const T &Node, ASTContext &Context) { in match()
258 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst() local
276 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, in match()
287 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
|
| /external/clang/unittests/AST/ |
| D | MatchVerifier.h | 68 const NodeType &Node) {} in verify()
132 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run() local
170 const NodeType &Node) override { in verify()
185 virtual SourceLocation getLocation(const NodeType &Node) { in getLocation()
210 const NodeType &Node) override { in verify()
232 virtual SourceRange getRange(const NodeType &Node) { in getRange()
249 const ast_type_traits::DynTypedNode &Node) override { in verify()
276 const ast_type_traits::DynTypedNode &Node) override { in verify()
|
| /external/gemmlowp/profiling/ |
| D | profiler.h | 158 struct Node { struct
159 std::vector<Node*> children; argument
162 Node() : label(nullptr), weight(0) {} in Node() argument
163 ~Node() { in ~Node() argument
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 82 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin()
86 pred_iterator_ty pred_end(change_ty Node) { in pred_end()
91 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { in pred_closure_begin()
95 pred_closure_iterator_ty pred_closure_end(change_ty Node) { in pred_closure_end()
100 succ_iterator_ty succ_begin(change_ty Node) { in succ_begin()
104 succ_iterator_ty succ_end(change_ty Node) { in succ_end()
109 succ_closure_iterator_ty succ_closure_begin(change_ty Node) { in succ_closure_begin()
113 succ_closure_iterator_ty succ_closure_end(change_ty Node) { in succ_closure_end()
|
| /external/v8/include/ |
| D | v8-profiler.h | 449 struct Node { struct
454 Local<String> name;
460 Local<String> script_name;
466 int script_id;
490 std::vector<Node*> children; argument
500 * empty JS call-stack. The lifetime of the returned Node* is scoped to the argument
|
| /external/llvm/include/llvm/Analysis/ |
| D | DominanceFrontierImpl.h | 38 const DomTreeNodeT *Node; variable
52 BlockT *Node) { in addToFrontier()
60 BlockT *Node) { in removeFromFrontier()
75 BlockT *Node = *I++; in compareDomSet() local
103 BlockT *Node = I->first; in compare() local
154 const DomTreeNodeT *Node) { in calculate()
|
| D | RegionIterator.h | 53 PointerIntPair<NodeType*, 2, ItMode> Node; variable
164 NodeType* Node; variable
236 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_begin(NodeType* Node) { in succ_begin()
241 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_end(NodeType* Node) { in succ_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/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 61 ast_type_traits::DynTypedNode Node; member
245 bool match(const T &Node) { in match()
272 bool traverse(const T &Node) { in traverse()
376 bool memoizedMatchesRecursively(const ast_type_traits::DynTypedNode &Node, in memoizedMatchesRecursively()
410 bool matchesRecursively(const ast_type_traits::DynTypedNode &Node, in matchesRecursively()
424 bool matchesChildOf(const ast_type_traits::DynTypedNode &Node, in matchesChildOf()
435 bool matchesDescendantOf(const ast_type_traits::DynTypedNode &Node, in matchesDescendantOf()
445 bool matchesAncestorOf(const ast_type_traits::DynTypedNode &Node, in matchesAncestorOf()
459 void match(const ast_type_traits::DynTypedNode &Node) { in match()
478 template <typename T> void match(const T &Node) { in match()
[all …]
|
| /external/kernel-headers/original/uapi/linux/ |
| D | zorro.h | 65 struct Node { struct
66 __be32 ln_Succ; /* Pointer to next (successor) */
67 __be32 ln_Pred; /* Pointer to previous (predecessor) */
68 __u8 ln_Type;
69 __s8 ln_Pri; /* Priority, for sorting */
70 __be32 ln_Name; /* ID string, null terminated */
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | Node.java | 27 public abstract class Node { class
37 protected Node(NodeId id, Object source) { in Node() method in Node
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.h | 55 static bool isPassiveNode(SDNode *Node) { in isPassiveNode()
130 const SDNode *Node; variable
|