/external/clang/test/CXX/temp/temp.param/ |
H A D | p1.cpp | 12 X0<int> x0; // expected-error{{too few template arguments for class template 'X0'}} variable
|
/external/valgrind/main/memcheck/tests/darwin/ |
H A D | scalar_nocancel.c | 13 // uninitialised, but we know px[0] is 0x0 15 long x0 = px[0]; local 52 SY(__NR_sem_wait_nocancel, x0); FAIL;
|
H A D | scalar.c | 13 // uninitialised, but we know px[0] is 0x0 15 long x0 = px[0]; local 31 SY(__NR_read+(int)x0, x0, x0, x0+1); FAILx(EFAULT); 34 SY(__NR_write, x0, x0, x0+1); FAIL; 35 //res = write(x0, x [all...] |
/external/valgrind/main/memcheck/tests/x86-linux/ |
H A D | scalar_exit_group.c | 5 // uninitialised, but we know px[0] is 0x0 7 long x0 = px[0]; local 14 SY(__NR_exit_group, x0);
|
H A D | scalar.c | 29 // uninitialised, but we know px[0] is 0x0 31 long x0 = px[0]; local 51 SY(__NR_read+x0, x0, x0, x0+1); FAILx(EFAULT); 55 SY(__NR_write, x0, x0, x0+1); FAIL; 59 SY(__NR_open, x0, x [all...] |
/external/clang/test/ASTMerge/Inputs/ |
H A D | var1.c | 1 int *x0; variable
|
H A D | var2.c | 1 int *x0; variable
|
/external/clang/test/Sema/ |
H A D | array-size.c | 4 int x0[1073741824]; // expected-error{{array is too large}} local
|
H A D | struct-decl.c | 46 struct x0 { struct
|
/external/clang/test/CXX/temp/temp.res/temp.local/ |
H A D | p1.cpp | 30 X0<int> x0; (void)x0; local
|
/external/clang/test/PCH/ |
H A D | functions.c | 8 int f0(int x0, int y0, ...) { return x0 + y0; } argument
|
H A D | pr4489.c | 33 void x0(void) function
|
/external/clang/test/SemaTemplate/ |
H A D | unused-variables.cpp | 11 X0 x0; local
|
/external/dropbear/libtommath/ |
H A D | bn_mp_karatsuba_sqr.c | 27 mp_int x0, x1, t1, t2, x0x0, x1x1; local 39 if (mp_init_size (&x0, B) != MP_OKAY) 61 dst = x0.dp; 72 x0.used = B; 75 mp_clamp (&x0); 77 /* now calc the products x0*x0 and x1*x1 */ 78 if (mp_sqr (&x0, &x0x0) != MP_OKAY) 79 goto X1X1; /* x0x0 = x0*x0 */ [all...] |
H A D | bn_mp_karatsuba_mul.c | 49 mp_int x0, x1, y0, y1, t1, x0y0, x1y1; local 62 if (mp_init_size (&x0, B) != MP_OKAY) 80 x0.used = y0.used = B; 94 tmpx = x0.dp; 115 mp_clamp (&x0); 119 /* after this x0 is no longer required, free temp [x0==t2]! */ 120 if (mp_mul (&x0, &y0, &x0y0) != MP_OKAY) 121 goto X1Y1; /* x0y0 = x0*y0 */ 125 /* now calc x1+x0 an [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
H A D | Intersection.java | 48 private static final void findMinMax(float x0, float x1, float x2, Vector3f minMax) { argument 49 minMax.set(x0, x0, 0);
|
/external/skia/samplecode/ |
H A D | SampleLCD.cpp | 43 SkScalar x0 = SkIntToScalar(10); local 52 canvas->drawText(text, len, x0, y, paint);
|
H A D | SampleDash.cpp | 65 SkScalar x0 = SkIntToScalar(10); local 67 SkScalar x1 = x0 + SkIntToScalar(1000); 77 canvas->drawLine(x0, y0, x1, y0, paint); 84 canvas->drawLine(x0, y0, x1, y0, paint);
|
/external/bluetooth/bluedroid/embdrv/sbc/encoder/srce/ |
H A D | sbc_dct.c | 87 register SINT32 x0, x1, x2, x3, x4, x5, x6, x7,temp; local 89 /*x0= (pInVect[4])/2 ;*/ 90 SBC_IDCT_MULT(SBC_COS_PI_SUR_4,pInVect[4], x0); 91 /*printf("x0 0x%x = %d = %d * %d\n", x0, x0, SBC_COS_PI_SUR_4, pInVect[4]);*/ 101 /* 2-point IDCT of x0 and x4 as in (11) */ 102 temp = x0 ; 103 SBC_IDCT_MULT(SBC_COS_PI_SUR_4, ( x0 + x4 ), x0); /*x [all...] |
/external/clang/test/CXX/temp/temp.decls/temp.mem/ |
H A D | p5.cpp | 75 void test_X0(X0 x0, const X0 &x0c) { argument 76 x0.operator const int*(); // expected-note{{in instantiation of function template specialization}} 77 x0.operator float *();
|
/external/clang/test/SemaCXX/ |
H A D | member-pointers-2.cpp | 44 X0* x0; member in struct:rdar9065289::X1 49 (p.x0->*(p.fptr))();
|
H A D | pseudo-destructors.cpp | 70 void test_X0(N1::X0 &x0) { argument 71 x0.~X0();
|
/external/libvpx/vp8/common/ |
H A D | textblit.c | 21 0x0, 0x5C00, 0x8020, 0xAFABEA, 0xD7EC0, 0x1111111, 0x1855740, 0x18000, 61 void vp8_blit_line(int x0, int x1, int y0, int y1, unsigned char *image, const int pitch) argument 63 int steep = abs(y1 - y0) > abs(x1 - x0); 70 t = x0; 71 x0 = y0; 79 if (x0 > x1) 82 t = x0; 83 x0 = x1; 91 deltax = x1 - x0; 104 for (x = x0; [all...] |
/external/openssl/crypto/rc2/ |
H A D | rc2_cbc.c | 140 register RC2_INT x0,x1,x2,x3,t; local 144 x0=(RC2_INT)l&0xffff; 156 t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; 157 x0=(t<<1)|(t>>15); 158 t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; 160 t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; 162 t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; 170 x0+=p1[x3&0x3f]; 171 x1+=p1[x0 185 register RC2_INT x0,x1,x2,x3,t; local [all...] |
/external/skia/src/core/ |
H A D | SkClampRange.cpp | 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge 14 * given each step is followed by x0 += dx 16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) { argument 20 if (x0 >= edge) { 26 int64_t n = (edge - x0 + dx - 1) / dx;
|