You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

220 lines
5.6KB

  1. /*
  2. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with FFmpeg; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #include <stdio.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <inttypes.h>
  24. #include <assert.h>
  25. #define FFMIN(a, b) ((a) > (b) ? (b) : (a))
  26. #define F 100
  27. #define SIZE 2048
  28. uint64_t exp16_table[21] = {
  29. 65537,
  30. 65538,
  31. 65540,
  32. 65544,
  33. 65552,
  34. 65568,
  35. 65600,
  36. 65664,
  37. 65793,
  38. 66050,
  39. 66568,
  40. 67616,
  41. 69763,
  42. 74262,
  43. 84150,
  44. 108051,
  45. 178145,
  46. 484249,
  47. 3578144,
  48. 195360063,
  49. 582360139072LL,
  50. };
  51. #if 0
  52. // 16.16 fixpoint exp()
  53. static unsigned int exp16(unsigned int a){
  54. int i;
  55. int out= 1<<16;
  56. for(i=19;i>=0;i--){
  57. if(a&(1<<i))
  58. out= (out*exp16_table[i] + (1<<15))>>16;
  59. }
  60. return out;
  61. }
  62. #endif
  63. // 16.16 fixpoint log()
  64. static int64_t log16(uint64_t a)
  65. {
  66. int i;
  67. int out = 0;
  68. if (a < 1 << 16)
  69. return -log16((1LL << 32) / a);
  70. a <<= 16;
  71. for (i = 20; i >= 0; i--) {
  72. int64_t b = exp16_table[i];
  73. if (a < (b << 16))
  74. continue;
  75. out |= 1 << i;
  76. a = ((a / b) << 16) + (((a % b) << 16) + b / 2) / b;
  77. }
  78. return out;
  79. }
  80. static uint64_t int_sqrt(uint64_t a)
  81. {
  82. uint64_t ret = 0;
  83. uint64_t ret_sq = 0;
  84. int s;
  85. for (s = 31; s >= 0; s--) {
  86. uint64_t b = ret_sq + (1ULL << (s * 2)) + (ret << s) * 2;
  87. if (b <= a) {
  88. ret_sq = b;
  89. ret += 1ULL << s;
  90. }
  91. }
  92. return ret;
  93. }
  94. static int run_psnr(FILE *f[2], int len, int shift, int skip_bytes)
  95. {
  96. int i, j;
  97. uint64_t sse = 0;
  98. uint64_t dev;
  99. uint8_t buf[2][SIZE];
  100. uint64_t psnr;
  101. int64_t max = (1 << (8 * len)) - 1;
  102. int size0 = 0;
  103. int size1 = 0;
  104. int maxdist = 0;
  105. rewind(f[0]);
  106. rewind(f[1]);
  107. for (i = 0; i < 2; i++) {
  108. uint8_t *p = buf[i];
  109. if (fread(p, 1, 12, f[i]) != 12)
  110. return 1;
  111. if (!memcmp(p, "RIFF", 4) &&
  112. !memcmp(p + 8, "WAVE", 4)) {
  113. if (fread(p, 1, 8, f[i]) != 8)
  114. return 1;
  115. while (memcmp(p, "data", 4)) {
  116. int s = p[4] | p[5] << 8 | p[6] << 16 | p[7] << 24;
  117. fseek(f[i], s, SEEK_CUR);
  118. if (fread(p, 1, 8, f[i]) != 8)
  119. return 1;
  120. }
  121. } else {
  122. fseek(f[i], -12, SEEK_CUR);
  123. }
  124. }
  125. fseek(f[shift < 0], abs(shift), SEEK_CUR);
  126. fseek(f[0], skip_bytes, SEEK_CUR);
  127. fseek(f[1], skip_bytes, SEEK_CUR);
  128. for (;;) {
  129. int s0 = fread(buf[0], 1, SIZE, f[0]);
  130. int s1 = fread(buf[1], 1, SIZE, f[1]);
  131. for (j = 0; j < FFMIN(s0, s1); j++) {
  132. int64_t a = buf[0][j];
  133. int64_t b = buf[1][j];
  134. int dist;
  135. if (len == 2) {
  136. a = (int16_t)(a | (buf[0][++j] << 8));
  137. b = (int16_t)(b | (buf[1][ j] << 8));
  138. }
  139. sse += (a - b) * (a - b);
  140. dist = abs(a - b);
  141. if (dist > maxdist)
  142. maxdist = dist;
  143. }
  144. size0 += s0;
  145. size1 += s1;
  146. if (s0 + s1 <= 0)
  147. break;
  148. }
  149. i = FFMIN(size0, size1) / len;
  150. if (!i)
  151. i = 1;
  152. dev = int_sqrt(((sse / i) * F * F) + (((sse % i) * F * F) + i / 2) / i);
  153. if (sse)
  154. psnr = ((2 * log16(max << 16) + log16(i) - log16(sse)) *
  155. 284619LL * F + (1LL << 31)) / (1LL << 32);
  156. else
  157. psnr = 1000 * F - 1; // floating point free infinity :)
  158. printf("stddev:%5d.%02d PSNR:%3d.%02d MAXDIFF:%5d bytes:%9d/%9d\n",
  159. (int)(dev / F), (int)(dev % F),
  160. (int)(psnr / F), (int)(psnr % F),
  161. maxdist, size0, size1);
  162. return psnr;
  163. }
  164. int main(int argc, char *argv[])
  165. {
  166. FILE *f[2];
  167. int len = argc < 4 ? 1 : atoi(argv[3]);
  168. int shift_first= argc < 5 ? 0 : atoi(argv[4]);
  169. int skip_bytes = argc < 6 ? 0 : atoi(argv[5]);
  170. int shift_last = shift_first + (argc < 7 ? 0 : atoi(argv[6]));
  171. int shift;
  172. int max_psnr = -1;
  173. int max_psnr_shift = 0;
  174. if (argc < 3) {
  175. printf("tiny_psnr <file1> <file2> [<elem size> [<shift> [<skip bytes> [<shift search range>]]]]\n");
  176. printf("WAV headers are skipped automatically.\n");
  177. return 1;
  178. }
  179. f[0] = fopen(argv[1], "rb");
  180. f[1] = fopen(argv[2], "rb");
  181. if (!f[0] || !f[1]) {
  182. fprintf(stderr, "Could not open input files.\n");
  183. return 1;
  184. }
  185. for (shift = shift_first; shift <= shift_last; shift++) {
  186. int psnr = run_psnr(f, len, shift, skip_bytes);
  187. if (psnr > max_psnr || (shift < 0 && psnr == max_psnr)) {
  188. max_psnr = psnr;
  189. max_psnr_shift = shift;
  190. }
  191. }
  192. if (shift_last > shift_first)
  193. printf("Best PSNR is %3d.%02d for shift %i\n", (int)(max_psnr / F), (int)(max_psnr % F), max_psnr_shift);
  194. return 0;
  195. }