| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| D | Collections2Test.java | 340 Object[] arr2 = new Object[20]; in test_Disjoint() local
341 for (int i = 0; i < arr2.length; i++) { in test_Disjoint()
342 arr2[i] = new Integer(100 + i); in test_Disjoint()
347 Collections.addAll(c2, arr2); in test_Disjoint()
349 c1.add(arr2[10]); in test_Disjoint()
355 Collections.addAll(c2, arr2); in test_Disjoint()
357 c1.add(arr2[10]); in test_Disjoint()
363 Collections.addAll(c2, arr2); in test_Disjoint()
365 c1.add(arr2[10]); in test_Disjoint()
371 Collections.addAll(c2, arr2); in test_Disjoint()
[all …]
|
| /external/v8/test/mjsunit/ |
| 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/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Array/ |
| D | regress-178722.js | 73 var arr2 = new Array(); variable
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/Sema/ |
| D | designated-initializers.c | 182 u_short arr2[3]; member
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 unio…
|
| D | vector-init.c | 43 …short4 arr2[2] = { test3_helper(), test3_helper() }; // expected-error 2 {{initializing 'short4' w… in test3() local
|
| /external/clang/test/CodeGenCXX/ |
| D | template-instantiation.cpp | 152 static const int arr2[]; member
161 template <typename T> const int S<T>::arr2[] = { 1, 2, kBar }; // no side effects member in PR10001::S<T>
163 template <typename T> const int S<T>::y = sizeof(arr2) / sizeof(arr2[0]);
|
| D | global-array-destruction.cpp | 22 S arr2[2]; variable
|
| /external/valgrind/main/memcheck/tests/ |
| D | origin6-fp.c | 85 double r, **arr, **arr2, **arr3; in main() local
88 arr2 = do3x3smooth( arr, nArr ); in main()
89 arr3 = do3x3smooth( arr2, nArr-2 ); in main()
|
| D | origin5-bz2.c | 593 UInt32* arr2; member
3082 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
3116 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
4037 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
4539 s->arr2 = NULL; in BZ_API()
4544 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
4547 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
4549 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
4564 s->block = (UChar*)s->arr2; in BZ_API()
4843 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|
| D | varinfo6.c | 631 UInt32* arr2; member
3120 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
3154 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
4075 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
4577 s->arr2 = NULL; in BZ_API()
4582 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
4585 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
4587 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
4602 s->block = (UChar*)s->arr2; in BZ_API()
4881 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|
| /external/opencv/cxcore/src/ |
| 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[0] = t1; \
228 t0 = arr2[1]; \
[all …]
|
| /external/valgrind/main/VEX/priv/ |
| D | host_generic_regs.c | 211 HInstr** arr2 = LibVEX_Alloc(ha->arr_size * 2 * sizeof(HInstr*)); in addHInstr() local
213 arr2[i] = ha->arr[i]; in addHInstr()
215 ha->arr = arr2; in addHInstr()
|
| D | host_generic_reg_alloc2.c | 222 RRegLR* arr2; in ensureRRLRspace() local
227 arr2 = LibVEX_Alloc(2 * *size * sizeof(RRegLR)); in ensureRRLRspace()
229 arr2[k] = (*info)[k]; in ensureRRLRspace()
231 *info = arr2; in ensureRRLRspace()
|
| /external/llvm/unittests/ADT/ |
| D | HashingTest.cpp | 151 const int arr2[] = { 3, 2, 1 }; in TEST() local
152 hash_code arr2_hash = hash_combine_range(begin(arr2), end(arr2)); in TEST()
353 const size_t arr2[] = { s1, s2, s3 }; in TEST() local
354 EXPECT_EQ(hash_combine_range(begin(arr2), end(arr2)), in TEST()
|
| /external/zlib/contrib/dotzlib/DotZLib/ |
| D | UnitTests.cs | 72 byte[] arr2 = (byte[])arr.Clone(); in BlockPutGet()
73 Assert.AreEqual( 9, buf.Get(arr2,1,9) ); in BlockPutGet()
74 Assert.IsTrue( Utils.byteArrEqual(arr,arr2) ); in BlockPutGet()
|
| /external/clang/test/SemaCXX/ |
| D | i-c-e-cxx.cpp | 68 int arr2[castfloat]; // ok variable
|
| /external/clang/test/CodeGen/ |
| D | ms_struct-bitfield.c | 118 static int arr2[(sizeof(t2) == 2) -1]; variable
|
| /external/clang/test/SemaObjC/ |
| D | enum-fixed-type.m | 33 int arr2[(sizeof(typeof(IntegerEnum)) == sizeof(typeof(long))) - 1]; function
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | load.ll | 7 @arr2 = internal unnamed_addr constant [50 x i32] [i32 49, i32 48, i32 47, i32 46, i32 45, i32 44, …
22 %arrayidx1 = getelementptr inbounds [50 x i32]* @arr2, i32 0, i32 %i.03
|
| /external/bzip2/ |
| D | bzlib.c | 173 s->arr2 = NULL; in BZ_API()
178 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
181 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
183 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
198 s->block = (UChar*)s->arr2; in BZ_API()
477 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|
| D | bzlib_private.h | 211 UInt32* arr2; member
|
| /external/opencv/cxcore/include/ |
| 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/ |
| D | test_bzip2.c | 577 UInt32* arr2; member
3067 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
3101 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
4022 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
4524 s->arr2 = NULL; in BZ_API()
4529 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
4532 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
4534 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
4549 s->block = (UChar*)s->arr2; in BZ_API()
4828 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|
| /external/valgrind/main/perf/ |
| D | bz2.c | 593 UInt32* arr2; member
3082 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
3116 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
4037 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
4539 s->arr2 = NULL; in BZ_API()
4544 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
4547 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
4549 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
4564 s->block = (UChar*)s->arr2; in BZ_API()
4843 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|
| /external/valgrind/main/exp-sgcheck/tests/ |
| D | hackedbz2.c | 600 UInt32* arr2; member
3091 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
3125 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
4046 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
4548 s->arr2 = NULL; in BZ_API()
4553 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
4556 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
4558 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
4573 s->block = (UChar*)s->arr2; in BZ_API()
4852 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
|