| /external/clang/test/CodeGen/ |
| 2007-11-29-ArraySizeFromInitializer.c | 3 int array[] = {1, 2, 3, 4, 5}; variable
|
| debug-info-block-out-return.c | 21 typedef struct { int array[12]; } BigStruct_t; member in struct:__anon14923
|
| 2004-03-09-LargeArrayInitializers.c | 9 const int array[] = { local
31 return array[x];
|
| /external/eigen/doc/snippets/ |
| Map_general_stride.cpp | 1 int array[24]; variable
2 for(int i = 0; i < 24; ++i) array[i] = i;
4 (array, 3, 3, Stride<Dynamic,2>(8, 2))
|
| Map_inner_stride.cpp | 1 int array[12]; variable
2 for(int i = 0; i < 12; ++i) array[i] = i;
4 (array, 6) // the inner stride has already been passed as template parameter
|
| Map_outer_stride.cpp | 1 int array[12]; variable
2 for(int i = 0; i < 12; ++i) array[i] = i;
3 cout << Map<MatrixXi, 0, OuterStride<> >(array, 3, 3, OuterStride<>(4)) << endl;
|
| Map_simple.cpp | 1 int array[9]; variable
2 for(int i = 0; i < 9; ++i) array[i] = i;
3 cout << Map<Matrix3i>(array) << endl;
|
| Tutorial_Map_rowmajor.cpp | 1 int array[8]; variable
2 for(int i = 0; i < 8; ++i) array[i] = i;
3 cout << "Column-major:\n" << Map<Matrix<int,2,4> >(array) << endl;
4 cout << "Row-major:\n" << Map<Matrix<int,2,4,RowMajor> >(array) << endl;
6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
|
| /art/test/559-checker-rtp-ifnotnull/src/ |
| Main.java | 39 int[] array = null; local
41 if (array == null) {
42 array = new int[5];
45 array = new int[10];
47 array[i] = i;
50 array.hashCode();
|
| /art/test/562-checker-no-intermediate/src/ |
| Main.java | 26 /// CHECK-DAG: <<Array:l\d+>> NullCheck
28 /// CHECK-DAG: <<ArrayGet:i\d+>> ArrayGet [<<Array>>,<<Index>>]
31 /// CHECK-DAG: ArraySet [<<Array>>,<<Index>>,<<Add>>]
36 /// CHECK-DAG: <<Array:l\d+>> NullCheck
38 /// CHECK-DAG: <<Address1:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
42 /// CHECK-DAG: <<Address2:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
48 /// CHECK-DAG: <<Array:l\d+>> NullCheck
50 /// CHECK-DAG: <<Address1:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
54 /// CHECK-DAG: <<Address2:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
60 /// CHECK-DAG: <<Array:l\d+>> NullChec
96 static int[] array = new int[2]; field in class:Main
[all...] |
| /art/test/609-checker-x86-bounds-check/src/ |
| Main.java | 20 int[] array = new int[51]; local
21 testArrayLengthBoundsCheckX86(array, 10);
27 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
30 /// CHECK-DAG: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
36 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
39 /// CHECK-DAG: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
45 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
48 /// CHECK: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
49 /// CHECK-NEXT: <<Length:i\d+>> ArrayLength [<<Array>>] is_string_length:false emitted_at_use:true loop:none
52 /// CHECK: <<ArraySet:v\d+>> ArraySet [<<Array>>,<<Index>>,<<Value>>
[all...] |
| /external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
| p15.cpp | 9 int array[3]; local
12 (void)[&array] () -> void {};
|
| /external/clang/test/CodeGenCXX/ |
| 2005-02-13-BadDynamicInit.cpp | 5 unsigned array[1]; member in struct:Data
9 Data shared_null = { shared_null.array };
|
| /external/clang/test/Sema/ |
| invalid-cast.cpp | 6 T array; member in struct:X
10 return x0.array[17];
|
| /external/clang/test/SemaCXX/ |
| eval-sizeof-dependent-type.cpp | 4 template <typename _Tp, size_t _Nm> struct array { _Tp _M_elems[_Nm]; }; struct
6 array<int, 1> v{static_cast<int>(sizeof (T) / sizeof(T))};
|
| /external/compiler-rt/test/asan/TestCases/ |
| vla_loop_overfow.cc | 11 char array[len]; // NOLINT local
12 assert(!(reinterpret_cast<uintptr_t>(array) & 31L));
13 array[index + i] = 0;
|
| /external/kmod/shared/ |
| array.h | 6 * Declaration of struct array is in header because we may want to embed the
9 struct array { struct
10 void **array; member in struct:array
16 void array_init(struct array *array, size_t step);
17 int array_append(struct array *array, const void *element);
18 int array_append_unique(struct array *array, const void *element);
19 void array_pop(struct array *array)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort.pass.cpp | 29 int* array = new int[N]; local
31 array[i] = i;
32 std::shuffle(array, array+N, randomness);
33 std::partial_sort(array, array+M, array+N);
37 assert(array[i] == i);
39 delete [] array;
|
| /external/protobuf/objectivec/ |
| GPBArray.h | 51 + (instancetype)array; variable
53 + (instancetype)arrayWithValueArray:(GPBInt32Array *)array;
57 // Initializes the array, copying the values.
60 - (instancetype)initWithValueArray:(GPBInt32Array *)array;
71 - (void)addValuesFromArray:(GPBInt32Array *)array;
91 + (instancetype)array; variable
93 + (instancetype)arrayWithValueArray:(GPBUInt32Array *)array;
97 // Initializes the array, copying the values.
100 - (instancetype)initWithValueArray:(GPBUInt32Array *)array;
111 - (void)addValuesFromArray:(GPBUInt32Array *)array;
131 + (instancetype)array; variable
171 + (instancetype)array; variable
211 + (instancetype)array; variable
251 + (instancetype)array; variable
291 + (instancetype)array; variable
332 + (instancetype)array; variable
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldAndroidArrayListTest.java | 30 ArrayList array = new ArrayList(); local
31 assertEquals(0, array.size());
32 assertTrue(array.isEmpty());
34 array.add(new Integer(0));
35 array.add(0, new Integer(1));
36 array.add(1, new Integer(2));
37 array.add(new Integer(3));
38 array.add(new Integer(1));
40 assertEquals(5, array.size());
41 assertFalse(array.isEmpty())
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort.pass.cpp | 25 int* array = new int[N]; local
27 array[i] = i;
28 std::random_shuffle(array, array+N);
29 std::partial_sort(array, array+M, array+N);
31 assert(array[i] == i);
32 delete [] array;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort.pass.cpp | 25 int* array = new int[N]; local
27 array[i] = i;
28 std::random_shuffle(array, array+N);
29 std::partial_sort(array, array+M, array+N);
31 assert(array[i] == i);
32 delete [] array;
|
| /art/test/456-baseline-array-set/src/ |
| Main.java | 24 Integer[] array = new Integer[2]; local
26 // allocator, generating code for the array set would fail on x86.
27 array[index] = array[index + 1];
28 array[index] = value;
|
| /bionic/libc/arch-mips/bionic/ |
| crtbegin.c | 44 structors_array_t array; local
45 array.preinit_array = &__PREINIT_ARRAY__;
46 array.init_array = &__INIT_ARRAY__;
47 array.fini_array = &__FINI_ARRAY__;
49 __libc_init(raw_args, NULL, &main, &array);
|
| /bionic/libc/arch-mips64/bionic/ |
| crtbegin.c | 44 structors_array_t array; local
45 array.preinit_array = &__PREINIT_ARRAY__;
46 array.init_array = &__INIT_ARRAY__;
47 array.fini_array = &__FINI_ARRAY__;
49 __libc_init(raw_args, NULL, &main, &array);
|
