/external/lzma/CPP/7zip/UI/Common/ |
H A D | UpdatePair.cpp | 64 static int CompareArcItems(const unsigned *p1, const unsigned *p2, void *param)
argument 66 unsigned i1 = *p1;
|
/external/mesa3d/src/glx/ |
H A D | glxhash.c | 123 __glxHashBucketPtr p1; member in struct:__glxHashTable 298 if (table->p1) { 299 *key = table->p1->key; 300 *value = table->p1->value; 301 table->p1 = table->p1->next; 304 table->p1 = table->buckets[table->p0]; 319 table->p1 = table->buckets[0];
|
/external/mesa3d/src/mesa/main/ |
H A D | extensions.c | 380 extension_compare(const void *p1, const void *p2) argument 382 extension_index i1 = * (const extension_index *) p1;
|
/external/mesa3d/src/mesa/swrast/ |
H A D | s_aatritemp.h | 43 const GLfloat *p1 = v1->attrib[VARYING_SLOT_POS]; 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/oj-libjdwp/src/share/back/ |
H A D | log_messages.c | 76 char *p1; local 81 p1 = strrchr(file, '\\'); 83 p1 = ((p1 > p2) ? p1 : p2); 84 if (p1 != NULL) { 85 file = p1 + 1;
|
/external/opencv/cvaux/src/ |
H A D | cvbgfg_codebook.cpp | 147 uchar p0, p1, p2, l0, l1, l2, h0, h1, h2; local 153 p0 = p[0]; p1 = p[1]; p2 = p[2]; 154 l0 = SAT_8U(p0 - cb0); l1 = SAT_8U(p1 - cb1); l2 = SAT_8U(p2 - cb2); 155 h0 = SAT_8U(p0 + cb0); h1 = SAT_8U(p1 + cb1); h2 = SAT_8U(p2 + cb2); 160 e->learnMin[1] <= p1 && p1 <= e->learnMax[1] && 166 e->boxMin[1] = MIN(e->boxMin[1], p1); 167 e->boxMax[1] = MAX(e->boxMax[1], p1); 210 e->boxMin[1] = e->boxMax[1] = p1; 270 uchar p0 = p[0], p1 local [all...] |
H A D | cvface.cpp | 306 CvPoint p1 = cvPoint(rect.x,rect.y); local 308 cvRectangle(Image,p1,p2,CV_RGB(255,0,0),1); 320 CvPoint p1 = cvPoint(Rect.x,Rect.y); local 322 cvRectangle(Image,p1,p2,CV_RGB(0,0,255),1);
|
/external/pdfium/xfa/fwl/theme/ |
H A D | cfwl_checkboxtp.cpp | 244 CFX_PointF p1 = ScaleBezierPoint(pt12 - pt1); local 246 m_pCheckPath->BezierTo(pt1 + p1, pt2 + p2, pt2); 248 p1 = ScaleBezierPoint(pt23 - pt2); 250 m_pCheckPath->BezierTo(pt2 + p1, pt3 + p2, pt3); 252 p1 = ScaleBezierPoint(pt34 - pt3); 254 m_pCheckPath->BezierTo(pt3 + p1, pt4 + p2, pt4); 256 p1 = ScaleBezierPoint(pt45 - pt4); 258 m_pCheckPath->BezierTo(pt4 + p1, pt5 + p2, pt5); 260 p1 = ScaleBezierPoint(pt51 - pt5); 262 m_pCheckPath->BezierTo(pt5 + p1, pt [all...] |
/external/pdfium/xfa/fxgraphics/ |
H A D | cxfa_gepath.cpp | 76 void CXFA_GEPath::AddLine(const CFX_PointF& p1, const CFX_PointF& p2) { argument 77 data_.AppendPoint(p1, FXPT_TYPE::MoveTo, false);
|
/external/ppp/pppd/plugins/pppoatm/ |
H A D | ans.c | 195 static int cc_len(int p0,int p1) argument 225 return cc_table[p0*10+p1];
|
/external/skia/gm/ |
H A D | convex_all_line_paths.cpp | 332 SkPath p1; variable 333 p1.moveTo(60.8522949f, 364.671021f); 334 p1.lineTo(59.4380493f, 364.671021f); 335 p1.lineTo(385.414276f, 690.647217f); 336 p1.lineTo(386.121399f, 689.940125f); 337 canvas->drawPath(p1, p);
|
H A D | cubicpaths.cpp | 434 SkPoint p1 = { 526.109f, 155.200f }; local 437 path.cubicTo(p1, p2, p3); 444 path.cubicTo(p1, p2, p3);
|
H A D | hairlines.cpp | 158 SkPoint p1 = SkPoint::Make(kRad * cosV, kRad * sinV); variable 161 bug->lineTo(p1);
|
/external/skia/samplecode/ |
H A D | SampleCCPRGeometry.cpp | 101 SkPoint p1, p2; local 104 p1 = {0, -line[2] / line[1]}; 108 p1 = {-line[2] / line[0], 0}; 118 canvas->drawLine(p1, p2, linePaint);
|
H A D | SamplePathClip.cpp | 74 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) { argument 77 if (p0.fY == p1.fY) { 81 if (p0.fY > p1.fY) { 82 SkTSwap(p0, p1); 84 // now we're monotonic in Y: p0 <= p1 85 if (p1.fY <= bounds.top() || p0.fY >= bounds.bottom()) { 89 double dxdy = (double)(p1.fX - p0.fX) / (p1.fY - p0.fY); 94 if (p1.fY > bounds.bottom()) { 95 p1 137 draw_clipped_line(SkCanvas* canvas, const SkRect& bounds, SkPoint p0, SkPoint p1, const SkPaint& paint) argument [all...] |
/external/skia/src/core/ |
H A D | SkEdge.cpp | 33 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip, argument 41 x1 = SkScalarRoundToFDot6(p1.fX, shift); 42 y1 = SkScalarRoundToFDot6(p1.fY, shift); 47 x1 = int(p1.fX * scale); 48 y1 = int(p1.fY * scale); 244 * p0 (1 - t)^2 + p1 t(1 - t) + p2 t^2 ==> At^2 + Bt + C 246 * A = p0 - 2p1 + p2 247 * B = 2(p1 - p0) 252 * larger (e.g. B = 2*(p1 - p0)). To guard against overflow, we will store
|
H A D | SkGeometry.h | 227 SkConic(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, SkScalar w) { argument 229 fPts[1] = p1; 246 void set(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, SkScalar w) { argument 248 fPts[1] = p1; 350 Sk2s p1 = from_point(conic.fPts[1]); local 354 Sk2s p1w = p1 * ww;
|
H A D | SkPointPriv.h | 54 static bool EqualsWithinTolerance(const SkPoint& p1, const SkPoint& p2) { argument 55 return !CanNormalize(p1.fX - p2.fX, p1.fY - p2.fY);
|
/external/skia/src/shaders/gradients/ |
H A D | SkTwoPointConicalGradient_gpu.cpp | 293 SkString p1; // f = focalX = r0 / (r0 - r1) variable 295 p1.appendf("%s.y", uniformHandler->getUniformVariable(fParamUni).getName().c_str()); 326 // "+ 0" is much faster than "+ p1" so we specialize the natively focal case where p1 = 0. 328 effect.isNativelyFocal() ? "0" : p1.c_str());
|
/external/skia/src/utils/ |
H A D | SkInsetConvexPolygon.cpp | 35 SkPoint p1 = polygonVerts[1]; local 41 int side = compute_side(p0, p1, p2); 47 p1 = p2; 53 // Offset line segment p0-p1 'd0' and 'd1' units in the direction specified by 'side' 54 bool SkOffsetSegment(const SkPoint& p0, const SkPoint& p1, SkScalar d0, SkScalar d1, argument 57 SkVector perp = SkVector::Make(p0.fY - p1.fY, p1.fX - p0.fX); 62 *offset1 = p1 + perp; 71 if (dD*dD >= SkPointPriv::DistanceToSqd(p0, p1)) { 74 SkPoint outerTangentIntersect = SkPoint::Make((p1 [all...] |
/external/skia/tests/ |
H A D | PaintTest.cpp | 120 SkPaint p0, p1; local 133 p1 = p0; 134 REPORTER_ASSERT(reporter, gQualitys[i] == p1.getFilterQuality());
|
H A D | ResourceAllocatorTest.cpp | 65 sk_sp<GrSurfaceProxy> p1, sk_sp<GrSurfaceProxy> p2, 69 alloc.addInterval(p1.get(), 0, 4); 78 REPORTER_ASSERT(reporter, p1->priv().peekSurface()); 80 bool doTheBackingStoresMatch = p1->underlyingUniqueID() == p2->underlyingUniqueID(); 87 sk_sp<GrSurfaceProxy> p1, sk_sp<GrSurfaceProxy> p2, 91 alloc.addInterval(p1.get(), 0, 2); 100 REPORTER_ASSERT(reporter, p1->priv().peekSurface()); 102 bool doTheBackingStoresMatch = p1->underlyingUniqueID() == p2->underlyingUniqueID(); 152 sk_sp<GrSurfaceProxy> p1 = make_deferred(proxyProvider, test.fP1); local 155 std::move(p1), st 64 overlap_test(skiatest::Reporter* reporter, GrResourceProvider* resourceProvider, sk_sp<GrSurfaceProxy> p1, sk_sp<GrSurfaceProxy> p2, bool expectedResult) argument 86 non_overlap_test(skiatest::Reporter* reporter, GrResourceProvider* resourceProvider, sk_sp<GrSurfaceProxy> p1, sk_sp<GrSurfaceProxy> p2, bool expectedResult) argument 191 sk_sp<GrSurfaceProxy> p1 = make_deferred(proxyProvider, test.fP1); local 207 sk_sp<GrSurfaceProxy> p1 = make_backend(ctxInfo.grContext(), t[0].fP1, &backEndTex); local [all...] |
H A D | SerialProcsTest.cpp | 153 auto p1 = make_pic([](SkCanvas* c) { local 165 p0 = make_pic([p1](SkCanvas* c) { 168 paint.setShader(SkShader::MakePictureShader(p1, tm, tm, nullptr, nullptr)); 174 p0 = make_pic([p1](SkCanvas* c) { 176 c->drawPicture(p1);
|
/external/skqp/gm/ |
H A D | convex_all_line_paths.cpp | 332 SkPath p1; variable 333 p1.moveTo(60.8522949f, 364.671021f); 334 p1.lineTo(59.4380493f, 364.671021f); 335 p1.lineTo(385.414276f, 690.647217f); 336 p1.lineTo(386.121399f, 689.940125f); 337 canvas->drawPath(p1, p);
|
H A D | cubicpaths.cpp | 434 SkPoint p1 = { 526.109f, 155.200f }; local 437 path.cubicTo(p1, p2, p3); 444 path.cubicTo(p1, p2, p3);
|