Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

PixelFormat.cxx 13KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561
  1. /* Copyright (C) 2002-2005 RealVNC Ltd. All Rights Reserved.
  2. * Copyright 2009 Pierre Ossman for Cendio AB
  3. * Copyright (C) 2011 D. R. Commander. All Rights Reserved.
  4. *
  5. * This is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This software is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this software; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  18. * USA.
  19. */
  20. #include <assert.h>
  21. #include <stdio.h>
  22. #include <string.h>
  23. #include <rdr/InStream.h>
  24. #include <rdr/OutStream.h>
  25. #include <rfb/PixelFormat.h>
  26. #include <rfb/util.h>
  27. #ifdef _WIN32
  28. #define strcasecmp _stricmp
  29. #endif
  30. using namespace rfb;
  31. PixelFormat::PixelFormat(int b, int d, bool e, bool t,
  32. int rm, int gm, int bm, int rs, int gs, int bs)
  33. : bpp(b), depth(d), trueColour(t), bigEndian(e),
  34. redMax(rm), greenMax(gm), blueMax(bm),
  35. redShift(rs), greenShift(gs), blueShift(bs)
  36. {
  37. assert((bpp == 8) || (bpp == 16) || (bpp == 32));
  38. assert(depth <= bpp);
  39. assert((redMax & (redMax + 1)) == 0);
  40. assert((greenMax & (greenMax + 1)) == 0);
  41. assert((blueMax & (blueMax + 1)) == 0);
  42. updateState();
  43. }
  44. PixelFormat::PixelFormat()
  45. : bpp(8), depth(8), trueColour(true), bigEndian(false),
  46. redMax(7), greenMax(7), blueMax(3),
  47. redShift(0), greenShift(3), blueShift(6)
  48. {
  49. updateState();
  50. }
  51. bool PixelFormat::equal(const PixelFormat& other) const
  52. {
  53. return (bpp == other.bpp &&
  54. depth == other.depth &&
  55. (bigEndian == other.bigEndian || bpp == 8) &&
  56. trueColour == other.trueColour &&
  57. (!trueColour || (redMax == other.redMax &&
  58. greenMax == other.greenMax &&
  59. blueMax == other.blueMax &&
  60. redShift == other.redShift &&
  61. greenShift == other.greenShift &&
  62. blueShift == other.blueShift)));
  63. }
  64. void PixelFormat::read(rdr::InStream* is)
  65. {
  66. bpp = is->readU8();
  67. depth = is->readU8();
  68. bigEndian = is->readU8();
  69. trueColour = is->readU8();
  70. redMax = is->readU16();
  71. greenMax = is->readU16();
  72. blueMax = is->readU16();
  73. redShift = is->readU8();
  74. greenShift = is->readU8();
  75. blueShift = is->readU8();
  76. is->skip(3);
  77. updateState();
  78. }
  79. void PixelFormat::write(rdr::OutStream* os) const
  80. {
  81. os->writeU8(bpp);
  82. os->writeU8(depth);
  83. os->writeU8(bigEndian);
  84. os->writeU8(trueColour);
  85. os->writeU16(redMax);
  86. os->writeU16(greenMax);
  87. os->writeU16(blueMax);
  88. os->writeU8(redShift);
  89. os->writeU8(greenShift);
  90. os->writeU8(blueShift);
  91. os->pad(3);
  92. }
  93. bool PixelFormat::is888(void) const
  94. {
  95. if (!trueColour)
  96. return false;
  97. if (bpp != 32)
  98. return false;
  99. if (depth != 24)
  100. return false;
  101. if (redMax != 255)
  102. return false;
  103. if (greenMax != 255)
  104. return false;
  105. if (blueMax != 255)
  106. return false;
  107. return true;
  108. }
  109. bool PixelFormat::isBigEndian(void) const
  110. {
  111. return bigEndian;
  112. }
  113. bool PixelFormat::isLittleEndian(void) const
  114. {
  115. return ! bigEndian;
  116. }
  117. Pixel PixelFormat::pixelFromRGB(rdr::U16 red, rdr::U16 green, rdr::U16 blue,
  118. ColourMap* cm) const
  119. {
  120. if (trueColour) {
  121. rdr::U32 r = ((rdr::U32)red * redMax + 32767) / 65535;
  122. rdr::U32 g = ((rdr::U32)green * greenMax + 32767) / 65535;
  123. rdr::U32 b = ((rdr::U32)blue * blueMax + 32767) / 65535;
  124. return (r << redShift) | (g << greenShift) | (b << blueShift);
  125. } else if (cm) {
  126. // Try to find the closest pixel by Cartesian distance
  127. int colours = 1 << depth;
  128. int diff = 256 * 256 * 4;
  129. int col = 0;
  130. for (int i=0; i<colours; i++) {
  131. int r, g, b;
  132. cm->lookup(i, &r, &g, &b);
  133. int rd = (r-red) >> 8;
  134. int gd = (g-green) >> 8;
  135. int bd = (b-blue) >> 8;
  136. int d = rd*rd + gd*gd + bd*bd;
  137. if (d < diff) {
  138. col = i;
  139. diff = d;
  140. }
  141. }
  142. return col;
  143. }
  144. // XXX just return 0 for colour map?
  145. return 0;
  146. }
  147. Pixel PixelFormat::pixelFromRGB(rdr::U8 red, rdr::U8 green, rdr::U8 blue,
  148. ColourMap* cm) const
  149. {
  150. if (trueColour) {
  151. rdr::U32 r = ((rdr::U32)red * redMax + 127) / 255;
  152. rdr::U32 g = ((rdr::U32)green * greenMax + 127) / 255;
  153. rdr::U32 b = ((rdr::U32)blue * blueMax + 127) / 255;
  154. return (r << redShift) | (g << greenShift) | (b << blueShift);
  155. }
  156. return pixelFromRGB((rdr::U16)(red << 8), (rdr::U16)(green << 8),
  157. (rdr::U16)(blue << 8), cm);
  158. }
  159. void PixelFormat::bufferFromRGB(rdr::U8 *dst, const rdr::U8* src,
  160. int pixels, ColourMap* cm) const
  161. {
  162. if (is888()) {
  163. // Optimised common case
  164. rdr::U8 *r, *g, *b;
  165. if (bigEndian) {
  166. r = dst + (24 - redShift)/8;
  167. g = dst + (24 - greenShift)/8;
  168. b = dst + (24 - blueShift)/8;
  169. } else {
  170. r = dst + redShift/8;
  171. g = dst + greenShift/8;
  172. b = dst + blueShift/8;
  173. }
  174. while (pixels--) {
  175. *r = *(src++);
  176. *g = *(src++);
  177. *b = *(src++);
  178. r += 4;
  179. g += 4;
  180. b += 4;
  181. }
  182. } else {
  183. // Generic code
  184. Pixel p;
  185. rdr::U8 r, g, b;
  186. while (pixels--) {
  187. r = *(src++);
  188. g = *(src++);
  189. b = *(src++);
  190. p = pixelFromRGB(r, g, b, cm);
  191. bufferFromPixel(dst, p);
  192. dst += bpp/8;
  193. }
  194. }
  195. }
  196. void PixelFormat::bufferFromRGB(rdr::U8 *dst, const rdr::U8* src,
  197. int w, int pitch, int h, ColourMap* cm) const
  198. {
  199. if (is888()) {
  200. // Optimised common case
  201. int rindex, gindex, bindex;
  202. if (bigEndian) {
  203. rindex = (24 - redShift)/8;
  204. gindex = (24 - greenShift)/8;
  205. bindex = (24 - blueShift)/8;
  206. } else {
  207. rindex = redShift/8;
  208. gindex = greenShift/8;
  209. bindex = blueShift/8;
  210. }
  211. int dstPad = pitch - w * 4;
  212. while (h > 0) {
  213. rdr::U8 *dstEndOfRow = (rdr::U8 *)dst + w * 4;
  214. while (dst < dstEndOfRow) {
  215. dst[rindex] = *(src++);
  216. dst[gindex] = *(src++);
  217. dst[bindex] = *(src++);
  218. dst += 4;
  219. }
  220. dst += dstPad;
  221. h--;
  222. }
  223. } else {
  224. // Generic code
  225. Pixel p;
  226. rdr::U8 r, g, b;
  227. int pixelSize = bpp/8;
  228. int dstPad = pitch - w * pixelSize;
  229. while (h > 0) {
  230. rdr::U8 *dstEndOfRow = (rdr::U8 *)dst + w * pixelSize;
  231. while (dst < dstEndOfRow) {
  232. r = *(src++);
  233. g = *(src++);
  234. b = *(src++);
  235. p = pixelFromRGB(r, g, b, cm);
  236. bufferFromPixel(dst, p);
  237. dst += pixelSize;
  238. }
  239. dst += dstPad;
  240. h--;
  241. }
  242. }
  243. }
  244. void PixelFormat::rgbFromPixel(Pixel p, ColourMap* cm, Colour* rgb) const
  245. {
  246. rdr::U16 r, g, b;
  247. rgbFromPixel(p, cm, &r, &g, &b);
  248. rgb->r = r;
  249. rgb->g = g;
  250. rgb->b = b;
  251. }
  252. void PixelFormat::rgbFromBuffer(rdr::U16* dst, const rdr::U8* src, int pixels, ColourMap* cm) const
  253. {
  254. Pixel p;
  255. rdr::U16 r, g, b;
  256. while (pixels--) {
  257. p = pixelFromBuffer(src);
  258. src += bpp/8;
  259. rgbFromPixel(p, cm, &r, &g, &b);
  260. *(dst++) = r;
  261. *(dst++) = g;
  262. *(dst++) = b;
  263. }
  264. }
  265. void PixelFormat::rgbFromBuffer(rdr::U8* dst, const rdr::U8* src, int pixels, ColourMap* cm) const
  266. {
  267. if (is888()) {
  268. // Optimised common case
  269. const rdr::U8 *r, *g, *b;
  270. if (bigEndian) {
  271. r = src + (24 - redShift)/8;
  272. g = src + (24 - greenShift)/8;
  273. b = src + (24 - blueShift)/8;
  274. } else {
  275. r = src + redShift/8;
  276. g = src + greenShift/8;
  277. b = src + blueShift/8;
  278. }
  279. while (pixels--) {
  280. *(dst++) = *r;
  281. *(dst++) = *g;
  282. *(dst++) = *b;
  283. r += 4;
  284. g += 4;
  285. b += 4;
  286. }
  287. } else {
  288. // Generic code
  289. Pixel p;
  290. rdr::U8 r, g, b;
  291. while (pixels--) {
  292. p = pixelFromBuffer(src);
  293. src += bpp/8;
  294. rgbFromPixel(p, cm, &r, &g, &b);
  295. *(dst++) = r;
  296. *(dst++) = g;
  297. *(dst++) = b;
  298. }
  299. }
  300. }
  301. void PixelFormat::rgbFromBuffer(rdr::U8* dst, const rdr::U8* src,
  302. int w, int pitch, int h, ColourMap* cm) const
  303. {
  304. if (is888()) {
  305. // Optimised common case
  306. int rindex, gindex, bindex;
  307. if (bigEndian) {
  308. rindex = (24 - redShift)/8;
  309. gindex = (24 - greenShift)/8;
  310. bindex = (24 - blueShift)/8;
  311. } else {
  312. rindex = redShift/8;
  313. gindex = greenShift/8;
  314. bindex = blueShift/8;
  315. }
  316. int srcPad = pitch - w * 4;
  317. while (h > 0) {
  318. rdr::U8 *srcEndOfRow = (rdr::U8 *)src + w * 4;
  319. while (src < srcEndOfRow) {
  320. *(dst++) = src[rindex];
  321. *(dst++) = src[gindex];
  322. *(dst++) = src[bindex];
  323. src += 4;
  324. }
  325. src += srcPad;
  326. h--;
  327. }
  328. } else {
  329. // Generic code
  330. Pixel p;
  331. rdr::U8 r, g, b;
  332. int pixelSize = bpp/8;
  333. int srcPad = pitch - w * pixelSize;
  334. while (h > 0) {
  335. rdr::U8 *srcEndOfRow = (rdr::U8 *)src + w * pixelSize;
  336. while (src < srcEndOfRow) {
  337. p = pixelFromBuffer(src);
  338. rgbFromPixel(p, cm, &r, &g, &b);
  339. *(dst++) = r;
  340. *(dst++) = g;
  341. *(dst++) = b;
  342. src += pixelSize;
  343. }
  344. src += srcPad;
  345. h--;
  346. }
  347. }
  348. }
  349. void PixelFormat::print(char* str, int len) const
  350. {
  351. // Unfortunately snprintf is not widely available so we build the string up
  352. // using strncat - not pretty, but should be safe against buffer overruns.
  353. char num[20];
  354. if (len < 1) return;
  355. str[0] = 0;
  356. strncat(str, "depth ", len-1-strlen(str));
  357. sprintf(num,"%d",depth);
  358. strncat(str, num, len-1-strlen(str));
  359. strncat(str, " (", len-1-strlen(str));
  360. sprintf(num,"%d",bpp);
  361. strncat(str, num, len-1-strlen(str));
  362. strncat(str, "bpp)", len-1-strlen(str));
  363. if (bpp != 8) {
  364. if (bigEndian)
  365. strncat(str, " big-endian", len-1-strlen(str));
  366. else
  367. strncat(str, " little-endian", len-1-strlen(str));
  368. }
  369. if (!trueColour) {
  370. strncat(str, " color-map", len-1-strlen(str));
  371. return;
  372. }
  373. if (blueShift == 0 && greenShift > blueShift && redShift > greenShift &&
  374. blueMax == (1 << greenShift) - 1 &&
  375. greenMax == (1 << (redShift-greenShift)) - 1 &&
  376. redMax == (1 << (depth-redShift)) - 1)
  377. {
  378. strncat(str, " rgb", len-1-strlen(str));
  379. sprintf(num,"%d",depth-redShift);
  380. strncat(str, num, len-1-strlen(str));
  381. sprintf(num,"%d",redShift-greenShift);
  382. strncat(str, num, len-1-strlen(str));
  383. sprintf(num,"%d",greenShift);
  384. strncat(str, num, len-1-strlen(str));
  385. return;
  386. }
  387. if (redShift == 0 && greenShift > redShift && blueShift > greenShift &&
  388. redMax == (1 << greenShift) - 1 &&
  389. greenMax == (1 << (blueShift-greenShift)) - 1 &&
  390. blueMax == (1 << (depth-blueShift)) - 1)
  391. {
  392. strncat(str, " bgr", len-1-strlen(str));
  393. sprintf(num,"%d",depth-blueShift);
  394. strncat(str, num, len-1-strlen(str));
  395. sprintf(num,"%d",blueShift-greenShift);
  396. strncat(str, num, len-1-strlen(str));
  397. sprintf(num,"%d",greenShift);
  398. strncat(str, num, len-1-strlen(str));
  399. return;
  400. }
  401. strncat(str, " rgb max ", len-1-strlen(str));
  402. sprintf(num,"%d,",redMax);
  403. strncat(str, num, len-1-strlen(str));
  404. sprintf(num,"%d,",greenMax);
  405. strncat(str, num, len-1-strlen(str));
  406. sprintf(num,"%d",blueMax);
  407. strncat(str, num, len-1-strlen(str));
  408. strncat(str, " shift ", len-1-strlen(str));
  409. sprintf(num,"%d,",redShift);
  410. strncat(str, num, len-1-strlen(str));
  411. sprintf(num,"%d,",greenShift);
  412. strncat(str, num, len-1-strlen(str));
  413. sprintf(num,"%d",blueShift);
  414. strncat(str, num, len-1-strlen(str));
  415. }
  416. bool PixelFormat::parse(const char* str)
  417. {
  418. char rgbbgr[4];
  419. int bits1, bits2, bits3;
  420. if (sscanf(str, "%3s%1d%1d%1d", rgbbgr, &bits1, &bits2, &bits3) < 4)
  421. return false;
  422. depth = bits1 + bits2 + bits3;
  423. bpp = depth <= 8 ? 8 : ((depth <= 16) ? 16 : 32);
  424. trueColour = true;
  425. rdr::U32 endianTest = 1;
  426. bigEndian = (*(rdr::U8*)&endianTest == 0);
  427. greenShift = bits3;
  428. greenMax = (1 << bits2) - 1;
  429. if (strcasecmp(rgbbgr, "bgr") == 0) {
  430. redShift = 0;
  431. redMax = (1 << bits3) - 1;
  432. blueShift = bits3 + bits2;
  433. blueMax = (1 << bits1) - 1;
  434. } else if (strcasecmp(rgbbgr, "rgb") == 0) {
  435. blueShift = 0;
  436. blueMax = (1 << bits3) - 1;
  437. redShift = bits3 + bits2;
  438. redMax = (1 << bits1) - 1;
  439. } else {
  440. return false;
  441. }
  442. updateState();
  443. return true;
  444. }
  445. static int bits(rdr::U16 value)
  446. {
  447. int bits;
  448. bits = 16;
  449. if (!(value & 0xff00)) {
  450. bits -= 8;
  451. value <<= 8;
  452. }
  453. if (!(value & 0xf000)) {
  454. bits -= 4;
  455. value <<= 4;
  456. }
  457. if (!(value & 0xc000)) {
  458. bits -= 2;
  459. value <<= 2;
  460. }
  461. if (!(value & 0x8000)) {
  462. bits -= 1;
  463. value <<= 1;
  464. }
  465. return bits;
  466. }
  467. void PixelFormat::updateState(void)
  468. {
  469. int redBits, greenBits, blueBits;
  470. int endianTest = 1;
  471. redBits = bits(redMax);
  472. greenBits = bits(greenMax);
  473. blueBits = bits(blueMax);
  474. redConvShift = 16 - redBits;
  475. greenConvShift = 16 - greenBits;
  476. blueConvShift = 16 - blueBits;
  477. if (((*(char*)&endianTest) == 0) != bigEndian)
  478. endianMismatch = true;
  479. else
  480. endianMismatch = false;
  481. }