od_intra.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401
  1. /*Daala video codec
  2. Copyright (c) 2013 Daala project contributors. All rights reserved.
  3. Redistribution and use in source and binary forms, with or without
  4. modification, are permitted provided that the following conditions are met:
  5. - Redistributions of source code must retain the above copyright notice, this
  6. list of conditions and the following disclaimer.
  7. - Redistributions in binary form must reproduce the above copyright notice,
  8. this list of conditions and the following disclaimer in the documentation
  9. and/or other materials provided with the distribution.
  10. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
  11. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  12. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  13. DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
  14. FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  15. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  16. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  17. CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  18. OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  19. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.*/
  20. #include "od_intra.h"
  21. static void ne_intra_pred4x4_mult(double *_pred,int _pred_stride,
  22. const od_coeff *_coeff,int _coeff_stride,int _mode){
  23. int j;
  24. int i;
  25. int k;
  26. int x;
  27. int y;
  28. for(j=0;j<4;j++){
  29. for(i=0;i<4;i++){
  30. #if ZERO_MEAN
  31. _pred[_pred_stride*j+i]=0;
  32. #else
  33. _pred[_pred_stride*j+i]=NE_PRED_OFFSETS_4x4[_mode][j][i];
  34. #endif
  35. for(k=0;k<NE_PRED_MULTS_4x4[_mode][j][i];k++){
  36. x=NE_PRED_PARAMX_4x4[_mode][j][i][k];
  37. y=NE_PRED_PARAMY_4x4[_mode][j][i][k];
  38. _pred[_pred_stride*j+i]+=
  39. _coeff[_coeff_stride*(y-4)+(x-4)]*NE_PRED_WEIGHTS_4x4[_mode][j][i][k];
  40. }
  41. }
  42. }
  43. }
  44. static void ne_intra_pred8x8_mult(double *_pred,int _pred_stride,
  45. const od_coeff *_coeff,int _coeff_stride,int _mode){
  46. int j;
  47. int i;
  48. int k;
  49. int x;
  50. int y;
  51. for(j=0;j<8;j++){
  52. for(i=0;i<8;i++){
  53. #if ZERO_MEAN
  54. _pred[_pred_stride*j+i]=0;
  55. #else
  56. _pred[_pred_stride*j+i]=NE_PRED_OFFSETS_8x8[_mode][j][i];
  57. #endif
  58. for(k=0;k<NE_PRED_MULTS_8x8[_mode][j][i];k++){
  59. x=NE_PRED_PARAMX_8x8[_mode][j][i][k];
  60. y=NE_PRED_PARAMY_8x8[_mode][j][i][k];
  61. _pred[_pred_stride*j+i]+=
  62. _coeff[_coeff_stride*(y-8)+(x-8)]*NE_PRED_WEIGHTS_8x8[_mode][j][i][k];
  63. }
  64. }
  65. }
  66. }
  67. static void ne_intra_pred16x16_mult(double *_pred,int _pred_stride,
  68. const od_coeff *_coeff,int _coeff_stride,int _mode){
  69. int j;
  70. int i;
  71. int k;
  72. int x;
  73. int y;
  74. for(j=0;j<16;j++){
  75. for(i=0;i<16;i++){
  76. #if ZERO_MEAN
  77. _pred[_pred_stride*j+i]=0;
  78. #else
  79. _pred[_pred_stride*j+i]=NE_PRED_OFFSETS_16x16[_mode][j][i];
  80. #endif
  81. for(k=0;k<NE_PRED_MULTS_16x16[_mode][j][i];k++){
  82. x=NE_PRED_PARAMX_16x16[_mode][j][i][k];
  83. y=NE_PRED_PARAMY_16x16[_mode][j][i][k];
  84. _pred[_pred_stride*j+i]+=_coeff[_coeff_stride*(y-16)+(x-16)]*
  85. NE_PRED_WEIGHTS_16x16[_mode][j][i][k];
  86. }
  87. }
  88. }
  89. }
  90. const ne_intra_mult_func NE_INTRA_MULT[OD_NBSIZES]={
  91. ne_intra_pred4x4_mult,
  92. ne_intra_pred8x8_mult,
  93. ne_intra_pred16x16_mult
  94. };
  95. void update_predictors(int _mode,double *_beta_0,double *_beta_1,
  96. int _mask[B_SZ*B_SZ*4*B_SZ*B_SZ]){
  97. int i;
  98. int j;
  99. for(i=0;i<B_SZ*B_SZ;i++){
  100. int y;
  101. int x;
  102. int by;
  103. int bx;
  104. int n;
  105. y=i/B_SZ;
  106. x=i%B_SZ;
  107. #if B_SZ==4
  108. NE_PRED_OFFSETS_4x4[_mode][y][x]=_beta_0[i];
  109. #elif B_SZ==8
  110. NE_PRED_OFFSETS_8x8[_mode][y][x]=_beta_0[i];
  111. #elif B_SZ==16
  112. NE_PRED_OFFSETS_16x16[_mode][y][x]=_beta_0[i];
  113. #else
  114. # error "Need predictors for this block size."
  115. #endif
  116. n=0;
  117. for(by=0;by<=1;by++){
  118. for(bx=0;bx<=(1-by)<<1;bx++){
  119. for(j=0;j<B_SZ*B_SZ;j++){
  120. int v;
  121. int u;
  122. int ij;
  123. v=j/B_SZ;
  124. u=j%B_SZ;
  125. ij=4*B_SZ*B_SZ*i+(3*by+bx)*B_SZ*B_SZ+j;
  126. if(_mask[ij]){
  127. #if B_SZ==4
  128. NE_PRED_WEIGHTS_4x4[_mode][y][x][n]=_beta_1[ij];
  129. NE_PRED_PARAMX_4x4[_mode][y][x][n]=B_SZ*bx+u;
  130. NE_PRED_PARAMY_4x4[_mode][y][x][n]=B_SZ*by+v;
  131. #elif B_SZ==8
  132. NE_PRED_WEIGHTS_8x8[_mode][y][x][n]=_beta_1[ij];
  133. NE_PRED_PARAMX_8x8[_mode][y][x][n]=B_SZ*bx+u;
  134. NE_PRED_PARAMY_8x8[_mode][y][x][n]=B_SZ*by+v;
  135. #elif B_SZ==16
  136. NE_PRED_WEIGHTS_16x16[_mode][y][x][n]=_beta_1[ij];
  137. NE_PRED_PARAMX_16x16[_mode][y][x][n]=B_SZ*bx+u;
  138. NE_PRED_PARAMY_16x16[_mode][y][x][n]=B_SZ*by+v;
  139. #else
  140. # error "Need predictors for this block size."
  141. #endif
  142. n++;
  143. }
  144. }
  145. }
  146. }
  147. #if B_SZ==4
  148. NE_PRED_MULTS_4x4[_mode][y][x]=n;
  149. #elif B_SZ==8
  150. NE_PRED_MULTS_8x8[_mode][y][x]=n;
  151. #elif B_SZ==16
  152. NE_PRED_MULTS_16x16[_mode][y][x]=n;
  153. #else
  154. # error "Need predictors for this block size."
  155. #endif
  156. }
  157. }
  158. void print_predictors(FILE *_fp){
  159. int m;
  160. int j;
  161. int i;
  162. int k;
  163. fprintf(_fp,"double NE_PRED_OFFSETS_%ix%i[OD_INTRA_NMODES][%i][%i]={\n",
  164. B_SZ,B_SZ,B_SZ,B_SZ);
  165. for(m=0;m<OD_INTRA_NMODES;m++){
  166. fprintf(_fp,"/* Mode %i */\n {\n",m);
  167. for(j=0;j<B_SZ;j++){
  168. fprintf(_fp," {");
  169. for(i=0;i<B_SZ;i++){
  170. #if B_SZ==4
  171. fprintf(_fp,"%s%- 24.18G",i>0?",":" ",NE_PRED_OFFSETS_4x4[m][j][i]);
  172. #elif B_SZ==8
  173. fprintf(_fp,"%s%- 24.18G",i>0?",":"",NE_PRED_OFFSETS_8x8[m][j][i]);
  174. #elif B_SZ==16
  175. fprintf(_fp,"%s%- 24.18G",i>0?",":"",NE_PRED_OFFSETS_16x16[m][j][i]);
  176. #else
  177. # error "Unsupported block size."
  178. #endif
  179. }
  180. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  181. }
  182. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  183. }
  184. fprintf(_fp,"};\n");
  185. fprintf(_fp,"int NE_PRED_MULTS_%ix%i[OD_INTRA_NMODES][%i][%i]={\n",
  186. B_SZ,B_SZ,B_SZ,B_SZ);
  187. for(m=0;m<OD_INTRA_NMODES;m++){
  188. fprintf(_fp,"/* Mode %i */\n {\n",m);
  189. for(j=0;j<B_SZ;j++){
  190. fprintf(_fp," {");
  191. for(i=0;i<B_SZ;i++){
  192. #if B_SZ==4
  193. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_4x4[m][j][i]);
  194. #elif B_SZ==8
  195. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_8x8[m][j][i]);
  196. #elif B_SZ==16
  197. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_16x16[m][j][i]);
  198. #else
  199. # error "Unsupported block size."
  200. #endif
  201. }
  202. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  203. }
  204. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  205. }
  206. fprintf(_fp,"};\n");
  207. fprintf(_fp,
  208. "double NE_PRED_WEIGHTS_%ix%i[OD_INTRA_NMODES][%i][%i][4*%i*%i]={\n",
  209. B_SZ,B_SZ,B_SZ,B_SZ,B_SZ,B_SZ);
  210. for(m=0;m<OD_INTRA_NMODES;m++){
  211. fprintf(_fp,"/* Mode %i */\n {\n",m);
  212. for(j=0;j<B_SZ;j++){
  213. fprintf(_fp," {\n");
  214. for(i=0;i<B_SZ;i++){
  215. fprintf(_fp," {");
  216. #if B_SZ==4
  217. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++){
  218. fprintf(_fp,"%s%s%- 24.18G",k>0?",":" ",k>0&&k%8==0?"\n ":"",
  219. NE_PRED_WEIGHTS_4x4[m][j][i][k]);
  220. }
  221. #elif B_SZ==8
  222. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++){
  223. fprintf(_fp,"%s%s%- 24.18G",k>0?",":" ",k>0&&k%8==0?"\n ":"",
  224. NE_PRED_WEIGHTS_8x8[m][j][i][k]);
  225. }
  226. #elif B_SZ==16
  227. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++){
  228. fprintf(_fp,"%s%s%- 24.18G",k>0?",":" ",k>0&&k%8==0?"\n ":"",
  229. NE_PRED_WEIGHTS_16x16[m][j][i][k]);
  230. }
  231. #else
  232. # error "Unsupported block size."
  233. #endif
  234. fprintf(_fp,"%s}%s\n",k==0?" 0 ":"",i<B_SZ-1?",":"");
  235. }
  236. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  237. }
  238. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  239. }
  240. fprintf(_fp,"};\n");
  241. fprintf(_fp,"int NE_PRED_PARAMX_%ix%i[OD_INTRA_NMODES][%i][%i][4*%i*%i]={\n",
  242. B_SZ,B_SZ,B_SZ,B_SZ,B_SZ,B_SZ);
  243. for(m=0;m<OD_INTRA_NMODES;m++){
  244. fprintf(_fp,"/* Mode %i */\n {\n",m);
  245. for(j=0;j<B_SZ;j++){
  246. fprintf(_fp," {\n");
  247. for(i=0;i<B_SZ;i++){
  248. fprintf(_fp," {");
  249. #if B_SZ==4
  250. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++){
  251. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMX_4x4[m][j][i][k]);
  252. }
  253. #elif B_SZ==8
  254. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++){
  255. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMX_8x8[m][j][i][k]);
  256. }
  257. #elif B_SZ==16
  258. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++){
  259. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMX_16x16[m][j][i][k]);
  260. }
  261. #else
  262. # error "Unsupported block size."
  263. #endif
  264. fprintf(_fp,"%s }%s\n",k==0?" 0":"",i<B_SZ-1?",":"");
  265. }
  266. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  267. }
  268. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  269. }
  270. fprintf(_fp,"};\n");
  271. fprintf(_fp,"int NE_PRED_PARAMY_%ix%i[OD_INTRA_NMODES][%i][%i][4*%i*%i]={\n",
  272. B_SZ,B_SZ,B_SZ,B_SZ,B_SZ,B_SZ);
  273. for(m=0;m<OD_INTRA_NMODES;m++){
  274. fprintf(_fp,"/* Mode %i */\n {\n",m);
  275. for(j=0;j<B_SZ;j++){
  276. fprintf(_fp," {\n");
  277. for(i=0;i<B_SZ;i++){
  278. fprintf(_fp," {");
  279. #if B_SZ==4
  280. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++){
  281. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMY_4x4[m][j][i][k]);
  282. }
  283. #elif B_SZ==8
  284. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++){
  285. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMY_8x8[m][j][i][k]);
  286. }
  287. #elif B_SZ==16
  288. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++){
  289. fprintf(_fp,"%s%3i",k>0?",":"",NE_PRED_PARAMY_16x16[m][j][i][k]);
  290. }
  291. #else
  292. # error "Unsupported block size."
  293. #endif
  294. fprintf(_fp,"%s }%s\n",k==0?" 0":"",i<B_SZ-1?",":"");
  295. }
  296. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  297. }
  298. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  299. }
  300. fprintf(_fp,"};\n");
  301. fflush(_fp);
  302. }
  303. void print_predictors_nonsparse(FILE *_fp){
  304. int m;
  305. int i;
  306. int j;
  307. int k;
  308. int l;
  309. int bx;
  310. int by;
  311. fprintf(_fp,"double NE_PRED_OFFSETS_%ix%i[OD_INTRA_NMODES][%i][%i]={\n",
  312. B_SZ,B_SZ,B_SZ,B_SZ);
  313. for(m=0;m<OD_INTRA_NMODES;m++){
  314. fprintf(_fp,"/* Mode %i */\n {\n",m);
  315. for(j=0;j<B_SZ;j++){
  316. fprintf(_fp," {");
  317. for(i=0;i<B_SZ;i++){
  318. #if B_SZ==4
  319. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_4x4[m][j][i]);
  320. #elif B_SZ==8
  321. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_8x8[m][j][i]);
  322. #elif B_SZ==16
  323. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_16x16[m][j][i]);
  324. #else
  325. # error "Unsupported block size."
  326. #endif
  327. }
  328. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  329. }
  330. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  331. }
  332. fprintf(_fp,"};\n");
  333. fprintf(_fp,
  334. "double NE_PRED_WEIGHTS_%ix%i[OD_INTRA_NMODES][%i][%i][2*%i][3*%i]={\n",
  335. B_SZ,B_SZ,B_SZ,B_SZ,B_SZ,B_SZ);
  336. for(m=0;m<OD_INTRA_NMODES;m++){
  337. fprintf(_fp," {\n");
  338. for(j=0;j<B_SZ;j++){
  339. fprintf(_fp," {\n");
  340. for(i=0;i<B_SZ;i++){
  341. double w[2*B_SZ][3*B_SZ];
  342. fprintf(_fp,"/* Mode %i (%i,%i) */\n {\n",m,j,i);
  343. for(k=0;k<2*B_SZ;k++){
  344. for(l=0;l<3*B_SZ;l++){
  345. w[k][l]=0;
  346. }
  347. }
  348. #if B_SZ==4
  349. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++){
  350. int u=NE_PRED_PARAMX_4x4[m][j][i][k];
  351. int v=NE_PRED_PARAMY_4x4[m][j][i][k];
  352. w[v][u]=NE_PRED_WEIGHTS_4x4[m][j][i][k];
  353. }
  354. #elif B_SZ==8
  355. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++){
  356. int u=NE_PRED_PARAMX_8x8[m][j][i][k];
  357. int v=NE_PRED_PARAMY_8x8[m][j][i][k];
  358. w[v][u]=NE_PRED_WEIGHTS_8x8[m][j][i][k];
  359. }
  360. #elif B_SZ==16
  361. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++){
  362. int u=NE_PRED_PARAMX_16x16[m][j][i][k];
  363. int v=NE_PRED_PARAMY_16x16[m][j][i][k];
  364. w[v][u]=NE_PRED_WEIGHTS_16x16[m][j][i][k];
  365. }
  366. #else
  367. # error "Unsupported block size."
  368. #endif
  369. for(by=0;by<=1;by++){
  370. for(k=0;k<B_SZ;k++){
  371. fprintf(_fp," {");
  372. for(bx=0;bx<=(1-by)<<1;bx++){
  373. for(l=0;l<B_SZ;l++){
  374. fprintf(_fp,"%s %- 24.18G",bx>0||l>0?",":"",
  375. w[B_SZ*by+k][B_SZ*bx+l]);
  376. }
  377. }
  378. fprintf(_fp," }%s\n",by<1||k<B_SZ-1?",":"");
  379. }
  380. }
  381. fprintf(_fp," }%s\n",i<B_SZ-1?",":"");
  382. }
  383. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  384. }
  385. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  386. }
  387. fprintf(_fp,"};\n");
  388. }