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.
25 Copyright 1987 by 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
45 ******************************************************************/
46 #ifdef HAVE_DIX_CONFIG_H
47 #include <dix-config.h>
52 #include "miscanfill.h"
59 * Written by Brian Kelleher; Oct. 1985
61 * Routine to fill a polygon. Two fill rules are
62 * supported: frWINDING and frEVENODD.
64 * See fillpoly.h for a complete description of the algorithm.
68 miFillGeneralPoly(DrawablePtr dst
, GCPtr pgc
, int count
, /* number of points */
69 DDXPointPtr ptsIn
/* the points */
72 EdgeTableEntry
*pAET
; /* the Active Edge Table */
73 int y
; /* the current scanline */
74 int nPts
= 0; /* number of pts in buffer */
75 EdgeTableEntry
*pWETE
; /* Winding Edge Table */
76 ScanLineList
*pSLL
; /* Current ScanLineList */
77 DDXPointPtr ptsOut
; /* ptr to output buffers */
79 DDXPointRec FirstPoint
[NUMPTSTOBUFFER
]; /* the output buffers */
80 int FirstWidth
[NUMPTSTOBUFFER
];
81 EdgeTableEntry
*pPrevAET
; /* previous AET entry */
82 EdgeTable ET
; /* Edge Table header node */
83 EdgeTableEntry AET
; /* Active ET header node */
84 EdgeTableEntry
*pETEs
; /* Edge Table Entries buff */
85 ScanLineListBlock SLLBlock
; /* header for ScanLineList */
91 if (!(pETEs
= malloc(sizeof(EdgeTableEntry
) * count
)))
95 if (!miCreateETandAET(count
, ptsIn
, &ET
, &AET
, pETEs
, &SLLBlock
)) {
99 pSLL
= ET
.scanlines
.next
;
101 if (pgc
->fillRule
== EvenOddRule
) {
105 for (y
= ET
.ymin
; y
< ET
.ymax
; y
++) {
107 * Add a new edge to the active edge table when we
108 * get to the next edge.
110 if (pSLL
&& y
== pSLL
->scanline
) {
111 miloadAET(&AET
, pSLL
->edgelist
);
118 * for each active edge
121 ptsOut
->x
= pAET
->bres
.minor
;
123 *width
++ = pAET
->next
->bres
.minor
- pAET
->bres
.minor
;
127 * send out the buffer when its full
129 if (nPts
== NUMPTSTOBUFFER
) {
130 (*pgc
->ops
->FillSpans
) (dst
, pgc
,
131 nPts
, FirstPoint
, FirstWidth
, 1);
136 EVALUATEEDGEEVENODD(pAET
, pPrevAET
, y
)
137 EVALUATEEDGEEVENODD(pAET
, pPrevAET
, y
);
139 miInsertionSort(&AET
);
142 else { /* default to WindingNumber */
147 for (y
= ET
.ymin
; y
< ET
.ymax
; y
++) {
149 * Add a new edge to the active edge table when we
150 * get to the next edge.
152 if (pSLL
&& y
== pSLL
->scanline
) {
153 miloadAET(&AET
, pSLL
->edgelist
);
162 * for each active edge
166 * if the next edge in the active edge table is
167 * also the next edge in the winding active edge
171 ptsOut
->x
= pAET
->bres
.minor
;
173 *width
++ = pAET
->nextWETE
->bres
.minor
- pAET
->bres
.minor
;
177 * send out the buffer
179 if (nPts
== NUMPTSTOBUFFER
) {
180 (*pgc
->ops
->FillSpans
) (dst
, pgc
, nPts
, FirstPoint
,
187 pWETE
= pWETE
->nextWETE
;
188 while (pWETE
!= pAET
)
189 EVALUATEEDGEWINDING(pAET
, pPrevAET
, y
, fixWAET
);
190 pWETE
= pWETE
->nextWETE
;
192 EVALUATEEDGEWINDING(pAET
, pPrevAET
, y
, fixWAET
);
196 * reevaluate the Winding active edge table if we
197 * just had to resort it or if we just exited an edge.
199 if (miInsertionSort(&AET
) || fixWAET
) {
207 * Get any spans that we missed by buffering
209 (*pgc
->ops
->FillSpans
) (dst
, pgc
, nPts
, FirstPoint
, FirstWidth
, 1);
211 miFreeStorage(SLLBlock
.next
);