PageRenderTime 75ms CodeModel.GetById 26ms RepoModel.GetById 1ms app.codeStats 2ms

/Dependencies/Source/FreeImage/LibRawLite/internal/dcraw_common.cpp

http://gamekit.googlecode.com/
C++ | 7449 lines | 7024 code | 307 blank | 118 comment | 2370 complexity | cda8664a6c75ec055a3253a2d8f7f911 MD5 | raw file
Possible License(s): BSD-2-Clause, LGPL-2.0, AGPL-3.0, BSD-3-Clause, GPL-2.0, LGPL-3.0, MPL-2.0-no-copyleft-exception, LGPL-2.1, MIT

Large files files are truncated, but you can click here to view the full file

    

  1. /* 

    2. 

  2.    GENERATED FILE, DO NOT EDIT

    3. 

  3.    Generated from dcraw/dcraw.c at Mon May  4 22:14:56 2009

    4. 

  4.    Look into original file (probably http://cybercom.net/~dcoffin/dcraw/dcraw.c)

    5. 

  5.    for copyright information.

    6. 

  6. */

    7. 

  7. 

    8. 

  8. #line 257 "dcraw/dcraw.c"

    9. 

  9. #define CLASS LibRaw::

    10. 

  10. #include "libraw/libraw_types.h"

    11. 

  11. #define LIBRAW_LIBRARY_BUILD

    12. 

  12. #define LIBRAW_IO_REDEFINED

    13. 

  13. #include "libraw/libraw.h"

    14. 

  14. #include "internal/defines.h"

    15. 

  15. #include "internal/var_defines.h"

    16. 

  16. 

    17. 

  17. #line 267 "dcraw/dcraw.c"

    18. 

  18. 

    19. 

  19. #ifndef __GLIBC__

    20. 

  20. char *my_memmem (char *haystack, size_t haystacklen,

    21. 

  21. 	      char *needle, size_t needlelen)

    22. 

  22. {

    23. 

  23.   char *c;

    24. 

  24.   for (c = haystack; c <= haystack + haystacklen - needlelen; c++)

    25. 

  25.     if (!memcmp (c, needle, needlelen))

    26. 

  26.       return c;

    27. 

  27.   return 0;

    28. 

  28. }

    29. 

  29. #define memmem my_memmem

    30. 

  30. #endif

    31. 

  31. 

    32. 

  32. #line 301 "dcraw/dcraw.c"

    33. 

  33. 

    34. 

  34. ushort CLASS sget2 (uchar *s)

    35. 

  35. {

    36. 

  36.   if (order == 0x4949)		/* "II" means little-endian */

    37. 

  37.     return s[0] | s[1] << 8;

    38. 

  38.   else				/* "MM" means big-endian */

    39. 

  39.     return s[0] << 8 | s[1];

    40. 

  40. }

    41. 

  41. 

    42. 

  42. ushort CLASS get2()

    43. 

  43. {

    44. 

  44.   uchar str[2] = { 0xff,0xff };

    45. 

  45.   fread (str, 1, 2, ifp);

    46. 

  46.   return sget2(str);

    47. 

  47. }

    48. 

  48. 

    49. 

  49. unsigned CLASS sget4 (uchar *s)

    50. 

  50. {

    51. 

  51.   if (order == 0x4949)

    52. 

  52.     return s[0] | s[1] << 8 | s[2] << 16 | s[3] << 24;

    53. 

  53.   else

    54. 

  54.     return s[0] << 24 | s[1] << 16 | s[2] << 8 | s[3];

    55. 

  55. }

    56. 

  56. #define sget4(s) sget4((uchar *)s)

    57. 

  57. 

    58. 

  58. unsigned CLASS get4()

    59. 

  59. {

    60. 

  60.   uchar str[4] = { 0xff,0xff,0xff,0xff };

    61. 

  61.   fread (str, 1, 4, ifp);

    62. 

  62.   return sget4(str);

    63. 

  63. }

    64. 

  64. 

    65. 

  65. unsigned CLASS getint (int type)

    66. 

  66. {

    67. 

  67.   return type == 3 ? get2() : get4();

    68. 

  68. }

    69. 

  69. 

    70. 

  70. float CLASS int_to_float (int i)

    71. 

  71. {

    72. 

  72.   union { int i; float f; } u;

    73. 

  73.   u.i = i;

    74. 

  74.   return u.f;

    75. 

  75. }

    76. 

  76. 

    77. 

  77. double CLASS getreal (int type)

    78. 

  78. {

    79. 

  79.   union { char c[8]; double d; } u;

    80. 

  80.   int i, rev;

    81. 

  81. 

    82. 

  82.   switch (type) {

    83. 

  83.     case 3: return (unsigned short) get2();

    84. 

  84.     case 4: return (unsigned int) get4();

    85. 

  85.     case 5:  u.d = (unsigned int) get4();

    86. 

  86.       return u.d / (unsigned int) get4();

    87. 

  87.     case 8: return (signed short) get2();

    88. 

  88.     case 9: return (signed int) get4();

    89. 

  89.     case 10: u.d = (signed int) get4();

    90. 

  90.       return u.d / (signed int) get4();

    91. 

  91.     case 11: return int_to_float (get4());

    92. 

  92.     case 12:

    93. 

  93.       rev = 7 * ((order == 0x4949) == (ntohs(0x1234) == 0x1234));

    94. 

  94.       for (i=0; i < 8; i++)

    95. 

  95. 	u.c[i ^ rev] = fgetc(ifp);

    96. 

  96.       return u.d;

    97. 

  97.     default: return fgetc(ifp);

    98. 

  98.   }

    99. 

  99. }

    100. 

  100. 

    101. 

  101. void CLASS read_shorts (ushort *pixel, int count)

    102. 

  102. {

    103. 

  103.   if (fread (pixel, 2, count, ifp) < count) derror();

    104. 

  104.   if ((order == 0x4949) == (ntohs(0x1234) == 0x1234))

    105. 

  105.       swab ((char*)pixel, (char*)pixel, count*2);

    106. 

  106. }

    107. 

  107. #line 378 "dcraw/dcraw.c"

    108. 

  108. void CLASS canon_black (double dark[2])

    109. 

  109. {

    110. 

  110.   int c, diff, row, col;

    111. 

  111. 

    112. 

  112.   if (raw_width < width+4) return;

    113. 

  113.   FORC(2) dark[c] /= (raw_width-width-2) * height >> 1;

    114. 

  114.   if ((diff = dark[0] - dark[1]))

    115. 

  115.     for (row=0; row < height; row++)

    116. 

  116.       for (col=1; col < width; col+=2)

    117. 

  117. 	BAYER(row,col) += diff;

    118. 

  118.   dark[1] += diff;

    119. 

  119.   black = (dark[0] + dark[1] + 1) / 2;

    120. 

  120. }

    121. 

  121. 

    122. 

  122. void CLASS canon_600_fixed_wb (int temp)

    123. 

  123. {

    124. 

  124.   static const short mul[4][5] = {

    125. 

  125.     {  667, 358,397,565,452 },

    126. 

  126.     {  731, 390,367,499,517 },

    127. 

  127.     { 1119, 396,348,448,537 },

    128. 

  128.     { 1399, 485,431,508,688 } };

    129. 

  129.   int lo, hi, i;

    130. 

  130.   float frac=0;

    131. 

  131. 

    132. 

  132.   for (lo=4; --lo; )

    133. 

  133.     if (*mul[lo] <= temp) break;

    134. 

  134.   for (hi=0; hi < 3; hi++)

    135. 

  135.     if (*mul[hi] >= temp) break;

    136. 

  136.   if (lo != hi)

    137. 

  137.     frac = (float) (temp - *mul[lo]) / (*mul[hi] - *mul[lo]);

    138. 

  138.   for (i=1; i < 5; i++)

    139. 

  139.     pre_mul[i-1] = 1 / (frac * mul[hi][i] + (1-frac) * mul[lo][i]);

    140. 

  140. }

    141. 

  141. 

    142. 

  142. /* Return values:  0 = white  1 = near white  2 = not white */

    143. 

  143. int CLASS canon_600_color (int ratio[2], int mar)

    144. 

  144. {

    145. 

  145.   int clipped=0, target, miss;

    146. 

  146. 

    147. 

  147.   if (flash_used) {

    148. 

  148.     if (ratio[1] < -104)

    149. 

  149.       { ratio[1] = -104; clipped = 1; }

    150. 

  150.     if (ratio[1] >   12)

    151. 

  151.       { ratio[1] =   12; clipped = 1; }

    152. 

  152.   } else {

    153. 

  153.     if (ratio[1] < -264 || ratio[1] > 461) return 2;

    154. 

  154.     if (ratio[1] < -50)

    155. 

  155.       { ratio[1] = -50; clipped = 1; }

    156. 

  156.     if (ratio[1] > 307)

    157. 

  157.       { ratio[1] = 307; clipped = 1; }

    158. 

  158.   }

    159. 

  159.   target = flash_used || ratio[1] < 197

    160. 

  160. 	? -38 - (398 * ratio[1] >> 10)

    161. 

  161. 	: -123 + (48 * ratio[1] >> 10);

    162. 

  162.   if (target - mar <= ratio[0] &&

    163. 

  163.       target + 20  >= ratio[0] && !clipped) return 0;

    164. 

  164.   miss = target - ratio[0];

    165. 

  165.   if (abs(miss) >= mar*4) return 2;

    166. 

  166.   if (miss < -20) miss = -20;

    167. 

  167.   if (miss > mar) miss = mar;

    168. 

  168.   ratio[0] = target - miss;

    169. 

  169.   return 1;

    170. 

  170. }

    171. 

  171. 

    172. 

  172. void CLASS canon_600_auto_wb()

    173. 

  173. {

    174. 

  174.   int mar, row, col, i, j, st, count[] = { 0,0 };

    175. 

  175.   int test[8], total[2][8], ratio[2][2], stat[2];

    176. 

  176. 

    177. 

  177.   memset (&total, 0, sizeof total);

    178. 

  178.   i = canon_ev + 0.5;

    179. 

  179.   if      (i < 10) mar = 150;

    180. 

  180.   else if (i > 12) mar = 20;

    181. 

  181.   else mar = 280 - 20 * i;

    182. 

  182.   if (flash_used) mar = 80;

    183. 

  183.   for (row=14; row < height-14; row+=4)

    184. 

  184.     for (col=10; col < width; col+=2) {

    185. 

  185.       for (i=0; i < 8; i++)

    186. 

  186. 	test[(i & 4) + FC(row+(i >> 1),col+(i & 1))] =

    187. 

  187. 		    BAYER(row+(i >> 1),col+(i & 1));

    188. 

  188.       for (i=0; i < 8; i++)

    189. 

  189. 	if (test[i] < 150 || test[i] > 1500) goto next;

    190. 

  190.       for (i=0; i < 4; i++)

    191. 

  191. 	if (abs(test[i] - test[i+4]) > 50) goto next;

    192. 

  192.       for (i=0; i < 2; i++) {

    193. 

  193. 	for (j=0; j < 4; j+=2)

    194. 

  194. 	  ratio[i][j >> 1] = ((test[i*4+j+1]-test[i*4+j]) << 10) / test[i*4+j];

    195. 

  195. 	stat[i] = canon_600_color (ratio[i], mar);

    196. 

  196.       }

    197. 

  197.       if ((st = stat[0] | stat[1]) > 1) goto next;

    198. 

  198.       for (i=0; i < 2; i++)

    199. 

  199. 	if (stat[i])

    200. 

  200. 	  for (j=0; j < 2; j++)

    201. 

  201. 	    test[i*4+j*2+1] = test[i*4+j*2] * (0x400 + ratio[i][j]) >> 10;

    202. 

  202.       for (i=0; i < 8; i++)

    203. 

  203. 	total[st][i] += test[i];

    204. 

  204.       count[st]++;

    205. 

  205. next: ;

    206. 

  206.     }

    207. 

  207.   if (count[0] | count[1]) {

    208. 

  208.     st = count[0]*200 < count[1];

    209. 

  209.     for (i=0; i < 4; i++)

    210. 

  210.       pre_mul[i] = 1.0 / (total[st][i] + total[st][i+4]);

    211. 

  211.   }

    212. 

  212. }

    213. 

  213. 

    214. 

  214. void CLASS canon_600_coeff()

    215. 

  215. {

    216. 

  216.   static const short table[6][12] = {

    217. 

  217.     { -190,702,-1878,2390,   1861,-1349,905,-393, -432,944,2617,-2105  },

    218. 

  218.     { -1203,1715,-1136,1648, 1388,-876,267,245,  -1641,2153,3921,-3409 },

    219. 

  219.     { -615,1127,-1563,2075,  1437,-925,509,3,     -756,1268,2519,-2007 },

    220. 

  220.     { -190,702,-1886,2398,   2153,-1641,763,-251, -452,964,3040,-2528  },

    221. 

  221.     { -190,702,-1878,2390,   1861,-1349,905,-393, -432,944,2617,-2105  },

    222. 

  222.     { -807,1319,-1785,2297,  1388,-876,769,-257,  -230,742,2067,-1555  } };

    223. 

  223.   int t=0, i, c;

    224. 

  224.   float mc, yc;

    225. 

  225. 

    226. 

  226.   mc = pre_mul[1] / pre_mul[2];

    227. 

  227.   yc = pre_mul[3] / pre_mul[2];

    228. 

  228.   if (mc > 1 && mc <= 1.28 && yc < 0.8789) t=1;

    229. 

  229.   if (mc > 1.28 && mc <= 2) {

    230. 

  230.     if  (yc < 0.8789) t=3;

    231. 

  231.     else if (yc <= 2) t=4;

    232. 

  232.   }

    233. 

  233.   if (flash_used) t=5;

    234. 

  234.   for (raw_color = i=0; i < 3; i++)

    235. 

  235.     FORCC rgb_cam[i][c] = table[t][i*4 + c] / 1024.0;

    236. 

  236. }

    237. 

  237. 

    238. 

  238. void CLASS canon_600_load_raw()

    239. 

  239. {

    240. 

  240.   uchar  data[1120], *dp;

    241. 

  241.   ushort pixel[896], *pix;

    242. 

  242.   int irow, row, col, val;

    243. 

  243.   static const short mul[4][2] =

    244. 

  244.   { { 1141,1145 }, { 1128,1109 }, { 1178,1149 }, { 1128,1109 } };

    245. 

  245. 

    246. 

  246.   for (irow=row=0; irow < height; irow++) {

    247. 

  247.     if (fread (data, 1, raw_width*5/4, ifp) < raw_width*5/4) derror();

    248. 

  248.     for (dp=data, pix=pixel; dp < data+1120; dp+=10, pix+=8) {

    249. 

  249.       pix[0] = (dp[0] << 2) + (dp[1] >> 6    );

    250. 

  250.       pix[1] = (dp[2] << 2) + (dp[1] >> 4 & 3);

    251. 

  251.       pix[2] = (dp[3] << 2) + (dp[1] >> 2 & 3);

    252. 

  252.       pix[3] = (dp[4] << 2) + (dp[1]      & 3);

    253. 

  253.       pix[4] = (dp[5] << 2) + (dp[9]      & 3);

    254. 

  254.       pix[5] = (dp[6] << 2) + (dp[9] >> 2 & 3);

    255. 

  255.       pix[6] = (dp[7] << 2) + (dp[9] >> 4 & 3);

    256. 

  256.       pix[7] = (dp[8] << 2) + (dp[9] >> 6    );

    257. 

  257.     }

    258. 

  258.     for (col=0; col < width; col++)

    259. 

  259.       BAYER(row,col) = pixel[col];

    260. 

  260.     for (col=width; col < raw_width; col++)

    261. 

  261.         {

    262. 

  262.             black += pixel[col];

    263. 

  263.         }

    264. 

  264.     if ((row+=2) > height) row = 1;

    265. 

  265.   }

    266. 

  266.   if (raw_width > width)

    267. 

  267.     black = black / ((raw_width - width) * height) - 4;

    268. 

  268.   for (row=0; row < height; row++)

    269. 

  269.     for (col=0; col < width; col++) {

    270. 

  270.       if ((val = BAYER(row,col) - black) < 0) val = 0;

    271. 

  271.       val = val * mul[row & 3][col & 1] >> 9;

    272. 

  272.       BAYER(row,col) = val;

    273. 

  273.     }

    274. 

  274.   canon_600_fixed_wb(1311);

    275. 

  275.   canon_600_auto_wb();

    276. 

  276.   canon_600_coeff();

    277. 

  277.   maximum = (0x3ff - black) * 1109 >> 9;

    278. 

  278.   black = 0;

    279. 

  279. }

    280. 

  280. 

    281. 

  281. void CLASS remove_zeroes()

    282. 

  282. {

    283. 

  283.   unsigned row, col, tot, n, r, c;

    284. 

  284. 

    285. 

  285. #ifdef LIBRAW_LIBRARY_BUILD

    286. 

  286.   RUN_CALLBACK(LIBRAW_PROGRESS_REMOVE_ZEROES,0,2);

    287. 

  287. #endif

    288. 

  288.   for (row=0; row < height; row++)

    289. 

  289.     for (col=0; col < width; col++)

    290. 

  290.       if (BAYER(row,col) == 0) {

    291. 

  291. 	tot = n = 0;

    292. 

  292. 	for (r = row-2; r <= row+2; r++)

    293. 

  293. 	  for (c = col-2; c <= col+2; c++)

    294. 

  294. 	    if (r < height && c < width &&

    295. 

  295. 		FC(r,c) == FC(row,col) && BAYER(r,c))

    296. 

  296. 	      tot += (n++,BAYER(r,c));

    297. 

  297. 	if (n) BAYER(row,col) = tot/n;

    298. 

  298.       }

    299. 

  299. #ifdef LIBRAW_LIBRARY_BUILD

    300. 

  300.   RUN_CALLBACK(LIBRAW_PROGRESS_REMOVE_ZEROES,1,2);

    301. 

  301. #endif

    302. 

  302. }

    303. 

  303. 

    304. 

  304. int CLASS canon_s2is()

    305. 

  305. {

    306. 

  306.   unsigned row;

    307. 

  307. 

    308. 

  308.   for (row=0; row < 100; row++) {

    309. 

  309.     fseek (ifp, row*3340 + 3284, SEEK_SET);

    310. 

  310.     if (getc(ifp) > 15) return 1;

    311. 

  311.   }

    312. 

  312.   return 0;

    313. 

  313. }

    314. 

  314. 

    315. 

  315. void CLASS canon_a5_load_raw()

    316. 

  316. {

    317. 

  317.   ushort data[2565], *dp, pixel;

    318. 

  318.   int vbits=0, buf=0, row, col, bc=0;

    319. 

  319. 

    320. 

  320.   order = 0x4949;

    321. 

  321.   for (row=-top_margin; row < raw_height-top_margin; row++) {

    322. 

  322.     read_shorts (dp=data, raw_width * 10 / 16);

    323. 

  323.     for (col=-left_margin; col < raw_width-left_margin; col++) {

    324. 

  324.       if ((vbits -= 10) < 0)

    325. 

  325. 	buf = (vbits += 16, (buf << 16) + *dp++);

    326. 

  326.       pixel = buf >> vbits & 0x3ff;

    327. 

  327.       if ((unsigned) row < height && (unsigned) col < width)

    328. 

  328. 	BAYER(row,col) = pixel;

    329. 

  329.       else if (col > 1-left_margin && col != width)

    330. 

  330. 	black += (bc++,pixel);

    331. 

  331.     }

    332. 

  332.   }

    333. 

  333.   if (bc) black /= bc;

    334. 

  334.   maximum = 0x3ff;

    335. 

  335. 

    336. 

  336.   if (raw_width > 1600) remove_zeroes();

    337. 

  337. }

    338. 

  338. 

    339. 

  339. /*

    340. 

  340.    getbits(-1) initializes the buffer

    341. 

  341.    getbits(n) where 0 <= n <= 25 returns an n-bit integer

    342. 

  342.  */

    343. 

  343. unsigned CLASS getbits (int nbits)

    344. 

  344. {

    345. 

  345. #ifdef LIBRAW_NOTHREADS

    346. 

  346.   static unsigned bitbuf=0;

    347. 

  347.   static int vbits=0, reset=0;

    348. 

  348. #else

    349. 

  349. #define bitbuf tls->getbits.bitbuf

    350. 

  350. #define vbits  tls->getbits.vbits

    351. 

  351. #define reset  tls->getbits.reset

    352. 

  352. #endif

    353. 

  353.   unsigned c;

    354. 

  354. 

    355. 

  355.   if (nbits == -1)

    356. 

  356.     return bitbuf = vbits = reset = 0;

    357. 

  357.   if (nbits == 0 || reset) return 0;

    358. 

  358.   while (vbits < nbits) {

    359. 

  359.     if ((c = fgetc(ifp)) == EOF) derror();

    360. 

  360.     if ((reset = zero_after_ff && c == 0xff && fgetc(ifp))) return 0;

    361. 

  361.     bitbuf = (bitbuf << 8) + (uchar) c;

    362. 

  362.     vbits += 8;

    363. 

  363.   }

    364. 

  364.   vbits -= nbits;

    365. 

  365.   return bitbuf << (32-nbits-vbits) >> (32-nbits);

    366. 

  366. #ifndef LIBRAW_NOTHREADS

    367. 

  367. #undef bitbuf

    368. 

  368. #undef vbits

    369. 

  369. #undef reset

    370. 

  370. #endif

    371. 

  371. }

    372. 

  372. 

    373. 

  373. void CLASS init_decoder()

    374. 

  374. {

    375. 

  375.   memset (first_decode, 0, sizeof first_decode);

    376. 

  376.   free_decode = first_decode;

    377. 

  377. }

    378. 

  378. 

    379. 

  379. /*

    380. 

  380.    Construct a decode tree according to the specification in *source.

    381. 

  381.    The first 16 bytes specify how many codes should be 1-bit, 2-bit

    382. 

  382.    3-bit, etc.  Bytes after that are the leaf values.

    383. 

  383. 

    384. 

  384.    For example, if the source is

    385. 

  385. 

    386. 

  386.     { 0,1,4,2,3,1,2,0,0,0,0,0,0,0,0,0,

    387. 

  387.       0x04,0x03,0x05,0x06,0x02,0x07,0x01,0x08,0x09,0x00,0x0a,0x0b,0xff  },

    388. 

  388. 

    389. 

  389.    then the code is

    390. 

  390. 

    391. 

  391. 	00		0x04

    392. 

  392. 	010		0x03

    393. 

  393. 	011		0x05

    394. 

  394. 	100		0x06

    395. 

  395. 	101		0x02

    396. 

  396. 	1100		0x07

    397. 

  397. 	1101		0x01

    398. 

  398. 	11100		0x08

    399. 

  399. 	11101		0x09

    400. 

  400. 	11110		0x00

    401. 

  401. 	111110		0x0a

    402. 

  402. 	1111110		0x0b

    403. 

  403. 	1111111		0xff

    404. 

  404.  */

    405. 

  405. uchar * CLASS make_decoder (const uchar *source, int level)

    406. 

  406. {

    407. 

  407.   struct decode *cur;

    408. 

  408. #ifndef LIBRAW_NOTHREADS

    409. 

  409. #define t_leaf tls->make_decoder_leaf

    410. 

  410. #else

    411. 

  411.   static int t_leaf;

    412. 

  412. #endif

    413. 

  413.   int i, next;

    414. 

  414. 

    415. 

  415.   if (level==0) t_leaf=0;

    416. 

  416.   cur = free_decode++;

    417. 

  417.   if (free_decode > first_decode+2048) {

    418. 

  418. #ifdef LIBRAW_LIBRARY_BUILD

    419. 

  419.       throw LIBRAW_EXCEPTION_DECODE_RAW;

    420. 

  420. #else

    421. 

  421.     fprintf (stderr,_("%s: decoder table overflow\n"), ifname);

    422. 

  422.     longjmp (failure, 2);

    423. 

  423. #endif

    424. 

  424.   }

    425. 

  425.   for (i=next=0; i <= t_leaf && next < 16; )

    426. 

  426.     i += source[next++];

    427. 

  427.   if (i > t_leaf) {

    428. 

  428.     if (level < next) {

    429. 

  429.       cur->branch[0] = free_decode;

    430. 

  430.       make_decoder (source, level+1);

    431. 

  431.       cur->branch[1] = free_decode;

    432. 

  432.       make_decoder (source, level+1);

    433. 

  433.     } else

    434. 

  434.       cur->leaf = source[16 + t_leaf++];

    435. 

  435.   }

    436. 

  436.   return (uchar *) source + 16 + t_leaf;

    437. 

  437. #ifndef LIBRAW_NOTHREADS

    438. 

  438. #undef t_leaf

    439. 

  439. #endif

    440. 

  440. }

    441. 

  441. 

    442. 

  442. void CLASS crw_init_tables (unsigned table)

    443. 

  443. {

    444. 

  444.   static const uchar first_tree[3][29] = {

    445. 

  445.     { 0,1,4,2,3,1,2,0,0,0,0,0,0,0,0,0,

    446. 

  446.       0x04,0x03,0x05,0x06,0x02,0x07,0x01,0x08,0x09,0x00,0x0a,0x0b,0xff  },

    447. 

  447.     { 0,2,2,3,1,1,1,1,2,0,0,0,0,0,0,0,

    448. 

  448.       0x03,0x02,0x04,0x01,0x05,0x00,0x06,0x07,0x09,0x08,0x0a,0x0b,0xff  },

    449. 

  449.     { 0,0,6,3,1,1,2,0,0,0,0,0,0,0,0,0,

    450. 

  450.       0x06,0x05,0x07,0x04,0x08,0x03,0x09,0x02,0x00,0x0a,0x01,0x0b,0xff  },

    451. 

  451.   };

    452. 

  452.   static const uchar second_tree[3][180] = {

    453. 

  453.     { 0,2,2,2,1,4,2,1,2,5,1,1,0,0,0,139,

    454. 

  454.       0x03,0x04,0x02,0x05,0x01,0x06,0x07,0x08,

    455. 

  455.       0x12,0x13,0x11,0x14,0x09,0x15,0x22,0x00,0x21,0x16,0x0a,0xf0,

    456. 

  456.       0x23,0x17,0x24,0x31,0x32,0x18,0x19,0x33,0x25,0x41,0x34,0x42,

    457. 

  457.       0x35,0x51,0x36,0x37,0x38,0x29,0x79,0x26,0x1a,0x39,0x56,0x57,

    458. 

  458.       0x28,0x27,0x52,0x55,0x58,0x43,0x76,0x59,0x77,0x54,0x61,0xf9,

    459. 

  459.       0x71,0x78,0x75,0x96,0x97,0x49,0xb7,0x53,0xd7,0x74,0xb6,0x98,

    460. 

  460.       0x47,0x48,0x95,0x69,0x99,0x91,0xfa,0xb8,0x68,0xb5,0xb9,0xd6,

    461. 

  461.       0xf7,0xd8,0x67,0x46,0x45,0x94,0x89,0xf8,0x81,0xd5,0xf6,0xb4,

    462. 

  462.       0x88,0xb1,0x2a,0x44,0x72,0xd9,0x87,0x66,0xd4,0xf5,0x3a,0xa7,

    463. 

  463.       0x73,0xa9,0xa8,0x86,0x62,0xc7,0x65,0xc8,0xc9,0xa1,0xf4,0xd1,

    464. 

  464.       0xe9,0x5a,0x92,0x85,0xa6,0xe7,0x93,0xe8,0xc1,0xc6,0x7a,0x64,

    465. 

  465.       0xe1,0x4a,0x6a,0xe6,0xb3,0xf1,0xd3,0xa5,0x8a,0xb2,0x9a,0xba,

    466. 

  466.       0x84,0xa4,0x63,0xe5,0xc5,0xf3,0xd2,0xc4,0x82,0xaa,0xda,0xe4,

    467. 

  467.       0xf2,0xca,0x83,0xa3,0xa2,0xc3,0xea,0xc2,0xe2,0xe3,0xff,0xff  },

    468. 

  468.     { 0,2,2,1,4,1,4,1,3,3,1,0,0,0,0,140,

    469. 

  469.       0x02,0x03,0x01,0x04,0x05,0x12,0x11,0x06,

    470. 

  470.       0x13,0x07,0x08,0x14,0x22,0x09,0x21,0x00,0x23,0x15,0x31,0x32,

    471. 

  471.       0x0a,0x16,0xf0,0x24,0x33,0x41,0x42,0x19,0x17,0x25,0x18,0x51,

    472. 

  472.       0x34,0x43,0x52,0x29,0x35,0x61,0x39,0x71,0x62,0x36,0x53,0x26,

    473. 

  473.       0x38,0x1a,0x37,0x81,0x27,0x91,0x79,0x55,0x45,0x28,0x72,0x59,

    474. 

  474.       0xa1,0xb1,0x44,0x69,0x54,0x58,0xd1,0xfa,0x57,0xe1,0xf1,0xb9,

    475. 

  475.       0x49,0x47,0x63,0x6a,0xf9,0x56,0x46,0xa8,0x2a,0x4a,0x78,0x99,

    476. 

  476.       0x3a,0x75,0x74,0x86,0x65,0xc1,0x76,0xb6,0x96,0xd6,0x89,0x85,

    477. 

  477.       0xc9,0xf5,0x95,0xb4,0xc7,0xf7,0x8a,0x97,0xb8,0x73,0xb7,0xd8,

    478. 

  478.       0xd9,0x87,0xa7,0x7a,0x48,0x82,0x84,0xea,0xf4,0xa6,0xc5,0x5a,

    479. 

  479.       0x94,0xa4,0xc6,0x92,0xc3,0x68,0xb5,0xc8,0xe4,0xe5,0xe6,0xe9,

    480. 

  480.       0xa2,0xa3,0xe3,0xc2,0x66,0x67,0x93,0xaa,0xd4,0xd5,0xe7,0xf8,

    481. 

  481.       0x88,0x9a,0xd7,0x77,0xc4,0x64,0xe2,0x98,0xa5,0xca,0xda,0xe8,

    482. 

  482.       0xf3,0xf6,0xa9,0xb2,0xb3,0xf2,0xd2,0x83,0xba,0xd3,0xff,0xff  },

    483. 

  483.     { 0,0,6,2,1,3,3,2,5,1,2,2,8,10,0,117,

    484. 

  484.       0x04,0x05,0x03,0x06,0x02,0x07,0x01,0x08,

    485. 

  485.       0x09,0x12,0x13,0x14,0x11,0x15,0x0a,0x16,0x17,0xf0,0x00,0x22,

    486. 

  486.       0x21,0x18,0x23,0x19,0x24,0x32,0x31,0x25,0x33,0x38,0x37,0x34,

    487. 

  487.       0x35,0x36,0x39,0x79,0x57,0x58,0x59,0x28,0x56,0x78,0x27,0x41,

    488. 

  488.       0x29,0x77,0x26,0x42,0x76,0x99,0x1a,0x55,0x98,0x97,0xf9,0x48,

    489. 

  489.       0x54,0x96,0x89,0x47,0xb7,0x49,0xfa,0x75,0x68,0xb6,0x67,0x69,

    490. 

  490.       0xb9,0xb8,0xd8,0x52,0xd7,0x88,0xb5,0x74,0x51,0x46,0xd9,0xf8,

    491. 

  491.       0x3a,0xd6,0x87,0x45,0x7a,0x95,0xd5,0xf6,0x86,0xb4,0xa9,0x94,

    492. 

  492.       0x53,0x2a,0xa8,0x43,0xf5,0xf7,0xd4,0x66,0xa7,0x5a,0x44,0x8a,

    493. 

  493.       0xc9,0xe8,0xc8,0xe7,0x9a,0x6a,0x73,0x4a,0x61,0xc7,0xf4,0xc6,

    494. 

  494.       0x65,0xe9,0x72,0xe6,0x71,0x91,0x93,0xa6,0xda,0x92,0x85,0x62,

    495. 

  495.       0xf3,0xc5,0xb2,0xa4,0x84,0xba,0x64,0xa5,0xb3,0xd2,0x81,0xe5,

    496. 

  496.       0xd3,0xaa,0xc4,0xca,0xf2,0xb1,0xe4,0xd1,0x83,0x63,0xea,0xc3,

    497. 

  497.       0xe2,0x82,0xf1,0xa3,0xc2,0xa1,0xc1,0xe3,0xa2,0xe1,0xff,0xff  }

    498. 

  498.   };

    499. 

  499.   if (table > 2) table = 2;

    500. 

  500.   init_decoder();

    501. 

  501.   make_decoder ( first_tree[table], 0);

    502. 

  502.   second_decode = free_decode;

    503. 

  503.   make_decoder (second_tree[table], 0);

    504. 

  504. }

    505. 

  505. 

    506. 

  506. /*

    507. 

  507.    Return 0 if the image starts with compressed data,

    508. 

  508.    1 if it starts with uncompressed low-order bits.

    509. 

  509. 

    510. 

  510.    In Canon compressed data, 0xff is always followed by 0x00.

    511. 

  511.  */

    512. 

  512. int CLASS canon_has_lowbits()

    513. 

  513. {

    514. 

  514.   uchar test[0x4000];

    515. 

  515.   int ret=1, i;

    516. 

  516. 

    517. 

  517.   fseek (ifp, 0, SEEK_SET);

    518. 

  518.   fread (test, 1, sizeof test, ifp);

    519. 

  519.   for (i=540; i < sizeof test - 1; i++)

    520. 

  520.     if (test[i] == 0xff) {

    521. 

  521.       if (test[i+1]) return 1;

    522. 

  522.       ret=0;

    523. 

  523.     }

    524. 

  524.   return ret;

    525. 

  525. }

    526. 

  526. 

    527. 

  527. void CLASS canon_compressed_load_raw()

    528. 

  528. {

    529. 

  529.   ushort *pixel, *prow;

    530. 

  530.   int nblocks, lowbits, i, row, r, col, save, val;

    531. 

  531.   unsigned irow, icol;

    532. 

  532.   struct decode *decode, *dindex;

    533. 

  533.   int block, diffbuf[64], leaf, len, diff, carry=0, pnum=0, base[2];

    534. 

  534.   double dark[2] = { 0,0 };

    535. 

  535.   uchar c;

    536. 

  536. 

    537. 

  537.   crw_init_tables (tiff_compress);

    538. 

  538.   pixel = (ushort *) calloc (raw_width*8, sizeof *pixel);

    539. 

  539.   merror (pixel, "canon_compressed_load_raw()");

    540. 

  540.   lowbits = canon_has_lowbits();

    541. 

  541.   if (!lowbits) maximum = 0x3ff;

    542. 

  542.   fseek (ifp, 540 + lowbits*raw_height*raw_width/4, SEEK_SET);

    543. 

  543.   zero_after_ff = 1;

    544. 

  544.   getbits(-1);

    545. 

  545.   for (row=0; row < raw_height; row+=8) {

    546. 

  546.     nblocks = MIN (8, raw_height-row) * raw_width >> 6;

    547. 

  547.     for (block=0; block < nblocks; block++) {

    548. 

  548.       memset (diffbuf, 0, sizeof diffbuf);

    549. 

  549.       decode = first_decode;

    550. 

  550.       for (i=0; i < 64; i++ ) {

    551. 

  551. 	for (dindex=decode; dindex->branch[0]; )

    552. 

  552. 	  dindex = dindex->branch[getbits(1)];

    553. 

  553. 	leaf = dindex->leaf;

    554. 

  554. 	decode = second_decode;

    555. 

  555. 	if (leaf == 0 && i) break;

    556. 

  556. 	if (leaf == 0xff) continue;

    557. 

  557. 	i  += leaf >> 4;

    558. 

  558. 	len = leaf & 15;

    559. 

  559. 	if (len == 0) continue;

    560. 

  560. 	diff = getbits(len);

    561. 

  561. 	if ((diff & (1 << (len-1))) == 0)

    562. 

  562. 	  diff -= (1 << len) - 1;

    563. 

  563. 	if (i < 64) diffbuf[i] = diff;

    564. 

  564.       }

    565. 

  565.       diffbuf[0] += carry;

    566. 

  566.       carry = diffbuf[0];

    567. 

  567.       for (i=0; i < 64; i++ ) {

    568. 

  568. 	if (pnum++ % raw_width == 0)

    569. 

  569. 	  base[0] = base[1] = 512;

    570. 

  570. 	if ((pixel[(block << 6) + i] = base[i & 1] += diffbuf[i]) >> 10)

    571. 

  571. 	  derror();

    572. 

  572.       }

    573. 

  573.     }

    574. 

  574.     if (lowbits) {

    575. 

  575.       save = ftell(ifp);

    576. 

  576.       fseek (ifp, 26 + row*raw_width/4, SEEK_SET);

    577. 

  577.       for (prow=pixel, i=0; i < raw_width*2; i++) {

    578. 

  578. 	c = fgetc(ifp);

    579. 

  579. 	for (r=0; r < 8; r+=2, prow++) {

    580. 

  580. 	  val = (*prow << 2) + ((c >> r) & 3);

    581. 

  581. 	  if (raw_width == 2672 && val < 512) val += 2;

    582. 

  582. 	  *prow = val;

    583. 

  583. 	}

    584. 

  584.       }

    585. 

  585.       fseek (ifp, save, SEEK_SET);

    586. 

  586.     }

    587. 

  587.     for (r=0; r < 8; r++) {

    588. 

  588.       irow = row - top_margin + r;

    589. 

  589.       if (irow >= height) continue;

    590. 

  590.       for (col=0; col < raw_width; col++) {

    591. 

  591. 	icol = col - left_margin;

    592. 

  592. 	if (icol < width)

    593. 

  593. 	  BAYER(irow,icol) = pixel[r*raw_width+col];

    594. 

  594. 	else if (col > 1)

    595. 

  595. 	  dark[icol & 1] += pixel[r*raw_width+col];

    596. 

  596.       }

    597. 

  597.     }

    598. 

  598.   }

    599. 

  599.   free (pixel);

    600. 

  600.   canon_black (dark);

    601. 

  601. }

    602. 

  602. 

    603. 

  603. #line 885 "dcraw/dcraw.c"

    604. 

  604. int CLASS ljpeg_start (struct jhead *jh, int info_only)

    605. 

  605. {

    606. 

  606.   int c, tag, len;

    607. 

  607.   uchar data[0x10000], *dp;

    608. 

  608. 

    609. 

  609.   if (!info_only) init_decoder();

    610. 

  610.   memset (jh, 0, sizeof *jh);

    611. 

  611.   FORC(6) jh->huff[c] = free_decode;

    612. 

  612.   jh->restart = INT_MAX;

    613. 

  613.   fread (data, 2, 1, ifp);

    614. 

  614.   if (data[1] != 0xd8) return 0;

    615. 

  615.   do {

    616. 

  616.     fread (data, 2, 2, ifp);

    617. 

  617.     tag =  data[0] << 8 | data[1];

    618. 

  618.     len = (data[2] << 8 | data[3]) - 2;

    619. 

  619.     if (tag <= 0xff00) return 0;

    620. 

  620.     fread (data, 1, len, ifp);

    621. 

  621.     switch (tag) {

    622. 

  622.       case 0xffc3:

    623. 

  623. 	jh->sraw = ((data[7] >> 4) * (data[7] & 15) - 1) & 3;

    624. 

  624.       case 0xffc0:

    625. 

  625. 	jh->bits = data[0];

    626. 

  626. 	jh->high = data[1] << 8 | data[2];

    627. 

  627. 	jh->wide = data[3] << 8 | data[4];

    628. 

  628. 	jh->clrs = data[5] + jh->sraw;

    629. 

  629. 	if (len == 9 && !dng_version) getc(ifp);

    630. 

  630. 	break;

    631. 

  631.       case 0xffc4:

    632. 

  632. 	if (info_only) break;

    633. 

  633. 	for (dp = data; dp < data+len && *dp < 4; ) {

    634. 

  634. 	  jh->huff[*dp] = free_decode;

    635. 

  635. 	  dp = make_decoder (++dp, 0);

    636. 

  636. 	}

    637. 

  637. 	break;

    638. 

  638.       case 0xffda:

    639. 

  639. 	jh->psv = data[1+data[0]*2];

    640. 

  640. 	jh->bits -= data[3+data[0]*2] & 15;

    641. 

  641. 	break;

    642. 

  642.       case 0xffdd:

    643. 

  643. 	jh->restart = data[0] << 8 | data[1];

    644. 

  644.     }

    645. 

  645.   } while (tag != 0xffda);

    646. 

  646.   if (info_only) return 1;

    647. 

  647.   if (jh->sraw) {

    648. 

  648.     FORC(4)        jh->huff[2+c] = jh->huff[1];

    649. 

  649.     FORC(jh->sraw) jh->huff[1+c] = jh->huff[0];

    650. 

  650.   }

    651. 

  651.   jh->row = (ushort *) calloc (jh->wide*jh->clrs, 4);

    652. 

  652.   merror (jh->row, "ljpeg_start()");

    653. 

  653.   return zero_after_ff = 1;

    654. 

  654. }

    655. 

  655. 

    656. 

  656. int CLASS ljpeg_diff (struct decode *dindex)

    657. 

  657. {

    658. 

  658.   int len, diff;

    659. 

  659. 

    660. 

  660.   while (dindex->branch[0])

    661. 

  661.     dindex = dindex->branch[getbits(1)];

    662. 

  662.   len = dindex->leaf;

    663. 

  663.   if (len == 16 && (!dng_version || dng_version >= 0x1010000))

    664. 

  664.     return -32768;

    665. 

  665.   diff = getbits(len);

    666. 

  666.   if ((diff & (1 << (len-1))) == 0)

    667. 

  667.     diff -= (1 << len) - 1;

    668. 

  668.   return diff;

    669. 

  669. }

    670. 

  670. 

    671. 

  671. ushort * CLASS ljpeg_row (int jrow, struct jhead *jh)

    672. 

  672. {

    673. 

  673.   int col, c, diff, pred, spred=0;

    674. 

  674.   ushort mark=0, *row[3];

    675. 

  675. 

    676. 

  676.   if (jrow * jh->wide % jh->restart == 0) {

    677. 

  677.     FORC(6) jh->vpred[c] = 1 << (jh->bits-1);

    678. 

  678.     if (jrow)

    679. 

  679.       do mark = (mark << 8) + (c = fgetc(ifp));

    680. 

  680.       while (c != EOF && mark >> 4 != 0xffd);

    681. 

  681.     getbits(-1);

    682. 

  682.   }

    683. 

  683.   FORC3 row[c] = jh->row + jh->wide*jh->clrs*((jrow+c) & 1);

    684. 

  684.   for (col=0; col < jh->wide; col++)

    685. 

  685.     FORC(jh->clrs) {

    686. 

  686.       diff = ljpeg_diff (jh->huff[c]);

    687. 

  687.       if (jh->sraw && c <= jh->sraw && (col | c))

    688. 

  688. 		    pred = spred;

    689. 

  689.       else if (col) pred = row[0][-jh->clrs];

    690. 

  690.       else	    pred = (jh->vpred[c] += diff) - diff;

    691. 

  691.       if (jrow && col) switch (jh->psv) {

    692. 

  692. 	case 1:	break;

    693. 

  693. 	case 2: pred = row[1][0];					break;

    694. 

  694. 	case 3: pred = row[1][-jh->clrs];				break;

    695. 

  695. 	case 4: pred = pred +   row[1][0] - row[1][-jh->clrs];		break;

    696. 

  696. 	case 5: pred = pred + ((row[1][0] - row[1][-jh->clrs]) >> 1);	break;

    697. 

  697. 	case 6: pred = row[1][0] + ((pred - row[1][-jh->clrs]) >> 1);	break;

    698. 

  698. 	case 7: pred = (pred + row[1][0]) >> 1;				break;

    699. 

  699. 	default: pred = 0;

    700. 

  700.       }

    701. 

  701.       if ((**row = pred + diff) >> jh->bits) derror();

    702. 

  702.       if (c <= jh->sraw) spred = **row;

    703. 

  703.       row[0]++; row[1]++;

    704. 

  704.     }

    705. 

  705.   return row[2];

    706. 

  706. }

    707. 

  707. 

    708. 

  708. void CLASS lossless_jpeg_load_raw()

    709. 

  709. {

    710. 

  710.   int jwide, jrow, jcol, val, jidx, i, j, row=0, col=0;

    711. 

  711.   double dark[2] = { 0,0 };

    712. 

  712.   struct jhead jh;

    713. 

  713.   int min=INT_MAX;

    714. 

  714.   ushort *rp;

    715. 

  715. 

    716. 

  716.   if (!ljpeg_start (&jh, 0)) return;

    717. 

  717.   jwide = jh.wide * jh.clrs;

    718. 

  718. 

    719. 

  719.   for (jrow=0; jrow < jh.high; jrow++) {

    720. 

  720.     rp = ljpeg_row (jrow, &jh);

    721. 

  721.     for (jcol=0; jcol < jwide; jcol++) {

    722. 

  722.       val = *rp++;

    723. 

  723.       if (jh.bits <= 12)

    724. 

  724. 	val = curve[val & 0xfff];

    725. 

  725.       if (cr2_slice[0]) {

    726. 

  726. 	jidx = jrow*jwide + jcol;

    727. 

  727. 	i = jidx / (cr2_slice[1]*jh.high);

    728. 

  728. 	if ((j = i >= cr2_slice[0]))

    729. 

  729. 		 i  = cr2_slice[0];

    730. 

  730. 	jidx -= i * (cr2_slice[1]*jh.high);

    731. 

  731. 	row = jidx / cr2_slice[1+j];

    732. 

  732. 	col = jidx % cr2_slice[1+j] + i*cr2_slice[1];

    733. 

  733.       }

    734. 

  734.       if (raw_width == 3984 && (col -= 2) < 0)

    735. 

  735. 	col += (row--,raw_width);

    736. 

  736.       if ((unsigned) (row-top_margin) < height) {

    737. 

  737. 	if ((unsigned) (col-left_margin) < width) {

    738. 

  738. 	  BAYER(row-top_margin,col-left_margin) = val;

    739. 

  739. 	  if (min > val) min = val;

    740. 

  740. 	} else if (col > 1)

    741. 

  741. 	  dark[(col-left_margin) & 1] += val;

    742. 

  742.       }

    743. 

  743.       if (++col >= raw_width)

    744. 

  744. 	col = (row++,0);

    745. 

  745.     }

    746. 

  746.   }

    747. 

  747.   free (jh.row);

    748. 

  748.   canon_black (dark);

    749. 

  749.   if (!strcasecmp(make,"KODAK"))

    750. 

  750.     black = min;

    751. 

  751. }

    752. 

  752. 

    753. 

  753. void CLASS canon_sraw_load_raw()

    754. 

  754. {

    755. 

  755.   struct jhead jh;

    756. 

  756.   short *rp=0, (*ip)[4];

    757. 

  757.   int jwide, slice, scol, ecol, row, col, jrow=0, jcol=0, pix[3], c;

    758. 

  758.   int v[3]={0,0,0}, ver, hue;

    759. 

  759.   char *cp;

    760. 

  760. 

    761. 

  761.   if (!ljpeg_start (&jh, 0)) return;

    762. 

  762.   jwide = (jh.wide >>= 1) * jh.clrs;

    763. 

  763. 

    764. 

  764.   for (ecol=slice=0; slice <= cr2_slice[0]; slice++) {

    765. 

  765.     scol = ecol;

    766. 

  766.     ecol += cr2_slice[1] * 2 / jh.clrs;

    767. 

  767.     if (!cr2_slice[0] || ecol > raw_width-1) ecol = raw_width & -2;

    768. 

  768.     for (row=0; row < height; row += (jh.clrs >> 1) - 1) {

    769. 

  769.       ip = (short (*)[4]) image + row*width;

    770. 

  770.       for (col=scol; col < ecol; col+=2, jcol+=jh.clrs) {

    771. 

  771. 	if ((jcol %= jwide) == 0)

    772. 

  772. 	  rp = (short *) ljpeg_row (jrow++, &jh);

    773. 

  773. 	if (col >= width) continue;

    774. 

  774. 	FORC (jh.clrs-2)

    775. 

  775. 	  ip[col + (c >> 1)*width + (c & 1)][0] = rp[jcol+c];

    776. 

  776. 	ip[col][1] = rp[jcol+jh.clrs-2] - 16384;

    777. 

  777. 	ip[col][2] = rp[jcol+jh.clrs-1] - 16384;

    778. 

  778.       }

    779. 

  779.     }

    780. 

  780.   }

    781. 

  781.   for (cp=model2; *cp && !isdigit(*cp); cp++);

    782. 

  782.   sscanf (cp, "%d.%d.%d", v, v+1, v+2);

    783. 

  783.   ver = (v[0]*1000 + v[1])*1000 + v[2];

    784. 

  784.   hue = (jh.sraw+1) << 2;

    785. 

  785.   if (unique_id == 0x80000218 && ver > 1000006 && ver < 3000000)

    786. 

  786.     hue = jh.sraw << 1;

    787. 

  787.   ip = (short (*)[4]) image;

    788. 

  788.   rp = ip[0];

    789. 

  789.   for (row=0; row < height; row++, ip+=width) {

    790. 

  790.     if (row & (jh.sraw >> 1))

    791. 

  791.       for (col=0; col < width; col+=2)

    792. 

  792. 	for (c=1; c < 3; c++)

    793. 

  793. 	  if (row == height-1)

    794. 

  794. 	       ip[col][c] =  ip[col-width][c];

    795. 

  795. 	  else ip[col][c] = (ip[col-width][c] + ip[col+width][c] + 1) >> 1;

    796. 

  796.     for (col=1; col < width; col+=2)

    797. 

  797.       for (c=1; c < 3; c++)

    798. 

  798. 	if (col == width-1)

    799. 

  799. 	     ip[col][c] =  ip[col-1][c];

    800. 

  800. 	else ip[col][c] = (ip[col-1][c] + ip[col+1][c] + 1) >> 1;

    801. 

  801.   }

    802. 

  802.   for ( ; rp < ip[0]; rp+=4) {

    803. 

  803.     if (unique_id < 0x80000200) {

    804. 

  804.       pix[0] = rp[0] + rp[2] - 512;

    805. 

  805.       pix[2] = rp[0] + rp[1] - 512;

    806. 

  806.       pix[1] = rp[0] + ((-778*rp[1] - (rp[2] << 11)) >> 12) - 512;

    807. 

  807.     } else {

    808. 

  808.       rp[1] = (rp[1] << 2) + hue;

    809. 

  809.       rp[2] = (rp[2] << 2) + hue;

    810. 

  810.       pix[0] = rp[0] + ((  200*rp[1] + 22929*rp[2]) >> 14);

    811. 

  811.       pix[1] = rp[0] + ((-5640*rp[1] - 11751*rp[2]) >> 14);

    812. 

  812.       pix[2] = rp[0] + ((29040*rp[1] -   101*rp[2]) >> 14);

    813. 

  813.     }

    814. 

  814.     FORC3 rp[c] = CLIP(pix[c] * sraw_mul[c] >> 10);

    815. 

  815.   }

    816. 

  816.   free (jh.row);

    817. 

  817.   maximum = 0x3fff;

    818. 

  818. }

    819. 

  819. 

    820. 

  820. void CLASS adobe_copy_pixel (int row, int col, ushort **rp)

    821. 

  821. {

    822. 

  822.   unsigned r, c;

    823. 

  823. 

    824. 

  824.   r = row -= top_margin;

    825. 

  825.   c = col -= left_margin;

    826. 

  826.   if (is_raw == 2 && shot_select) (*rp)++;

    827. 

  827.   if (filters) {

    828. 

  828.     if (fuji_width) {

    829. 

  829.       r = row + fuji_width - 1 - (col >> 1);

    830. 

  830.       c = row + ((col+1) >> 1);

    831. 

  831.     }

    832. 

  832.     if (r < height && c < width)

    833. 

  833.       BAYER(r,c) = **rp < 0x1000 ? curve[**rp] : **rp;

    834. 

  834.     *rp += is_raw;

    835. 

  835.   } else {

    836. 

  836.     if (r < height && c < width)

    837. 

  837.       FORC(tiff_samples)

    838. 

  838. 	image[row*width+col][c] = (*rp)[c] < 0x1000 ? curve[(*rp)[c]]:(*rp)[c];

    839. 

  839.     *rp += tiff_samples;

    840. 

  840.   }

    841. 

  841.   if (is_raw == 2 && shot_select) (*rp)--;

    842. 

  842. }

    843. 

  843. 

    844. 

  844. void CLASS adobe_dng_load_raw_lj()

    845. 

  845. {

    846. 

  846.   unsigned save, trow=0, tcol=0, jwide, jrow, jcol, row, col;

    847. 

  847.   struct jhead jh;

    848. 

  848.   ushort *rp;

    849. 

  849. 

    850. 

  850.   while (trow < raw_height) {

    851. 

  851.     save = ftell(ifp);

    852. 

  852.     if (tile_length < INT_MAX)

    853. 

  853.       fseek (ifp, get4(), SEEK_SET);

    854. 

  854.     if (!ljpeg_start (&jh, 0)) break;

    855. 

  855.     jwide = jh.wide;

    856. 

  856.     if (filters) jwide *= jh.clrs;

    857. 

  857.     jwide /= is_raw;

    858. 

  858.     for (row=col=jrow=0; jrow < jh.high; jrow++) {

    859. 

  859.       rp = ljpeg_row (jrow, &jh);

    860. 

  860.       for (jcol=0; jcol < jwide; jcol++) {

    861. 

  861. 	adobe_copy_pixel (trow+row, tcol+col, &rp);

    862. 

  862. 	if (++col >= tile_width || col >= raw_width)

    863. 

  863. 	  row += 1 + (col = 0);

    864. 

  864.       }

    865. 

  865.     }

    866. 

  866.     fseek (ifp, save+4, SEEK_SET);

    867. 

  867.     if ((tcol += tile_width) >= raw_width)

    868. 

  868.       trow += tile_length + (tcol = 0);

    869. 

  869.     free (jh.row);

    870. 

  870.   }

    871. 

  871. }

    872. 

  872. 

    873. 

  873. void CLASS adobe_dng_load_raw_nc()

    874. 

  874. {

    875. 

  875.   ushort *pixel, *rp;

    876. 

  876.   int row, col;

    877. 

  877. 

    878. 

  878.   pixel = (ushort *) calloc (raw_width * tiff_samples, sizeof *pixel);

    879. 

  879.   merror (pixel, "adobe_dng_load_raw_nc()");

    880. 

  880.   for (row=0; row < raw_height; row++) {

    881. 

  881.     if (tiff_bps == 16)

    882. 

  882.       read_shorts (pixel, raw_width * tiff_samples);

    883. 

  883.     else {

    884. 

  884.       getbits(-1);

    885. 

  885.       for (col=0; col < raw_width * tiff_samples; col++)

    886. 

  886. 	pixel[col] = getbits(tiff_bps);

    887. 

  887.     }

    888. 

  888.     for (rp=pixel, col=0; col < raw_width; col++)

    889. 

  889.       adobe_copy_pixel (row, col, &rp);

    890. 

  890.   }

    891. 

  891.   free (pixel);

    892. 

  892. }

    893. 

  893. 

    894. 

  894. void CLASS pentax_tree()

    895. 

  895. {

    896. 

  896.   ushort bit[2][13];

    897. 

  897.   struct decode *cur;

    898. 

  898.   int c, i, j;

    899. 

  899. 

    900. 

  900.   init_decoder();

    901. 

  901.   FORC(13) bit[0][c] = get2();

    902. 

  902.   FORC(13) bit[1][c] = fgetc(ifp) & 15;

    903. 

  903.   FORC(13) {

    904. 

  904.     cur = first_decode;

    905. 

  905.     for (i=0; i < bit[1][c]; i++) {

    906. 

  906.       j = bit[0][c] >> (11-i) & 1;

    907. 

  907.       if (!cur->branch[j]) cur->branch[j] = ++free_decode;

    908. 

  908.       cur = cur->branch[j];

    909. 

  909.     }

    910. 

  910.     cur->leaf = c;

    911. 

  911.   }

    912. 

  912. }

    913. 

  913. 

    914. 

  914. void CLASS pentax_k10_load_raw()

    915. 

  915. {

    916. 

  916.   int row, col, diff;

    917. 

  917.   ushort vpred[2][2] = {{0,0},{0,0}}, hpred[2];

    918. 

  918. 

    919. 

  919.   getbits(-1);

    920. 

  920.   for (row=0; row < raw_height; row++)

    921. 

  921.       {

    922. 

  922.           if(row >= height) break;

    923. 

  923.     for (col=0; col < raw_width; col++) {

    924. 

  924.       diff = ljpeg_diff (first_decode);

    925. 

  925.       if (col < 2) hpred[col] = vpred[row & 1][col] += diff;

    926. 

  926.       else	   hpred[col & 1] += diff;

    927. 

  927.       if (col < width && row < height)

    928. 

  928. 	BAYER(row,col) = hpred[col & 1];

    929. 

  929.         if (hpred[col & 1] >> 12) derror();

    930. 

  930.     }

    931. 

  931.       }

    932. 

  932. }

    933. 

  933. 

    934. 

  934. void CLASS nikon_compressed_load_raw()

    935. 

  935. {

    936. 

  936.   static const uchar nikon_tree[][32] = {

    937. 

  937.     { 0,1,5,1,1,1,1,1,1,2,0,0,0,0,0,0,	/* 12-bit lossy */

    938. 

  938.       5,4,3,6,2,7,1,0,8,9,11,10,12 },

    939. 

  939.     { 0,1,5,1,1,1,1,1,1,2,0,0,0,0,0,0,	/* 12-bit lossy after split */

    940. 

  940.       0x39,0x5a,0x38,0x27,0x16,5,4,3,2,1,0,11,12,12 },

    941. 

  941.     { 0,1,4,2,3,1,2,0,0,0,0,0,0,0,0,0,  /* 12-bit lossless */

    942. 

  942.       5,4,6,3,7,2,8,1,9,0,10,11,12 },

    943. 

  943.     { 0,1,4,3,1,1,1,1,1,2,0,0,0,0,0,0,	/* 14-bit lossy */

    944. 

  944.       5,6,4,7,8,3,9,2,1,0,10,11,12,13,14 },

    945. 

  945.     { 0,1,5,1,1,1,1,1,1,1,2,0,0,0,0,0,	/* 14-bit lossy after split */

    946. 

  946.       8,0x5c,0x4b,0x3a,0x29,7,6,5,4,3,2,1,0,13,14 },

    947. 

  947.     { 0,1,4,2,2,3,1,2,0,0,0,0,0,0,0,0,	/* 14-bit lossless */

    948. 

  948.       7,6,8,5,9,4,10,3,11,12,2,0,1,13,14 } };

    949. 

  949.   struct decode *dindex;

    950. 

  950.   ushort ver0, ver1, vpred[2][2], hpred[2], csize;

    951. 

  951.   int i, min, max, step=0, huff=0, split=0, row, col, len, shl, diff;

    952. 

  952. 

    953. 

  953.   fseek (ifp, meta_offset, SEEK_SET);

    954. 

  954.   ver0 = fgetc(ifp);

    955. 

  955.   ver1 = fgetc(ifp);

    956. 

  956.   if (ver0 == 0x49 || ver1 == 0x58)

    957. 

  957.     fseek (ifp, 2110, SEEK_CUR);

    958. 

  958.   if (ver0 == 0x46) huff = 2;

    959. 

  959.   if (tiff_bps == 14) huff += 3;

    960. 

  960.   read_shorts (vpred[0], 4);

    961. 

  961.   max = 1 << tiff_bps & 0x7fff;

    962. 

  962.   if ((csize = get2()) > 1)

    963. 

  963.     step = max / (csize-1);

    964. 

  964.   if (ver0 == 0x44 && ver1 == 0x20 && step > 0) {

    965. 

  965.     for (i=0; i < csize; i++)

    966. 

  966.       curve[i*step] = get2();

    967. 

  967.     for (i=0; i < max; i++)

    968. 

  968.       curve[i] = ( curve[i-i%step]*(step-i%step) +

    969. 

  969. 		   curve[i-i%step+step]*(i%step) ) / step;

    970. 

  970.     fseek (ifp, meta_offset+562, SEEK_SET);

    971. 

  971.     split = get2();

    972. 

  972.   } else if (ver0 != 0x46 && csize <= 0x4001)

    973. 

  973.       {

    974. 

  974.     read_shorts (curve, max=csize);

    975. 

  975.       }

    976. 

  976.   while (curve[max-2] == curve[max-1]) max--;

    977. 

  977.   init_decoder();

    978. 

  978.   make_decoder (nikon_tree[huff], 0);

    979. 

  979.   fseek (ifp, data_offset, SEEK_SET);

    980. 

  980.   getbits(-1);

    981. 

  981.   for (min=row=0; row < height; row++) {

    982. 

  982.     if (split && row == split) {

    983. 

  983.       init_decoder();

    984. 

  984.       make_decoder (nikon_tree[huff+1], 0);

    985. 

  985.       max += (min = 16) << 1;

    986. 

  986.     }

    987. 

  987.     for (col=0; col < raw_width; col++) {

    988. 

  988.       for (dindex=first_decode; dindex->branch[0]; )

    989. 

  989. 	dindex = dindex->branch[getbits(1)];

    990. 

  990.       len = dindex->leaf & 15;

    991. 

  991.       shl = dindex->leaf >> 4;

    992. 

  992.       diff = ((getbits(len-shl) << 1) + 1) << shl >> 1;

    993. 

  993.       if ((diff & (1 << (len-1))) == 0)

    994. 

  994. 	diff -= (1 << len) - !shl;

    995. 

  995.       if (col < 2) hpred[col] = vpred[row & 1][col] += diff;

    996. 

  996.       else	   hpred[col & 1] += diff;

    997. 

  997.       if ((ushort)(hpred[col & 1] + min) >= max) derror();

    998. 

  998.       if ((unsigned) (col-left_margin) < width)

    999. 

  999. 	BAYER(row,col-left_margin) =  curve[LIM((short)hpred[col & 1],0,0x3fff)];

    1000. 

  1000. 

    1001. 

  1001.     }

    1002. 

  1002.   }

    1003. 

  1003. }

    1004. 

  1004. 

    1005. 

  1005. /*

    1006. 

  1006.    Figure out if a NEF file is compressed.  These fancy heuristics

    1007. 

  1007.    are only needed for the D100, thanks to a bug in some cameras

    1008. 

  1008.    that tags all images as "compressed".

    1009. 

  1009.  */

    1010. 

  1010. int CLASS nikon_is_compressed()

    1011. 

  1011. {

    1012. 

  1012.   uchar test[256];

    1013. 

  1013.   int i;

    1014. 

  1014. 

    1015. 

  1015.   fseek (ifp, data_offset, SEEK_SET);

    1016. 

  1016.   fread (test, 1, 256, ifp);

    1017. 

  1017.   for (i=15; i < 256; i+=16)

    1018. 

  1018.     if (test[i]) return 1;

    1019. 

  1019.   return 0;

    1020. 

  1020. }

    1021. 

  1021. 

    1022. 

  1022. /*

    1023. 

  1023.    Returns 1 for a Coolpix 995, 0 for anything else.

    1024. 

  1024.  */

    1025. 

  1025. int CLASS nikon_e995()

    1026. 

  1026. {

    1027. 

  1027.   int i, histo[256];

    1028. 

  1028.   const uchar often[] = { 0x00, 0x55, 0xaa, 0xff };

    1029. 

  1029. 

    1030. 

  1030.   memset (histo, 0, sizeof histo);

    1031. 

  1031.   fseek (ifp, -2000, SEEK_END);

    1032. 

  1032.   for (i=0; i < 2000; i++)

    1033. 

  1033.     histo[fgetc(ifp)]++;

    1034. 

  1034.   for (i=0; i < 4; i++)

    1035. 

  1035.     if (histo[often[i]] < 200)

    1036. 

  1036.       return 0;

    1037. 

  1037.   return 1;

    1038. 

  1038. }

    1039. 

  1039. 

    1040. 

  1040. /*

    1041. 

  1041.    Returns 1 for a Coolpix 2100, 0 for anything else.

    1042. 

  1042.  */

    1043. 

  1043. int CLASS nikon_e2100()

    1044. 

  1044. {

    1045. 

  1045.   uchar t[12];

    1046. 

  1046.   int i;

    1047. 

  1047. 

    1048. 

  1048.   fseek (ifp, 0, SEEK_SET);

    1049. 

  1049.   for (i=0; i < 1024; i++) {

    1050. 

  1050.     fread (t, 1, 12, ifp);

    1051. 

  1051.     if (((t[2] & t[4] & t[7] & t[9]) >> 4

    1052. 

  1052. 	& t[1] & t[6] & t[8] & t[11] & 3) != 3)

    1053. 

  1053.       return 0;

    1054. 

  1054.   }

    1055. 

  1055.   return 1;

    1056. 

  1056. }

    1057. 

  1057. 

    1058. 

  1058. void CLASS nikon_3700()

    1059. 

  1059. {

    1060. 

  1060.   int bits, i;

    1061. 

  1061.   uchar dp[24];

    1062. 

  1062.   static const struct {

    1063. 

  1063.     int bits;

    1064. 

  1064.     char t_make[12], t_model[15];

    1065. 

  1065.   } table[] = {

    1066. 

  1066.     { 0x00, "PENTAX",  "Optio 33WR" },

    1067. 

  1067.     { 0x03, "NIKON",   "E3200" },

    1068. 

  1068.     { 0x32, "NIKON",   "E3700" },

    1069. 

  1069.     { 0x33, "OLYMPUS", "C740UZ" } };

    1070. 

  1070. 

    1071. 

  1071.   fseek (ifp, 3072, SEEK_SET);

    1072. 

  1072.   fread (dp, 1, 24, ifp);

    1073. 

  1073.   bits = (dp[8] & 3) << 4 | (dp[20] & 3);

    1074. 

  1074.   for (i=0; i < sizeof table / sizeof *table; i++)

    1075. 

  1075.     if (bits == table[i].bits) {

    1076. 

  1076.       strcpy (make,  table[i].t_make );

    1077. 

  1077.       strcpy (model, table[i].t_model);

    1078. 

  1078.     }

    1079. 

  1079. }

    1080. 

  1080. 

    1081. 

  1081. /*

    1082. 

  1082.    Separates a Minolta DiMAGE Z2 from a Nikon E4300.

    1083. 

  1083.  */

    1084. 

  1084. int CLASS minolta_z2()

    1085. 

  1085. {

    1086. 

  1086.   int i, nz;

    1087. 

  1087.   char tail[424];

    1088. 

  1088. 

    1089. 

  1089.   fseek (ifp, -sizeof tail, SEEK_END);

    1090. 

  1090.   fread (tail, 1, sizeof tail, ifp);

    1091. 

  1091.   for (nz=i=0; i < sizeof tail; i++)

    1092. 

  1092.     if (tail[i]) nz++;

    1093. 

  1093.   return nz > 20;

    1094. 

  1094. }

    1095. 

  1095. 

    1096. 

  1096. /* Here raw_width is in bytes, not pixels. */

    1097. 

  1097. void CLASS nikon_e900_load_raw()

    1098. 

  1098. {

    1099. 

  1099.   int offset=0, irow, row, col;

    1100. 

  1100. 

    1101. 

  1101.   for (irow=0; irow < height; irow++) {

    1102. 

  1102.     row = irow * 2 % height;

    1103. 

  1103.     if (row == 1)

    1104. 

  1104.       offset = - (-offset & -4096);

    1105. 

  1105.     fseek (ifp, offset, SEEK_SET);

    1106. 

  1106.     offset += raw_width;

    1107. 

  1107.     getbits(-1);

    1108. 

  1108.     for (col=0; col < width; col++)

    1109. 

  1109.       BAYER(row,col) = getbits(10);

    1110. 

  1110.   }

    1111. 

  1111. }

    1112. 

  1112. 

    1113. 

  1113. /*

    1114. 

  1114.    The Fuji Super CCD is just a Bayer grid rotated 45 degrees.

    1115. 

  1115.  */

    1116. 

  1116. void CLASS fuji_load_raw()

    1117. 

  1117. {

    1118. 

  1118.   ushort *pixel;

    1119. 

  1119.   int wide, row, col, r, c;

    1120. 

  1120. 

    1121. 

  1121.   fseek (ifp, (top_margin*raw_width + left_margin) * 2, SEEK_CUR);

    1122. 

  1122.   wide = fuji_width << !fuji_layout;

    1123. 

  1123.   pixel = (ushort *) calloc (wide, sizeof *pixel);

    1124. 

  1124.   merror (pixel, "fuji_load_raw()");

    1125. 

  1125.   for (row=0; row < raw_height; row++) {

    1126. 

  1126.     read_shorts (pixel, wide);

    1127. 

  1127.     fseek (ifp, 2*(raw_width - wide), SEEK_CUR);

    1128. 

  1128.     for (col=0; col < wide; col++) {

    1129. 

  1129.       if (fuji_layout) {

    1130. 

  1130. 	r = fuji_width - 1 - col + (row >> 1);

    1131. 

  1131. 	c = col + ((row+1) >> 1);

    1132. 

  1132.       } else {

    1133. 

  1133. 	r = fuji_width - 1 + row - (col >> 1);

    1134. 

  1134. 	c = row + ((col+1) >> 1);

    1135. 

  1135.       }

    1136. 

  1136.       BAYER(r,c) = pixel[col];

    1137. 

  1137.     }

    1138. 

  1138.   }

    1139. 

  1139.   free (pixel);

    1140. 

  1140. }

    1141. 

  1141. #line 1427 "dcraw/dcraw.c"

    1142. 

  1142. void CLASS ppm_thumb (FILE *tfp)

    1143. 

  1143. {

    1144. 

  1144.   char *thumb;

    1145. 

  1145.   thumb_length = thumb_width*thumb_height*3;

    1146. 

  1146.   thumb = (char *) malloc (thumb_length);

    1147. 

  1147.   merror (thumb, "ppm_thumb()");

    1148. 

  1148.   fprintf (tfp, "P6\n%d %d\n255\n", thumb_width, thumb_height);

    1149. 

  1149.   fread  (thumb, 1, thumb_length, ifp);

    1150. 

  1150.   fwrite (thumb, 1, thumb_length, tfp);

    1151. 

  1151.   free (thumb);

    1152. 

  1152. }

    1153. 

  1153. 

    1154. 

  1154. void CLASS layer_thumb (FILE *tfp)

    1155. 

  1155. {

    1156. 

  1156.   int i, c;

    1157. 

  1157.   char *thumb, map[][4] = { "012","102" };

    1158. 

  1158. 

    1159. 

  1159.   colors = thumb_misc >> 5 & 7;

    1160. 

  1160.   thumb_length = thumb_width*thumb_height;

    1161. 

  1161.   thumb = (char *) calloc (colors, thumb_length);

    1162. 

  1162.   merror (thumb, "layer_thumb()");

    1163. 

  1163.   fprintf (tfp, "P%d\n%d %d\n255\n",

    1164. 

  1164. 	5 + (colors >> 1), thumb_width, thumb_height);

    1165. 

  1165.   fread (thumb, thumb_length, colors, ifp);

    1166. 

  1166.   for (i=0; i < thumb_length; i++)

    1167. 

  1167.     FORCC putc (thumb[i+thumb_length*(map[thumb_misc >> 8][c]-'0')], tfp);

    1168. 

  1168.   free (thumb);

    1169. 

  1169. }

    1170. 

  1170. 

    1171. 

  1171. void CLASS rollei_thumb (FILE *tfp)

    1172. 

  1172. {

    1173. 

  1173.   unsigned i;

    1174. 

  1174.   ushort *thumb;

    1175. 

  1175. 

    1176. 

  1176.   thumb_length = thumb_width * thumb_height;

    1177. 

  1177.   thumb = (ushort *) calloc (thumb_length, 2);

    1178. 

  1178.   merror (thumb, "rollei_thumb()");

    1179. 

  1179.   fprintf (tfp, "P6\n%d %d\n255\n", thumb_width, thumb_height);

    1180. 

  1180.   read_shorts (thumb, thumb_length);

    1181. 

  1181.   for (i=0; i < thumb_length; i++) {

    1182. 

  1182.     putc (thumb[i] << 3, tfp);

    1183. 

  1183.     putc (thumb[i] >> 5  << 2, tfp);

    1184. 

  1184.     putc (thumb[i] >> 11 << 3, tfp);

    1185. 

  1185.   }

    1186. 

  1186.   free (thumb);

    1187. 

  1187. }

    1188. 

  1188. 

    1189. 

  1189. void CLASS rollei_load_raw()

    1190. 

  1190. {

    1191. 

  1191.   uchar pixel[10];

    1192. 

  1192.   unsigned iten=0, isix, i, buffer=0, row, col, todo[16];

    1193. 

  1193. 

    1194. 

  1194.   isix = raw_width * raw_height * 5 / 8;

    1195. 

  1195.   while (fread (pixel, 1, 10, ifp) == 10) {

    1196. 

  1196.     for (i=0; i < 10; i+=2) {

    1197. 

  1197.       todo[i]   = iten++;

    1198. 

  1198.       todo[i+1] = pixel[i] << 8 | pixel[i+1];

    1199. 

  1199.       buffer    = pixel[i] >> 2 | buffer << 6;

    1200. 

  1200.     }

    1201. 

  1201.     for (   ; i < 16; i+=2) {

    1202. 

  1202.       todo[i]   = isix++;

    1203. 

  1203.       todo[i+1] = buffer >> (14-i)*5;

    1204. 

  1204.     }

    1205. 

  1205.     for (i=0; i < 16; i+=2) {

    1206. 

  1206.       row = todo[i] / raw_width - top_margin;

    1207. 

  1207.       col = todo[i] % raw_width - left_margin;

    1208. 

  1208.       if (row < height && col < width)

    1209. 

  1209. 	BAYER(row,col) = (todo[i+1] & 0x3ff);

    1210. 

  1210.     }

    1211. 

  1211.   }

    1212. 

  1212.   maximum = 0x3ff;

    1213. 

  1213. }

    1214. 

  1214. 

    1215. 

  1215. int CLASS bayer (unsigned row, unsigned col)

    1216. 

  1216. {

    1217. 

  1217.   return (row < height && col < width) ? BAYER(row,col) : 0;

    1218. 

  1218. }

    1219. 

  1219. 

    1220. 

  1220. void CLASS phase_one_flat_field (int is_float, int nc)

    1221. 

  1221. {

    1222. 

  1222.   ushort head[8];

    1223. 

  1223.   unsigned wide, y, x, c, rend, cend, row, col;

    1224. 

  1224.   float *mrow, num, mult[4];

    1225. 

  1225. 

    1226. 

  1226.   read_shorts (head, 8);

    1227. 

  1227.   wide = head[2] / head[4];

    1228. 

  1228.   mrow = (float *) calloc (nc*wide, sizeof *mrow);

    1229. 

  1229.   merror (mrow, "phase_one_flat_field()");

    1230. 

  1230.   for (y=0; y < head[3] / head[5]; y++) {

    1231. 

  1231.     for (x=0; x < wide; x++)

    1232. 

  1232.       for (c=0; c < nc; c+=2) {

    1233. 

  1233. 	num = is_float ? getreal(11) : get2()/32768.0;

    1234. 

  1234. 	if (y==0) mrow[c*wide+x] = num;

    1235. 

  1235. 	else mrow[(c+1)*wide+x] = (num - mrow[c*wide+x]) / head[5];

    1236. 

  1236.       }

    1237. 

  1237.     if (y==0) continue;

    1238. 

  1238.     rend = head[1]-top_margin + y*head[5];

    1239. 

  1239.     for (row = rend-head[5]; row < height && row < rend; row++) {

    1240. 

  1240.       for (x=1; x < wide; x++) {

    1241. 

  1241. 	for (c=0; c < nc; c+=2) {

    1242. 

  1242. 	  mult[c] = mrow[c*wide+x-1];

    1243. 

  1243. 	  mult[c+1] = (mrow[c*wide+x] - mult[c]) / head[4];

    1244. 

  1244. 	}

    1245. 

  1245. 	cend = head[0]-left_margin + x*head[4];

    1246. 

  1246. 	for (col = cend-head[4]; col < width && col < cend; col++) {

    1247. 

  1247. 	  c = nc > 2 ? FC(row,col) : 0;

    1248. 

  1248. 	  if (!(c & 1)) {

    1249. 

  1249. 	    c = BAYER(row,col) * mult[c];

    1250. 

  1250. 	    BAYER(row,col) = LIM(c,0,65535);

    1251. 

  1251. 	  }

    1252. 

  1252. 	  for (c=0; c < nc; c+=2)

    1253. 

  1253. 	    mult[c] += mult[c+1];

    1254. 

  1254. 	}

    1255. 

  1255.       }

    1256. 

  1256.       for (x=0; x < wide; x++)

    1257. 

  1257. 	for (c=0; c < nc; c+=2)

    1258. 

  1258. 	  mrow[c*wide+x] += mrow[(c+1)*wide+x];

    1259. 

  1259.     }

    1260. 

  1260.   }

    1261. 

  1261.   free (mrow);

    1262. 

  1262. }

    1263. 

  1263. 

    1264. 

  1264. void CLASS phase_one_correct()

    1265. 

  1265. {

    1266. 

  1266.   unsigned entries, tag, data, save, col, row, type;

    1267. 

  1267.   int len, i, j, k, cip, val[4], dev[4], sum, max;

    1268. 

  1268.   int head[9], diff, mindiff=INT_MAX, off_412=0;

    1269. 

  1269.   static const signed char dir[12][2] =

    1270. 

  1270.     { {-1,-1}, {-1,1}, {1,-1}, {1,1}, {-2,0}, {0,-2}, {0,2}, {2,0},

    1271. 

  1271.       {-2,-2}, {-2,2}, {2,-2}, {2,2} };

    1272. 

  1272.   float poly[8], num, cfrac, frac, mult[2], *yval[2];

    1273. 

  1273.   ushort t_curve[0x10000], *xval[2];

    1274. 

  1274. 

    1275. 

  1275.   if (half_size || !meta_length) return;

    1276. 

  1276. #ifdef DCRAW_VERBOSE

    1277. 

  1277.   if (verbose) fprintf (stderr,_("Phase One correction...\n"));

    1278. 

  1278. #endif

    1279. 

  1279.   fseek (ifp, meta_offset, SEEK_SET);

    1280. 

  1280.   order = get2();

    1281. 

  1281.   fseek (ifp, 6, SEEK_CUR);

    1282. 

  1282.   fseek (ifp, meta_offset+get4(), SEEK_SET);

    1283. 

  1283.   entries = get4();  get4();

    1284. 

  1284.   while (entries--) {

    1285. 

  1285.     tag  = get4();

    1286. 

  1286.     len  = get4();

    1287. 

  1287.     data = get4();

    1288. 

  1288.     save = ftell(ifp);

    1289. 

  1289.     fseek (ifp, meta_offset+data, SEEK_SET);

    1290. 

  1290.     if (tag == 0x419) {				/* Polynomial curve */

    1291. 

  1291.       for (get4(), i=0; i < 8; i++)

    1292. 

  1292. 	poly[i] = getreal(11);

    1293. 

  1293.       poly[3] += (ph1.tag_210 - poly[7]) * poly[6] + 1;

    1294. 

  1294.       for (i=0; i < 0x10000; i++) {

    1295. 

  1295. 	num = (poly[5]*i + poly[3])*i + poly[1];

    1296. 

  1296. 	t_curve[i] = LIM(num,0,65535);

    1297. 

  1297.       } goto apply;				/* apply to right half */

    1298. 

  1298.     } else if (tag == 0x41a) {			/* Polynomial curve */

    1299. 

  1299.       for (i=0; i < 4; i++)

    1300. 

  1300. 	poly[i] = getreal(11);

    1301. 

  1301.       for (i=0; i < 0x10000; i++) {

    1302. 

  1302. 	for (num=0, j=4; j--; )

    1303. 

  1303. 	  num = num * i + poly[j];

    1304. 

  1304. 	t_curve[i] = LIM(num+i,0,65535);

    1305. 

  1305.       } apply:					/* apply to whole image */

    1306. 

  1306.       for (row=0; row < height; row++)

    1307. 

  1307. 	for (col = (tag & 1)*ph1.split_col; col < width; col++)

    1308. 

  1308. 	  BAYER(row,col) = t_curve[BAYER(row,col)];

    1309. 

  1309.     } else if (tag == 0x400) {			/* Sensor defects */

    1310. 

  1310.       while ((len -= 8) >= 0) {

    1311. 

  1311. 	col  = get2() - left_margin;

    1312. 

  1312. 	row  = get2() - top_margin;

    1313. 

  1313. 	type = get2(); get2();

    1314. 

  1314. 	if (col >= width) continue;

    1315. 

  1315. 	if (type == 131)			/* Bad column */

    1316. 

  1316. 	  for (row=0; row < height; row++)

    1317. 

  1317. 	    if (FC(row,col) == 1) {

    1318. 

  1318. 	      for (sum=i=0; i < 4; i++)

    1319. 

  1319. 		sum += val[i] = bayer (row+dir[i][0], col+dir[i][1]);

    1320. 

  1320. 	      for (max=i=0; i < 4; i++) {

    1321. 

  1321. 		dev[i] = abs((val[i] << 2) - sum);

    1322. 

  1322. 		if (dev[max] < dev[i]) max = i;

    1323. 

  1323. 	      }

    1324. 

  1324. 	      BAYER(row,col) = (sum - val[max])/3.0 + 0.5;

    1325. 

  1325. 	    } else {

    1326. 

  1326. 	      for (sum=0, i=8; i < 12; i++)

    1327. 

  1327. 		sum += bayer (row+dir[i][0], col+dir[i][1]);

    1328. 

  1328. 	      BAYER(row,col) = 0.5 + sum * 0.0732233 +

    1329. 

  1329. 		(bayer(row,col-2) + bayer(row,col+2)) * 0.3535534;

    1330. 

  1330. 	    }

    1331. 

  1331. 	else if (type == 129) {			/* Bad pixel */

    1332. 

  1332. 	  if (row >= height) continue;

    1333. 

  1333. 	  j = (FC(row,col) != 1) * 4;

    1334. 

  1334. 	  for (sum=0, i=j; i < j+8; i++)

    1335. 

  1335. 	    sum += bayer (row+dir[i][0], col+dir[i][1]);

    1336. 

  1336. 	  BAYER(row,col) = (sum + 4) >> 3;

    1337. 

  1337. 	}

    1338. 

  1338.       }

    1339. 

  1339.     } else if (tag == 0x401) {			/* All-color flat fields */

    1340. 

  1340.       phase_one_flat_field (1, 2);

    1341. 

  1341.     } else if (tag == 0x416 || tag == 0x410) {

    1342. 

  1342.       phase_one_flat_field (0, 2);

    1343. 

  1343.     } else if (tag == 0x40b) {			/* Red+blue flat field */

    1344. 

  1344.       phase_one_flat_field (0, 4);

    1345. 

  1345.     } else if (tag == 0x412) {

    1346. 

  1346.       fseek (ifp, 36, SEEK_CUR);

    1347. 

  1347.       diff = abs (get2() - ph1.tag_21a);

    1348. 

  1348.       if (mindiff > diff) {

    1349. 

  1349. 	mindiff = diff;

    1350. 

  1350. 	off_412 = ftell(ifp) - 38;

    1351. 

  1351.       }

    1352. 

  1352.     }

    1353. 

  1353.     fseek (ifp, save, SEEK_SET);

    1354. 

  1354.   }

    1355. 

  1355.   if (off_412) {

    1356. 

  1356.     fseek (ifp, off_412, SEEK_SET);

    1357. 

  1357.     for (i=0; i < 9; i++) head[i] = get4() & 0x7fff;

    1358. 

  1358.     yval[0] = (float *) calloc (head[1]*head[3] + head[2]*head[4], 6);

    1359. 

  1359.     merror (yval[0], "phase_one_correct()");

    1360. 

  1360.     yval[1] = (float  *) (yval[0] + head[1]*head[3]);

    1361. 

  1361.     xval[0] = (ushort *) (yval[1] + head[2]*head[4]);

    1362. 

  1362.     xval[1] = (ushort *) (xval[0] + head[1]*head[3]);

    1363. 

  1363.     get2();

    1364. 

  1364.     for (i=0; i < 2; i++)

    1365. 

  1365.       for (j=0; j < head[i+1]*head[i+3]; j++)

    1366. 

  1366. 	yval[i][j] = getreal(11);

    1367. 

  1367.     for (i=0; i < 2; i++)

    1368. 

  1368.       for (j=0; j < head[i+1]*head[i+3]; j++)

    1369. 

  1369. 	xval[i][j] = get2();

    1370. 

  1370.     for (row=0; row < height; row++)

    1371. 

  1371.       for (col=0; col < width; col++) {

    1372. 

  1372. 	cfrac = (float) col * head[3] / raw_width;

    1373. 

  1373. 	cfrac -= cip = cfrac;

    1374. 

  1374. 	num = BAYER(row,col) * 0.5;

    1375. 

  1375. 	for (i=cip; i < cip+2; i++) {

    1376. 

  1376. 	  for (k=j=0; j < head[1]; j++)

    1377. 

  1377. 	    if (num < xval[0][k = head[1]*i+j]) break;

    1378. 

  1378. 	  frac = (j == 0 || j == head[1]) ? 0 :

    1379. 

  1379. 		(xval[0][k] - num) / (xval[0][k] - xval[0][k-1]);

    1380. 

  1380. 	  mult[i-cip] = yval[0][k-1] * frac + yval[0][k] * (1-frac);

    1381. 

  1381. 	}

    1382. 

  1382. 	i = ((mult[0] * (1-cfrac) + mult[1] * cfrac)

    1383. 

  1383. 		* (row + top_margin) + num) * 2;

    1384. 

  1384. 	BAYER(row,col) = LIM(i,0,65535);

    1385. 

  1385.       }

    1386. 

  1386.     free (yval[0]);

    1387. 

  1387.   }

    1388. 

  1388. }

    1389. 

  1389. 

    1390. 

  1390. void CLASS phase_one_load_raw()

    1391. 

  1391. {

    1392. 

  1392.   int row, col, a, b;

    1393. 

  1393.   ushort *pixel, akey, bkey, mask;

    1394. 

  1394. 

    1395. 

  1395.   fseek (ifp, ph1.key_off, SEEK_SET);

    1396. 

  1396.   akey = get2();

    1397. 

  1397.   bkey = get2();

    1398. 

  1398.   mask = ph1.format == 1 ? 0x5555:0x1354;

    1399. 

  1399.   fseek (ifp, data_offset + top_margin*raw_width*2, SEEK_SET);

    1400. 

  1400.   pixel = (ushort *) calloc (raw_width, sizeof *pixel);

    1401. 

  1401.   merror (pixel, "phase_one_load_raw()");

    1402. 

  1402.   for (row=0; row < height; row++) {

    1403. 

  1403.     read_shorts (pixel, raw_width);

    1404. 

  1404.     for (col=0; col < raw_width; col+=2) {

    1405. 

  1405.       a = pixel[col+0] ^ akey;

    1406. 

  1406.       b = pixel[col+1] ^ bkey;

    1407. 

  1407.       pixel[col+0] = (a & mask) | (b & ~mask);

    1408. 

  1408.       pixel[col+1] = (b & mask) | (a & ~mask);

    1409. 

  1409.     }

    1410. 

  1410.     for (col=0; col < width; col++)

    1411. 

  1411.       BAYER(row,col) = pixel[col+left_margin];

    1412. 

  1412.   }

    1413. 

  1413.   free (pixel);

    1414. 

  1414.   phase_one_correct();

    1415. 

  1415. }

    1416. 

  1416. 

    1417. 

  1417. unsigned CLASS ph1_bits (int nbits)

    1418. 

  1418. {

    1419. 

  1419. #ifndef LIBRAW_NOTHREADS

    1420. 

  1420. #define bitbuf tls->ph1_bits.bitbuf

    1421. 

  1421. #define vbits  tls->ph1_bits.vbits    

    1422. 

  1422. #else

    1423. 

  1423.   static UINT64 bitbuf=0;

    1424. 

  1424.   static int vbits=0;

    1425. 

  1425. #endif

    1426. 

  1426.   if (nbits == -1)

    1427. 

  1427.     return bitbuf = vbits = 0;

    1428. 

  1428.   if (nbits == 0) return 0;

    1429. 

  1429.   if ((vbits -= nbits) < 0) {

    1430. 

  1430.     bitbuf = bitbuf << 32 | get4();

    1431. 

  1431.     vbits += 32;

    1432. 

  1432.   }

    1433. 

  1433.   return bitbuf << (64-nbits-vbits) >> (64-nbits);

    1434. 

  1434. #ifndef LIBRAW_NOTHREADS

    1435. 

  1435. #undef bitbuf

    1436. 

  1436. #undef vbits

    1437. 

  1437. #endif

    1438. 

  1438. }

    1439. 

  1439. 

    1440. 

  1440. void CLASS phase_one_load_raw_c()

    1441. 

  1441. {

    1442. 

  1442.   static const int length[] = { 8,7,6,9,11,10,5,12,14,13 };

    1443. 

  1443.   int *offset, len[2], pred[2], row, col, i, j;

    1444. 

  1444.   ushort *pixel;

    1445. 

  1445.   short (*t_black)[2];

    1446. 

  1446. 

    1447. 

  1447.   pixel = (ushort *) calloc (raw_width + raw_height*4, 2);

    1448. 

  1448.   merror (pixel, "phase_one_load_raw_c()");

    1449. 

  1449.   offset = (int *) (pixel + raw_width);

    1450. 

  1450.   fseek (ifp, strip_offset, SEEK_SET);

    1451. 

  1451.   for (row=0; row < raw_height; row++)

    1452. 

  1452.     offset[row] = get4();

    1453. 

  1453.   t_black = (short (*)[2]) offset + raw_height;

    1454. 

  1454.   fseek (ifp, ph1.black_off, SEEK_SET);

    1455. 

  1455.   if (ph1.black_off)

    1456. 

  1456.     read_shorts ((ushort *) t_black[0], raw_height*2);

    1457. 

  1457.   for (i=0; i < 256; i++)

    1458. 

  1458.     curve[i] = i*i / 3.969 + 0.5;

    1459. 

  1459.   for (row=0; row < raw_height; row++) {

    1460. 

  1460.     fseek (ifp, data_offset + offset[row], SEEK_SET);

    1461. 

  1461.     ph1_bits(-1);

    1462. 

  1462.     pred[0] = pred[1] = 0;

    1463. 

  1463.     for (col=0; col < raw_width; col++) {

    1464. 

  1464.       if (col >= (raw_width & -8))

    1465. 

  1465. 	len[0] = len[1] = 14;

    1466. 

  1466.       else if ((col & 7) == 0)

    1467. 

  1467. 	for (i=0; i < 2; i++) {

    1468. 

  1468. 	  for (j=0; j < 5 && !ph1_bits(1); j++);

    1469. 

  1469. 	  if (j--) len[i] = length[j*2 + ph1_bits(1)];

    1470. 

  1470. 	}

    1471. 

  1471.       if ((i = len[col & 1]) == 14)

    1472. 

  1472. 	pixel[col] = pred[col & 1] = ph1_bits(16);

    1473. 

  1473.       else

    1474. 

  1474. 	pixel[col] = pred[col & 1] += ph1_bits(i) + 1 - (1 << (i - 1));

    1475. 

  1475.       if (pred[col & 1] >> 16) derror();

    1476. 

  1476.       if (ph1.format == 5 && pixel[col] < 256)

    1477. 

  1477. 	pixel[col] = curve[pixel[col]];

    1478. 

  1478.     }

    1479. 

  1479.     if ((unsigned) (row-top_margin) < height)

    1480. 

  1480.       for (col=0; col < width; col++) {

    1481. 

  1481. 	i = (pixel[col+left_margin] << 2)

    1482. 

  1482. 		- ph1.t_black + t_black[row][col >= ph1.split_col];

    1483. 

  1483. 	if (i > 0) BAYER(row-top_margin,col) = i;

    1484. 

  1484.       }

    1485. 

  1485.   }

    1486. 

  1486.   free (pixel);

    1487. 

  1487.   phase_one_correct();

    1488. 

  1488.   maximum = 0xfffc - ph1.t_black;

    1489. 

  1489. }

    1490. 

  1490. 

    1491. 

  1491. void CLASS hasselblad_load_raw()

    1492. 

  1492. {

    1493. 

  1493.   struct jhead jh;

    1494. 

  1494.   struct decode *dindex;

    1495. 

  1495.   int row, col, pred[2], len[2], diff, i;

    1496. 

  1496. 

    1497. 

  1497.   if (!ljpeg_start (&jh, 0)) return;

    1498. 

  1498.   free (jh.row);

    1499. 

  1499.   order = 0x4949;

    1500. 

  1500.   ph1_bits(-1);

    1501. 

  1501.   for (row=-top_margin; row < raw_height-top_margin; row++) {

    1502. 

  1502.     pred[0] = pred[1] = 0x8000;

    1503. 

  1503.     for (col=-left_margin; col < raw_width-left_margin; col+=2) {

    1504. 

  1504.       for (i=0; i < 2; i++) {

    1505. 

  1505. 	for (dindex=jh.huff[0]; dindex->branch[0]; )

    1506. 

  1506. 	  dindex = dindex->branch[ph1_bits(1)];

    1507. 

  1507. 	len[i] = dindex->leaf;

    1508. 

  1508.       }

    1509. 

  1509.       for (i=0; i < 2; i++) {

    1510. 

  1510. 	diff = ph1_bits(len[i]);

    1511. 

  1511. 	if ((diff & (1 << (len[i]-1))) == 0)

    1512. 

  1512. 	  diff -= (1 << len[i]) - 1;

    1513. 

  1513. 	if (diff == 65535) diff = -32768;

    1514. 

  1514. 	pred[i] += diff;

    1515. 

  1515. 	if (row >= 0 && row < height && (unsigned)(col+i) < width)

    1516. 

  1516. 	  BAYER(row,col+i) = pred[i];

    1517. 

  1517.       }

    1518. 

  1518.     }

    1519. 

  1519.   }

    1520. 

  1520.   maximum = 0xffff;

    1521. 

  1521. }

    1522. 

  1522. 

    1523. 

  1523. void CLASS leaf_hdr_load_raw()

    1524. 

  1524. {

    1525. 

  1525.   ushort *pixel;

    1526. 

  1526.   unsigned tile=0, r, c, row, col;

    1527. 

  1527. 

    1528. 

  1528.   pixel = (ushort *) calloc (raw_width, sizeof *pixel);

    1529. 

  1529.   merror (pixel, "leaf_hdr_load_raw()");

    1530. 

  1530.   FORC(tiff_samples)

    1531. 

  1531.     for (r=0; r < raw_height; r++) {

    1532. 

  1532.       if (r % tile_length == 0) {

    1533. 

  1533. 	fseek (ifp, data_offset + 4*tile++, SEEK_SET);

    1534. 

  1534. 	fseek (ifp, get4() + 2*left_margin, SEEK_SET);

    1535. 

  1535.       }

    1536. 

  1536.       if (filters && c != shot_select) continue;

    1537. 

  1537.       read_shorts (pixel, raw_width);

    1538. 

  1538.       if ((row = r - top_margin) >= height) continue;

    1539. 

  1539.       for (col=0; col < width; col++)

    1540. 

  1540. 	if (filters)  BAYER(row,col) = pixel[col];

    1541. 

  1541. 	else image[row*width+col][c] = pixel[col];

    1542. 

  1542.     }

    1543. 

  1543.   free (pixel);

    1544. 

  1544.   if (!filters) {

    1545. 

  1545.     maximum = 0xffff;

    1546. 

  1546.     raw_color = 1;

    1547. 

  1547.   }

    1548. 

  1548. }

    1549. 

  1549. 

    1550. 

  1550. #line 1839 "dcraw/dcraw.c"

    1551. 

  1551. void CLASS sinar_4shot_load_raw()

    1552. 

  1552. {

    1553. 

  1553.   ushort *pixel;

    1554. 

  1554.   unsigned shot, row, col, r, c;

    1555. 

  1555. 

    1556. 

  1556.   if ((shot = shot_select) || half_size) {

    1557. 

  1557.     if (shot) shot--;

    1558. 

  1558.     if (shot > 3) shot = 3;

    1559. 

  1559.     fseek (ifp, data_offset + shot*4, SEEK_SET);

    1560. 

  1560.     fseek (ifp, get4(), SEEK_SET);

    1561. 

  1561.     unpacked_load_raw();

    1562. 

  1562.     return;

    1563. 

  1563.   }

    1564. 

  1564.   free (image);

    1565. 

  1565.   image = (ushort (*)[4])

    1566. 

  1566. 	calloc ((iheight=height)*(iwidth=width), sizeof *image);

    1567. 

  1567.   merror (image, "sinar_4shot_load_raw()");

    1568. 

  1568.   pixel = (ushort *) calloc (raw_width, sizeof *pixel);

    1569. 

  1569.   merror (pixel, "sinar_4shot_load_raw()");

    1570. 

  1570.   for (shot=0; shot < 4; shot++) {

    1571. 

  1571.     fseek (ifp, data_offset + shot*4, SEEK_SET);

    1572. 

  1572.     fseek (ifp, get4(), SEEK_SET);

    1573. 

  1573.     for (row=0; row < raw_height; row++) {

    1574. 

  1574.       read_shorts (pixel, raw_width);

    1575. 

  1575.       if ((r = row-top_margin - (shot >> 1 & 1)) >= height) continue;

    1576. 

  1576.       for (col=0; col < raw_width; col++) {

    1577. 

  1577. 	if ((c = col-left_margin - (shot & 1)) >= width) continue;

    1578. 

  1578.         image[r*width+c][FC(row,col)] = pixel[col];

    1579. 

  1579.       }

    1580. 

  1580.     }

    1581. 

  1581.   }

    1582. 

  1582.   free (pixel);

    1583. 

  1583.   shrink = filters = 0;

    1584. 

  1584. }

    1585. 

  1585. 

    1586. 

  1586. void CLASS imacon_full_load_raw()

    1587. 

  1587. {

    1588. 

  1588.   int row, col;

    1589. 

  1589. 

    1590. 

  1590.   for (row=0; row < height; row++)

    1591. 

  1591.     for (col=0; col < width; col++)

    1592. 

  1592.       read_shorts (image[row*width+col], 3);

    1593. 

  1593. }

    1594. 

  1594. 

    1595. 

  1595. void CLASS packed_12_load_raw()

    1596. 

  1596. {

    1597. 

  1597.   int vbits=0, rbits=0, irow, row, col;

    1598. 

  1598.   UINT64 bitbuf=0;

    1599. 

  1599. 

    1600. 

  1600.   if (raw_width * 2 >= width * 3) {	/* If raw_width is in bytes, */

    1601. 

  1601.     rbits = raw_width * 8;

    1602. 

  1602.     raw_width = raw_width * 2 / 3;	/* convert it to pixels and  */

    1603. 

  1603.     rbits -= raw_width * 12;		/* save the remainder.       */

    1604. 

  1604.   }

    1605. 

  1605.   order = load_flags & 1 ? 0x4949 : 0x4d4d;

    1606. 

  1606.   for (irow=0; irow < height; irow++) {

    1607. 

  1607.     row = irow;

    1608. 

  1608.     if (load_flags & 2 &&

    1609. 

  1609. 	(row = irow * 2 % height + irow / (height/2)) == 1 &&

    1610. 

  1610. 	load_flags & 4) {

    1611. 

  1611.       if (vbits=0, tiff_compress)

    1612. 

  1612. 	fseek (ifp, data_offset - (-width*height*3/4 & -2048), SEEK_SET);

    1613. 

  1613.       else {

    1614. 

  1614. 	fseek (ifp, 0, SEEK_END);

    1615. 

  1615. 	fseek (ifp, ftell(ifp)/2, SEEK_SET);

    1616. 

  1616.       }

    1617. 

  1617.     }

    1618. 

  1618.     for (col=0; col < raw_width; col++) {

    1619. 

  1619.       if ((vbits -= 12) < 0) {

    1620. 

  1620. 	bitbuf = bitbuf << 32 | get4();

    1621. 

  1621. 	vbits += 32;

    1622. 

  1622.       }

    1623. 

  1623.       if ((unsigned) (col-left_margin) < width)

    1624. 

  1624. 	BAYER(row,col-left_margin) = bitbuf << (52-vbits) >> 52;

    1625. 

  1625.       if (load_flags & 8 && (col % 10) == 9)

    1626. 

  1626. 	if (vbits=0, bitbuf & 255) derror();

    1627. 

  1627.     }

    1628. 

  1628.     vbits -= rbits;

    1629. 

  1629.   }

    1630. 

  1630.   if (!strcmp(make,"OLYMPUS")) black >>= 4;

    1631. 

  1631. }

    1632. 

  1632. 

    1633. 

  1633. void CLASS unpacked_load_raw()

    1634. 

  1634. {

    1635. 

  1635.   ushort *pixel;

    1636. 

  1636.   int row, col, bits=0;

    1637. 

  1637. 

    1638. 

  1638.   while (1 << ++bits < maximum);

    1639. 

  1639.   fseek (ifp, (top_margin*raw_width + left_margin) * 2, SEEK_CUR);

    1640. 

  1640.   pixel = (ushort *) calloc (width, sizeof *pixel);

    1641. 

  1641.   merror (pixel, "unpacked_load_raw()");

    1642. 

  1642.   for (row=0; row < height; row++) {

    1643. 

  1643.     read_shorts (pixel, width);

    1644. 

  1644.     fseek (ifp, 2*(raw_width - width), SEEK_CUR);

    1645. 

  1645.     for (col=0; col < width; col++)

    1646. 

  1646.       if ((BAYER2(row,col) = pixel[col]) >> bits) derror();

    1647. 

  1647.   }

    1648. 

  1648.   free (pixel);

    1649. 

  1649. }

    1650. 

  1650. 

    1651. 

  1651. void CLASS nokia_load_raw()

    1652. 

  1652. {

    1653. 

  1653.   uchar  *data,  *dp;

    1654. 

  1654.   ushort *pixel, *pix;

    1655. 

  1655.   int dwide, row, c;

    1656. 

  1656. 

    1657. 

  1657.   dwide = raw_width * 5 / 4;

    1658. 

  1658.   data = (uchar *) malloc (dwide + raw_width*2);

    1659. 

  1659.   merror (data, "nokia_load_raw()");

    1660. 

  1660.   pixel = (ushort *) (data + dwide);

    1661. 

  1661.   for (row=0; row < raw_height; row++) {

    1662. 

  1662.     if (fread (data, 1, dwide, ifp) < dwide) derror();

    1663. 

  1663.     for (dp=data, pix=pixel; pix < pixel+raw_width; dp+=5, pix+=4)

    1664. 

  1664.       FORC4 pix[c] = (dp[c] << 2) | (dp[4] >> (c << 1) & 3);

    1665. 

  1665.     if (row < top_margin)

    1666. 

  1666.       FORC(width) black += pixel[c];

    1667. 

  1667.     else

    1668. 

  1668.       FORC(width) BAYER(row-top_margin,c) = pixel[c];

    1669. 

  1669.   }

    1670. 

  1670.   free (data);

    1671. 

  1671.   if (top_margin) black /= top_margin * width;

    1672. 

  1672.   maximum = 0x3ff;

    1673. 

  1673. }

    1674. 

  1674. 

    1675. 

  1675. unsigned CLASS pana_bits (int nbits)

    1676. 

  1676. {

    1677. 

  1677. #ifndef LIBRAW_NOTHREADS

    1678. 

  1678. #define buf tls->pana_bits.buf

    1679. 

  1679. #define vbits tls->pana_bits.vbits   

    1680. 

  1680. #else

    1681. 

  1681.   static uchar buf[0x4000];

    1682. 

  1682.   static int vbits;

    1683. 

  1683. #endif

    1684. 

  1684.   int byte;

    1685. 

  1685. 

    1686. 

  1686.   if (!nbits) return vbits=0;

    1687. 

  1687.   if (!vbits) {

    1688. 

  1688.     fread (buf+load_flags, 1, 0x4000-load_flags,…
    1689.

Large files files are truncated, but you can click here to view the full file