/external/skia/tests/ |
PathOpsConicQuadIntersectionTest.cpp | 54 SkDPoint xy2 = quad.ptAtT(tt2); local 55 if (!xy1.approximatelyEqual(xy2)) { 57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicConicIntersectionTest.cpp | 58 SkDPoint xy2 = conic.ptAtT(tt2); local 59 if (!xy1.approximatelyEqual(xy2)) { 61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicQuadIntersectionTest.cpp | 82 SkDPoint xy2 = quad.ptAtT(tt2); local 83 if (!xy1.approximatelyEqual(xy2)) { 85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicIntersectionTest.cpp | 61 SkDPoint xy2 = c2.ptAtT(tt2); local 62 if (!xy1.approximatelyEqual(xy2)) { 64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 419 SkDPoint xy1, xy2; local 424 xy2 = c2.ptAtT(tt2); 429 iPt.fY, xy2.fX, xy2.fY, tt2); 432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)) 520 SkDPoint xy2 = c2.ptAtT(tt2); local [all...] |
PathOpsCubicLineIntersectionTest.cpp | 153 SkDPoint xy2 = line.ptAtT(tt2); local 154 if (!xy1.approximatelyEqual(xy2)) { 156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 158 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsQuadIntersectionTest.cpp | 46 SkDPoint xy2 = quad2.ptAtT(tt2); local 47 if (!xy1.approximatelyEqual(xy2)) { 50 tt2, xy2.fX, xy2.fY); 350 SkDPoint xy2 = quad2.ptAtT(tt2); local 351 if (!xy1.approximatelyEqual(xy2)) { 354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
|
/external/skqp/tests/ |
PathOpsConicQuadIntersectionTest.cpp | 54 SkDPoint xy2 = quad.ptAtT(tt2); local 55 if (!xy1.approximatelyEqual(xy2)) { 57 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicConicIntersectionTest.cpp | 58 SkDPoint xy2 = conic.ptAtT(tt2); local 59 if (!xy1.approximatelyEqual(xy2)) { 61 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicQuadIntersectionTest.cpp | 82 SkDPoint xy2 = quad.ptAtT(tt2); local 83 if (!xy1.approximatelyEqual(xy2)) { 85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsCubicIntersectionTest.cpp | 61 SkDPoint xy2 = c2.ptAtT(tt2); local 62 if (!xy1.approximatelyEqual(xy2)) { 64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 418 SkDPoint xy1, xy2; local 423 xy2 = c2.ptAtT(tt2); 428 iPt.fY, xy2.fX, xy2.fY, tt2); 431 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)) 519 SkDPoint xy2 = c2.ptAtT(tt2); local [all...] |
PathOpsCubicLineIntersectionTest.cpp | 153 SkDPoint xy2 = line.ptAtT(tt2); local 154 if (!xy1.approximatelyEqual(xy2)) { 156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 158 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
PathOpsQuadIntersectionTest.cpp | 46 SkDPoint xy2 = quad2.ptAtT(tt2); local 47 if (!xy1.approximatelyEqual(xy2)) { 50 tt2, xy2.fX, xy2.fY); 350 SkDPoint xy2 = quad2.ptAtT(tt2); local 351 if (!xy1.approximatelyEqual(xy2)) { 354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
|
/external/libopus/celt/arm/ |
pitch_arm.h | 36 const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2); 42 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), PRESUME_NEON(dual_inner_prod)(x, y01, y02, N, xy1, xy2)) 60 const opus_val16 *y01, const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2); 62 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((*DUAL_INNER_PROD_IMPL[(arch)&OPUS_ARCHMASK])(x, y01, y02, N, xy1, xy2)) 65 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), dual_inner_prod_neon(x, y01, y02, N, xy1, xy2))
|
pitch_neon_intr.c | 76 int N, opus_val32 *xy1, opus_val32 *xy2) 117 *xy2 = xy02; 124 celt_assert(xy2_c == *xy2); 143 opus_val32 xy, xy0 = 0, xy1 = 0, xy2 = 0, xy3 = 0; local 147 xy2 = MAC16_16(xy2, x[i + 2], y[i + 2]); 150 xy0 += xy2; 163 int N, opus_val32 *xy1, opus_val32 *xy2) 188 *xy2 = xy02; 235 int N, opus_val32 *xy1, opus_val32 *xy2) [all...] |
arm_celt_map.c | 47 int N, opus_val32 *xy1, opus_val32 *xy2) = {
|
/external/fonttools/Lib/fontTools/misc/ |
transform.py | 192 xx2, xy2, yx2, yy2, dx2, dy2 = self.__affine 195 xx1*xy2 + xy1*yy2, 197 yx1*xy2 + yy1*yy2, 199 xy2*dx1 + yy2*dy1 + dy2) 215 xx2, xy2, yx2, yy2, dx2, dy2 = other 218 xx1*xy2 + xy1*yy2, 220 yx1*xy2 + yy1*yy2, 222 xy2*dx1 + yy2*dy1 + dy2) 293 xx2, xy2, yx2, yy2, dx2, dy2 = other 295 (xx2, xy2, yx2, yy2, dx2, dy2 [all...] |
/external/libopus/celt/x86/ |
pitch_sse.h | 145 opus_val32 *xy2); 157 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ 158 ((void)(arch),dual_inner_prod_sse(x, y01, y02, N, xy1, xy2)) 170 opus_val32 *xy2); 172 #define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ 173 ((*DUAL_INNER_PROD_IMPL[(arch) & OPUS_ARCHMASK])(x, y01, y02, N, xy1, xy2))
|
pitch_sse.c | 80 int N, opus_val32 *xy1, opus_val32 *xy2) 100 _mm_store_ss(xy2, xsum2); 104 *xy2 = MAC16_16(*xy2, x[i], y02[i]);
|
x86_celt_map.c | 126 opus_val32 *xy2
|
/frameworks/rs/tests/java_api/VrDemo/src/com/example/android/rs/vr/engine/ |
mandelbulb.rs | 44 float xy2 = p.x * p.x + p.y * p.y;
45 if (xy2 == 0) return out;
47 out.x = (z23x2y2 * p.x * (p.x * p.x - 3 * p.y * p.y)) / xy2;
48 out.y = (z23x2y2 * p.y * (3 * p.x * p.x - p.y * p.y)) / xy2;
|
/external/mesa3d/src/gallium/winsys/svga/drm/ |
vmw_screen_dri.c | 137 int xy2; local 141 xy2 = ((int)src->x2 < (int)bbox->x2 + dst_x) ? src->x2 : 143 if (xy1 >= xy2 || xy1 < 0) 147 dst->x2 = xy2; 151 xy2 = ((int)src->y2 < (int)bbox->y2 + dst_y) ? src->y2 : 153 if (xy1 >= xy2 || xy1 < 0) 157 dst->y2 = xy2;
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
p3-0x.cpp | 23 X<Y&> xy2 = f0(lvalue<Y>()); local
|
/external/libopus/celt/ |
pitch.h | 138 int N, opus_val32 *xy1, opus_val32 *xy2) 149 *xy2 = xy02; 153 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ 154 ((void)(arch),dual_inner_prod_c(x, y01, y02, N, xy1, xy2))
|
/external/libopus/celt/mips/ |
pitch_mipsr1.h | 39 int N, opus_val32 *xy1, opus_val32 *xy2, int arch) 61 *xy2 = xy02;
|
/external/speex/libspeex/ |
filters_bfin.h | 87 VARDECL(spx_word32_t *xy2); 93 ALLOC(xy2, (N+1), spx_word32_t); 95 xy = xy2+1;
|