iterator.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456
  1. // Copyright 2011 Google Inc. All Rights Reserved.
  2. //
  3. // Use of this source code is governed by a BSD-style license
  4. // that can be found in the COPYING file in the root of the source
  5. // tree. An additional intellectual property rights grant can be found
  6. // in the file PATENTS. All contributing project authors may
  7. // be found in the AUTHORS file in the root of the source tree.
  8. // -----------------------------------------------------------------------------
  9. //
  10. // VP8Iterator: block iterator
  11. //
  12. // Author: Skal (pascal.massimino@gmail.com)
  13. #include <string.h>
  14. #include "./vp8enci.h"
  15. //------------------------------------------------------------------------------
  16. // VP8Iterator
  17. //------------------------------------------------------------------------------
  18. static void InitLeft(VP8EncIterator* const it) {
  19. it->y_left_[-1] = it->u_left_[-1] = it->v_left_[-1] =
  20. (it->y_ > 0) ? 129 : 127;
  21. memset(it->y_left_, 129, 16);
  22. memset(it->u_left_, 129, 8);
  23. memset(it->v_left_, 129, 8);
  24. it->left_nz_[8] = 0;
  25. }
  26. static void InitTop(VP8EncIterator* const it) {
  27. const VP8Encoder* const enc = it->enc_;
  28. const size_t top_size = enc->mb_w_ * 16;
  29. memset(enc->y_top_, 127, 2 * top_size);
  30. memset(enc->nz_, 0, enc->mb_w_ * sizeof(*enc->nz_));
  31. }
  32. void VP8IteratorSetRow(VP8EncIterator* const it, int y) {
  33. VP8Encoder* const enc = it->enc_;
  34. it->x_ = 0;
  35. it->y_ = y;
  36. it->bw_ = &enc->parts_[y & (enc->num_parts_ - 1)];
  37. it->preds_ = enc->preds_ + y * 4 * enc->preds_w_;
  38. it->nz_ = enc->nz_;
  39. it->mb_ = enc->mb_info_ + y * enc->mb_w_;
  40. it->y_top_ = enc->y_top_;
  41. it->uv_top_ = enc->uv_top_;
  42. InitLeft(it);
  43. }
  44. void VP8IteratorReset(VP8EncIterator* const it) {
  45. VP8Encoder* const enc = it->enc_;
  46. VP8IteratorSetRow(it, 0);
  47. VP8IteratorSetCountDown(it, enc->mb_w_ * enc->mb_h_); // default
  48. InitTop(it);
  49. InitLeft(it);
  50. memset(it->bit_count_, 0, sizeof(it->bit_count_));
  51. it->do_trellis_ = 0;
  52. }
  53. void VP8IteratorSetCountDown(VP8EncIterator* const it, int count_down) {
  54. it->count_down_ = it->count_down0_ = count_down;
  55. }
  56. int VP8IteratorIsDone(const VP8EncIterator* const it) {
  57. return (it->count_down_ <= 0);
  58. }
  59. void VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it) {
  60. it->enc_ = enc;
  61. it->y_stride_ = enc->pic_->y_stride;
  62. it->uv_stride_ = enc->pic_->uv_stride;
  63. it->yuv_in_ = (uint8_t*)DO_ALIGN(it->yuv_mem_);
  64. it->yuv_out_ = it->yuv_in_ + YUV_SIZE;
  65. it->yuv_out2_ = it->yuv_out_ + YUV_SIZE;
  66. it->yuv_p_ = it->yuv_out2_ + YUV_SIZE;
  67. it->lf_stats_ = enc->lf_stats_;
  68. it->percent0_ = enc->percent_;
  69. it->y_left_ = (uint8_t*)DO_ALIGN(it->yuv_left_mem_ + 1);
  70. it->u_left_ = it->y_left_ + 16 + 16;
  71. it->v_left_ = it->u_left_ + 16;
  72. VP8IteratorReset(it);
  73. }
  74. int VP8IteratorProgress(const VP8EncIterator* const it, int delta) {
  75. VP8Encoder* const enc = it->enc_;
  76. if (delta && enc->pic_->progress_hook != NULL) {
  77. const int done = it->count_down0_ - it->count_down_;
  78. const int percent = (it->count_down0_ <= 0)
  79. ? it->percent0_
  80. : it->percent0_ + delta * done / it->count_down0_;
  81. return WebPReportProgress(enc->pic_, percent, &enc->percent_);
  82. }
  83. return 1;
  84. }
  85. //------------------------------------------------------------------------------
  86. // Import the source samples into the cache. Takes care of replicating
  87. // boundary pixels if necessary.
  88. static WEBP_INLINE int MinSize(int a, int b) { return (a < b) ? a : b; }
  89. static void ImportBlock(const uint8_t* src, int src_stride,
  90. uint8_t* dst, int w, int h, int size) {
  91. int i;
  92. for (i = 0; i < h; ++i) {
  93. memcpy(dst, src, w);
  94. if (w < size) {
  95. memset(dst + w, dst[w - 1], size - w);
  96. }
  97. dst += BPS;
  98. src += src_stride;
  99. }
  100. for (i = h; i < size; ++i) {
  101. memcpy(dst, dst - BPS, size);
  102. dst += BPS;
  103. }
  104. }
  105. static void ImportLine(const uint8_t* src, int src_stride,
  106. uint8_t* dst, int len, int total_len) {
  107. int i;
  108. for (i = 0; i < len; ++i, src += src_stride) dst[i] = *src;
  109. for (; i < total_len; ++i) dst[i] = dst[len - 1];
  110. }
  111. void VP8IteratorImport(VP8EncIterator* const it, uint8_t* tmp_32) {
  112. const VP8Encoder* const enc = it->enc_;
  113. const int x = it->x_, y = it->y_;
  114. const WebPPicture* const pic = enc->pic_;
  115. const uint8_t* const ysrc = pic->y + (y * pic->y_stride + x) * 16;
  116. const uint8_t* const usrc = pic->u + (y * pic->uv_stride + x) * 8;
  117. const uint8_t* const vsrc = pic->v + (y * pic->uv_stride + x) * 8;
  118. const int w = MinSize(pic->width - x * 16, 16);
  119. const int h = MinSize(pic->height - y * 16, 16);
  120. const int uv_w = (w + 1) >> 1;
  121. const int uv_h = (h + 1) >> 1;
  122. ImportBlock(ysrc, pic->y_stride, it->yuv_in_ + Y_OFF, w, h, 16);
  123. ImportBlock(usrc, pic->uv_stride, it->yuv_in_ + U_OFF, uv_w, uv_h, 8);
  124. ImportBlock(vsrc, pic->uv_stride, it->yuv_in_ + V_OFF, uv_w, uv_h, 8);
  125. if (tmp_32 == NULL) return;
  126. // Import source (uncompressed) samples into boundary.
  127. if (x == 0) {
  128. InitLeft(it);
  129. } else {
  130. if (y == 0) {
  131. it->y_left_[-1] = it->u_left_[-1] = it->v_left_[-1] = 127;
  132. } else {
  133. it->y_left_[-1] = ysrc[- 1 - pic->y_stride];
  134. it->u_left_[-1] = usrc[- 1 - pic->uv_stride];
  135. it->v_left_[-1] = vsrc[- 1 - pic->uv_stride];
  136. }
  137. ImportLine(ysrc - 1, pic->y_stride, it->y_left_, h, 16);
  138. ImportLine(usrc - 1, pic->uv_stride, it->u_left_, uv_h, 8);
  139. ImportLine(vsrc - 1, pic->uv_stride, it->v_left_, uv_h, 8);
  140. }
  141. it->y_top_ = tmp_32 + 0;
  142. it->uv_top_ = tmp_32 + 16;
  143. if (y == 0) {
  144. memset(tmp_32, 127, 32 * sizeof(*tmp_32));
  145. } else {
  146. ImportLine(ysrc - pic->y_stride, 1, tmp_32, w, 16);
  147. ImportLine(usrc - pic->uv_stride, 1, tmp_32 + 16, uv_w, 8);
  148. ImportLine(vsrc - pic->uv_stride, 1, tmp_32 + 16 + 8, uv_w, 8);
  149. }
  150. }
  151. //------------------------------------------------------------------------------
  152. // Copy back the compressed samples into user space if requested.
  153. static void ExportBlock(const uint8_t* src, uint8_t* dst, int dst_stride,
  154. int w, int h) {
  155. while (h-- > 0) {
  156. memcpy(dst, src, w);
  157. dst += dst_stride;
  158. src += BPS;
  159. }
  160. }
  161. void VP8IteratorExport(const VP8EncIterator* const it) {
  162. const VP8Encoder* const enc = it->enc_;
  163. if (enc->config_->show_compressed) {
  164. const int x = it->x_, y = it->y_;
  165. const uint8_t* const ysrc = it->yuv_out_ + Y_OFF;
  166. const uint8_t* const usrc = it->yuv_out_ + U_OFF;
  167. const uint8_t* const vsrc = it->yuv_out_ + V_OFF;
  168. const WebPPicture* const pic = enc->pic_;
  169. uint8_t* const ydst = pic->y + (y * pic->y_stride + x) * 16;
  170. uint8_t* const udst = pic->u + (y * pic->uv_stride + x) * 8;
  171. uint8_t* const vdst = pic->v + (y * pic->uv_stride + x) * 8;
  172. int w = (pic->width - x * 16);
  173. int h = (pic->height - y * 16);
  174. if (w > 16) w = 16;
  175. if (h > 16) h = 16;
  176. // Luma plane
  177. ExportBlock(ysrc, ydst, pic->y_stride, w, h);
  178. { // U/V planes
  179. const int uv_w = (w + 1) >> 1;
  180. const int uv_h = (h + 1) >> 1;
  181. ExportBlock(usrc, udst, pic->uv_stride, uv_w, uv_h);
  182. ExportBlock(vsrc, vdst, pic->uv_stride, uv_w, uv_h);
  183. }
  184. }
  185. }
  186. //------------------------------------------------------------------------------
  187. // Non-zero contexts setup/teardown
  188. // Nz bits:
  189. // 0 1 2 3 Y
  190. // 4 5 6 7
  191. // 8 9 10 11
  192. // 12 13 14 15
  193. // 16 17 U
  194. // 18 19
  195. // 20 21 V
  196. // 22 23
  197. // 24 DC-intra16
  198. // Convert packed context to byte array
  199. #define BIT(nz, n) (!!((nz) & (1 << (n))))
  200. void VP8IteratorNzToBytes(VP8EncIterator* const it) {
  201. const int tnz = it->nz_[0], lnz = it->nz_[-1];
  202. int* const top_nz = it->top_nz_;
  203. int* const left_nz = it->left_nz_;
  204. // Top-Y
  205. top_nz[0] = BIT(tnz, 12);
  206. top_nz[1] = BIT(tnz, 13);
  207. top_nz[2] = BIT(tnz, 14);
  208. top_nz[3] = BIT(tnz, 15);
  209. // Top-U
  210. top_nz[4] = BIT(tnz, 18);
  211. top_nz[5] = BIT(tnz, 19);
  212. // Top-V
  213. top_nz[6] = BIT(tnz, 22);
  214. top_nz[7] = BIT(tnz, 23);
  215. // DC
  216. top_nz[8] = BIT(tnz, 24);
  217. // left-Y
  218. left_nz[0] = BIT(lnz, 3);
  219. left_nz[1] = BIT(lnz, 7);
  220. left_nz[2] = BIT(lnz, 11);
  221. left_nz[3] = BIT(lnz, 15);
  222. // left-U
  223. left_nz[4] = BIT(lnz, 17);
  224. left_nz[5] = BIT(lnz, 19);
  225. // left-V
  226. left_nz[6] = BIT(lnz, 21);
  227. left_nz[7] = BIT(lnz, 23);
  228. // left-DC is special, iterated separately
  229. }
  230. void VP8IteratorBytesToNz(VP8EncIterator* const it) {
  231. uint32_t nz = 0;
  232. const int* const top_nz = it->top_nz_;
  233. const int* const left_nz = it->left_nz_;
  234. // top
  235. nz |= (top_nz[0] << 12) | (top_nz[1] << 13);
  236. nz |= (top_nz[2] << 14) | (top_nz[3] << 15);
  237. nz |= (top_nz[4] << 18) | (top_nz[5] << 19);
  238. nz |= (top_nz[6] << 22) | (top_nz[7] << 23);
  239. nz |= (top_nz[8] << 24); // we propagate the _top_ bit, esp. for intra4
  240. // left
  241. nz |= (left_nz[0] << 3) | (left_nz[1] << 7);
  242. nz |= (left_nz[2] << 11);
  243. nz |= (left_nz[4] << 17) | (left_nz[6] << 21);
  244. *it->nz_ = nz;
  245. }
  246. #undef BIT
  247. //------------------------------------------------------------------------------
  248. // Advance to the next position, doing the bookkeeping.
  249. void VP8IteratorSaveBoundary(VP8EncIterator* const it) {
  250. VP8Encoder* const enc = it->enc_;
  251. const int x = it->x_, y = it->y_;
  252. const uint8_t* const ysrc = it->yuv_out_ + Y_OFF;
  253. const uint8_t* const uvsrc = it->yuv_out_ + U_OFF;
  254. if (x < enc->mb_w_ - 1) { // left
  255. int i;
  256. for (i = 0; i < 16; ++i) {
  257. it->y_left_[i] = ysrc[15 + i * BPS];
  258. }
  259. for (i = 0; i < 8; ++i) {
  260. it->u_left_[i] = uvsrc[7 + i * BPS];
  261. it->v_left_[i] = uvsrc[15 + i * BPS];
  262. }
  263. // top-left (before 'top'!)
  264. it->y_left_[-1] = it->y_top_[15];
  265. it->u_left_[-1] = it->uv_top_[0 + 7];
  266. it->v_left_[-1] = it->uv_top_[8 + 7];
  267. }
  268. if (y < enc->mb_h_ - 1) { // top
  269. memcpy(it->y_top_, ysrc + 15 * BPS, 16);
  270. memcpy(it->uv_top_, uvsrc + 7 * BPS, 8 + 8);
  271. }
  272. }
  273. int VP8IteratorNext(VP8EncIterator* const it) {
  274. it->preds_ += 4;
  275. it->mb_ += 1;
  276. it->nz_ += 1;
  277. it->y_top_ += 16;
  278. it->uv_top_ += 16;
  279. it->x_ += 1;
  280. if (it->x_ == it->enc_->mb_w_) {
  281. VP8IteratorSetRow(it, ++it->y_);
  282. }
  283. return (0 < --it->count_down_);
  284. }
  285. //------------------------------------------------------------------------------
  286. // Helper function to set mode properties
  287. void VP8SetIntra16Mode(const VP8EncIterator* const it, int mode) {
  288. uint8_t* preds = it->preds_;
  289. int y;
  290. for (y = 0; y < 4; ++y) {
  291. memset(preds, mode, 4);
  292. preds += it->enc_->preds_w_;
  293. }
  294. it->mb_->type_ = 1;
  295. }
  296. void VP8SetIntra4Mode(const VP8EncIterator* const it, const uint8_t* modes) {
  297. uint8_t* preds = it->preds_;
  298. int y;
  299. for (y = 4; y > 0; --y) {
  300. memcpy(preds, modes, 4 * sizeof(*modes));
  301. preds += it->enc_->preds_w_;
  302. modes += 4;
  303. }
  304. it->mb_->type_ = 0;
  305. }
  306. void VP8SetIntraUVMode(const VP8EncIterator* const it, int mode) {
  307. it->mb_->uv_mode_ = mode;
  308. }
  309. void VP8SetSkip(const VP8EncIterator* const it, int skip) {
  310. it->mb_->skip_ = skip;
  311. }
  312. void VP8SetSegment(const VP8EncIterator* const it, int segment) {
  313. it->mb_->segment_ = segment;
  314. }
  315. //------------------------------------------------------------------------------
  316. // Intra4x4 sub-blocks iteration
  317. //
  318. // We store and update the boundary samples into an array of 37 pixels. They
  319. // are updated as we iterate and reconstructs each intra4x4 blocks in turn.
  320. // The position of the samples has the following snake pattern:
  321. //
  322. // 16|17 18 19 20|21 22 23 24|25 26 27 28|29 30 31 32|33 34 35 36 <- Top-right
  323. // --+-----------+-----------+-----------+-----------+
  324. // 15| 19| 23| 27| 31|
  325. // 14| 18| 22| 26| 30|
  326. // 13| 17| 21| 25| 29|
  327. // 12|13 14 15 16|17 18 19 20|21 22 23 24|25 26 27 28|
  328. // --+-----------+-----------+-----------+-----------+
  329. // 11| 15| 19| 23| 27|
  330. // 10| 14| 18| 22| 26|
  331. // 9| 13| 17| 21| 25|
  332. // 8| 9 10 11 12|13 14 15 16|17 18 19 20|21 22 23 24|
  333. // --+-----------+-----------+-----------+-----------+
  334. // 7| 11| 15| 19| 23|
  335. // 6| 10| 14| 18| 22|
  336. // 5| 9| 13| 17| 21|
  337. // 4| 5 6 7 8| 9 10 11 12|13 14 15 16|17 18 19 20|
  338. // --+-----------+-----------+-----------+-----------+
  339. // 3| 7| 11| 15| 19|
  340. // 2| 6| 10| 14| 18|
  341. // 1| 5| 9| 13| 17|
  342. // 0| 1 2 3 4| 5 6 7 8| 9 10 11 12|13 14 15 16|
  343. // --+-----------+-----------+-----------+-----------+
  344. // Array to record the position of the top sample to pass to the prediction
  345. // functions in dsp.c.
  346. static const uint8_t VP8TopLeftI4[16] = {
  347. 17, 21, 25, 29,
  348. 13, 17, 21, 25,
  349. 9, 13, 17, 21,
  350. 5, 9, 13, 17
  351. };
  352. void VP8IteratorStartI4(VP8EncIterator* const it) {
  353. const VP8Encoder* const enc = it->enc_;
  354. int i;
  355. it->i4_ = 0; // first 4x4 sub-block
  356. it->i4_top_ = it->i4_boundary_ + VP8TopLeftI4[0];
  357. // Import the boundary samples
  358. for (i = 0; i < 17; ++i) { // left
  359. it->i4_boundary_[i] = it->y_left_[15 - i];
  360. }
  361. for (i = 0; i < 16; ++i) { // top
  362. it->i4_boundary_[17 + i] = it->y_top_[i];
  363. }
  364. // top-right samples have a special case on the far right of the picture
  365. if (it->x_ < enc->mb_w_ - 1) {
  366. for (i = 16; i < 16 + 4; ++i) {
  367. it->i4_boundary_[17 + i] = it->y_top_[i];
  368. }
  369. } else { // else, replicate the last valid pixel four times
  370. for (i = 16; i < 16 + 4; ++i) {
  371. it->i4_boundary_[17 + i] = it->i4_boundary_[17 + 15];
  372. }
  373. }
  374. VP8IteratorNzToBytes(it); // import the non-zero context
  375. }
  376. int VP8IteratorRotateI4(VP8EncIterator* const it,
  377. const uint8_t* const yuv_out) {
  378. const uint8_t* const blk = yuv_out + VP8Scan[it->i4_];
  379. uint8_t* const top = it->i4_top_;
  380. int i;
  381. // Update the cache with 7 fresh samples
  382. for (i = 0; i <= 3; ++i) {
  383. top[-4 + i] = blk[i + 3 * BPS]; // store future top samples
  384. }
  385. if ((it->i4_ & 3) != 3) { // if not on the right sub-blocks #3, #7, #11, #15
  386. for (i = 0; i <= 2; ++i) { // store future left samples
  387. top[i] = blk[3 + (2 - i) * BPS];
  388. }
  389. } else { // else replicate top-right samples, as says the specs.
  390. for (i = 0; i <= 3; ++i) {
  391. top[i] = top[i + 4];
  392. }
  393. }
  394. // move pointers to next sub-block
  395. ++it->i4_;
  396. if (it->i4_ == 16) { // we're done
  397. return 0;
  398. }
  399. it->i4_top_ = it->i4_boundary_ + VP8TopLeftI4[it->i4_];
  400. return 1;
  401. }
  402. //------------------------------------------------------------------------------