1 /************************************************************************
3 Copyright 1987, 1998 The Open Group
5 Permission to use, copy, modify, distribute, and sell this software and its
6 documentation for any purpose is hereby granted without fee, provided that
7 the above copyright notice appear in all copies and that both that
8 copyright notice and this permission notice appear in supporting
11 The above copyright notice and this permission notice shall be included in
12 all copies or substantial portions of the Software.
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
18 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
19 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
21 Except as contained in this notice, the name of The Open Group shall not be
22 used in advertising or otherwise to promote the sale, use or other dealings
23 in this Software without prior written authorization from The Open Group.
26 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
30 Permission to use, copy, modify, and distribute this software and its
31 documentation for any purpose and without fee is hereby granted,
32 provided that the above copyright notice appear in all copies and that
33 both that copyright notice and this permission notice appear in
34 supporting documentation, and that the name of Digital not be
35 used in advertising or publicity pertaining to distribution of the
36 software without specific, written prior permission.
38 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
39 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
40 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
41 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
42 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
43 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
46 ************************************************************************/
48 #ifndef _X11_XREGION_H_
49 #define _X11_XREGION_H_
53 } Box, BOX, BoxRec, *BoxPtr;
56 short x, y, width, height;
57 }RECTANGLE, RectangleRec, *RectanglePtr;
61 #define MAXSHORT 32767
62 #define MINSHORT -MAXSHORT
64 #define MAX(a,b) (((a) > (b)) ? (a) : (b))
67 #define MIN(a,b) (((a) < (b)) ? (a) : (b))
75 typedef struct _XRegion {
82 /* Xutil.h contains the declaration:
83 * typedef struct _XRegion *Region;
86 /* 1 if two BOXs overlap.
87 * 0 if two BOXs do not overlap.
88 * Remember, x2 and y2 are not in the region
90 #define EXTENTCHECK(r1, r2) \
91 ((r1)->x2 > (r2)->x1 && \
92 (r1)->x1 < (r2)->x2 && \
93 (r1)->y2 > (r2)->y1 && \
97 * update region extents
99 #define EXTENTS(r,idRect){\
100 if((r)->x1 < (idRect)->extents.x1)\
101 (idRect)->extents.x1 = (r)->x1;\
102 if((r)->y1 < (idRect)->extents.y1)\
103 (idRect)->extents.y1 = (r)->y1;\
104 if((r)->x2 > (idRect)->extents.x2)\
105 (idRect)->extents.x2 = (r)->x2;\
106 if((r)->y2 > (idRect)->extents.y2)\
107 (idRect)->extents.y2 = (r)->y2;\
111 * Check to see if there is enough memory in the present region.
113 #define MEMCHECK(reg, rect, firstrect){\
114 if ((reg)->numRects >= ((reg)->size - 1)){\
115 (firstrect) = (BOX *) Xrealloc \
116 ((char *)(firstrect), (unsigned) (2 * (sizeof(BOX)) * ((reg)->size)));\
117 if ((firstrect) == 0)\
120 (rect) = &(firstrect)[(reg)->numRects];\
124 /* this routine checks to see if the previous rectangle is the same
125 * or subsumes the new rectangle to add.
128 #define CHECK_PREVIOUS(Reg, R, Rx1, Ry1, Rx2, Ry2)\
129 (!(((Reg)->numRects > 0)&&\
130 ((R-1)->y1 == (Ry1)) &&\
131 ((R-1)->y2 == (Ry2)) &&\
132 ((R-1)->x1 <= (Rx1)) &&\
133 ((R-1)->x2 >= (Rx2))))
135 /* add a rectangle to the given Region */
136 #define ADDRECT(reg, r, rx1, ry1, rx2, ry2){\
137 if (((rx1) < (rx2)) && ((ry1) < (ry2)) &&\
138 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
143 EXTENTS((r), (reg));\
151 /* add a rectangle to the given Region */
152 #define ADDRECTNOX(reg, r, rx1, ry1, rx2, ry2){\
153 if ((rx1 < rx2) && (ry1 < ry2) &&\
154 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
164 #define EMPTY_REGION(pReg) pReg->numRects = 0
166 #define REGION_NOT_EMPTY(pReg) pReg->numRects
168 #define INBOX(r, x, y) \
169 ( ( ((r).x2 > x)) && \
170 ( ((r).x1 <= x)) && \
175 * number of points to buffer before sending them off
176 * to scanlines() : Must be an even number
178 #define NUMPTSTOBUFFER 200
181 * used to allocate buffers for points and link
182 * the buffers together
184 typedef struct _POINTBLOCK {
185 XPoint pts[NUMPTSTOBUFFER];
186 struct _POINTBLOCK *next;
189 #endif /* _X11_XREGION_H_ */