| /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 | 517 void VisitLambdaExpr(const LambdaExpr *Node) { in VisitLambdaExpr()
1601 void ASTDumper::VisitStmt(const Stmt *Node) { in VisitStmt()
1610 void ASTDumper::VisitDeclStmt(const DeclStmt *Node) { in VisitDeclStmt()
1618 void ASTDumper::VisitAttributedStmt(const AttributedStmt *Node) { in VisitAttributedStmt()
1626 void ASTDumper::VisitLabelStmt(const LabelStmt *Node) { in VisitLabelStmt()
1631 void ASTDumper::VisitGotoStmt(const GotoStmt *Node) { in VisitGotoStmt()
1637 void ASTDumper::VisitCXXCatchStmt(const CXXCatchStmt *Node) { in VisitCXXCatchStmt()
1646 void ASTDumper::VisitExpr(const Expr *Node) { in VisitExpr()
1685 static void dumpBasePath(raw_ostream &OS, const CastExpr *Node) { in dumpBasePath()
1710 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() function
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() argument
|
| D | tree_balance_after_insert.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 | 73 struct SpillPlacement::Node { struct in SpillPlacement
75 BlockFrequency BiasN;
77 BlockFrequency BiasP;
82 int Value;
84 typedef SmallVector<std::pair<BlockFrequency, unsigned>, 4> LinkVector;
88 LinkVector Links;
91 BlockFrequency SumLinkWeights;
94 bool preferReg() const { in preferReg()
100 bool mustSpill() const { in mustSpill()
109 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/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 241 bool matches(const T &Node, in matches()
447 bool matches(const T &Node, in matches()
477 bool matches(const QualType &Node, ASTMatchFinder *Finder, in matches()
592 bool matchesNode(const T &Node) const override { in matchesNode()
601 bool matchesSpecialized(const CXXOperatorCallExpr &Node) const { in matchesSpecialized()
607 bool matchesSpecialized(const FunctionDecl &Node) const { in matchesSpecialized()
655 bool matches(const T &Node, ASTMatchFinder *Finder, in matches()
672 bool matchesSpecialized(const QualType &Node, ASTMatchFinder *Finder, in matchesSpecialized()
684 bool matchesSpecialized(const TemplateSpecializationType &Node, in matchesSpecialized()
693 bool matchesSpecialized(const CallExpr &Node, ASTMatchFinder *Finder, in matchesSpecialized()
[all …]
|
| D | ASTMatchFinder.h | 182 template <typename T> void match(const T &Node, ASTContext &Context) { in match()
257 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst() local
275 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, in match()
286 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
|
| /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()
238 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<unsigned>* results) const; argument
|
| /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/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/llvm/include/llvm/Analysis/ |
| D | DominanceFrontierImpl.h | 36 const DomTreeNodeT *Node; variable
50 BlockT *Node) { in addToFrontier()
58 BlockT *Node) { in removeFromFrontier()
73 BlockT *Node = *I++; in compareDomSet() local
101 BlockT *Node = I->first; in compare() local
152 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
248 bool match(const T &Node) { in match()
275 bool traverse(const T &Node) { in traverse()
379 bool memoizedMatchesRecursively(const ast_type_traits::DynTypedNode &Node, in memoizedMatchesRecursively()
413 bool matchesRecursively(const ast_type_traits::DynTypedNode &Node, in matchesRecursively()
427 bool matchesChildOf(const ast_type_traits::DynTypedNode &Node, in matchesChildOf()
438 bool matchesDescendantOf(const ast_type_traits::DynTypedNode &Node, in matchesDescendantOf()
448 bool matchesAncestorOf(const ast_type_traits::DynTypedNode &Node, in matchesAncestorOf()
462 void match(const ast_type_traits::DynTypedNode &Node) { in match()
481 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/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.h | 55 static bool isPassiveNode(SDNode *Node) { in isPassiveNode()
135 const SDNode *Node; variable
|
| D | InstrEmitter.cpp | 44 unsigned InstrEmitter::CountResults(SDNode *Node) { in CountResults()
60 static unsigned countOperands(SDNode *Node, unsigned NumExpUses, in countOperands()
86 EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone, bool IsCloned, in EmitCopyFromReg()
190 unsigned InstrEmitter::getDstOfOnlyCopyToRegUse(SDNode *Node, in getDstOfOnlyCopyToRegUse()
206 void InstrEmitter::CreateVirtualRegisters(SDNode *Node, in CreateVirtualRegisters()
466 void InstrEmitter::EmitSubregNode(SDNode *Node, in EmitSubregNode()
584 InstrEmitter::EmitCopyToRegClassNode(SDNode *Node, in EmitCopyToRegClassNode()
604 void InstrEmitter::EmitRegSequence(SDNode *Node, in EmitRegSequence()
669 SDNode *Node = SD->getSDNode(); in EmitDbgValue() local
719 EmitMachineNode(SDNode *Node, bool IsClone, bool IsCloned, in EmitMachineNode()
[all …]
|
| /external/clang/test/CodeGenCXX/ |
| D | constructor-template.cpp | 28 template <typename T> class Node { class
31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined. in Node() function in Node
|