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.

116 lines
3.4KB

  1. /*
  2. * MLP codec common code
  3. * Copyright (c) 2007-2008 Ian Caulfield
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #include <stdint.h>
  22. #include "libavutil/crc.h"
  23. #include "libavutil/intreadwrite.h"
  24. #include "mlp.h"
  25. const uint8_t ff_mlp_huffman_tables[3][18][2] = {
  26. { /* Huffman table 0, -7 - +10 */
  27. {0x01, 9}, {0x01, 8}, {0x01, 7}, {0x01, 6}, {0x01, 5}, {0x01, 4}, {0x01, 3},
  28. {0x04, 3}, {0x05, 3}, {0x06, 3}, {0x07, 3},
  29. {0x03, 3}, {0x05, 4}, {0x09, 5}, {0x11, 6}, {0x21, 7}, {0x41, 8}, {0x81, 9},
  30. }, { /* Huffman table 1, -7 - +8 */
  31. {0x01, 9}, {0x01, 8}, {0x01, 7}, {0x01, 6}, {0x01, 5}, {0x01, 4}, {0x01, 3},
  32. {0x02, 2}, {0x03, 2},
  33. {0x03, 3}, {0x05, 4}, {0x09, 5}, {0x11, 6}, {0x21, 7}, {0x41, 8}, {0x81, 9},
  34. }, { /* Huffman table 2, -7 - +7 */
  35. {0x01, 9}, {0x01, 8}, {0x01, 7}, {0x01, 6}, {0x01, 5}, {0x01, 4}, {0x01, 3},
  36. {0x01, 1},
  37. {0x03, 3}, {0x05, 4}, {0x09, 5}, {0x11, 6}, {0x21, 7}, {0x41, 8}, {0x81, 9},
  38. }
  39. };
  40. static int crc_init = 0;
  41. #if CONFIG_SMALL
  42. #define CRC_TABLE_SIZE 257
  43. #else
  44. #define CRC_TABLE_SIZE 1024
  45. #endif
  46. static AVCRC crc_63[CRC_TABLE_SIZE];
  47. static AVCRC crc_1D[CRC_TABLE_SIZE];
  48. static AVCRC crc_2D[CRC_TABLE_SIZE];
  49. av_cold void ff_mlp_init_crc(void)
  50. {
  51. if (!crc_init) {
  52. av_crc_init(crc_63, 0, 8, 0x63, sizeof(crc_63));
  53. av_crc_init(crc_1D, 0, 8, 0x1D, sizeof(crc_1D));
  54. av_crc_init(crc_2D, 0, 16, 0x002D, sizeof(crc_2D));
  55. crc_init = 1;
  56. }
  57. }
  58. uint16_t ff_mlp_checksum16(const uint8_t *buf, unsigned int buf_size)
  59. {
  60. uint16_t crc;
  61. crc = av_crc(crc_2D, 0, buf, buf_size - 2);
  62. crc ^= AV_RL16(buf + buf_size - 2);
  63. return crc;
  64. }
  65. uint8_t ff_mlp_checksum8(const uint8_t *buf, unsigned int buf_size)
  66. {
  67. uint8_t checksum = av_crc(crc_63, 0x3c, buf, buf_size - 1); // crc_63[0xa2] == 0x3c
  68. checksum ^= buf[buf_size-1];
  69. return checksum;
  70. }
  71. uint8_t ff_mlp_restart_checksum(const uint8_t *buf, unsigned int bit_size)
  72. {
  73. int i;
  74. int num_bytes = (bit_size + 2) / 8;
  75. int crc = crc_1D[buf[0] & 0x3f];
  76. crc = av_crc(crc_1D, crc, buf + 1, num_bytes - 2);
  77. crc ^= buf[num_bytes - 1];
  78. for (i = 0; i < ((bit_size + 2) & 7); i++) {
  79. crc <<= 1;
  80. if (crc & 0x100)
  81. crc ^= 0x11D;
  82. crc ^= (buf[num_bytes] >> (7 - i)) & 1;
  83. }
  84. return crc;
  85. }
  86. uint8_t ff_mlp_calculate_parity(const uint8_t *buf, unsigned int buf_size)
  87. {
  88. uint32_t scratch = 0;
  89. const uint8_t *buf_end = buf + buf_size;
  90. for (; ((intptr_t) buf & 3) && buf < buf_end; buf++)
  91. scratch ^= *buf;
  92. for (; buf < buf_end - 3; buf += 4)
  93. scratch ^= *((const uint32_t*)buf);
  94. scratch = xor_32_to_8(scratch);
  95. for (; buf < buf_end; buf++)
  96. scratch ^= *buf;
  97. return scratch;
  98. }