4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncCopyright 1987, 1998 The Open Group
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncPermission to use, copy, modify, distribute, and sell this software and its
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncdocumentation for any purpose is hereby granted without fee, provided that
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncthe above copyright notice appear in all copies and that both that
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsynccopyright notice and this permission notice appear in supporting
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncdocumentation.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncThe above copyright notice and this permission notice shall be included
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncin all copies or substantial portions of the Software.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncTHE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncIN NO EVENT SHALL THE OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncOTHER DEALINGS IN THE SOFTWARE.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncExcept as contained in this notice, the name of The Open Group shall
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncnot be used in advertising or otherwise to promote the sale, use or
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncother dealings in this Software without prior written authorization
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsyncfrom The Open Group.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * Written by Brian Kelleher; Jan 1985
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * This file contains a few macros to help track
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * the edge of a filled object. The object is assumed
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * to be filled in scanline order, and thus the
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * algorithm used is an extension of Bresenham's line
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * drawing algorithm which assumes that y is always the
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * major axis.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * Since these pieces of code are the same for any filled shape,
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * it is more convenient to gather the library in one
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * place, but since these pieces of code are also in
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * the inner loops of output primitives, procedure call
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * overhead is out of the question.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * See the author for a derivation if needed.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * In scan converting polygons, we want to choose those pixels
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * which are inside the polygon. Thus, we add .5 to the starting
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * x coordinate for both left and right edges. Now we choose the
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * first pixel which is inside the pgon for the left edge and the
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * first pixel which is outside the pgon for the right edge.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * Draw the left pixel, but not the right.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * How to add .5 to the starting x coordinate:
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * If the edge is moving to the right, then subtract dy from the
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * error term from the general form of the algorithm.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * If the edge is moving to the left, then add dy to the error term.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * The reason for the difference between edges moving to the left
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * and edges moving to the right is simple: If an edge is moving
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * to the right, then we want the algorithm to flip immediately.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * If it is moving to the left, then we don't want it to flip until
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * we traverse an entire pixel.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync#define BRESINITPGON(dy, x1, x2, xStart, d, m, m1, incr1, incr2) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * if the edge is horizontal, then it is ignored \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * and assumed not to be processed. Otherwise, do this stuff. \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync if ((dy) != 0) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync if (dx < 0) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync#define BRESINCRPGON(d, minval, m, m1, incr1, incr2) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync if (m1 > 0) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync if (d > 0) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync if (d >= 0) { \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * This structure contains all of the information needed
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * to run the bresenham algorithm.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * The variables may be hardcoded into the declarations
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * instead of using this structure to make use of
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync * register declarations.
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsynctypedef struct {
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync int d; /* decision variable */
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync#define BRESINITPGONSTRUCT(dmaj, min1, min2, bres) \
4fd606d1f5abe38e1f42c38de1d2e895166bd0f4vboxsync BRESINITPGON(dmaj, min1, min2, bres.minor, bres.d, \