OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:srcPts
(Results
1 - 15
of
15
) sorted by null
/external/chromium_org/third_party/skia/src/core/
SkQuadClipper.cpp
51
bool SkQuadClipper::clipQuad(const SkPoint
srcPts
[3], SkPoint dst[3]) {
55
if (
srcPts
[0].fY >
srcPts
[2].fY) {
56
dst[0] =
srcPts
[2];
57
dst[1] =
srcPts
[1];
58
dst[2] =
srcPts
[0];
61
memcpy(dst,
srcPts
, 3 * sizeof(SkPoint));
SkCubicClipper.cpp
116
bool SkCubicClipper::clipCubic(const SkPoint
srcPts
[4], SkPoint dst[4]) {
120
if (
srcPts
[0].fY >
srcPts
[3].fY) {
121
dst[0] =
srcPts
[3];
122
dst[1] =
srcPts
[2];
123
dst[2] =
srcPts
[1];
124
dst[3] =
srcPts
[0];
127
memcpy(dst,
srcPts
, 4 * sizeof(SkPoint));
SkEdgeClipper.h
36
void clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip);
37
void clipMonoCubic(const SkPoint
srcPts
[4], const SkRect& clip);
SkQuadClipper.h
55
void clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip);
56
void clipMonoCubic(const SkPoint
srcPts
[4], const SkRect& clip);
SkEdgeClipper.cpp
124
//
srcPts
[] must be monotonic in X and Y
125
void SkEdgeClipper::clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip) {
127
bool reverse = sort_increasing_Y(pts,
srcPts
, 3);
197
bool SkEdgeClipper::clipQuad(const SkPoint
srcPts
[3], const SkRect& clip) {
202
bounds.set(
srcPts
, 3);
206
int countY = SkChopQuadAtYExtrema(
srcPts
, monoY);
327
//
srcPts
[] must be monotonic in X and Y
405
bool SkEdgeClipper::clipCubic(const SkPoint
srcPts
[4], const SkRect& clip) {
410
bounds.set(
srcPts
, 4);
414
int countY = SkChopCubicAtYExtrema(
srcPts
, monoY)
[
all
...]
SkPath.cpp
[
all
...]
/external/skia/src/core/
SkQuadClipper.cpp
51
bool SkQuadClipper::clipQuad(const SkPoint
srcPts
[3], SkPoint dst[3]) {
55
if (
srcPts
[0].fY >
srcPts
[2].fY) {
56
dst[0] =
srcPts
[2];
57
dst[1] =
srcPts
[1];
58
dst[2] =
srcPts
[0];
61
memcpy(dst,
srcPts
, 3 * sizeof(SkPoint));
SkCubicClipper.cpp
116
bool SkCubicClipper::clipCubic(const SkPoint
srcPts
[4], SkPoint dst[4]) {
120
if (
srcPts
[0].fY >
srcPts
[3].fY) {
121
dst[0] =
srcPts
[3];
122
dst[1] =
srcPts
[2];
123
dst[2] =
srcPts
[1];
124
dst[3] =
srcPts
[0];
127
memcpy(dst,
srcPts
, 4 * sizeof(SkPoint));
SkEdgeClipper.h
36
void clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip);
37
void clipMonoCubic(const SkPoint
srcPts
[4], const SkRect& clip);
SkQuadClipper.h
55
void clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip);
56
void clipMonoCubic(const SkPoint
srcPts
[4], const SkRect& clip);
SkEdgeClipper.cpp
124
//
srcPts
[] must be monotonic in X and Y
125
void SkEdgeClipper::clipMonoQuad(const SkPoint
srcPts
[3], const SkRect& clip) {
127
bool reverse = sort_increasing_Y(pts,
srcPts
, 3);
197
bool SkEdgeClipper::clipQuad(const SkPoint
srcPts
[3], const SkRect& clip) {
202
bounds.set(
srcPts
, 3);
206
int countY = SkChopQuadAtYExtrema(
srcPts
, monoY);
327
//
srcPts
[] must be monotonic in X and Y
405
bool SkEdgeClipper::clipCubic(const SkPoint
srcPts
[4], const SkRect& clip) {
410
bounds.set(
srcPts
, 4);
414
int countY = SkChopCubicAtYExtrema(
srcPts
, monoY)
[
all
...]
SkPath.cpp
[
all
...]
/external/chromium_org/third_party/skia/src/animator/
SkMatrixParts.cpp
243
int
srcPts
= sourcePath.getPoints(src, 4);
246
if (
srcPts
!= dstPts)
249
temp.setPolyToPoly(src, dst,
srcPts
);
/external/skia/src/animator/
SkMatrixParts.cpp
243
int
srcPts
= sourcePath.getPoints(src, 4);
246
if (
srcPts
!= dstPts)
249
temp.setPolyToPoly(src, dst,
srcPts
);
/external/skia/tests/
PathTest.cpp
667
const SkPoint
srcPts
[], bool expectClose) {
677
REPORTER_ASSERT(reporter, pts[0] ==
srcPts
[0]);
678
srcPts
++;
683
REPORTER_ASSERT(reporter, pts[1] ==
srcPts
[0]);
684
srcPts
++;
[
all
...]
Completed in 992 milliseconds