Lines Matching refs:y2
85 #define GOOD_RECT(rect) ((rect)->x1 < (rect)->x2 && (rect)->y1 < (rect)->y2)
86 #define BAD_RECT(rect) ((rect)->x1 > (rect)->x2 || (rect)->y1 > (rect)->y2)
133 * coordinate (y2). Thus all rectangles in a band differ only in their left
139 * the y1 to y2 area spanned by the band), then the rectangle may be broken
174 ((r1)->y2 <= (r2)->y1) || \
175 ((r1)->y1 >= (r2)->y2) ) )
181 ((r)->y2 > y) && \
189 ((r1)->y2 >= (r2)->y2) )
247 next_rect->y2 = ny2; \
310 if (reg1->extents.y2 != reg2->extents.y2)
330 if (rects1[i].y2 != rects2[i].y2)
353 rgn->extents.y2);
358 rects[i].x1, rects[i].y1, rects[i].x2, rects[i].y2);
384 region->extents.y2 = y + height;
561 * - rectangles in the previous band will have their y2 fields
575 int y2; /* Bottom of current band */
591 if (prev_box->y2 != cur_box->y1) return cur_start;
599 y2 = cur_box->y2;
622 prev_box->y2 = y2;
662 int y2)
669 critical_if_fail (y1 < y2);
680 ADDRECT (next_rect, r->x1, y1, r->x2, y2);
745 int y2);
890 bot = MIN (r1->y2, r2y1);
906 bot = MIN (r2->y2, r1y1);
929 ybot = MIN (r1->y2, r2->y2);
946 * If we've finished with a band (y2 == ybot) we skip forward
949 if (r1->y2 == ybot)
952 if (r2->y2 == ybot)
975 MAX (r1y1, ybot), r1->y2))
994 MAX (r2y1, ybot), r2->y2))
1057 region->extents.y2 = region->extents.y1;
1067 * it must have the largest y2, because of banding. Initialize x1 and
1074 region->extents.y2 = box_end->y2;
1076 critical_if_fail (region->extents.y1 < region->extents.y2);
1114 int y2)
1122 critical_if_fail (y1 < y2);
1135 NEWRECT (region, next_rect, x1, y1, x2, y2);
1172 new_reg->extents.y2 = new_reg->extents.y1;
1189 new_reg->extents.y2 = MIN (reg1->extents.y2, reg2->extents.y2);
1233 NEWRECT (region, next_rect, x1, y1, x2, y2); \
1266 int y2)
1272 critical_if_fail (y1 < y2);
1317 NEWRECT (region, next_rect, x1, y1, x2, y2);
1335 region.extents.y2 = y + height;
1356 region.extents.y2 = y + height;
1446 new_reg->extents.y2 = MAX (reg1->extents.y2, reg2->extents.y2);
1660 if (box->y1 == ri_box->y1 && box->y2 == ri_box->y2)
1678 else if (box->y1 >= ri_box->y2)
1740 * extents.x2 and extents.y2
1746 reg->extents.y2 = ri_box->y2;
1781 if (hreg->extents.y2 > reg->extents.y2)
1782 reg->extents.y2 = hreg->extents.y2;
1837 int y2)
1844 critical_if_fail (y1 < y2);
1890 NEWRECT (region, next_rect, x1, y1, r2->x1, y2);
1916 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1933 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1978 reg_d->extents.y2 = reg_d->extents.y1;
2065 /* In time O(log n), locate the first box whose y2 is greater than y.
2078 if (begin->y2 > y)
2085 if (mid->y2 > y)
2149 /* can stop when both part_out and part_in are TRUE, or we reach prect->y2 */
2155 if (pbox->y2 <= y)
2164 if (part_in || (pbox->y1 >= prect->y2))
2188 y = pbox->y2; /* finished with this band */
2189 if (y >= prect->y2)
2209 if (y < prect->y2)
2227 overflow_int_t x1, x2, y1, y2;
2235 region->extents.y2 = y2 = region->extents.y2 + y;
2237 if (((x1 - PIXMAN_REGION_MIN) | (y1 - PIXMAN_REGION_MIN) | (PIXMAN_REGION_MAX - x2) | (PIXMAN_REGION_MAX - y2)) >= 0)
2246 pbox->y2 += y;
2252 if (((x2 - PIXMAN_REGION_MIN) | (y2 - PIXMAN_REGION_MIN) | (PIXMAN_REGION_MAX - x1) | (PIXMAN_REGION_MAX - y1)) <= 0)
2255 region->extents.y2 = region->extents.y1;
2268 else if (y2 > PIXMAN_REGION_MAX)
2269 region->extents.y2 = PIXMAN_REGION_MAX;
2280 pbox_out->y2 = y2 = pbox->y2 + y;
2282 if (((x2 - PIXMAN_REGION_MIN) | (y2 - PIXMAN_REGION_MIN) |
2296 else if (y2 > PIXMAN_REGION_MAX)
2297 pbox_out->y2 = PIXMAN_REGION_MAX;
2418 (reg->extents.y1 > reg->extents.y2))
2427 (reg->extents.y1 == reg->extents.y2) &&
2441 box.y2 = pbox_p[numRects - 1].y2;
2447 (pbox_n->y1 >= pbox_n->y2))
2460 ((pbox_n->x1 < pbox_p->x2) || (pbox_n->y2 != pbox_p->y2))))
2469 (box.y2 == reg->extents.y2));
2489 boxes[0].y2 - boxes[0].y1);
2519 if (box->x1 >= box->x2 || box->y1 >= box->y2)
2567 ((r-1)->y1 == ry1) && ((r-1)->y2 == ry2) &&
2580 r->y2 = ry2;
2764 old_rect->y2 += 1;
2782 region->extents.y2 = PIXREGION_END(region)->y2;
