| /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/angle/third_party/vulkan-deps/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/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/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/libltpnuma/ |
| 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()
65 static void inc_counter(unsigned int node, struct tst_nodemap *nodes) in inc_counter()
77 void tst_nodemap_count_pages(struct tst_nodemap *nodes, in tst_nodemap_count_pages()
175 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/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/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/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/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 62 static void PrintNodes(Nodes *nodes) { in PrintNodes()
79 static void PrintGCEdges(Nodes *nodes, tensorflow::GraphCycles *gc) { in PrintGCEdges()
93 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure()
109 static void PrintGCTransitiveClosure(Nodes *nodes, in PrintGCTransitiveClosure()
124 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure()
147 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges()
177 static int RandomNode(std::mt19937 *rnd, Nodes *nodes) { in RandomNode()
200 Nodes nodes; in TEST() local
519 int32 *nodes = new int32[num_nodes]; in BM_StressTest() local
542 std::vector<int32> nodes; in BM_ContractEdge() local
|
| /external/tensorflow/tensorflow/python/grappler/ |
| D | layout_optimizer_test.py | 211 def _assert_trans_nchw_to_nhwc(self, name, nodes): argument
214 def _assert_trans_nhwc_to_nchw(self, name, nodes): argument
217 def _assert_trans_ncdhw_to_ndhwc(self, name, nodes): argument
220 def _assert_trans_ndhwc_to_ncdhw(self, name, nodes): argument
223 def _assert_map_nhwc_to_nchw(self, name, nodes): argument
226 def _assert_map_ndhwc_to_ncdhw(self, name, nodes): argument
229 def _assert_vec_nchw_to_nhwc(self, name, nodes): argument
232 def _assert_vec_nhwc_to_nchw(self, name, nodes): argument
235 def _assert_vec_ncdhw_to_ndhwc(self, name, nodes): argument
239 def _assert_vec_ndhwc_to_ncdhw(self, name, 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/python/cpython3/Lib/lib2to3/ |
| D | pytree.py | 479 def match_seq(self, nodes, results=None): argument
489 def generate_matches(self, nodes): argument
677 def match_seq(self, nodes, results=None): argument
688 def generate_matches(self, nodes): argument
733 def _iterative_matches(self, nodes): argument
762 def _bare_name_matches(self, nodes): argument
778 def _recursive_matches(self, nodes, count): argument
812 def match_seq(self, nodes): argument
816 def generate_matches(self, nodes): argument
828 def generate_matches(patterns, nodes): argument
|
| /external/python/cpython2/Lib/lib2to3/ |
| D | pytree.py | 513 def match_seq(self, nodes, results=None): argument
523 def generate_matches(self, nodes): argument
711 def match_seq(self, nodes, results=None): argument
722 def generate_matches(self, nodes): argument
767 def _iterative_matches(self, nodes): argument
796 def _bare_name_matches(self, nodes): argument
812 def _recursive_matches(self, nodes, count): argument
846 def match_seq(self, nodes): argument
850 def generate_matches(self, nodes): argument
862 def generate_matches(patterns, nodes): argument
|
| /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/kotlinx.coroutines/kotlinx-coroutines-core/common/src/ |
| D | Await.kt | 75 val nodes = Array(deferreds.size) { i -> in await() constant
95 …private inner class DisposeHandlersOnCancel(private val nodes: Array<AwaitAllNode>) : CancelHandle… constant in kotlinx.coroutines.AwaitAll.DisposeHandlersOnCancel
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|
| /external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST() local
|