od_intra.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  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. #ifdef HAVE_CONFIG_H
  21. #include "config.h"
  22. #endif
  23. #include <stdlib.h>
  24. #include "od_intra.h"
  25. #include "../src/intra.h"
  26. static void ne_intra_pred4x4_mult(double *_pred,int _stride,
  27. const od_coeff *_coeff,int _mode){
  28. double *weight;
  29. int *index;
  30. int j;
  31. int i;
  32. int k;
  33. weight=NE_PRED_WEIGHTS_4x4[_mode];
  34. index=NE_PRED_INDEX_4x4[_mode];
  35. for(j=0;j<4;j++){
  36. for(i=0;i<4;i++){
  37. double sum;
  38. #if ZERO_MEAN
  39. sum=0;
  40. #else
  41. sum=NE_PRED_OFFSETS_4x4[_mode][j][i];
  42. #endif
  43. for(k=NE_PRED_MULTS_4x4[_mode][j][i];k-->0;){
  44. sum+=_coeff[*index]*(*weight);
  45. index++;
  46. weight++;
  47. }
  48. _pred[_stride*j+i]=sum;
  49. }
  50. }
  51. }
  52. static void ne_intra_pred8x8_mult(double *_pred,int _stride,
  53. const od_coeff *_coeff,int _mode){
  54. double *weight;
  55. int *index;
  56. int j;
  57. int i;
  58. int k;
  59. weight=NE_PRED_WEIGHTS_8x8[_mode];
  60. index=NE_PRED_INDEX_8x8[_mode];
  61. for(j=0;j<8;j++){
  62. for(i=0;i<8;i++){
  63. double sum;
  64. #if ZERO_MEAN
  65. sum=0;
  66. #else
  67. sum=NE_PRED_OFFSETS_8x8[_mode][j][i];
  68. #endif
  69. for(k=NE_PRED_MULTS_8x8[_mode][j][i];k-->0;){
  70. sum+=_coeff[*index]*(*weight);
  71. index++;
  72. weight++;
  73. }
  74. _pred[_stride*j+i]=sum;
  75. }
  76. }
  77. }
  78. static void ne_intra_pred16x16_mult(double *_pred,int _stride,
  79. const od_coeff *_coeff,int _mode){
  80. double *weight;
  81. int *index;
  82. int j;
  83. int i;
  84. int k;
  85. weight=NE_PRED_WEIGHTS_16x16[_mode];
  86. index=NE_PRED_INDEX_16x16[_mode];
  87. for(j=0;j<16;j++){
  88. for(i=0;i<16;i++){
  89. double sum;
  90. #if ZERO_MEAN
  91. sum=0;
  92. #else
  93. sum=NE_PRED_OFFSETS_16x16[_mode][j][i];
  94. #endif
  95. for(k=NE_PRED_MULTS_16x16[_mode][j][i];k-->0;){
  96. sum+=_coeff[*index]*(*weight);
  97. index++;
  98. weight++;
  99. }
  100. _pred[_stride*j+i]=sum;
  101. }
  102. }
  103. }
  104. const ne_intra_mult_func NE_INTRA_MULT[OD_NBSIZES]={
  105. ne_intra_pred4x4_mult,
  106. ne_intra_pred8x8_mult,
  107. ne_intra_pred16x16_mult
  108. };
  109. void od_intra_init(){
  110. int m;
  111. for(m=0;m<OD_INTRA_NMODES;m++){
  112. const double *weights;
  113. const ogg_uint16_t *index;
  114. int w;
  115. int b_sz;
  116. int j;
  117. int i;
  118. int k;
  119. w=0;
  120. b_sz=4;
  121. NE_PRED_WEIGHTS_4x4[m]=(double *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(double));
  122. NE_PRED_INDEX_4x4[m]=(int *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(int));
  123. index=OD_PRED_INDEX_4x4+OD_PRED_OFFSETS_4x4[m];
  124. weights=OD_PRED_WEIGHTS_4x4+OD_PRED_OFFSETS_4x4[m];
  125. for(j=0;j<b_sz;j++){
  126. for(i=0;i<b_sz;i++){
  127. NE_PRED_MULTS_4x4[m][j][i]=OD_PRED_MULTS_4x4[m][j][i];
  128. for(k=OD_PRED_MULTS_4x4[m][j][i];k-->0;w++){
  129. NE_PRED_WEIGHTS_4x4[m][w]=*weights;
  130. NE_PRED_INDEX_4x4[m][w]=*index;
  131. weights++;
  132. index++;
  133. }
  134. }
  135. }
  136. w=0;
  137. b_sz=8;
  138. NE_PRED_WEIGHTS_8x8[m]=(double *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(double));
  139. NE_PRED_INDEX_8x8[m]=(int *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(int));
  140. index=OD_PRED_INDEX_8x8+OD_PRED_OFFSETS_8x8[m];
  141. weights=OD_PRED_WEIGHTS_8x8+OD_PRED_OFFSETS_8x8[m];
  142. for(j=0;j<b_sz;j++){
  143. for(i=0;i<b_sz;i++){
  144. NE_PRED_MULTS_8x8[m][j][i]=OD_PRED_MULTS_8x8[m][j][i];
  145. for(k=OD_PRED_MULTS_8x8[m][j][i];k-->0;w++){
  146. NE_PRED_WEIGHTS_8x8[m][w]=*weights;
  147. NE_PRED_INDEX_8x8[m][w]=*index;
  148. weights++;
  149. index++;
  150. }
  151. }
  152. }
  153. w=0;
  154. b_sz=16;
  155. NE_PRED_WEIGHTS_16x16[m]=(double *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(double));
  156. NE_PRED_INDEX_16x16[m]=(int *)malloc(b_sz*b_sz*4*b_sz*b_sz*sizeof(int));
  157. index=OD_PRED_INDEX_16x16+OD_PRED_OFFSETS_16x16[m];
  158. weights=OD_PRED_WEIGHTS_16x16+OD_PRED_OFFSETS_16x16[m];
  159. for(j=0;j<b_sz;j++){
  160. for(i=0;i<b_sz;i++){
  161. NE_PRED_MULTS_16x16[m][j][i]=OD_PRED_MULTS_16x16[m][j][i];
  162. for(k=OD_PRED_MULTS_16x16[m][j][i];k-->0;w++){
  163. NE_PRED_WEIGHTS_16x16[m][w]=*weights;
  164. NE_PRED_INDEX_16x16[m][w]=*index;
  165. weights++;
  166. index++;
  167. }
  168. }
  169. }
  170. }
  171. }
  172. void od_intra_clear(){
  173. int m;
  174. for(m=0;m<OD_INTRA_NMODES;m++){
  175. free(NE_PRED_WEIGHTS_4x4[m]);
  176. free(NE_PRED_INDEX_4x4[m]);
  177. free(NE_PRED_WEIGHTS_8x8[m]);
  178. free(NE_PRED_INDEX_8x8[m]);
  179. free(NE_PRED_WEIGHTS_16x16[m]);
  180. free(NE_PRED_INDEX_16x16[m]);
  181. }
  182. }
  183. void update_predictors(int _mode,double *_beta_0,double *_beta_1,int *_mask){
  184. double *weights;
  185. int *index;
  186. int i;
  187. int j;
  188. #if B_SZ==4
  189. weights=NE_PRED_WEIGHTS_4x4[_mode];
  190. index=NE_PRED_INDEX_4x4[_mode];
  191. #elif B_SZ==8
  192. weights=NE_PRED_WEIGHTS_8x8[_mode];
  193. index=NE_PRED_INDEX_8x8[_mode];
  194. #elif B_SZ==16
  195. weights=NE_PRED_WEIGHTS_16x16[_mode];
  196. index=NE_PRED_INDEX_16x16[_mode];
  197. #else
  198. # error "Need predictors for this block size."
  199. #endif
  200. for(i=0;i<B_SZ*B_SZ;i++){
  201. int y;
  202. int x;
  203. int by;
  204. int bx;
  205. int n;
  206. y=i/B_SZ;
  207. x=i%B_SZ;
  208. #if B_SZ==4
  209. NE_PRED_OFFSETS_4x4[_mode][y][x]=_beta_0[i];
  210. #elif B_SZ==8
  211. NE_PRED_OFFSETS_8x8[_mode][y][x]=_beta_0[i];
  212. #elif B_SZ==16
  213. NE_PRED_OFFSETS_16x16[_mode][y][x]=_beta_0[i];
  214. #else
  215. # error "Need predictors for this block size."
  216. #endif
  217. n=0;
  218. for(by=0;by<=1;by++){
  219. for(bx=0;bx<=(1-by)<<1;bx++){
  220. for(j=0;j<B_SZ*B_SZ;j++){
  221. int v;
  222. int u;
  223. int ij;
  224. v=j/B_SZ;
  225. u=j%B_SZ;
  226. ij=4*B_SZ*B_SZ*i+(3*by+bx)*B_SZ*B_SZ+j;
  227. if(_mask[ij]){
  228. *weights=_beta_1[ij];
  229. *index=((((3*by+bx)<<B_SZ_LOG)|v)<<B_SZ_LOG)|u;
  230. weights++;
  231. index++;
  232. n++;
  233. }
  234. }
  235. }
  236. }
  237. #if B_SZ==4
  238. NE_PRED_MULTS_4x4[_mode][y][x]=n;
  239. #elif B_SZ==8
  240. NE_PRED_MULTS_8x8[_mode][y][x]=n;
  241. #elif B_SZ==16
  242. NE_PRED_MULTS_16x16[_mode][y][x]=n;
  243. #else
  244. # error "Need predictors for this block size."
  245. #endif
  246. }
  247. }
  248. void print_predictors(FILE *_fp){
  249. int m;
  250. int i;
  251. int j;
  252. int k;
  253. int w;
  254. int offset[OD_INTRA_NMODES];
  255. fprintf(_fp,"double NE_PRED_OFFSETS_%ix%i[OD_INTRA_NMODES][%i][%i]={\n",
  256. B_SZ,B_SZ,B_SZ,B_SZ);
  257. for (m=0;m<OD_INTRA_NMODES;m++) {
  258. fprintf(_fp,"/* Mode %i */\n {\n",m);
  259. for (j=0;j<B_SZ;j++){
  260. fprintf(_fp," {");
  261. for (i=0;i<B_SZ;i++){
  262. #if B_SZ==4
  263. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_4x4[m][j][i]);
  264. #elif B_SZ==8
  265. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_8x8[m][j][i]);
  266. #elif B_SZ==16
  267. fprintf(_fp,"%s %- 24.18G",i>0?",":"",NE_PRED_OFFSETS_16x16[m][j][i]);
  268. #else
  269. # error "Unsupported block size."
  270. #endif
  271. }
  272. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  273. }
  274. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  275. }
  276. fprintf(_fp,"};\n");
  277. fprintf(_fp,"const int OD_PRED_MULTS_%ix%i[OD_INTRA_NMODES][%i][%i]={\n",
  278. B_SZ,B_SZ,B_SZ,B_SZ);
  279. for(m=0;m<OD_INTRA_NMODES;m++){
  280. fprintf(_fp,"/* Mode %i */\n {\n",m);
  281. for(j=0;j<B_SZ;j++){
  282. fprintf(_fp," {");
  283. for(i=0;i<B_SZ;i++){
  284. #if B_SZ==4
  285. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_4x4[m][j][i]);
  286. #elif B_SZ==8
  287. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_8x8[m][j][i]);
  288. #elif B_SZ==16
  289. fprintf(_fp,"%s%4i",i>0?",":"",NE_PRED_MULTS_16x16[m][j][i]);
  290. #else
  291. # error "Unsupported block size."
  292. #endif
  293. }
  294. fprintf(_fp," }%s\n",j<B_SZ-1?",":"");
  295. }
  296. fprintf(_fp," }%s\n",m<OD_INTRA_NMODES-1?",":"");
  297. }
  298. fprintf(_fp,"};\n");
  299. fprintf(_fp,"const double OD_PRED_WEIGHTS_%ix%i[]={",B_SZ,B_SZ);
  300. offset[0]=0;
  301. for(m=0;m<OD_INTRA_NMODES;m++){
  302. w=0;
  303. for(j=0;j<B_SZ;j++){
  304. for(i=0;i<B_SZ;i++){
  305. fprintf(_fp,"\n/* Mode %i (%i %i) */",m,i,j);
  306. #if B_SZ==4
  307. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++,w++){
  308. fprintf(_fp,"%s%- 24.18G,",k&0x7?"":"\n ",
  309. NE_PRED_WEIGHTS_4x4[m][w]);
  310. }
  311. #elif B_SZ==8
  312. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++,w++){
  313. fprintf(_fp,"%s%- 24.18G,",k&0x7?"":"\n ",
  314. NE_PRED_WEIGHTS_8x8[m][w]);
  315. }
  316. #elif B_SZ==16
  317. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++,w++){
  318. fprintf(_fp,"%s%- 24.18G,",k&0x7?"":"\n ",
  319. NE_PRED_WEIGHTS_16x16[m][w]);
  320. }
  321. #else
  322. # error "Unsupported block size."
  323. #endif
  324. }
  325. }
  326. if(m>0){
  327. offset[m]=offset[m-1]+w;
  328. }
  329. }
  330. fprintf(_fp,"\n};\n");
  331. fprintf(_fp,"const ogg_uint16_t OD_PRED_INDEX_%ix%i[]={",B_SZ,B_SZ);
  332. for(m=0;m<OD_INTRA_NMODES;m++){
  333. w=0;
  334. for(j=0;j<B_SZ;j++){
  335. for(i=0;i<B_SZ;i++){
  336. fprintf(_fp,"\n/* Mode %i (%i %i) */",m,i,j);
  337. #if B_SZ==4
  338. for(k=0;k<NE_PRED_MULTS_4x4[m][j][i];k++,w++){
  339. fprintf(_fp,"%s0x%02x,",k&0xf?"":"\n ",NE_PRED_INDEX_4x4[m][w]);
  340. }
  341. #elif B_SZ==8
  342. for(k=0;k<NE_PRED_MULTS_8x8[m][j][i];k++,w++){
  343. fprintf(_fp,"%s0x%02x,",k&0xf?"":"\n ",NE_PRED_INDEX_8x8[m][w]);
  344. }
  345. #elif B_SZ==16
  346. for(k=0;k<NE_PRED_MULTS_16x16[m][j][i];k++,w++){
  347. fprintf(_fp,"%s0x%02x,",k&0xf?"":"\n ",NE_PRED_INDEX_16x16[m][w]);
  348. }
  349. #else
  350. # error "Unsupported block size."
  351. #endif
  352. }
  353. }
  354. }
  355. fprintf(_fp,"\n};\n");
  356. fprintf(_fp,"const int OD_PRED_OFFSETS_%ix%i[OD_INTRA_NMODES] = {\n ",
  357. B_SZ,B_SZ);
  358. for(m=0;m<OD_INTRA_NMODES;m++){
  359. fprintf(_fp,"%s%i",m>0?", ":"",offset[m]);
  360. }
  361. fprintf(_fp,"\n};\n");
  362. }