HomeSort by relevance Sort by last modified time
    Searched refs:fFirstY (Results 1 - 6 of 6) sorted by null

  /external/chromium_org/third_party/skia/src/core/
SkScan_Path.cpp 31 while (edge->fFirstY != SK_MaxS32) {
33 SkASSERT(y <= edge->fFirstY);
35 y = edge->fFirstY;
70 SkASSERT(prev && prev->fFirstY <= curr_y + 1);
80 SkASSERT(newEdge->fFirstY >= curr_y);
82 while (newEdge->fFirstY == curr_y) {
91 while (edge->fFirstY <= curr_y) {
95 SkASSERT(edge->fFirstY <= edge->fLastY);
136 while (currE->fFirstY <= curr_y) {
159 SkASSERT(currE->fFirstY == curr_y + 1)
    [all...]
SkEdge.h 32 int32_t fFirstY;
47 SkASSERT(fFirstY < clip.fBottom);
53 SkDebugf("edge: firstY:%d lastY:%d x:%g dx:%g w:%d\n", fFirstY, fLastY, SkFixedToFloat(fX), SkFixedToFloat(fDX), fWinding);
61 SkASSERT(fFirstY <= fLastY);
128 fFirstY = top;
SkEdge.cpp 79 fFirstY = top;
106 // SkASSERT(top >= fFirstY);
120 fFirstY = top;
128 int top = fFirstY;
137 fFirstY = clip.fTop;
  /external/skia/src/core/
SkScan_Path.cpp 31 while (edge->fFirstY != SK_MaxS32) {
33 SkASSERT(y <= edge->fFirstY);
35 y = edge->fFirstY;
70 SkASSERT(prev && prev->fFirstY <= curr_y + 1);
80 SkASSERT(newEdge->fFirstY >= curr_y);
82 while (newEdge->fFirstY == curr_y) {
91 while (edge->fFirstY <= curr_y) {
95 SkASSERT(edge->fFirstY <= edge->fLastY);
136 while (currE->fFirstY <= curr_y) {
159 SkASSERT(currE->fFirstY == curr_y + 1)
    [all...]
SkEdge.h 32 int32_t fFirstY;
47 SkASSERT(fFirstY < clip.fBottom);
53 SkDebugf("edge: firstY:%d lastY:%d x:%g dx:%g w:%d\n", fFirstY, fLastY, SkFixedToFloat(fX), SkFixedToFloat(fDX), fWinding);
61 SkASSERT(fFirstY <= fLastY);
128 fFirstY = top;
SkEdge.cpp 79 fFirstY = top;
106 // SkASSERT(top >= fFirstY);
120 fFirstY = top;
128 int top = fFirstY;
137 fFirstY = clip.fTop;

Completed in 81 milliseconds