/external/chromium_org/third_party/skia/src/utils/debugger/ |
H A D | SkObjectParser.cpp | 149 SkPoint points[4]; local 151 for(verb = iter.next(points, false); 153 verb = iter.next(points, false)) { 160 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fX); 162 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fY);
|
/external/chromium_org/third_party/skia/src/utils/win/ |
H A D | SkDWriteGeometrySink.cpp | 74 void STDMETHODCALLTYPE SkDWriteGeometrySink::AddLines(const D2D1_POINT_2F *points, UINT pointsCount) { argument 75 for (const D2D1_POINT_2F *end = &points[pointsCount]; points < end; ++points) { 76 fPath->lineTo(points->x, points->y);
|
/external/chromium_org/ui/events/gestures/ |
H A D | gesture_recognizer_impl.cc | 86 const GesturePoint* points = i->second->points(); local 88 if (!points[j].in_use()) 90 gfx::Vector2d delta = points[j].last_touch_position() - location; 95 closest_point = &points[j];
|
H A D | gesture_sequence.h | 50 // Maximum number of points in a single gesture. 64 const GesturePoint* points() const { return points_; } function in class:ui::GestureSequence 75 // Recreates the axis-aligned bounding box that contains all the touch-points 90 // includes some common information (e.g. number of touch-points in the 203 // current touch-points. This box is updated after every touch-event. 218 // The distance between the two points at PINCH_START.
|
/external/chromium_org/ui/views/controls/ |
H A D | progress_bar.cc | 67 const SkScalar points[], 84 p, colors, points, count, SkShader::kClamp_TileMode, NULL)); 62 FillRoundRect(gfx::Canvas* canvas, int x, int y, int w, int h, int corner_radius, const SkColor colors[], const SkScalar points[], int count, bool gradient_horizontal) argument
|
/external/clang/test/Analysis/ |
H A D | ptr-arith.c | 293 void symbolicFieldRegion(struct Point *points, int i, int j) { argument 294 clang_analyzer_eval(&points[i].x == &points[j].x);// expected-warning{{UNKNOWN}} 295 clang_analyzer_eval(&points[i].x == &points[i].y);// expected-warning{{FALSE}} 296 clang_analyzer_eval(&points[i].x < &points[i].y);// expected-warning{{TRUE}}
|
/external/clang/test/Sema/ |
H A D | flexible-array-init.c | 45 struct point points[]; // expected-note{{initialized flexible array member 'points' is here}} member in struct:polygon 48 .points[2] = { 1, 2} }; // expected-error{{designator into flexible array member subobject}}
|
/external/freetype/src/autofit/ |
H A D | afwarp.c | 169 AF_Point points; local 202 points = hints->points; 213 X1 = X2 = points[0].fx; 216 FT_Int X = points[nn].fx;
|
/external/freetype/src/smooth/ |
H A D | ftsmooth.c | 273 FT_Vector* points = outline->points; local 274 FT_Vector* points_end = points + outline->n_points; 279 for ( vec = points; vec < points_end; vec++ ) 283 for ( vec = points; vec < points_end; vec++ ) 292 FT_Vector* points = outline->points; local 293 FT_Vector* points_end = points + outline->n_points; 298 for ( vec = points; vec < points_end; vec++ ) 302 for ( vec = points; ve [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
H A D | BoundingSphere.java | 112 * given set of points. It uses the <code>calcWelzl</code> method as
115 * @param points
116 * the points to contain.
118 public void computeFromPoints(FloatBuffer points) {
argument 119 calcWelzl(points);
174 * Calculates a minimum bounding sphere for the set of points. The algorithm
180 * @param points
181 * The points to calculate the minimum bounds from.
183 public void calcWelzl(FloatBuffer points) {
argument 187 FloatBuffer buf = BufferUtils.createFloatBuffer(points 209 recurseMini(FloatBuffer points, int p, int b, int ap) argument 350 averagePoints(Vector3f[] points) argument [all...] |
H A D | BoundingVolume.java | 45 * containment of a collection of points.
152 * encompasses a collection of points.
154 * @param points
155 * the points to contain.
157 public abstract void computeFromPoints(FloatBuffer points);
argument
|
/external/libvorbis/lib/ |
H A D | mdct.c | 219 int points){ 221 DATA_TYPE *x1 = x + points - 8; 222 DATA_TYPE *x2 = x + (points>>1) - 8; 266 int points, 269 DATA_TYPE *x1 = x + points - 8; 270 DATA_TYPE *x2 = x + (points>>1) - 8; 319 int points){ 326 mdct_butterfly_first(T,x,points); 331 mdct_butterfly_generic(T,x+(points>>i)*j,points>> 217 mdct_butterfly_first(DATA_TYPE *T, DATA_TYPE *x, int points) argument 264 mdct_butterfly_generic(DATA_TYPE *T, DATA_TYPE *x, int points, int trigint) argument 317 mdct_butterflies(mdct_lookup *init, DATA_TYPE *x, int points) argument [all...] |
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | vgu.c | 81 const VGfloat * points, 94 if (!points || count <= 0 || !is_aligned(points)) { 107 coords[0] = points[0]; 108 coords[1] = points[1]; 111 coords[2*i + 0] = points[2*i + 0]; 112 coords[2*i + 1] = points[2*i + 1]; 80 vguPolygon(VGPath path, const VGfloat * points, VGint count, VGboolean closed) argument
|
/external/mesa3d/src/mesa/tnl_dd/ |
H A D | t_dd_tritmp.h | 42 * DO_UNFILLED: Decompose triangles to lines and points where appropriate. 632 static void TAG(points)( struct gl_context *ctx, GLuint first, GLuint last ) function 669 TAB[IND].points = TAG(points);
|
/external/opencv/cv/src/ |
H A D | cvposit.cpp | 54 static CvStatus icvCreatePOSITObject( CvPoint3D32f *points, argument 73 if( points == NULL ) 94 * Construct object vectors from object points * 98 pObject->obj_vecs[i] = points[i + 1].x - points[0].x; 99 pObject->obj_vecs[N + i] = points[i + 1].y - points[0].y; 100 pObject->obj_vecs[2 * N + i] = points[i + 1].z - points[0].z; 335 cvCreatePOSITObject( CvPoint3D32f * points, in argument [all...] |
/external/opencv/cvaux/src/ |
H A D | cvfindhandregion.cpp | 54 icvFindHandRegion( CvPoint3D32f * points, int count, argument 89 assert( points != NULL && line != NULL ); 90 if( points == NULL || line == NULL ) 140 icvSubVector_32f ((IppmVect32f )&points[i], (IppmVect32f )&line[3], sub, 3); 145 sub[0] = points[i].x - line[3]; 146 sub[1] = points[i].y - line[4]; 147 sub[2] = points[i].z - line[5]; 173 /* compute the number of points in each bucket */ 224 /* select hand's points and calculate mean value */ 269 icvFindHandRegionA( CvPoint3D32f * points, in argument 592 cvFindHandRegion( CvPoint3D32f * points, int count, CvSeq * indexs, float *line, CvSize2D32f size, int flag, CvPoint3D32f * center, CvMemStorage * storage, CvSeq ** numbers ) argument 632 cvFindHandRegionA( CvPoint3D32f * points, int count, CvSeq * indexs, float *line, CvSize2D32f size, int jc, CvPoint3D32f * center, CvMemStorage * storage, CvSeq ** numbers ) argument [all...] |
H A D | cvlevmartrif.cpp | 85 if( numPoints < 1 )//!!! Need to correct this minimal number of points 87 CV_ERROR( CV_StsUnmatchedSizes, "number of points must be more than 0" ); 98 /* each 3D points has X,Y,Z,W */ 100 /* For N points 4D we have Jacobian 2N x (12*3+4N) */ 169 /* Computers project points using 3 projection matrices and points 3D */ 173 /* each 3D points has X,Y,Z,W(?) */ 175 /* result of function is projection of N 3D points using 3 projection matrices */ 176 /* projected points store as (projection by matrix P1),(projection by matrix P2),(projection by matrix P3) */ 179 /* Compute projection of points */ 446 icvCreateGoodPoints(CvMat *points,CvMat **goodPoints, CvMat *status) argument [all...] |
/external/openssl/crypto/ec/ |
H A D | ec2_smpl.c | 599 /* Indicates whether two points are equal. 686 int ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument 692 if (!group->meth->make_affine(group, points[i], ctx)) return 0;
|
/external/skia/src/animator/ |
H A D | SkParseSVGPath.cpp | 31 //define our points 119 SkPoint points[3]; local 144 data = find_points(data, points, 1, relative, &c); 145 fPath.moveTo(points[0]); 147 c = points[0]; 150 data = find_points(data, points, 1, relative, &c); 151 fPath.lineTo(points[0]); 152 c = points[0]; 169 data = find_points(data, points, 3, relative, &c); 172 data = find_points(data, &points[ [all...] |
/external/skia/src/core/ |
H A D | SkOrderedReadBuffer.cpp | 165 bool SkOrderedReadBuffer::readPointArray(SkPoint* points, size_t size) { argument 166 return readArray(points, size, sizeof(SkPoint));
|
/external/skia/src/pdf/ |
H A D | SkPDFDeviceFlattener.cpp | 35 size_t count, const SkPoint points[], 38 INHERITED::drawPoints(d, mode, count, points, paint); 46 d.fMatrix->mapPoints(flattenedPoints, points, SkToS32(count)); 34 drawPoints(const SkDraw& d, SkCanvas::PointMode mode, size_t count, const SkPoint points[], const SkPaint& paint) argument
|
/external/skia/src/utils/debugger/ |
H A D | SkObjectParser.cpp | 149 SkPoint points[4]; local 151 for(verb = iter.next(points, false); 153 verb = iter.next(points, false)) { 160 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fX); 162 mPath->appendScalar(points[gPtOffsetPerVerb[verb]+i].fY);
|
/external/skia/src/utils/win/ |
H A D | SkDWriteGeometrySink.cpp | 74 void STDMETHODCALLTYPE SkDWriteGeometrySink::AddLines(const D2D1_POINT_2F *points, UINT pointsCount) { argument 75 for (const D2D1_POINT_2F *end = &points[pointsCount]; points < end; ++points) { 76 fPath->lineTo(points->x, points->y);
|
/external/chromium_org/ash/wm/ |
H A D | system_gesture_event_filter_unittest.cc | 302 gfx::Point points[kTouchPoints] = { local 313 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 0, 150); 322 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 0, -150); 329 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 150, 0); 336 left_points[i] = points[i]; 346 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 150, 0); 361 gfx::Point points[kTouchPoints] = { local 372 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 0, 150); 379 generator.GestureMultiFingerScroll(kTouchPoints, points, 15, kSteps, 0, -150); 387 generator.GestureMultiFingerScroll(kTouchPoints, points, 1 426 gfx::Point points[kTouchPoints] = { local 453 gfx::Point points[kTouchPoints] = { local 512 gfx::Point points[kTouchPoints] = { local 539 gfx::Point points[kTouchPoints] = { local 574 gfx::Point points[kTouchPoints] = { local 611 gfx::Point points[kTouchPoints] = { local 644 gfx::Point points[kTouchPoints] = { local [all...] |
/external/chromium_org/chrome/browser/rlz/ |
H A D | rlz.cc | 137 rlz_lib::AccessPoint points[] = {RLZTracker::CHROME_OMNIBOX, local 148 return rlz_lib::SendFinancialPing(rlz_lib::CHROME, points, 374 // Prime the RLZ cache for the access points we are interested in. 504 // GetAccessPointRlz() caches RLZ strings for all access points. If we had 512 // GetAccessPointRlz() caches RLZ strings for all access points. If we had
|