/external/clang/test/CodeGen/ |
2007-11-29-ArraySizeFromInitializer.c | 3 int array[] = {1, 2, 3, 4, 5}; variable
|
2003-07-22-ArrayAccessTypeSafety.c | 4 void test(int* array, long long N) { 5 array[N] = N[array] = 33;
|
2004-03-09-LargeArrayInitializers.c | 9 const int array[] = { local 31 return array[x];
|
/external/libcxx/test/std/containers/sequences/array/array.zero/ |
tested_elsewhere.pass.cpp | 10 // <array> 12 // support for zero-sized array 14 #include <array>
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.zero/ |
tested_elsewhere.pass.cpp | 10 // <array> 12 // support for zero-sized array 14 #include <array>
|
/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...] |
array.c | 25 #include <shared/array.h> 27 /* basic pointer array growing in steps */ 30 static int array_realloc(struct array *array, size_t new_total) 32 void *tmp = realloc(array->array, sizeof(void *) * new_total); 35 array->array = tmp; 36 array->total = new_total; 40 void array_init(struct array *array, size_t step [all...] |
/external/clang/test/Sema/ |
warn-tautological-compare.c | 15 if (!b) {} // expected-warning {{address of array 'b' will always evaluate to 'true'}} 16 if (b == 0) {} // expected-warning {{comparison of array 'b' equal to a null pointer is always false}} 17 if (!c.x) {} // expected-warning {{address of array 'c.x' will always evaluate to 'true'}} 18 if (c.x == 0) {} // expected-warning {{comparison of array 'c.x' equal to a null pointer is always false}} 19 if (!str) {} // expected-warning {{address of array 'str' will always evaluate to 'true'}} 20 if (0 == str) {} // expected-warning {{comparison of array 'str' equal to a null pointer is always false}} 23 int array[2]; variable 26 if (!array) { // expected-warning {{address of array 'array' will always evaluate to 'true'} [all...] |
warn-char-subscripts.c | 4 int array[1] = { 0 }; local 6 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 10 int array[1] = { 0 }; local 12 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}} 16 int *array = 0; local 18 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 22 int *array = 0 local 29 int *array = 0; local 34 int array[1] = { 0 }; local 40 int array[1] = { 0 }; local 47 int array[1] = { 0 }; local 54 int array[1] = { 0 }; local 61 int array[1] = { 0 }; local [all...] |
/libcore/ojluni/src/main/java/java/lang/reflect/ |
Array.java | 32 * The {@code Array} class provides static methods to dynamically create and 35 * <p>{@code Array} permits widening conversions to occur during a get or set 42 class Array { 45 * Constructor. Class Array is not instantiable. 47 private Array() {} 50 * Creates a new array with the specified component type and 52 * Invoking this method is equivalent to creating an array 57 * Array.newInstance(componentType, x); 61 * <p>The number of dimensions of the new array must not 65 * component type of the new array [all...] |
/external/compiler-rt/test/asan/TestCases/ |
atoi_strict.c | 17 void test1(char *array) { 19 memset(array, '1', 10); 20 array[9] = 'a'; 21 int r = atoi(array); 25 void test2(char *array) { 27 array[9] = 'a'; 28 int r = atoi(array + 9); 32 void test3(char *array) { 34 memset(array, ' ', 10); 35 array[9] = '-' 42 char *array = (char*)malloc(10); local [all...] |
atol_strict.c | 17 void test1(char *array) { 19 memset(array, '1', 10); 20 array[9] = 'a'; 21 long r = atol(array); 25 void test2(char *array) { 27 array[9] = 'a'; 28 long r = atol(array + 9); 32 void test3(char *array) { 34 memset(array, ' ', 10); 35 array[9] = '-' 42 char *array = (char*)malloc(10); local [all...] |
atoll_strict.c | 20 void test1(char *array) { 22 memset(array, '1', 10); 23 array[9] = 'a'; 24 long long r = atoll(array); 28 void test2(char *array) { 30 array[9] = 'a'; 31 long long r = atoll(array + 9); 35 void test3(char *array) { 37 memset(array, ' ', 10); 38 array[9] = '-' 45 char *array = (char*)malloc(10); local [all...] |
strtoll_strict.c | 33 void test1(char *array, char *endptr) { 35 long long r = strtoll(array, &endptr, 3); 36 assert(array + 2 == endptr); 40 void test2(char *array, char *endptr) { 42 array[2] = 'z'; 43 long long r = strtoll(array, &endptr, 35); 44 assert(array + 2 == endptr); 48 void test3(char *array, char *endptr) { 50 memset(array, 0, 8); 51 ASAN_POISON_MEMORY_REGION(array, 8) 90 char* array = array0 + 8; local [all...] |
/art/test/527-checker-array-access-split/src/ |
Main.java | 30 /// CHECK: <<Array:l\d+>> NullCheck 32 /// CHECK: ArrayGet [<<Array>>,<<Index>>] 35 /// CHECK: <<Array:l\d+>> NullCheck 38 /// CHECK: ArrayGet [<<Array>>,<<Index>>] 42 /// CHECK: <<Array:l\d+>> NullCheck 44 /// CHECK: ArrayGet [<<Array>>,<<Index>>] 47 /// CHECK: <<Array:l\d+>> NullCheck 50 /// CHECK: ArrayGet [<<Array>>,<<Index>>] 52 public static int constantIndexGet(int array[]) { 53 return array[1] 403 int[] array = {0, 7, 14, 21}; local 516 int[] array = {64, 8, 4, 2 }; local 556 int[] array = {123, 456, 789}; local [all...] |
/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();
|
/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/SemaCXX/ |
parentheses.cpp | 5 bool test(Foo f, int *array) 7 return false && false || array[f.get()]; // expected-warning {{'&&' within '||'}} expected-note {{parentheses}}
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
array.hpp | 2 // detail/array.hpp 17 # include <array> 22 using std::array;
|
/art/test/535-deopt-and-inlining/src/ |
Main.java | 30 public static void doCall(int[] array) { 32 deopt(array); 38 public static void deopt(int[] array) { 43 $inline$deopt(array); 49 public static void $inline$deopt(int[] array) { 50 array[0] = 1; 51 array[1] = 1;
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
stable_partition.pass.cpp | 42 P array[] = local 55 const unsigned size = sizeof(array)/sizeof(array[0]); 56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); 57 assert(base(r) == array + 4); 58 assert(array[0] == P(1, 1)); 59 assert(array[1] == P(1, 2)); 60 assert(array[2] == P(3, 1)); 61 assert(array[3] == P(3, 2)) 71 P array[] = local 111 P array[] = local 140 P array[] = local 169 P array[] = local 198 P array[] = local 227 P array[] = local 256 P array[] = local 298 std::unique_ptr<int> array[size]; local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
stable_partition.pass.cpp | 42 P array[] = local 55 const unsigned size = sizeof(array)/sizeof(array[0]); 56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); 57 assert(base(r) == array + 4); 58 assert(array[0] == P(1, 1)); 59 assert(array[1] == P(1, 2)); 60 assert(array[2] == P(3, 1)); 61 assert(array[3] == P(3, 2)) 71 P array[] = local 111 P array[] = local 140 P array[] = local 169 P array[] = local 198 P array[] = local 227 P array[] = local 256 P array[] = local 298 std::unique_ptr<int> array[size]; local [all...] |
/frameworks/support/v7/appcompat/src/main/java/androidx/appcompat/content/res/ |
GrowingArrayUtils.java | 19 import java.lang.reflect.Array; 23 * arrays. Common array operations are implemented for efficient use in dynamic containers. 25 * All methods in this class assume that the length of an array is equivalent to its capacity and 26 * NOT the number of elements in the array. The current size of the array is always passed in as a 32 * Appends an element to the end of the array, growing the array if there is no more room. 33 * @param array The array to which to append the element. This must NOT be null. 34 * @param currentSize The number of elements in the array. Must be less than or equal t [all...] |
/external/eigen/doc/snippets/ |
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;
|