1 /* Combined Purdue/PurduePlus patches, level 2.0, 1/17/89 */
2 /***********************************************************
4 Copyright (c) 1987 X Consortium
6 Permission is hereby granted, free of charge, to any person obtaining a copy
7 of this software and associated documentation files (the "Software"), to deal
8 in the Software without restriction, including without limitation the rights
9 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 copies of the Software, and to permit persons to whom the Software is
11 furnished to do so, subject to the following conditions:
13 The above copyright notice and this permission notice shall be included in
14 all copies or substantial portions of the Software.
16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
20 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
21 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
23 Except as contained in this notice, the name of the X Consortium shall not be
24 used in advertising or otherwise to promote the sale, use or other dealings
25 in this Software without prior written authorization from the X Consortium.
28 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
32 Permission to use, copy, modify, and distribute this software and its
33 documentation for any purpose and without fee is hereby granted,
34 provided that the above copyright notice appear in all copies and that
35 both that copyright notice and this permission notice appear in
36 supporting documentation, and that the name of Digital not be
37 used in advertising or publicity pertaining to distribution of the
38 software without specific, written prior permission.
40 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
41 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
42 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
43 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
44 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
45 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
48 ******************************************************************/
49 /* $XConsortium: mfbbres.c,v 1.22 94/04/17 20:28:17 dpw Exp $ */
56 /* Solid bresenham line */
58 e2 is used less often than e1, so it's not in a register
62 mfbBresS(rop, addrlbase, nlwidth, signdx, signdy, axis, x1, y1, e, e1, e2, len)
63 int rop; /* a reduced rasterop */
64 PixelType *addrlbase; /* pointer to base of bitmap */
65 int nlwidth; /* width in longwords of bitmap */
66 int signdx, signdy; /* signs of directions */
67 int axis; /* major axis (Y_AXIS or X_AXIS) */
68 int x1, y1; /* initial point */
69 register int e; /* error accumulator */
70 register int e1; /* bresenham increments */
72 int len; /* length of line */
74 register int yinc; /* increment to next scanline, in bytes */
75 register PixelType *addrl; /* bitmask long pointer */
76 register PixelType bit; /* current bit being set/cleared/etc. */
77 PixelType leftbit = mask[0]; /* leftmost bit to process in new word */
78 PixelType rightbit = mask[PPW-1]; /* rightmost bit to process in new word */
80 register int e3 = e2-e1;
83 /* point to longword containing first point */
84 addrl = mfbScanline(addrlbase, x1, y1, nlwidth);
85 yinc = signdy * nlwidth;
86 e = e-e1; /* to make looping easier */
91 if (rop == RROP_BLACK)
103 bit = SCRRIGHT(bit,1);
108 mfbScanlineInc(addrl, yinc);
136 bit = SCRLEFT(bit,1);
140 mfbScanlineInc(addrl, yinc);
170 bit = SCRRIGHT(bit,1);
171 if (!bit) { bit = leftbit;addrl ++; }
174 mfbScanlineInc(addrl, yinc);
185 bit = SCRLEFT(bit,1);
186 if (!bit) { bit = rightbit;addrl --; }
189 mfbScanlineInc(addrl, yinc);
194 else if (rop == RROP_WHITE)
207 bit = SCRRIGHT(bit,1);
211 mfbScanlineInc(addrl, yinc);
239 bit = SCRLEFT(bit,1);
243 mfbScanlineInc(addrl, yinc);
273 bit = SCRRIGHT(bit,1);
274 if (!bit) { bit = leftbit;addrl ++; }
277 mfbScanlineInc(addrl, yinc);
288 bit = SCRLEFT(bit,1);
289 if (!bit) { bit = rightbit;addrl --; }
292 mfbScanlineInc(addrl, yinc);
297 else if (rop == RROP_INVERT)
309 mfbScanlineInc(addrl, yinc);
312 bit = SCRRIGHT(bit,1);
313 if (!bit) { bit = leftbit;addrl ++; }
324 mfbScanlineInc(addrl, yinc);
327 bit = SCRLEFT(bit,1);
328 if (!bit) { bit = rightbit;addrl --; }
342 bit = SCRRIGHT(bit,1);
343 if (!bit) { bit = leftbit;addrl ++; }
346 mfbScanlineInc(addrl, yinc);
357 bit = SCRLEFT(bit,1);
358 if (!bit) { bit = rightbit; addrl --; }
361 mfbScanlineInc(addrl, yinc);