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.

183 lines
4.7KB

  1. /*
  2. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav 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. * Libav 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 Libav; 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. // 16.16 fixpoint log()
  52. static int64_t log16(uint64_t a)
  53. {
  54. int i;
  55. int out = 0;
  56. if (a < 1 << 16)
  57. return -log16((1LL << 32) / a);
  58. a <<= 16;
  59. for (i = 20; i >= 0; i--) {
  60. int64_t b = exp16_table[i];
  61. if (a < (b << 16))
  62. continue;
  63. out |= 1 << i;
  64. a = ((a / b) << 16) + (((a % b) << 16) + b / 2) / b;
  65. }
  66. return out;
  67. }
  68. static uint64_t int_sqrt(uint64_t a)
  69. {
  70. uint64_t ret = 0;
  71. uint64_t ret_sq = 0;
  72. int s;
  73. for (s = 31; s >= 0; s--) {
  74. uint64_t b = ret_sq + (1ULL << (s * 2)) + (ret << s) * 2;
  75. if (b <= a) {
  76. ret_sq = b;
  77. ret += 1ULL << s;
  78. }
  79. }
  80. return ret;
  81. }
  82. int main(int argc, char *argv[])
  83. {
  84. int i, j;
  85. uint64_t sse = 0;
  86. uint64_t dev;
  87. FILE *f[2];
  88. uint8_t buf[2][SIZE];
  89. uint64_t psnr;
  90. int len = argc < 4 ? 1 : atoi(argv[3]);
  91. int64_t max = (1 << (8 * len)) - 1;
  92. int shift = argc < 5 ? 0 : atoi(argv[4]);
  93. int skip_bytes = argc < 6 ? 0 : atoi(argv[5]);
  94. int size0 = 0;
  95. int size1 = 0;
  96. int maxdist = 0;
  97. if (argc < 3) {
  98. printf("tiny_psnr <file1> <file2> [<elem size> [<shift> [<skip bytes>]]]\n");
  99. printf("WAV headers are skipped automatically.\n");
  100. return 1;
  101. }
  102. f[0] = fopen(argv[1], "rb");
  103. f[1] = fopen(argv[2], "rb");
  104. if (!f[0] || !f[1]) {
  105. fprintf(stderr, "Could not open input files.\n");
  106. return 1;
  107. }
  108. for (i = 0; i < 2; i++) {
  109. uint8_t *p = buf[i];
  110. if (fread(p, 1, 12, f[i]) != 12)
  111. return 1;
  112. if (!memcmp(p, "RIFF", 4) &&
  113. !memcmp(p + 8, "WAVE", 4)) {
  114. if (fread(p, 1, 8, f[i]) != 8)
  115. return 1;
  116. while (memcmp(p, "data", 4)) {
  117. int s = p[4] | p[5] << 8 | p[6] << 16 | p[7] << 24;
  118. fseek(f[i], s, SEEK_CUR);
  119. if (fread(p, 1, 8, f[i]) != 8)
  120. return 1;
  121. }
  122. } else {
  123. fseek(f[i], -12, SEEK_CUR);
  124. }
  125. }
  126. fseek(f[shift < 0], abs(shift), SEEK_CUR);
  127. fseek(f[0], skip_bytes, SEEK_CUR);
  128. fseek(f[1], skip_bytes, SEEK_CUR);
  129. for (;;) {
  130. int s0 = fread(buf[0], 1, SIZE, f[0]);
  131. int s1 = fread(buf[1], 1, SIZE, f[1]);
  132. for (j = 0; j < FFMIN(s0, s1); j++) {
  133. int64_t a = buf[0][j];
  134. int64_t b = buf[1][j];
  135. int dist;
  136. if (len == 2) {
  137. a = (int16_t)(a | (buf[0][++j] << 8));
  138. b = (int16_t)(b | (buf[1][ j] << 8));
  139. }
  140. sse += (a - b) * (a - b);
  141. dist = abs(a - b);
  142. if (dist > maxdist)
  143. maxdist = dist;
  144. }
  145. size0 += s0;
  146. size1 += s1;
  147. if (s0 + s1 <= 0)
  148. break;
  149. }
  150. i = FFMIN(size0, size1) / len;
  151. if (!i)
  152. i = 1;
  153. dev = int_sqrt(((sse / i) * F * F) + (((sse % i) * F * F) + i / 2) / i);
  154. if (sse)
  155. psnr = ((2 * log16(max << 16) + log16(i) - log16(sse)) *
  156. 284619LL * F + (1LL << 31)) / (1LL << 32);
  157. else
  158. psnr = 1000 * F - 1; // floating point free infinity :)
  159. printf("stddev:%5d.%02d PSNR:%3d.%02d MAXDIFF:%5d bytes:%9d/%9d\n",
  160. (int)(dev / F), (int)(dev % F),
  161. (int)(psnr / F), (int)(psnr % F),
  162. maxdist, size0, size1);
  163. return 0;
  164. }