2 * Copyright 1987, 1988, 1989, 1998 The Open Group
4 * Permission to use, copy, modify, distribute, and sell this software and its
5 * documentation for any purpose is hereby granted without fee, provided that
6 * the above copyright notice appear in all copies and that both that
7 * copyright notice and this permission notice appear in supporting
10 * The above copyright notice and this permission notice shall be included in
11 * all copies or substantial portions of the Software.
13 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
14 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
15 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
16 * OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
17 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
18 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
20 * Except as contained in this notice, the name of The Open Group shall not be
21 * used in advertising or otherwise to promote the sale, use or other dealings
22 * in this Software without prior written authorization from The Open Group.
24 * Copyright 1987, 1988, 1989 by
25 * Digital Equipment Corporation, Maynard, Massachusetts.
29 * Permission to use, copy, modify, and distribute this software and its
30 * documentation for any purpose and without fee is hereby granted,
31 * provided that the above copyright notice appear in all copies and that
32 * both that copyright notice and this permission notice appear in
33 * supporting documentation, and that the name of Digital not be
34 * used in advertising or publicity pertaining to distribution of the
35 * software without specific, written prior permission.
37 * DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
38 * ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
39 * DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
40 * ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
41 * WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
42 * ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
51 #include "pixman-private.h"
53 #define PIXREGION_NIL(reg) ((reg)->data && !(reg)->data->numRects)
55 #define PIXREGION_NAR(reg) ((reg)->data == pixman_broken_data)
56 #define PIXREGION_NUMRECTS(reg) ((reg)->data ? (reg)->data->numRects : 1)
57 #define PIXREGION_SIZE(reg) ((reg)->data ? (reg)->data->size : 0)
58 #define PIXREGION_RECTS(reg) \
59 ((reg)->data ? (box_type_t *)((reg)->data + 1) \
61 #define PIXREGION_BOXPTR(reg) ((box_type_t *)((reg)->data + 1))
62 #define PIXREGION_BOX(reg, i) (&PIXREGION_BOXPTR (reg)[i])
63 #define PIXREGION_TOP(reg) PIXREGION_BOX (reg, (reg)->data->numRects)
64 #define PIXREGION_END(reg) PIXREGION_BOX (reg, (reg)->data->numRects - 1)
66 #define GOOD_RECT(rect) ((rect)->x1 < (rect)->x2 && (rect)->y1 < (rect)->y2)
68 #define PIXMAN_REGION_LOG_FAILURES
70 #if defined PIXMAN_REGION_LOG_FAILURES || defined PIXMAN_REGION_DEBUG
73 log_region_error (const char *function, const char *message)
75 static int n_messages = 0;
82 "Set a breakpoint on 'log_region_error' to debug\n\n",
85 #if defined PIXMAN_REGION_DEBUG
96 if (!PREFIX (_selfcheck (reg))) \
97 log_region_error (FUNC, "Malformed region " # reg); \
102 #define log_region_error(function, name)
107 static const box_type_t PREFIX (_empty_box_) = { 0, 0, 0, 0 };
108 static const region_data_type_t PREFIX (_empty_data_) = { 0, 0 };
109 static const region_data_type_t PREFIX (_broken_data_) = { 0, 0 };
111 static box_type_t *pixman_region_empty_box =
112 (box_type_t *)&PREFIX (_empty_box_);
113 static region_data_type_t *pixman_region_empty_data =
114 (region_data_type_t *)&PREFIX (_empty_data_);
115 static region_data_type_t *pixman_broken_data =
116 (region_data_type_t *)&PREFIX (_broken_data_);
119 pixman_break (region_type_t *region);
122 * The functions in this file implement the Region abstraction used extensively
123 * throughout the X11 sample server. A Region is simply a set of disjoint
124 * (non-overlapping) rectangles, plus an "extent" rectangle which is the
125 * smallest single rectangle that contains all the non-overlapping rectangles.
127 * A Region is implemented as a "y-x-banded" array of rectangles. This array
128 * imposes two degrees of order. First, all rectangles are sorted by top side
129 * y coordinate first (y1), and then by left side x coordinate (x1).
131 * Furthermore, the rectangles are grouped into "bands". Each rectangle in a
132 * band has the same top y coordinate (y1), and each has the same bottom y
133 * coordinate (y2). Thus all rectangles in a band differ only in their left
134 * and right side (x1 and x2). Bands are implicit in the array of rectangles:
135 * there is no separate list of band start pointers.
137 * The y-x band representation does not minimize rectangles. In particular,
138 * if a rectangle vertically crosses a band (the rectangle has scanlines in
139 * the y1 to y2 area spanned by the band), then the rectangle may be broken
140 * down into two or more smaller rectangles stacked one atop the other.
142 * ----------- -----------
144 * | | -------- ----------- --------
145 * | | | | in y-x banded | | | | band 1
146 * | | | | form is | | | |
147 * ----------- | | ----------- --------
151 * An added constraint on the rectangles is that they must cover as much
152 * horizontal area as possible: no two rectangles within a band are allowed
155 * Whenever possible, bands will be merged together to cover a greater vertical
156 * distance (and thus reduce the number of rectangles). Two bands can be merged
157 * only if the bottom of one touches the top of the other and they have
158 * rectangles in the same places (of the same width, of course).
160 * Adam de Boor wrote most of the original region code. Joel McCormack
161 * substantially modified or rewrote most of the core arithmetic routines, and
162 * added pixman_region_validate in order to support several speed improvements
163 * to pixman_region_validate_tree. Bob Scheifler changed the representation
164 * to be more compact when empty or a single rectangle, and did a bunch of
165 * gratuitous reformatting. Carl Worth did further gratuitous reformatting
166 * while re-merging the server and client region code into libpixregion.
167 * Soren Sandmann did even more gratuitous reformatting.
170 /* true iff two Boxes overlap */
171 #define EXTENTCHECK(r1, r2) \
172 (!( ((r1)->x2 <= (r2)->x1) || \
173 ((r1)->x1 >= (r2)->x2) || \
174 ((r1)->y2 <= (r2)->y1) || \
175 ((r1)->y1 >= (r2)->y2) ) )
177 /* true iff (x,y) is in Box */
178 #define INBOX(r, x, y) \
184 /* true iff Box r1 contains Box r2 */
185 #define SUBSUMES(r1, r2) \
186 ( ((r1)->x1 <= (r2)->x1) && \
187 ((r1)->x2 >= (r2)->x2) && \
188 ((r1)->y1 <= (r2)->y1) && \
189 ((r1)->y2 >= (r2)->y2) )
192 PIXREGION_SZOF (size_t n)
194 size_t size = n * sizeof(box_type_t);
196 if (n > UINT32_MAX / sizeof(box_type_t))
199 if (sizeof(region_data_type_t) > UINT32_MAX - size)
202 return size + sizeof(region_data_type_t);
206 alloc_data (size_t n)
208 size_t sz = PIXREGION_SZOF (n);
216 #define FREE_DATA(reg) if ((reg)->data && (reg)->data->size) free ((reg)->data)
218 #define RECTALLOC_BAIL(region, n, bail) \
221 if (!(region)->data || \
222 (((region)->data->numRects + (n)) > (region)->data->size)) \
224 if (!pixman_rect_alloc (region, n)) \
229 #define RECTALLOC(region, n) \
232 if (!(region)->data || \
233 (((region)->data->numRects + (n)) > (region)->data->size)) \
235 if (!pixman_rect_alloc (region, n)) { \
241 #define ADDRECT(next_rect, nx1, ny1, nx2, ny2) \
244 next_rect->x1 = nx1; \
245 next_rect->y1 = ny1; \
246 next_rect->x2 = nx2; \
247 next_rect->y2 = ny2; \
252 #define NEWRECT(region, next_rect, nx1, ny1, nx2, ny2) \
255 if (!(region)->data || \
256 ((region)->data->numRects == (region)->data->size)) \
258 if (!pixman_rect_alloc (region, 1)) \
260 next_rect = PIXREGION_TOP (region); \
262 ADDRECT (next_rect, nx1, ny1, nx2, ny2); \
263 region->data->numRects++; \
264 assert (region->data->numRects <= region->data->size); \
267 #define DOWNSIZE(reg, numRects) \
270 if (((numRects) < ((reg)->data->size >> 1)) && \
271 ((reg)->data->size > 50)) \
273 region_data_type_t * new_data; \
274 size_t data_size = PIXREGION_SZOF (numRects); \
282 new_data = (region_data_type_t *) \
283 realloc ((reg)->data, data_size); \
288 new_data->size = (numRects); \
289 (reg)->data = new_data; \
294 PIXMAN_EXPORT pixman_bool_t
295 PREFIX (_equal) (region_type_t *reg1, region_type_t *reg2)
301 if (reg1->extents.x1 != reg2->extents.x1)
304 if (reg1->extents.x2 != reg2->extents.x2)
307 if (reg1->extents.y1 != reg2->extents.y1)
310 if (reg1->extents.y2 != reg2->extents.y2)
313 if (PIXREGION_NUMRECTS (reg1) != PIXREGION_NUMRECTS (reg2))
316 rects1 = PIXREGION_RECTS (reg1);
317 rects2 = PIXREGION_RECTS (reg2);
319 for (i = 0; i != PIXREGION_NUMRECTS (reg1); i++)
321 if (rects1[i].x1 != rects2[i].x1)
324 if (rects1[i].x2 != rects2[i].x2)
327 if (rects1[i].y1 != rects2[i].y1)
330 if (rects1[i].y2 != rects2[i].y2)
338 PREFIX (_print) (region_type_t *rgn)
344 num = PIXREGION_NUMRECTS (rgn);
345 size = PIXREGION_SIZE (rgn);
346 rects = PIXREGION_RECTS (rgn);
348 fprintf (stderr, "num: %d size: %d\n", num, size);
349 fprintf (stderr, "extents: %d %d %d %d\n",
355 for (i = 0; i < num; i++)
357 fprintf (stderr, "%d %d %d %d \n",
358 rects[i].x1, rects[i].y1, rects[i].x2, rects[i].y2);
361 fprintf (stderr, "\n");
368 PREFIX (_init) (region_type_t *region)
370 region->extents = *pixman_region_empty_box;
371 region->data = pixman_region_empty_data;
375 PREFIX (_init_rect) (region_type_t * region,
381 region->extents.x1 = x;
382 region->extents.y1 = y;
383 region->extents.x2 = x + width;
384 region->extents.y2 = y + height;
386 if (!GOOD_RECT (®ion->extents))
388 log_region_error (FUNC, "Invalid rectangle passed");
389 PREFIX (_init) (region);
397 PREFIX (_init_with_extents) (region_type_t *region, box_type_t *extents)
399 if (!GOOD_RECT (extents))
401 log_region_error (FUNC, "Invalid rectangle passed");
402 PREFIX (_init) (region);
405 region->extents = *extents;
411 PREFIX (_fini) (region_type_t *region)
418 PREFIX (_n_rects) (region_type_t *region)
420 return PIXREGION_NUMRECTS (region);
423 PIXMAN_EXPORT box_type_t *
424 PREFIX (_rectangles) (region_type_t *region,
428 *n_rects = PIXREGION_NUMRECTS (region);
430 return PIXREGION_RECTS (region);
434 pixman_break (region_type_t *region)
438 region->extents = *pixman_region_empty_box;
439 region->data = pixman_broken_data;
445 pixman_rect_alloc (region_type_t * region,
448 region_data_type_t *data;
453 region->data = alloc_data (n);
456 return pixman_break (region);
458 region->data->numRects = 1;
459 *PIXREGION_BOXPTR (region) = region->extents;
461 else if (!region->data->size)
463 region->data = alloc_data (n);
466 return pixman_break (region);
468 region->data->numRects = 0;
476 n = region->data->numRects;
477 if (n > 500) /* XXX pick numbers out of a hat */
481 n += region->data->numRects;
482 data_size = PIXREGION_SZOF (n);
490 data = (region_data_type_t *)
491 realloc (region->data, PIXREGION_SZOF (n));
495 return pixman_break (region);
500 region->data->size = n;
505 PIXMAN_EXPORT pixman_bool_t
506 PREFIX (_copy) (region_type_t *dst, region_type_t *src)
514 dst->extents = src->extents;
516 if (!src->data || !src->data->size)
519 dst->data = src->data;
523 if (!dst->data || (dst->data->size < src->data->numRects))
527 dst->data = alloc_data (src->data->numRects);
530 return pixman_break (dst);
532 dst->data->size = src->data->numRects;
535 dst->data->numRects = src->data->numRects;
537 memmove ((char *)PIXREGION_BOXPTR (dst), (char *)PIXREGION_BOXPTR (src),
538 dst->data->numRects * sizeof(box_type_t));
543 /*======================================================================
544 * Generic Region Operator
545 *====================================================================*/
548 *-----------------------------------------------------------------------
550 * Attempt to merge the boxes in the current band with those in the
551 * previous one. We are guaranteed that the current band extends to
552 * the end of the rects array. Used only by pixman_op.
555 * The new index for the previous band.
558 * If coalescing takes place:
559 * - rectangles in the previous band will have their y2 fields
561 * - region->data->numRects will be decreased.
563 *-----------------------------------------------------------------------
566 pixman_coalesce (region_type_t * region, /* Region to coalesce */
567 int prev_start, /* Index of start of previous band */
568 int cur_start) /* Index of start of current band */
570 box_type_t *prev_box; /* Current box in previous band */
571 box_type_t *cur_box; /* Current box in current band */
572 int numRects; /* Number rectangles in both bands */
573 int y2; /* Bottom of current band */
576 * Figure out how many rectangles are in the band.
578 numRects = cur_start - prev_start;
579 assert (numRects == region->data->numRects - cur_start);
581 if (!numRects) return cur_start;
584 * The bands may only be coalesced if the bottom of the previous
585 * matches the top scanline of the current.
587 prev_box = PIXREGION_BOX (region, prev_start);
588 cur_box = PIXREGION_BOX (region, cur_start);
589 if (prev_box->y2 != cur_box->y1) return cur_start;
592 * Make sure the bands have boxes in the same places. This
593 * assumes that boxes have been added in such a way that they
594 * cover the most area possible. I.e. two boxes in a band must
595 * have some horizontal space between them.
601 if ((prev_box->x1 != cur_box->x1) || (prev_box->x2 != cur_box->x2))
611 * The bands may be merged, so set the bottom y of each box
612 * in the previous band to the bottom y of the current band.
614 numRects = cur_start - prev_start;
615 region->data->numRects -= numRects;
628 /* Quicky macro to avoid trivial reject procedure calls to pixman_coalesce */
630 #define COALESCE(new_reg, prev_band, cur_band) \
633 if (cur_band - prev_band == new_reg->data->numRects - cur_band) \
634 prev_band = pixman_coalesce (new_reg, prev_band, cur_band); \
636 prev_band = cur_band; \
640 *-----------------------------------------------------------------------
641 * pixman_region_append_non_o --
642 * Handle a non-overlapping band for the union and subtract operations.
643 * Just adds the (top/bottom-clipped) rectangles into the region.
644 * Doesn't have to check for subsumption or anything.
650 * region->data->numRects is incremented and the rectangles overwritten
651 * with the rectangles we're passed.
653 *-----------------------------------------------------------------------
655 static inline pixman_bool_t
656 pixman_region_append_non_o (region_type_t * region,
662 box_type_t *next_rect;
665 new_rects = r_end - r;
668 assert (new_rects != 0);
670 /* Make sure we have enough space for all rectangles to be added */
671 RECTALLOC (region, new_rects);
672 next_rect = PIXREGION_TOP (region);
673 region->data->numRects += new_rects;
677 assert (r->x1 < r->x2);
678 ADDRECT (next_rect, r->x1, y1, r->x2, y2);
686 #define FIND_BAND(r, r_band_end, r_end, ry1) \
690 r_band_end = r + 1; \
691 while ((r_band_end != r_end) && (r_band_end->y1 == ry1)) { \
696 #define APPEND_REGIONS(new_reg, r, r_end) \
700 if ((new_rects = r_end - r)) { \
701 RECTALLOC_BAIL (new_reg, new_rects, bail); \
702 memmove ((char *)PIXREGION_TOP (new_reg), (char *)r, \
703 new_rects * sizeof(box_type_t)); \
704 new_reg->data->numRects += new_rects; \
709 *-----------------------------------------------------------------------
711 * Apply an operation to two regions. Called by pixman_region_union, pixman_region_inverse,
712 * pixman_region_subtract, pixman_region_intersect.... Both regions MUST have at least one
713 * rectangle, and cannot be the same object.
716 * TRUE if successful.
719 * The new region is overwritten.
720 * overlap set to TRUE if overlap_func ever returns TRUE.
723 * The idea behind this function is to view the two regions as sets.
724 * Together they cover a rectangle of area that this function divides
725 * into horizontal bands where points are covered only by one region
726 * or by both. For the first case, the non_overlap_func is called with
727 * each the band and the band's upper and lower extents. For the
728 * second, the overlap_func is called to process the entire band. It
729 * is responsible for clipping the rectangles in the band, though
730 * this function provides the boundaries.
731 * At the end of each band, the new region is coalesced, if possible,
732 * to reduce the number of rectangles in the region.
734 *-----------------------------------------------------------------------
737 typedef pixman_bool_t (*overlap_proc_ptr) (region_type_t *region,
747 pixman_op (region_type_t * new_reg, /* Place to store result */
748 region_type_t * reg1, /* First region in operation */
749 region_type_t * reg2, /* 2d region in operation */
750 overlap_proc_ptr overlap_func, /* Function to call for over-
752 int append_non1, /* Append non-overlapping bands
755 int append_non2, /* Append non-overlapping bands
760 box_type_t *r1; /* Pointer into first region */
761 box_type_t *r2; /* Pointer into 2d region */
762 box_type_t *r1_end; /* End of 1st region */
763 box_type_t *r2_end; /* End of 2d region */
764 int ybot; /* Bottom of intersection */
765 int ytop; /* Top of intersection */
766 region_data_type_t *old_data; /* Old data for new_reg */
767 int prev_band; /* Index of start of
768 * previous band in new_reg */
769 int cur_band; /* Index of start of current
771 box_type_t * r1_band_end; /* End of current band in r1 */
772 box_type_t * r2_band_end; /* End of current band in r2 */
773 int top; /* Top of non-overlapping band */
774 int bot; /* Bottom of non-overlapping band*/
775 int r1y1; /* Temps for r1->y1 and r2->y1 */
781 * Break any region computed from a broken region
783 if (PIXREGION_NAR (reg1) || PIXREGION_NAR (reg2))
784 return pixman_break (new_reg);
788 * set r1, r2, r1_end and r2_end appropriately, save the rectangles
789 * of the destination region until the end in case it's one of
790 * the two source regions, then mark the "new" region empty, allocating
791 * another array of rectangles for it to use.
794 r1 = PIXREGION_RECTS (reg1);
795 new_size = PIXREGION_NUMRECTS (reg1);
796 r1_end = r1 + new_size;
798 numRects = PIXREGION_NUMRECTS (reg2);
799 r2 = PIXREGION_RECTS (reg2);
800 r2_end = r2 + numRects;
802 assert (r1 != r1_end);
803 assert (r2 != r2_end);
805 old_data = (region_data_type_t *)NULL;
807 if (((new_reg == reg1) && (new_size > 1)) ||
808 ((new_reg == reg2) && (numRects > 1)))
810 old_data = new_reg->data;
811 new_reg->data = pixman_region_empty_data;
814 /* guess at new size */
815 if (numRects > new_size)
821 new_reg->data = pixman_region_empty_data;
822 else if (new_reg->data->size)
823 new_reg->data->numRects = 0;
825 if (new_size > new_reg->data->size)
827 if (!pixman_rect_alloc (new_reg, new_size))
837 * In the upcoming loop, ybot and ytop serve different functions depending
838 * on whether the band being handled is an overlapping or non-overlapping
840 * In the case of a non-overlapping band (only one of the regions
841 * has points in the band), ybot is the bottom of the most recent
842 * intersection and thus clips the top of the rectangles in that band.
843 * ytop is the top of the next intersection between the two regions and
844 * serves to clip the bottom of the rectangles in the current band.
845 * For an overlapping band (where the two regions intersect), ytop clips
846 * the top of the rectangles of both regions and ybot clips the bottoms.
849 ybot = MIN (r1->y1, r2->y1);
852 * prev_band serves to mark the start of the previous band so rectangles
853 * can be coalesced into larger rectangles. qv. pixman_coalesce, above.
854 * In the beginning, there is no previous band, so prev_band == cur_band
855 * (cur_band is set later on, of course, but the first band will always
856 * start at index 0). prev_band and cur_band must be indices because of
857 * the possible expansion, and resultant moving, of the new region's
858 * array of rectangles.
865 * This algorithm proceeds one source-band (as opposed to a
866 * destination band, which is determined by where the two regions
867 * intersect) at a time. r1_band_end and r2_band_end serve to mark the
868 * rectangle after the last one in the current band for their
869 * respective regions.
871 assert (r1 != r1_end);
872 assert (r2 != r2_end);
874 FIND_BAND (r1, r1_band_end, r1_end, r1y1);
875 FIND_BAND (r2, r2_band_end, r2_end, r2y1);
878 * First handle the band that doesn't intersect, if any.
880 * Note that attention is restricted to one band in the
881 * non-intersecting region at once, so if a region has n
882 * bands between the current position and the next place it overlaps
883 * the other, this entire loop will be passed through n times.
889 top = MAX (r1y1, ybot);
890 bot = MIN (r1->y2, r2y1);
893 cur_band = new_reg->data->numRects;
894 if (!pixman_region_append_non_o (new_reg, r1, r1_band_end, top, bot))
896 COALESCE (new_reg, prev_band, cur_band);
901 else if (r2y1 < r1y1)
905 top = MAX (r2y1, ybot);
906 bot = MIN (r2->y2, r1y1);
910 cur_band = new_reg->data->numRects;
912 if (!pixman_region_append_non_o (new_reg, r2, r2_band_end, top, bot))
915 COALESCE (new_reg, prev_band, cur_band);
926 * Now see if we've hit an intersecting band. The two bands only
927 * intersect if ybot > ytop
929 ybot = MIN (r1->y2, r2->y2);
932 cur_band = new_reg->data->numRects;
934 if (!(*overlap_func)(new_reg,
943 COALESCE (new_reg, prev_band, cur_band);
947 * If we've finished with a band (y2 == ybot) we skip forward
948 * in the region to the next band.
957 while (r1 != r1_end && r2 != r2_end);
960 * Deal with whichever region (if any) still has rectangles left.
962 * We only need to worry about banding and coalescing for the very first
963 * band left. After that, we can just group all remaining boxes,
964 * regardless of how many bands, into one final append to the list.
967 if ((r1 != r1_end) && append_non1)
969 /* Do first non_overlap1Func call, which may be able to coalesce */
970 FIND_BAND (r1, r1_band_end, r1_end, r1y1);
972 cur_band = new_reg->data->numRects;
974 if (!pixman_region_append_non_o (new_reg,
976 MAX (r1y1, ybot), r1->y2))
981 COALESCE (new_reg, prev_band, cur_band);
983 /* Just append the rest of the boxes */
984 APPEND_REGIONS (new_reg, r1_band_end, r1_end);
986 else if ((r2 != r2_end) && append_non2)
988 /* Do first non_overlap2Func call, which may be able to coalesce */
989 FIND_BAND (r2, r2_band_end, r2_end, r2y1);
991 cur_band = new_reg->data->numRects;
993 if (!pixman_region_append_non_o (new_reg,
995 MAX (r2y1, ybot), r2->y2))
1000 COALESCE (new_reg, prev_band, cur_band);
1002 /* Append rest of boxes */
1003 APPEND_REGIONS (new_reg, r2_band_end, r2_end);
1009 if (!(numRects = new_reg->data->numRects))
1011 FREE_DATA (new_reg);
1012 new_reg->data = pixman_region_empty_data;
1014 else if (numRects == 1)
1016 new_reg->extents = *PIXREGION_BOXPTR (new_reg);
1017 FREE_DATA (new_reg);
1018 new_reg->data = (region_data_type_t *)NULL;
1022 DOWNSIZE (new_reg, numRects);
1031 return pixman_break (new_reg);
1035 *-----------------------------------------------------------------------
1036 * pixman_set_extents --
1037 * Reset the extents of a region to what they should be. Called by
1038 * pixman_region_subtract and pixman_region_intersect as they can't
1039 * figure it out along the way or do so easily, as pixman_region_union can.
1045 * The region's 'extents' structure is overwritten.
1047 *-----------------------------------------------------------------------
1050 pixman_set_extents (region_type_t *region)
1052 box_type_t *box, *box_end;
1057 if (!region->data->size)
1059 region->extents.x2 = region->extents.x1;
1060 region->extents.y2 = region->extents.y1;
1064 box = PIXREGION_BOXPTR (region);
1065 box_end = PIXREGION_END (region);
1068 * Since box is the first rectangle in the region, it must have the
1069 * smallest y1 and since box_end is the last rectangle in the region,
1070 * it must have the largest y2, because of banding. Initialize x1 and
1071 * x2 from box and box_end, resp., as good things to initialize them
1074 region->extents.x1 = box->x1;
1075 region->extents.y1 = box->y1;
1076 region->extents.x2 = box_end->x2;
1077 region->extents.y2 = box_end->y2;
1079 assert (region->extents.y1 < region->extents.y2);
1081 while (box <= box_end)
1083 if (box->x1 < region->extents.x1)
1084 region->extents.x1 = box->x1;
1085 if (box->x2 > region->extents.x2)
1086 region->extents.x2 = box->x2;
1090 assert (region->extents.x1 < region->extents.x2);
1093 /*======================================================================
1094 * Region Intersection
1095 *====================================================================*/
1097 *-----------------------------------------------------------------------
1098 * pixman_region_intersect_o --
1099 * Handle an overlapping band for pixman_region_intersect.
1102 * TRUE if successful.
1105 * Rectangles may be added to the region.
1107 *-----------------------------------------------------------------------
1110 static pixman_bool_t
1111 pixman_region_intersect_o (region_type_t *region,
1113 box_type_t * r1_end,
1115 box_type_t * r2_end,
1122 box_type_t * next_rect;
1124 next_rect = PIXREGION_TOP (region);
1127 assert (r1 != r1_end && r2 != r2_end);
1131 x1 = MAX (r1->x1, r2->x1);
1132 x2 = MIN (r1->x2, r2->x2);
1135 * If there's any overlap between the two rectangles, add that
1136 * overlap to the new region.
1139 NEWRECT (region, next_rect, x1, y1, x2, y2);
1142 * Advance the pointer(s) with the leftmost right side, since the next
1143 * rectangle on that list may still overlap the other region's
1144 * current rectangle.
1155 while ((r1 != r1_end) && (r2 != r2_end));
1160 PIXMAN_EXPORT pixman_bool_t
1161 PREFIX (_intersect) (region_type_t * new_reg,
1162 region_type_t * reg1,
1163 region_type_t * reg2)
1169 /* check for trivial reject */
1170 if (PIXREGION_NIL (reg1) || PIXREGION_NIL (reg2) ||
1171 !EXTENTCHECK (®1->extents, ®2->extents))
1173 /* Covers about 20% of all cases */
1174 FREE_DATA (new_reg);
1175 new_reg->extents.x2 = new_reg->extents.x1;
1176 new_reg->extents.y2 = new_reg->extents.y1;
1177 if (PIXREGION_NAR (reg1) || PIXREGION_NAR (reg2))
1179 new_reg->data = pixman_broken_data;
1184 new_reg->data = pixman_region_empty_data;
1187 else if (!reg1->data && !reg2->data)
1189 /* Covers about 80% of cases that aren't trivially rejected */
1190 new_reg->extents.x1 = MAX (reg1->extents.x1, reg2->extents.x1);
1191 new_reg->extents.y1 = MAX (reg1->extents.y1, reg2->extents.y1);
1192 new_reg->extents.x2 = MIN (reg1->extents.x2, reg2->extents.x2);
1193 new_reg->extents.y2 = MIN (reg1->extents.y2, reg2->extents.y2);
1195 FREE_DATA (new_reg);
1197 new_reg->data = (region_data_type_t *)NULL;
1199 else if (!reg2->data && SUBSUMES (®2->extents, ®1->extents))
1201 return PREFIX (_copy) (new_reg, reg1);
1203 else if (!reg1->data && SUBSUMES (®1->extents, ®2->extents))
1205 return PREFIX (_copy) (new_reg, reg2);
1207 else if (reg1 == reg2)
1209 return PREFIX (_copy) (new_reg, reg1);
1213 /* General purpose intersection */
1214 int overlap; /* result ignored */
1216 if (!pixman_op (new_reg, reg1, reg2, pixman_region_intersect_o, FALSE, FALSE,
1222 pixman_set_extents (new_reg);
1229 #define MERGERECT(r) \
1234 /* Merge with current rectangle */ \
1243 /* Add current rectangle, start new one */ \
1244 NEWRECT (region, next_rect, x1, y1, x2, y2); \
1251 /*======================================================================
1253 *====================================================================*/
1256 *-----------------------------------------------------------------------
1257 * pixman_region_union_o --
1258 * Handle an overlapping band for the union operation. Picks the
1259 * left-most rectangle each time and merges it into the region.
1262 * TRUE if successful.
1265 * region is overwritten.
1266 * overlap is set to TRUE if any boxes overlap.
1268 *-----------------------------------------------------------------------
1270 static pixman_bool_t
1271 pixman_region_union_o (region_type_t *region,
1273 box_type_t * r1_end,
1275 box_type_t * r2_end,
1280 box_type_t *next_rect;
1281 int x1; /* left and right side of current union */
1285 assert (r1 != r1_end && r2 != r2_end);
1287 next_rect = PIXREGION_TOP (region);
1289 /* Start off current rectangle */
1290 if (r1->x1 < r2->x1)
1302 while (r1 != r1_end && r2 != r2_end)
1304 if (r1->x1 < r2->x1)
1310 /* Finish off whoever (if any) is left */
1317 while (r1 != r1_end);
1319 else if (r2 != r2_end)
1325 while (r2 != r2_end);
1328 /* Add current rectangle */
1329 NEWRECT (region, next_rect, x1, y1, x2, y2);
1334 /* Convenience function for performing union of region with a
1337 PIXMAN_EXPORT pixman_bool_t
1338 PREFIX (_union_rect) (region_type_t *dest,
1339 region_type_t *source,
1343 unsigned int height)
1345 region_type_t region;
1347 region.extents.x1 = x;
1348 region.extents.y1 = y;
1349 region.extents.x2 = x + width;
1350 region.extents.y2 = y + height;
1352 if (!GOOD_RECT (®ion.extents))
1354 log_region_error (FUNC, "Invalid rectangle passed");
1355 return PREFIX (_copy) (dest, source);
1360 return PREFIX (_union) (dest, source, ®ion);
1363 PIXMAN_EXPORT pixman_bool_t
1364 PREFIX (_union) (region_type_t *new_reg,
1365 region_type_t *reg1,
1366 region_type_t *reg2)
1368 int overlap; /* result ignored */
1370 /* Return TRUE if some overlap
1371 * between reg1, reg2
1377 /* checks all the simple cases */
1380 * Region 1 and 2 are the same
1383 return PREFIX (_copy) (new_reg, reg1);
1388 if (PIXREGION_NIL (reg1))
1390 if (PIXREGION_NAR (reg1))
1391 return pixman_break (new_reg);
1393 if (new_reg != reg2)
1394 return PREFIX (_copy) (new_reg, reg2);
1402 if (PIXREGION_NIL (reg2))
1404 if (PIXREGION_NAR (reg2))
1405 return pixman_break (new_reg);
1407 if (new_reg != reg1)
1408 return PREFIX (_copy) (new_reg, reg1);
1414 * Region 1 completely subsumes region 2
1416 if (!reg1->data && SUBSUMES (®1->extents, ®2->extents))
1418 if (new_reg != reg1)
1419 return PREFIX (_copy) (new_reg, reg1);
1425 * Region 2 completely subsumes region 1
1427 if (!reg2->data && SUBSUMES (®2->extents, ®1->extents))
1429 if (new_reg != reg2)
1430 return PREFIX (_copy) (new_reg, reg2);
1435 if (!pixman_op (new_reg, reg1, reg2, pixman_region_union_o, TRUE, TRUE, &overlap))
1438 new_reg->extents.x1 = MIN (reg1->extents.x1, reg2->extents.x1);
1439 new_reg->extents.y1 = MIN (reg1->extents.y1, reg2->extents.y1);
1440 new_reg->extents.x2 = MAX (reg1->extents.x2, reg2->extents.x2);
1441 new_reg->extents.y2 = MAX (reg1->extents.y2, reg2->extents.y2);
1448 /*======================================================================
1449 * Batch Rectangle Union
1450 *====================================================================*/
1452 #define EXCHANGE_RECTS(a, b) \
1456 rects[a] = rects[b]; \
1470 /* Always called with numRects > 1 */
1476 if (rects[0].y1 > rects[1].y1 ||
1477 (rects[0].y1 == rects[1].y1 && rects[0].x1 > rects[1].x1))
1479 EXCHANGE_RECTS (0, 1);
1485 /* Choose partition element, stick in location 0 */
1486 EXCHANGE_RECTS (0, numRects >> 1);
1490 /* Partition array */
1503 while (i != numRects && (r->y1 < y1 || (r->y1 == y1 && r->x1 < x1)))
1512 while (y1 < r->y1 || (y1 == r->y1 && x1 < r->x1));
1515 EXCHANGE_RECTS (i, j);
1519 /* Move partition element back to middle */
1520 EXCHANGE_RECTS (0, j);
1523 if (numRects - j - 1 > 1)
1524 quick_sort_rects (&rects[j + 1], numRects - j - 1);
1528 while (numRects > 1);
1532 *-----------------------------------------------------------------------
1533 * pixman_region_validate --
1535 * Take a ``region'' which is a non-y-x-banded random collection of
1536 * rectangles, and compute a nice region which is the union of all the
1540 * TRUE if successful.
1543 * The passed-in ``region'' may be modified.
1544 * overlap set to TRUE if any retangles overlapped,
1548 * Step 1. Sort the rectangles into ascending order with primary key y1
1549 * and secondary key x1.
1551 * Step 2. Split the rectangles into the minimum number of proper y-x
1552 * banded regions. This may require horizontally merging
1553 * rectangles, and vertically coalescing bands. With any luck,
1554 * this step in an identity transformation (ala the Box widget),
1555 * or a coalescing into 1 box (ala Menus).
1557 * Step 3. Merge the separate regions down to a single region by calling
1558 * pixman_region_union. Maximize the work each pixman_region_union call does by using
1561 *-----------------------------------------------------------------------
1564 static pixman_bool_t
1565 validate (region_type_t * badreg,
1568 /* Descriptor for regions under construction in Step 2. */
1576 region_info_t stack_regions[64];
1578 int numRects; /* Original numRects for badreg */
1579 region_info_t *ri; /* Array of current regions */
1580 int num_ri; /* Number of entries used in ri */
1581 int size_ri; /* Number of entries available in ri */
1582 int i; /* Index into rects */
1583 int j; /* Index into ri */
1584 region_info_t *rit; /* &ri[j] */
1585 region_type_t *reg; /* ri[j].reg */
1586 box_type_t *box; /* Current box in rects */
1587 box_type_t *ri_box; /* Last box in ri[j].reg */
1588 region_type_t *hreg; /* ri[j_half].reg */
1589 pixman_bool_t ret = TRUE;
1598 numRects = badreg->data->numRects;
1601 if (PIXREGION_NAR (badreg))
1607 if (badreg->extents.x1 < badreg->extents.x2)
1609 if ((numRects) == 1)
1612 badreg->data = (region_data_type_t *) NULL;
1616 DOWNSIZE (badreg, numRects);
1624 /* Step 1: Sort the rects array into ascending (y1, x1) order */
1625 quick_sort_rects (PIXREGION_BOXPTR (badreg), numRects);
1627 /* Step 2: Scatter the sorted array into the minimum number of regions */
1629 /* Set up the first region to be the first rectangle in badreg */
1630 /* Note that step 2 code will never overflow the ri[0].reg rects array */
1632 size_ri = sizeof (stack_regions) / sizeof (stack_regions[0]);
1634 ri[0].prev_band = 0;
1636 ri[0].reg = *badreg;
1637 box = PIXREGION_BOXPTR (&ri[0].reg);
1638 ri[0].reg.extents = *box;
1639 ri[0].reg.data->numRects = 1;
1640 badreg->extents = *pixman_region_empty_box;
1641 badreg->data = pixman_region_empty_data;
1643 /* Now scatter rectangles into the minimum set of valid regions. If the
1644 * next rectangle to be added to a region would force an existing rectangle
1645 * in the region to be split up in order to maintain y-x banding, just
1646 * forget it. Try the next region. If it doesn't fit cleanly into any
1647 * region, make a new one.
1650 for (i = numRects; --i > 0;)
1653 /* Look for a region to append box to */
1654 for (j = num_ri, rit = ri; --j >= 0; rit++)
1657 ri_box = PIXREGION_END (reg);
1659 if (box->y1 == ri_box->y1 && box->y2 == ri_box->y2)
1661 /* box is in same band as ri_box. Merge or append it */
1662 if (box->x1 <= ri_box->x2)
1664 /* Merge it with ri_box */
1665 if (box->x1 < ri_box->x2)
1668 if (box->x2 > ri_box->x2)
1669 ri_box->x2 = box->x2;
1673 RECTALLOC_BAIL (reg, 1, bail);
1674 *PIXREGION_TOP (reg) = *box;
1675 reg->data->numRects++;
1678 goto next_rect; /* So sue me */
1680 else if (box->y1 >= ri_box->y2)
1682 /* Put box into new band */
1683 if (reg->extents.x2 < ri_box->x2)
1684 reg->extents.x2 = ri_box->x2;
1686 if (reg->extents.x1 > box->x1)
1687 reg->extents.x1 = box->x1;
1689 COALESCE (reg, rit->prev_band, rit->cur_band);
1690 rit->cur_band = reg->data->numRects;
1691 RECTALLOC_BAIL (reg, 1, bail);
1692 *PIXREGION_TOP (reg) = *box;
1693 reg->data->numRects++;
1697 /* Well, this region was inappropriate. Try the next one. */
1700 /* Uh-oh. No regions were appropriate. Create a new one. */
1701 if (size_ri == num_ri)
1705 /* Oops, allocate space for new region information */
1708 data_size = size_ri * sizeof(region_info_t);
1709 if (data_size / size_ri != sizeof(region_info_t))
1712 if (ri == stack_regions)
1714 rit = malloc (data_size);
1717 memcpy (rit, ri, num_ri * sizeof (region_info_t));
1721 rit = (region_info_t *) realloc (ri, data_size);
1731 rit->reg.extents = *box;
1732 rit->reg.data = (region_data_type_t *)NULL;
1734 /* MUST force allocation */
1735 if (!pixman_rect_alloc (&rit->reg, (i + num_ri) / num_ri))
1741 /* Make a final pass over each region in order to COALESCE and set
1742 * extents.x2 and extents.y2
1744 for (j = num_ri, rit = ri; --j >= 0; rit++)
1747 ri_box = PIXREGION_END (reg);
1748 reg->extents.y2 = ri_box->y2;
1750 if (reg->extents.x2 < ri_box->x2)
1751 reg->extents.x2 = ri_box->x2;
1753 COALESCE (reg, rit->prev_band, rit->cur_band);
1755 if (reg->data->numRects == 1) /* keep unions happy below */
1758 reg->data = (region_data_type_t *)NULL;
1762 /* Step 3: Union all regions into a single region */
1765 int half = num_ri / 2;
1766 for (j = num_ri & 1; j < (half + (num_ri & 1)); j++)
1769 hreg = &ri[j + half].reg;
1771 if (!pixman_op (reg, reg, hreg, pixman_region_union_o, TRUE, TRUE, overlap))
1774 if (hreg->extents.x1 < reg->extents.x1)
1775 reg->extents.x1 = hreg->extents.x1;
1777 if (hreg->extents.y1 < reg->extents.y1)
1778 reg->extents.y1 = hreg->extents.y1;
1780 if (hreg->extents.x2 > reg->extents.x2)
1781 reg->extents.x2 = hreg->extents.x2;
1783 if (hreg->extents.y2 > reg->extents.y2)
1784 reg->extents.y2 = hreg->extents.y2;
1795 *badreg = ri[0].reg;
1797 if (ri != stack_regions)
1804 for (i = 0; i < num_ri; i++)
1805 FREE_DATA (&ri[i].reg);
1807 if (ri != stack_regions)
1810 return pixman_break (badreg);
1813 /*======================================================================
1814 * Region Subtraction
1815 *====================================================================*/
1818 *-----------------------------------------------------------------------
1819 * pixman_region_subtract_o --
1820 * Overlapping band subtraction. x1 is the left-most point not yet
1824 * TRUE if successful.
1827 * region may have rectangles added to it.
1829 *-----------------------------------------------------------------------
1832 static pixman_bool_t
1833 pixman_region_subtract_o (region_type_t * region,
1835 box_type_t * r1_end,
1837 box_type_t * r2_end,
1842 box_type_t * next_rect;
1848 assert (r1 != r1_end && r2 != r2_end);
1850 next_rect = PIXREGION_TOP (region);
1857 * Subtrahend entirely to left of minuend: go to next subtrahend.
1861 else if (r2->x1 <= x1)
1864 * Subtrahend preceeds minuend: nuke left edge of minuend.
1870 * Minuend completely covered: advance to next minuend and
1871 * reset left fence to edge of new minuend.
1880 * Subtrahend now used up since it doesn't extend beyond
1886 else if (r2->x1 < r1->x2)
1889 * Left part of subtrahend covers part of minuend: add uncovered
1890 * part of minuend to region and skip to next subtrahend.
1892 assert (x1 < r2->x1);
1893 NEWRECT (region, next_rect, x1, y1, r2->x1, y2);
1899 * Minuend used up: advance to new...
1908 * Subtrahend used up
1916 * Minuend used up: add any remaining piece before advancing.
1919 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1927 while ((r1 != r1_end) && (r2 != r2_end));
1930 * Add remaining minuend rectangles to region.
1932 while (r1 != r1_end)
1934 assert (x1 < r1->x2);
1936 NEWRECT (region, next_rect, x1, y1, r1->x2, y2);
1946 *-----------------------------------------------------------------------
1947 * pixman_region_subtract --
1948 * Subtract reg_s from reg_m and leave the result in reg_d.
1949 * S stands for subtrahend, M for minuend and D for difference.
1952 * TRUE if successful.
1955 * reg_d is overwritten.
1957 *-----------------------------------------------------------------------
1959 PIXMAN_EXPORT pixman_bool_t
1960 PREFIX (_subtract) (region_type_t *reg_d,
1961 region_type_t *reg_m,
1962 region_type_t *reg_s)
1964 int overlap; /* result ignored */
1970 /* check for trivial rejects */
1971 if (PIXREGION_NIL (reg_m) || PIXREGION_NIL (reg_s) ||
1972 !EXTENTCHECK (®_m->extents, ®_s->extents))
1974 if (PIXREGION_NAR (reg_s))
1975 return pixman_break (reg_d);
1977 return PREFIX (_copy) (reg_d, reg_m);
1979 else if (reg_m == reg_s)
1982 reg_d->extents.x2 = reg_d->extents.x1;
1983 reg_d->extents.y2 = reg_d->extents.y1;
1984 reg_d->data = pixman_region_empty_data;
1989 /* Add those rectangles in region 1 that aren't in region 2,
1990 do yucky substraction for overlaps, and
1991 just throw away rectangles in region 2 that aren't in region 1 */
1992 if (!pixman_op (reg_d, reg_m, reg_s, pixman_region_subtract_o, TRUE, FALSE, &overlap))
1996 * Can't alter reg_d's extents before we call pixman_op because
1997 * it might be one of the source regions and pixman_op depends
1998 * on the extents of those regions being unaltered. Besides, this
1999 * way there's no checking against rectangles that will be nuked
2000 * due to coalescing, so we have to examine fewer rectangles.
2002 pixman_set_extents (reg_d);
2007 /*======================================================================
2009 *====================================================================*/
2012 *-----------------------------------------------------------------------
2013 * pixman_region_inverse --
2014 * Take a region and a box and return a region that is everything
2015 * in the box but not in the region. The careful reader will note
2016 * that this is the same as subtracting the region from the box...
2022 * new_reg is overwritten.
2024 *-----------------------------------------------------------------------
2027 PIXMAN_EXPORT PREFIX (_inverse) (region_type_t *new_reg, /* Destination region */
2028 region_type_t *reg1, /* Region to invert */
2029 box_type_t * inv_rect) /* Bounding box for inversion */
2031 region_type_t inv_reg; /* Quick and dirty region made from the
2033 int overlap; /* result ignored */
2038 /* check for trivial rejects */
2039 if (PIXREGION_NIL (reg1) || !EXTENTCHECK (inv_rect, ®1->extents))
2041 if (PIXREGION_NAR (reg1))
2042 return pixman_break (new_reg);
2044 new_reg->extents = *inv_rect;
2045 FREE_DATA (new_reg);
2046 new_reg->data = (region_data_type_t *)NULL;
2051 /* Add those rectangles in region 1 that aren't in region 2,
2052 * do yucky substraction for overlaps, and
2053 * just throw away rectangles in region 2 that aren't in region 1
2055 inv_reg.extents = *inv_rect;
2056 inv_reg.data = (region_data_type_t *)NULL;
2057 if (!pixman_op (new_reg, &inv_reg, reg1, pixman_region_subtract_o, TRUE, FALSE, &overlap))
2061 * Can't alter new_reg's extents before we call pixman_op because
2062 * it might be one of the source regions and pixman_op depends
2063 * on the extents of those regions being unaltered. Besides, this
2064 * way there's no checking against rectangles that will be nuked
2065 * due to coalescing, so we have to examine fewer rectangles.
2067 pixman_set_extents (new_reg);
2073 * rect_in(region, rect)
2074 * This routine takes a pointer to a region and a pointer to a box
2075 * and determines if the box is outside/inside/partly inside the region.
2077 * The idea is to travel through the list of rectangles trying to cover the
2078 * passed box with them. Anytime a piece of the rectangle isn't covered
2079 * by a band of rectangles, part_out is set TRUE. Any time a rectangle in
2080 * the region covers part of the box, part_in is set TRUE. The process ends
2081 * when either the box has been completely covered (we reached a band that
2082 * doesn't overlap the box, part_in is TRUE and part_out is false), the
2083 * box has been partially covered (part_in == part_out == TRUE -- because of
2084 * the banding, the first time this is true we know the box is only
2085 * partially in the region) or is outside the region (we reached a band
2086 * that doesn't overlap the box at all and part_in is false)
2089 pixman_region_overlap_t
2090 PIXMAN_EXPORT PREFIX (_contains_rectangle) (region_type_t * region,
2094 box_type_t * pbox_end;
2095 int part_in, part_out;
2101 numRects = PIXREGION_NUMRECTS (region);
2103 /* useful optimization */
2104 if (!numRects || !EXTENTCHECK (®ion->extents, prect))
2105 return(PIXMAN_REGION_OUT);
2109 /* We know that it must be PIXMAN_REGION_IN or PIXMAN_REGION_PART */
2110 if (SUBSUMES (®ion->extents, prect))
2111 return(PIXMAN_REGION_IN);
2113 return(PIXMAN_REGION_PART);
2119 /* (x,y) starts at upper left of rect, moving to the right and down */
2123 /* can stop when both part_out and part_in are TRUE, or we reach prect->y2 */
2124 for (pbox = PIXREGION_BOXPTR (region), pbox_end = pbox + numRects;
2130 continue; /* getting up to speed or skipping remainder of band */
2134 part_out = TRUE; /* missed part of rectangle above */
2135 if (part_in || (pbox->y1 >= prect->y2))
2137 y = pbox->y1; /* x guaranteed to be == prect->x1 */
2141 continue; /* not far enough over yet */
2145 part_out = TRUE; /* missed part of rectangle to left */
2150 if (pbox->x1 < prect->x2)
2152 part_in = TRUE; /* definitely overlap */
2157 if (pbox->x2 >= prect->x2)
2159 y = pbox->y2; /* finished with this band */
2162 x = prect->x1; /* reset x out to left again */
2167 * Because boxes in a band are maximal width, if the first box
2168 * to overlap the rectangle doesn't completely cover it in that
2169 * band, the rectangle must be partially out, since some of it
2170 * will be uncovered in that band. part_in will have been set true
2181 return PIXMAN_REGION_PART;
2183 return PIXMAN_REGION_IN;
2187 return PIXMAN_REGION_OUT;
2191 /* PREFIX(_translate) (region, x, y)
2192 * translates in place
2196 PREFIX (_translate) (region_type_t *region, int x, int y)
2203 region->extents.x1 = x1 = region->extents.x1 + x;
2204 region->extents.y1 = y1 = region->extents.y1 + y;
2205 region->extents.x2 = x2 = region->extents.x2 + x;
2206 region->extents.y2 = y2 = region->extents.y2 + y;
2208 if (((x1 - SHRT_MIN) | (y1 - SHRT_MIN) | (SHRT_MAX - x2) | (SHRT_MAX - y2)) >= 0)
2210 if (region->data && (nbox = region->data->numRects))
2212 for (pbox = PIXREGION_BOXPTR (region); nbox--; pbox++)
2223 if (((x2 - SHRT_MIN) | (y2 - SHRT_MIN) | (SHRT_MAX - x1) | (SHRT_MAX - y1)) <= 0)
2225 region->extents.x2 = region->extents.x1;
2226 region->extents.y2 = region->extents.y1;
2228 region->data = pixman_region_empty_data;
2233 region->extents.x1 = SHRT_MIN;
2234 else if (x2 > SHRT_MAX)
2235 region->extents.x2 = SHRT_MAX;
2238 region->extents.y1 = SHRT_MIN;
2239 else if (y2 > SHRT_MAX)
2240 region->extents.y2 = SHRT_MAX;
2242 if (region->data && (nbox = region->data->numRects))
2244 box_type_t * pbox_out;
2246 for (pbox_out = pbox = PIXREGION_BOXPTR (region); nbox--; pbox++)
2248 pbox_out->x1 = x1 = pbox->x1 + x;
2249 pbox_out->y1 = y1 = pbox->y1 + y;
2250 pbox_out->x2 = x2 = pbox->x2 + x;
2251 pbox_out->y2 = y2 = pbox->y2 + y;
2253 if (((x2 - SHRT_MIN) | (y2 - SHRT_MIN) |
2254 (SHRT_MAX - x1) | (SHRT_MAX - y1)) <= 0)
2256 region->data->numRects--;
2261 pbox_out->x1 = SHRT_MIN;
2262 else if (x2 > SHRT_MAX)
2263 pbox_out->x2 = SHRT_MAX;
2266 pbox_out->y1 = SHRT_MIN;
2267 else if (y2 > SHRT_MAX)
2268 pbox_out->y2 = SHRT_MAX;
2273 if (pbox_out != pbox)
2275 if (region->data->numRects == 1)
2277 region->extents = *PIXREGION_BOXPTR (region);
2279 region->data = (region_data_type_t *)NULL;
2283 pixman_set_extents (region);
2292 PREFIX (_reset) (region_type_t *region, box_type_t *box)
2296 assert (GOOD_RECT (box));
2298 region->extents = *box;
2302 region->data = NULL;
2305 /* box is "return" value */
2307 PREFIX (_contains_point) (region_type_t * region,
2311 box_type_t *pbox, *pbox_end;
2315 numRects = PIXREGION_NUMRECTS (region);
2317 if (!numRects || !INBOX (®ion->extents, x, y))
2323 *box = region->extents;
2328 for (pbox = PIXREGION_BOXPTR (region), pbox_end = pbox + numRects;
2333 continue; /* not there yet */
2335 if ((y < pbox->y1) || (x < pbox->x1))
2336 break; /* missed it */
2339 continue; /* not there yet */
2351 PREFIX (_not_empty) (region_type_t * region)
2355 return(!PIXREGION_NIL (region));
2358 PIXMAN_EXPORT box_type_t *
2359 PREFIX (_extents) (region_type_t * region)
2363 return(®ion->extents);
2367 * Clip a list of scanlines to a region. The caller has allocated the
2368 * space. FSorted is non-zero if the scanline origins are in ascending order.
2370 * returns the number of new, clipped scanlines.
2373 PIXMAN_EXPORT pixman_bool_t
2374 PREFIX (_selfcheck) (region_type_t *reg)
2378 if ((reg->extents.x1 > reg->extents.x2) ||
2379 (reg->extents.y1 > reg->extents.y2))
2384 numRects = PIXREGION_NUMRECTS (reg);
2387 return ((reg->extents.x1 == reg->extents.x2) &&
2388 (reg->extents.y1 == reg->extents.y2) &&
2389 (reg->data->size || (reg->data == pixman_region_empty_data)));
2391 else if (numRects == 1)
2393 return (!reg->data);
2397 box_type_t * pbox_p, * pbox_n;
2400 pbox_p = PIXREGION_RECTS (reg);
2402 box.y2 = pbox_p[numRects - 1].y2;
2403 pbox_n = pbox_p + 1;
2405 for (i = numRects; --i > 0; pbox_p++, pbox_n++)
2407 if ((pbox_n->x1 >= pbox_n->x2) ||
2408 (pbox_n->y1 >= pbox_n->y2))
2413 if (pbox_n->x1 < box.x1)
2414 box.x1 = pbox_n->x1;
2416 if (pbox_n->x2 > box.x2)
2417 box.x2 = pbox_n->x2;
2419 if ((pbox_n->y1 < pbox_p->y1) ||
2420 ((pbox_n->y1 == pbox_p->y1) &&
2421 ((pbox_n->x1 < pbox_p->x2) || (pbox_n->y2 != pbox_p->y2))))
2427 return ((box.x1 == reg->extents.x1) &&
2428 (box.x2 == reg->extents.x2) &&
2429 (box.y1 == reg->extents.y1) &&
2430 (box.y2 == reg->extents.y2));
2434 PIXMAN_EXPORT pixman_bool_t
2435 PREFIX (_init_rects) (region_type_t *region,
2436 box_type_t *boxes, int count)
2442 /* if it's 1, then we just want to set the extents, so call
2443 * the existing method. */
2446 PREFIX (_init_rect) (region,
2449 boxes[0].x2 - boxes[0].x1,
2450 boxes[0].y2 - boxes[0].y1);
2454 PREFIX (_init) (region);
2456 /* if it's 0, don't call pixman_rect_alloc -- 0 rectangles is
2457 * a special case, and causing pixman_rect_alloc would cause
2458 * us to leak memory (because the 0-rect case should be the
2459 * static pixman_region_empty_data data).
2464 if (!pixman_rect_alloc (region, count))
2467 rects = PIXREGION_RECTS (region);
2469 /* Copy in the rects */
2470 memcpy (rects, boxes, sizeof(box_type_t) * count);
2471 region->data->numRects = count;
2473 /* Eliminate empty and malformed rectangles */
2476 for (i = 0; i < count; ++i)
2478 box_type_t *box = &rects[i];
2480 if (box->x1 >= box->x2 || box->y1 >= box->y2)
2482 else if (displacement)
2483 rects[i - displacement] = rects[i];
2486 region->data->numRects -= displacement;
2488 /* If eliminating empty rectangles caused there
2489 * to be only 0 or 1 rectangles, deal with that.
2491 if (region->data->numRects == 0)
2494 PREFIX (_init) (region);
2499 if (region->data->numRects == 1)
2501 region->extents = rects[0];
2504 region->data = NULL;
2512 region->extents.x1 = region->extents.x2 = 0;
2514 return validate (region, &i);