| 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 | Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts. |
| 26 | |
| 27 | All Rights Reserved |
| 28 | |
| 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. |
| 36 | |
| 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 |
| 43 | SOFTWARE. |
| 44 | |
| 45 | ******************************************************************/ |
| 46 | /* |
| 47 | * mipoly.c |
| 48 | * |
| 49 | * Written by Brian Kelleher; June 1986 |
| 50 | * |
| 51 | * Draw polygons. This routine translates the point by the |
| 52 | * origin if pGC->miTranslate is non-zero, and calls |
| 53 | * to the appropriate routine to actually scan convert the |
| 54 | * polygon. |
| 55 | */ |
| 56 | #ifdef HAVE_DIX_CONFIG_H |
| 57 | #include <dix-config.h> |
| 58 | #endif |
| 59 | |
| 60 | #include <X11/X.h> |
| 61 | #include "windowstr.h" |
| 62 | #include "gcstruct.h" |
| 63 | #include "pixmapstr.h" |
| 64 | #include "mi.h" |
| 65 | #include "regionstr.h" |
| 66 | |
| 67 | void |
| 68 | miFillPolygon(DrawablePtr dst, GCPtr pgc, |
| 69 | int shape, int mode, int count, DDXPointPtr pPts) |
| 70 | { |
| 71 | int i; |
| 72 | int xorg, yorg; |
| 73 | DDXPointPtr ppt; |
| 74 | |
| 75 | if (count == 0) |
| 76 | return; |
| 77 | |
| 78 | ppt = pPts; |
| 79 | if (pgc->miTranslate) { |
| 80 | xorg = dst->x; |
| 81 | yorg = dst->y; |
| 82 | |
| 83 | if (mode == CoordModeOrigin) { |
| 84 | for (i = 0; i < count; i++) { |
| 85 | ppt->x += xorg; |
| 86 | ppt++->y += yorg; |
| 87 | } |
| 88 | } |
| 89 | else { |
| 90 | ppt->x += xorg; |
| 91 | ppt++->y += yorg; |
| 92 | for (i = 1; i < count; i++) { |
| 93 | ppt->x += (ppt - 1)->x; |
| 94 | ppt->y += (ppt - 1)->y; |
| 95 | ppt++; |
| 96 | } |
| 97 | } |
| 98 | } |
| 99 | else { |
| 100 | if (mode == CoordModePrevious) { |
| 101 | ppt++; |
| 102 | for (i = 1; i < count; i++) { |
| 103 | ppt->x += (ppt - 1)->x; |
| 104 | ppt->y += (ppt - 1)->y; |
| 105 | ppt++; |
| 106 | } |
| 107 | } |
| 108 | } |
| 109 | if (shape == Convex) |
| 110 | miFillConvexPoly(dst, pgc, count, pPts); |
| 111 | else |
| 112 | miFillGeneralPoly(dst, pgc, count, pPts); |
| 113 | } |