/external/clang/test/CodeGenCXX/ |
H A D | global-array-destruction.cpp | 22 S arr2[2]; variable
|
H A D | template-instantiation.cpp | 152 static const int arr2[]; member in struct:PR10001::S 161 template <typename T> const int S<T>::arr2[] = { 1, 2, kBar }; // no side effects member in class:PR10001::S 163 template <typename T> const int S<T>::y = sizeof(arr2) / sizeof(arr2[0]);
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Array/ |
H A D | regress-178722.js | 73 var arr2 = new Array(); 89 arr = arr2.sort(); 90 actual = arr instanceof Array && arr.length === 0 && arr === arr2; 123 arr = arr2.sort(g); 124 actual = arr instanceof Array && arr.length === 0 && arr === arr2;
|
/external/clang/test/SemaCXX/ |
H A D | i-c-e-cxx.cpp | 68 int arr2[castfloat]; // ok variable
|
H A D | constant-expression-cxx11.cpp | 1214 constexpr int arr2[] = { 1, 0, 0, 3, 0, 2, 0, 4, 0, 5 }; 1215 static_assert(LastNonzero(begin(arr2), end(arr2)) == 5, "");
|
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
H A D | Collections2Test.java | 340 Object[] arr2 = new Object[20]; 341 for (int i = 0; i < arr2.length; i++) { 342 arr2[i] = new Integer(100 + i); 347 Collections.addAll(c2, arr2); 349 c1.add(arr2[10]); 355 Collections.addAll(c2, arr2); 357 c1.add(arr2[10]); 363 Collections.addAll(c2, arr2); 365 c1.add(arr2[10]); 371 Collections.addAll(c2, arr2); [all...] |
/external/clang/test/Sema/ |
H A D | designated-initializers.c | 182 u_short arr2[3]; member in union:wibble 185 const union wibble wobble = { .arr2[0] = 0xffff, 186 .arr2[1] = 0xffff, 187 .arr2[2] = 0xffff }; 189 const union wibble wobble2 = { .arr2 = {4, 5, 6}, 7 }; // expected-warning{{excess elements in union initializer}}
|
H A D | vector-init.c | 43 short4 arr2[2] = { test3_helper(), test3_helper() }; // expected-error 2 {{initializing 'short4' with an expression of incompatible type 'short8'}} local
|
/external/v8/test/mjsunit/ |
H A D | array-concat.js | 201 var arr2 = [1,3]; variable 202 var r1 = [].concat(arr1, arr2); // [,2,1,3] 207 arr2.push("X"); 210 var r2 = [].concat(arr1, arr2); // [undefined,2,1,3,"X"] 214 arr2.length = 2; 216 arr2[500000] = "X"; 219 var r3 = [].concat(arr1, arr2); // [undefined,2,1,3,"X"]
|
/external/valgrind/main/memcheck/tests/ |
H A D | origin6-fp.c | 85 double r, **arr, **arr2, **arr3; local 88 arr2 = do3x3smooth( arr, nArr ); 89 arr3 = do3x3smooth( arr2, nArr-2 );
|
H A D | origin5-bz2.c | 593 UInt32* arr2; member in struct:__anon12740 597 /* aliases for arr1 and arr2 */ 3058 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 3059 ((UChar*)arr2) [0 .. nblock-1] holds block 3063 ((UChar*)arr2) [0 .. nblock-1] holds block 3082 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3087 the first section of arr2. 3116 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3550 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 3562 (UChar*) (&((UChar*)s->arr2)[ [all...] |
H A D | varinfo6.c | 631 UInt32* arr2; member in struct:__anon12770 635 /* aliases for arr1 and arr2 */ 3095 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 3096 ((UChar*)arr2) [0 .. nblock-1] holds block 3100 ((UChar*)arr2) [0 .. nblock-1] holds block 3120 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3125 the first section of arr2. 3154 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3587 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 3599 (UChar*) (&((UChar*)s->arr2)[ [all...] |
/external/clang/test/CodeGen/ |
H A D | ms_struct-bitfield.c | 118 static int arr2[(sizeof(t2) == 2) -1]; variable
|
/external/valgrind/main/VEX/priv/ |
H A D | host_generic_regs.c | 211 HInstr** arr2 = LibVEX_Alloc(ha->arr_size * 2 * sizeof(HInstr*)); local 213 arr2[i] = ha->arr[i]; 215 ha->arr = arr2;
|
H A D | host_generic_reg_alloc2.c | 222 RRegLR* arr2; local 227 arr2 = LibVEX_Alloc(2 * *size * sizeof(RRegLR)); 229 arr2[k] = (*info)[k]; 231 *info = arr2;
|
/external/zlib/contrib/dotzlib/DotZLib/ |
H A D | UnitTests.cs | 72 byte[] arr2 = (byte[])arr.Clone();
73 Assert.AreEqual( 9, buf.Get(arr2,1,9) );
74 Assert.IsTrue( Utils.byteArrEqual(arr,arr2) );
|
/external/opencv/cxcore/src/ |
H A D | cxmatrix.cpp | 190 arrtype* arr2 = arr; \ 195 arrtype t0 = arr2[0]; \ 197 arr2[0] = t1; \ 200 arr2++; \ 203 while( arr2 != arr3 ); \ 218 arrtype* arr2 = arr; \ 221 for( ; arr2!=arr3; arr2+=3, \ 224 arrtype t0 = arr2[0]; \ 226 arr2[ [all...] |
/external/llvm/unittests/ADT/ |
H A D | HashingTest.cpp | 151 const int arr2[] = { 3, 2, 1 }; local 152 hash_code arr2_hash = hash_combine_range(begin(arr2), end(arr2)); 353 const size_t arr2[] = { s1, s2, s3 }; local 354 EXPECT_EQ(hash_combine_range(begin(arr2), end(arr2)),
|
/external/bzip2/ |
H A D | bzlib.c | 173 s->arr2 = NULL; 178 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); 181 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { 183 if (s->arr2 != NULL) BZFREE(s->arr2); 198 s->block = (UChar*)s->arr2; 477 if (s->arr2 != NULL) BZFREE(s->arr2);
|
H A D | bzlib_private.h | 211 UInt32* arr2; member in struct:__anon1051 215 /* aliases for arr1 and arr2 */
|
H A D | blocksort.c | 1021 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 1022 ((UChar*)arr2) [0 .. nblock-1] holds block 1026 ((UChar*)arr2) [0 .. nblock-1] holds block 1045 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 1050 the first section of arr2. 1079 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
|
/external/opencv/cxcore/include/ |
H A D | cxmisc.h | 799 void* arr2, int step2, CvSize size ); 803 void* arr2, int step2, 808 void* arr2, int step2, 813 void* arr2, int step2, 819 void* arr2, int step2,
|
/external/valgrind/main/VEX/switchback/ |
H A D | test_bzip2.c | 577 UInt32* arr2; member in struct:__anon12093 581 /* aliases for arr1 and arr2 */ 3043 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 3044 ((UChar*)arr2) [0 .. nblock-1] holds block 3048 ((UChar*)arr2) [0 .. nblock-1] holds block 3067 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3072 the first section of arr2. 3101 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3535 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 3547 (UChar*) (&((UChar*)s->arr2)[ [all...] |
/external/valgrind/main/exp-sgcheck/tests/ |
H A D | hackedbz2.c | 600 UInt32* arr2; member in struct:__anon12547 604 /* aliases for arr1 and arr2 */ 3067 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 3068 ((UChar*)arr2) [0 .. nblock-1] holds block 3072 ((UChar*)arr2) [0 .. nblock-1] holds block 3091 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3096 the first section of arr2. 3125 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3559 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 3571 (UChar*) (&((UChar*)s->arr2)[ [all...] |
/external/valgrind/main/perf/ |
H A D | bz2.c | 593 UInt32* arr2; member in struct:__anon12858 597 /* aliases for arr1 and arr2 */ 3058 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT] 3059 ((UChar*)arr2) [0 .. nblock-1] holds block 3063 ((UChar*)arr2) [0 .. nblock-1] holds block 3082 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3087 the first section of arr2. 3116 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); 3550 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 3562 (UChar*) (&((UChar*)s->arr2)[ [all...] |