HomeSort by relevance Sort by last modified time
    Searched defs:pts (Results 1 - 25 of 369) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /packages/apps/Terminal/jni/
forkpty.cpp 45 int pts = open(devname, O_RDWR); local
46 if (pts < 0) {
52 tcsetattr(pts, TCSAFLUSH, termp);
56 ioctl(pts, TIOCSWINSZ, winp);
68 if (ioctl(pts, TIOCSCTTY, (char *)NULL) == -1) exit(-1);
69 dup2(pts, STDIN_FILENO);
70 dup2(pts, STDOUT_FILENO);
71 dup2(pts, STDERR_FILENO);
72 if (pts > 2) {
73 close(pts);
    [all...]
  /external/chromium_org/media/formats/mp2t/
es_parser.h 35 base::TimeDelta pts,
47 TimingDesc(DecodeTimestamp dts, base::TimeDelta pts);
50 base::TimeDelta pts; member in struct:media::mp2t::EsParser::TimingDesc
74 // - "In the case of audio, if a PTS is present in PES packet header it shall
79 // in Annex A of Rec. ITU-T H.264 | ISO/IEC 14496-10 video, if a PTS is
es_parser_test_base.h 36 base::TimeDelta pts; member in struct:media::mp2t::EsParserTestBase::Packet
  /external/chromium_org/third_party/skia/bench/
PathIterBench.cpp 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) {
22 pts[i].fX = rand.nextSScalar1();
23 pts[i].fY = rand.nextSScalar1();
40 SkPoint pts[4]; local
41 int n = rand_pts(rand, pts);
44 fPath.moveTo(pts[0]);
47 fPath.lineTo(pts[1]);
50 fPath.quadTo(pts[1], pts[2]);
53 fPath.cubicTo(pts[1], pts[2], pts[3])
73 SkPoint pts[4]; variable
81 SkPoint pts[4]; variable
    [all...]
  /external/chromium_org/third_party/skia/samplecode/
SampleBigGradient.cpp 15 SkPoint pts[] = { { 0, 0 }, { w, h } }; local
16 return SkGradientShader::CreateLinear(pts, colors, NULL, 2,
SampleClamp.cpp 17 SkPoint pts[] = { 0, 0, SK_Scalar1/500, SK_Scalar1/500 }; local
19 return SkGradientShader::CreateLinear(pts, colors, NULL, 2,
SampleHairCurves.cpp 43 SkScalar pts[] = { local
49 curves.moveTo(pts[0], pts[1]);
50 curves.cubicTo(pts[2], pts[3],
51 pts[4], pts[5],
52 pts[6], pts[7]);
54 hulls.moveTo(pts[0], pts[1])
65 SkScalar pts[] = { local
83 SkScalar pts[] = { local
104 SkScalar pts[] = { local
    [all...]
SamplePoints.cpp 42 static void fill_pts(SkPoint pts[], size_t n, SkRandom* rand) {
44 pts[i].set(rand->nextUScalar1() * 640, rand->nextUScalar1() * 480);
63 SkPoint* pts = new SkPoint[n]; local
64 fill_pts(pts, n, &rand);
66 canvas->drawPoints(SkCanvas::kPolygon_PointMode, n, pts, p0);
67 canvas->drawPoints(SkCanvas::kLines_PointMode, n, pts, p1);
68 canvas->drawPoints(SkCanvas::kPoints_PointMode, n, pts, p2);
69 canvas->drawPoints(SkCanvas::kPoints_PointMode, n, pts, p3);
71 delete[] pts;
  /external/chromium_org/third_party/skia/tests/
GeometryTest.cpp 37 SkPoint pts[3], dst[5]; local
39 pts[0].set(0, 0);
40 pts[1].set(100, 50);
41 pts[2].set(0, 100);
43 int count = SkChopQuadAtMaxCurvature(pts, dst);
46 pts[0].set(0, 0);
47 pts[1].set(SkIntToScalar(3), 0);
48 pts[2].set(SkIntToScalar(3), SkIntToScalar(3));
49 SkConvertQuadToCubic(pts, dst);
PathMeasureTest.cpp 13 const SkPoint pts[] = { local
19 path.moveTo(pts[0]);
20 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 3) {
21 path.cubicTo(pts[i], pts[i + 1], pts[i + 2]);
30 const SkPoint pts[] = { local
36 path.moveTo(pts[0]);
37 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 2) {
38 path.quadTo(pts[i], pts[i + 1])
46 const SkPoint pts[] = { local
    [all...]
PathOpsDLineTest.cpp 36 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; local
37 line2.set(pts);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
  /external/skia/bench/
PathIterBench.cpp 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) {
22 pts[i].fX = rand.nextSScalar1();
23 pts[i].fY = rand.nextSScalar1();
40 SkPoint pts[4]; local
41 int n = rand_pts(rand, pts);
44 fPath.moveTo(pts[0]);
47 fPath.lineTo(pts[1]);
50 fPath.quadTo(pts[1], pts[2]);
53 fPath.cubicTo(pts[1], pts[2], pts[3])
73 SkPoint pts[4]; variable
81 SkPoint pts[4]; variable
    [all...]
  /external/skia/samplecode/
SampleBigGradient.cpp 15 SkPoint pts[] = { { 0, 0 }, { w, h } }; local
16 return SkGradientShader::CreateLinear(pts, colors, NULL, 2,
  /external/skia/tests/
GeometryTest.cpp 37 SkPoint pts[3], dst[5]; local
39 pts[0].set(0, 0);
40 pts[1].set(100, 50);
41 pts[2].set(0, 100);
43 int count = SkChopQuadAtMaxCurvature(pts, dst);
46 pts[0].set(0, 0);
47 pts[1].set(SkIntToScalar(3), 0);
48 pts[2].set(SkIntToScalar(3), SkIntToScalar(3));
49 SkConvertQuadToCubic(pts, dst);
PathMeasureTest.cpp 13 const SkPoint pts[] = { local
19 path.moveTo(pts[0]);
20 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 3) {
21 path.cubicTo(pts[i], pts[i + 1], pts[i + 2]);
30 const SkPoint pts[] = { local
36 path.moveTo(pts[0]);
37 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 2) {
38 path.quadTo(pts[i], pts[i + 1])
46 const SkPoint pts[] = { local
    [all...]
PathOpsDLineTest.cpp 36 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; local
37 line2.set(pts);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
  /external/chromium_org/third_party/skia/experimental/Intersection/
LineIntersection_Test.cpp 43 int pts = intersect(line1, line2, ts); local
44 if (!pts) {
47 for (int i = 0; i < pts; ++i) {
52 if (pts == 1) {
67 int pts = intersect(line1, line2, ts); local
68 if (pts) {
SimplifyFindTop_Test.cpp 58 SkPoint pts[2]; local
60 pts[0] = topSegment->xyAtT(&topSegment->span(index));
68 pts[1] = topSegment->xyAtT(&topSegment->span(index));
69 if (pts[0] != pts[1]) {
73 SkASSERT(pts[0].fX == x1);
74 SkASSERT(pts[0].fY == y1);
75 SkASSERT(pts[1].fX == x2);
76 SkASSERT(pts[1].fY == y2);
  /external/chromium_org/third_party/skia/gm/
alphagradients.cpp 28 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fBottom } }; local
31 SkShader* s = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
composeshader.cpp 19 SkPoint pts[2]; local
22 pts[0].set(0, 0);
23 pts[1].set(SkIntToScalar(100), 0);
26 SkAutoTUnref<SkShader> shaderA(SkGradientShader::CreateLinear(pts, colors, NULL, 2,
29 pts[0].set(0, 0);
30 pts[1].set(0, SkIntToScalar(100));
33 SkAutoTUnref<SkShader> shaderB(SkGradientShader::CreateLinear(pts, colors, NULL, 2,
patch.cpp 18 const SkPoint pts[] = { { 100.f / 4.f, 0.f }, { 3.f * 100.f / 4.f, 100.f } }; local
20 return SkGradientShader::CreateLinear(pts, colors, NULL, SK_ARRAY_COUNT(colors),
shallowgradient.cpp 14 SkPoint pts[] = { { 0, 0 }, { size.width(), size.height() } }; local
15 return SkGradientShader::CreateLinear(pts, colors, NULL, count,
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.h 16 const SkDCubic& first() const { return (const SkDCubic&) pts[0]; }
17 const SkDCubic& second() const { return (const SkDCubic&) pts[3]; }
18 SkDPoint pts[7]; member in struct:SkDCubicPair
59 void set(const SkPoint pts[4]) {
60 fPts[0] = pts[0];
61 fPts[1] = pts[1];
62 fPts[2] = pts[2];
63 fPts[3] = pts[3];
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
79 cubic.set(pts);
    [all...]
SkPathOpsQuad.h 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; }
15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; }
16 SkDPoint pts[5]; member in struct:SkDQuadPair
27 void set(const SkPoint pts[3]) {
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
59 quad.set(pts);
  /external/chromium_org/third_party/skia/src/views/
SkParsePaint.cpp 24 SkPoint pts[2]; local
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
39 return SkGradientShader::CreateLinear(pts, colors, NULL, 2, mode);

Completed in 644 milliseconds

1 2 3 4 5 6 7 8 91011>>