Searched refs:points (Results 326 - 350 of 479) sorted by relevance

<<11121314151617181920

/external/chromium_org/third_party/icu/source/common/
H A Dubidi.c260 if(pBiDi->insertPoints.points!=NULL) {
261 uprv_free(pBiDi->insertPoints.points);
1700 pInsertPoints->points=uprv_malloc(sizeof(Point)*FIRSTALLOC);
1701 if (pInsertPoints->points == NULL)
1710 void * savePoints=pInsertPoints->points;
1711 pInsertPoints->points=uprv_realloc(pInsertPoints->points,
1713 if (pInsertPoints->points == NULL)
1715 pInsertPoints->points=savePoints;
1723 pInsertPoints->points[pInsertPoint
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkPath.cpp21 * Path.bounds is defined to be the bounds of all the control points.
60 avoiding the need to revisit all of the points in getBounds().
112 Stores the verbs and points as they are given to us, with exceptions:
333 const SkPoint* pts = fPathRef->points();
363 The path contains fewer than four points.
372 Single points on the rectangle side.
518 const SkPoint* pts = fPathRef->points();
529 const SkPoint* pts = fPathRef->points();
536 const SkPoint* pts = fPathRef->points();
583 memcpy(dst, fPathRef->points(), coun
[all...]
/external/freetype/src/raster/
H A Dftraster.c1801 /* there are simply no `on' points in the contour! */
1822 FT_Vector* points; local
1830 points = ras.outline.points;
1831 limit = points + last;
1833 v_start.x = SCALED( points[first].x );
1834 v_start.y = SCALED( points[first].y );
1835 v_last.x = SCALED( points[last].x );
1836 v_last.y = SCALED( points[last].y );
1846 point = points
[all...]
/external/icu/icu4c/source/common/
H A Dubidi.c260 if(pBiDi->insertPoints.points!=NULL) {
261 uprv_free(pBiDi->insertPoints.points);
1150 stackLast points to its current entry. */
1773 pInsertPoints->points=uprv_malloc(sizeof(Point)*FIRSTALLOC);
1774 if (pInsertPoints->points == NULL)
1783 void * savePoints=pInsertPoints->points;
1784 pInsertPoints->points=uprv_realloc(pInsertPoints->points,
1786 if (pInsertPoints->points == NULL)
1788 pInsertPoints->points
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/raster/
H A Dftraster.c1801 /* there are simply no `on' points in the contour! */
1822 FT_Vector* points; local
1830 points = ras.outline.points;
1831 limit = points + last;
1833 v_start.x = SCALED( points[first].x );
1834 v_start.y = SCALED( points[first].y );
1835 v_last.x = SCALED( points[last].x );
1836 v_last.y = SCALED( points[last].y );
1846 point = points
[all...]
/external/skia/src/core/
H A DSkPath.cpp21 * Path.bounds is defined to be the bounds of all the control points.
60 avoiding the need to revisit all of the points in getBounds().
112 Stores the verbs and points as they are given to us, with exceptions:
333 const SkPoint* pts = fPathRef->points();
363 The path contains fewer than four points.
372 Single points on the rectangle side.
518 const SkPoint* pts = fPathRef->points();
529 const SkPoint* pts = fPathRef->points();
536 const SkPoint* pts = fPathRef->points();
583 memcpy(dst, fPathRef->points(), coun
[all...]
H A DSkPicturePlayback.cpp99 SkDebugf("points size %zd (points:%d) ", record.fPointBytes, record.fPointWrites);
1158 size_t points = reader.readInt();
1159 const SkPoint* pos = (const SkPoint*)reader.skip(points * sizeof(SkPoint));
1165 size_t points = reader.readInt();
1166 const SkPoint* pos = (const SkPoint*)reader.skip(points * sizeof(SkPoint));
1765 size_t points = getInt();
1767 DUMP_POINT_ARRAY(points);
1772 size_t points = getInt();
1777 DUMP_POINT_ARRAY(points);
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/graphics/
H A DGraphicsContext.cpp582 void GraphicsContext::drawConvexPolygon(size_t numPoints, const FloatPoint* points, bool shouldAntialias) argument
591 setPathFromConvexPoints(&path, numPoints, points);
1537 void GraphicsContext::clipConvexPolygon(size_t numPoints, const FloatPoint* points, bool antialiased) argument
1546 setPathFromConvexPoints(&path, numPoints, points);
1818 void GraphicsContext::setPathFromConvexPoints(SkPath* path, size_t numPoints, const FloatPoint* points) argument
1821 path->moveTo(WebCoreFloatToSkScalar(points[0].x()),
1822 WebCoreFloatToSkScalar(points[0].y()));
1824 path->lineTo(WebCoreFloatToSkScalar(points[i].x()),
1825 WebCoreFloatToSkScalar(points[i].y()));
/external/tremolo/Tremolo/
H A DmdctLARM.s409 @ r0 = n = (points * 2)
420 MOV r0, r0, LSR #1 @ r0 = points>>i = POINTS
427 @ r0 = points
461 @ r0 = points
527 @ r0 = points
590 @ r0 = points
982 @ r0 = points
1013 @ r0 = points
1100 @ r0 = points
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Ddom_util.js2063 // Increase the points for each heuristic. If there are 3 or more points,
2065 var points = 0;
2069 points++;
2074 points++;
2079 points++;
2084 points++;
2086 return (points >= 3);
/external/chromium_org/third_party/freetype/src/smooth/
H A Dftgrays.c457 FT_Vector* vec = outline->points;
1127 /* Split super curvy segments where the off points are so far
1540 limit = outline->points + last;
1542 v_start = outline->points[first];
1546 v_last = outline->points[last];
1552 point = outline->points + first;
1572 /* if both first and last points are conic, */
1937 if ( !outline->contours || !outline->points )
/external/freetype/src/smooth/
H A Dftgrays.c506 FT_Vector* vec = outline->points;
1149 /* Split super curvy segments where the off points are so far
1562 limit = outline->points + last;
1564 v_start = outline->points[first];
1568 v_last = outline->points[last];
1574 point = outline->points + first;
1594 /* if both first and last points are conic, */
1960 if ( !outline->contours || !outline->points )
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/smooth/
H A Dftgrays.c469 FT_Vector* vec = outline->points;
1139 /* Split super curvy segments where the off points are so far
1555 limit = outline->points + last;
1557 v_start = outline->points[first];
1561 v_last = outline->points[last];
1567 point = outline->points + first;
1587 /* if both first and last points are conic, */
1954 if ( !outline->contours || !outline->points )
/external/chromium_org/chrome/browser/rlz/
H A Drlz.cc170 rlz_lib::AccessPoint points[] = {RLZTracker::ChromeOmnibox(), local
184 return rlz_lib::SendFinancialPing(rlz_lib::CHROME, points,
388 // Prime the RLZ cache for the access points we are interested in.
541 // GetAccessPointRlz() caches RLZ strings for all access points. If we had
549 // GetAccessPointRlz() caches RLZ strings for all access points. If we had
/external/chromium_org/third_party/mesa/src/docs/
H A DMESA_drm_image.spec34 This extension provides entry points for integrating EGLImage with the
/external/chromium_org/third_party/skia/src/effects/gradients/
H A DSkLinearGradient.cpp533 SkPoint points[] = {{random->nextUScalar1(), random->nextUScalar1()}, local
541 SkAutoTUnref<SkShader> shader(SkGradientShader::CreateLinear(points,
/external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/test/delay_tool/
H A Dplot_neteq_delay.m33 % return a vector of delay values for the points in the given vector
/external/libunwind/doc/
H A Dlibunwind-setjmp.tex37 that exist between the points where \Func{setjmp}() and
H A Dunw_create_addr_space.tex35 routines are specified via the \Var{ap} argument, which points to a
141 be written. The word that \Var{valp} points to is always in the
161 points to is always in the byte-order of the host-platform, regardless
180 be written. The word that \Var{fpvalp} points to is always in the
/external/mesa3d/docs/
H A DMESA_drm_image.spec34 This extension provides entry points for integrating EGLImage with the
/external/openssl/crypto/ec/
H A Dec2_smpl.c600 /* Indicates whether two points are equal.
687 int ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
693 if (!group->meth->make_affine(group, points[i], ctx)) return 0;
/external/skia/gm/
H A DAndroid.mk139 points.cpp \
/external/skia/src/effects/gradients/
H A DSkLinearGradient.cpp519 SkPoint points[] = {{random->nextUScalar1(), random->nextUScalar1()}, local
527 SkAutoTUnref<SkShader> shader(SkGradientShader::CreateLinear(points,
/external/valgrind/main/gdbserver_tests/
H A Dmcblocklistsearch.stderrB.exp12 *0x........ points at 0x........
/external/valgrind/main/memcheck/tests/
H A Dleak_cpp_interior.stderr.exp59 *0x........ interior points at 4 bytes inside 0x........

Completed in 711 milliseconds

<<11121314151617181920