| /external/trusty/lk/lib/binary_search_tree/hosttest/ |
| D | binary_search_tree_test.cpp | 52 static struct bst_node *bst_node(struct bst_node nodes[], size_t index[], in bst_node()
132 struct bst_node nodes[]) { in bst_test_node_num()
137 struct bst_node nodes[], size_t row, in bst_test_print_node_at()
164 static void bst_test_print_tree(struct bst_root *root, struct bst_node nodes[]) { in bst_test_print_tree()
196 struct bst_node nodes[], in bst_test_check_child()
225 struct bst_node nodes[], in bst_test_check_sub_tree()
263 static void _bst_test_check_tree(struct bst_root *root, struct bst_node nodes[], in _bst_test_check_tree()
273 struct bst_node nodes[], in bst_test_check_array()
302 #define bst_test_check(root, nodes, items...) do { \ argument
328 #define bst_test_insert_check(root, nodes, insert, items...) do { \ argument
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
64 TestList BuildList(TestNode nodes[], int n) { in BuildList()
75 TestNode nodes[10]; in TEST() local
82 TestNode nodes[10]; in TEST() local
89 TestNode nodes[10]; in TEST() local
96 TestNode nodes[10]; in TEST() local
103 TestNode nodes[10]; in TEST() local
113 TestNode nodes[10]; in TEST() local
123 TestNode nodes[10]; in TEST() local
135 TestNode nodes[10]; in TEST() local
[all …]
|
| /external/angle/third_party/spirv-tools/src/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
64 TestList BuildList(TestNode nodes[], int n) { in BuildList()
75 TestNode nodes[10]; in TEST() local
82 TestNode nodes[10]; in TEST() local
89 TestNode nodes[10]; in TEST() local
96 TestNode nodes[10]; in TEST() local
103 TestNode nodes[10]; in TEST() local
113 TestNode nodes[10]; in TEST() local
123 TestNode nodes[10]; in TEST() local
135 TestNode nodes[10]; in TEST() local
[all …]
|
| /external/deqp-deps/SPIRV-Tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
64 TestList BuildList(TestNode nodes[], int n) { in BuildList()
75 TestNode nodes[10]; in TEST() local
82 TestNode nodes[10]; in TEST() local
89 TestNode nodes[10]; in TEST() local
96 TestNode nodes[10]; in TEST() local
103 TestNode nodes[10]; in TEST() local
113 TestNode nodes[10]; in TEST() local
123 TestNode nodes[10]; in TEST() local
135 TestNode nodes[10]; in TEST() local
[all …]
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestTopologicalSort.java | 55 List<String> nodes = g.sort(); in testFairlyLargeGraph() local
69 List<String> nodes = g.sort(); in testCyclicGraph() local
83 List<String> nodes = g.sort(); in testRepeatedEdges() local
97 List<String> nodes = g.sort(); in testSimpleTokenDependence() local
111 List<String> nodes = g.sort(); in testParserLexerCombo() local
|
| /external/ltp/libs/numa/ |
| D | tst_numa.c | 20 void tst_nodemap_print_counters(struct tst_nodemap *nodes) in tst_nodemap_print_counters()
30 void tst_nodemap_reset_counters(struct tst_nodemap *nodes) in tst_nodemap_reset_counters()
40 void tst_nodemap_free(struct tst_nodemap *nodes) in tst_nodemap_free()
67 static void inc_counter(unsigned int node, struct tst_nodemap *nodes) in inc_counter()
79 void tst_nodemap_count_pages(struct tst_nodemap *nodes, in tst_nodemap_count_pages()
184 struct tst_nodemap *nodes; in tst_get_nodemap() local
|
| /external/dagger2/javatests/dagger/functional/producers/cancellation/ |
| D | ProducerTester.java | 61 void complete(String... nodes) { in complete()
74 Only assertStarted(String... nodes) { in assertStarted()
79 Only assertCancelled(String... nodes) { in assertCancelled()
84 Only assertNotStarted(String... nodes) { in assertNotStarted()
89 Only assertNotCancelled(String... nodes) { in assertNotCancelled()
100 private Only assertAboutNodes(Predicate<? super TestFuture> assertion, String... nodes) { in assertAboutNodes()
|
| /external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/cares/cares/src/lib/ |
| D | ares__addrinfo_localhost.c | 42 struct ares_addrinfo_node **nodes) in ares_append_ai_node()
100 struct ares_addrinfo_node **nodes) in ares__default_loopback_addrs()
132 struct ares_addrinfo_node **nodes) in ares__system_loopback_addrs()
205 struct ares_addrinfo_node *nodes = NULL; in ares__addrinfo_localhost() local
|
| /external/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages_support.c | 63 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes) in alloc_pages_on_nodes()
112 int nodes[num]; in alloc_pages_linear() local
153 int nodes[num]; in alloc_pages_on_node() local
169 verify_pages_on_nodes(void **pages, int *status, unsigned int num, int *nodes) in verify_pages_on_nodes()
220 int nodes[num]; in verify_pages_linear() local
252 int nodes[num]; in verify_pages_on_node() local
275 int nodes[num]; in alloc_shared_pages_on_node() local
|
| /external/dagger2/java/dagger/internal/codegen/base/ |
| D | TarjanSCCs.java | 44 ImmutableCollection<NodeT> nodes, SuccessorsFunction<NodeT> successorsFunction) { in compute()
49 private final ImmutableCollection<NodeT> nodes; field in TarjanSCCs.TarjanSCC
57 TarjanSCC(ImmutableCollection<NodeT> nodes, SuccessorsFunction<NodeT> successorsFunction) { in TarjanSCC()
|
| /external/pytorch/torch/csrc/lazy/core/ |
| D | ir_util.cpp | 50 c10::ArrayRef<const Node*> nodes, in ComputePostOrder()
62 c10::ArrayRef<const Node*> nodes) { in ComputePostOrder()
67 size_t Util::GetGraphSize(c10::ArrayRef<const Node*> nodes) { in GetGraphSize()
|
| /external/rust/android-crates-io/crates/petgraph/src/ |
| D | quickcheck.rs | 39 let nodes = usize::arbitrary(g); in arbitrary() localVariable
107 let nodes = usize::arbitrary(g); in arbitrary() localVariable
186 let nodes = usize::arbitrary(g); in arbitrary() localVariable
190 let mut nodes = (0..nodes).map(|_| N::arbitrary(g)).collect::<Vec<_>>(); in arbitrary() localVariable
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| D | State.java | 10 ArrayList nodes; field in State
12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) in State()
|
| /external/escapevelocity/src/main/java/com/google/escapevelocity/ |
| D | Node.java | 72 static Node cons(String resourceName, int lineNumber, ImmutableList<Node> nodes) { in cons()
77 private final ImmutableList<Node> nodes; field in Node.Cons
79 Cons(String resourceName, int lineNumber, ImmutableList<Node> nodes) { in Cons()
|
| D | Reparser.java | 61 private final ImmutableList<Node> nodes; field in Reparser
75 Reparser(ImmutableList<Node> nodes) { in Reparser()
79 private Reparser(ImmutableList<Node> nodes, Map<String, Macro> macros) { in Reparser()
102 private static ImmutableList<Node> removeSpaceBeforeSet(ImmutableList<Node> nodes) { in removeSpaceBeforeSet()
|
| /external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 58 static void PrintNodes(Nodes *nodes) { in PrintNodes()
75 static void PrintGCEdges(Nodes *nodes, tensorflow::GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure()
105 static void PrintGCTransitiveClosure(Nodes *nodes, in PrintGCTransitiveClosure()
120 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure()
143 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges()
173 static int RandomNode(std::mt19937 *rnd, Nodes *nodes) { in RandomNode()
196 Nodes nodes; in TEST() local
515 int32_t *nodes = new int32_t[num_nodes]; in BM_StressTest() local
538 std::vector<int32_t> nodes; in BM_ContractEdge() local
|
| /external/tensorflow/tensorflow/python/grappler/ |
| D | layout_optimizer_test.py | 207 def _assert_trans_nchw_to_nhwc(self, name, nodes): argument
210 def _assert_trans_nhwc_to_nchw(self, name, nodes): argument
213 def _assert_trans_ncdhw_to_ndhwc(self, name, nodes): argument
216 def _assert_trans_ndhwc_to_ncdhw(self, name, nodes): argument
219 def _assert_map_nhwc_to_nchw(self, name, nodes): argument
222 def _assert_map_ndhwc_to_ncdhw(self, name, nodes): argument
225 def _assert_vec_nchw_to_nhwc(self, name, nodes): argument
228 def _assert_vec_nhwc_to_nchw(self, name, nodes): argument
231 def _assert_vec_ncdhw_to_ndhwc(self, name, nodes): argument
235 def _assert_vec_ndhwc_to_ncdhw(self, name, nodes): argument
|
| /external/doclava/src/com/google/doclava/ |
| D | Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); in makeHierarchy() local
76 private static int depth(HashMap<String, TreeSet<String>> nodes, String name) { in depth()
94 private static void recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, in recurse()
|
| /external/mesa3d/src/util/tests/ |
| D | rb_tree_test.cpp | 210 struct rb_test_node nodes[ARRAY_SIZE(test_numbers)]; in TEST() local
233 struct rb_test_node nodes[100]; in TEST() local
254 struct rb_test_node nodes[3 * 33]; in TEST() local
293 struct uinterval_test_node *nodes, in validate_interval_search()
336 struct uinterval_test_node nodes[ARRAY_SIZE(test_numbers) / 2]; in TEST() local
|
| /external/openthread/tests/toranj/cli/ |
| D | test-004-scan.py | 42 def verify_scan_result_conatins_nodes(scan_result, nodes): argument
69 nodes = [node1, node2, node3, node4, node5] variable
|
| /external/yapf/third_party/yapf_third_party/_ylib2to3/ |
| D | pytree.py | 490 def match_seq(self, nodes, results=None): argument
500 def generate_matches(self, nodes): argument
685 def match_seq(self, nodes, results=None): argument
696 def generate_matches(self, nodes): argument
741 def _iterative_matches(self, nodes): argument
770 def _bare_name_matches(self, nodes): argument
786 def _recursive_matches(self, nodes, count): argument
820 def match_seq(self, nodes): argument
824 def generate_matches(self, nodes): argument
836 def generate_matches(patterns, nodes): argument
|
| /external/OpenCL-CTS/test_conformance/SVM/ |
| D | test_cross_buffer_pointers.cpp | 78 cl_int create_linked_lists_on_host(cl_command_queue cmdq, cl_mem nodes, cl_mem nodes2, cl_int ListL… in create_linked_lists_on_host()
102 cl_int verify_linked_lists_on_host(int ci, cl_command_queue cmdq, cl_mem nodes, cl_mem nodes2, cl_i… in verify_linked_lists_on_host()
158 …clMemWrapper nodes = clCreateBuffer(context, CL_MEM_USE_HOST_PTR, sizeof(Node)*ListLength*numLists… in test_svm_cross_buffer_pointers_coarse_grain() local
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | BufferedTreeNodeStream.h | 49 __strong AMutableArray *nodes; variable
68 AMutableArray *nodes; variable
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/utils/ |
| D | PositionUtils.java | 46 public static <T extends Node> void sortByBeginPosition(List<T> nodes) { in sortByBeginPosition()
50 public static <T extends Node> void sortByBeginPosition(NodeList<T> nodes) { in sortByBeginPosition()
54 …public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnot… in sortByBeginPosition()
|
| /external/rust/android-crates-io/crates/petgraph/tests/ |
| D | floyd_warshall.rs | 105 let nodes = [a, b, c, d, e, f, g, h]; in floyd_warshall_uniform_weight() localVariable
173 let nodes = [a, b, c, d]; in floyd_warshall_weighted() localVariable
241 let nodes = [a, b, c, d]; in floyd_warshall_weighted_undirected() localVariable
|