| /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/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/spdx-tools/rdfloader/parser2v3/ |
| D | parse_license.go | 20 func (parser *rdfParser2_3) getAnyLicenseFromNode(node *gordfParser.Node) (AnyLicenseInfo, error) {
73 func (parser *rdfParser2_3) getLicenseExceptionFromNode(node *gordfParser.Node) (exception LicenseE…
102 func (parser *rdfParser2_3) getSimpleLicensingInfoFromNode(node *gordfParser.Node) (SimpleLicensing…
107 func (parser *rdfParser2_3) getWithExceptionOperatorFromNode(node *gordfParser.Node) (operator With…
137 func (parser *rdfParser2_3) getOrLaterOperatorFromNode(node *gordfParser.Node) (operator OrLaterOpe…
162 func (parser *rdfParser2_3) getSpecialLicenseFromNode(node *gordfParser.Node) (lic SpecialLicense, …
188 func (parser *rdfParser2_3) getDisjunctiveLicenseSetFromNode(node *gordfParser.Node) (DisjunctiveLi…
207 func (parser *rdfParser2_3) getConjunctiveLicenseSetFromNode(node *gordfParser.Node) (ConjunctiveLi…
253 func (parser *rdfParser2_3) getLicenseFromNode(node *gordfParser.Node) (lic License, err error) {
|
| /external/spdx-tools/rdfloader/parser2v2/ |
| D | parse_license.go | 20 func (parser *rdfParser2_2) getAnyLicenseFromNode(node *gordfParser.Node) (AnyLicenseInfo, error) {
73 func (parser *rdfParser2_2) getLicenseExceptionFromNode(node *gordfParser.Node) (exception LicenseE…
102 func (parser *rdfParser2_2) getSimpleLicensingInfoFromNode(node *gordfParser.Node) (SimpleLicensing…
107 func (parser *rdfParser2_2) getWithExceptionOperatorFromNode(node *gordfParser.Node) (operator With…
137 func (parser *rdfParser2_2) getOrLaterOperatorFromNode(node *gordfParser.Node) (operator OrLaterOpe…
162 func (parser *rdfParser2_2) getSpecialLicenseFromNode(node *gordfParser.Node) (lic SpecialLicense, …
188 func (parser *rdfParser2_2) getDisjunctiveLicenseSetFromNode(node *gordfParser.Node) (DisjunctiveLi…
207 func (parser *rdfParser2_2) getConjunctiveLicenseSetFromNode(node *gordfParser.Node) (ConjunctiveLi…
253 func (parser *rdfParser2_2) getLicenseFromNode(node *gordfParser.Node) (lic License, err error) {
|
| /external/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_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
|
| 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
|
| /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/cronet/buildtools/third_party/libc++/trunk/test/libcxx/containers/associative/ |
| 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() argument
|
| 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
|
| /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/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-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/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/cronet/buildtools/third_party/libc++/trunk/test/libcxx/memory/trivial_abi/ |
| D | unique_ptr_array.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 | unique_ptr_arg.pass.cpp | 22 struct Node { struct
25 explicit Node(int* ptr) : shared_val(ptr) {} in Node() argument
26 ~Node() { ++(*shared_val); } in ~Node() argument
29 __attribute__((noinline)) bool get_val(std::unique_ptr<Node> /*unused*/) { in get_val()
|
| D | shared_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::shared_ptr<Node> /*unused*/) { in get_val()
|
| /external/cronet/net/tools/dafsa/ |
| D | make_dafsa.py | 206 Node = Union[SinkNode, InteriorNode, SourceNode] variable
233 def to_words(node: Node) -> Iterable[str]:
247 def dfs(node: Node, parent: Node) -> None:
274 def count_parents(node: Node) -> None:
284 def join(node: Node) -> Node:
310 def join(node: Node) -> Node:
330 def count_incoming(node: Node) -> None:
364 def encode_links(children: Sequence[Node], offsets: Dict[int, int],
|
| /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_sub_zone;
58 Json metadata;
|
| /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/cronet/base/allocator/partition_allocator/starscan/ |
| D | raceful_worklist.h | 21 struct Node { struct
22 explicit Node(const T& value) : value(value) {} in Node() function
23 Node(const Node& other) in Node() argument
33 using Underlying = std::vector<Node, MetadataAllocator<Node>>; argument
|
| /external/skia/src/base/ |
| D | SkArenaAllocList.h | 53 struct Node { struct
55 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node() function
57 Node* fNext = nullptr; argument
|
| /external/icing/icing/result/ |
| D | projection-tree.h | 29 struct Node { struct
30 explicit Node(std::string name = "") : name(std::move(name)) {} in name() argument
33 std::vector<Node> children; argument
|
| /external/skia/tests/ |
| D | ArenaAllocTest.cpp | 126 struct Node { in DEF_TEST() struct
127 Node(Node* n) : next(n) { created++; } in DEF_TEST() argument
128 ~Node() { destroyed++; } in DEF_TEST()
129 Node *next; in DEF_TEST()
130 char filler[64]; in DEF_TEST()
149 struct Node { in DEF_TEST() struct
150 Node(Node* n) : next(n) { created++; } in DEF_TEST() argument
151 ~Node() { in DEF_TEST()
157 Node *next; in DEF_TEST()
|
| /external/ruy/ruy/profiler/ |
| D | treeview.h | 34 struct Node { struct
35 std::vector<std::unique_ptr<Node>> children; argument
45 using ThreadRootsMap = std::map<std::uint32_t, std::unique_ptr<Node>>; argument
|