Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 88) sorted by relevance

1234

/art/compiler/utils/
Dassembler_thumb_test_expected.cc.inc2 " 0: e92d 4de0 stmdb sp!, {r5, r6, r7, r8, sl, fp, lr}\n",
3 " 4: ed2d 8a10 vpush {s16-s31}\n",
4 " 8: b089 sub sp, #36 ; 0x24\n",
5 " a: 9000 str r0, [sp, #0]\n",
6 " c: 9121 str r1, [sp, #132] ; 0x84\n",
7 " e: ed8d 0a22 vstr s0, [sp, #136] ; 0x88\n",
8 " 12: 9223 str r2, [sp, #140] ; 0x8c\n",
9 " 14: 9324 str r3, [sp, #144] ; 0x90\n",
10 " 16: b088 sub sp, #32\n",
11 " 18: f5ad 5d80 sub.w sp, sp, #4096 ; 0x1000\n",
[all …]
/art/test/618-checker-induction/src/
DMain.java41 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/
DMain.java30 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/534-checker-bce-deoptimization/src/
DMain.java28 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/test/654-checker-periodic/src/
DMain.java29 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/
DMain.java202 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/runtime/base/unix_file/
Drandom_access_file_utils.cc28 int64_t n; in CopyFile() local
29 while ((n = src.Read(&buf[0], buf.size(), offset)) > 0) { in CopyFile()
30 if (dst->Write(&buf[0], n, offset) != n) { in CopyFile()
33 offset += n; in CopyFile()
35 return n >= 0; in CopyFile()
/art/runtime/
Dindenter.h38 std::streamsize xsputn(const char* s, std::streamsize n) OVERRIDE { in xsputn() argument
39 std::streamsize result = n; // Aborts on failure. in xsputn()
40 const char* eol = static_cast<const char*>(memchr(s, '\n', n)); in xsputn()
45 n -= to_write; in xsputn()
47 eol = static_cast<const char*>(memchr(s, '\n', n)); in xsputn()
49 if (n != 0u) { in xsputn()
50 Write(s, n); in xsputn()
70 void Write(const char* s, std::streamsize n) { in Write() argument
80 RawWrite(s, n); in Write()
83 void RawWrite(const char* s, std::streamsize n) { in RawWrite() argument
[all …]
Dmemory_region_test.cc25 const size_t n = 8; in TEST() local
26 uint8_t data[n] = { 0, 1, 2, 3, 4, 5, 6, 7 }; in TEST()
27 MemoryRegion region(&data, n); in TEST()
40 const size_t n = 8; in TEST() local
41 uint8_t data[n] = { 0, 0, 0, 0, 0, 0, 0, 0 }; in TEST()
42 MemoryRegion region(&data, n); in TEST()
53 uint8_t expected[n] = { 7, 6, 5, 4, 3, 2, 1, 0 }; in TEST()
54 for (size_t i = 0; i < n; ++i) { in TEST()
60 const size_t n = 8; in TEST() local
61 uint8_t data[n] = { 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF }; in TEST()
[all …]
Dnth_caller_visitor.h31 n(n_in), in StackVisitor()
48 if (count == n) { in VisitFrame()
58 const size_t n; member
/art/test/101-fibonacci/src/
DMain.java37 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/
Dutils.py34 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/base/
Dbit_utils.h148 constexpr T RoundDown(T x, typename Identity<T>::type n) WARN_UNUSED;
151 constexpr T RoundDown(T x, typename Identity<T>::type n) { in RoundDown() argument
152 DCHECK(IsPowerOfTwo(n)); in RoundDown()
153 return (x & -n); in RoundDown()
157 constexpr T RoundUp(T x, typename std::remove_reference<T>::type n) WARN_UNUSED;
160 constexpr T RoundUp(T x, typename std::remove_reference<T>::type n) { in RoundUp() argument
161 return RoundDown(x + n - 1, n); in RoundUp()
166 inline T* AlignDown(T* x, uintptr_t n) WARN_UNUSED;
169 inline T* AlignDown(T* x, uintptr_t n) { in AlignDown() argument
170 return reinterpret_cast<T*>(RoundDown(reinterpret_cast<uintptr_t>(x), n)); in AlignDown()
[all …]
Ddchecked_vector.h62 explicit dchecked_vector(size_type n, const allocator_type& alloc = allocator_type())
63 : Base(n, alloc) { } in Base() argument
64 dchecked_vector(size_type n,
67 : Base(n, value, alloc) { } in Base() argument
122 reference operator[](size_type n) {
123 DCHECK_LT(n, size());
124 return Base::operator[](n);
126 const_reference operator[](size_type n) const {
127 DCHECK_LT(n, size());
128 return Base::operator[](n);
[all …]
Dstringpiece.cc37 StringPiece::size_type StringPiece::copy(char* buf, size_type n, size_type pos) const { in copy() argument
38 size_type ret = std::min(length_ - pos, n); in copy()
90 StringPiece StringPiece::substr(size_type pos, size_type n) const { in substr()
92 if (n > length_ - pos) n = length_ - pos; in substr()
93 return StringPiece(ptr_ + pos, n); in substr()
Dstringpiece.h95 void remove_prefix(size_type n) { in remove_prefix() argument
96 ptr_ += n; in remove_prefix()
97 length_ -= n; in remove_prefix()
100 void remove_suffix(size_type n) { in remove_suffix() argument
101 length_ -= n; in remove_suffix()
142 size_type copy(char* buf, size_type n, size_type pos = 0) const;
149 StringPiece substr(size_type pos, size_type n = npos) const;
/art/test/988-method-trace/src/art/
DTest988.java181 private static String whitespace(int n) {
183 while (n > 0) {
184 n--;
233 static int iter_fibonacci(int n) {
234 if (n < 0) {
235 throw new Error("Bad argument: " + n + " < 0");
236 } else if (n == 0) {
241 for (int i = 3; i <= n; i++) {
255 static int fibonacci(int n) {
256 if (n < 0) {
[all …]
/art/tools/
Dbootjars.sh27 core_jars_only=n
28 print_file_path=n
63 if [[ $core_jars_only == n ]]; then
74 if [[ $print_file_path == n ]]; then
/art/test/440-stmp/src/
DMain.java24 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
/art/test/650-checker-inline-access-thunks/src/
DMain.java20 Nested n = new Nested(); in main() local
21 n.$noinline$setPrivateIntField(m, 42); in main()
22 System.out.println(n.$noinline$getPrivateIntField(m)); in main()
/art/test/620-checker-bce-intrinsics/src/
DMain.java111 int n = Math.min(4, a.length); in oneArrayWithCleanup() local
112 for (int i = 0; i < n; i++) { in oneArrayWithCleanup()
115 for (int i = n; i < a.length; i++) { in oneArrayWithCleanup()
133 int n = Math.min(a.length, b.length); in twoArraysWithCleanup() local
134 for (int i = n - 1; i >= 0; i--) { in twoArraysWithCleanup()
137 for (int i = n; i < a.length; i++) { in twoArraysWithCleanup()
156 int n = Math.min(a.length, Math.min(b.length, c.length)); in threeArraysWithCleanup() local
157 for (int i = n - 1; i >= 0; i--) { in threeArraysWithCleanup()
160 for (int i = n; i < a.length; i++) { in threeArraysWithCleanup()
175 int n = Math.min(a.length, b.length); in altLoopLogic() local
[all …]
/art/test/953-invoke-polymorphic-compiler/src/
DMain.java103 int m, int n, int o, int p, in Min2Print26() argument
108 n, o, p, q, r, s, t, u, v, w, x, y, z }; in Min2Print26()
190 private static String Multiply(String value, int n) { in Multiply() argument
192 for (int i = 0; i < n; ++i) { in Multiply()
198 private static byte Multiply(byte value, byte n) { in Multiply() argument
199 return (byte)(value * n); in Multiply()
202 private static short Multiply(short value, short n) { in Multiply() argument
203 return (short)(value * n); in Multiply()
206 private static int Multiply(int value, int n) { in Multiply() argument
207 return value * n; in Multiply()
[all …]
/art/test/444-checker-nce/src/
DMain.java139 Main n = new Main(); in phiFlowRemoveTest() local
142 n = m; in phiFlowRemoveTest()
145 return n.g(); in phiFlowRemoveTest()
163 Main n = new Main(); in phiFlowKeepTest() local
166 n = m; in phiFlowKeepTest()
169 return n.g(); in phiFlowKeepTest()
/art/test/090-loop-formation/src/
DMain.java68 for (int n = 0; n < 2; n++) { in deeplyNested()
/art/test/623-checker-loop-regressions/src/
DMain.java308 private static void $noinline$foo(boolean x, int n) { in $noinline$foo() argument
309 if (n < 0) in $noinline$foo()
311 if (n > 100) { in $noinline$foo()
312 $noinline$foo(!x, n - 1); in $noinline$foo()
313 $noinline$foo(!x, n - 2); in $noinline$foo()
314 $noinline$foo(!x, n - 3); in $noinline$foo()
315 $noinline$foo(!x, n - 4); in $noinline$foo()
366 private static void arrayInTripCount(int[] a, byte[] b, int n) { in arrayInTripCount() argument
367 for (int k = 0; k < n; k++) { in arrayInTripCount()

1234