Searched defs:array (Results 1 - 25 of 87) sorted by relevance

1234

/art/test/472-type-propagation/src/
H A DMain.java23 public static void ssaBuilderDouble(double[] array) { argument
25 if (array.length > 3) {
26 x = array[0];
28 x = array[1];
30 array[2] = x;
/art/test/562-checker-no-intermediate/src/
H A DMain.java92 array[index] += Math.abs(-42);
96 static int[] array = new int[2]; field in class:Main
/art/test/081-hot-exceptions/src/
H A DMain.java19 int[] array; field in class:Main.ArrayObj
22 return array[i];
/art/test/427-bounds/src/
H A DMain.java43 static void $opt$Throw(int[] array) { argument
48 int length = array.length;
49 array[2] = 42;
/art/test/499-bce-phi-array-length/src/
H A DMain.java18 public static int foo(int start, int[] array) { argument
21 // for the array length which will only be used within the loop.
23 result += array[i];
25 // The HBoundsCheck for this array access will be updated to access
26 // the array length phi created for the deoptimization checks of the
27 // first loop. This crashed the compiler which used to DCHECK an array
29 result += array[j];
35 public static int bar(int start, int[] array) { argument
38 result += array[i];
40 result += array[
[all...]
/art/test/609-checker-x86-bounds-check/src/
H A DMain.java20 int[] array = new int[51];
21 testArrayLengthBoundsCheckX86(array, 10);
85 static void testArrayLengthBoundsCheckX86(int[] array, int index) { argument
86 array[index] = 9;
/art/test/096-array-copy-concurrent-gc/src/
H A DMain.java22 * Size of array and amount of garbage created is based on experimental
45 Object [] array = new Object[10000]; field in class:Main
48 // We want many references in the array
54 for (int i = 0; i < array.length; i+=2) {
55 array[i] = new String("Creating some garbage" + i);
62 for (int j = 0; j < array.length; j++) {
63 Object obj = array[array.length - 1];
64 System.arraycopy(array, 0, array,
[all...]
/art/test/559-bce-ssa/src/
H A DMain.java19 public static void foo(int[] array, int[] array2, int start, int end) { argument
21 array[i] = array2[array.length] + 1;
/art/test/622-checker-bce-regressions/src/
H A DMain.java22 static int[] array = new int[10]; field in class:Main
46 expectEquals(8, doNotVisitAfterForwardBCE(array));
/art/test/655-jit-clinit/src/
H A DMain.java32 for (int i = 0; i < array.length; ++i) {
33 array[i] = array;
38 array = new Object[10000];
45 static Object[] array; field in class:Foo
/art/compiler/optimizing/
H A Dx86_memory_gen.cc35 // Replace the length by the array itself, so that we can do compares to memory.
43 HInstruction* array = array_len->InputAt(0); variable
44 DCHECK_EQ(array->GetType(), Primitive::kPrimNot);
46 // Don't apply this optimization when the array is nullptr.
47 if (array->IsConstant() || (array->IsNullCheck() && array->InputAt(0)->IsConstant())) {
52 if (array->IsNullCheck() && do_implicit_null_checks_) {
/art/test/461-get-reference-vreg/src/
H A DMain.java34 Object a = array[0];
61 static Object[] array = new Object[] { new Object() }; field in class:Main
/art/test/497-inlining-and-class-loader/
H A Dclear_dex_cache.cc20 #include "mirror/array-inl.h"
42 jarray array; local
44 array = env->NewIntArray(num_methods);
46 array = env->NewLongArray(num_methods);
48 CHECK(array != nullptr);
49 mirror::PointerArray* pointer_array = soa.Decode<mirror::PointerArray>(array).Ptr();
54 return array;
/art/test/535-deopt-and-inlining/src/
H A DMain.java30 public static void doCall(int[] array) { argument
32 deopt(array);
38 public static void deopt(int[] array) { argument
43 $inline$deopt(array);
49 public static void $inline$deopt(int[] array) { argument
50 array[0] = 1;
51 array[1] = 1;
/art/test/626-const-class-linking/
H A Dclear_dex_cache_types.cc48 extern "C" JNIEXPORT void JNICALL Java_Main_nativeDumpClasses(JNIEnv*, jclass, jobjectArray array) { argument
52 hs.NewHandle(soa.Decode<mirror::ObjectArray<mirror::Object>>(array));
/art/test/641-checker-arraycopy/src/
H A DMain.java46 public static void untypedCopyCaller(Object o, byte[] array) { argument
47 untypedCopy(o, array);
/art/compiler/utils/
H A Datomic_method_ref_map-inl.h31 ElementArray* const array = GetArray(ref.dex_file); local
32 if (array == nullptr) {
35 return (*array)[ref.dex_method_index].CompareExchangeStrongSequentiallyConsistent(
43 const ElementArray* const array = GetArray(ref.dex_file); local
44 if (array == nullptr) {
47 *out = (*array)[ref.dex_method_index].LoadRelaxed();
/art/runtime/base/unix_file/
H A Dfd_file_test.cc82 static void NullTerminateCharArray(char (&array)[Size]) { argument
83 array[Size - 1] = '\0';
/art/test/011-array-copy/src/
H A DMain.java52 static void initByteArray(byte[] array) { argument
54 array[i] = (byte) i;
57 static void initShortArray(short[] array) { argument
59 array[i] = (short) i;
62 static void initIntArray(int[] array) { argument
64 array[i] = (int) i;
67 static void initLongArray(long[] array) { argument
69 array[i] = (long) i;
72 static void initCharArray(char[] array) { argument
74 array[
[all...]
/art/test/527-checker-array-access-split/src/
H A DMain.java52 public static int constantIndexGet(int array[]) { argument
53 return array[1];
87 public static void constantIndexSet(int array[]) { argument
88 array[1] = 2;
120 public static int get(int array[], int index) { argument
121 return array[index];
165 public static void set(int array[], int index, int value) { argument
166 array[index] = value;
233 public static void getSet(int array[], int index) { argument
234 array[inde
309 accrossGC(int array[], int index) argument
[all...]
/art/test/642-fp-callees/
H A Dfp_callees.cc23 // Make the array volatile, which is apparently making the C compiler
25 volatile double array[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 }; member in namespace:art
31 double a = array[0];
32 double b = array[1];
33 double c = array[2];
34 double d = array[3];
35 double e = array[4];
36 double f = array[5];
37 double g = array[6];
38 double h = array[
[all...]
/art/runtime/base/
H A Darray_slice.h28 // An ArraySlice is an abstraction over an array or a part of an array of a particular type. It does
29 // bounds checking and can be made from several common array-like structures in Art.
33 // Create an empty array slice.
36 // Create an array slice of the first 'length' elements of the array, with each element being
38 ArraySlice(T* array, argument
41 : array_(array),
47 // Create an array slice of the elements between start_offset and end_offset of the array wit
50 ArraySlice(T* array, uint32_t start_offset, uint32_t end_offset, size_t element_size = sizeof(T)) argument
68 ArraySlice(LengthPrefixedArray<T>* array, uint32_t start_offset, uint32_t end_offset, size_t element_size = sizeof(T), size_t alignment = alignof(T)) argument
[all...]
/art/runtime/native/
H A Djava_lang_VMClassLoader.cc120 * Returns an array of entries from the boot classpath that could contain resources.
126 jobjectArray array = env->NewObjectArray(path.size(), stringClass, nullptr); local
134 env->SetObjectArrayElement(array, i, javaPath);
136 return array;
/art/test/106-exceptions2/src/
H A DMain.java155 static void throwImplicitAIOBE(int[] array, int index) { argument
156 array[index] = 0;
160 int[] array = new int[10];
163 throwImplicitAIOBE(array, 11);
171 throwImplicitAIOBE(array, -1);
/art/test/445-checker-licm/src/
H A DMain.java102 public static int arrayLength(int[] array) { argument
104 for (int i = 0; i < array.length; ++i) {
105 result += array[i];
119 public static int divAndIntrinsic(int[] array) { argument
121 for (int i = 0; i < array.length; i++) {
124 result += (staticField / 42) + Math.abs(array[i]);

Completed in 462 milliseconds

1234