1 /* $Xorg: region.h,v 1.4 2001/02/09 02:03:40 xorgcvs Exp $ */
2 /************************************************************************
4 Copyright 1987, 1998 The Open Group
6 Permission to use, copy, modify, distribute, and sell this software and its
7 documentation for any purpose is hereby granted without fee, provided that
8 the above copyright notice appear in all copies and that both that
9 copyright notice and this permission notice appear in supporting
12 The above copyright notice and this permission notice shall be included in
13 all copies or substantial portions of the Software.
15 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
19 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
20 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22 Except as contained in this notice, the name of The Open Group shall not be
23 used in advertising or otherwise to promote the sale, use or other dealings
24 in this Software without prior written authorization from The Open Group.
27 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
31 Permission to use, copy, modify, and distribute this software and its
32 documentation for any purpose and without fee is hereby granted,
33 provided that the above copyright notice appear in all copies and that
34 both that copyright notice and this permission notice appear in
35 supporting documentation, and that the name of Digital not be
36 used in advertising or publicity pertaining to distribution of the
37 software without specific, written prior permission.
39 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
40 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
41 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
42 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
43 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
44 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
47 ************************************************************************/
54 } Box, BOX, BoxRec, *BoxPtr;
57 short x, y, width, height;
58 }RECTANGLE, RectangleRec, *RectanglePtr;
62 #define MAXSHORT 32767
63 #define MINSHORT -MAXSHORT
65 #define MAX(a,b) (((a) > (b)) ? (a) : (b))
68 #define MIN(a,b) (((a) < (b)) ? (a) : (b))
76 typedef struct _XRegion {
83 /* Xutil.h contains the declaration:
84 * typedef struct _XRegion *Region;
87 /* 1 if two BOXs overlap.
88 * 0 if two BOXs do not overlap.
89 * Remember, x2 and y2 are not in the region
91 #define EXTENTCHECK(r1, r2) \
92 ((r1)->x2 > (r2)->x1 && \
93 (r1)->x1 < (r2)->x2 && \
94 (r1)->y2 > (r2)->y1 && \
98 * update region extents
100 #define EXTENTS(r,idRect){\
101 if((r)->x1 < (idRect)->extents.x1)\
102 (idRect)->extents.x1 = (r)->x1;\
103 if((r)->y1 < (idRect)->extents.y1)\
104 (idRect)->extents.y1 = (r)->y1;\
105 if((r)->x2 > (idRect)->extents.x2)\
106 (idRect)->extents.x2 = (r)->x2;\
107 if((r)->y2 > (idRect)->extents.y2)\
108 (idRect)->extents.y2 = (r)->y2;\
112 * Check to see if there is enough memory in the present region.
114 #define MEMCHECK(reg, rect, firstrect){\
115 if ((reg)->numRects >= ((reg)->size - 1)){\
116 (firstrect) = (BOX *) Xrealloc \
117 ((char *)(firstrect), (unsigned) (2 * (sizeof(BOX)) * ((reg)->size)));\
118 if ((firstrect) == 0)\
121 (rect) = &(firstrect)[(reg)->numRects];\
125 /* this routine checks to see if the previous rectangle is the same
126 * or subsumes the new rectangle to add.
129 #define CHECK_PREVIOUS(Reg, R, Rx1, Ry1, Rx2, Ry2)\
130 (!(((Reg)->numRects > 0)&&\
131 ((R-1)->y1 == (Ry1)) &&\
132 ((R-1)->y2 == (Ry2)) &&\
133 ((R-1)->x1 <= (Rx1)) &&\
134 ((R-1)->x2 >= (Rx2))))
136 /* add a rectangle to the given Region */
137 #define ADDRECT(reg, r, rx1, ry1, rx2, ry2){\
138 if (((rx1) < (rx2)) && ((ry1) < (ry2)) &&\
139 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
144 EXTENTS((r), (reg));\
152 /* add a rectangle to the given Region */
153 #define ADDRECTNOX(reg, r, rx1, ry1, rx2, ry2){\
154 if ((rx1 < rx2) && (ry1 < ry2) &&\
155 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
165 #define EMPTY_REGION(pReg) pReg->numRects = 0
167 #define REGION_NOT_EMPTY(pReg) pReg->numRects
169 #define INBOX(r, x, y) \
170 ( ( ((r).x2 > x)) && \
171 ( ((r).x1 <= x)) && \
176 * number of points to buffer before sending them off
177 * to scanlines() : Must be an even number
179 #define NUMPTSTOBUFFER 200
182 * used to allocate buffers for points and link
183 * the buffers together
185 typedef struct _POINTBLOCK {
186 XPoint pts[NUMPTSTOBUFFER];
187 struct _POINTBLOCK *next;