/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_mbloop_loopfilter_dspr2.c | 36 uint32_t p3, p2, p1, p0, q0, q1, q2, q3; local 72 "lw %[p0], (%[sp0]) \n\t" 78 : [p3] "=&r" (p3), [p2] "=&r" (p2), [p1] "=&r" (p1), [p0] "=&r" (p0), 85 p1, p0, p3, p2, q0, q1, q2, q3, 89 vp9_filter1_dspr2(mask, hev, p1, p0, q0, q1, 120 "sw %[p0], (%[sp0]) \n\t" 126 : [p2] "r" (p2), [p1] "r" (p1), [p0] "r" (p0), 133 vp9_filter1_dspr2(mask, hev, p1, p0, q 334 uint32_t p3, p2, p1, p0, q3, q2, q1, q0; local [all...] |
/external/chromium_org/third_party/libwebp/enc/ |
H A D | cost.c | 495 const int p0 = res->prob[n][ctx0][0]; local 497 // bit_cost(1, p0) is already incorporated in t[] tables, but only if ctx != 0 500 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; 503 return VP8BitCost(0, p0);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/svgadump/ |
H A D | svga_shader_dump.c | 57 struct sh_srcreg p0; member in struct:dump_op 75 _debug_printf("(p0) "); 502 op->p0 = *(struct sh_srcreg *)*token;
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | glxhash.c | 122 int p0; member in struct:__glxHashTable 297 while (table->p0 < HASH_SIZE) { 304 table->p1 = table->buckets[table->p0]; 305 ++table->p0; 318 table->p0 = 0;
|
/external/chromium_org/third_party/mesa/src/src/mesa/swrast/ |
H A D | s_aatritemp.h | 42 const GLfloat *p0 = v0->attrib[FRAG_ATTRIB_WPOS]; variable 119 compute_plane(p0, p1, p2, p0[2], p1[2], p2[2], zPlane); 123 compute_plane(p0, p1, p2, v0->color[RCOMP], v1->color[RCOMP], v2->color[RCOMP], rPlane); 124 compute_plane(p0, p1, p2, v0->color[GCOMP], v1->color[GCOMP], v2->color[GCOMP], gPlane); 125 compute_plane(p0, p1, p2, v0->color[BCOMP], v1->color[BCOMP], v2->color[BCOMP], bPlane); 126 compute_plane(p0, p1, p2, v0->color[ACOMP], v1->color[ACOMP], v2->color[ACOMP], aPlane); 140 compute_plane(p0, p1, p2, invW0, invW1, invW2, wPlane); 155 compute_plane(p0, p1, p2, a0, a1, a2, attrPlane[attr][c]);
|
/external/chromium_org/third_party/re2/re2/ |
H A D | bitstate.cc | 140 // Try a search from instruction id0 in state p0. 142 bool BitState::TrySearch(int id0, const char* p0) { argument 146 Push(id0, p0, 0);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | LogoPlay.cpp | 72 static void quadApprox(SkPath &fPath, const SkPoint &p0, const SkPoint &p1, const SkPoint &p2) argument 78 midPt(j, p0, c); 79 midPt(k, p0, p1);
|
/external/chromium_org/third_party/skia/gm/ |
H A D | hairlines.cpp | 156 SkPoint p0 = SkPoint::Make(kRad * cosV, kRad * sinV); variable 162 bug->moveTo(p0);
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkParseSVGPath.cpp | 28 static void quadApprox(SkPath &fPath, const SkPoint &p0, const SkPoint &p1, const SkPoint &p2) argument 34 midPt(j, p0, c); 35 midPt(k, p0, p1);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkEdge.cpp | 34 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip, argument 40 x0 = SkScalarRoundToFDot6(p0.fX, shift); 41 y0 = SkScalarRoundToFDot6(p0.fY, shift); 46 x0 = int(p0.fX * scale); 47 y0 = int(p0.fY * scale); 163 // cheap calc of distance from center of p0-p2 to the center of the curve 237 * p0 (1 - t)^2 + p1 t(1 - t) + p2 t^2 ==> At^2 + Bt + C 239 * A = p0 - 2p1 + p2 240 * B = 2(p1 - p0) 241 * C = p0 [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsLine.cpp | 39 SkDVector p0 = fPts[1] - fPts[0]; local 41 return p0.cross(p2);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PaintTest.cpp | 120 SkPaint p0, p1; local 123 SkPaint::kNone_FilterLevel == p0.getFilterLevel()); 132 p0.setFilterLevel(gLevels[i]); 133 REPORTER_ASSERT(reporter, gLevels[i] == p0.getFilterLevel()); 134 p1 = p0; 137 p0.reset(); 139 SkPaint::kNone_FilterLevel == p0.getFilterLevel());
|
/external/chromium_org/v8/src/compiler/ |
H A D | machine-operator-reducer-unittest.cc | 528 Node* p0 = Parameter(0); local 531 Int32Constant(0), p0); 539 EXPECT_EQ(p0, r.replacement()); 542 Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), p0, 551 EXPECT_EQ(p0, r.replacement()); 581 Node* p0 = Parameter(0); local 583 graph()->NewNode(machine()->Int32SubWithOverflow(), p0, Int32Constant(0)); 591 EXPECT_EQ(p0, r.replacement());
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-changes-lowering.cc | 31 explicit ChangesLoweringTester(MachineType p0 = kMachNone) 32 : GraphBuilderTester<ReturnType>(p0), 106 Node* p0 = this->Parameter(0); local 107 Node* change = this->graph()->NewNode(op, p0); 119 Node* p0 = this->Parameter(0); local 120 Node* change = this->graph()->NewNode(op, p0);
|
/external/clang/test/CodeGenCXX/ |
H A D | copy-constructor-synthesis.cpp | 28 P p0; member in struct:X 31 printf("im = %d p0.iP = %d, p1.iP = %d\n", iP, p0.iP, p1.iP);
|
/external/deqp/framework/delibs/decpp/ |
H A D | deUniquePtr.hpp | 176 inline MovePtr<T> newMovePtr (P0 p0) { return MovePtr<T>(new T(p0)); } argument 178 inline MovePtr<T> newMovePtr (P0 p0, P1 p1) { return MovePtr<T>(new T(p0, p1)); } argument 180 inline MovePtr<T> newMovePtr (P0 p0, P1 p1, P2 p2) { return MovePtr<T>(new T(p0, p1, p2)); } argument
|
/external/deqp/modules/gles31/functional/ |
H A D | es31fFboColorbufferTests.cpp | 231 const Vec3 p0 = Vec3(float(ndx % 2) - 1.0f, float(ndx / 2) - 1.0f, 0.0f); local 232 const Vec3 p1 = p0 + Vec3(1.0f, 1.0f, 0.0f); 246 sglr::drawQuad(*getCurrentContext(), arrayTexShaderID, p0, p1); local
|
/external/deqp/modules/glshared/ |
H A D | glsRasterizationTestUtil.cpp | 84 bool isTriangleClockwise (const tcu::Vec4& p0, const tcu::Vec4& p1, const tcu::Vec4& p2) argument 86 const tcu::Vec2 u (p1.x() / p1.w() - p0.x() / p0.w(), p1.y() / p1.w() - p0.y() / p0.w()); 87 const tcu::Vec2 v (p2.x() / p2.w() - p0.x() / p0.w(), p2.y() / p2.w() - p0.y() / p0.w()); 104 bool pixelNearLineSegment (const tcu::IVec2& pixel, const tcu::Vec2& p0, cons argument [all...] |
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | Hyperplane.h | 77 static inline Hyperplane Through(const VectorType& p0, const VectorType& p1) argument 79 Hyperplane result(p0.size()); 80 result.normal() = (p1 - p0).unitOrthogonal(); 81 result.offset() = -result.normal().eigen2_dot(p0); 88 static inline Hyperplane Through(const VectorType& p0, const VectorType& p1, const VectorType& p2) argument 91 Hyperplane result(p0.size()); 92 result.normal() = (p2 - p0).cross(p1 - p0).normalized(); 93 result.offset() = -result.normal().eigen2_dot(p0);
|
/external/eigen/Eigen/src/Geometry/ |
H A D | Hyperplane.h | 88 static inline Hyperplane Through(const VectorType& p0, const VectorType& p1) argument 90 Hyperplane result(p0.size()); 91 result.normal() = (p1 - p0).unitOrthogonal(); 92 result.offset() = -p0.dot(result.normal()); 99 static inline Hyperplane Through(const VectorType& p0, const VectorType& p1, const VectorType& p2) argument 102 Hyperplane result(p0.size()); 103 result.normal() = (p2 - p0).cross(p1 - p0).normalized(); 104 result.offset() = -p0.dot(result.normal());
|
/external/eigen/test/ |
H A D | geo_hyperplane.cpp | 29 VectorType p0 = VectorType::Random(dim); local 35 HyperplaneType pl0(n0, p0); 44 VERIFY_IS_MUCH_SMALLER_THAN( pl0.absDistance(p0), Scalar(1) ); 46 VERIFY_IS_MUCH_SMALLER_THAN( pl1.signedDistance(pl1.projection(p0)), Scalar(1) );
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | GMRES.h | 73 VectorType p0 = rhs - mat*x; local 74 VectorType r0 = precond.solve(p0); 178 VectorType p0=mat*x; local 179 VectorType p1=precond.solve(p0);
|
/external/icu/icu4c/source/i18n/ |
H A D | ulocdata.c | 334 UChar *p0, *p1; local 373 p0=u_strstr(separator, sub0); 375 if (p0!=NULL && p1!=NULL && p0<=p1) { 376 separator = (const UChar *)p0 + subLen;
|
/external/libvpx/libvpx/vp8/common/ |
H A D | loopfilter_filters.c | 28 uc p3, uc p2, uc p1, uc p0, 34 mask |= (abs(p1 - p0) > limit); 38 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > blimit); 43 static signed char vp8_hevmask(uc thresh, uc p1, uc p0, uc q0, uc q1) argument 46 hev |= (abs(p1 - p0) > thresh) * -1; 282 static signed char vp8_simple_filter_mask(uc blimit, uc p1, uc p0, uc q0, uc q1) argument 288 signed char mask = (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 <= blimit) * -1; 296 signed char p0 = (signed char) * op0 ^ 0x80; local 302 filter_value = vp8_signed_char_clamp(filter_value + 3 * (q0 - p0)); 313 u = vp8_signed_char_clamp(p0 27 vp8_filter_mask(uc limit, uc blimit, uc p3, uc p2, uc p1, uc p0, uc q0, uc q1, uc q2, uc q3) argument [all...] |
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_loopfilter_filters_dspr2.c | 32 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local 82 "lw %[p0], (%[s0]) \n\t" 86 : [pm1] "=&r" (pm1), [p0] "=&r" (p0), [p5] "=&r" (p5), 92 pm1, p0, p3, p4, p5, p6, 125 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local 163 p0 = *((uint32_t *)(s3 - 4)); 168 /* transpose pm1, p0, p1, p2 */ 172 "precrq.qb.ph %[prim3], %[p0], %[pm1] \n\t" 173 "precr.qb.ph %[prim4], %[p0], [all...] |