Debian Codegraph @

nx-X11/lib/include/X11/Xregion.h

raw
1 /************************************************************************
2
3 Copyright 1987, 1998 The Open Group
4
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
9 documentation.
10
11 The above copyright notice and this permission notice shall be included in
12 all copies or substantial portions of the Software.
13
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.
20
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.
24
25
26 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
27
28 All Rights Reserved
29
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.
37
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
44 SOFTWARE.
45
46 ************************************************************************/
47
48 #if !defined(_X11_XREGION_H_) && !defined(_XREGION_H)
49 #define _X11_XREGION_H_
50 #define _XREGION_H
51
52 typedef struct {
53 short x1, x2, y1, y2;
54 } Box, BOX, BoxRec, *BoxPtr;
55
56 typedef struct {
57 short x, y, width, height;
58 }RECTANGLE, RectangleRec, *RectanglePtr;
59
60 #define TRUE 1
61 #define FALSE 0
62 #define MAXSHORT 32767
63 #define MINSHORT -MAXSHORT
64 #ifndef MAX
65 #define MAX(a,b) (((a) > (b)) ? (a) : (b))
66 #endif
67 #ifndef MIN
68 #define MIN(a,b) (((a) < (b)) ? (a) : (b))
69 #endif
70
71
72 /*
73 * clip region
74 */
75
76 typedef struct _XRegion {
77 long size;
78 long numRects;
79 BOX *rects;
80 BOX extents;
81 } REGION;
82
83 /* Xutil.h contains the declaration:
84 * typedef struct _XRegion *Region;
85 */
86
87 /* 1 if two BOXs overlap.
88 * 0 if two BOXs do not overlap.
89 * Remember, x2 and y2 are not in the region
90 */
91 #define EXTENTCHECK(r1, r2) \
92 ((r1)->x2 > (r2)->x1 && \
93 (r1)->x1 < (r2)->x2 && \
94 (r1)->y2 > (r2)->y1 && \
95 (r1)->y1 < (r2)->y2)
96
97 /*
98 * update region extents
99 */
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;\
109 }
110
111 /*
112 * Check to see if there is enough memory in the present region.
113 */
114 #define MEMCHECK(reg, rect, firstrect){\
115 if ((reg)->numRects >= ((reg)->size - 1)){\
116 BoxPtr tmpRect = Xrealloc ((firstrect), \
117 (2 * (sizeof(BOX)) * ((reg)->size))); \
118 if (tmpRect == NULL) \
119 return(0);\
120 (firstrect) = tmpRect; \
121 (reg)->size *= 2;\
122 (rect) = &(firstrect)[(reg)->numRects];\
123 }\
124 }
125
126 /* this routine checks to see if the previous rectangle is the same
127 * or subsumes the new rectangle to add.
128 */
129
130 #define CHECK_PREVIOUS(Reg, R, Rx1, Ry1, Rx2, Ry2)\
131 (!(((Reg)->numRects > 0)&&\
132 ((R-1)->y1 == (Ry1)) &&\
133 ((R-1)->y2 == (Ry2)) &&\
134 ((R-1)->x1 <= (Rx1)) &&\
135 ((R-1)->x2 >= (Rx2))))
136
137 /* add a rectangle to the given Region */
138 #define ADDRECT(reg, r, rx1, ry1, rx2, ry2){\
139 if (((rx1) < (rx2)) && ((ry1) < (ry2)) &&\
140 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
141 (r)->x1 = (rx1);\
142 (r)->y1 = (ry1);\
143 (r)->x2 = (rx2);\
144 (r)->y2 = (ry2);\
145 EXTENTS((r), (reg));\
146 (reg)->numRects++;\
147 (r)++;\
148 }\
149 }
150
151
152
153 /* add a rectangle to the given Region */
154 #define ADDRECTNOX(reg, r, rx1, ry1, rx2, ry2){\
155 if ((rx1 < rx2) && (ry1 < ry2) &&\
156 CHECK_PREVIOUS((reg), (r), (rx1), (ry1), (rx2), (ry2))){\
157 (r)->x1 = (rx1);\
158 (r)->y1 = (ry1);\
159 (r)->x2 = (rx2);\
160 (r)->y2 = (ry2);\
161 (reg)->numRects++;\
162 (r)++;\
163 }\
164 }
165
166 #define EMPTY_REGION(pReg) pReg->numRects = 0
167
168 #define REGION_NOT_EMPTY(pReg) pReg->numRects
169
170 #define INBOX(r, x, y) \
171 ( ( ((r).x2 > x)) && \
172 ( ((r).x1 <= x)) && \
173 ( ((r).y2 > y)) && \
174 ( ((r).y1 <= y)) )
175
176 /*
177 * number of points to buffer before sending them off
178 * to scanlines() : Must be an even number
179 */
180 #define NUMPTSTOBUFFER 200
181
182 /*
183 * used to allocate buffers for points and link
184 * the buffers together
185 */
186 typedef struct _POINTBLOCK {
187 XPoint pts[NUMPTSTOBUFFER];
188 struct _POINTBLOCK *next;
189 } POINTBLOCK;
190
191 #endif /* !defined(_X11_XREGION_H_) && !defined(_XREGION_H) */