Lines Matching refs:tmp
120 SkPoint tmp[2];
121 memcpy(tmp, src, sizeof(tmp));
124 if (tmp[index0].fY < clip.fTop) {
125 tmp[index0].set(sect_with_horizontal(src, clip.fTop), clip.fTop);
127 if (tmp[index1].fY > clip.fBottom) {
128 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom);
131 if (tmp[0].fX < tmp[1].fX) {
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) {
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) {
148 if (tmp[index0].fX < clip.fLeft) {
149 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft));
151 if (tmp[index1].fX > clip.fRight) {
152 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight));
155 bounds.set(tmp[0], tmp[1]);
158 memcpy(dst, tmp, sizeof(tmp));
196 // Chop in Y to produce a single segment, stored in tmp[0..1]
198 SkPoint tmp[2];
199 memcpy(tmp, pts, sizeof(tmp));
203 tmp[index0].set(sect_with_horizontal(pts, clip.fTop), clip.fTop);
204 SkASSERT(is_between_unsorted(tmp[index0].fX, pts[0].fX, pts[1].fX));
206 if (tmp[index1].fY > clip.fBottom) {
207 tmp[index1].set(sect_with_horizontal(pts, clip.fBottom), clip.fBottom);
208 SkASSERT(is_between_unsorted(tmp[index1].fX, pts[0].fX, pts[1].fX));
215 SkPoint* result; // points to our results, either tmp or resultStorage
229 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left
230 tmp[0].fX = tmp[1].fX = clip.fLeft;
231 result = tmp;
233 } else if (tmp[index0].fX >= clip.fRight) { // wholly to the right
237 tmp[0].fX = tmp[1].fX = clip.fRight;
238 result = tmp;
244 if (tmp[index0].fX < clip.fLeft) {
245 r->set(clip.fLeft, tmp[index0].fY);
247 r->set(clip.fLeft, sect_clamp_with_vertical(tmp, clip.fLeft));
248 SkASSERT(is_between_unsorted(r->fY, tmp[0].fY, tmp[1].fY));
250 *r = tmp[index0];
254 if (tmp[index1].fX > clip.fRight) {
255 r->set(clip.fRight, sect_clamp_with_vertical(tmp, clip.fRight));
256 SkASSERT(is_between_unsorted(r->fY, tmp[0].fY, tmp[1].fY));
258 r->set(clip.fRight, tmp[index1].fY);
260 *r = tmp[index1];