blob: a9c977d07114318b52df8516e3074537eb8d9c1f [file] [log] [blame]
Pierre Ossman88903f22016-05-13 15:53:25 +02001/* $Xorg: region.h,v 1.4 2001/02/09 02:03:40 xorgcvs Exp $ */
2/************************************************************************
syuri843bf672008-09-19 09:55:50 +00003
4Copyright 1987, 1998 The Open Group
5
6Permission to use, copy, modify, distribute, and sell this software and its
7documentation for any purpose is hereby granted without fee, provided that
8the above copyright notice appear in all copies and that both that
9copyright notice and this permission notice appear in supporting
10documentation.
11
12The above copyright notice and this permission notice shall be included in
13all copies or substantial portions of the Software.
14
15THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
19AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
20CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
21
22Except as contained in this notice, the name of The Open Group shall not be
23used in advertising or otherwise to promote the sale, use or other dealings
24in this Software without prior written authorization from The Open Group.
25
26
27Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
28
29 All Rights Reserved
30
31Permission to use, copy, modify, and distribute this software and its
32documentation for any purpose and without fee is hereby granted,
33provided that the above copyright notice appear in all copies and that
34both that copyright notice and this permission notice appear in
35supporting documentation, and that the name of Digital not be
36used in advertising or publicity pertaining to distribution of the
37software without specific, written prior permission.
38
39DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
40ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
41DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
42ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
43WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
44ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
45SOFTWARE.
46
Pierre Ossman88903f22016-05-13 15:53:25 +020047************************************************************************/
syuri843bf672008-09-19 09:55:50 +000048
Pierre Ossman88903f22016-05-13 15:53:25 +020049#ifndef _X11_XREGION_H_
50#define _X11_XREGION_H_
syuri843bf672008-09-19 09:55:50 +000051
52typedef struct {
Pierre Ossman88903f22016-05-13 15:53:25 +020053 short x1, x2, y1, y2;
54} Box, BOX, BoxRec, *BoxPtr;
syuri843bf672008-09-19 09:55:50 +000055
56typedef struct {
Pierre Ossman88903f22016-05-13 15:53:25 +020057 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
76typedef 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)
syuri843bf672008-09-19 09:55:50 +000096
97/*
Pierre Ossman88903f22016-05-13 15:53:25 +020098 * update region extents
syuri843bf672008-09-19 09:55:50 +000099 */
Pierre Ossman88903f22016-05-13 15:53:25 +0200100#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 }
syuri843bf672008-09-19 09:55:50 +0000110
Pierre Ossman88903f22016-05-13 15:53:25 +0200111/*
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 (firstrect) = (BOX *) Xrealloc \
117 ((char *)(firstrect), (unsigned) (2 * (sizeof(BOX)) * ((reg)->size)));\
118 if ((firstrect) == 0)\
119 return(0);\
120 (reg)->size *= 2;\
121 (rect) = &(firstrect)[(reg)->numRects];\
122 }\
123 }
syuri843bf672008-09-19 09:55:50 +0000124
Pierre Ossman88903f22016-05-13 15:53:25 +0200125/* this routine checks to see if the previous rectangle is the same
126 * or subsumes the new rectangle to add.
127 */
syuri843bf672008-09-19 09:55:50 +0000128
Pierre Ossman88903f22016-05-13 15:53:25 +0200129#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))))
syuri843bf672008-09-19 09:55:50 +0000135
Pierre Ossman88903f22016-05-13 15:53:25 +0200136/* 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))){\
140 (r)->x1 = (rx1);\
141 (r)->y1 = (ry1);\
142 (r)->x2 = (rx2);\
143 (r)->y2 = (ry2);\
144 EXTENTS((r), (reg));\
145 (reg)->numRects++;\
146 (r)++;\
147 }\
148 }
syuri843bf672008-09-19 09:55:50 +0000149
syuri843bf672008-09-19 09:55:50 +0000150
syuri843bf672008-09-19 09:55:50 +0000151
Pierre Ossman88903f22016-05-13 15:53:25 +0200152/* 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))){\
156 (r)->x1 = (rx1);\
157 (r)->y1 = (ry1);\
158 (r)->x2 = (rx2);\
159 (r)->y2 = (ry2);\
160 (reg)->numRects++;\
161 (r)++;\
162 }\
163 }
syuri843bf672008-09-19 09:55:50 +0000164
Pierre Ossman88903f22016-05-13 15:53:25 +0200165#define EMPTY_REGION(pReg) pReg->numRects = 0
syuri843bf672008-09-19 09:55:50 +0000166
Pierre Ossman88903f22016-05-13 15:53:25 +0200167#define REGION_NOT_EMPTY(pReg) pReg->numRects
syuri843bf672008-09-19 09:55:50 +0000168
Pierre Ossman88903f22016-05-13 15:53:25 +0200169#define INBOX(r, x, y) \
170 ( ( ((r).x2 > x)) && \
171 ( ((r).x1 <= x)) && \
172 ( ((r).y2 > y)) && \
173 ( ((r).y1 <= y)) )
syuri843bf672008-09-19 09:55:50 +0000174
Pierre Ossman88903f22016-05-13 15:53:25 +0200175/*
176 * number of points to buffer before sending them off
177 * to scanlines() : Must be an even number
178 */
179#define NUMPTSTOBUFFER 200
syuri843bf672008-09-19 09:55:50 +0000180
Pierre Ossman88903f22016-05-13 15:53:25 +0200181/*
182 * used to allocate buffers for points and link
183 * the buffers together
184 */
185typedef struct _POINTBLOCK {
186 XPoint pts[NUMPTSTOBUFFER];
187 struct _POINTBLOCK *next;
188} POINTBLOCK;
syuri843bf672008-09-19 09:55:50 +0000189
Pierre Ossman88903f22016-05-13 15:53:25 +0200190#endif /* _X11_XREGION_H_ */