| /art/test/1946-list-descriptors/src-art/art/ |
| D | Test1946.java | 58 private static <T> void checkEq(T[] full, T[] sub, String msg) { in checkEq() argument
59 List<T> f = Arrays.asList(full); in checkEq()
60 check(full.length == sub.length, "not equal length"); in checkEq()
61 msg = Arrays.toString(full) + " is not same as " + Arrays.toString(sub) + ": " + msg; in checkEq()
62 check(Arrays.asList(full).containsAll(Arrays.asList(sub)), msg); in checkEq()
65 private static <T> void checkSubset(T[] full, T[] sub, String msg) { in checkSubset() argument
66 msg = Arrays.toString(full) + " does not contain all of " + Arrays.toString(sub) + ": " + msg; in checkSubset()
67 check(Arrays.asList(full).containsAll(Arrays.asList(sub)), msg); in checkSubset()
|
| /art/test/021-string2/src/ |
| D | Main.java | 512 String full = p + c + s; in testIndexOf() local
516 Assert.assertEquals(expX, $noinline$indexOf(full, 'x')); in testIndexOf()
517 Assert.assertEquals(exp0440, $noinline$indexOf(full, '\u0440')); in testIndexOf()
518 Assert.assertEquals(exp0000, $noinline$indexOf(full, '\u0000')); in testIndexOf()
519 Assert.assertEquals(expX, $noinline$indexOf(full, 'x', -1)); in testIndexOf()
520 Assert.assertEquals(exp0440, $noinline$indexOf(full, '\u0440', -1)); in testIndexOf()
521 Assert.assertEquals(exp0000, $noinline$indexOf(full, '\u0000', -1)); in testIndexOf()
522 Assert.assertEquals(-1, $noinline$indexOf(full, 'x', full.length() + 1)); in testIndexOf()
523 Assert.assertEquals(-1, $noinline$indexOf(full, '\u0440', full.length() + 1)); in testIndexOf()
524 Assert.assertEquals(-1, $noinline$indexOf(full, '\u0000', full.length() + 1)); in testIndexOf()
[all …]
|
| /art/test/602-deoptimizeable/ |
| D | info.txt | 1 Test various cases for full/partial-fragment deoptimization.
|
| /art/test/080-oom-fragmentation/ |
| D | info.txt | 1 Test that the allocator can go from a full heap to an empty one and is able to allocate a large
|
| /art/test/515-dce-dominator/ |
| D | info.txt | 2 we need to recompute the full dominance information of
|
| /art/test/137-cfi/ |
| D | run | 23 --args --full-signatures --args --test-local --args --test-remote
|
| /art/test/004-checker-UnsafeTest18/src/ |
| D | Main.java | 125 private static void full() { in full() method in Main
254 full(); in main()
273 full(); in main()
279 full(); in main()
|
| /art/test/541-regression-inlined-deopt/ |
| D | info.txt | 2 stack map for deopting inlined frames. Test case is written in smali for full
|
| /art/runtime/interpreter/mterp/x86/ |
| D | op_mul_long.S | 29 leal (%ecx,rIBASE), rIBASE # full result now in rIBASE:%eax
|
| D | op_mul_long_2addr.S | 29 leal (%ecx,rIBASE), rIBASE # full result now in %edx:%eax
|
| /art/tools/dexfuzz/ |
| D | README | 113 8. Check report.log for the full report, including input file and RNG seed for each
118 Check dexfuzz --help for the full list of options.
|
| /art/test/005-annotations/ |
| D | expected.txt | 62 @android.test.anno.AnnoFancyType(name=full, num=5)
|
| /art/ |
| D | Android.mk | 525 .PHONY: use-art-full
526 use-art-full:
|
| /art/build/ |
| D | Android.gtest.mk | 563 $(HOST_OUT_EXECUTABLES)/valgrind --leak-check=full --error-exitcode=1 \
|
| /art/runtime/arch/mips64/ |
| D | quick_entrypoints_mips64.S | 1260 sync # full (LoadLoad|LoadStore) memory barrier
1323 sync # full (LoadStore|StoreStore) memory barrier
|
| /art/runtime/arch/mips/ |
| D | quick_entrypoints_mips.S | 1315 sync # full (LoadLoad|LoadStore) memory barrier
1378 sync # full (LoadStore|StoreStore) memory barrier
|
| /art/test/dexdump/ |
| D | checkers.txt | 1292 00225c: 1a00 d300 |008a: const-string v0, "full" // string@00d3
2435 0030d4: 1a00 d300 |0066: const-string v0, "full" // string@00d3
|