| /external/libopus/celt/arm/ |
| D | pitch_arm.h | 36 const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2);
42 …ine dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), PRESUME_NEON(dual_inner_prod)(x… argument
60 const opus_val16 *y01, const opus_val16 *y02, int N, opus_val32 *xy1, opus_val32 *xy2);
62 …ne dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((*DUAL_INNER_PROD_IMPL[(arch)&OPUS_ARCHMASK])(… argument
65 … define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) ((void)(arch), dual_inner_prod_neon(x, y0… argument
|
| D | pitch_neon_intr.c | 76 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon() argument
116 *xy1 = xy01; in dual_inner_prod_neon()
123 celt_assert(xy1_c == *xy1); in dual_inner_prod_neon()
143 opus_val32 xy, xy0 = 0, xy1 = 0, xy2 = 0, xy3 = 0; in celt_inner_prod_neon_float_c_simulation() local
146 xy1 = MAC16_16(xy1, x[i + 1], y[i + 1]); in celt_inner_prod_neon_float_c_simulation()
151 xy1 += xy3; in celt_inner_prod_neon_float_c_simulation()
152 xy = xy0 + xy1; in celt_inner_prod_neon_float_c_simulation()
163 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon_float_c_simulation() argument
187 *xy1 = xy01; in dual_inner_prod_neon_float_c_simulation()
235 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_neon() argument
[all …]
|
| /external/skia/tests/ |
| D | PathOpsCubicQuadIntersectionTest.cpp | 80 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection() local
83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
|
| D | PathOpsConicQuadIntersectionTest.cpp | 59 SkDPoint xy1 = conic.ptAtT(tt1); in conicQuadIntersection() local
62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
|
| D | PathOpsCubicConicIntersectionTest.cpp | 70 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicConicIntersection() local
73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
|
| D | PathOpsCubicIntersectionTest.cpp | 59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases() local
62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
419 SkDPoint xy1, xy2; in oneOff() local
422 xy1 = c1.ptAtT(tt1); in oneOff()
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest() local
[all …]
|
| D | PathOpsQuadIntersectionTest.cpp | 44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases() local
47 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY, in standardTestCases()
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1() local
351 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2); in oneOffTest1()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 155 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne() local
158 if (!xy1.approximatelyEqual(xy2)) { in testOne()
160 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in testOne()
162 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in testOne()
|
| /external/skqp/tests/ |
| D | PathOpsCubicQuadIntersectionTest.cpp | 80 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection() local
83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
85 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
|
| D | PathOpsConicQuadIntersectionTest.cpp | 59 SkDPoint xy1 = conic.ptAtT(tt1); in conicQuadIntersection() local
62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
64 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
|
| D | PathOpsCubicConicIntersectionTest.cpp | 70 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicConicIntersection() local
73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
75 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
|
| D | PathOpsCubicIntersectionTest.cpp | 59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases() local
62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
64 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
419 SkDPoint xy1, xy2; in oneOff() local
422 xy1 = c1.ptAtT(tt1); in oneOff()
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest() local
[all …]
|
| D | PathOpsQuadIntersectionTest.cpp | 44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases() local
47 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
49 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY, in standardTestCases()
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1() local
351 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
354 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in oneOffTest1()
359 outer, inner, tt1, xy1.fX, xy1.fY, tt2); in oneOffTest1()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 155 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne() local
158 if (!xy1.approximatelyEqual(xy2)) { in testOne()
160 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in testOne()
162 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in testOne()
|
| /external/fonttools/Lib/fontTools/misc/ |
| D | transform.py | 239 xx1, xy1, yx1, yy1, dx1, dy1 = other
242 xx1*xx2 + xy1*yx2,
243 xx1*xy2 + xy1*yy2,
262 xx1, xy1, yx1, yy1, dx1, dy1 = self
265 xx1*xx2 + xy1*yx2,
266 xx1*xy2 + xy1*yy2,
|
| /external/libopus/celt/x86/ |
| D | pitch_sse.h | 144 opus_val32 *xy1,
157 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
158 ((void)(arch),dual_inner_prod_sse(x, y01, y02, N, xy1, xy2))
169 opus_val32 *xy1,
172 #define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
173 ((*DUAL_INNER_PROD_IMPL[(arch) & OPUS_ARCHMASK])(x, y01, y02, N, xy1, xy2))
|
| D | pitch_sse.c | 80 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_sse() argument
97 _mm_store_ss(xy1, xsum1); in dual_inner_prod_sse()
103 *xy1 = MAC16_16(*xy1, x[i], y01[i]); in dual_inner_prod_sse()
|
| /external/skia/tools/gpu/ |
| D | YUVUtils.cpp | 82 SkPoint xy1 {(x + 0.5f), in onGetPixels() local
84 xy1 = om.mapPoint(xy1); in onGetPixels()
85 xy1.fX *= normX; in onGetPixels()
86 xy1.fY *= normY; in onGetPixels()
94 yuva[c] = look_up(xy1, pmap, yuvaLocations[c].fChannel); in onGetPixels()
99 yuva[3] = look_up(xy1, pmap, aChan); in onGetPixels()
|
| /external/skqp/src/compute/sk/ |
| D | SkDevice_Compute.cpp | 550 SkPoint const xy1, in line_stroked_butt() argument
553 float const dx = xy1.fX - xy0.fX; in line_stroked_butt()
554 float const dy = xy1.fY - xy0.fY; in line_stroked_butt()
570 err = skc_path_line_to(fPB,xy1.fX-rx,xy1.fY+ry); in line_stroked_butt()
571 err = skc_path_line_to(fPB,xy1.fX+rx,xy1.fY-ry); in line_stroked_butt()
664 const SkPoint xy1 = points[i]; in drawPoints() local
665 line_stroked_butt(xy0, xy1, radius); in drawPoints()
666 xy0 = xy1; in drawPoints()
|
| /external/libopus/celt/ |
| D | pitch.h | 138 int N, opus_val32 *xy1, opus_val32 *xy2) in dual_inner_prod_c() argument
148 *xy1 = xy01; in dual_inner_prod_c()
153 # define dual_inner_prod(x, y01, y02, N, xy1, xy2, arch) \ argument
154 ((void)(arch),dual_inner_prod_c(x, y01, y02, N, xy1, xy2))
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| D | p3-0x.cpp | 22 X<Y> xy1 = f0(xvalue<Y>()); in test_f0() local
34 X<Y> xy1 = f1(xvalue<Y>()); in test_f1() local
|
| /external/llvm-project/llvm/test/CodeGen/Hexagon/ |
| D | coalescing-hvx-across-calls.ll | 11 define inreg <64 x i32> @danny(%struct.descr* %desc, i32 %xy0, i32 %xy1) #0 {
14 %call1 = tail call inreg <32 x i32> @kirby(%struct.descr* %desc, i32 %xy1) #3
|
| /external/llvm-project/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| D | p3-0x.cpp | 52 X<Y> xy1 = f0(xvalue<Y>()); in test_f0() local
64 X<Y> xy1 = f1(xvalue<Y>()); in test_f1() local
|
| /external/skia/resources/sksl/dslfp/ |
| D | GrDSLFPTest_Swizzle.fp | 9 v = half4(v.xy1, 1);
46 b = bool4(b.xy1, true);
|
| /external/toybox/tests/files/bc/ |
| D | misc2_results.txt | 1 xy1
|