| /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/llvm-project/clang/lib/AST/ |
| D | StmtPrinter.cpp | 151 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
155 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
175 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
192 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
196 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
202 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
208 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
220 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
225 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
230 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| /external/llvm-project/llvm/lib/BinaryFormat/ |
| D | AMDGPUMetadataVerifier.cpp | 24 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar()
45 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger()
53 msgpack::DocNode &Node, function_ref<bool(msgpack::DocNode &)> verifyNode, in verifyArray()
80 return verifyEntry(MapNode, Key, Required, [=](msgpack::DocNode &Node) { in verifyScalarEntry()
87 return verifyEntry(MapNode, Key, Required, [this](msgpack::DocNode &Node) { in verifyIntegerEntry()
92 bool MetadataVerifier::verifyKernelArgs(msgpack::DocNode &Node) { in verifyKernelArgs()
181 bool MetadataVerifier::verifyKernel(msgpack::DocNode &Node) { in verifyKernel()
206 KernelMap, ".language_version", false, [this](msgpack::DocNode &Node) { in verifyKernel()
209 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel()
212 if (!verifyEntry(KernelMap, ".args", false, [this](msgpack::DocNode &Node) { in verifyKernel()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/BinaryFormat/ |
| D | AMDGPUMetadataVerifier.cpp | 23 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar()
44 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger()
52 msgpack::DocNode &Node, function_ref<bool(msgpack::DocNode &)> verifyNode, in verifyArray()
79 return verifyEntry(MapNode, Key, Required, [=](msgpack::DocNode &Node) { in verifyScalarEntry()
86 return verifyEntry(MapNode, Key, Required, [this](msgpack::DocNode &Node) { in verifyIntegerEntry()
91 bool MetadataVerifier::verifyKernelArgs(msgpack::DocNode &Node) { in verifyKernelArgs()
199 bool MetadataVerifier::verifyKernel(msgpack::DocNode &Node) { in verifyKernel()
224 KernelMap, ".language_version", false, [this](msgpack::DocNode &Node) { in verifyKernel()
227 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel()
230 if (!verifyEntry(KernelMap, ".args", false, [this](msgpack::DocNode &Node) { in verifyKernel()
[all …]
|
| /external/llvm-project/clang/include/clang/Tooling/ASTDiff/ |
| D | ASTDiff.h | 37 struct Node { struct
38 NodeId Parent, LeftMostDescendant, RightMostDescendant; argument
40 DynTypedNode ASTNode; argument
41 SmallVector<NodeId, 4> Children; argument
44 ASTNodeKind getType() const; argument
57 NodeId getMapped(const SyntaxTree &SourceTree, NodeId Id) const; argument
73 SyntaxTree(T *Node, ASTContext &AST) in SyntaxTree()
|
| /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/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/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() 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* __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() argument
|
| /external/swiftshader/src/Vulkan/ |
| D | VkDescriptorPool.hpp | 41 struct Node struct in vk::DescriptorPool
43 Node(uint8_t *set, size_t size) in Node() argument
47 bool operator<(const Node &node) const { return set < node.set; } in operator <()
48 bool operator==(const uint8_t *other) const { return set == other; } in operator ==()
50 uint8_t *set = nullptr;
51 size_t size = 0;
|
| /external/llvm-project/libcxx/test/libcxx/containers/associative/ |
| D | tree_left_rotate.pass.cpp | 21 struct Node struct
23 Node* __left_; argument
24 Node* __right_; argument
25 Node* __parent_; argument
27 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
28 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
30 Node() : __left_(), __right_(), __parent_() {} in Node() function
|
| D | tree_right_rotate.pass.cpp | 21 struct Node struct
23 Node* __left_; argument
24 Node* __right_; argument
25 Node* __parent_; argument
27 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
28 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
30 Node() : __left_(), __right_(), __parent_() {} in Node() function
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_phi_graph.h | 63 struct Node { struct
66 std::vector<Node*> users; argument
68 std::vector<Node*> operands; argument
79 Node* CreateOrReuseNode(const HloValue& value); argument
|
| /external/llvm-project/clang/unittests/Tooling/ |
| D | ASTSelectionTest.cpp | 90 void checkNodeImpl(bool IsTypeMatched, const SelectedASTNode &Node, in checkNodeImpl()
97 void checkDeclName(const SelectedASTNode &Node, StringRef Name) { in checkDeclName()
128 const SelectedASTNode &Node; member
146 ForAllChildrenOf allChildrenOf(const SelectedASTNode &Node) { in allChildrenOf()
153 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST()
158 "void f() { }", {1, 1}, None, [](Optional<SelectedASTNode> Node) { in TEST()
177 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST()
180 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST()
185 [](Optional<SelectedASTNode> Node) { in TEST()
200 [](Optional<SelectedASTNode> Node) { in TEST()
[all …]
|
| /external/llvm-project/libcxx/test/libcxx/memory/trivial_abi/ |
| D | unique_ptr_array.pass.cpp | 24 struct Node { struct
27 explicit Node(int* ptr) : shared_val(ptr) {} in Node() argument
28 ~Node() { ++(*shared_val); } in ~Node() argument
31 __attribute__((noinline)) bool get_val(std::unique_ptr<Node[]> /*unused*/) { in get_val()
|
| D | unique_ptr_arg.pass.cpp | 23 struct Node { struct
26 explicit Node(int* ptr) : shared_val(ptr) {} in Node() function
27 ~Node() { ++(*shared_val); } in ~Node() argument
30 __attribute__((noinline)) bool get_val(std::unique_ptr<Node> /*unused*/) { in get_val()
|
| D | shared_ptr_arg.pass.cpp | 24 struct Node { struct
27 explicit Node(int* ptr) : shared_val(ptr) {} in Node() argument
28 ~Node() { ++(*shared_val); } in ~Node() argument
31 __attribute__((noinline)) bool get_val(std::shared_ptr<Node> /*unused*/) { in get_val()
|
| /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/swiftshader/third_party/llvm-10.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-project/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 75 struct SpillPlacement::Node { struct in SpillPlacement
77 BlockFrequency BiasN;
80 BlockFrequency BiasP;
85 int Value;
87 using LinkVector = SmallVector<std::pair<BlockFrequency, unsigned>, 4>;
91 LinkVector Links;
94 BlockFrequency SumLinkWeights;
97 bool preferReg() const { in preferReg()
103 bool mustSpill() const { in mustSpill()
112 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/rust/crates/grpcio-sys/grpc/src/core/ext/xds/ |
| D | xds_bootstrap.h | 52 struct Node { struct
53 std::string id;
54 std::string cluster;
55 std::string locality_region;
56 std::string locality_zone;
57 std::string locality_subzone;
58 Json metadata;
|
| /external/llvm-project/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 121 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); } in getUnderlyingType()
123 inline QualType getUnderlyingType(const ValueDecl &Node) { in getUnderlyingType()
126 inline QualType getUnderlyingType(const TypedefNameDecl &Node) { in getUnderlyingType()
129 inline QualType getUnderlyingType(const FriendDecl &Node) { in getUnderlyingType()
134 inline QualType getUnderlyingType(const CXXBaseSpecifier &Node) { in getUnderlyingType()
141 getFunctionProtoType(const FunctionProtoType &Node) { in getFunctionProtoType()
145 inline const FunctionProtoType *getFunctionProtoType(const FunctionDecl &Node) { in getFunctionProtoType()
150 inline clang::AccessSpecifier getAccessSpecifier(const Decl &Node) { in getAccessSpecifier()
154 inline clang::AccessSpecifier getAccessSpecifier(const CXXBaseSpecifier &Node) { in getAccessSpecifier()
339 bool matches(const T &Node, in matches()
[all …]
|
| /external/llvm-project/lldb/source/Symbol/ |
| D | PostfixExpression.cpp | 116 bool Visit(BinaryOpNode &binary, Node *&) override { in Visit() argument
120 bool Visit(InitialValueNode &, Node *&) override { return true; } in Visit() argument
121 bool Visit(IntegerNode &, Node *&) override { return true; } in Visit() argument
122 bool Visit(RegisterNode &, Node *&) override { return true; } in Visit() argument
134 bool Visit(UnaryOpNode &unary, Node *&) override { in Visit() argument
152 void Visit(IntegerNode &integer, Node *&) override { in Visit() argument
160 void Visit(SymbolNode &symbol, Node *&) override { in Visit() argument
179 void DWARFCodegen::Visit(BinaryOpNode &binary, Node *&) { in Visit() argument
206 void DWARFCodegen::Visit(InitialValueNode &, Node *&) { in Visit() argument
215 void DWARFCodegen::Visit(RegisterNode ®, Node *&) { in Visit() argument
[all …]
|
| /external/skia/tests/ |
| D | ArenaAllocTest.cpp | 120 struct Node { in DEF_TEST() struct
121 Node(Node* n) : next(n) { created++; } in DEF_TEST() argument
122 ~Node() { destroyed++; } in DEF_TEST()
123 Node *next; in DEF_TEST()
124 char filler[64]; in DEF_TEST()
141 struct Node { in DEF_TEST() struct
142 Node(Node* n) : next(n) { created++; } in DEF_TEST() function
143 ~Node() { in DEF_TEST()
149 Node *next; in DEF_TEST()
|