| /external/syzkaller/pkg/ast/ |
| D | walk.go | 8 func (desc *Description) Walk(cb func(Node)) {
14 func Recursive(cb func(Node)) func(Node) {
23 func (n *NewLine) Walk(cb func(Node)) {}
24 func (n *Comment) Walk(cb func(Node)) {}
25 func (n *Ident) Walk(cb func(Node)) {}
26 func (n *String) Walk(cb func(Node)) {}
27 func (n *Int) Walk(cb func(Node)) {}
29 func (n *Include) Walk(cb func(Node)) {
33 func (n *Incdir) Walk(cb func(Node)) {
37 func (n *Define) Walk(cb func(Node)) {
[all …]
|
| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 96 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
99 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
117 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
134 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
138 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
144 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
150 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
162 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
167 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
172 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| /external/libaom/libaom/tools/txfm_analyzer/ |
| D | txfm_graph.h | 15 struct Node { struct
16 Node *inNode[2]; argument
17 int inNodeNum; argument
18 int inNodeIdx[2]; argument
19 double inWeight[2];
20 double value;
21 int nodeIdx;
22 int stageIdx;
23 int visited;
|
| /external/skqp/src/sksl/ |
| D | SkSLCFGGenerator.h | 23 struct Node { struct
24 enum Kind {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, in Node() argument
36 std::unique_ptr<Expression>* expression() const { in expression()
41 void setExpression(std::unique_ptr<Expression> expr) { in setExpression()
46 std::unique_ptr<Statement>* statement() const { in statement()
51 void setStatement(std::unique_ptr<Statement> stmt) { in setStatement()
56 String description() const { in description()
88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
|
| /external/skia/src/sksl/ |
| D | SkSLCFGGenerator.h | 23 struct Node { struct
24 enum Kind {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, in Node() argument
36 std::unique_ptr<Expression>* expression() const { in expression()
41 void setExpression(std::unique_ptr<Expression> expr) { in setExpression()
46 std::unique_ptr<Statement>* statement() const { in statement()
51 void setStatement(std::unique_ptr<Statement> stmt) { in setStatement()
56 String description() const { in description()
88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
|
| /external/libcxx/test/libcxx/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* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
27 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
29 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* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
27 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
29 Node() : __left_(), __right_(), __parent_() {} in Node() function
|
| /external/swiftshader/src/Vulkan/ |
| D | VkDescriptorPool.hpp | 42 struct Node struct in vk::DescriptorPool
44 Node(VkDescriptorSet set, size_t size) : set(set), size(size) {} in Node() argument
45 bool operator<(const Node& node) const { return this->set < node.set; } in operator <()
46 bool operator==(VkDescriptorSet set) const { return this->set == set; } in operator ==()
48 VkDescriptorSet set;
49 size_t size;
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | ilistTest.cpp | 19 struct Node : ilist_node<Node> { struct
20 int Value;
22 Node() {} in Node() function
23 Node(int _Value) : Value(_Value) {} in Node() argument
|
| /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() argument
26 ~Node() { Value = -1; } in ~Node()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 79 struct SpillPlacement::Node { struct in SpillPlacement
81 BlockFrequency BiasN;
84 BlockFrequency BiasP;
89 int Value;
91 using LinkVector = SmallVector<std::pair<BlockFrequency, unsigned>, 4>;
95 LinkVector Links;
98 BlockFrequency SumLinkWeights;
101 bool preferReg() const { in preferReg()
107 bool mustSpill() const { in mustSpill()
116 void clear(const BlockFrequency &Threshold) { in clear()
[all …]
|
| /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 …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | SpillPlacement.cpp | 69 struct SpillPlacement::Node { struct in SpillPlacement
74 float Scale[2];
79 float Bias;
84 float Value;
86 typedef SmallVector<std::pair<float, unsigned>, 4> LinkVector;
93 LinkVector Links;
96 bool preferReg() const { in preferReg()
102 bool mustSpill() const { in mustSpill()
109 Node() { in Node() argument
115 void clear() { in clear()
[all …]
|
| /external/skqp/src/core/ |
| D | SkArenaAllocList.h | 51 struct Node { struct
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node() argument
55 Node* fNext = nullptr; argument
|
| D | SkRTree.h | 72 struct Node { struct
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const; argument
|
| /external/skia/src/core/ |
| D | SkArenaAllocList.h | 51 struct Node { struct
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node() function
55 Node* fNext = nullptr; argument
|
| D | SkRTree.h | 72 struct Node { struct
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const; argument
|
| /external/libchrome/base/sampling_heap_profiler/ |
| D | lock_free_address_hash_set.h | 83 struct Node { struct
84 Node() : key(0), next(0) {} in Node() argument
92 Node* FindNode(void* key) const; argument
103 inline LockFreeAddressHashSet::Node::Node(void* a_key) { in Node() function
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 99 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); } in getUnderlyingType()
101 inline QualType getUnderlyingType(const ValueDecl &Node) { in getUnderlyingType()
105 inline QualType getUnderlyingType(const TypedefNameDecl &Node) { in getUnderlyingType()
112 getFunctionProtoType(const FunctionProtoType &Node) { in getFunctionProtoType()
116 inline const FunctionProtoType *getFunctionProtoType(const FunctionDecl &Node) { in getFunctionProtoType()
299 bool matches(const T &Node, in matches()
506 bool matches(const T &Node, in matches()
536 bool matches(const QualType &Node, ASTMatchFinder *Finder, in matches()
650 bool matchesNode(const T &Node) const override { in matchesNode()
659 bool matchesSpecialized(const CXXOperatorCallExpr &Node) const { in matchesSpecialized()
[all …]
|
| /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/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | GraphWriter.h | 65 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
143 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
147 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
151 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
155 void writeNode(NodeType& Node) { in writeNode()
159 void writeNode(NodeType *const *Node) { in writeNode()
163 void writeNode(NodeType *Node) { in writeNode()
226 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
|
| /external/deqp-deps/SPIRV-Tools/source/comp/ |
| D | huffman_codec.h | 46 struct Node { struct
47 Node() {} in Node() argument
50 Node(const Val& in_value, uint32_t in_left, uint32_t in_right) in Node() function
73 CreateNode(); in HuffmanCodec() argument
|
| /external/swiftshader/third_party/SPIRV-Tools/source/comp/ |
| D | huffman_codec.h | 46 struct Node { struct
47 Node() {} in Node() function
50 Node(const Val& in_value, uint32_t in_left, uint32_t in_right) in Node() argument
73 CreateNode(); in HuffmanCodec() argument
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| D | SDNodeOrdering.h | 36 void add(const SDNode *Node, unsigned O) { in add()
39 void remove(const SDNode *Node) { in remove()
47 unsigned getOrder(const SDNode *Node) { in getOrder()
|
| /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()
|