| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/all/ |
| test-gen.c | 121 int i3; member in struct:__anon75293
298 p2: _get_bits_var (N), i3: _get_bits_size (_get_bits_var (N))
473 long val = get_bits_from_size ((unsigned *) arg->p2, arg->i3);
510 get_bits_from_size ((unsigned *) arg->p2, arg->i3)
547 get_bits_from_size ((unsigned *) arg->p2, arg->i3)
584 unsigned reg = get_bits_from_size ((unsigned *) arg->p2, arg->i3);
608 unsigned reg = get_bits_from_size ((unsigned *) arg->p2, arg->i3);
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| p7-0x.cpp | 159 Agg<int> i3 = {0x80000000U}; // expected-error {{ cannot be narrowed }} expected-note {{silence}} local
|
| /external/mesa3d/src/mesa/program/ |
| prog_noise.c | 527 int i3, j3, k3, l3; /* The integer offsets for the fourth simplex corner */ local
552 i3 = simplex[c][0] >= 1 ? 1 : 0;
566 x3 = x0 - i3 + 3.0f * G4; /* Offsets for fourth corner in (x,y,z,w) coords */
621 grad4(perm[ii + i3 + perm[jj + j3 + perm[kk + k3 + perm[ll + l3]]]],
|
| /external/opencv3/modules/calib3d/src/ |
| circlesgrid.cpp | 512 int i1 = (int)it1->first, i2 = (int)it2->first, i3 = (int)it3->first; local
513 int val1 = distanceMatrix.at<int> (i2, i3);
516 distanceMatrix.at<int> (i1, i3) == infinity)
520 val2 = distanceMatrix.at<int> (i2, i1) + distanceMatrix.at<int> (i1, i3);
522 distanceMatrix.at<int> (i2, i3) = (val1 == infinity) ? val2 : std::min(val1, val2);
[all...] |
| /art/compiler/jni/ |
| jni_compiler_test.cc | 1565 jint i3 = 3; local
1635 jint i3 = 3; local
1704 jint i3 = 3; local
1763 jint i3 = 3; local
[all...] |
| /cts/tests/tests/renderscript/src/android/renderscript/cts/ |
| ComputeTest.java | 135 Int3 i3 = new Int3(); local
136 i3.x = 1;
137 i3.y = 2;
138 i3.z = 3;
139 i3 = new Int3(1, 2, 3);
140 assertTrue(i3.x == 1);
141 assertTrue(i3.y == 2);
142 assertTrue(i3.z == 3);
287 avtItem.i3.x = 1;
288 avtItem.i3.y = 2
[all...] |
| /external/clang/test/CodeGen/ |
| arm64-arguments.c | 297 int f38_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8,
299 // CHECK: define i32 @f38_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, i64 %s1.coerce, i64 %s2.coerce)
308 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
350 int f39_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8,
352 // CHECK: define i32 @f39_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, i128 %s1.coerce, i128 %s2.coerce)
361 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
405 int f40_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8,
407 // CHECK: define i32 @f40_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, [2 x i64] %s1.coerce, [2 x i64] %s2.coerce)
416 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
460 int f41_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8
488 int i3; member in struct:s42
545 int i3; member in struct:s43
[all...] |
| /external/clang/test/Misc/ |
| diag-template-diffing.cpp | 94 class I3{};
95 void set3(I3<&V1, &V2>) {};
97 set3(I3<&V3, &V2>());
100 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'I3<&V3, [...]>' to 'I3<&V1, [...]>' for 1st argument
102 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'I3<&V3, &V2>' to 'I3<&V1, &V2>' for 1st argument
105 // CHECK-ELIDE-TREE: I3<
110 // CHECK-NOELIDE-TREE: I3<
962 int i1, i2, i3; member in namespace:VariadicDefault
[all...] |
| /external/clang/test/Sema/ |
| array-init.c | 169 int i3[] = {}; //expected-warning{{zero size arrays are an extension}} expected-warning{{use of GNU empty initializer extension}} local
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_state_setup.c | 101 LLVMValueRef i3 = lp_build_const_int32(gallivm, 3); local
108 res = LLVMBuildInsertElement(bld, res, d, i3, name);
|
| /external/opencv/cv/src/ |
| cvcontours.cpp | 539 schar *i0 = ptr, *i1, *i3, *i4 = 0; local
576 i3 = i0;
586 i4 = i3 + deltas[++s];
595 *i3 = (schar) (nbd | -128);
597 else if( *i3 == 1 )
599 *i3 = nbd;
621 if( i4 == i0 && i3 == i1 )
624 i3 = i4;
652 schar *i0 = ptr, *i1, *i3, *i4; local
672 i3 = i0
711 schar *i0 = ptr, *i1, *i3, *i4; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvlmeds.cpp | 410 int i, i3; local
420 for( i = 0, i3 = 0; i < num; i++, i3 += 3 )
423 l1 = F[0] * mr[i3] + F[1] * mr[i3 + 1] + F[2];
424 l2 = F[3] * mr[i3] + F[4] * mr[i3 + 1] + F[5];
425 l3 = F[6] * mr[i3] + F[7] * mr[i3 + 1] + F[8];
427 d1 = (l1 * ml[i3] + l2 * ml[i3 + 1] + l3) / sqrt( l1 * l1 + l2 * l2 )
585 int i3, i9, j, num3, its = 0, a, t; local
850 int i, i3, j, j3, t; local
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| contours.cpp | 509 schar *i0 = ptr, *i1, *i3, *i4 = 0; local
546 i3 = i0;
556 i4 = i3 + deltas[++s];
565 *i3 = (schar) (nbd | -128);
567 else if( *i3 == 1 )
569 *i3 = nbd;
591 if( i4 == i0 && i3 == i1 )
594 i3 = i4;
620 schar *i0 = ptr, *i1, *i3, *i4; local
640 i3 = i0
679 schar *i0 = ptr, *i1, *i3, *i4; local
804 int *i0 = ptr, *i1, *i3, *i4; local
864 int *i0 = ptr, *i1, *i3, *i4; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOM3TreeWalker.java | 1984 int i3 = ENTITIES; local
[all...] |
| /external/clang/test/CXX/drs/ |
| dr2xx.cpp | 1035 C::type i3; member in namespace:dr298
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/timezone/ |
| TimeZoneRuleTest.java | 765 InitialTimeZoneRule i3 = new InitialTimeZoneRule("i3", -3*HOUR, 1*HOUR); local
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| tzrulets.cpp | 1226 InitialTimeZoneRule *i3 = new InitialTimeZoneRule("i3", -3*HOUR, 1*HOUR); local
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timezone/ |
| TimeZoneRuleTest.java | 761 InitialTimeZoneRule i3 = new InitialTimeZoneRule("i3", -3*HOUR, 1*HOUR); local
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 26 int i3[] = {1, 0}; local
29 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
|
| is_heap_comp.pass.cpp | 27 int i3[] = {1, 0}; local
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
[all...] |
| is_heap_until.pass.cpp | 26 int i3[] = {1, 0}; local
29 assert(std::is_heap_until(i3, i3+2) == i3+2);
|
| is_heap_until_comp.pass.cpp | 27 int i3[] = {1, 0}; local
30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1);
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Intersector.java | 666 int i3 = indices[i + 2] * vertexSize; local
670 tmp3.set(vertices[i3], vertices[i3 + 1], vertices[i3 + 2]), tmp);
[all...] |
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_tgsi_soa.c | 1510 LLVMValueRef i3 = lp_build_const_int32(gallivm, 3); local
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-run-machops.cc | 4732 Node* i3 = m.Int32Add(n4, n5); local
[all...] |
