Searched refs:nodeB (Results 1 – 4 of 4) 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()
331 else if (nodeB == -1) in setup()
332 nodeB = 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 | 163 AccessibilityNodeInfo nodeB = AccessibilityNodeInfo.obtain(); in equalsTest_unrelatedNodesAreUnequal() local
165 shadowOf(nodeB).setText("test"); in equalsTest_unrelatedNodesAreUnequal()
167 assertThat(nodeA).isNotEqualTo(nodeB); in equalsTest_unrelatedNodesAreUnequal()
174 AccessibilityNodeInfo nodeB = AccessibilityNodeInfo.obtain(view); in equalsTest_nodesFromTheSameViewAreEqual() local
176 shadowOf(nodeB).setText("tomatoe"); in equalsTest_nodesFromTheSameViewAreEqual()
178 assertThat(nodeA).isEqualTo(nodeB); in equalsTest_nodesFromTheSameViewAreEqual()
186 AccessibilityNodeInfo nodeB = AccessibilityNodeInfo.obtain(viewB); in equalsTest_nodesFromDifferentViewsAreNotEqual() local
188 shadowOf(nodeB).setText("test"); in equalsTest_nodesFromDifferentViewsAreNotEqual()
190 assertThat(nodeA).isNotEqualTo(nodeB); in equalsTest_nodesFromDifferentViewsAreNotEqual()
|
| /external/skqp/tests/ |
| D | IncrTopoSortTest.cpp | 326 Node* nodeB = g.addNode('b'); in test_1() local
336 g.addEdge(nodeA, nodeB); in test_1()
423 Node* nodeB = g.addNode('b'); in test_diamond() local
427 dependedOn.push_back(nodeB); in test_diamond()
434 g.addEdge(nodeA, nodeB); // node A must come before node B in test_diamond()
468 Node* nodeB = g.addNode('b'); in test_lopsided_binary_tree() local
476 g.addEdge(nodeA, nodeB); in test_lopsided_binary_tree()
|
| /external/skia/tests/ |
| D | IncrTopoSortTest.cpp | 326 Node* nodeB = g.addNode('b'); in test_1() local
336 g.addEdge(nodeA, nodeB); in test_1()
423 Node* nodeB = g.addNode('b'); in test_diamond() local
427 dependedOn.push_back(nodeB); in test_diamond()
434 g.addEdge(nodeA, nodeB); // node A must come before node B in test_diamond()
468 Node* nodeB = g.addNode('b'); in test_lopsided_binary_tree() local
476 g.addEdge(nodeA, nodeB); in test_lopsided_binary_tree()
|