| /art/compiler/utils/ |
| D | assembler_thumb_test_expected.cc.inc | 2 " 0: 2d e9 e0 4d push.w {r5, r6, r7, r8, r10, r11, lr}\n"
3 … vpush {s16, s17, s18, s19, s20, s21, s22, s23, s24, s25, s26, s27, s28, s29, s30, s31}\n"
4 " 8: 89 b0 sub sp, #36\n"
5 " a: 00 90 str r0, [sp]\n"
6 " c: 21 91 str r1, [sp, #132]\n"
7 " e: 8d ed 22 0a vstr s0, [sp, #136]\n"
8 " 12: 23 92 str r2, [sp, #140]\n"
9 " 14: 24 93 str r3, [sp, #144]\n"
10 " 16: 88 b0 sub sp, #32\n"
11 " 18: ad f5 80 5d sub.w sp, sp, #4096\n"
[all …]
|
| /art/test/618-checker-induction/src/ |
| D | Main.java | 41 static void deadSingleLoopN(int n) { in deadSingleLoopN() argument
42 for (int i = 0; i < n; i++) { in deadSingleLoopN()
51 static void potentialInfiniteLoop(int n) { in potentialInfiniteLoop() argument
52 for (int i = 0; i <= n; i++) { // loops forever when n = MAX_INT in potentialInfiniteLoop()
102 public static void deadConditional(int n) { in deadConditional() argument
105 for (int i = 0; i < n; i++) { in deadConditional()
122 public static void deadConditionalCycle(int n) { in deadConditionalCycle() argument
125 for (int i = 0; i < n; i++) { in deadConditionalCycle()
335 static int closedFormInductionUpN(int n) { in closedFormInductionUpN() argument
337 for (int i = 0; i < n; i++) { in closedFormInductionUpN()
[all …]
|
| /art/test/641-iterations/src/ |
| D | Main.java | 30 static void doitTo(int n) { in doitTo() argument
31 for (int i = 0; i < n; i++) in doitTo()
35 static void doitFrom(int n) { in doitFrom() argument
36 for (int i = n; i < sA.length; i++) in doitFrom()
40 static void verify(int n) { in verify() argument
41 for (int i = 0; i < n; i++) in verify()
44 for (int i = n; i < sA.length; i++) in verify()
56 for (int n = 0; n <= sA.length; n++) { in driver()
58 doitTo(n); in driver()
59 verify(n); in driver()
[all …]
|
| /art/test/1968-force-early-return/src/art/ |
| D | NonStandardExit.java | 30 Number n = (Number)o; in forceEarlyReturn() local
31 if (n instanceof Integer || n instanceof Short || n instanceof Byte) { in forceEarlyReturn()
32 forceEarlyReturnInt(thr, n.intValue()); in forceEarlyReturn()
33 } else if (n instanceof Long) { in forceEarlyReturn()
34 forceEarlyReturnLong(thr, n.longValue()); in forceEarlyReturn()
35 } else if (n instanceof Float) { in forceEarlyReturn()
36 forceEarlyReturnFloat(thr, n.floatValue()); in forceEarlyReturn()
37 } else if (n instanceof Double) { in forceEarlyReturn()
38 forceEarlyReturnDouble(thr, n.doubleValue()); in forceEarlyReturn()
40 throw new IllegalArgumentException("Unknown number subtype: " + n.getClass() + " - " + n); in forceEarlyReturn()
|
| /art/test/1969-force-early-return-void/src/art/ |
| D | NonStandardExit.java | 30 Number n = (Number)o; in forceEarlyReturn() local
31 if (n instanceof Integer || n instanceof Short || n instanceof Byte) { in forceEarlyReturn()
32 forceEarlyReturnInt(thr, n.intValue()); in forceEarlyReturn()
33 } else if (n instanceof Long) { in forceEarlyReturn()
34 forceEarlyReturnLong(thr, n.longValue()); in forceEarlyReturn()
35 } else if (n instanceof Float) { in forceEarlyReturn()
36 forceEarlyReturnFloat(thr, n.floatValue()); in forceEarlyReturn()
37 } else if (n instanceof Double) { in forceEarlyReturn()
38 forceEarlyReturnDouble(thr, n.doubleValue()); in forceEarlyReturn()
40 throw new IllegalArgumentException("Unknown number subtype: " + n.getClass() + " - " + n); in forceEarlyReturn()
|
| /art/test/1970-force-early-return-long/src/art/ |
| D | NonStandardExit.java | 30 Number n = (Number)o; in forceEarlyReturn() local
31 if (n instanceof Integer || n instanceof Short || n instanceof Byte) { in forceEarlyReturn()
32 forceEarlyReturnInt(thr, n.intValue()); in forceEarlyReturn()
33 } else if (n instanceof Long) { in forceEarlyReturn()
34 forceEarlyReturnLong(thr, n.longValue()); in forceEarlyReturn()
35 } else if (n instanceof Float) { in forceEarlyReturn()
36 forceEarlyReturnFloat(thr, n.floatValue()); in forceEarlyReturn()
37 } else if (n instanceof Double) { in forceEarlyReturn()
38 forceEarlyReturnDouble(thr, n.doubleValue()); in forceEarlyReturn()
40 throw new IllegalArgumentException("Unknown number subtype: " + n.getClass() + " - " + n); in forceEarlyReturn()
|
| /art/test/1971-multi-force-early-return/src/art/ |
| D | NonStandardExit.java | 30 Number n = (Number)o; in forceEarlyReturn() local
31 if (n instanceof Integer || n instanceof Short || n instanceof Byte) { in forceEarlyReturn()
32 forceEarlyReturnInt(thr, n.intValue()); in forceEarlyReturn()
33 } else if (n instanceof Long) { in forceEarlyReturn()
34 forceEarlyReturnLong(thr, n.longValue()); in forceEarlyReturn()
35 } else if (n instanceof Float) { in forceEarlyReturn()
36 forceEarlyReturnFloat(thr, n.floatValue()); in forceEarlyReturn()
37 } else if (n instanceof Double) { in forceEarlyReturn()
38 forceEarlyReturnDouble(thr, n.doubleValue()); in forceEarlyReturn()
40 throw new IllegalArgumentException("Unknown number subtype: " + n.getClass() + " - " + n); in forceEarlyReturn()
|
| /art/test/jvmti-common/ |
| D | NonStandardExit.java | 30 Number n = (Number)o; in forceEarlyReturn() local
31 if (n instanceof Integer || n instanceof Short || n instanceof Byte) { in forceEarlyReturn()
32 forceEarlyReturnInt(thr, n.intValue()); in forceEarlyReturn()
33 } else if (n instanceof Long) { in forceEarlyReturn()
34 forceEarlyReturnLong(thr, n.longValue()); in forceEarlyReturn()
35 } else if (n instanceof Float) { in forceEarlyReturn()
36 forceEarlyReturnFloat(thr, n.floatValue()); in forceEarlyReturn()
37 } else if (n instanceof Double) { in forceEarlyReturn()
38 forceEarlyReturnDouble(thr, n.doubleValue()); in forceEarlyReturn()
40 throw new IllegalArgumentException("Unknown number subtype: " + n.getClass() + " - " + n); in forceEarlyReturn()
|
| /art/test/530-checker-lse-simd/src/ |
| D | Main.java | 45 static double $noinline$vecgen(double a[], double b[], int n) { in $noinline$vecgen() argument
49 for (int i = 0; i < n; ++i) { in $noinline$vecgen()
56 for (int i = 0; i < n; ++i) { in $noinline$vecgen()
95 static double $noinline$test02(double a[], int n) { in $noinline$test02() argument
96 double b[] = new double[n]; in $noinline$test02()
125 static double $noinline$test03(int n) { in $noinline$test03() argument
126 double a[] = new double[n]; in $noinline$test03()
127 double b[] = new double[n]; in $noinline$test03()
161 static double[] $noinline$test04(int n) { in $noinline$test04() argument
162 double a[] = new double[n]; in $noinline$test04()
[all …]
|
| /art/test/667-checker-simd-alignment/src/ |
| D | Main.java | 249 static void staticallyUnknownAlignedN(int[] a, int off, int n) { in staticallyUnknownAlignedN() argument
252 for (int i = 0; i < n; i++) { in staticallyUnknownAlignedN()
271 for (int n = 0; n <= 71; n++) { in test2()
272 int[] a = new int[n]; in test2()
290 for (int n = 0; n <= 71; n++) { in test4()
291 int[] a = new int[n]; in test4()
312 for (int n = 0; n <= 9; n++) { in test6()
314 staticallyUnknownAlignedN(a, off, n); in test6()
316 int e = (off <= i && i < off + n) ? 1 : 0; in test6()
|
| /art/test/534-checker-bce-deoptimization/src/ |
| D | Main.java | 28 int n = 100; in run() local
30 foo1(a, n, b); in run()
33 void foo1(double a[][], int n, double b[]) { in foo1() argument
37 for (i = 0; i < n; i++) { in foo1()
38 k = n - (i + 1); in foo1()
45 void foo2(int n, double c, double b[]) { in foo2() argument
47 foo3(n, c, b); in foo2()
52 void foo3(int n, double c, double b[]) { in foo3() argument
54 for (i = 0; i < n; i++) { in foo3()
91 public static void $noinline$FloatFill(float f1, float f2, float[] array, int n) { in $noinline$FloatFill() argument
[all …]
|
| /art/tools/class2greylist/src/com/android/class2greylist/ |
| D | StringCursor.java | 57 public String peek(int n) throws StringCursorOutOfBoundsException { in peek() argument
58 if (n == -1) { in peek()
61 if (n < 0 || (n + mCursor) >= mString.length()) { in peek()
64 return mString.substring(mCursor, mCursor + n); in peek()
86 public String next(int n) throws StringCursorOutOfBoundsException { in next() argument
87 if (n == -1) { in next()
92 if (n < 0) { in next()
95 mCursor += n; in next()
96 return mString.substring(mCursor - n, mCursor); in next()
|
| /art/libartbase/base/ |
| D | memory_region_test.cc | 24 const size_t n = 8; in TEST() local
25 uint8_t data[n] = { 0, 1, 2, 3, 4, 5, 6, 7 }; in TEST()
26 MemoryRegion region(&data, n); in TEST()
39 const size_t n = 8; in TEST() local
40 uint8_t data[n] = { 0, 0, 0, 0, 0, 0, 0, 0 }; in TEST()
41 MemoryRegion region(&data, n); in TEST()
52 uint8_t expected[n] = { 7, 6, 5, 4, 3, 2, 1, 0 }; in TEST()
53 for (size_t i = 0; i < n; ++i) { in TEST()
|
| D | indenter.h | 40 std::streamsize xsputn(const char* s, std::streamsize n) override { in xsputn() argument
41 std::streamsize result = n; // Aborts on failure. in xsputn()
42 const char* eol = static_cast<const char*>(memchr(s, '\n', n)); in xsputn()
47 n -= to_write; in xsputn()
49 eol = static_cast<const char*>(memchr(s, '\n', n)); in xsputn()
51 if (n != 0u) { in xsputn()
52 Write(s, n); in xsputn()
72 void Write(const char* s, std::streamsize n) { in Write() argument
82 RawWrite(s, n); in Write()
85 void RawWrite(const char* s, std::streamsize n) { in RawWrite() argument
[all …]
|
| /art/libartbase/base/unix_file/ |
| D | random_access_file_utils.cc | 30 int64_t n; in CopyFile() local
31 while ((n = src.Read(&buf[0], buf.size(), offset)) > 0) { in CopyFile()
32 if (dst->Write(&buf[0], n, offset) != n) { in CopyFile()
35 offset += n; in CopyFile()
37 return n >= 0; in CopyFile()
|
| /art/test/654-checker-periodic/src/ |
| D | Main.java | 29 static int doitUpInt(int n) { in doitUpInt() argument
32 for (int i1 = 0; i1 < n; i1++) { in doitUpInt()
44 static int doitDownInt(int n) { in doitDownInt() argument
47 for (int i1 = n - 1; i1 >= 0; i1--) { in doitDownInt()
60 static float doitUpFloat(int n) { in doitUpFloat() argument
64 for (int i1 = 0; i1 < n; i1++) { in doitUpFloat()
77 static float doitDownFloat(int n) { in doitDownFloat() argument
81 for (int i1 = n - 1; i1 >= 0; i1--) { in doitDownFloat()
93 static float doitUpFloatAlt(int n) { in doitUpFloatAlt() argument
98 for (int i1 = 0; i1 < n; i1++) { in doitUpFloatAlt()
[all …]
|
| /art/test/530-checker-loops1/src/ |
| D | Main.java | 202 private static int[] linearWithParameter(int n) { in linearWithParameter() argument
203 int[] x = new int[n]; in linearWithParameter()
204 for (int i = 0; i < n; i++) { in linearWithParameter()
217 int n = x.length; in linearCopy() local
218 int y[] = new int[n]; in linearCopy()
219 for (int i = 0; i < n; i++) { in linearCopy()
233 int n = x.length / 2; in linearByTwo() local
235 for (int i = 0; i < n; i++) { in linearByTwo()
566 private static void linearTriangularOnTwoArrayLengths(int n) { in linearTriangularOnTwoArrayLengths() argument
567 int[] a = new int[n]; in linearTriangularOnTwoArrayLengths()
[all …]
|
| /art/test/101-fibonacci/src/ |
| D | Main.java | 37 static int fibonacci(int n) { in fibonacci() argument
38 if ((n == 0) || (n == 1)) { in fibonacci()
39 return n; in fibonacci()
41 return fibonacci(n - 1) + (fibonacci(n - 2)); in fibonacci()
|
| /art/test/utils/python/testgen/ |
| D | utils.py | 34 map(lambda n: itertools.product(string.ascii_lowercase, repeat=n),
61 def subtree_sizes(n): argument
66 if n == 0:
68 elif n == 1:
70 elif n == 2:
73 for prevt in subtree_sizes(n - 1):
|
| /art/runtime/interpreter/ |
| D | cfi_asm_support.h | 62 #define CFI_EXPRESSION_BREG_1(n, b, offset) .cfi_escape \ argument
64 n, /* rule for register n */ \
69 #define CFI_EXPRESSION_BREG_2(n, b, offset) .cfi_escape \ argument
71 n, /* rule for register n */ \
82 #define CFI_EXPRESSION_BREG_1(n, b, offset) argument
83 #define CFI_EXPRESSION_BREG_2(n, b, offset) argument
|
| /art/test/2029-contended-monitors/src/ |
| D | Main.java | 49 private void holdFor(Object lock, int n) { in holdFor() argument
52 for (int i = 0; i < n; ++i) { in holdFor()
61 private void spinFor(int n) { in spinFor() argument
64 for (int i = 0; i < n; ++i) { in spinFor()
68 if (local_counter != n) { in spinFor()
74 RepeatedLockHolder(boolean shared, int n /* even */) { in RepeatedLockHolder() argument
76 holdTime = n; in RepeatedLockHolder()
91 RepeatedIntermittentLockHolder(boolean shared, int n /* even */) { in RepeatedIntermittentLockHolder() argument
93 holdTime = n; in RepeatedIntermittentLockHolder()
144 private long runMultiple(int n, Runnable work) { in runMultiple() argument
[all …]
|
| /art/test/988-method-trace/ |
| D | trace_fib.cc | 22 extern "C" JNIEXPORT jint JNICALL Java_art_Test988_nativeFibonacci(JNIEnv* env, jclass, jint n) { in Java_art_Test988_nativeFibonacci() argument
23 if (n < 0) { in Java_art_Test988_nativeFibonacci()
26 } else if (n == 0) { in Java_art_Test988_nativeFibonacci()
31 for (jint i = 3; i <= n; i++) { in Java_art_Test988_nativeFibonacci()
|
| /art/test/680-sink-regression/src/ |
| D | Main.java | 48 N n = new N(); in main() local
64 n.x = 0; in main()
66 x = t.doit(n); in main()
75 n.x = 1; in main()
77 x = t.doit(n); in main()
|
| /art/test/696-loop/src/ |
| D | Main.java | 21 static void doIt(int n) { in doIt() argument
23 n+=a; in doIt()
25 for (int i = 0; i < n; i++) { in doIt()
|
| /art/test/440-stmp/src/ |
| D | Main.java | 24 baz(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o); in bar()
28 float h, float i, float j, float k, float l, float m, float n, float o) { in baz() argument
29 System.out.println(a - b - c - d - e - f - g - h - i - j - k - l - m - n - o); in baz()
45 float n = 14.0f; field in Main
|