/external/opencv/cv/src/ |
H A D | _cvgeom.h | 46 CV_INLINE float icvDistanceL2_32f( CvPoint2D32f pt1, CvPoint2D32f pt2 ) 48 float dx = pt2.x - pt1.x; 49 float dy = pt2.y - pt1.y;
|
H A D | cvpgh.cpp | 192 CvPoint pt1, pt2; local 195 CV_READ_EDGE( pt1, pt2, reader1 ); 197 dx = pt2.x - pt1.x; 198 dy = pt2.y - pt1.y; 214 CvPoint pt1, pt2; local 218 CV_READ_EDGE( pt1, pt2, reader1 ); 220 dx = pt2.x - pt1.x; 221 dy = pt2.y - pt1.y; 243 int d2 = (pt4.y - pt1.y) * dx - (pt2.x - pt1.x) * dy;
|
H A D | cvcontourtree.cpp | 73 CvPoint *pt1, *pt2; /* pointer to current points */ local 161 pt2 = pt_n; 172 pt2 = pt_n; 182 pt2 = pt_p; 328 pt2[i_buf] = t; 380 t = pt2[0]; 381 tn1 = pt2[1]; 382 tn2 = pt2[2]; 383 tp1 = pt2[3];
|
/external/valgrind/main/drd/tests/ |
H A D | pth_cleanup_handler.c | 39 pthread_t pt1, pt2; local 54 if (pthread_create(&pt2, NULL, f, NULL) != 0) 61 pthread_join(pt2, 0);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathWriter.h | 16 void cubicTo(const SkPoint& pt1, const SkPoint& pt2, const SkPoint& pt3); 27 void quadTo(const SkPoint& pt1, const SkPoint& pt2);
|
H A D | SkPathWriter.cpp | 38 void SkPathWriter::cubicTo(const SkPoint& pt1, const SkPoint& pt2, const SkPoint& pt3) { argument 40 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2) 41 && AlmostEqualUlps(pt2, pt3)) { 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 122 void SkPathWriter::quadTo(const SkPoint& pt1, const SkPoint& pt2) { argument 124 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)) { 125 deferredLine(pt2); [all...] |
H A D | SkIntersectionHelper.h | 80 bool isPartial(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const { 84 SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
|
H A D | SkPathOpsPoint.h | 13 inline bool AlmostEqualUlps(const SkPoint& pt1, const SkPoint& pt2) { argument 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
|
/external/skia/src/pathops/ |
H A D | SkPathWriter.h | 16 void cubicTo(const SkPoint& pt1, const SkPoint& pt2, const SkPoint& pt3); 27 void quadTo(const SkPoint& pt1, const SkPoint& pt2);
|
H A D | SkPathWriter.cpp | 38 void SkPathWriter::cubicTo(const SkPoint& pt1, const SkPoint& pt2, const SkPoint& pt3) { argument 40 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2) 41 && AlmostEqualUlps(pt2, pt3)) { 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 122 void SkPathWriter::quadTo(const SkPoint& pt1, const SkPoint& pt2) { argument 124 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)) { 125 deferredLine(pt2); [all...] |
H A D | SkIntersectionHelper.h | 80 bool isPartial(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const { 84 SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
|
H A D | SkPathOpsPoint.h | 13 inline bool AlmostEqualUlps(const SkPoint& pt1, const SkPoint& pt2) { argument 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
|
/external/opencv/cxcore/src/ |
H A D | cxdrawing.cpp | 81 cvClipLine( CvSize img_size, CvPoint* pt1, CvPoint* pt2 ) 93 if( !pt1 || !pt2 ) 99 x1 = pt1->x; y1 = pt1->y; x2 = pt2->x; y2 = pt2->y; 143 pt2->x = x2; 144 pt2->y = y2; 160 cvInitLineIterator( const CvArr* img, CvPoint pt1, CvPoint pt2, argument 184 (unsigned)pt2.x >= (unsigned)(mat->width) || 186 (unsigned)pt2.y >= (unsigned)(mat->height) ) 193 dx = pt2 256 icvLine( CvMat* mat, CvPoint pt1, CvPoint pt2, const void* color, int connectivity = 8 ) argument 296 icvLineAA( CvMat* img, CvPoint pt1, CvPoint pt2, const void* color ) argument 561 icvLine2( CvMat* img, CvPoint pt1, CvPoint pt2, const void* color ) argument 2539 CvPoint pt1, pt2; local [all...] |
/external/chromium_org/third_party/freetype/src/cff/ |
H A D | cf2glue.h | 106 FT_Vector pt2; member in struct:CF2_CallbackParamsRec_
|
/external/freetype/src/cff/ |
H A D | cf2glue.h | 106 FT_Vector pt2; member in struct:CF2_CallbackParamsRec_
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xa/ |
H A D | xa_renderer.c | 192 float pt0[2], pt1[2], pt2[2], pt3[2]; local 198 pt2[0] = (srcX + width); 199 pt2[1] = (srcY + height); 206 map_point((float *)src_matrix, pt2[0], pt2[1], &pt2[0], &pt2[1]); 212 s2 = pt2[0] / src->width0; 216 t2 = pt2[1] / src->height0;
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xorg/ |
H A D | xorg_renderer.c | 145 float pt0[2], pt1[2], pt2[2], pt3[2]; local 151 pt2[0] = (srcX + width); 152 pt2[1] = (srcY + height); 159 map_point(src_matrix, pt2[0], pt2[1], &pt2[0], &pt2[1]); 165 s2 = pt2[0] / src->width0; 169 t2 = pt2[1] / src->height0;
|
/external/mesa3d/src/gallium/state_trackers/xa/ |
H A D | xa_renderer.c | 192 float pt0[2], pt1[2], pt2[2], pt3[2]; local 198 pt2[0] = (srcX + width); 199 pt2[1] = (srcY + height); 206 map_point((float *)src_matrix, pt2[0], pt2[1], &pt2[0], &pt2[1]); 212 s2 = pt2[0] / src->width0; 216 t2 = pt2[1] / src->height0;
|
/external/mesa3d/src/gallium/state_trackers/xorg/ |
H A D | xorg_renderer.c | 145 float pt0[2], pt1[2], pt2[2], pt3[2]; local 151 pt2[0] = (srcX + width); 152 pt2[1] = (srcY + height); 159 map_point(src_matrix, pt2[0], pt2[1], &pt2[0], &pt2[1]); 165 s2 = pt2[0] / src->width0; 169 t2 = pt2[1] / src->height0;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkStroke.cpp | 366 void SkPathStroker::quadTo(const SkPoint& pt1, const SkPoint& pt2) { argument 368 bool degenerateBC = SkPath::IsLineDegenerate(pt1, pt2); 372 this->lineTo(pt2); 385 pts[2] = pt2; 418 this->postJoinTo(pt2, normalBC, unitBC); 421 void SkPathStroker::cubicTo(const SkPoint& pt1, const SkPoint& pt2, argument 424 bool degenerateBC = SkPath::IsLineDegenerate(pt1, pt2); 425 bool degenerateCD = SkPath::IsLineDegenerate(pt2, pt3); 434 // find the first tangent (which might be pt1 or pt2 438 nextPt = &pt2; [all...] |
H A D | SkMatrix.cpp | 1539 SkPoint pt1, pt2; local 1553 pt2.fX = poly[0].fY - poly[2].fY; 1554 pt2.fY = poly[2].fX - poly[0].fX; 1557 pt2.fX = poly[0].fY - poly[3].fY; 1558 pt2.fY = poly[3].fX - poly[0].fX; 1560 w1.setMul(pt1.fX, pt2.fX); 1561 w2.setMul(pt1.fY, pt2.fY); 1678 SkPoint pt1, pt2; local 1691 pt2.fX = poly[0].fY - poly[2].fY; 1692 pt2 [all...] |
/external/skia/src/core/ |
H A D | SkStroke.cpp | 366 void SkPathStroker::quadTo(const SkPoint& pt1, const SkPoint& pt2) { argument 368 bool degenerateBC = SkPath::IsLineDegenerate(pt1, pt2); 372 this->lineTo(pt2); 385 pts[2] = pt2; 418 this->postJoinTo(pt2, normalBC, unitBC); 421 void SkPathStroker::cubicTo(const SkPoint& pt1, const SkPoint& pt2, argument 424 bool degenerateBC = SkPath::IsLineDegenerate(pt1, pt2); 425 bool degenerateCD = SkPath::IsLineDegenerate(pt2, pt3); 434 // find the first tangent (which might be pt1 or pt2 438 nextPt = &pt2; [all...] |
/external/opencv/ |
H A D | cvjni.cpp | 619 CvPoint pt2 = cvPoint(int((face->x + face->width) * scale),
local 621 sprintf(buffer, "Draw Rectangle: (%d, %d) to (%d, %d)", pt1.x, pt1.y, pt2.x, pt2.y);
623 cvRectangle(sourceImage, pt1, pt2, CV_RGB(255, 0, 0), 3, 8, 0);
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
H A D | bezier.c | 189 float *pt2, 196 bez->x2 = pt2[0]; 197 bez->y2 = pt2[1]; 316 static INLINE void compute_pt_normal(float *pt1, float *pt2, float *res) argument 321 line[2] = pt2[0] - pt1[0]; 322 line[3] = pt2[1] - pt1[1]; 187 bezier_init2v(struct bezier *bez, float *pt1, float *pt2, float *pt3, float *pt4) argument
|
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | bezier.c | 189 float *pt2, 196 bez->x2 = pt2[0]; 197 bez->y2 = pt2[1]; 316 static INLINE void compute_pt_normal(float *pt1, float *pt2, float *res) argument 321 line[2] = pt2[0] - pt1[0]; 322 line[3] = pt2[1] - pt1[1]; 187 bezier_init2v(struct bezier *bez, float *pt1, float *pt2, float *pt3, float *pt4) argument
|