| /third_party/ninja/src/ |
| D | graph.h | 39 struct Node { struct
40 Node(const std::string& path, uint64_t slash_bits) in Node() argument
63 /// Mark the Node as already-stat()ed and missing. argument
64 void MarkMissing() { in MarkMissing()
71 bool exists() const { in exists()
75 bool status_known() const { in status_known()
79 const std::string& path() const { return path_; } in path()
81 std::string PathDecanonicalized() const { in PathDecanonicalized()
86 uint64_t slash_bits() const { return slash_bits_; } in slash_bits()
88 TimeStamp mtime() const { return mtime_; } in mtime()
[all …]
|
| /third_party/skia/third_party/externals/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 …]
|
| /third_party/skia/third_party/externals/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;
|
| /third_party/rust/rust/tests/ui/regions/ |
| D | regions-free-region-ordering-incorrect.rs | 8 struct Node<'b, T: 'b> { struct
10 next: Option<&'b Node<'b, T>> argument
13 impl<'b, T> Node<'b, T> { implementation
|
| /third_party/ffmpeg/libavcodec/ |
| D | huffman.h | 33 typedef struct Node { struct
37 } Node; typedef
|
| /third_party/skia/third_party/externals/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 …]
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/mindir/include/ |
| D | mindir_lite_graph.h | 16 struct Node { struct
17 std::string name_;
18 std::string op_type_; // hnn no use
19 int node_type_; // hnn no use
20 PrimitivePtr primitive_ = nullptr;
21 std::shared_ptr<void> base_operator_ = nullptr; // hnn no use
22 std::vector<uint32_t> input_indices_;
23 std::vector<uint32_t> output_indices_;
24 int quant_type_;
25 int device_type_ = -1; // hnn no use
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/include/ |
| D | model.h | 36 struct Node { struct
37 std::string name_;
38 std::string op_type_;
39 int node_type_;
40 const void *primitive_ = nullptr;
41 std::shared_ptr<void> base_operator_ = nullptr;
42 std::vector<uint32_t> input_indices_;
43 std::vector<uint32_t> output_indices_;
44 int quant_type_;
45 int device_type_ = -1;
|
| /third_party/rust/rust/tests/incremental/const-generics/ |
| D | hash-tyvid-regression-3.rs | 5 struct Node<const D: usize> struct
12 impl<const D: usize> Node<D> implementation
|
| D | hash-tyvid-regression-4.rs | 6 struct Node<K, const D: usize> struct
13 impl<K, const D: usize> Node<K, D> argument
|
| /third_party/rust/rust/compiler/rustc_data_structures/src/graph/iterate/ |
| D | mod.rs | 11 start_node: G::Node, in post_order_from()
12 ) -> Vec<G::Node> { in post_order_from()
18 start_node: G::Node, in post_order_from_to()
19 end_node: Option<G::Node>, in post_order_from_to()
20 ) -> Vec<G::Node> { in post_order_from_to()
32 node: G::Node, in post_order_walk()
33 result: &mut Vec<G::Node>, in post_order_walk()
34 visited: &mut IndexSlice<G::Node, bool>, in post_order_walk()
65 start_node: G::Node, in reverse_post_order()
66 ) -> Vec<G::Node> { in reverse_post_order()
[all …]
|
| /third_party/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() argument
143 ~Node() { in DEF_TEST()
149 Node *next; in DEF_TEST()
|
| /third_party/mindspore/mindspore-src/source/mindspore/python/mindspore/rewrite/node/ |
| D | node_topological_manager.py | 28 def on_update_target(node: Node, index: int, old_target: ScopedValue, new_target: ScopedValue):
76 def _update_target_users_by_node(node, index, provider: Tuple[Node, int]):
114 def on_insert_node(self, node: Node):
137 def on_erase_node(self, node: Node):
175 def on_update_arg(self, node: Node, arg_idx: int, old_arg: ScopedValue, new_arg: ScopedValue):
202 def on_update_arg_by_node(self, dst_node: Node, arg_idx: int, src_node: Node, out_idx: int):
|
| D | node_manager.py | 72 def insert_node(self, new_node: Node, base_node: Node, before_node: bool):
111 def erase_node(self, node: Node):
159 def append_python_node(self, new_node: Node):
213 def on_update_arg(self, node: Node, arg_idx: int, old_arg: ScopedValue, new_arg: ScopedValue):
219 def on_update_arg_by_node(self, dst_node: Node, arg_idx: int, src_node: Node, out_idx: int):
269 def _add_node_to_nodes(self, node: Node):
|
| /third_party/skia/m133/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
|
| /third_party/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 | 60 struct Node { struct
66 void search(Node* root, const SkRect& query, std::vector<int>* results) const; argument
|
| /third_party/jinja2/ |
| D | visitor.py | 12 def __call__(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
28 def get_visitor(self, node: Node) -> "t.Optional[VisitCallable]":
35 def visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
44 def generic_visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
61 def generic_visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> Node:
83 def visit_list(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.List[Node]:
|
| /third_party/rust/rust/src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/ |
| D | highlights.rs | 13 struct Node { struct
15 nested: Vec<Node>, argument
36 impl Node { impl
37 fn new(hl_range: HlRange) -> Node { in new()
|
| /third_party/musl/libc-test/src/functionalext/supplement/search/search_gtest/ |
| D | search_tdelete_test.cpp | 11 struct Node { struct
12 explicit Node(int i) : i(i) {} in Node() function
18 return reinterpret_cast<const Node*>(rhs)->i - reinterpret_cast<const Node*>(lhs)->i; in NodeCmp() argument
|
| D | search_tfind_test.cpp | 11 struct Node { struct
12 explicit Node(int i) : i(i) {} in Node() function
18 return reinterpret_cast<const Node*>(rhs)->i - reinterpret_cast<const Node*>(lhs)->i; in NodeCmp() argument
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | TrailingPathOptimizer.java | 51 public static ValueGraph<Node, SimpleEdge> optimize(ValueGraph<Node, SimpleEdge> graph) { in optimize()
129 Node node, AnyPath path, MutableValueGraph<Node, SimpleEdge> g, Map<Node, AnyPath> anyPaths) { in recursivelyDetachTrailingPaths()
161 private static boolean beginsAnAnyPath(Node target, ValueGraph<Node, SimpleEdge> g) { in beginsAnAnyPath()
178 private static boolean canTerminate(Node node, ValueGraph<Node, SimpleEdge> g) { in canTerminate()
186 Node node, Node end, AnyPath path, Node lastAdded, MutableValueGraph<Node, SimpleEdge> out) { in addPath()
|
| /third_party/skia/m133/tests/ |
| D | ArenaAllocTest.cpp | 148 struct Node { in DEF_TEST() struct
149 Node(Node* n) : next(n) { created++; } in DEF_TEST() function
150 ~Node() { destroyed++; } in DEF_TEST()
151 Node *next; in DEF_TEST()
152 char filler[64]; in DEF_TEST()
171 struct Node { in DEF_TEST() struct
172 Node(Node* n) : next(n) { created++; } in DEF_TEST() function
173 ~Node() { in DEF_TEST()
179 Node *next; in DEF_TEST()
|
| /third_party/rust/rust/tests/ui/drop/ |
| D | issue-35546.rs | 8 struct Node<T: ?Sized + Send> { struct
9 next: Option<Box<Node<dyn Send>>>, argument
13 fn clear(head: &mut Option<Box<Node<dyn Send>>>) { in clear() argument
|
| /third_party/skia/m133/src/core/ |
| D | SkRTree.h | 64 struct Node { struct
70 void search(Node* root, const SkRect& query, std::vector<int>* results) const; argument
|