Lines Matching refs:x1
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)
129 * y coordinate first (y1), and then by left side x coordinate (x1).
134 * and right side (x1 and x2). Bands are implicit in the array of rectangles:
172 (!( ((r1)->x2 <= (r2)->x1) || \
173 ((r1)->x1 >= (r2)->x2) || \
180 ((r)->x1 <= x) && \
186 ( ((r1)->x1 <= (r2)->x1) && \
244 next_rect->x1 = nx1; \
301 if (reg1->extents.x1 != reg2->extents.x1)
321 if (rects1[i].x1 != rects2[i].x1)
350 rgn->extents.x1,
358 rects[i].x1, rects[i].y1, rects[i].x2, rects[i].y2);
381 region->extents.x1 = x;
603 if ((prev_box->x1 != cur_box->x1) || (prev_box->x2 != cur_box->x2))
679 critical_if_fail (r->x1 < r->x2);
680 ADDRECT (next_rect, r->x1, y1, r->x2, y2);
1056 region->extents.x2 = region->extents.x1;
1067 * it must have the largest y2, because of banding. Initialize x1 and
1071 region->extents.x1 = box->x1;
1080 if (box->x1 < region->extents.x1)
1081 region->extents.x1 = box->x1;
1087 critical_if_fail (region->extents.x1 < region->extents.x2);
1116 int x1;
1127 x1 = MAX (r1->x1, r2->x1);
1134 if (x1 < x2)
1135 NEWRECT (region, next_rect, x1, y1, x2, y2);
1171 new_reg->extents.x2 = new_reg->extents.x1;
1186 new_reg->extents.x1 = MAX (reg1->extents.x1, reg2->extents.x1);
1224 if (r->x1 <= x2) \
1233 NEWRECT (region, next_rect, x1, y1, x2, y2); \
1234 x1 = r->x1; \
1269 int x1; /* left and right side of current union */
1278 if (r1->x1 < r2->x1)
1280 x1 = r1->x1;
1286 x1 = r2->x1;
1292 if (r1->x1 < r2->x1)
1317 NEWRECT (region, next_rect, x1, y1, x2, y2);
1332 region.extents.x1 = x;
1353 region.extents.x1 = x;
1443 new_reg->extents.x1 = MIN (reg1->extents.x1, reg2->extents.x1);
1471 int x1;
1482 (rects[0].y1 == rects[1].y1 && rects[0].x1 > rects[1].x1))
1493 x1 = rects[0].x1;
1507 while (i != numRects && (r->y1 < y1 || (r->y1 == y1 && r->x1 < x1)));
1515 while (y1 < r->y1 || (y1 == r->y1 && x1 < r->x1));
1552 * and secondary key x1.
1608 if (badreg->extents.x1 < badreg->extents.x2)
1625 /* Step 1: Sort the rects array into ascending (y1, x1) order */
1663 if (box->x1 <= ri_box->x2)
1684 if (reg->extents.x1 > box->x1)
1685 reg->extents.x1 = box->x1;
1772 if (hreg->extents.x1 < reg->extents.x1)
1773 reg->extents.x1 = hreg->extents.x1;
1818 * Overlapping band subtraction. x1 is the left-most point not yet
1840 int x1;
1842 x1 = r1->x1;
1851 if (r2->x2 <= x1)
1858 else if (r2->x1 <= x1)
1863 x1 = r2->x2;
1864 if (x1 >= r1->x2)
1872 x1 = r1->x1;
1883 else if (r2->x1 < r1->x2)
1889 critical_if_fail (x1 < r2->x1);
1890 NEWRECT (region, next_rect, x1, y1, r2->x1, y2);
1892 x1 = r2->x2;
1893 if (x1 >= r1->x2)
1900 x1 = r1->x1;
1915 if (r1->x2 > x1)
1916 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1921 x1 = r1->x1;
1931 critical_if_fail (x1 < r1->x2);
1933 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1937 x1 = r1->x1;
1977 reg_d->extents.x2 = reg_d->extents.x1;
2146 x = prect->x1;
2166 y = pbox->y1; /* x guaranteed to be == prect->x1 */
2172 if (pbox->x1 > x)
2179 if (pbox->x1 < prect->x2)
2191 x = prect->x1; /* reset x out to left again */
2227 overflow_int_t x1, x2, y1, y2;
2232 region->extents.x1 = x1 = region->extents.x1 + x;
2237 if (((x1 - PIXMAN_REGION_MIN) | (y1 - PIXMAN_REGION_MIN) | (PIXMAN_REGION_MAX - x2) | (PIXMAN_REGION_MAX - y2)) >= 0)
2243 pbox->x1 += x;
2252 if (((x2 - PIXMAN_REGION_MIN) | (y2 - PIXMAN_REGION_MIN) | (PIXMAN_REGION_MAX - x1) | (PIXMAN_REGION_MAX - y1)) <= 0)
2254 region->extents.x2 = region->extents.x1;
2261 if (x1 < PIXMAN_REGION_MIN)
2262 region->extents.x1 = PIXMAN_REGION_MIN;
2277 pbox_out->x1 = x1 = pbox->x1 + x;
2283 (PIXMAN_REGION_MAX - x1) | (PIXMAN_REGION_MAX - y1)) <= 0)
2289 if (x1 < PIXMAN_REGION_MIN)
2290 pbox_out->x1 = PIXMAN_REGION_MIN;
2374 if ((y < pbox->y1) || (x < pbox->x1))
2417 if ((reg->extents.x1 > reg->extents.x2) ||
2426 return ((reg->extents.x1 == reg->extents.x2) &&
2446 if ((pbox_n->x1 >= pbox_n->x2) ||
2452 if (pbox_n->x1 < box.x1)
2453 box.x1 = pbox_n->x1;
2460 ((pbox_n->x1 < pbox_p->x2) || (pbox_n->y2 != pbox_p->y2))))
2466 return ((box.x1 == reg->extents.x1) &&
2486 boxes[0].x1,
2488 boxes[0].x2 - boxes[0].x1,
2519 if (box->x1 >= box->x2 || box->y1 >= box->y2)
2551 region->extents.x1 = region->extents.x2 = 0;
2568 ((r-1)->x1 <= rx1) && ((r-1)->x2 >= rx2))))
2577 r->x1 = rx1;
2582 if (r->x1 < reg->extents.x1)
2583 reg->extents.x1 = r->x1;
2627 region->extents.x1 = width - 1;
2750 if ((old_rect->x1 != new_rect->x1) ||
2777 region->extents.x1 = region->extents.x2 = 0;
