Lines Matching refs:tmp

117     SkPoint tmp[2];
118 memcpy(tmp, src, sizeof(tmp));
121 if (tmp[index0].fY < clip.fTop) {
122 tmp[index0].set(sect_with_horizontal(src, clip.fTop), clip.fTop);
124 if (tmp[index1].fY > clip.fBottom) {
125 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom);
128 if (tmp[0].fX < tmp[1].fX) {
137 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) &&
138 tmp[index0].fX < tmp[index1].fX) {
143 if (tmp[index0].fX < clip.fLeft) {
144 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft));
146 if (tmp[index1].fX > clip.fRight) {
147 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight));
150 bounds.set(tmp, 2);
153 memcpy(dst, tmp, sizeof(tmp));
220 // Chop in Y to produce a single segment, stored in tmp[0..1]
222 SkPoint tmp[2];
223 memcpy(tmp, pts, sizeof(tmp));
227 tmp[index0].set(sect_with_horizontal(pts, clip.fTop), clip.fTop);
228 SkASSERT(is_between_unsorted(tmp[index0].fX, pts[0].fX, pts[1].fX));
230 if (tmp[index1].fY > clip.fBottom) {
231 tmp[index1].set(sect_with_horizontal(pts, clip.fBottom), clip.fBottom);
232 SkASSERT(is_between_unsorted(tmp[index1].fX, pts[0].fX, pts[1].fX));
239 SkPoint* result; // points to our results, either tmp or resultStorage
253 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left
254 tmp[0].fX = tmp[1].fX = clip.fLeft;
255 result = tmp;
257 } else if (tmp[index0].fX >= clip.fRight) { // wholly to the right
258 tmp[0].fX = tmp[1].fX = clip.fRight;
259 result = tmp;
265 if (tmp[index0].fX < clip.fLeft) {
266 r->set(clip.fLeft, tmp[index0].fY);
268 r->set(clip.fLeft, sect_with_vertical(tmp, clip.fLeft));
269 SkASSERT(is_between_unsorted(r->fY, tmp[0].fY, tmp[1].fY));
271 *r = tmp[index0];
275 if (tmp[index1].fX > clip.fRight) {
276 r->set(clip.fRight, sect_with_vertical(tmp, clip.fRight));
277 SkASSERT(is_between_unsorted(r->fY, tmp[0].fY, tmp[1].fY));
279 r->set(clip.fRight, tmp[index1].fY);
281 *r = tmp[index1];