Você não pode selecionar mais de 25 tópicos Os tópicos devem começar com uma letra ou um número, podem incluir traços ('-') e podem ter até 35 caracteres.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997
  1. /*
  2. * libcucul Unicode canvas library
  3. * Copyright (c) 2002-2006 Sam Hocevar <sam@zoy.org>
  4. * All Rights Reserved
  5. *
  6. * This library is free software; you can redistribute it and/or
  7. * modify it under the terms of the Do What The Fuck You Want To
  8. * Public License, Version 2, as published by Sam Hocevar. See
  9. * http://sam.zoy.org/wtfpl/COPYING for more details.
  10. */
  11. /** \file bitmap.c
  12. * \version \$Id$
  13. * \author Sam Hocevar <sam@zoy.org>
  14. * \brief Bitmap blitting
  15. *
  16. * This file contains bitmap blitting functions.
  17. */
  18. #include "config.h"
  19. #if !defined(__KERNEL__)
  20. # if defined(HAVE_ENDIAN_H)
  21. # include <endian.h>
  22. # endif
  23. # include <stdio.h>
  24. # include <stdlib.h>
  25. # include <limits.h>
  26. # include <string.h>
  27. #endif
  28. #include "cucul.h"
  29. #include "cucul_internals.h"
  30. #define CP437 0
  31. /*
  32. * Local variables
  33. */
  34. #if !defined(_DOXYGEN_SKIP_ME)
  35. # define LOOKUP_VAL 32
  36. # define LOOKUP_SAT 32
  37. # define LOOKUP_HUE 16
  38. #endif
  39. static unsigned char hsv_distances[LOOKUP_VAL][LOOKUP_SAT][LOOKUP_HUE];
  40. static enum cucul_color lookup_colors[8];
  41. static int const hsv_palette[] =
  42. {
  43. /* weight, hue, saturation, value */
  44. 4, 0x0, 0x0, 0x0, /* black */
  45. 5, 0x0, 0x0, 0x5ff, /* 30% */
  46. 5, 0x0, 0x0, 0x9ff, /* 70% */
  47. 4, 0x0, 0x0, 0xfff, /* white */
  48. 3, 0x1000, 0xfff, 0x5ff, /* dark yellow */
  49. 2, 0x1000, 0xfff, 0xfff, /* light yellow */
  50. 3, 0x0, 0xfff, 0x5ff, /* dark red */
  51. 2, 0x0, 0xfff, 0xfff /* light red */
  52. };
  53. /* RGB palette for the new colour picker */
  54. static int const rgb_palette[] =
  55. {
  56. 0x0, 0x0, 0x0,
  57. 0x0, 0x0, 0x7ff,
  58. 0x0, 0x7ff, 0x0,
  59. 0x0, 0x7ff, 0x7ff,
  60. 0x7ff, 0x0, 0x0,
  61. 0x7ff, 0x0, 0x7ff,
  62. 0x7ff, 0x7ff, 0x0,
  63. 0xaaa, 0xaaa, 0xaaa,
  64. 0x555, 0x555, 0x555,
  65. 0x000, 0x000, 0xfff,
  66. 0x000, 0xfff, 0x000,
  67. 0x000, 0xfff, 0xfff,
  68. 0xfff, 0x000, 0x000,
  69. 0xfff, 0x000, 0xfff,
  70. 0xfff, 0xfff, 0x000,
  71. 0xfff, 0xfff, 0xfff,
  72. };
  73. static int const rgb_weight[] =
  74. {
  75. //2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2
  76. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
  77. };
  78. #if !defined(_DOXYGEN_SKIP_ME)
  79. #define HSV_XRATIO 6
  80. #define HSV_YRATIO 3
  81. #define HSV_HRATIO 3
  82. #define HSV_DISTANCE(h, s, v, index) \
  83. (hsv_palette[index * 4] \
  84. * ((HSV_XRATIO * ((v) - hsv_palette[index * 4 + 3]) \
  85. * ((v) - hsv_palette[index * 4 + 3])) \
  86. + (hsv_palette[index * 4 + 3] \
  87. ? (HSV_YRATIO * ((s) - hsv_palette[index * 4 + 2]) \
  88. * ((s) - hsv_palette[index * 4 + 2])) \
  89. : 0) \
  90. + (hsv_palette[index * 4 + 2] \
  91. ? (HSV_HRATIO * ((h) - hsv_palette[index * 4 + 1]) \
  92. * ((h) - hsv_palette[index * 4 + 1])) \
  93. : 0)))
  94. #endif
  95. /*
  96. * Local prototypes
  97. */
  98. static void mask2shift(unsigned int, int *, int *);
  99. static float gammapow(float x, float y);
  100. static void get_rgba_default(struct cucul_bitmap const *, uint8_t *, int, int,
  101. unsigned int *, unsigned int *, unsigned int *,
  102. unsigned int *);
  103. static inline void rgb2hsv_default(int, int, int, int *, int *, int *);
  104. static inline int sq(int);
  105. /* Dithering methods */
  106. static void init_no_dither(int);
  107. static unsigned int get_no_dither(void);
  108. static void increment_no_dither(void);
  109. static void init_ordered2_dither(int);
  110. static unsigned int get_ordered2_dither(void);
  111. static void increment_ordered2_dither(void);
  112. static void init_ordered4_dither(int);
  113. static unsigned int get_ordered4_dither(void);
  114. static void increment_ordered4_dither(void);
  115. static void init_ordered8_dither(int);
  116. static unsigned int get_ordered8_dither(void);
  117. static void increment_ordered8_dither(void);
  118. static void init_random_dither(int);
  119. static unsigned int get_random_dither(void);
  120. static void increment_random_dither(void);
  121. #if !defined(_DOXYGEN_SKIP_ME)
  122. struct cucul_bitmap
  123. {
  124. int bpp, has_palette, has_alpha;
  125. int w, h, pitch;
  126. int rmask, gmask, bmask, amask;
  127. int rright, gright, bright, aright;
  128. int rleft, gleft, bleft, aleft;
  129. void (*get_hsv)(struct cucul_bitmap *, char *, int, int);
  130. int red[256], green[256], blue[256], alpha[256];
  131. float gamma;
  132. int gammatab[4097];
  133. };
  134. #endif
  135. static void mask2shift(unsigned int mask, int *right, int *left)
  136. {
  137. int rshift = 0, lshift = 0;
  138. if(!mask)
  139. {
  140. *right = *left = 0;
  141. return;
  142. }
  143. while(!(mask & 1))
  144. {
  145. mask >>= 1;
  146. rshift++;
  147. }
  148. *right = rshift;
  149. while(mask & 1)
  150. {
  151. mask >>= 1;
  152. lshift++;
  153. }
  154. *left = 12 - lshift;
  155. }
  156. static float gammapow(float x, float y)
  157. {
  158. #ifdef HAVE_FLDLN2
  159. register double logx;
  160. register long double v, e;
  161. #else
  162. register float tmp, t, t2, r;
  163. int i;
  164. #endif
  165. if(x == 0.0)
  166. return y == 0.0 ? 1.0 : 0.0;
  167. #ifdef HAVE_FLDLN2
  168. /* FIXME: this can be optimised by directly calling fyl2x for x and y */
  169. asm volatile("fldln2; fxch; fyl2x"
  170. : "=t" (logx) : "0" (x) : "st(1)");
  171. asm volatile("fldl2e\n\t"
  172. "fmul %%st(1)\n\t"
  173. "fst %%st(1)\n\t"
  174. "frndint\n\t"
  175. "fxch\n\t"
  176. "fsub %%st(1)\n\t"
  177. "f2xm1\n\t"
  178. : "=t" (v), "=u" (e) : "0" (y * logx));
  179. v += 1.0;
  180. asm volatile("fscale"
  181. : "=t" (v) : "0" (v), "u" (e));
  182. return v;
  183. #else
  184. /* Compute ln(x) for x ∈ ]0,1]
  185. * ln(x) = 2 * (t + t^3/3 + t^5/5 + ...) with t = (x-1)/(x+1)
  186. * The convergence is a bit slow, especially when x is near 0. */
  187. t = (x - 1.0) / (x + 1.0);
  188. t2 = t * t;
  189. tmp = r = t;
  190. for(i = 3; i < 20; i += 2)
  191. {
  192. r *= t2;
  193. tmp += r / i;
  194. }
  195. /* Compute -y*ln(x) */
  196. tmp = - y * 2.0 * tmp;
  197. /* Compute x^-y as e^t where t = -y*ln(x):
  198. * e^t = 1 + t/1! + t^2/2! + t^3/3! + t^4/4! + t^5/5! ...
  199. * The convergence is quite faster here, thanks to the factorial. */
  200. r = t = tmp;
  201. tmp = 1.0 + t;
  202. for(i = 2; i < 16; i++)
  203. {
  204. r = r * t / i;
  205. tmp += r;
  206. }
  207. /* Return x^y as 1/(x^-y) */
  208. return 1.0 / tmp;
  209. #endif
  210. }
  211. /**
  212. * \brief Create an internal bitmap object.
  213. *
  214. * Create a bitmap structure from its coordinates (depth, width, height and
  215. * pitch) and pixel mask values. If the depth is 8 bits per pixel, the mask
  216. * values are ignored and the colour palette should be set using the
  217. * cucul_set_bitmap_palette() function. For depths greater than 8 bits per
  218. * pixel, a zero alpha mask causes the alpha values to be ignored.
  219. *
  220. * \param bpp Bitmap depth in bits per pixel.
  221. * \param w Bitmap width in pixels.
  222. * \param h Bitmap height in pixels.
  223. * \param pitch Bitmap pitch in bytes.
  224. * \param rmask Bitmask for red values.
  225. * \param gmask Bitmask for green values.
  226. * \param bmask Bitmask for blue values.
  227. * \param amask Bitmask for alpha values.
  228. * \return Bitmap object, or NULL upon error.
  229. */
  230. struct cucul_bitmap *cucul_create_bitmap(cucul_t *qq,
  231. unsigned int bpp, unsigned int w,
  232. unsigned int h, unsigned int pitch,
  233. unsigned int rmask, unsigned int gmask,
  234. unsigned int bmask, unsigned int amask)
  235. {
  236. struct cucul_bitmap *bitmap;
  237. int i;
  238. /* Minor sanity test */
  239. if(!w || !h || !pitch || bpp > 32 || bpp < 8)
  240. return NULL;
  241. bitmap = malloc(sizeof(struct cucul_bitmap));
  242. if(!bitmap)
  243. return NULL;
  244. bitmap->bpp = bpp;
  245. bitmap->has_palette = 0;
  246. bitmap->has_alpha = amask ? 1 : 0;
  247. bitmap->w = w;
  248. bitmap->h = h;
  249. bitmap->pitch = pitch;
  250. bitmap->rmask = rmask;
  251. bitmap->gmask = gmask;
  252. bitmap->bmask = bmask;
  253. bitmap->amask = amask;
  254. /* Load bitmasks */
  255. if(rmask || gmask || bmask || amask)
  256. {
  257. mask2shift(rmask, &bitmap->rright, &bitmap->rleft);
  258. mask2shift(gmask, &bitmap->gright, &bitmap->gleft);
  259. mask2shift(bmask, &bitmap->bright, &bitmap->bleft);
  260. mask2shift(amask, &bitmap->aright, &bitmap->aleft);
  261. }
  262. /* In 8 bpp mode, default to a grayscale palette */
  263. if(bpp == 8)
  264. {
  265. bitmap->has_palette = 1;
  266. bitmap->has_alpha = 0;
  267. for(i = 0; i < 256; i++)
  268. {
  269. bitmap->red[i] = i * 0xfff / 256;
  270. bitmap->green[i] = i * 0xfff / 256;
  271. bitmap->blue[i] = i * 0xfff / 256;
  272. }
  273. }
  274. /* Default gamma value */
  275. for(i = 0; i < 4096; i++)
  276. bitmap->gammatab[i] = i;
  277. return bitmap;
  278. }
  279. /**
  280. * \brief Set the palette of an 8bpp bitmap object.
  281. *
  282. * Set the palette of an 8 bits per pixel bitmap. Values should be between
  283. * 0 and 4095 (0xfff).
  284. *
  285. * \param bitmap Bitmap object.
  286. * \param red Array of 256 red values.
  287. * \param green Array of 256 green values.
  288. * \param blue Array of 256 blue values.
  289. * \param alpha Array of 256 alpha values.
  290. */
  291. void cucul_set_bitmap_palette(struct cucul_bitmap *bitmap,
  292. unsigned int red[], unsigned int green[],
  293. unsigned int blue[], unsigned int alpha[])
  294. {
  295. int i, has_alpha = 0;
  296. if(bitmap->bpp != 8)
  297. return;
  298. for(i = 0; i < 256; i++)
  299. {
  300. if(red[i] >= 0 && red[i] < 0x1000 &&
  301. green[i] >= 0 && green[i] < 0x1000 &&
  302. blue[i] >= 0 && blue[i] < 0x1000 &&
  303. alpha[i] >= 0 && alpha[i] < 0x1000)
  304. {
  305. bitmap->red[i] = red[i];
  306. bitmap->green[i] = green[i];
  307. bitmap->blue[i] = blue[i];
  308. if(alpha[i])
  309. {
  310. bitmap->alpha[i] = alpha[i];
  311. has_alpha = 1;
  312. }
  313. }
  314. }
  315. bitmap->has_alpha = has_alpha;
  316. }
  317. /**
  318. * \brief Set the gamma of a bitmap object.
  319. *
  320. * Set the gamma of bitmap.
  321. *
  322. * \param bitmap Bitmap object.
  323. * \param gamma Gamma value.
  324. */
  325. void cucul_set_bitmap_gamma(struct cucul_bitmap *bitmap, float gamma)
  326. {
  327. int i;
  328. if(gamma <= 0.0)
  329. return;
  330. bitmap->gamma = gamma;
  331. for(i = 0; i < 4096; i++)
  332. bitmap->gammatab[i] = 4096.0 * gammapow((float)i / 4096.0, 1.0 / gamma);
  333. }
  334. /**
  335. * \brief Free the memory associated with a bitmap.
  336. *
  337. * Free the memory allocated by cucul_create_bitmap().
  338. *
  339. * \param bitmap Bitmap object.
  340. */
  341. void cucul_free_bitmap(struct cucul_bitmap *bitmap)
  342. {
  343. if(!bitmap)
  344. return;
  345. free(bitmap);
  346. }
  347. static void get_rgba_default(struct cucul_bitmap const *bitmap, uint8_t *pixels,
  348. int x, int y, unsigned int *r, unsigned int *g,
  349. unsigned int *b, unsigned int *a)
  350. {
  351. uint32_t bits;
  352. pixels += (bitmap->bpp / 8) * x + bitmap->pitch * y;
  353. switch(bitmap->bpp / 8)
  354. {
  355. case 4:
  356. bits = *(uint32_t *)pixels;
  357. break;
  358. case 3:
  359. {
  360. #if defined(HAVE_ENDIAN_H)
  361. if(__BYTE_ORDER == __BIG_ENDIAN)
  362. #else
  363. /* This is compile-time optimised with at least -O1 or -Os */
  364. uint32_t const rmask = 0x12345678;
  365. if(*(uint8_t const *)&rmask == 0x12)
  366. #endif
  367. bits = ((uint32_t)pixels[0] << 16) |
  368. ((uint32_t)pixels[1] << 8) |
  369. ((uint32_t)pixels[2]);
  370. else
  371. bits = ((uint32_t)pixels[2] << 16) |
  372. ((uint32_t)pixels[1] << 8) |
  373. ((uint32_t)pixels[0]);
  374. break;
  375. }
  376. case 2:
  377. bits = *(uint16_t *)pixels;
  378. break;
  379. case 1:
  380. default:
  381. bits = pixels[0];
  382. break;
  383. }
  384. if(bitmap->has_palette)
  385. {
  386. *r += bitmap->gammatab[bitmap->red[bits]];
  387. *g += bitmap->gammatab[bitmap->green[bits]];
  388. *b += bitmap->gammatab[bitmap->blue[bits]];
  389. *a += bitmap->alpha[bits];
  390. }
  391. else
  392. {
  393. *r += bitmap->gammatab[((bits & bitmap->rmask) >> bitmap->rright) << bitmap->rleft];
  394. *g += bitmap->gammatab[((bits & bitmap->gmask) >> bitmap->gright) << bitmap->gleft];
  395. *b += bitmap->gammatab[((bits & bitmap->bmask) >> bitmap->bright) << bitmap->bleft];
  396. *a += ((bits & bitmap->amask) >> bitmap->aright) << bitmap->aleft;
  397. }
  398. }
  399. static inline void rgb2hsv_default(int r, int g, int b,
  400. int *hue, int *sat, int *val)
  401. {
  402. int min, max, delta;
  403. min = r; max = r;
  404. if(min > g) min = g; if(max < g) max = g;
  405. if(min > b) min = b; if(max < b) max = b;
  406. delta = max - min; /* 0 - 0xfff */
  407. *val = max; /* 0 - 0xfff */
  408. if(delta)
  409. {
  410. *sat = 0xfff * delta / max; /* 0 - 0xfff */
  411. /* Generate *hue between 0 and 0x5fff */
  412. if( r == max )
  413. *hue = 0x1000 + 0x1000 * (g - b) / delta;
  414. else if( g == max )
  415. *hue = 0x3000 + 0x1000 * (b - r) / delta;
  416. else
  417. *hue = 0x5000 + 0x1000 * (r - g) / delta;
  418. }
  419. else
  420. {
  421. *sat = 0;
  422. *hue = 0;
  423. }
  424. }
  425. static inline int sq(int x)
  426. {
  427. return x * x;
  428. }
  429. /**
  430. * \brief Draw a bitmap on the screen.
  431. *
  432. * Draw a bitmap at the given coordinates. The bitmap can be of any size and
  433. * will be stretched to the text area.
  434. *
  435. * \param x1 X coordinate of the upper-left corner of the drawing area.
  436. * \param y1 Y coordinate of the upper-left corner of the drawing area.
  437. * \param x2 X coordinate of the lower-right corner of the drawing area.
  438. * \param y2 Y coordinate of the lower-right corner of the drawing area.
  439. * \param bitmap Bitmap object to be drawn.
  440. * \param pixels Bitmap's pixels.
  441. */
  442. void cucul_draw_bitmap(cucul_t *qq, int x1, int y1, int x2, int y2,
  443. struct cucul_bitmap const *bitmap, void *pixels)
  444. {
  445. /* Current dithering method */
  446. void (*_init_dither) (int);
  447. unsigned int (*_get_dither) (void);
  448. void (*_increment_dither) (void);
  449. int *floyd_steinberg, *fs_r, *fs_g, *fs_b;
  450. int fs_length;
  451. /* FIXME: choose better characters! */
  452. #if !defined(_DOXYGEN_SKIP_ME)
  453. # define DCHMAX ((sizeof(density_chars)/sizeof(*density_chars)))
  454. #endif
  455. static char const * density_chars[] =
  456. {
  457. #if CP437
  458. " ", ":", "░", "▒", "?"
  459. /* "0", "1", "2", "3", "?" */
  460. #else
  461. " ", ".", ":", ";", "t", "%", "S", "X", "@", "8", "?"
  462. #endif
  463. };
  464. int x, y, w, h, pitch, deltax, deltay;
  465. if(!bitmap || !pixels)
  466. return;
  467. w = bitmap->w;
  468. h = bitmap->h;
  469. pitch = bitmap->pitch;
  470. if(x1 > x2)
  471. {
  472. int tmp = x2; x2 = x1; x1 = tmp;
  473. }
  474. if(y1 > y2)
  475. {
  476. int tmp = y2; y2 = y1; y1 = tmp;
  477. }
  478. deltax = x2 - x1 + 1;
  479. deltay = y2 - y1 + 1;
  480. switch(qq->dithering)
  481. {
  482. case CUCUL_DITHERING_NONE:
  483. _init_dither = init_no_dither;
  484. _get_dither = get_no_dither;
  485. _increment_dither = increment_no_dither;
  486. break;
  487. case CUCUL_DITHERING_ORDERED2:
  488. _init_dither = init_ordered2_dither;
  489. _get_dither = get_ordered2_dither;
  490. _increment_dither = increment_ordered2_dither;
  491. break;
  492. case CUCUL_DITHERING_ORDERED4:
  493. _init_dither = init_ordered4_dither;
  494. _get_dither = get_ordered4_dither;
  495. _increment_dither = increment_ordered4_dither;
  496. break;
  497. case CUCUL_DITHERING_ORDERED8:
  498. _init_dither = init_ordered8_dither;
  499. _get_dither = get_ordered8_dither;
  500. _increment_dither = increment_ordered8_dither;
  501. break;
  502. case CUCUL_DITHERING_RANDOM:
  503. _init_dither = init_random_dither;
  504. _get_dither = get_random_dither;
  505. _increment_dither = increment_random_dither;
  506. break;
  507. case CUCUL_DITHERING_FSTEIN:
  508. _init_dither = init_no_dither;
  509. _get_dither = get_no_dither;
  510. _increment_dither = increment_no_dither;
  511. break;
  512. default:
  513. /* Something wicked happened! */
  514. return;
  515. }
  516. fs_length = ((int)qq->width <= x2 ? (int)qq->width : x2) + 1;
  517. floyd_steinberg = malloc(3 * (fs_length + 2) * sizeof(int));
  518. memset(floyd_steinberg, 0, 3 * (fs_length + 2) * sizeof(int));
  519. fs_r = floyd_steinberg + 1;
  520. fs_g = fs_r + fs_length + 2;
  521. fs_b = fs_g + fs_length + 2;
  522. for(y = y1 > 0 ? y1 : 0; y <= y2 && y <= (int)qq->height; y++)
  523. {
  524. int remain_r = 0, remain_g = 0, remain_b = 0;
  525. for(x = x1 > 0 ? x1 : 0, _init_dither(y);
  526. x <= x2 && x <= (int)qq->width;
  527. x++)
  528. {
  529. unsigned int i;
  530. int ch = 0, distmin;
  531. unsigned int r, g, b, a;
  532. int fg_r = 0, fg_g = 0, fg_b = 0, bg_r, bg_g, bg_b;
  533. int fromx, fromy, tox, toy, myx, myy, dots, dist;
  534. int error[3];
  535. enum cucul_color outfg = 0, outbg = 0;
  536. char const *outch;
  537. r = g = b = a = 0;
  538. /* First get RGB */
  539. if(qq->antialiasing == CUCUL_ANTIALIASING_PREFILTER)
  540. {
  541. fromx = (x - x1) * w / deltax;
  542. fromy = (y - y1) * h / deltay;
  543. tox = (x - x1 + 1) * w / deltax;
  544. toy = (y - y1 + 1) * h / deltay;
  545. /* We want at least one pixel */
  546. if(tox == fromx) tox++;
  547. if(toy == fromy) toy++;
  548. dots = 0;
  549. for(myx = fromx; myx < tox; myx++)
  550. for(myy = fromy; myy < toy; myy++)
  551. {
  552. dots++;
  553. get_rgba_default(bitmap, pixels, myx, myy, &r, &g, &b, &a);
  554. }
  555. /* Normalize */
  556. r /= dots;
  557. g /= dots;
  558. b /= dots;
  559. a /= dots;
  560. }
  561. else
  562. {
  563. fromx = (x - x1) * w / deltax;
  564. fromy = (y - y1) * h / deltay;
  565. tox = (x - x1 + 1) * w / deltax;
  566. toy = (y - y1 + 1) * h / deltay;
  567. /* tox and toy can overflow the screen, but they cannot overflow
  568. * when averaged with fromx and fromy because these are guaranteed
  569. * to be within the pixel boundaries. */
  570. myx = (fromx + tox) / 2;
  571. myy = (fromy + toy) / 2;
  572. get_rgba_default(bitmap, pixels, myx, myy, &r, &g, &b, &a);
  573. }
  574. if(bitmap->has_alpha && a < 0x800)
  575. {
  576. remain_r = remain_g = remain_b = 0;
  577. fs_r[x] = 0;
  578. fs_g[x] = 0;
  579. fs_b[x] = 0;
  580. continue;
  581. }
  582. if(qq->dithering == CUCUL_DITHERING_FSTEIN)
  583. {
  584. r += remain_r;
  585. g += remain_g;
  586. b += remain_b;
  587. }
  588. else
  589. {
  590. r += (_get_dither() - 0x80) * 4;
  591. g += (_get_dither() - 0x80) * 4;
  592. b += (_get_dither() - 0x80) * 4;
  593. }
  594. distmin = INT_MAX;
  595. for(i = 0; i < 16; i++)
  596. {
  597. dist = sq(r - rgb_palette[i * 3])
  598. + sq(g - rgb_palette[i * 3 + 1])
  599. + sq(b - rgb_palette[i * 3 + 2]);
  600. dist *= rgb_weight[i];
  601. if(dist < distmin)
  602. {
  603. outbg = i;
  604. distmin = dist;
  605. }
  606. }
  607. bg_r = rgb_palette[outbg * 3];
  608. bg_g = rgb_palette[outbg * 3 + 1];
  609. bg_b = rgb_palette[outbg * 3 + 2];
  610. if(qq->background == CUCUL_BACKGROUND_SOLID)
  611. {
  612. distmin = INT_MAX;
  613. for(i = 0; i < 16; i++)
  614. {
  615. if(i == outbg)
  616. continue;
  617. dist = sq(r - rgb_palette[i * 3])
  618. + sq(g - rgb_palette[i * 3 + 1])
  619. + sq(b - rgb_palette[i * 3 + 2]);
  620. dist *= rgb_weight[i];
  621. if(dist < distmin)
  622. {
  623. outfg = i;
  624. distmin = dist;
  625. }
  626. }
  627. fg_r = rgb_palette[outfg * 3];
  628. fg_g = rgb_palette[outfg * 3 + 1];
  629. fg_b = rgb_palette[outfg * 3 + 2];
  630. distmin = INT_MAX;
  631. for(i = 0; i < DCHMAX - 1; i++)
  632. {
  633. int newr = i * fg_r + ((2*DCHMAX-1) - i) * bg_r;
  634. int newg = i * fg_g + ((2*DCHMAX-1) - i) * bg_g;
  635. int newb = i * fg_b + ((2*DCHMAX-1) - i) * bg_b;
  636. dist = abs(r * (2*DCHMAX-1) - newr)
  637. + abs(g * (2*DCHMAX-1) - newg)
  638. + abs(b * (2*DCHMAX-1) - newb);
  639. if(dist < distmin)
  640. {
  641. ch = i;
  642. distmin = dist;
  643. }
  644. }
  645. outch = density_chars[ch];
  646. if(qq->dithering == CUCUL_DITHERING_FSTEIN)
  647. {
  648. error[0] = r - (fg_r * ch + bg_r * ((2*DCHMAX-1) - ch)) / (2*DCHMAX-1);
  649. error[1] = g - (fg_g * ch + bg_g * ((2*DCHMAX-1) - ch)) / (2*DCHMAX-1);
  650. error[2] = b - (fg_b * ch + bg_b * ((2*DCHMAX-1) - ch)) / (2*DCHMAX-1);
  651. }
  652. }
  653. else
  654. {
  655. unsigned int lum = r; if(g > lum) lum = g; if(b > lum) lum = b;
  656. outfg = outbg;
  657. outbg = CUCUL_COLOR_BLACK;
  658. ch = lum * DCHMAX / 0x1000;
  659. if(ch < 0)
  660. ch = 0;
  661. else if(ch > (int)(DCHMAX - 1))
  662. ch = DCHMAX - 1;
  663. outch = density_chars[ch];
  664. if(qq->dithering == CUCUL_DITHERING_FSTEIN)
  665. {
  666. error[0] = r - bg_r * ch / (DCHMAX-1);
  667. error[1] = g - bg_g * ch / (DCHMAX-1);
  668. error[2] = b - bg_b * ch / (DCHMAX-1);
  669. }
  670. }
  671. if(qq->dithering == CUCUL_DITHERING_FSTEIN)
  672. {
  673. remain_r = fs_r[x+1] + 7 * error[0] / 16;
  674. remain_g = fs_g[x+1] + 7 * error[1] / 16;
  675. remain_b = fs_b[x+1] + 7 * error[2] / 16;
  676. fs_r[x-1] += 3 * error[0] / 16;
  677. fs_g[x-1] += 3 * error[1] / 16;
  678. fs_b[x-1] += 3 * error[2] / 16;
  679. fs_r[x] = 5 * error[0] / 16;
  680. fs_g[x] = 5 * error[1] / 16;
  681. fs_b[x] = 5 * error[2] / 16;
  682. fs_r[x+1] = 1 * error[0] / 16;
  683. fs_g[x+1] = 1 * error[1] / 16;
  684. fs_b[x+1] = 1 * error[2] / 16;
  685. }
  686. /* Now output the character */
  687. cucul_set_color(qq, outfg, outbg);
  688. cucul_putstr(qq, x, y, outch);
  689. _increment_dither();
  690. }
  691. /* end loop */
  692. }
  693. free(floyd_steinberg);
  694. }
  695. #if !defined(_DOXYGEN_SKIP_ME)
  696. int _cucul_init_bitmap(void)
  697. {
  698. unsigned int v, s, h;
  699. /* These ones are constant */
  700. lookup_colors[0] = CUCUL_COLOR_BLACK;
  701. lookup_colors[1] = CUCUL_COLOR_DARKGRAY;
  702. lookup_colors[2] = CUCUL_COLOR_LIGHTGRAY;
  703. lookup_colors[3] = CUCUL_COLOR_WHITE;
  704. /* These ones will be overwritten */
  705. lookup_colors[4] = CUCUL_COLOR_MAGENTA;
  706. lookup_colors[5] = CUCUL_COLOR_LIGHTMAGENTA;
  707. lookup_colors[6] = CUCUL_COLOR_RED;
  708. lookup_colors[7] = CUCUL_COLOR_LIGHTRED;
  709. for(v = 0; v < LOOKUP_VAL; v++)
  710. for(s = 0; s < LOOKUP_SAT; s++)
  711. for(h = 0; h < LOOKUP_HUE; h++)
  712. {
  713. int i, distbg, distfg, dist;
  714. int val, sat, hue;
  715. unsigned char outbg, outfg;
  716. val = 0xfff * v / (LOOKUP_VAL - 1);
  717. sat = 0xfff * s / (LOOKUP_SAT - 1);
  718. hue = 0xfff * h / (LOOKUP_HUE - 1);
  719. /* Initialise distances to the distance between pure black HSV
  720. * coordinates and our white colour (3) */
  721. outbg = outfg = 3;
  722. distbg = distfg = HSV_DISTANCE(0, 0, 0, 3);
  723. /* Calculate distances to eight major colour values and store the
  724. * two nearest points in our lookup table. */
  725. for(i = 0; i < 8; i++)
  726. {
  727. dist = HSV_DISTANCE(hue, sat, val, i);
  728. if(dist <= distbg)
  729. {
  730. outfg = outbg;
  731. distfg = distbg;
  732. outbg = i;
  733. distbg = dist;
  734. }
  735. else if(dist <= distfg)
  736. {
  737. outfg = i;
  738. distfg = dist;
  739. }
  740. }
  741. hsv_distances[v][s][h] = (outfg << 4) | outbg;
  742. }
  743. return 0;
  744. }
  745. int _cucul_end_bitmap(void)
  746. {
  747. return 0;
  748. }
  749. #endif /* _DOXYGEN_SKIP_ME */
  750. /*
  751. * XXX: The following functions are local.
  752. */
  753. /*
  754. * No dithering
  755. */
  756. static void init_no_dither(int line)
  757. {
  758. ;
  759. }
  760. static unsigned int get_no_dither(void)
  761. {
  762. return 0x80;
  763. }
  764. static void increment_no_dither(void)
  765. {
  766. return;
  767. }
  768. /*
  769. * Ordered 2 dithering
  770. */
  771. static unsigned int const *ordered2_table;
  772. static unsigned int ordered2_index;
  773. static void init_ordered2_dither(int line)
  774. {
  775. static unsigned int const dither2x2[] =
  776. {
  777. 0x00, 0x80,
  778. 0xc0, 0x40,
  779. };
  780. ordered2_table = dither2x2 + (line % 2) * 2;
  781. ordered2_index = 0;
  782. }
  783. static unsigned int get_ordered2_dither(void)
  784. {
  785. return ordered2_table[ordered2_index];
  786. }
  787. static void increment_ordered2_dither(void)
  788. {
  789. ordered2_index = (ordered2_index + 1) % 2;
  790. }
  791. /*
  792. * Ordered 4 dithering
  793. */
  794. /*static int dither4x4[] = { 5, 0, 1, 6,
  795. -1, -6, -5, 2,
  796. -2, -7, -8, 3,
  797. 4, -3, -4, -7};*/
  798. static unsigned int const *ordered4_table;
  799. static unsigned int ordered4_index;
  800. static void init_ordered4_dither(int line)
  801. {
  802. static unsigned int const dither4x4[] =
  803. {
  804. 0x00, 0x80, 0x20, 0xa0,
  805. 0xc0, 0x40, 0xe0, 0x60,
  806. 0x30, 0xb0, 0x10, 0x90,
  807. 0xf0, 0x70, 0xd0, 0x50
  808. };
  809. ordered4_table = dither4x4 + (line % 4) * 4;
  810. ordered4_index = 0;
  811. }
  812. static unsigned int get_ordered4_dither(void)
  813. {
  814. return ordered4_table[ordered4_index];
  815. }
  816. static void increment_ordered4_dither(void)
  817. {
  818. ordered4_index = (ordered4_index + 1) % 4;
  819. }
  820. /*
  821. * Ordered 8 dithering
  822. */
  823. static unsigned int const *ordered8_table;
  824. static unsigned int ordered8_index;
  825. static void init_ordered8_dither(int line)
  826. {
  827. static unsigned int const dither8x8[] =
  828. {
  829. 0x00, 0x80, 0x20, 0xa0, 0x08, 0x88, 0x28, 0xa8,
  830. 0xc0, 0x40, 0xe0, 0x60, 0xc8, 0x48, 0xe8, 0x68,
  831. 0x30, 0xb0, 0x10, 0x90, 0x38, 0xb8, 0x18, 0x98,
  832. 0xf0, 0x70, 0xd0, 0x50, 0xf8, 0x78, 0xd8, 0x58,
  833. 0x0c, 0x8c, 0x2c, 0xac, 0x04, 0x84, 0x24, 0xa4,
  834. 0xcc, 0x4c, 0xec, 0x6c, 0xc4, 0x44, 0xe4, 0x64,
  835. 0x3c, 0xbc, 0x1c, 0x9c, 0x34, 0xb4, 0x14, 0x94,
  836. 0xfc, 0x7c, 0xdc, 0x5c, 0xf4, 0x74, 0xd4, 0x54,
  837. };
  838. ordered8_table = dither8x8 + (line % 8) * 8;
  839. ordered8_index = 0;
  840. }
  841. static unsigned int get_ordered8_dither(void)
  842. {
  843. return ordered8_table[ordered8_index];
  844. }
  845. static void increment_ordered8_dither(void)
  846. {
  847. ordered8_index = (ordered8_index + 1) % 8;
  848. }
  849. /*
  850. * Random dithering
  851. */
  852. static void init_random_dither(int line)
  853. {
  854. ;
  855. }
  856. static unsigned int get_random_dither(void)
  857. {
  858. return cucul_rand(0x00, 0xff);
  859. }
  860. static void increment_random_dither(void)
  861. {
  862. return;
  863. }