1 #include <lib/gdi/gpixmap.h>
2 #include <lib/gdi/region.h>
11 gLookup::gLookup(int size, const gPalette &pal, const gRGB &start, const gRGB &end)
14 build(size, pal, start, end);
17 void gLookup::build(int _size, const gPalette &pal, const gRGB &start, const gRGB &end)
28 lookup=new gColor[size];
30 for (int i=0; i<size; i++)
35 int rdiff=-start.r+end.r;
36 int gdiff=-start.g+end.g;
37 int bdiff=-start.b+end.b;
38 int adiff=-start.a+end.a;
39 rdiff*=i; rdiff/=(size-1);
40 gdiff*=i; gdiff/=(size-1);
41 bdiff*=i; bdiff/=(size-1);
42 adiff*=i; adiff/=(size-1);
49 lookup[i]=pal.findColor(col);
57 gSurfaceSystem::gSurfaceSystem(eSize size, int _bpp)
71 case 24: // never use 24bit mode
82 clut.data=new gRGB[clut.colors];
88 data=malloc(x*y*bypp);
91 gSurfaceSystem::~gSurfaceSystem()
97 gPixmap *gPixmap::lock()
103 void gPixmap::unlock()
105 contentlock.unlock(1);
108 void gPixmap::fill(const gRegion ®ion, const gColor &color)
111 for (i=0; i<region.rects.size(); ++i)
113 const eRect &area = region.rects[i];
114 if ((area.height()<=0) || (area.width()<=0))
116 if (surface->bpp == 8)
118 for (int y=area.top(); y<area.bottom(); y++)
119 memset(((__u8*)surface->data)+y*surface->stride+area.left(), color.color, area.width());
120 } else if (surface->bpp == 32)
121 for (int y=area.top(); y<area.bottom(); y++)
123 __u32 *dst=(__u32*)(((__u8*)surface->data)+y*surface->stride+area.left()*surface->bypp);
127 if (surface->clut.data && color < surface->clut.colors)
128 col=(surface->clut.data[color].a<<24)|(surface->clut.data[color].r<<16)|(surface->clut.data[color].g<<8)|(surface->clut.data[color].b);
136 eWarning("couldn't fill %d bpp", surface->bpp);
140 void gPixmap::blit(const gPixmap &src, ePoint pos, const gRegion &clip, int flag)
142 for (int i=0; i<clip.rects.size(); ++i)
144 eRect area=eRect(pos, src.getSize());
146 area&=eRect(ePoint(0, 0), getSize());
147 if ((area.width()<0) || (area.height()<0))
151 srcarea.moveBy(-pos.x(), -pos.y());
153 if ((surface->bpp == 8) && (src.surface->bpp==8))
155 __u8 *srcptr=(__u8*)src.surface->data;
156 __u8 *dstptr=(__u8*)surface->data;
158 srcptr+=srcarea.left()*surface->bypp+srcarea.top()*src.surface->stride;
159 dstptr+=area.left()*surface->bypp+area.top()*surface->stride;
160 for (int y=0; y<area.height(); y++)
162 if (flag & blitAlphaTest)
164 // no real alphatest yet
165 int width=area.width();
166 unsigned char *src=(unsigned char*)srcptr;
167 unsigned char *dst=(unsigned char*)dstptr;
168 // use duff's device here!
179 memcpy(dstptr, srcptr, area.width()*surface->bypp);
180 srcptr+=src.surface->stride;
181 dstptr+=surface->stride;
183 } else if ((surface->bpp == 32) && (src.surface->bpp==8))
185 __u8 *srcptr=(__u8*)src.surface->data;
186 __u8 *dstptr=(__u8*)surface->data; // !!
189 for (int i=0; i<256; ++i)
191 if (src.surface->clut.data && (i<src.surface->clut.colors))
192 pal[i]=(src.surface->clut.data[i].a<<24)|(src.surface->clut.data[i].r<<16)|(src.surface->clut.data[i].g<<8)|(src.surface->clut.data[i].b);
198 srcptr+=srcarea.left()*surface->bypp+srcarea.top()*src.surface->stride;
199 dstptr+=area.left()*surface->bypp+area.top()*surface->stride;
200 for (int y=0; y<area.height(); y++)
202 if (flag & blitAlphaTest)
204 // no real alphatest yet
205 int width=area.width();
206 unsigned char *src=(unsigned char*)srcptr;
207 __u32 *dst=(__u32*)dstptr;
208 // use duff's device here!
220 int width=area.width();
221 unsigned char *src=(unsigned char*)srcptr;
222 __u32 *dst=(__u32*)dstptr;
226 srcptr+=src.surface->stride;
227 dstptr+=surface->stride;
230 eFatal("cannot blit %dbpp from %dbpp", surface->bpp, src.surface->bpp);
234 void gPixmap::mergePalette(const gPixmap &target)
236 if ((!surface->clut.colors) || (!target.surface->clut.colors))
238 gColor *lookup=new gColor[surface->clut.colors];
240 for (int i=0; i<surface->clut.colors; i++)
241 lookup[i].color=target.surface->clut.findColor(surface->clut.data[i]);
243 delete [] surface->clut.data;
244 surface->clut.colors=target.surface->clut.colors;
245 surface->clut.data=new gRGB[surface->clut.colors];
246 memcpy(surface->clut.data, target.surface->clut.data, sizeof(gRGB)*surface->clut.colors);
248 __u8 *dstptr=(__u8*)surface->data;
250 for (int ay=0; ay<surface->y; ay++)
252 for (int ax=0; ax<surface->x; ax++)
253 dstptr[ax]=lookup[dstptr[ax]];
254 dstptr+=surface->stride;
260 static inline int sgn(int a)
270 void gPixmap::line(const gRegion &clip, ePoint start, ePoint dst, gColor color)
272 __u8 *srf = (__u8*)surface->data;
273 int stride = surface->stride;
275 if (clip.rects.empty())
278 int xa = start.x(), ya = start.y(), xb = dst.x(), yb = dst.y();
279 int dx, dy, x, y, s1, s2, e, temp, swap, i;
298 /* i don't like this clipping loop, but the only */
299 /* other choice i see is to calculate the intersections */
300 /* before iterating through the pixels. */
302 /* one could optimize this because of the ordering */
308 /* if last pixel was invisble, first check bounding box */
311 /* check if we just got into the bbox again */
312 if (clip.extends.contains(x, y))
316 } else if (!clip.rects[a].contains(x, y))
321 if (a == clip.rects.size())
328 } while (!clip.rects[a].contains(x, y));
331 srf[y * stride + x] = color;
347 gColor gPalette::findColor(const gRGB &rgb) const
349 int difference=1<<30, best_choice=0;
350 for (int t=0; t<colors; t++)
353 int td=(signed)(rgb.r-data[t].r); td*=td; td*=(255-data[t].a);
357 td=(signed)(rgb.g-data[t].g); td*=td; td*=(255-data[t].a);
361 td=(signed)(rgb.b-data[t].b); td*=td; td*=(255-data[t].a);
365 td=(signed)(rgb.a-data[t].a); td*=td; td*=255;
381 gPixmap::gPixmap(gSurface *surface): surface(surface)
385 gPixmap::gPixmap(eSize size, int bpp)
387 surface = new gSurfaceSystem(size, bpp);