Searched refs:nodeA (Results 1 – 5 of 5) sorted by relevance
| /external/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 63 static int *nodes, nodeA, nodeB; variable
276 test_migrate_current_process(nodeA, nodeB, 1); in run()
277 test_migrate_current_process(nodeA, nodeB, 0); in run()
278 test_migrate_other_process(nodeA, nodeB, 1); in run()
279 test_migrate_other_process(nodeA, nodeB, 0); in run()
313 nodeA = nodeB = -1; in setup()
329 if (nodeA == -1) in setup()
330 nodeA = nodes[i]; in setup()
338 if (nodeA == -1 || nodeB == -1) in setup()
341 tst_res(TINFO, "Using nodes: %d %d", nodeA, nodeB); in setup()
|
| /external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/ |
| D | ShadowAccessibilityNodeInfoTest.java | 162 AccessibilityNodeInfo nodeA = AccessibilityNodeInfo.obtain(); in equalsTest_unrelatedNodesAreUnequal() local
164 shadowOf(nodeA).setText("test"); in equalsTest_unrelatedNodesAreUnequal()
167 assertThat(nodeA).isNotEqualTo(nodeB); in equalsTest_unrelatedNodesAreUnequal()
173 AccessibilityNodeInfo nodeA = AccessibilityNodeInfo.obtain(view); in equalsTest_nodesFromTheSameViewAreEqual() local
175 shadowOf(nodeA).setText("tomato"); in equalsTest_nodesFromTheSameViewAreEqual()
178 assertThat(nodeA).isEqualTo(nodeB); in equalsTest_nodesFromTheSameViewAreEqual()
185 AccessibilityNodeInfo nodeA = AccessibilityNodeInfo.obtain(viewA); in equalsTest_nodesFromDifferentViewsAreNotEqual() local
187 shadowOf(nodeA).setText("test"); in equalsTest_nodesFromDifferentViewsAreNotEqual()
190 assertThat(nodeA).isNotEqualTo(nodeB); in equalsTest_nodesFromDifferentViewsAreNotEqual()
|
| /external/skqp/tests/ |
| D | IncrTopoSortTest.cpp | 324 Node* nodeA = g.addNode('a'); in test_1() local
336 g.addEdge(nodeA, nodeB); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
433 Node* nodeA = g.addNode('a'); in test_diamond() local
434 g.addEdge(nodeA, nodeB); // node A must come before node B in test_diamond()
435 g.addEdge(nodeA, nodeC); // node A must come before node C in test_diamond()
469 Node* nodeA = g.addNode('a'); in test_lopsided_binary_tree() local
475 g.addEdge(nodeA, nodeC); in test_lopsided_binary_tree()
476 g.addEdge(nodeA, nodeB); in test_lopsided_binary_tree()
|
| /external/skia/tests/ |
| D | IncrTopoSortTest.cpp | 324 Node* nodeA = g.addNode('a'); in test_1() local
336 g.addEdge(nodeA, nodeB); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
433 Node* nodeA = g.addNode('a'); in test_diamond() local
434 g.addEdge(nodeA, nodeB); // node A must come before node B in test_diamond()
435 g.addEdge(nodeA, nodeC); // node A must come before node C in test_diamond()
469 Node* nodeA = g.addNode('a'); in test_lopsided_binary_tree() local
475 g.addEdge(nodeA, nodeC); in test_lopsided_binary_tree()
476 g.addEdge(nodeA, nodeB); in test_lopsided_binary_tree()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | function_utils_test.cc | 788 NodeDef* nodeA = graph_utils::AddNode("", "A", {}, {}, &graph); in TEST() local
798 EXPECT_TRUE(IsNodeStateful(lib_def, *nodeA)); in TEST()
|