Searched defs:points (Results 1 - 25 of 54) sorted by relevance

123

/external/webkit/WebCore/platform/qt/
H A DPlatformTouchEventQt.cpp37 const QList<QTouchEvent::TouchPoint>& points = event->touchPoints(); local
38 for (int i = 0; i < points.count(); ++i)
39 m_touchPoints.append(PlatformTouchPoint(points.at(i)));
/external/skia/src/svg/
H A DSkSVGLinearGradient.cpp39 SkString points; local
40 points.appendUnichar('[');
41 points.append(f_x1);
42 points.appendUnichar(',');
43 points.append(f_y1);
44 points.appendUnichar(',');
45 points.append(f_x2);
46 points.appendUnichar(',');
47 points.append(f_y2);
48 points
[all...]
/external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/
H A DCRLDistPoint.java44 DistributionPoint[] points)
48 for (int i = 0; i != points.length; i++)
50 v.add(points[i]);
57 * Return the distribution points making up the sequence.
43 CRLDistPoint( DistributionPoint[] points) argument
/external/chromium/base/gfx/
H A Dpoint.cc23 POINTS points = MAKEPOINTS(point); local
24 x_ = points.x;
25 y_ = points.y;
/external/skia/src/animator/
H A DSkDrawGradient.h56 SkTDScalarArray points; member in class:SkLinearGradient
H A DSkDrawPath.h65 SkTDScalarArray points; member in class:SkPolyline
H A DSkParseSVGPath.cpp39 //define our points
127 SkPoint points[3]; local
152 data = find_points(data, points, 1, relative, &c);
153 fPath.moveTo(points[0]);
155 c = points[0];
158 data = find_points(data, points, 1, relative, &c);
159 fPath.lineTo(points[0]);
160 c = points[0];
177 data = find_points(data, points, 3, relative, &c);
180 data = find_points(data, &points[
[all...]
/external/webkit/WebCore/svg/
H A DSVGPolyElement.cpp49 SVGPointList* SVGPolyElement::points() const function in class:WebCore::SVGPolyElement
68 points()->clear(ec);
70 if (!pointsListFromSVGData(points(), value)) {
71 points()->clear(ec);
72 document()->accessSVGExtensions()->reportError("Problem parsing points=\"" + value + "\"");
89 // The points property is not a regular SVGAnimatedProperty, still we use the same SVG<->XML DOM synchronization framework.
110 SVGAnimatedPropertySynchronizer<true>::synchronize(this, SVGNames::pointsAttr, points()->valueAsString());
117 SVGAnimatedPropertySynchronizer<true>::synchronize(this, attrName, points()->valueAsString());
/external/webkit/WebCore/platform/graphics/
H A DPath.h93 FloatPoint* points; member in struct:WebCore::PathElement
H A DPath.cpp48 FloatPoint* points = element->points; local
52 segmentLength = traversalState.moveTo(points[0]);
55 segmentLength = traversalState.lineTo(points[0]);
58 segmentLength = traversalState.quadraticBezierTo(points[0], points[1]);
61 segmentLength = traversalState.cubicBezierTo(points[0], points[1], points[2]);
/external/openssl/crypto/ec/
H A Dec2_mult.c312 * scalar*group->generator + scalars[0]*points[0] + ... + scalars[num-1]*points[num-1]
316 size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx)
331 * or fewer points. Use the ec_wNAF_mul implementation for 3 or more points,
336 ret = ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);
354 if (!ec_GF2m_montgomery_point_multiply(group, p, scalars[i], points[i], ctx)) goto err;
315 ec_GF2m_simple_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
H A Dectest.c305 EC_POINT *points[3];
307 points[0] = R;
308 points[1] = Q;
309 points[2] = P;
310 if (!EC_POINTs_make_affine(group, 2, points, ctx)) ABORT;
652 const EC_POINT *points[4]; local
657 points[0] = Q;
658 points[1] = Q;
659 points[2] = Q;
660 points[
1135 const EC_POINT *points[3]; local
[all...]
H A Dec2_smpl.c924 /* Indicates whether two points are equal.
1008 int ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
1014 if (!group->meth->make_affine(group, points[i], ctx)) return 0;
H A Dec_mult.c87 EC_POINT **points; /* array with pre-calculated multiples of generator: member in struct:ec_pre_comp_st
115 ret->points = NULL;
144 if (pre->points)
148 for (p = pre->points; *p != NULL; p++)
150 OPENSSL_free(pre->points);
167 if (pre->points)
171 for (p = pre->points; *p != NULL; p++)
173 OPENSSL_cleanse(pre->points, sizeof pre->points);
174 OPENSSL_free(pre->points);
344 ec_wNAF_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
770 EC_POINT **points = NULL; local
[all...]
H A Dec_lib.c1091 int EC_POINTs_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
1102 if (group->meth != points[i]->meth)
1108 return group->meth->points_make_affine(group, num, points, ctx);
1119 size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx)
1123 return ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);
1125 return group->meth->mul(group, r, scalar, num, points, scalars, ctx);
1133 const EC_POINT *points[1]; local
1136 points[0] = point;
1139 return EC_POINTs_mul(group, r, g_scalar, (point != NULL && p_scalar != NULL), points, scalars, ctx);
1118 EC_POINTs_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
/external/webkit/WebCore/rendering/
H A DSVGMarkerData.h91 FloatPoint* points = element->points; local
96 m_origin = points[1];
99 m_inslopePoints[0] = points[1];
100 m_inslopePoints[1] = points[2];
101 m_origin = points[2];
104 m_subpathStart = points[0];
106 updateInslope(points[0]);
107 m_origin = points[0];
110 updateInslope(points[
[all...]
/external/freetype/src/autofit/
H A Dafwarp.c140 AF_Point points; local
173 points = hints->points;
184 X1 = X2 = points[0].fx;
187 FT_Int X = points[nn].fx;
H A Dafhints.c166 AF_Point points = hints->points; local
167 AF_Point limit = points + hints->num_points;
171 printf( "Table of points:\n" );
175 for ( point = points; point < limit; point++ )
179 point - points,
400 * buffers, since they are really within the hints->points array
420 FT_FREE( hints->points );
443 AF_Point points; local
474 * then reallocate the points array
754 AF_Point points = hints->points; local
992 AF_Point points = hints->points; local
1123 AF_Point points = hints->points; local
[all...]
/external/freetype/src/smooth/
H A Dftsmooth.c235 FT_Vector* points = outline->points; local
236 FT_Vector* points_end = points + outline->n_points;
241 for ( vec = points; vec < points_end; vec++ )
245 for ( vec = points; vec < points_end; vec++ )
254 FT_Vector* points = outline->points; local
255 FT_Vector* points_end = points + outline->n_points;
260 for ( vec = points; vec < points_end; vec++ )
264 for ( vec = points; ve
[all...]
/external/tremolo/Tremolo/
H A Dmdct.c197 STIN void mdct_butterfly_generic(DATA_TYPE *x,int points,int step){ argument
199 DATA_TYPE *x1 = x + points - 4;
200 DATA_TYPE *x2 = x + (points>>1) - 4;
213 x1 = x + (points>>1) + (points>>2) - 4;
214 x2 = x + (points>>2) - 4;
228 STIN void mdct_butterflies(DATA_TYPE *x,int points,int shift){ argument
236 mdct_butterfly_generic(x+(points>>i)*j,points>>i,4<<(i+shift));
240 for(j=0;j<points;
[all...]
/external/webkit/WebCore/platform/graphics/cairo/
H A DPathCairo.cpp174 // all points on a line logic
297 FloatPoint points[3]; local
298 pelement.points = points;
305 pelement.points[0] = FloatPoint(data[1].point.x,data[1].point.y);
310 pelement.points[0] = FloatPoint(data[1].point.x,data[1].point.y);
315 pelement.points[0] = FloatPoint(data[1].point.x,data[1].point.y);
316 pelement.points[1] = FloatPoint(data[2].point.x,data[2].point.y);
317 pelement.points[2] = FloatPoint(data[3].point.x,data[3].point.y);
/external/webkit/WebCore/platform/graphics/cg/
H A DPathCG.cpp94 CGPoint* points = element->points; local
100 CGPathMoveToPoint(path, 0, points[0].x, points[0].y);
103 CGPathAddLineToPoint(path, 0, points[0].x, points[0].y);
106 CGPathAddQuadCurveToPoint(path, 0, points[0].x, points[0].y, points[1].x, points[
257 CGPoint* points = element->points; local
316 FloatPoint points[3]; local
[all...]
/external/webkit/WebCore/platform/graphics/qt/
H A DPathQt.cpp173 // all points on a line logic
343 FloatPoint points[3]; local
344 pelement.points = points;
351 pelement.points[0] = QPointF(cur);
356 pelement.points[0] = QPointF(cur);
368 pelement.points[0] = QPointF(cur);
369 pelement.points[1] = QPointF(c1);
370 pelement.points[2] = QPointF(c2);
/external/freetype/src/base/
H A Dftoutln.c92 limit = outline->points + last;
94 v_start = outline->points[first];
98 v_last = outline->points[last];
104 point = outline->points + first;
124 /* if both first and last points are conic, */
307 if ( FT_NEW_ARRAY( anoutline->points, numPoints ) ||
404 FT_ARRAY_COPY( target->points, source->points, source->n_points );
429 FT_FREE( outline->points );
477 FT_Vector* vec = outline->points;
885 FT_Vector* points; local
[all...]
/external/freetype/src/truetype/
H A Dttgxvar.c107 /* Read a set of points to which the following deltas will apply. */
114 /* point_cnt :: The number of points read. A zero value means that */
115 /* all points in the glyph will be affected, without */
119 /* An array of FT_UShort containing the affected points or the */
126 FT_UShort *points; local
145 if ( FT_NEW_ARRAY( points, n ) )
155 first = points[i++] = FT_GET_USHORT();
162 points[i++] = (FT_UShort)( first += FT_GET_USHORT() );
166 first = points[i++] = FT_GET_BYTE();
172 points[
1342 FT_UShort* points; local
[all...]

Completed in 884 milliseconds

123