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

123

/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-no-intermediate/src/
H A DMain.java22 array[index] += Math.cos(42);
26 static double[] array = new double[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/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/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.cc38 jarray array; local
40 array = env->NewIntArray(num_methods);
42 array = env->NewLongArray(num_methods);
44 CHECK(array != nullptr);
45 mirror::PointerArray* pointer_array = soa.Decode<mirror::PointerArray*>(array);
50 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/runtime/base/unix_file/
H A Dfd_file_test.cc80 static void NullTerminateCharArray(char (&array)[Size]) { argument
81 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/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]);
/art/test/527-checker-array-access-split/src/
H A DMain.java40 public static int constantIndexGet(int array[]) { argument
41 return array[1];
62 public static void constantIndexSet(int array[]) { argument
63 array[1] = 2;
82 public static int get(int array[], int index) { argument
83 return array[index];
108 public static void set(int array[], int index, int value) { argument
109 array[index] = value;
146 public static void getSet(int array[], int index) { argument
147 array[inde
188 accrossGC(int array[], int index) argument
[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.cc76 * Returns an array of entries from the boot classpath that could contain resources.
82 jobjectArray array = env->NewObjectArray(path.size(), stringClass, nullptr); local
90 env->SetObjectArrayElement(array, i, javaPath);
92 return array;
H A Djava_lang_System.cc22 #include "mirror/array.h"
34 * cause "word tearing". Accesses to 64-bit array elements may be two 32-bit operations.
38 static void ThrowArrayStoreException_NotAnArray(const char* identifier, mirror::Object* array)
40 std::string actualType(PrettyTypeOf(array));
43 "%s of type %s is not an array", identifier, actualType.c_str());
130 LOG(FATAL) << "Unknown array type: " << PrettyTypeOf(srcArray);
134 // If one of the arrays holds a primitive type the other array must hold the exact same type.
157 // Template to convert general array to that of its specific primitive type.
159 inline T* AsPrimitiveArray(mirror::Array* array) { argument
160 return down_cast<T*>(array);
[all...]
/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/552-checker-sharpening/src/
H A DMain.java64 // This call should use PC-relative dex cache array load to retrieve the target method.
106 // These calls should use PC-relative dex cache array loads to retrieve the target method.
151 public static int testLoop(int[] array, int x) { argument
153 for (int i : array) {
179 public static int testLoopWithDiamond(int[] array, boolean negate, int x) { argument
182 if (array != null) {
183 for (int i : array) {
/art/tools/ahat/src/
H A DObjectHandler.java120 Doc doc, Query query, AhatSnapshot snapshot, ArrayInstance array) {
123 List<Object> elements = Arrays.asList(array.getValues());
119 printArrayElements( Doc doc, Query query, AhatSnapshot snapshot, ArrayInstance array) argument
/art/compiler/optimizing/
H A Dinstruction_simplifier_arm64.cc21 #include "mirror/array-inl.h"
31 HInstruction* array,
51 // The access may require a runtime call or the original array pointer.
61 new (arena) HArm64IntermediateAddress(array, offset, kNoDexPc);
62 address->SetReferenceTypeInfo(array->GetReferenceTypeInfo());
30 TryExtractArrayAccessAddress(HInstruction* access, HInstruction* array, HInstruction* index, int access_size) argument
H A Dssa_builder.cc306 static Primitive::Type GetPrimitiveArrayComponentType(HInstruction* array)
308 ReferenceTypeInfo array_type = array->GetReferenceTypeInfo();
328 HInstruction* array = aget_int->GetArray(); local
329 if (!array->GetReferenceTypeInfo().IsPrimitiveArrayClass()) {
330 // RTP did not type the input array. Bail.
335 Primitive::Type array_type = GetPrimitiveArrayComponentType(array);
368 HInstruction* array = aset->GetArray(); local
369 if (!array->GetReferenceTypeInfo().IsPrimitiveArrayClass()) {
370 // RTP did not type the input array. Bail.
376 Primitive::Type array_type = GetPrimitiveArrayComponentType(array);
[all...]
/art/test/407-arrays/src/
H A DMain.java17 // Simple test for array accesses.
133 public static void ensureThrows(boolean[] array, int index) { argument
136 $opt$doArrayLoad(array, index);
146 $opt$doArrayStore(array, index);
155 public static void $opt$doArrayLoad(boolean[] array, int index) { argument
156 boolean res = array[index];
159 public static void $opt$doArrayStore(boolean[] array, int index) { argument
160 array[index] = false;
/art/compiler/driver/
H A Dcompiled_method_storage.cc34 const LengthPrefixedArray<T>* CopyArray(SwapSpace* swap_space, const ArrayRef<const T>& array) { argument
35 DCHECK(!array.empty());
37 void* storage = allocator.allocate(LengthPrefixedArray<T>::ComputeSize(array.size()));
38 LengthPrefixedArray<T>* array_copy = new(storage) LengthPrefixedArray<T>(array.size());
39 std::copy(array.begin(), array.end(), array_copy->begin());
44 void ReleaseArray(SwapSpace* swap_space, const LengthPrefixedArray<T>* array) { argument
46 size_t size = LengthPrefixedArray<T>::ComputeSize(array->size());
47 array->~LengthPrefixedArray<T>();
48 allocator.deallocate(const_cast<uint8_t*>(reinterpret_cast<const uint8_t*>(array)), siz
67 ReleaseArrayIfNotDeduplicated( const LengthPrefixedArray<T>* array) argument
159 Copy(const ArrayRef<const T>& array) argument
163 Destroy(const LengthPrefixedArray<T>* array) argument
[all...]
/art/runtime/entrypoints/
H A Dentrypoint_utils.cc62 ThrowRuntimeException("Bad filled array request for type %s",
67 "Found type %s; filled-new-array not implemented for anything but 'int'",
83 // Helper function to allocate array for FILLED_NEW_ARRAY.
93 // Always go slow path for now, filled new array is not common.
102 // Helper function to allocate array for FILLED_NEW_ARRAY.
143 // Build argument array possibly triggering GC.
240 ThrowNullPointerException("null array in FILL_ARRAY_DATA");
243 mirror::Array* array = obj->AsArray(); local
244 DCHECK(!array->IsObjectArray());
245 if (UNLIKELY(static_cast<int32_t>(payload->element_count) > array
[all...]

Completed in 5997 milliseconds

123