![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to gif.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / classes / gd|
Return to gif.C CVS log | Up to [parser3project] / parser3 / src / classes / gd |
1.3 paf 1: /** @file
2: Parser: image manipulations impl1.
3:
1.9 parser 4: Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
1.3 paf 5: Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
1.8 parser 6:
1.19 ! parser 7: $Id: gif.C,v 1.18 2001/10/16 09:59:23 parser Exp $
1.9 parser 8:
9: based on: gd
10:
11: Written by Tom Boutell, 5/94.
12: Copyright 1994, Cold Spring Harbor Labs.
13: Permission granted to use this code in any fashion provided
14: that this notice is retained and any alterations are
15: labeled as such. It is requested, but not required, that
16: you share extensions to this module with us so that we
17: can incorporate them into new versions.
1.3 paf 18: */
19:
1.1 paf 20: #include "gif.h"
21:
1.11 parser 22: #include "mtables.h"
23:
1.2 paf 24: //static void BrushApply(int x, int y);
25: //static void TileApply(int x, int y);
1.1 paf 26:
1.2 paf 27: void gdImage::Create(int asx, int asy) {
28: sx = asx;
29: sy = asy;
30:
31: int i;
32: pixels = (unsigned char **) malloc(sizeof(unsigned char *) * sx);
33: polyInts = 0;
34: polyAllocated = 0;
1.6 parser 35: lineWidth = 1; lineStyle=0;
1.2 paf 36: for (i=0; (i<asx); i++)
37: pixels[i] = (unsigned char *) calloc(asy);
38: colorsTotal = 0;
39: transparent = (-1);
40: interlace = 0;
1.1 paf 41: }
42:
1.18 parser 43: int gdImage::ColorClosest(int r, int g, int b, int tolerance)
1.1 paf 44: {
45: int i;
46: long rd, gd, bd;
47: int ct = (-1);
48: long mindist = 0;
1.2 paf 49: for (i=0; (i<(colorsTotal)); i++) {
1.1 paf 50: long dist;
1.2 paf 51: if (open[i]) {
1.1 paf 52: continue;
53: }
1.2 paf 54: rd = (red[i] - r);
55: gd = (green[i] - g);
56: bd = (blue[i] - b);
1.1 paf 57: dist = rd * rd + gd * gd + bd * bd;
1.18 parser 58: if ((i == 0) || (dist < mindist+tolerance)) {
1.1 paf 59: mindist = dist;
60: ct = i;
61: }
62: }
1.18 parser 63: return mindist<tolerance?ct:-1;
1.1 paf 64: }
65:
1.2 paf 66: int gdImage::ColorExact(int r, int g, int b)
1.1 paf 67: {
68: int i;
1.2 paf 69: for (i=0; (i<(colorsTotal)); i++) {
70: if (open[i]) {
1.1 paf 71: continue;
72: }
1.2 paf 73: if ((red[i] == r) &&
74: (green[i] == g) &&
75: (blue[i] == b)) {
1.1 paf 76: return i;
77: }
78: }
79: return -1;
80: }
81:
1.2 paf 82: int gdImage::ColorAllocate(int r, int g, int b)
1.1 paf 83: {
84: int i;
85: int ct = (-1);
1.2 paf 86: for (i=0; (i<(colorsTotal)); i++) {
87: if (open[i]) {
1.1 paf 88: ct = i;
89: break;
90: }
91: }
92: if (ct == (-1)) {
1.2 paf 93: ct = colorsTotal;
1.1 paf 94: if (ct == gdMaxColors) {
95: return -1;
96: }
1.2 paf 97: colorsTotal++;
1.1 paf 98: }
1.2 paf 99: red[ct] = r;
100: green[ct] = g;
101: blue[ct] = b;
102: open[ct] = 0;
1.1 paf 103: return ct;
104: }
105:
1.2 paf 106: int gdImage::ColorRGB(int r, int g, int b){
107: int idx=ColorExact(r,g,b);
108: return idx<0 ? ColorAllocate(r,g,b) : idx;
1.1 paf 109: }
110:
1.2 paf 111: int gdImage::Color(unsigned int rgb){
1.1 paf 112: unsigned int b=rgb, g=b>>8, r=g>>8;
1.2 paf 113: return ColorRGB(r & 0xFF,g & 0xFF,b & 0xFF);
1.1 paf 114: }
115:
1.2 paf 116: void gdImage::ColorDeallocate(int color)
1.1 paf 117: {
118: /* Mark it open. */
1.2 paf 119: open[color] = 1;
1.1 paf 120: }
121:
1.2 paf 122: void gdImage::SetColorTransparent(int color)
1.1 paf 123: {
1.2 paf 124: transparent = color;
1.1 paf 125: }
126:
127:
1.2 paf 128: void gdImage::SetPixel(int x, int y, int color)
1.1 paf 129: {
130: //paf int p;
131:
1.6 parser 132: switch (lineWidth){
1.1 paf 133: case 1: {
1.2 paf 134: DoSetPixel(x, y,color);
1.1 paf 135: return;
136: }
137: case 2: {
1.2 paf 138: DoSetPixel(x, y-1,color);
139: DoSetPixel(x-1, y,color);
140: DoSetPixel(x, y,color);
141: DoSetPixel(x+1, y,color);
142: DoSetPixel(x, y+1,color);
1.1 paf 143: return;
144: }
145: default:{
146: int i,j;
1.2 paf 147: for (i=-1;i<=1;i++) DoSetPixel(x+i, y-2,color);
148: for (j=-1;j<=1;j++) for (i=-2;i<=2;i++) DoSetPixel(x+i, y+j,color);
149: for (i=-1;i<=1;i++) DoSetPixel(x+i, y+2,color);
1.1 paf 150: return;
151: }
152: }
153: }
154:
1.2 paf 155: int gdImage::GetPixel(int x, int y)
1.1 paf 156: {
1.2 paf 157: return BoundsSafe(x, y) ? pixels[x][y]:0;
1.1 paf 158: }
159:
160: /* Bresenham as presented in Foley & Van Dam */
161:
162: /* As above, plus dashing */
163:
1.6 parser 164: #define styledSet \
1.1 paf 165: { \
1.6 parser 166: if (lineStyle) { \
167: if(!lineStyle[styleStep]) \
168: styleStep = 0; \
169: on=lineStyle[styleStep++]!=' '; \
1.1 paf 170: } \
171: if (on) { \
1.2 paf 172: SetPixel(x, y, color); \
1.1 paf 173: } \
174: }
175:
1.6 parser 176: void gdImage::Line(int x1, int y1, int x2, int y2, int color)
1.1 paf 177: {
178: int dx, dy, incr1, incr2, d, x, y, xend, yend, xdirflag, ydirflag;
1.6 parser 179: int styleStep = 0;
1.1 paf 180: int on = 1;
181: dx = abs(x2-x1);
182: dy = abs(y2-y1);
183: if (dy <= dx) {
184: d = 2*dy - dx;
185: incr1 = 2*dy;
186: incr2 = 2 * (dy - dx);
187: if (x1 > x2) {
188: x = x2;
189: y = y2;
190: ydirflag = (-1);
191: xend = x1;
192: } else {
193: x = x1;
194: y = y1;
195: ydirflag = 1;
196: xend = x2;
197: }
1.6 parser 198: styledSet;
1.1 paf 199: if (((y2 - y1) * ydirflag) > 0) {
200: while (x < xend) {
201: x++;
202: if (d <0) {
203: d+=incr1;
204: } else {
205: y++;
206: d+=incr2;
207: }
1.6 parser 208: styledSet;
1.1 paf 209: }
210: } else {
211: while (x < xend) {
212: x++;
213: if (d <0) {
214: d+=incr1;
215: } else {
216: y--;
217: d+=incr2;
218: }
1.6 parser 219: styledSet;
1.1 paf 220: }
221: }
222: } else {
223: d = 2*dx - dy;
224: incr1 = 2*dx;
225: incr2 = 2 * (dx - dy);
226: if (y1 > y2) {
227: y = y2;
228: x = x2;
229: yend = y1;
230: xdirflag = (-1);
231: } else {
232: y = y1;
233: x = x1;
234: yend = y2;
235: xdirflag = 1;
236: }
1.6 parser 237: styledSet;
1.1 paf 238: if (((x2 - x1) * xdirflag) > 0) {
239: while (y < yend) {
240: y++;
241: if (d <0) {
242: d+=incr1;
243: } else {
244: x++;
245: d+=incr2;
246: }
1.6 parser 247: styledSet;
1.1 paf 248: }
249: } else {
250: while (y < yend) {
251: y++;
252: if (d <0) {
253: d+=incr1;
254: } else {
255: x--;
256: d+=incr2;
257: }
1.6 parser 258: styledSet;
1.1 paf 259: }
260: }
261: }
262: }
263:
264: /* s and e are integers modulo 360 (degrees), with 0 degrees
265: being the rightmost extreme and degrees changing clockwise.
266: cx and cy are the center in pixels; w and h are the horizontal
267: and vertical diameter in pixels. Nice interface, but slow, since
268: I don't yet use Bresenham (I'm using an inefficient but
269: simple solution with too much work going on in it; generalizing
270: Bresenham to ellipses and partial arcs of ellipses is non-trivial,
271: at least for me) and there are other inefficiencies (small circles
272: do far too much work). */
1.11 parser 273:
274: void gdImage::Arc(int cx, int cy, int w, int h, int s, int e, int color)
275: {
1.15 parser 276: #if 0
1.14 parser 277: if(s==0 && e==360) { // full
278: if(w==h) { // circle?
279: /* Bresenham octant code, which I should use eventually */
280: int x, y, d;
281: x = 0;
282: y = w/2;
283: d = 3-w;
284: while (x <= y) {
285: SetPixel(cx+x, cy+y, color);
286: SetPixel(cx+x, cy-y, color);
287: SetPixel(cx-x, cy+y, color);
288: SetPixel(cx-x, cy-y, color);
289: SetPixel(cx+y, cy+x, color);
290: SetPixel(cx+y, cy-x, color);
291: SetPixel(cx-y, cy+x, color);
292: SetPixel(cx-y, cy-x, color);
293: if (d < 0) {
294: d += 4 * x + 6;
295: } else {
296: d += 4 * (x - y) + 10;
297: y--;
298: }
299: x++;
300: }
301: } else { // full ellipse
302: w/=2;
303: h/=2;
304: int elx, ely;
305: long aa, aa2, bb, bb2, d, dx, dy;
306:
307: elx = 0; ely = h; aa = (long)w * w; aa2 = 2 * aa;
308: bb = (long)h * h; bb2 = 2 * bb;
309: d = bb - aa * h + aa/4; dx = 0; dy = aa2 * h;
310: SetPixel(cx, cy - ely, color); SetPixel(cx, cy + ely, color);
311: SetPixel(cx - w, cy, color); SetPixel(cx + w, cy, color);
312:
313: while (dx < dy)
314: {
315: if (d > 0) { ely--; dy-=aa2; d-=dy;}
316: elx++; dx+=bb2; d+=bb+dx;
317: SetPixel(cx + elx, cy + ely, color);
318: SetPixel(cx - elx, cy + ely, color);
319: SetPixel(cx + elx, cy - ely, color);
320: SetPixel(cx - elx, cy - ely, color);
321: };
322: d+=(3 * (aa - bb)/2 - (dx + dy))/2;
323: while (ely > 0)
324: {
325: if (d < 0) {elx++; dx+=bb2; d+=bb + dx;}
326: ely--; dy-=aa2; d+=aa - dy;
327: SetPixel(cx + elx, cy + ely, color);
328: SetPixel(cx - elx, cy + ely, color);
329: SetPixel(cx + elx, cy - ely, color);
330: SetPixel(cx - elx, cy - ely, color);
331: };
332: }
333: } else {
1.15 parser 334: #endif
1.13 parser 335: int i;
336: int lx = 0, ly = 0;
337: int w2, h2;
338: w2 = w/2;
339: h2 = h/2;
340: while (e < s) {
341: e += 360;
342: }
343: for (i=s; (i <= e); i++) {
344: int x, y;
345: x = ((long)cost[i % 360] * (long)w2 / costScale) + cx;
346: y = ((long)sint[i % 360] * (long)h2 / sintScale) + cy;
347: if (i != s) {
348: Line(lx, ly, x, y, color);
349: }
350: lx = x;
351: ly = y;
352: }
1.15 parser 353: #if 0
1.11 parser 354: }
1.15 parser 355: #endif
1.11 parser 356: }
1.14 parser 357:
358: /*
359:
360: // http://firststeps.narod.ru/cgi/18.html
361:
362: int CGIScreen::Ellipse(int exc, int eyc, int ea, int eb , unsigned char Color)
363: {
364: int elx, ely;
365: long aa, aa2, bb, bb2, d, dx, dy;
366:
367: elx = 0; ely = eb; aa = (long)ea * ea; aa2 = 2 * aa;
368: bb = (long)eb * eb; bb2 = 2 * bb;
369: d = bb - aa * eb + aa/4; dx = 0; dy = aa2 * eb;
370: PutPixel(exc, eyc - ely, Color); PutPixel(exc, eyc + ely, Color);
371: PutPixel(exc - ea, eyc, Color); PutPixel(exc + ea, eyc, Color);
372:
373: while (dx < dy)
374: {
375: if (d > 0) { ely--; dy-=aa2; d-=dy;}
376: elx++; dx+=bb2; d+=bb+dx;
377: PutPixel(exc + elx, eyc + ely, Color);
378: PutPixel(exc - elx, eyc + ely, Color);
379: PutPixel(exc + elx, eyc - ely, Color);
380: PutPixel(exc - elx, eyc - ely, Color);
381: };
382: d+=(3 * (aa - bb)/2 - (dx + dy))/2;
383: while (ely > 0)
384: {
385: if (d < 0) {elx++; dx+=bb2; d+=bb + dx;}
386: ely--; dy-=aa2; d+=aa - dy;
387: PutPixel(exc + elx, eyc + ely, Color);
388: PutPixel(exc - elx, eyc + ely, Color);
389: PutPixel(exc + elx, eyc - ely, Color);
390: PutPixel(exc - elx, eyc - ely, Color);
391: };
392: return 0;
393: };
394:
395: */
1.11 parser 396:
1.12 parser 397:
398: void gdImage::Sector(int cx, int cy, int w, int h, int s, int e, int color)
399: {
400: int i;
401: int lx = 0, ly = 0;
402: int w2, h2;
403: w2 = w/2;
404: h2 = h/2;
405: while (e < s) {
406: e += 360;
407: }
408: for (i=s; (i <= e); i++) {
409: int x, y;
410: x = ((long)cost[i % 360] * (long)w2 / costScale) + cx;
411: y = ((long)sint[i % 360] * (long)h2 / sintScale) + cy;
412: if(i==s || i==e)
413: Line(cx, cy, x, y, color);
414: if (i != s) {
415: Line(lx, ly, x, y, color);
416: }
417: lx = x;
418: ly = y;
419: }
420: }
1.11 parser 421:
422:
1.1 paf 423:
1.2 paf 424: void gdImage::FillToBorder(int x, int y, int border, int color)
1.1 paf 425: {
1.4 paf 426: if(!BoundsSafe(x, y)) //PAF
427: return;
428:
1.1 paf 429: int lastBorder;
430: /* Seek left */
431: int leftLimit, rightLimit;
432: int i;
433: leftLimit = (-1);
434: if (border < 0) {
435: /* Refuse to fill to a non-solid border */
436: return;
437: }
438: for (i = x; (i >= 0); i--) {
1.2 paf 439: if (GetPixel(i, y) == border) {
1.1 paf 440: break;
441: }
1.2 paf 442: SetPixel(i, y, color);
1.1 paf 443: leftLimit = i;
444: }
445: if (leftLimit == (-1)) {
446: return;
447: }
448: /* Seek right */
449: rightLimit = x;
1.2 paf 450: for (i = (x+1); (i < sx); i++) {
451: if (GetPixel(i, y) == border) {
1.1 paf 452: break;
453: }
1.2 paf 454: SetPixel(i, y, color);
1.1 paf 455: rightLimit = i;
456: }
457: /* Look at lines above and below and start paints */
458: /* Above */
459: if (y > 0) {
460: lastBorder = 1;
461: for (i = leftLimit; (i <= rightLimit); i++) {
462: int c;
1.2 paf 463: c = GetPixel(i, y-1);
1.1 paf 464: if (lastBorder) {
465: if ((c != border) && (c != color)) {
1.2 paf 466: FillToBorder(i, y-1,
1.1 paf 467: border, color);
468: lastBorder = 0;
469: }
470: } else if ((c == border) || (c == color)) {
471: lastBorder = 1;
472: }
473: }
474: }
475: /* Below */
1.2 paf 476: if (y < ((sy) - 1)) {
1.1 paf 477: lastBorder = 1;
478: for (i = leftLimit; (i <= rightLimit); i++) {
479: int c;
1.2 paf 480: c = GetPixel(i, y+1);
1.1 paf 481: if (lastBorder) {
482: if ((c != border) && (c != color)) {
1.2 paf 483: FillToBorder(i, y+1,
1.1 paf 484: border, color);
485: lastBorder = 0;
486: }
487: } else if ((c == border) || (c == color)) {
488: lastBorder = 1;
489: }
490: }
491: }
492: }
493:
1.2 paf 494: void gdImage::Fill(int x, int y, int color)
1.1 paf 495: {
1.4 paf 496: if(!BoundsSafe(x, y)) //PAF
497: return;
498:
1.1 paf 499: int lastBorder;
500: int old;
501: int leftLimit, rightLimit;
502: int i;
1.2 paf 503: old = GetPixel(x, y);
1.1 paf 504: if (old == color) {
505: /* Nothing to be done */
506: return;
507: }
508: /* Seek left */
509: leftLimit = (-1);
510: for (i = x; (i >= 0); i--) {
1.2 paf 511: if (GetPixel(i, y) != old) {
1.1 paf 512: break;
513: }
1.2 paf 514: SetPixel(i, y, color);
1.1 paf 515: leftLimit = i;
516: }
517: if (leftLimit == (-1)) {
518: return;
519: }
520: /* Seek right */
521: rightLimit = x;
1.2 paf 522: for (i = (x+1); (i < sx); i++) {
523: if (GetPixel(i, y) != old) {
1.1 paf 524: break;
525: }
1.2 paf 526: SetPixel(i, y, color);
1.1 paf 527: rightLimit = i;
528: }
529: /* Look at lines above and below and start paints */
530: /* Above */
531: if (y > 0) {
532: lastBorder = 1;
533: for (i = leftLimit; (i <= rightLimit); i++) {
534: int c;
1.2 paf 535: c = GetPixel(i, y-1);
1.1 paf 536: if (lastBorder) {
537: if (c == old) {
1.2 paf 538: Fill(i, y-1, color);
1.1 paf 539: lastBorder = 0;
540: }
541: } else if (c != old) {
542: lastBorder = 1;
543: }
544: }
545: }
546: /* Below */
1.2 paf 547: if (y < ((sy) - 1)) {
1.1 paf 548: lastBorder = 1;
549: for (i = leftLimit; (i <= rightLimit); i++) {
550: int c;
1.2 paf 551: c = GetPixel(i, y+1);
1.1 paf 552: if (lastBorder) {
553: if (c == old) {
1.2 paf 554: Fill(i, y+1, color);
1.1 paf 555: lastBorder = 0;
556: }
557: } else if (c != old) {
558: lastBorder = 1;
559: }
560: }
561: }
562: }
563:
1.2 paf 564: void gdImage::Rectangle(int x1, int y1, int x2, int y2, int color)
1.1 paf 565: {
1.2 paf 566: Line(x1, y1, x2, y1, color);
567: Line(x1, y2, x2, y2, color);
568: Line(x1, y1, x1, y2, color);
569: Line(x2, y1, x2, y2, color);
1.1 paf 570: }
571:
1.2 paf 572: void gdImage::FilledRectangle(int x1, int y1, int x2, int y2, int color)
1.1 paf 573: {
1.10 parser 574: if(x1>x2) {
575: int t=x1;
576: x1=x2;
577: x2=t;
578: }
579: if(y1>y2) {
580: int t=y1;
581: y1=y2;
582: y2=t;
583: }
1.1 paf 584: int x, y;
1.10 parser 585:
1.2 paf 586: for (y=y1; (y<=y2); y++)
587: for (x=x1; (x<=x2); x++)
588: SetPixel(x, y, color);
1.1 paf 589: }
590:
1.2 paf 591: void gdImage::Copy(gdImage& dst, int dstX, int dstY, int srcX, int srcY, int w, int h)
1.1 paf 592: {
593: int c;
594: int x, y;
595: int tox, toy;
596: int i;
597: int colorMap[gdMaxColors];
598: for (i=0; (i<gdMaxColors); i++) {
599: colorMap[i] = (-1);
600: }
601: toy = dstY;
602: for (y=srcY; (y < (srcY + h)); y++) {
603: tox = dstX;
604: for (x=srcX; (x < (srcX + w)); x++) {
605: int nc;
1.2 paf 606: c = GetPixel(x, y);
1.1 paf 607: /* Added 7/24/95: support transparent copies */
1.2 paf 608: if (GetTransparent() == c) {
1.1 paf 609: tox++;
610: continue;
611: }
612: /* Have we established a mapping for this color? */
613: if (colorMap[c] == (-1)) {
614: /* If it's the same image, mapping is trivial */
1.2 paf 615: if (&dst == this) {
1.1 paf 616: nc = c;
617: } else {
618: /* First look for an exact match */
1.2 paf 619: nc = dst.ColorExact(
620: red[c], green[c],
621: blue[c]);
1.1 paf 622: }
623: if (nc == (-1)) {
624: /* No, so try to allocate it */
1.2 paf 625: nc = dst.ColorAllocate(
626: red[c], green[c],
627: blue[c]);
1.1 paf 628: /* If we're out of colors, go for the
629: closest color */
630: if (nc == (-1)) {
1.2 paf 631: nc = dst.ColorClosest(
632: red[c], green[c],
633: blue[c]);
1.1 paf 634: }
635: }
636: colorMap[c] = nc;
637: }
1.2 paf 638: dst.SetPixel(tox, toy, colorMap[c]);
1.1 paf 639: tox++;
640: }
641: toy++;
642: }
643: }
1.16 parser 644:
1.18 parser 645: static double round(double param) { return floor(param+0.5); }
646: void gdImage::CopyResampled(gdImage& dst,
647: int dstX, int dstY,
648: int srcX, int srcY,
649: int dstW, int dstH,
1.19 ! parser 650: int srcW, int srcH,
! 651: int tolerance)
1.16 parser 652: {
653: gdImage& src=*this;
654: int x, y;
1.18 parser 655: for (y = dstY; (y < dstY + dstH); y++) {
656: for (x = dstX; (x < dstX + dstW); x++) {
657: int pd = dst.GetPixel (x, y);
658: /* Added 7/24/95: support transparent copies */
659: if (src.GetTransparent() == pd)
660: continue;
661:
662: float sy1, sy2, sx1, sx2;
663: float sx, sy;
664: float spixels = 0;
665: float red = 0.0, green = 0.0, blue = 0.0;
666: sy1 = ((float) y - (float) dstY) * (float) srcH /
667: (float) dstH;
668: sy2 = ((float) (y + 1) - (float) dstY) * (float) srcH /
669: (float) dstH;
670: sy = sy1;
671: do
672: {
673: float yportion;
674: if (floor (sy) == floor (sy1))
675: {
676: yportion = 1.0 - (sy - floor (sy));
677: if (yportion > sy2 - sy1)
678: {
679: yportion = sy2 - sy1;
680: }
681: sy = floor (sy);
682: }
683: else if (sy == floor (sy2))
684: {
685: yportion = sy2 - floor (sy2);
686: }
687: else
688: {
689: yportion = 1.0;
690: }
691: sx1 = ((float) x - (float) dstX) * (float) srcW /
692: dstW;
693: sx2 = ((float) (x + 1) - (float) dstX) * (float) srcW /
694: dstW;
695: sx = sx1;
696: do
697: {
698: float xportion;
699: float pcontribution;
700: int p;
701: if (floor (sx) == floor (sx1))
702: {
703: xportion = 1.0 - (sx - floor (sx));
704: if (xportion > sx2 - sx1)
705: {
706: xportion = sx2 - sx1;
1.16 parser 707: }
1.18 parser 708: sx = floor (sx);
709: }
710: else if (sx == floor (sx2))
711: {
712: xportion = sx2 - floor (sx2);
1.16 parser 713: }
1.18 parser 714: else
715: {
716: xportion = 1.0;
717: }
718: pcontribution = xportion * yportion;
719: p = src.GetPixel (
720: (int) sx,
721: (int) sy);
722: red += Red (p) * pcontribution;
723: green += Green (p) * pcontribution;
724: blue += Blue (p) * pcontribution;
725: spixels += xportion * yportion;
726: sx += 1.0;
727: } while (sx < sx2);
728: sy += 1.0;
729: } while (sy < sy2);
730: if (spixels != 0.0) {
731: red /= spixels;
732: green /= spixels;
733: blue /= spixels;
734: }
735: /* Clamping to allow for rounding errors above */
736: if (red > 255.0)
737: red = 255.0;
738: if (green > 255.0)
739: green = 255.0;
740: if (blue > 255.0)
741: blue = 255.0;
742:
743: red=round(red);
744: green=round(green);
745: blue=round(blue);
746: /* First look for an exact match */
747: int nc = dst.ColorExact(red, green, blue);
748: if (nc == (-1)) {
749: /* No, so go for the closest color with high tolerance */
1.19 ! parser 750: nc = dst.ColorClosest(red, green, blue, tolerance);
1.18 parser 751: if (nc == (-1)) {
752: /* Not found with even high tolerance, so try to allocate it */
753: nc = dst.ColorAllocate(red, green,blue);
754:
755: /* If we're out of colors, go for the closest color */
756: if (nc == (-1))
757: nc = dst.ColorClosest(red, green, blue);
1.16 parser 758: }
759: }
1.18 parser 760: dst.SetPixel(x, y, nc);
1.16 parser 761: }
1.18 parser 762: }
1.16 parser 763: }
1.1 paf 764:
1.2 paf 765: static int gdGetWord(int *result, FILE *in)
1.1 paf 766: {
767: int r;
768: r = getc(in);
769: if (r == EOF) {
770: return 0;
771: }
772: *result = r << 8;
773: r = getc(in);
774: if (r == EOF) {
775: return 0;
776: }
777: *result += r;
778: return 1;
779: }
780:
1.2 paf 781: static void gdPutWord(int w, FILE *out)
1.1 paf 782: {
783: putc((unsigned char)(w >> 8), out);
784: putc((unsigned char)(w & 0xFF), out);
785: }
786:
1.2 paf 787: static int gdGetByte(int *result, FILE *in)
1.1 paf 788: {
789: int r;
790: r = getc(in);
791: if (r == EOF) {
792: return 0;
793: }
794: *result = r;
795: return 1;
796: }
797:
1.6 parser 798: void gdImage::Polygon(Point *p, int n, int c, bool closed)
1.1 paf 799: {
800: int i;
801: int lx, ly;
802: if (!n) {
803: return;
804: }
805: lx = p->x;
806: ly = p->y;
1.6 parser 807: if(closed)
808: Line(lx, ly, p[n-1].x, p[n-1].y, c);
1.1 paf 809: for (i=1; (i < n); i++) {
810: p++;
1.2 paf 811: Line(lx, ly, p->x, p->y, c);
1.1 paf 812: lx = p->x;
813: ly = p->y;
814: }
815: }
816:
1.5 paf 817: static int gdCompareInt(const void *a, const void *b)
818: {
819: return (*(const int *)a) - (*(const int *)b);
820: }
821:
822:
1.1 paf 823:
1.2 paf 824: void gdImage::FilledPolygon(Point *p, int n, int c)
1.1 paf 825: {
826: int i;
827: int y;
828: int y1, y2;
829: int ints;
830: if (!n) {
831: return;
832: }
1.2 paf 833: if (!polyAllocated) {
834: polyInts = (int *) malloc(sizeof(int) * n);
835: polyAllocated = n;
1.1 paf 836: }
1.2 paf 837: if (polyAllocated < n) {
838: while (polyAllocated < n) {
839: polyAllocated *= 2;
1.1 paf 840: }
1.2 paf 841: polyInts = (int *) realloc(polyInts,
842: sizeof(int) * polyAllocated);
1.1 paf 843: }
844: y1 = p[0].y;
845: y2 = p[0].y;
846: for (i=1; (i < n); i++) {
847: if (p[i].y < y1) {
848: y1 = p[i].y;
849: }
850: if (p[i].y > y2) {
851: y2 = p[i].y;
852: }
853: }
854: for (y=y1; (y <= y2); y++) {
855: int interLast = 0;
856: int dirLast = 0;
857: int interFirst = 1;
858: ints = 0;
859: for (i=0; (i <= n); i++) {
860: int x1, x2;
861: int y1, y2;
862: int dir;
863: int ind1, ind2;
864: int lastInd1 = 0;
865: if ((i == n) || (!i)) {
866: ind1 = n-1;
867: ind2 = 0;
868: } else {
869: ind1 = i-1;
870: ind2 = i;
871: }
872: y1 = p[ind1].y;
873: y2 = p[ind2].y;
874: if (y1 < y2) {
875: y1 = p[ind1].y;
876: y2 = p[ind2].y;
877: x1 = p[ind1].x;
878: x2 = p[ind2].x;
879: dir = -1;
880: } else if (y1 > y2) {
881: y2 = p[ind1].y;
882: y1 = p[ind2].y;
883: x2 = p[ind1].x;
884: x1 = p[ind2].x;
885: dir = 1;
886: } else {
887: /* Horizontal; just draw it */
1.2 paf 888: Line(
1.1 paf 889: p[ind1].x, y1,
890: p[ind2].x, y1,
891: c);
892: continue;
893: }
894: if ((y >= y1) && (y <= y2)) {
895: int inter =
896: (y-y1) * (x2-x1) / (y2-y1) + x1;
897: /* Only count intersections once
898: except at maxima and minima. Also,
899: if two consecutive intersections are
900: endpoints of the same horizontal line
901: that is not at a maxima or minima,
902: discard the leftmost of the two. */
903: if (!interFirst) {
904: if ((p[ind1].y == p[lastInd1].y) &&
905: (p[ind1].x != p[lastInd1].x)) {
906: if (dir == dirLast) {
907: if (inter > interLast) {
908: /* Replace the old one */
1.2 paf 909: polyInts[ints] = inter;
1.1 paf 910: } else {
911: /* Discard this one */
912: }
913: continue;
914: }
915: }
916: if (inter == interLast) {
917: if (dir == dirLast) {
918: continue;
919: }
920: }
921: }
922: if (i > 0) {
1.2 paf 923: polyInts[ints++] = inter;
1.1 paf 924: }
925: lastInd1 = i;
926: dirLast = dir;
927: interLast = inter;
928: interFirst = 0;
929: }
930: }
1.2 paf 931: qsort(polyInts, ints, sizeof(int), gdCompareInt);
932: for (i=0; (i < (ints-1)); i+=2)
933: Line(polyInts[i], y, polyInts[i+1], y, c);
1.1 paf 934: }
935: }
936:
1.2 paf 937: //001005paf this used in drawing straight lines in gdImage::FilledPolygonReplaceColor
938: void gdImage::LineReplaceColor(int x1, int y1, int x2, int y2, int a, int b) {
1.1 paf 939: if(y1!=y2)
940: return;
941:
942: for(int x=x1; x<=x2; x++) {
1.2 paf 943: unsigned char *pixel=&pixels[x][y1];
1.1 paf 944: if(*pixel==a)
945: *pixel=b;
946: }
947: }
948:
1.2 paf 949: void gdImage::FilledPolygonReplaceColor(Point *p, int n, int a, int b)
1.1 paf 950: {
951: int i;
952: int y;
953: int y1, y2;
954: int ints;
955: if (!n) {
956: return;
957: }
1.2 paf 958: if (!polyAllocated) {
959: polyInts = (int *) malloc(sizeof(int) * n);
960: polyAllocated = n;
1.1 paf 961: }
1.2 paf 962: if (polyAllocated < n) {
963: while (polyAllocated < n) {
964: polyAllocated *= 2;
1.1 paf 965: }
1.2 paf 966: polyInts = (int *) realloc(polyInts,
967: sizeof(int) * polyAllocated);
1.1 paf 968: }
969: y1 = p[0].y;
970: y2 = p[0].y;
971: for (i=1; (i < n); i++) {
972: if (p[i].y < y1) {
973: y1 = p[i].y;
974: }
975: if (p[i].y > y2) {
976: y2 = p[i].y;
977: }
978: }
979: for (y=y1; (y <= y2); y++) {
980: int interLast = 0;
981: int dirLast = 0;
982: int interFirst = 1;
983: ints = 0;
984: for (i=0; (i <= n); i++) {
985: int x1, x2;
986: int y1, y2;
987: int dir;
988: int ind1, ind2;
989: int lastInd1 = 0;
990: if ((i == n) || (!i)) {
991: ind1 = n-1;
992: ind2 = 0;
993: } else {
994: ind1 = i-1;
995: ind2 = i;
996: }
997: y1 = p[ind1].y;
998: y2 = p[ind2].y;
999: if (y1 < y2) {
1000: y1 = p[ind1].y;
1001: y2 = p[ind2].y;
1002: x1 = p[ind1].x;
1003: x2 = p[ind2].x;
1004: dir = -1;
1005: } else if (y1 > y2) {
1006: y2 = p[ind1].y;
1007: y1 = p[ind2].y;
1008: x2 = p[ind1].x;
1009: x1 = p[ind2].x;
1010: dir = 1;
1011: } else {
1012: /* Horizontal; just draw it */
1.2 paf 1013: LineReplaceColor(
1.1 paf 1014: p[ind1].x, y1,
1015: p[ind2].x, y1,
1016: a,b);
1017: continue;
1018: }
1019: if ((y >= y1) && (y <= y2)) {
1020: int inter =
1021: (y-y1) * (x2-x1) / (y2-y1) + x1;
1022: /* Only count intersections once
1023: except at maxima and minima. Also,
1024: if two consecutive intersections are
1025: endpoints of the same horizontal line
1026: that is not at a maxima or minima,
1027: discard the leftmost of the two. */
1028: if (!interFirst) {
1029: if ((p[ind1].y == p[lastInd1].y) &&
1030: (p[ind1].x != p[lastInd1].x)) {
1031: if (dir == dirLast) {
1032: if (inter > interLast) {
1033: /* Replace the old one */
1.2 paf 1034: polyInts[ints] = inter;
1.1 paf 1035: } else {
1036: /* Discard this one */
1037: }
1038: continue;
1039: }
1040: }
1041: if (inter == interLast) {
1042: if (dir == dirLast) {
1043: continue;
1044: }
1045: }
1046: }
1047: if (i > 0) {
1.2 paf 1048: polyInts[ints++] = inter;
1.1 paf 1049: }
1050: lastInd1 = i;
1051: dirLast = dir;
1052: interLast = inter;
1053: interFirst = 0;
1054: }
1055: }
1.2 paf 1056: qsort(polyInts, ints, sizeof(int), gdCompareInt);
1.1 paf 1057: for (i=0; (i < (ints-1)); i+=2) {
1.2 paf 1058: LineReplaceColor(polyInts[i], y,
1059: polyInts[i+1], y, a,b);
1.1 paf 1060: }
1061: }
1062: }
1063:
1.2 paf 1064: void gdImage::SetInterlace(int interlaceArg)
1.1 paf 1065: {
1.2 paf 1066: interlace = interlaceArg;
1.1 paf 1067: }
1068:
1.6 parser 1069: void gdImage::SetLineWidth(int width)
1070: {
1071: lineWidth=width;
1072: }
1073:
1074: void gdImage::SetLineStyle(const char *alineStyle)
1.1 paf 1075: {
1.6 parser 1076: lineStyle=alineStyle;
1.1 paf 1077: }
1078: