The JUCE cross-platform C++ framework, with DISTRHO/KXStudio specific changes
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.

3145 lines
131KB

  1. /*
  2. ==============================================================================
  3. This file is part of the JUCE library.
  4. Copyright (c) 2013 - Raw Material Software Ltd.
  5. Permission is granted to use this software under the terms of either:
  6. a) the GPL v2 (or any later version)
  7. b) the Affero GPL v3
  8. Details of these licenses can be found at: www.gnu.org/licenses
  9. JUCE is distributed in the hope that it will be useful, but WITHOUT ANY
  10. WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
  11. A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  12. ------------------------------------------------------------------------------
  13. To release a closed-source product which uses JUCE, commercial licenses are
  14. available: visit www.juce.com for more information.
  15. ==============================================================================
  16. */
  17. /*
  18. IMPORTANT DISCLAIMER: By choosing to enable the JUCE_USE_MP3AUDIOFORMAT flag and
  19. to compile this MP3 code into your software, you do so AT YOUR OWN RISK! By doing so,
  20. you are agreeing that Raw Material Software is in no way responsible for any patent,
  21. copyright, or other legal issues that you may suffer as a result.
  22. The code in juce_MP3AudioFormat.cpp is NOT guaranteed to be free from infringements of 3rd-party
  23. intellectual property. If you wish to use it, please seek your own independent advice about the
  24. legality of doing so. If you are not willing to accept full responsibility for the consequences
  25. of using this code, then do not enable the JUCE_USE_MP3AUDIOFORMAT setting.
  26. */
  27. #if JUCE_USE_MP3AUDIOFORMAT
  28. namespace MP3Decoder
  29. {
  30. struct AllocationTable { int16 bits, d; };
  31. const struct AllocationTable allocTable0[] =
  32. {
  33. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  34. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  35. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  36. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  37. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  38. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  39. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  40. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  41. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  42. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  43. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  44. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  45. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  46. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  47. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  48. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  49. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  50. {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}
  51. };
  52. const struct AllocationTable allocTable1[] =
  53. {
  54. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  55. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  56. {4, 0}, {5, 3}, {3, -3}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383}, {16, -32767},
  57. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  58. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  59. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  60. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  61. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  62. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  63. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  64. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {16, -32767},
  65. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  66. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  67. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  68. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  69. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  70. {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767}, {3, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {16, -32767},
  71. {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767},
  72. {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}, {2, 0}, {5, 3}, {7, 5}, {16, -32767}
  73. };
  74. const struct AllocationTable allocTable2[] =
  75. {
  76. {4, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383},
  77. {4, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383},
  78. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  79. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  80. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}
  81. };
  82. const struct AllocationTable allocTable3[] =
  83. {
  84. {4, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383},
  85. {4, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191}, {15, -16383},
  86. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  87. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  88. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  89. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  90. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}
  91. };
  92. const struct AllocationTable allocTable4[] =
  93. {
  94. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191},
  95. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191},
  96. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191},
  97. {4, 0}, {5, 3}, {7, 5}, {3, -3}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {8, -127}, {9, -255}, {10, -511}, {11, -1023}, {12, -2047}, {13, -4095}, {14, -8191},
  98. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  99. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  100. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63},
  101. {3, 0}, {5, 3}, {7, 5}, {10, 9}, {4, -7}, {5, -15}, {6, -31}, {7, -63}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9},
  102. {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9},
  103. {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9},
  104. {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9},
  105. {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9}, {2, 0}, {5, 3}, {7, 5}, {10, 9},
  106. {2, 0}, {5, 3}, {7, 5}, {10, 9}
  107. };
  108. struct BandInfoStruct
  109. {
  110. int16 longIndex[23];
  111. int16 longDiff[22];
  112. int16 shortIndex[14];
  113. int16 shortDiff[13];
  114. };
  115. const BandInfoStruct bandInfo[9] =
  116. {
  117. { {0, 4, 8, 12, 16, 20, 24, 30, 36, 44, 52, 62, 74, 90, 110, 134, 162, 196, 238, 288, 342, 418, 576},
  118. {4, 4, 4, 4, 4, 4, 6, 6, 8, 8, 10, 12, 16, 20, 24, 28, 34, 42, 50, 54, 76, 158},
  119. {0, 4 * 3, 8 * 3, 12 * 3, 16 * 3, 22 * 3, 30 * 3, 40 * 3, 52 * 3, 66 * 3, 84 * 3, 106 * 3, 136 * 3, 192 * 3},
  120. {4, 4, 4, 4, 6, 8, 10, 12, 14, 18, 22, 30, 56} },
  121. { {0, 4, 8, 12, 16, 20, 24, 30, 36, 42, 50, 60, 72, 88, 106, 128, 156, 190, 230, 276, 330, 384, 576},
  122. {4, 4, 4, 4, 4, 4, 6, 6, 6, 8, 10, 12, 16, 18, 22, 28, 34, 40, 46, 54, 54, 192},
  123. {0, 4 * 3, 8 * 3, 12 * 3, 16 * 3, 22 * 3, 28 * 3, 38 * 3, 50 * 3, 64 * 3, 80 * 3, 100 * 3, 126 * 3, 192 * 3},
  124. {4, 4, 4, 4, 6, 6, 10, 12, 14, 16, 20, 26, 66} },
  125. { {0, 4, 8, 12, 16, 20, 24, 30, 36, 44, 54, 66, 82, 102, 126, 156, 194, 240, 296, 364, 448, 550, 576},
  126. {4, 4, 4, 4, 4, 4, 6, 6, 8, 10, 12, 16, 20, 24, 30, 38, 46, 56, 68, 84, 102, 26},
  127. {0, 4 * 3, 8 * 3, 12 * 3, 16 * 3, 22 * 3, 30 * 3, 42 * 3, 58 * 3, 78 * 3, 104 * 3, 138 * 3, 180 * 3, 192 * 3},
  128. {4, 4, 4, 4, 6, 8, 12, 16, 20, 26, 34, 42, 12} },
  129. { {0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396, 464, 522, 576},
  130. {6, 6, 6, 6, 6, 6, 8, 10, 12, 14, 16, 20, 24, 28, 32, 38, 46, 52, 60, 68, 58, 54 },
  131. {0, 4 * 3, 8 * 3, 12 * 3, 18 * 3, 24 * 3, 32 * 3, 42 * 3, 56 * 3, 74 * 3, 100 * 3, 132 * 3, 174 * 3, 192 * 3},
  132. {4, 4, 4, 6, 6, 8, 10, 14, 18, 26, 32, 42, 18 } },
  133. { {0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 114, 136, 162, 194, 232, 278, 332, 394, 464, 540, 576},
  134. {6, 6, 6, 6, 6, 6, 8, 10, 12, 14, 16, 18, 22, 26, 32, 38, 46, 54, 62, 70, 76, 36 },
  135. {0, 4 * 3, 8 * 3, 12 * 3, 18 * 3, 26 * 3, 36 * 3, 48 * 3, 62 * 3, 80 * 3, 104 * 3, 136 * 3, 180 * 3, 192 * 3},
  136. {4, 4, 4, 6, 8, 10, 12, 14, 18, 24, 32, 44, 12 } },
  137. { {0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396, 464, 522, 576},
  138. {6, 6, 6, 6, 6, 6, 8, 10, 12, 14, 16, 20, 24, 28, 32, 38, 46, 52, 60, 68, 58, 54 },
  139. {0, 4 * 3, 8 * 3, 12 * 3, 18 * 3, 26 * 3, 36 * 3, 48 * 3, 62 * 3, 80 * 3, 104 * 3, 134 * 3, 174 * 3, 192 * 3},
  140. {4, 4, 4, 6, 8, 10, 12, 14, 18, 24, 30, 40, 18 } },
  141. { {0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396, 464, 522, 576},
  142. {6, 6, 6, 6, 6, 6, 8, 10, 12, 14, 16, 20, 24, 28, 32, 38, 46, 52, 60, 68, 58, 54},
  143. {0, 12, 24, 36, 54, 78, 108, 144, 186, 240, 312, 402, 522, 576},
  144. {4, 4, 4, 6, 8, 10, 12, 14, 18, 24, 30, 40, 18} },
  145. { {0, 6, 12, 18, 24, 30, 36, 44, 54, 66, 80, 96, 116, 140, 168, 200, 238, 284, 336, 396, 464, 522, 576},
  146. {6, 6, 6, 6, 6, 6, 8, 10, 12, 14, 16, 20, 24, 28, 32, 38, 46, 52, 60, 68, 58, 54},
  147. {0, 12, 24, 36, 54, 78, 108, 144, 186, 240, 312, 402, 522, 576},
  148. {4, 4, 4, 6, 8, 10, 12, 14, 18, 24, 30, 40, 18} },
  149. { {0, 12, 24, 36, 48, 60, 72, 88, 108, 132, 160, 192, 232, 280, 336, 400, 476, 566, 568, 570, 572, 574, 576},
  150. {12, 12, 12, 12, 12, 12, 16, 20, 24, 28, 32, 40, 48, 56, 64, 76, 90, 2, 2, 2, 2, 2},
  151. {0, 24, 48, 72, 108, 156, 216, 288, 372, 480, 486, 492, 498, 576},
  152. {8, 8, 8, 12, 16, 20, 24, 28, 36, 2, 2, 2, 26} }
  153. };
  154. const double decodeWindow[] =
  155. {
  156. 0.000000000, -0.000015259, -0.000015259, -0.000015259, -0.000015259, -0.000015259, -0.000015259, -0.000030518,
  157. -0.000030518, -0.000030518, -0.000030518, -0.000045776, -0.000045776, -0.000061035, -0.000061035, -0.000076294,
  158. -0.000076294, -0.000091553, -0.000106812, -0.000106812, -0.000122070, -0.000137329, -0.000152588, -0.000167847,
  159. -0.000198364, -0.000213623, -0.000244141, -0.000259399, -0.000289917, -0.000320435, -0.000366211, -0.000396729,
  160. -0.000442505, -0.000473022, -0.000534058, -0.000579834, -0.000625610, -0.000686646, -0.000747681, -0.000808716,
  161. -0.000885010, -0.000961304, -0.001037598, -0.001113892, -0.001205444, -0.001296997, -0.001388550, -0.001480103,
  162. -0.001586914, -0.001693726, -0.001785278, -0.001907349, -0.002014160, -0.002120972, -0.002243042, -0.002349854,
  163. -0.002456665, -0.002578735, -0.002685547, -0.002792358, -0.002899170, -0.002990723, -0.003082275, -0.003173828,
  164. -0.003250122, -0.003326416, -0.003387451, -0.003433228, -0.003463745, -0.003479004, -0.003479004, -0.003463745,
  165. -0.003417969, -0.003372192, -0.003280640, -0.003173828, -0.003051758, -0.002883911, -0.002700806, -0.002487183,
  166. -0.002227783, -0.001937866, -0.001617432, -0.001266479, -0.000869751, -0.000442505, 0.000030518, 0.000549316,
  167. 0.001098633, 0.001693726, 0.002334595, 0.003005981, 0.003723145, 0.004486084, 0.005294800, 0.006118774,
  168. 0.007003784, 0.007919312, 0.008865356, 0.009841919, 0.010848999, 0.011886597, 0.012939453, 0.014022827,
  169. 0.015121460, 0.016235352, 0.017349243, 0.018463135, 0.019577026, 0.020690918, 0.021789551, 0.022857666,
  170. 0.023910522, 0.024932861, 0.025909424, 0.026840210, 0.027725220, 0.028533936, 0.029281616, 0.029937744,
  171. 0.030532837, 0.031005859, 0.031387329, 0.031661987, 0.031814575, 0.031845093, 0.031738281, 0.031478882,
  172. 0.031082153, 0.030517578, 0.029785156, 0.028884888, 0.027801514, 0.026535034, 0.025085449, 0.023422241,
  173. 0.021575928, 0.019531250, 0.017257690, 0.014801025, 0.012115479, 0.009231567, 0.006134033, 0.002822876,
  174. -0.000686646, -0.004394531, -0.008316040, -0.012420654, -0.016708374, -0.021179199, -0.025817871, -0.030609131,
  175. -0.035552979, -0.040634155, -0.045837402, -0.051132202, -0.056533813, -0.061996460, -0.067520142, -0.073059082,
  176. -0.078628540, -0.084182739, -0.089706421, -0.095169067, -0.100540161, -0.105819702, -0.110946655, -0.115921021,
  177. -0.120697021, -0.125259399, -0.129562378, -0.133590698, -0.137298584, -0.140670776, -0.143676758, -0.146255493,
  178. -0.148422241, -0.150115967, -0.151306152, -0.151962280, -0.152069092, -0.151596069, -0.150497437, -0.148773193,
  179. -0.146362305, -0.143264771, -0.139450073, -0.134887695, -0.129577637, -0.123474121, -0.116577148, -0.108856201,
  180. -0.100311279, -0.090927124, -0.080688477, -0.069595337, -0.057617187, -0.044784546, -0.031082153, -0.016510010,
  181. -0.001068115, 0.015228271, 0.032379150, 0.050354004, 0.069168091, 0.088775635, 0.109161377, 0.130310059,
  182. 0.152206421, 0.174789429, 0.198059082, 0.221984863, 0.246505737, 0.271591187, 0.297210693, 0.323318481,
  183. 0.349868774, 0.376800537, 0.404083252, 0.431655884, 0.459472656, 0.487472534, 0.515609741, 0.543823242,
  184. 0.572036743, 0.600219727, 0.628295898, 0.656219482, 0.683914185, 0.711318970, 0.738372803, 0.765029907,
  185. 0.791213989, 0.816864014, 0.841949463, 0.866363525, 0.890090942, 0.913055420, 0.935195923, 0.956481934,
  186. 0.976852417, 0.996246338, 1.014617920, 1.031936646, 1.048156738, 1.063217163, 1.077117920, 1.089782715,
  187. 1.101211548, 1.111373901, 1.120223999, 1.127746582, 1.133926392, 1.138763428, 1.142211914, 1.144287109,
  188. 1.144989014
  189. };
  190. const int16 huffmanTab0[] = { 0 };
  191. const int16 huffmanTab1[] = { -5,-3,-1,17,1,16,0 };
  192. const int16 huffmanTab2[] = { -15,-11,-9,-5,-3,-1,34,2,18,-1,33,32,17,-1,1,16,0 };
  193. const int16 huffmanTab3[] = { -13,-11,-9,-5,-3,-1,34,2,18,-1,33,32,16,17,-1,1,0 };
  194. const int16 huffmanTab5[] = { -29,-25,-23,-15,-7,-5,-3,-1,51,35,50,49,-3,-1,19,3,-1,48,34,-3,-1,18,33,-1,2,32,17,-1,1,16,0 };
  195. const int16 huffmanTab6[] = { -25,-19,-13,-9,-5,-3,-1,51,3,35,-1,50,48,-1,19,49,-3,-1,34,2,18,-3,-1,33,32,1,-1,17,-1,16,0 };
  196. const int16 huffmanTab7[] =
  197. {
  198. -69,-65,-57,-39,-29,-17,-11,-7,-3,-1,85,69,-1,84,83,-1,53,68,-3,-1,37,82,21,-5,-1,81,-1,5,52,-1,80,-1,67,51,
  199. -5,-3,-1,36,66,20,-1,65,64,-11,-7,-3,-1,4,35,-1,50,3,-1,19,49,-3,-1,48,34,18,-5,-1,33,-1,2,32,17,-1,1,16,0
  200. };
  201. const int16 huffmanTab8[] =
  202. {
  203. -65,-63,-59,-45,-31,-19,-13,-7,-5,-3,-1,85,84,69,83,-3,-1,53,68,37,-3,-1,82,5,21,-5,-1,81,-1,52,67,-3,-1,80,
  204. 51,36,-5,-3,-1,66,20,65,-3,-1,4,64,-1,35,50,-9,-7,-3,-1,19,49,-1,3,48,34,-1,2,32,-1,18,33,17,-3,-1,1,16,0
  205. };
  206. const int16 huffmanTab9[] =
  207. {
  208. -63,-53,-41,-29,-19,-11,-5,-3,-1,85,69,53,-1,83,-1,84,5,-3,-1,68,37,-1,82,21,-3,-1,81,52,-1,67,-1,80,4,-7,-3,
  209. -1,36,66,-1,51,64,-1,20,65,-5,-3,-1,35,50,19,-1,49,-1,3,48,-5,-3,-1,34,2,18,-1,33,32,-3,-1,17,1,-1,16,0
  210. };
  211. const int16 huffmanTab10[] =
  212. {
  213. -125,-121,-111,-83,-55,-35,-21,-13,-7,-3,-1,119,103,-1,118,87,-3,-1,117,102,71,-3,-1,116,86,-1,101,55,-9,-3,
  214. -1,115,70,-3,-1,85,84,99,-1,39,114,-11,-5,-3,-1,100,7,112,-1,98,-1,69,53,-5,-1,6,-1,83,68,23,-17,-5,-1,113,
  215. -1,54,38,-5,-3,-1,37,82,21,-1,81,-1,52,67,-3,-1,22,97,-1,96,-1,5,80,-19,-11,-7,-3,-1,36,66,-1,51,4,-1,20,
  216. 65,-3,-1,64,35,-1,50,3,-3,-1,19,49,-1,48,34,-7,-3,-1,18,33,-1,2,32,17,-1,1,16,0
  217. };
  218. const int16 huffmanTab11[] =
  219. {
  220. -121,-113,-89,-59,-43,-27,-17,-7,-3,-1,119,103,-1,118,117,-3,-1,102,71,-1,116,-1,87,85,-5,-3,-1,86,101,55,
  221. -1,115,70,-9,-7,-3,-1,69,84,-1,53,83,39,-1,114,-1,100,7,-5,-1,113,-1,23,112,-3,-1,54,99,-1,96,-1,68,37,-13,
  222. -7,-5,-3,-1,82,5,21,98,-3,-1,38,6,22,-5,-1,97,-1,81,52,-5,-1,80,-1,67,51,-1,36,66,-15,-11,-7,-3,-1,20,65,
  223. -1,4,64,-1,35,50,-1,19,49,-5,-3,-1,3,48,34,33,-5,-1,18,-1,2,32,17,-3,-1,1,16,0
  224. };
  225. const int16 huffmanTab12[] =
  226. {
  227. -115,-99,-73,-45,-27,-17,-9,-5,-3,-1,119,103,118,-1,87,117,-3,-1,102,71,-1,116,101,-3,-1,86,55,-3,-1,115,
  228. 85,39,-7,-3,-1,114,70,-1,100,23,-5,-1,113,-1,7,112,-1,54,99,-13,-9,-3,-1,69,84,-1,68,-1,6,5,-1,38,98,-5,
  229. -1,97,-1,22,96,-3,-1,53,83,-1,37,82,-17,-7,-3,-1,21,81,-1,52,67,-5,-3,-1,80,4,36,-1,66,20,-3,-1,51,65,-1,
  230. 35,50,-11,-7,-5,-3,-1,64,3,48,19,-1,49,34,-1,18,33,-7,-5,-3,-1,2,32,0,17,-1,1,16
  231. };
  232. const int16 huffmanTab13[] =
  233. {
  234. -509,-503,-475,-405,-333,-265,-205,-153,-115,-83,-53,-35,-21,-13,-9,-7,-5,-3,-1,254,252,253,237,255,-1,239,223,
  235. -3,-1,238,207,-1,222,191,-9,-3,-1,251,206,-1,220,-1,175,233,-1,236,221,-9,-5,-3,-1,250,205,190,-1,235,159,-3,
  236. -1,249,234,-1,189,219,-17,-9,-3,-1,143,248,-1,204,-1,174,158,-5,-1,142,-1,127,126,247,-5,-1,218,-1,173,188,-3,
  237. -1,203,246,111,-15,-7,-3,-1,232,95,-1,157,217,-3,-1,245,231,-1,172,187,-9,-3,-1,79,244,-3,-1,202,230,243,-1,
  238. 63,-1,141,216,-21,-9,-3,-1,47,242,-3,-1,110,156,15,-5,-3,-1,201,94,171,-3,-1,125,215,78,-11,-5,-3,-1,200,214,
  239. 62,-1,185,-1,155,170,-1,31,241,-23,-13,-5,-1,240,-1,186,229,-3,-1,228,140,-1,109,227,-5,-1,226,-1,46,14,-1,30,
  240. 225,-15,-7,-3,-1,224,93,-1,213,124,-3,-1,199,77,-1,139,184,-7,-3,-1,212,154,-1,169,108,-1,198,61,-37,-21,-9,-5,
  241. -3,-1,211,123,45,-1,210,29,-5,-1,183,-1,92,197,-3,-1,153,122,195,-7,-5,-3,-1,167,151,75,209,-3,-1,13,208,-1,
  242. 138,168,-11,-7,-3,-1,76,196,-1,107,182,-1,60,44,-3,-1,194,91,-3,-1,181,137,28,-43,-23,-11,-5,-1,193,-1,152,12,
  243. -1,192,-1,180,106,-5,-3,-1,166,121,59,-1,179,-1,136,90,-11,-5,-1,43,-1,165,105,-1,164,-1,120,135,-5,-1,148,-1,
  244. 119,118,178,-11,-3,-1,27,177,-3,-1,11,176,-1,150,74,-7,-3,-1,58,163,-1,89,149,-1,42,162,-47,-23,-9,-3,-1,26,
  245. 161,-3,-1,10,104,160,-5,-3,-1,134,73,147,-3,-1,57,88,-1,133,103,-9,-3,-1,41,146,-3,-1,87,117,56,-5,-1,131,-1,
  246. 102,71,-3,-1,116,86,-1,101,115,-11,-3,-1,25,145,-3,-1,9,144,-1,72,132,-7,-5,-1,114,-1,70,100,40,-1,130,24,-41,
  247. -27,-11,-5,-3,-1,55,39,23,-1,113,-1,85,7,-7,-3,-1,112,54,-1,99,69,-3,-1,84,38,-1,98,53,-5,-1,129,-1,8,128,-3,
  248. -1,22,97,-1,6,96,-13,-9,-5,-3,-1,83,68,37,-1,82,5,-1,21,81,-7,-3,-1,52,67,-1,80,36,-3,-1,66,51,20,-19,-11,
  249. -5,-1,65,-1,4,64,-3,-1,35,50,19,-3,-1,49,3,-1,48,34,-3,-1,18,33,-1,2,32,-3,-1,17,1,16,0
  250. };
  251. const int16 huffmanTab15[] =
  252. {
  253. -495,-445,-355,-263,-183,-115,-77,-43,-27,-13,-7,-3,-1,255,239,-1,254,223,-1,238,-1,253,207,-7,-3,-1,252,222,-1,
  254. 237,191,-1,251,-1,206,236,-7,-3,-1,221,175,-1,250,190,-3,-1,235,205,-1,220,159,-15,-7,-3,-1,249,234,-1,189,219,
  255. -3,-1,143,248,-1,204,158,-7,-3,-1,233,127,-1,247,173,-3,-1,218,188,-1,111,-1,174,15,-19,-11,-3,-1,203,246,
  256. -3,-1,142,232,-1,95,157,-3,-1,245,126,-1,231,172,-9,-3,-1,202,187,-3,-1,217,141,79,-3,-1,244,63,-1,243,216,
  257. -33,-17,-9,-3,-1,230,47,-1,242,-1,110,240,-3,-1,31,241,-1,156,201,-7,-3,-1,94,171,-1,186,229,-3,-1,125,215,
  258. -1,78,228,-15,-7,-3,-1,140,200,-1,62,109,-3,-1,214,227,-1,155,185,-7,-3,-1,46,170,-1,226,30,-5,-1,225,-1,14,
  259. 224,-1,93,213,-45,-25,-13,-7,-3,-1,124,199,-1,77,139,-1,212,-1,184,154,-7,-3,-1,169,108,-1,198,61,-1,211,210,
  260. -9,-5,-3,-1,45,13,29,-1,123,183,-5,-1,209,-1,92,208,-1,197,138,-17,-7,-3,-1,168,76,-1,196,107,-5,-1,182,-1,
  261. 153,12,-1,60,195,-9,-3,-1,122,167,-1,166,-1,192,11,-1,194,-1,44,91,-55,-29,-15,-7,-3,-1,181,28,-1,137,152,-3,
  262. -1,193,75,-1,180,106,-5,-3,-1,59,121,179,-3,-1,151,136,-1,43,90,-11,-5,-1,178,-1,165,27,-1,177,-1,176,105,-7,
  263. -3,-1,150,74,-1,164,120,-3,-1,135,58,163,-17,-7,-3,-1,89,149,-1,42,162,-3,-1,26,161,-3,-1,10,160,104,-7,-3,
  264. -1,134,73,-1,148,57,-5,-1,147,-1,119,9,-1,88,133,-53,-29,-13,-7,-3,-1,41,103,-1,118,146,-1,145,-1,25,144,-7,
  265. -3,-1,72,132,-1,87,117,-3,-1,56,131,-1,102,71,-7,-3,-1,40,130,-1,24,129,-7,-3,-1,116,8,-1,128,86,-3,-1,101,
  266. 55,-1,115,70,-17,-7,-3,-1,39,114,-1,100,23,-3,-1,85,113,-3,-1,7,112,54,-7,-3,-1,99,69,-1,84,38,-3,-1,98,22,
  267. -3,-1,6,96,53,-33,-19,-9,-5,-1,97,-1,83,68,-1,37,82,-3,-1,21,81,-3,-1,5,80,52,-7,-3,-1,67,36,-1,66,51,-1,
  268. 65,-1,20,4,-9,-3,-1,35,50,-3,-1,64,3,19,-3,-1,49,48,34,-9,-7,-3,-1,18,33,-1,2,32,17,-3,-1,1,16,0
  269. };
  270. const int16 huffmanTab16[] =
  271. {
  272. -509,-503,-461,-323,-103,-37,-27,-15,-7,-3,-1,239,254,-1,223,253,-3,-1,207,252,-1,191,251,-5,-1,175,-1,250,159,
  273. -3,-1,249,248,143,-7,-3,-1,127,247,-1,111,246,255,-9,-5,-3,-1,95,245,79,-1,244,243,-53,-1,240,-1,63,-29,-19,
  274. -13,-7,-5,-1,206,-1,236,221,222,-1,233,-1,234,217,-1,238,-1,237,235,-3,-1,190,205,-3,-1,220,219,174,-11,-5,
  275. -1,204,-1,173,218,-3,-1,126,172,202,-5,-3,-1,201,125,94,189,242,-93,-5,-3,-1,47,15,31,-1,241,-49,-25,-13,
  276. -5,-1,158,-1,188,203,-3,-1,142,232,-1,157,231,-7,-3,-1,187,141,-1,216,110,-1,230,156,-13,-7,-3,-1,171,186,
  277. -1,229,215,-1,78,-1,228,140,-3,-1,200,62,-1,109,-1,214,155,-19,-11,-5,-3,-1,185,170,225,-1,212,-1,184,169,
  278. -5,-1,123,-1,183,208,227,-7,-3,-1,14,224,-1,93,213,-3,-1,124,199,-1,77,139,-75,-45,-27,-13,-7,-3,-1,154,
  279. 108,-1,198,61,-3,-1,92,197,13,-7,-3,-1,138,168,-1,153,76,-3,-1,182,122,60,-11,-5,-3,-1,91,137,28,-1,192,-1,
  280. 152,121,-1,226,-1,46,30,-15,-7,-3,-1,211,45,-1,210,209,-5,-1,59,-1,151,136,29,-7,-3,-1,196,107,-1,195,167,-1,
  281. 44,-1,194,181,-23,-13,-7,-3,-1,193,12,-1,75,180,-3,-1,106,166,179,-5,-3,-1,90,165,43,-1,178,27,-13,-5,-1,177,
  282. -1,11,176,-3,-1,105,150,-1,74,164,-5,-3,-1,120,135,163,-3,-1,58,89,42,-97,-57,-33,-19,-11,-5,-3,-1,149,104,161,
  283. -3,-1,134,119,148,-5,-3,-1,73,87,103,162,-5,-1,26,-1,10,160,-3,-1,57,147,-1,88,133,-9,-3,-1,41,146,-3,-1,118,
  284. 9,25,-5,-1,145,-1,144,72,-3,-1,132,117,-1,56,131,-21,-11,-5,-3,-1,102,40,130,-3,-1,71,116,24,-3,-1,129,128,-3,
  285. -1,8,86,55,-9,-5,-1,115,-1,101,70,-1,39,114,-5,-3,-1,100,85,7,23,-23,-13,-5,-1,113,-1,112,54,-3,-1,99,69,-1,
  286. 84,38,-3,-1,98,22,-1,97,-1,6,96,-9,-5,-1,83,-1,53,68,-1,37,82,-1,81,-1,21,5,-33,-23,-13,-7,-3,-1,52,67,-1,80,
  287. 36,-3,-1,66,51,20,-5,-1,65,-1,4,64,-1,35,50,-3,-1,19,49,-3,-1,3,48,34,-3,-1,18,33,-1,2,32,-3,-1,17,1,16,0
  288. };
  289. const int16 huffmanTab24[] =
  290. {
  291. -451,-117,-43,-25,-15,-7,-3,-1,239,254,-1,223,253,-3,-1,207,252,-1,191,251,-5,-1,250,-1,175,159,-1,249,248,-9,
  292. -5,-3,-1,143,127,247,-1,111,246,-3,-1,95,245,-1,79,244,-71,-7,-3,-1,63,243,-1,47,242,-5,-1,241,-1,31,240,-25,-9,
  293. -1,15,-3,-1,238,222,-1,237,206,-7,-3,-1,236,221,-1,190,235,-3,-1,205,220,-1,174,234,-15,-7,-3,-1,189,219,-1,204,
  294. 158,-3,-1,233,173,-1,218,188,-7,-3,-1,203,142,-1,232,157,-3,-1,217,126,-1,231,172,255,-235,-143,-77,-45,-25,-15,
  295. -7,-3,-1,202,187,-1,141,216,-5,-3,-1,14,224,13,230,-5,-3,-1,110,156,201,-1,94,186,-9,-5,-1,229,-1,171,125,-1,215,
  296. 228,-3,-1,140,200,-3,-1,78,46,62,-15,-7,-3,-1,109,214,-1,227,155,-3,-1,185,170,-1,226,30,-7,-3,-1,225,93,-1,213,124,
  297. -3,-1,199,77,-1,139,184,-31,-15,-7,-3,-1,212,154,-1,169,108,-3,-1,198,61,-1,211,45,-7,-3,-1,210,29,-1,123,183,-3,-1,
  298. 209,92,-1,197,138,-17,-7,-3,-1,168,153,-1,76,196,-3,-1,107,182,-3,-1,208,12,60,-7,-3,-1,195,122,-1,167,44,-3,-1,194,
  299. 91,-1,181,28,-57,-35,-19,-7,-3,-1,137,152,-1,193,75,-5,-3,-1,192,11,59,-3,-1,176,10,26,-5,-1,180,-1,106,166,-3,-1,121,
  300. 151,-3,-1,160,9,144,-9,-3,-1,179,136,-3,-1,43,90,178,-7,-3,-1,165,27,-1,177,105,-1,150,164,-17,-9,-5,-3,-1,74,120,135,
  301. -1,58,163,-3,-1,89,149,-1,42,162,-7,-3,-1,161,104,-1,134,119,-3,-1,73,148,-1,57,147,-63,-31,-15,-7,-3,-1,88,133,-1,41,
  302. 103,-3,-1,118,146,-1,25,145,-7,-3,-1,72,132,-1,87,117,-3,-1,56,131,-1,102,40,-17,-7,-3,-1,130,24,-1,71,116,-5,-1,129,
  303. -1,8,128,-1,86,101,-7,-5,-1,23,-1,7,112,115,-3,-1,55,39,114,-15,-7,-3,-1,70,100,-1,85,113,-3,-1,54,99,-1,69,84,-7,-3,
  304. -1,38,98,-1,22,97,-5,-3,-1,6,96,53,-1,83,68,-51,-37,-23,-15,-9,-3,-1,37,82,-1,21,-1,5,80,-1,81,-1,52,67,-3,-1,36,66,
  305. -1,51,20,-9,-5,-1,65,-1,4,64,-1,35,50,-1,19,49,-7,-5,-3,-1,3,48,34,18,-1,33,-1,2,32,-3,-1,17,1,-1,16,0
  306. };
  307. struct BitsToTableMap
  308. {
  309. uint32 bits;
  310. const int16* table;
  311. };
  312. const BitsToTableMap huffmanTables1[] =
  313. {
  314. { 0, huffmanTab0 }, { 0, huffmanTab1 }, { 0, huffmanTab2 }, { 0, huffmanTab3 },
  315. { 0, huffmanTab0 }, { 0, huffmanTab5 }, { 0, huffmanTab6 }, { 0, huffmanTab7 },
  316. { 0, huffmanTab8 }, { 0, huffmanTab9 }, { 0, huffmanTab10 }, { 0, huffmanTab11 },
  317. { 0, huffmanTab12 }, { 0, huffmanTab13 }, { 0, huffmanTab0 }, { 0, huffmanTab15 },
  318. { 1, huffmanTab16 }, { 2, huffmanTab16 }, { 3, huffmanTab16 }, { 4, huffmanTab16 },
  319. { 6, huffmanTab16 }, { 8, huffmanTab16 }, { 10, huffmanTab16 }, { 13, huffmanTab16 },
  320. { 4, huffmanTab24 }, { 5, huffmanTab24 }, { 6, huffmanTab24 }, { 7, huffmanTab24 },
  321. { 8, huffmanTab24 }, { 9, huffmanTab24 }, { 11, huffmanTab24 }, { 13, huffmanTab24 }
  322. };
  323. const int16 huffmanTabC0[] = { -29,-21,-13,-7,-3,-1,11,15,-1,13,14,-3,-1,7,5,9,-3,-1,6,3,-1,10,12,-3,-1,2,1,-1,4,8,0 };
  324. const int16 huffmanTabC1[] = { -15,-7,-3,-1,15,14,-1,13,12,-3,-1,11,10,-1,9,8,-7,-3,-1,7,6,-1,5,4,-3,-1,3,2,-1,1,0 };
  325. const BitsToTableMap huffmanTables2[] = { { 0, huffmanTabC0 }, { 0, huffmanTabC1 } };
  326. //==============================================================================
  327. struct VBRTagData
  328. {
  329. bool read (const uint8* data) noexcept
  330. {
  331. flags = 0;
  332. const int layer = (data[1] >> 1) & 3;
  333. if (layer != 1)
  334. return false;
  335. const int type = (data[1] >> 3) & 1;
  336. const int sampleRateIndex = (data[2] >> 2) & 3;
  337. const int mode = (data[3] >> 6) & 3;
  338. static const int bitRates[3][16] =
  339. {
  340. { 0, 8, 16, 24, 32, 40, 48, 56, 64, 80, 96, 112, 128, 144, 160, -1 }, // MPEG2
  341. { 0, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 256, 320, -1 }, // MPEG1
  342. { 0, 8, 16, 24, 32, 40, 48, 56, 64, -1, -1, -1, -1, -1, -1, -1 }, // MPEG 2.5
  343. };
  344. const int bitrate = bitRates[type][((data[2] >> 4) & 15)];
  345. const int sampleRates[3][4] =
  346. {
  347. { 22050, 24000, 16000, -1 }, // MPEG2
  348. { 44100, 48000, 32000, -1 }, // MPEG1
  349. { 11025, 12000, 8000, -1 }, // MPEG2.5
  350. };
  351. if ((data[1] >> 4) == 0xe)
  352. sampleRate = sampleRates[2][sampleRateIndex];
  353. else
  354. sampleRate = sampleRates[type][sampleRateIndex];
  355. data += type != 0 ? (mode != 3 ? (32 + 4) : (17 + 4))
  356. : (mode != 3 ? (17 + 4) : (9 + 4));
  357. if (! isVbrTag (data))
  358. return false;
  359. data += 4;
  360. flags = ByteOrder::bigEndianInt (data);
  361. data += 4;
  362. if (flags & 1)
  363. {
  364. frames = ByteOrder::bigEndianInt (data);
  365. data += 4;
  366. }
  367. if (flags & 2)
  368. {
  369. bytes = ByteOrder::bigEndianInt (data);
  370. data += 4;
  371. }
  372. if (flags & 4)
  373. {
  374. if (toc != nullptr)
  375. for (int i = 0; i < 100; ++i)
  376. toc[i] = data[i];
  377. data += 100;
  378. }
  379. vbrScale = -1;
  380. if (flags & 8)
  381. vbrScale = ByteOrder::bigEndianInt (data);
  382. headersize = ((type + 1) * 72000 * bitrate) / sampleRate;
  383. return true;
  384. }
  385. uint8 toc[100];
  386. int sampleRate, flags, frames, bytes, vbrScale, headersize;
  387. private:
  388. static bool isVbrTag (const uint8* const d) noexcept
  389. {
  390. return (d[0] == 'X' && d[1] == 'i' && d[2] == 'n' && d[3] == 'g')
  391. || (d[0] == 'I' && d[1] == 'n' && d[2] == 'f' && d[3] == 'o');
  392. }
  393. };
  394. //==============================================================================
  395. struct MP3Frame
  396. {
  397. MP3Frame()
  398. {
  399. zeromem (this, sizeof (MP3Frame));
  400. single = -1;
  401. }
  402. void selectLayer2Table()
  403. {
  404. static const int translate[3][2][16] =
  405. {
  406. { { 0, 2, 2, 2, 2, 2, 2, 0, 0, 0, 1, 1, 1, 1, 1, 0 }, { 0, 2, 2, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 } },
  407. { { 0, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, { 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } },
  408. { { 0, 3, 3, 3, 3, 3, 3, 0, 0, 0, 1, 1, 1, 1, 1, 0 }, { 0, 3, 3, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 } }
  409. };
  410. static const AllocationTable* const tables[] = { allocTable0, allocTable1, allocTable2, allocTable3, allocTable4 };
  411. static const int limits[] = { 27, 30, 8, 12, 30 };
  412. const int index = lsf ? 4 : translate[sampleRateIndex][2 - numChannels][bitrateIndex];
  413. layer2SubBandLimit = limits [index];
  414. allocationTable = tables [index];
  415. }
  416. int getFrequency() const noexcept
  417. {
  418. const int frequencies[] = { 44100, 48000, 32000, 22050, 24000, 16000, 11025, 12000, 8000 };
  419. return frequencies [sampleRateIndex];
  420. }
  421. void decodeHeader (const uint32 header)
  422. {
  423. jassert (((header >> 10) & 3) != 3);
  424. mpeg25 = (header & (1 << 20)) == 0;
  425. lsf = mpeg25 ? 1 : ((header & (1 << 19)) ? 0 : 1);
  426. layer = 4 - ((header >> 17) & 3);
  427. sampleRateIndex = mpeg25 ? (6 + ((header >> 10) & 3)) : (((header >> 10) & 3) + (lsf * 3));
  428. crc16FollowsHeader = ((header >> 16) & 1) == 0;
  429. bitrateIndex = (header >> 12) & 15;
  430. padding = (header >> 9) & 1;
  431. mode = (header >> 6) & 3;
  432. modeExt = (header >> 4) & 3;
  433. //extension = (header >> 8) & 1;
  434. //copyright = (header >> 3) & 1;
  435. //original = (header >> 2) & 1;
  436. //emphasis = header & 3;
  437. numChannels = (mode == 3) ? 1 : 2;
  438. static const int frameSizes [2][3][16] =
  439. {
  440. { { 0, 32, 64, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 416, 448 },
  441. { 0, 32, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 256, 320, 384 },
  442. { 0, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 256, 320 } },
  443. { { 0, 32, 48, 56, 64, 80, 96, 112, 128, 144, 160, 176, 192, 224, 256 },
  444. { 0, 8, 16, 24, 32, 40, 48, 56, 64, 80, 96, 112, 128, 144, 160 },
  445. { 0, 8, 16, 24, 32, 40, 48, 56, 64, 80, 96, 112, 128, 144, 160 } }
  446. };
  447. switch (layer)
  448. {
  449. case 1: frameSize = (((frameSizes[lsf][0][bitrateIndex] * 12000) / getFrequency() + padding) * 4) - 4; break;
  450. case 2: frameSize = (frameSizes[lsf][1][bitrateIndex] * 144000) / getFrequency() + (padding - 4); break;
  451. case 3: frameSize = (bitrateIndex == 0) ? 0 : ((frameSizes[lsf][2][bitrateIndex] * 144000) / (getFrequency() << lsf) + (padding - 4)); break;
  452. default: break;
  453. }
  454. }
  455. int layer, frameSize, numChannels, single;
  456. int lsf; // 0 = mpeg-1, 1 = mpeg-2/LSF
  457. bool mpeg25; // true = mpeg-2.5, false = mpeg-1/2
  458. bool crc16FollowsHeader;
  459. int bitrateIndex, sampleRateIndex, padding;
  460. int mode, modeExt, layer2SubBandLimit;
  461. enum { downSampleLimit = 32 };
  462. const AllocationTable* allocationTable;
  463. };
  464. //==============================================================================
  465. struct Constants
  466. {
  467. Constants()
  468. {
  469. cosTables[0] = cos64; cosTables[1] = cos32; cosTables[2] = cos16; cosTables[3] = cos8; cosTables[4] = cos4;
  470. initDecodeTables();
  471. initLayer2Tables();
  472. initLayer3Tables();
  473. }
  474. const uint8* getGroupTable (const int16 d1, const int index) const noexcept
  475. {
  476. switch (d1)
  477. {
  478. case 3: return &group3tab [3 * jmin (index, 3 * 3 * 3)];
  479. case 5: return &group5tab [3 * jmin (index, 5 * 5 * 5)];
  480. case 9: return &group9tab [3 * jmin (index, 9 * 9 * 9)];
  481. default: break;
  482. }
  483. static const uint8 dummy[] = { 0, 0, 0 };
  484. return dummy;
  485. }
  486. float muls[27][64];
  487. float nToThe4Over3[8207];
  488. float antiAliasingCa[8], antiAliasingCs[8];
  489. float win[4][36];
  490. float win1[4][36];
  491. float powToGains[256 + 118 + 4];
  492. int longLimit[9][23];
  493. int shortLimit[9][14];
  494. float tan1_1[16], tan2_1[16], tan1_2[16], tan2_2[16];
  495. float pow1_1[2][16], pow2_1[2][16], pow1_2[2][16], pow2_2[2][16];
  496. int* map[9][3];
  497. int* mapEnd[9][3];
  498. uint32 nLength2[512];
  499. uint32 iLength2[256];
  500. float decodeWin[512 + 32];
  501. float* cosTables[5];
  502. private:
  503. int mapbuf0[9][152];
  504. int mapbuf1[9][156];
  505. int mapbuf2[9][44];
  506. float cos64[16], cos32[8], cos16[4], cos8[2], cos4[1];
  507. uint8 group3tab [32 * 3];
  508. uint8 group5tab [128 * 3];
  509. uint8 group9tab [1024 * 3];
  510. void initDecodeTables()
  511. {
  512. int i, j, scaleval = -1;
  513. float* table = decodeWin;
  514. for (i = 0; i < 5; ++i)
  515. {
  516. int kr = 0x10 >> i;
  517. int divv = 0x40 >> i;
  518. float* costab = cosTables[i];
  519. for (int k = 0; k < kr; ++k)
  520. costab[k] = (float) (1.0 / (2.0 * cos (double_Pi * (k * 2 + 1) / divv)));
  521. }
  522. for (i = 0, j = 0; i < 256; ++i, ++j, table += 32)
  523. {
  524. if (table < decodeWin + 512 + 16)
  525. table[16] = table[0] = (float) (decodeWindow[j] * scaleval);
  526. if (i % 32 == 31)
  527. table -= 1023;
  528. if (i % 64 == 63)
  529. scaleval = -scaleval;
  530. }
  531. for (; i < 512; ++i, --j, table += 32)
  532. {
  533. if (table < decodeWin + 512 + 16)
  534. table[16] = table[0] = (float) (decodeWindow[j] * scaleval);
  535. if (i % 32 == 31) table -= 1023;
  536. if (i % 64 == 63) scaleval = -scaleval;
  537. }
  538. }
  539. void initLayer2Tables()
  540. {
  541. static const uint8 base[3][9] =
  542. {
  543. { 1, 0, 2 },
  544. { 17, 18, 0, 19, 20 },
  545. { 21, 1, 22, 23, 0, 24, 25, 2, 26 }
  546. };
  547. static const int tableLengths[] = { 3, 5, 9 };
  548. static uint8* tables[] = { group3tab, group5tab, group9tab };
  549. for (int i = 0; i < 3; ++i)
  550. {
  551. uint8* table = tables[i];
  552. const int len = tableLengths[i];
  553. for (int j = 0; j < len; ++j)
  554. for (int k = 0; k < len; ++k)
  555. for (int l = 0; l < len; ++l)
  556. {
  557. *table++ = base[i][l];
  558. *table++ = base[i][k];
  559. *table++ = base[i][j];
  560. }
  561. }
  562. for (int k = 0; k < 27; ++k)
  563. {
  564. static const double multipliers[] =
  565. {
  566. 0, -2.0 / 3.0, 2.0 / 3.0, 2.0 / 7.0, 2.0 / 15.0, 2.0 / 31.0, 2.0 / 63.0, 2.0 / 127.0, 2.0 / 255.0,
  567. 2.0 / 511.0, 2.0 / 1023.0, 2.0 / 2047.0, 2.0 / 4095.0, 2.0 / 8191.0, 2.0 / 16383.0, 2.0 / 32767.0, 2.0 / 65535.0,
  568. -4.0 / 5.0, -2.0 / 5.0, 2.0 / 5.0, 4.0 / 5.0, -8.0 / 9.0, -4.0 / 9.0, -2.0 / 9.0, 2.0 / 9.0, 4.0 / 9.0, 8.0 / 9.0
  569. };
  570. float* table = muls[k];
  571. for (int j = 3, i = 0; i < 63; ++i, --j)
  572. *table++ = (float) (multipliers[k] * pow (2.0, j / 3.0));
  573. *table++ = 0;
  574. }
  575. }
  576. void initLayer3Tables()
  577. {
  578. int i, j;
  579. for (i = -256; i < 118 + 4; ++i)
  580. powToGains[i + 256] = (float) pow (2.0, -0.25 * (i + 210));
  581. for (i = 0; i < 8207; ++i)
  582. nToThe4Over3[i] = (float) pow ((double) i, 4.0 / 3.0);
  583. for (i = 0; i < 8; ++i)
  584. {
  585. static double Ci[] = { -0.6, -0.535, -0.33, -0.185, -0.095, -0.041, -0.0142, -0.0037 };
  586. const double sq = sqrt (1.0 + Ci[i] * Ci[i]);
  587. antiAliasingCs[i] = (float) (1.0 / sq);
  588. antiAliasingCa[i] = (float) (Ci[i] / sq);
  589. }
  590. for (i = 0; i < 18; ++i)
  591. {
  592. win[0][i] = win[1][i] = (float) (0.5 * sin (double_Pi / 72.0 * (2 * i + 1)) / cos (double_Pi * (2 * i + 19) / 72.0));
  593. win[0][i + 18] = win[3][i + 18] = (float) (0.5 * sin (double_Pi / 72.0 * (2 * (i + 18) + 1)) / cos (double_Pi * (2 * (i + 18) + 19) / 72.0));
  594. }
  595. const double piOver72 = double_Pi;
  596. for (i = 0; i < 6; ++i)
  597. {
  598. win[1][i + 18] = (float) (0.5 / cos (piOver72 * (2 * (i + 18) + 19)));
  599. win[3][i + 12] = (float) (0.5 / cos (piOver72 * (2 * (i + 12) + 19)));
  600. win[1][i + 24] = (float) (0.5 * sin (double_Pi / 24.0 * (2 * i + 13)) / cos (piOver72 * (2 * (i + 24) + 19)));
  601. win[1][i + 30] = win[3][i] = 0;
  602. win[3][i + 6] = (float) (0.5 * sin (double_Pi / 24.0 * (2 * i + 1)) / cos (piOver72 * (2 * (i + 6) + 19)));
  603. }
  604. for (i = 0; i < 12; ++i)
  605. win[2][i] = (float) (0.5 * sin (double_Pi / 24.0 * (2 * i + 1)) / cos (double_Pi * (2 * i + 7) / 24.0));
  606. for (j = 0; j < 4; ++j)
  607. {
  608. static const int len[4] = { 36, 36, 12, 36 };
  609. for (i = 0; i < len[j]; i += 2) win1[j][i] = win[j][i];
  610. for (i = 1; i < len[j]; i += 2) win1[j][i] = -win[j][i];
  611. }
  612. const double sqrt2 = 1.41421356237309504880168872420969808;
  613. for (i = 0; i < 16; ++i)
  614. {
  615. const double t = tan (i * double_Pi / 12.0);
  616. tan1_1[i] = (float) (t / (1.0 + t));
  617. tan2_1[i] = (float) (1.0 / (1.0 + t));
  618. tan1_2[i] = (float) (sqrt2 * t / (1.0 + t));
  619. tan2_2[i] = (float) (sqrt2 / (1.0 + t));
  620. for (j = 0; j < 2; ++j)
  621. {
  622. double p1 = 1.0, p2 = 1.0;
  623. if (i > 0)
  624. {
  625. const double base = pow (2.0, -0.25 * (j + 1));
  626. if (i & 1)
  627. p1 = pow (base, (i + 1) * 0.5);
  628. else
  629. p2 = pow (base, i * 0.5);
  630. }
  631. pow1_1[j][i] = (float) p1;
  632. pow2_1[j][i] = (float) p2;
  633. pow1_2[j][i] = (float) (sqrt2 * p1);
  634. pow2_2[j][i] = (float) (sqrt2 * p2);
  635. }
  636. }
  637. for (j = 0; j < 9; ++j)
  638. {
  639. const BandInfoStruct& bi = bandInfo[j];
  640. int cb;
  641. int* mp = map[j][0] = mapbuf0[j];
  642. const int16* bdf = bi.longDiff;
  643. for (i = 0, cb = 0; cb < 8; ++cb, i += *bdf++)
  644. {
  645. *mp++ = (*bdf) >> 1;
  646. *mp++ = i;
  647. *mp++ = 3;
  648. *mp++ = cb;
  649. }
  650. bdf = bi.shortDiff + 3;
  651. for (cb = 3; cb < 13; ++cb)
  652. {
  653. const int l = (*bdf++) >> 1;
  654. for (int lwin = 0; lwin < 3; ++lwin)
  655. {
  656. *mp++ = l;
  657. *mp++ = i + lwin;
  658. *mp++ = lwin;
  659. *mp++ = cb;
  660. }
  661. i += 6 * l;
  662. }
  663. mapEnd[j][0] = mp;
  664. mp = map[j][1] = mapbuf1[j];
  665. bdf = bi.shortDiff;
  666. for (i = 0, cb = 0; cb < 13; ++cb)
  667. {
  668. const int l = (*bdf++) >> 1;
  669. for (int lwin = 0; lwin < 3; ++lwin)
  670. {
  671. *mp++ = l;
  672. *mp++ = i + lwin;
  673. *mp++ = lwin;
  674. *mp++ = cb;
  675. }
  676. i += 6 * l;
  677. }
  678. mapEnd[j][1] = mp;
  679. mp = map[j][2] = mapbuf2[j];
  680. bdf = bi.longDiff;
  681. for (cb = 0; cb < 22; ++cb)
  682. {
  683. *mp++ = (*bdf++) >> 1;
  684. *mp++ = cb;
  685. }
  686. mapEnd[j][2] = mp;
  687. }
  688. for (j = 0; j < 9; ++j)
  689. {
  690. for (i = 0; i < 23; ++i) longLimit[j][i] = jmin (32, (bandInfo[j].longIndex[i] - 1 + 8) / 18 + 1);
  691. for (i = 0; i < 14; ++i) shortLimit[j][i] = jmin (32, (bandInfo[j].shortIndex[i] - 1) / 18 + 1);
  692. }
  693. for (i = 0; i < 5; ++i)
  694. for (j = 0; j < 6; ++j)
  695. for (int k = 0; k < 6; ++k)
  696. {
  697. const int n = k + j * 6 + i * 36;
  698. iLength2[n] = i | (j << 3) | (k << 6) | (3 << 12);
  699. }
  700. for (i = 0; i < 4; ++i)
  701. for (j = 0; j < 4; ++j)
  702. for (int k = 0; k < 4; ++k)
  703. {
  704. const int n = k + j * 4 + i * 16;
  705. iLength2[n + 180] = i | (j << 3) | (k << 6) | (4 << 12);
  706. }
  707. for (i = 0; i < 4; ++i)
  708. for (j = 0; j < 3; ++j)
  709. {
  710. const int n = j + i * 3;
  711. iLength2[n + 244] = i | (j << 3) | (5 << 12);
  712. nLength2[n + 500] = i | (j << 3) | (2 << 12) | (1 << 15);
  713. }
  714. for (i = 0; i < 5; ++i)
  715. for (j = 0; j < 5; ++j)
  716. for (int k = 0; k < 4; ++k)
  717. for (int l = 0; l < 4; ++l)
  718. {
  719. const int n = l + k * 4 + j * 16 + i * 80;
  720. nLength2[n] = i | (j << 3) | (k << 6) | (l << 9) | (0 << 12);
  721. }
  722. for (i = 0; i < 5; ++i)
  723. for (j = 0; j < 5; ++j)
  724. for (int k = 0; k < 4; ++k)
  725. {
  726. const int n = k + j * 4 + i * 20;
  727. nLength2[n + 400] = i | (j << 3) | (k << 6) | (1 << 12);
  728. }
  729. }
  730. };
  731. static const Constants constants;
  732. //==============================================================================
  733. struct Layer3SideInfo
  734. {
  735. struct Info
  736. {
  737. void doAntialias (float xr[32][18]) const noexcept
  738. {
  739. float* xr1 = xr[1];
  740. int sb;
  741. if (blockType == 2)
  742. {
  743. if (mixedBlockFlag == 0)
  744. return;
  745. sb = 1;
  746. }
  747. else
  748. sb = maxb - 1;
  749. for (; sb != 0; --sb, xr1 += 10)
  750. {
  751. const float* cs = constants.antiAliasingCs;
  752. const float* ca = constants.antiAliasingCa;
  753. float* xr2 = xr1;
  754. for (int ss = 7; ss >= 0; --ss)
  755. {
  756. const float bu = *--xr2, bd = *xr1;
  757. *xr2 = (bu * *cs) - (bd * *ca);
  758. *xr1++ = (bd * *cs++) + (bu * *ca++);
  759. }
  760. }
  761. }
  762. void doIStereo (float xrBuffer[2][32][18], const int* const scaleFactors,
  763. const int sampleRate, const bool msStereo, const int lsf) const noexcept
  764. {
  765. float (*xr) [32 * 18] = (float (*) [32 * 18]) xrBuffer;
  766. const BandInfoStruct& bi = bandInfo[sampleRate];
  767. const float* tabl1, *tabl2;
  768. if (lsf != 0)
  769. {
  770. const int p = scaleFactorCompression & 1;
  771. if (msStereo)
  772. {
  773. tabl1 = constants.pow1_2[p];
  774. tabl2 = constants.pow2_2[p];
  775. }
  776. else
  777. {
  778. tabl1 = constants.pow1_1[p];
  779. tabl2 = constants.pow2_1[p];
  780. }
  781. }
  782. else
  783. {
  784. if (msStereo)
  785. {
  786. tabl1 = constants.tan1_2;
  787. tabl2 = constants.tan2_2;
  788. }
  789. else
  790. {
  791. tabl1 = constants.tan1_1;
  792. tabl2 = constants.tan2_1;
  793. }
  794. }
  795. if (blockType == 2)
  796. {
  797. bool doL = mixedBlockFlag != 0;
  798. for (int lwin = 0; lwin < 3; ++lwin)
  799. {
  800. int sfb = maxBand[lwin];
  801. doL = doL && (sfb <= 3);
  802. for (; sfb < 12; ++sfb)
  803. {
  804. const int p = scaleFactors[sfb * 3 + lwin - mixedBlockFlag];
  805. if (p != 7)
  806. {
  807. const float t1 = tabl1[p];
  808. const float t2 = tabl2[p];
  809. int sb = bi.shortDiff[sfb];
  810. int index = sb + lwin;
  811. for (; sb > 0; --sb, index += 3)
  812. {
  813. float v = xr[0][index];
  814. xr[0][index] = v * t1;
  815. xr[1][index] = v * t2;
  816. }
  817. }
  818. }
  819. const int p = scaleFactors[11 * 3 + lwin - mixedBlockFlag];
  820. if (p != 7)
  821. {
  822. const float t1 = tabl1[p];
  823. const float t2 = tabl2[p];
  824. int sb = bi.shortDiff[12];
  825. int index = sb + lwin;
  826. for (; sb > 0; --sb, index += 3)
  827. {
  828. float v = xr[0][index];
  829. xr[0][index] = v * t1;
  830. xr[1][index] = v * t2;
  831. }
  832. }
  833. }
  834. if (doL)
  835. {
  836. int index = bi.longIndex[maxBandl];
  837. for (int sfb = maxBandl; sfb < 8; ++sfb)
  838. {
  839. int sb = bi.longDiff[sfb];
  840. const int p = scaleFactors[sfb];
  841. if (p != 7)
  842. {
  843. const float t1 = tabl1[p];
  844. const float t2 = tabl2[p];
  845. for (; sb > 0; --sb, ++index)
  846. {
  847. float v = xr[0][index];
  848. xr[0][index] = v * t1;
  849. xr[1][index] = v * t2;
  850. }
  851. }
  852. else
  853. index += sb;
  854. }
  855. }
  856. }
  857. else
  858. {
  859. int index = bi.longIndex[maxBandl];
  860. for (int sfb = maxBandl; sfb < 21; ++sfb)
  861. {
  862. int sb = bi.longDiff[sfb];
  863. const int p = scaleFactors[sfb];
  864. if (p != 7)
  865. {
  866. const float t1 = tabl1[p];
  867. const float t2 = tabl2[p];
  868. for (; sb > 0; --sb, ++index)
  869. {
  870. const float v = xr[0][index];
  871. xr[0][index] = v * t1;
  872. xr[1][index] = v * t2;
  873. }
  874. }
  875. else
  876. index += sb;
  877. }
  878. const int p = scaleFactors[20];
  879. if (p != 7)
  880. {
  881. const float t1 = tabl1[p], t2 = tabl2[p];
  882. for (int sb = bi.longDiff[21]; sb > 0; --sb, ++index)
  883. {
  884. const float v = xr[0][index];
  885. xr[0][index] = v * t1;
  886. xr[1][index] = v * t2;
  887. }
  888. }
  889. }
  890. }
  891. int scfsi;
  892. uint32 part2_3Length, bigValues;
  893. uint32 scaleFactorCompression, blockType, mixedBlockFlag;
  894. uint32 tableSelect[3];
  895. uint32 maxBand[3];
  896. uint32 maxBandl, maxb, region1Start, region2Start;
  897. uint32 preflag, scaleFactorScale, count1TableSelect;
  898. const float* fullGain[3];
  899. const float* pow2gain;
  900. };
  901. struct InfoPair { Info gr[2]; };
  902. InfoPair ch[2];
  903. uint32 mainDataStart, privateBits;
  904. };
  905. //==============================================================================
  906. namespace DCT
  907. {
  908. enum { SBLIMIT = 32 };
  909. static const float cos6_1 = 0.866025388f;
  910. static const float cos6_2 = 0.5f;
  911. static const float cos9[] = { 1.0f, 0.98480773f, 0.939692616f, 0.866025388f, 0.766044438f, 0.642787635f, 0.5f, 0.342020154f, 0.173648179f };
  912. static const float cos36[] = { 0.501909912f, 0.517638087f, 0.551688969f, 0.610387266f, 0.707106769f, 0.871723413f, 1.18310082f, 1.93185163f, 5.73685646f };
  913. static const float cos12[] = { 0.517638087f, 0.707106769f, 1.93185163f };
  914. inline void dct36_0 (const int v, float* const ts, float* const out1, float* const out2,
  915. const float* const wintab, float sum0, const float sum1) noexcept
  916. {
  917. const float tmp = sum0 + sum1;
  918. out2[9 + v] = tmp * wintab[27 + v];
  919. out2[8 - v] = tmp * wintab[26 - v];
  920. sum0 -= sum1;
  921. ts[SBLIMIT * (8 - v)] = out1[8 - v] + sum0 * wintab[8 - v];
  922. ts[SBLIMIT * (9 + v)] = out1[9 + v] + sum0 * wintab[9 + v];
  923. }
  924. inline void dct36_1 (const int v, float* const ts, float* const out1, float* const out2, const float* const wintab,
  925. const float tmp1a, const float tmp1b, const float tmp2a, const float tmp2b) noexcept
  926. {
  927. dct36_0 (v, ts, out1, out2, wintab, tmp1a + tmp2a, (tmp1b + tmp2b) * cos36[v]);
  928. }
  929. inline void dct36_2 (const int v, float* const ts, float* const out1, float* const out2, const float* const wintab,
  930. const float tmp1a, const float tmp1b, const float tmp2a, const float tmp2b) noexcept
  931. {
  932. dct36_0 (v, ts, out1, out2, wintab, tmp2a - tmp1a, (tmp2b - tmp1b) * cos36[v]);
  933. }
  934. void dct36 (float* const in, float* const out1, float* const out2, const float* const wintab, float* const ts) noexcept
  935. {
  936. in[17] += in[16]; in[16] += in[15]; in[15] += in[14]; in[14] += in[13]; in[13] += in[12];
  937. in[12] += in[11]; in[11] += in[10]; in[10] += in[9]; in[9] += in[8]; in[8] += in[7];
  938. in[7] += in[6]; in[6] += in[5]; in[5] += in[4]; in[4] += in[3]; in[3] += in[2];
  939. in[2] += in[1]; in[1] += in[0]; in[17] += in[15]; in[15] += in[13]; in[13] += in[11];
  940. in[11] += in[9]; in[9] += in[7]; in[7] += in[5]; in[5] += in[3]; in[3] += in[1];
  941. const float ta33 = in[6] * cos9[3];
  942. const float ta66 = in[12] * cos9[6];
  943. const float tb33 = in[7] * cos9[3];
  944. const float tb66 = in[13] * cos9[6];
  945. {
  946. const float tmp1a = in[2] * cos9[1] + ta33 + in[10] * cos9[5] + in[14] * cos9[7];
  947. const float tmp1b = in[3] * cos9[1] + tb33 + in[11] * cos9[5] + in[15] * cos9[7];
  948. const float tmp2a = in[0] + in[4] * cos9[2] + in[8] * cos9[4] + ta66 + in[16] * cos9[8];
  949. const float tmp2b = in[1] + in[5] * cos9[2] + in[9] * cos9[4] + tb66 + in[17] * cos9[8];
  950. dct36_1 (0, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  951. dct36_2 (8, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  952. }
  953. {
  954. const float tmp1a = (in[2] - in[10] - in[14]) * cos9[3];
  955. const float tmp1b = (in[3] - in[11] - in[15]) * cos9[3];
  956. const float tmp2a = (in[4] - in[8] - in[16]) * cos9[6] - in[12] + in[0];
  957. const float tmp2b = (in[5] - in[9] - in[17]) * cos9[6] - in[13] + in[1];
  958. dct36_1 (1, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  959. dct36_2 (7, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  960. }
  961. {
  962. const float tmp1a = in[2] * cos9[5] - ta33 - in[10] * cos9[7] + in[14] * cos9[1];
  963. const float tmp1b = in[3] * cos9[5] - tb33 - in[11] * cos9[7] + in[15] * cos9[1];
  964. const float tmp2a = in[0] - in[4] * cos9[8] - in[8] * cos9[2] + ta66 + in[16] * cos9[4];
  965. const float tmp2b = in[1] - in[5] * cos9[8] - in[9] * cos9[2] + tb66 + in[17] * cos9[4];
  966. dct36_1 (2, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  967. dct36_2 (6, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  968. }
  969. {
  970. const float tmp1a = in[2] * cos9[7] - ta33 + in[10] * cos9[1] - in[14] * cos9[5];
  971. const float tmp1b = in[3] * cos9[7] - tb33 + in[11] * cos9[1] - in[15] * cos9[5];
  972. const float tmp2a = in[0] - in[4] * cos9[4] + in[8] * cos9[8] + ta66 - in[16] * cos9[2];
  973. const float tmp2b = in[1] - in[5] * cos9[4] + in[9] * cos9[8] + tb66 - in[17] * cos9[2];
  974. dct36_1 (3, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  975. dct36_2 (5, ts, out1, out2, wintab, tmp1a, tmp1b, tmp2a, tmp2b);
  976. }
  977. const float sum0 = in[0] - in[4] + in[8] - in[12] + in[16];
  978. const float sum1 = (in[1] - in[5] + in[9] - in[13] + in[17]) * cos36[4];
  979. dct36_0 (4, ts, out1, out2, wintab, sum0, sum1);
  980. }
  981. struct DCT12Inputs
  982. {
  983. float in0, in1, in2, in3, in4, in5;
  984. inline DCT12Inputs (const float* const in) noexcept
  985. {
  986. in5 = in[5*3] + (in4 = in[4*3]);
  987. in4 += (in3 = in[3*3]);
  988. in3 += (in2 = in[2*3]);
  989. in2 += (in1 = in[1*3]);
  990. in1 += (in0 = in[0*3]);
  991. in5 += in3; in3 += in1;
  992. in2 *= cos6_1;
  993. in3 *= cos6_1;
  994. }
  995. inline void process() noexcept
  996. {
  997. in0 += in4 * cos6_2;
  998. in4 = in0 + in2; in0 -= in2;
  999. in1 += in5 * cos6_2;
  1000. in5 = (in1 + in3) * cos12[0];
  1001. in1 = (in1 - in3) * cos12[2];
  1002. in3 = in4 + in5; in4 -= in5;
  1003. in2 = in0 + in1; in0 -= in1;
  1004. }
  1005. };
  1006. void dct12 (const float* in, float* const out1, float* const out2, const float* wi, float* ts) noexcept
  1007. {
  1008. {
  1009. ts[0] = out1[0];
  1010. ts[SBLIMIT * 1] = out1[1];
  1011. ts[SBLIMIT * 2] = out1[2];
  1012. ts[SBLIMIT * 3] = out1[3];
  1013. ts[SBLIMIT * 4] = out1[4];
  1014. ts[SBLIMIT * 5] = out1[5];
  1015. DCT12Inputs inputs (in);
  1016. {
  1017. float tmp1 = (inputs.in0 - inputs.in4);
  1018. const float tmp2 = (inputs.in1 - inputs.in5) * cos12[1];
  1019. const float tmp0 = tmp1 + tmp2;
  1020. tmp1 -= tmp2;
  1021. ts[16 * SBLIMIT] = out1[16] + tmp0 * wi[10];
  1022. ts[13 * SBLIMIT] = out1[13] + tmp0 * wi[7];
  1023. ts[7 * SBLIMIT] = out1[7] + tmp1 * wi[1];
  1024. ts[10 * SBLIMIT] = out1[10] + tmp1 * wi[4];
  1025. }
  1026. inputs.process();
  1027. ts[17 * SBLIMIT] = out1[17] + inputs.in2 * wi[11];
  1028. ts[12 * SBLIMIT] = out1[12] + inputs.in2 * wi[6];
  1029. ts[14 * SBLIMIT] = out1[14] + inputs.in3 * wi[8];
  1030. ts[15 * SBLIMIT] = out1[15] + inputs.in3 * wi[9];
  1031. ts[6 * SBLIMIT] = out1[6] + inputs.in0 * wi[0];
  1032. ts[11 * SBLIMIT] = out1[11] + inputs.in0 * wi[5];
  1033. ts[8 * SBLIMIT] = out1[8] + inputs.in4 * wi[2];
  1034. ts[9 * SBLIMIT] = out1[9] + inputs.in4 * wi[3];
  1035. }
  1036. {
  1037. DCT12Inputs inputs (++in);
  1038. float tmp1 = (inputs.in0 - inputs.in4);
  1039. const float tmp2 = (inputs.in1 - inputs.in5) * cos12[1];
  1040. const float tmp0 = tmp1 + tmp2;
  1041. tmp1 -= tmp2;
  1042. out2[4] = tmp0 * wi[10];
  1043. out2[1] = tmp0 * wi[7];
  1044. ts[13 * SBLIMIT] += tmp1 * wi[1];
  1045. ts[16 * SBLIMIT] += tmp1 * wi[4];
  1046. inputs.process();
  1047. out2[5] = inputs.in2 * wi[11];
  1048. out2[0] = inputs.in2 * wi[6];
  1049. out2[2] = inputs.in3 * wi[8];
  1050. out2[3] = inputs.in3 * wi[9];
  1051. ts[12 * SBLIMIT] += inputs.in0 * wi[0];
  1052. ts[17 * SBLIMIT] += inputs.in0 * wi[5];
  1053. ts[14 * SBLIMIT] += inputs.in4 * wi[2];
  1054. ts[15 * SBLIMIT] += inputs.in4 * wi[5 - 2];
  1055. }
  1056. {
  1057. DCT12Inputs inputs (++in);
  1058. out2[12] = out2[13] = out2[14] = out2[15] = out2[16] = out2[17] = 0;
  1059. float tmp1 = (inputs.in0 - inputs.in4);
  1060. const float tmp2 = (inputs.in1 - inputs.in5) * cos12[1];
  1061. const float tmp0 = tmp1 + tmp2;
  1062. tmp1 -= tmp2;
  1063. out2[10] = tmp0 * wi[10];
  1064. out2[7] = tmp0 * wi[7];
  1065. out2[1] += tmp1 * wi[1];
  1066. out2[4] += tmp1 * wi[4];
  1067. inputs.process();
  1068. out2[11] = inputs.in2 * wi[11];
  1069. out2[6] = inputs.in2 * wi[6];
  1070. out2[8] = inputs.in3 * wi[8];
  1071. out2[9] = inputs.in3 * wi[9];
  1072. out2[0] += inputs.in0 * wi[0];
  1073. out2[5] += inputs.in0 * wi[5];
  1074. out2[2] += inputs.in4 * wi[2];
  1075. out2[3] += inputs.in4 * wi[3];
  1076. }
  1077. }
  1078. void dct64 (float* const out0, float* const out1, float* const b1, float* const b2, const float* const samples) noexcept
  1079. {
  1080. {
  1081. const float* const costab = constants.cosTables[0];
  1082. b1[0x00] = samples[0x00] + samples[0x1F]; b1[0x1F] = (samples[0x00] - samples[0x1F]) * costab[0x0];
  1083. b1[0x01] = samples[0x01] + samples[0x1E]; b1[0x1E] = (samples[0x01] - samples[0x1E]) * costab[0x1];
  1084. b1[0x02] = samples[0x02] + samples[0x1D]; b1[0x1D] = (samples[0x02] - samples[0x1D]) * costab[0x2];
  1085. b1[0x03] = samples[0x03] + samples[0x1C]; b1[0x1C] = (samples[0x03] - samples[0x1C]) * costab[0x3];
  1086. b1[0x04] = samples[0x04] + samples[0x1B]; b1[0x1B] = (samples[0x04] - samples[0x1B]) * costab[0x4];
  1087. b1[0x05] = samples[0x05] + samples[0x1A]; b1[0x1A] = (samples[0x05] - samples[0x1A]) * costab[0x5];
  1088. b1[0x06] = samples[0x06] + samples[0x19]; b1[0x19] = (samples[0x06] - samples[0x19]) * costab[0x6];
  1089. b1[0x07] = samples[0x07] + samples[0x18]; b1[0x18] = (samples[0x07] - samples[0x18]) * costab[0x7];
  1090. b1[0x08] = samples[0x08] + samples[0x17]; b1[0x17] = (samples[0x08] - samples[0x17]) * costab[0x8];
  1091. b1[0x09] = samples[0x09] + samples[0x16]; b1[0x16] = (samples[0x09] - samples[0x16]) * costab[0x9];
  1092. b1[0x0A] = samples[0x0A] + samples[0x15]; b1[0x15] = (samples[0x0A] - samples[0x15]) * costab[0xA];
  1093. b1[0x0B] = samples[0x0B] + samples[0x14]; b1[0x14] = (samples[0x0B] - samples[0x14]) * costab[0xB];
  1094. b1[0x0C] = samples[0x0C] + samples[0x13]; b1[0x13] = (samples[0x0C] - samples[0x13]) * costab[0xC];
  1095. b1[0x0D] = samples[0x0D] + samples[0x12]; b1[0x12] = (samples[0x0D] - samples[0x12]) * costab[0xD];
  1096. b1[0x0E] = samples[0x0E] + samples[0x11]; b1[0x11] = (samples[0x0E] - samples[0x11]) * costab[0xE];
  1097. b1[0x0F] = samples[0x0F] + samples[0x10]; b1[0x10] = (samples[0x0F] - samples[0x10]) * costab[0xF];
  1098. }
  1099. {
  1100. const float* const costab = constants.cosTables[1];
  1101. b2[0x00] = b1[0x00] + b1[0x0F]; b2[0x0F] = (b1[0x00] - b1[0x0F]) * costab[0];
  1102. b2[0x01] = b1[0x01] + b1[0x0E]; b2[0x0E] = (b1[0x01] - b1[0x0E]) * costab[1];
  1103. b2[0x02] = b1[0x02] + b1[0x0D]; b2[0x0D] = (b1[0x02] - b1[0x0D]) * costab[2];
  1104. b2[0x03] = b1[0x03] + b1[0x0C]; b2[0x0C] = (b1[0x03] - b1[0x0C]) * costab[3];
  1105. b2[0x04] = b1[0x04] + b1[0x0B]; b2[0x0B] = (b1[0x04] - b1[0x0B]) * costab[4];
  1106. b2[0x05] = b1[0x05] + b1[0x0A]; b2[0x0A] = (b1[0x05] - b1[0x0A]) * costab[5];
  1107. b2[0x06] = b1[0x06] + b1[0x09]; b2[0x09] = (b1[0x06] - b1[0x09]) * costab[6];
  1108. b2[0x07] = b1[0x07] + b1[0x08]; b2[0x08] = (b1[0x07] - b1[0x08]) * costab[7];
  1109. b2[0x10] = b1[0x10] + b1[0x1F]; b2[0x1F] = (b1[0x1F] - b1[0x10]) * costab[0];
  1110. b2[0x11] = b1[0x11] + b1[0x1E]; b2[0x1E] = (b1[0x1E] - b1[0x11]) * costab[1];
  1111. b2[0x12] = b1[0x12] + b1[0x1D]; b2[0x1D] = (b1[0x1D] - b1[0x12]) * costab[2];
  1112. b2[0x13] = b1[0x13] + b1[0x1C]; b2[0x1C] = (b1[0x1C] - b1[0x13]) * costab[3];
  1113. b2[0x14] = b1[0x14] + b1[0x1B]; b2[0x1B] = (b1[0x1B] - b1[0x14]) * costab[4];
  1114. b2[0x15] = b1[0x15] + b1[0x1A]; b2[0x1A] = (b1[0x1A] - b1[0x15]) * costab[5];
  1115. b2[0x16] = b1[0x16] + b1[0x19]; b2[0x19] = (b1[0x19] - b1[0x16]) * costab[6];
  1116. b2[0x17] = b1[0x17] + b1[0x18]; b2[0x18] = (b1[0x18] - b1[0x17]) * costab[7];
  1117. }
  1118. {
  1119. const float* const costab = constants.cosTables[2];
  1120. b1[0x00] = b2[0x00] + b2[0x07]; b1[0x07] = (b2[0x00] - b2[0x07]) * costab[0];
  1121. b1[0x01] = b2[0x01] + b2[0x06]; b1[0x06] = (b2[0x01] - b2[0x06]) * costab[1];
  1122. b1[0x02] = b2[0x02] + b2[0x05]; b1[0x05] = (b2[0x02] - b2[0x05]) * costab[2];
  1123. b1[0x03] = b2[0x03] + b2[0x04]; b1[0x04] = (b2[0x03] - b2[0x04]) * costab[3];
  1124. b1[0x08] = b2[0x08] + b2[0x0F]; b1[0x0F] = (b2[0x0F] - b2[0x08]) * costab[0];
  1125. b1[0x09] = b2[0x09] + b2[0x0E]; b1[0x0E] = (b2[0x0E] - b2[0x09]) * costab[1];
  1126. b1[0x0A] = b2[0x0A] + b2[0x0D]; b1[0x0D] = (b2[0x0D] - b2[0x0A]) * costab[2];
  1127. b1[0x0B] = b2[0x0B] + b2[0x0C]; b1[0x0C] = (b2[0x0C] - b2[0x0B]) * costab[3];
  1128. b1[0x10] = b2[0x10] + b2[0x17]; b1[0x17] = (b2[0x10] - b2[0x17]) * costab[0];
  1129. b1[0x11] = b2[0x11] + b2[0x16]; b1[0x16] = (b2[0x11] - b2[0x16]) * costab[1];
  1130. b1[0x12] = b2[0x12] + b2[0x15]; b1[0x15] = (b2[0x12] - b2[0x15]) * costab[2];
  1131. b1[0x13] = b2[0x13] + b2[0x14]; b1[0x14] = (b2[0x13] - b2[0x14]) * costab[3];
  1132. b1[0x18] = b2[0x18] + b2[0x1F]; b1[0x1F] = (b2[0x1F] - b2[0x18]) * costab[0];
  1133. b1[0x19] = b2[0x19] + b2[0x1E]; b1[0x1E] = (b2[0x1E] - b2[0x19]) * costab[1];
  1134. b1[0x1A] = b2[0x1A] + b2[0x1D]; b1[0x1D] = (b2[0x1D] - b2[0x1A]) * costab[2];
  1135. b1[0x1B] = b2[0x1B] + b2[0x1C]; b1[0x1C] = (b2[0x1C] - b2[0x1B]) * costab[3];
  1136. }
  1137. {
  1138. const float cos0 = constants.cosTables[3][0];
  1139. const float cos1 = constants.cosTables[3][1];
  1140. b2[0x00] = b1[0x00] + b1[0x03]; b2[0x03] = (b1[0x00] - b1[0x03]) * cos0;
  1141. b2[0x01] = b1[0x01] + b1[0x02]; b2[0x02] = (b1[0x01] - b1[0x02]) * cos1;
  1142. b2[0x04] = b1[0x04] + b1[0x07]; b2[0x07] = (b1[0x07] - b1[0x04]) * cos0;
  1143. b2[0x05] = b1[0x05] + b1[0x06]; b2[0x06] = (b1[0x06] - b1[0x05]) * cos1;
  1144. b2[0x08] = b1[0x08] + b1[0x0B]; b2[0x0B] = (b1[0x08] - b1[0x0B]) * cos0;
  1145. b2[0x09] = b1[0x09] + b1[0x0A]; b2[0x0A] = (b1[0x09] - b1[0x0A]) * cos1;
  1146. b2[0x0C] = b1[0x0C] + b1[0x0F]; b2[0x0F] = (b1[0x0F] - b1[0x0C]) * cos0;
  1147. b2[0x0D] = b1[0x0D] + b1[0x0E]; b2[0x0E] = (b1[0x0E] - b1[0x0D]) * cos1;
  1148. b2[0x10] = b1[0x10] + b1[0x13]; b2[0x13] = (b1[0x10] - b1[0x13]) * cos0;
  1149. b2[0x11] = b1[0x11] + b1[0x12]; b2[0x12] = (b1[0x11] - b1[0x12]) * cos1;
  1150. b2[0x14] = b1[0x14] + b1[0x17]; b2[0x17] = (b1[0x17] - b1[0x14]) * cos0;
  1151. b2[0x15] = b1[0x15] + b1[0x16]; b2[0x16] = (b1[0x16] - b1[0x15]) * cos1;
  1152. b2[0x18] = b1[0x18] + b1[0x1B]; b2[0x1B] = (b1[0x18] - b1[0x1B]) * cos0;
  1153. b2[0x19] = b1[0x19] + b1[0x1A]; b2[0x1A] = (b1[0x19] - b1[0x1A]) * cos1;
  1154. b2[0x1C] = b1[0x1C] + b1[0x1F]; b2[0x1F] = (b1[0x1F] - b1[0x1C]) * cos0;
  1155. b2[0x1D] = b1[0x1D] + b1[0x1E]; b2[0x1E] = (b1[0x1E] - b1[0x1D]) * cos1;
  1156. }
  1157. {
  1158. const float cos0 = constants.cosTables[4][0];
  1159. b1[0x00] = b2[0x00] + b2[0x01]; b1[0x01] = (b2[0x00] - b2[0x01]) * cos0;
  1160. b1[0x02] = b2[0x02] + b2[0x03]; b1[0x03] = (b2[0x03] - b2[0x02]) * cos0; b1[0x02] += b1[0x03];
  1161. b1[0x04] = b2[0x04] + b2[0x05]; b1[0x05] = (b2[0x04] - b2[0x05]) * cos0;
  1162. b1[0x06] = b2[0x06] + b2[0x07]; b1[0x07] = (b2[0x07] - b2[0x06]) * cos0;
  1163. b1[0x06] += b1[0x07]; b1[0x04] += b1[0x06]; b1[0x06] += b1[0x05]; b1[0x05] += b1[0x07];
  1164. b1[0x08] = b2[0x08] + b2[0x09]; b1[0x09] = (b2[0x08] - b2[0x09]) * cos0;
  1165. b1[0x0A] = b2[0x0A] + b2[0x0B]; b1[0x0B] = (b2[0x0B] - b2[0x0A]) * cos0; b1[0x0A] += b1[0x0B];
  1166. b1[0x0C] = b2[0x0C] + b2[0x0D]; b1[0x0D] = (b2[0x0C] - b2[0x0D]) * cos0;
  1167. b1[0x0E] = b2[0x0E] + b2[0x0F]; b1[0x0F] = (b2[0x0F] - b2[0x0E]) * cos0;
  1168. b1[0x0E] += b1[0x0F]; b1[0x0C] += b1[0x0E]; b1[0x0E] += b1[0x0D]; b1[0x0D] += b1[0x0F];
  1169. b1[0x10] = b2[0x10] + b2[0x11]; b1[0x11] = (b2[0x10] - b2[0x11]) * cos0;
  1170. b1[0x12] = b2[0x12] + b2[0x13]; b1[0x13] = (b2[0x13] - b2[0x12]) * cos0; b1[0x12] += b1[0x13];
  1171. b1[0x14] = b2[0x14] + b2[0x15]; b1[0x15] = (b2[0x14] - b2[0x15]) * cos0;
  1172. b1[0x16] = b2[0x16] + b2[0x17]; b1[0x17] = (b2[0x17] - b2[0x16]) * cos0;
  1173. b1[0x16] += b1[0x17]; b1[0x14] += b1[0x16]; b1[0x16] += b1[0x15]; b1[0x15] += b1[0x17];
  1174. b1[0x18] = b2[0x18] + b2[0x19]; b1[0x19] = (b2[0x18] - b2[0x19]) * cos0;
  1175. b1[0x1A] = b2[0x1A] + b2[0x1B]; b1[0x1B] = (b2[0x1B] - b2[0x1A]) * cos0; b1[0x1A] += b1[0x1B];
  1176. b1[0x1C] = b2[0x1C] + b2[0x1D]; b1[0x1D] = (b2[0x1C] - b2[0x1D]) * cos0;
  1177. b1[0x1E] = b2[0x1E] + b2[0x1F]; b1[0x1F] = (b2[0x1F] - b2[0x1E]) * cos0;
  1178. b1[0x1E] += b1[0x1F]; b1[0x1C] += b1[0x1E]; b1[0x1E] += b1[0x1D]; b1[0x1D] += b1[0x1F];
  1179. }
  1180. out0[0x10 * 16] = b1[0x00]; out0[0x10 * 12] = b1[0x04]; out0[0x10 * 8] = b1[0x02]; out0[0x10 * 4] = b1[0x06];
  1181. out0[0] = b1[0x01]; out1[0] = b1[0x01]; out1[0x10 * 4] = b1[0x05]; out1[0x10 * 8] = b1[0x03];
  1182. out1[0x10 * 12] = b1[0x07];
  1183. b1[0x08] += b1[0x0C]; out0[0x10 * 14] = b1[0x08]; b1[0x0C] += b1[0x0a]; out0[0x10 * 10] = b1[0x0C];
  1184. b1[0x0A] += b1[0x0E]; out0[0x10 * 6] = b1[0x0A]; b1[0x0E] += b1[0x09]; out0[0x10 * 2] = b1[0x0E];
  1185. b1[0x09] += b1[0x0D]; out1[0x10 * 2] = b1[0x09]; b1[0x0D] += b1[0x0B]; out1[0x10 * 6] = b1[0x0D];
  1186. b1[0x0B] += b1[0x0F]; out1[0x10 * 10] = b1[0x0B]; out1[0x10 * 14] = b1[0x0F];
  1187. b1[0x18] += b1[0x1C]; out0[0x10 * 15] = b1[0x10] + b1[0x18]; out0[0x10 * 13] = b1[0x18] + b1[0x14];
  1188. b1[0x1C] += b1[0x1a]; out0[0x10 * 11] = b1[0x14] + b1[0x1C]; out0[0x10 * 9] = b1[0x1C] + b1[0x12];
  1189. b1[0x1A] += b1[0x1E]; out0[0x10 * 7] = b1[0x12] + b1[0x1A]; out0[0x10 * 5] = b1[0x1A] + b1[0x16];
  1190. b1[0x1E] += b1[0x19]; out0[0x10 * 3] = b1[0x16] + b1[0x1E]; out0[0x10 * 1] = b1[0x1E] + b1[0x11];
  1191. b1[0x19] += b1[0x1D]; out1[0x10 * 1] = b1[0x11] + b1[0x19]; out1[0x10 * 3] = b1[0x19] + b1[0x15];
  1192. b1[0x1D] += b1[0x1B]; out1[0x10 * 5] = b1[0x15] + b1[0x1D]; out1[0x10 * 7] = b1[0x1D] + b1[0x13];
  1193. b1[0x1B] += b1[0x1F]; out1[0x10 * 9] = b1[0x13] + b1[0x1B]; out1[0x10 * 11] = b1[0x1B] + b1[0x17];
  1194. out1[0x10 * 13] = b1[0x17] + b1[0x1F]; out1[0x10 * 15] = b1[0x1F];
  1195. }
  1196. void dct64 (float* const a, float* const b, const float* const c) noexcept
  1197. {
  1198. float temp[64];
  1199. dct64 (a, b, temp, temp + 32, c);
  1200. }
  1201. }
  1202. //==============================================================================
  1203. struct MP3Stream
  1204. {
  1205. MP3Stream (InputStream& source)
  1206. : stream (source, 8192),
  1207. numFrames (0), currentFrameIndex (0), vbrHeaderFound (false)
  1208. {
  1209. reset();
  1210. }
  1211. int decodeNextBlock (float* const out0, float* const out1, int& done)
  1212. {
  1213. if (! headerParsed)
  1214. {
  1215. int nextFrameOffset = scanForNextFrameHeader (false);
  1216. if (lastFrameSize == -1 || needToSyncBitStream)
  1217. {
  1218. needToSyncBitStream = false;
  1219. readVBRHeader();
  1220. if (vbrHeaderFound)
  1221. return 1;
  1222. }
  1223. if (nextFrameOffset < 0)
  1224. return -1;
  1225. if (nextFrameOffset > 0)
  1226. {
  1227. int size;
  1228. wasFreeFormat = false;
  1229. needToSyncBitStream = true;
  1230. size = (int) (bufferPointer - (bufferSpace[bufferSpaceIndex] + 512));
  1231. if (size > 2880)
  1232. {
  1233. size = 0;
  1234. bufferPointer = bufferSpace[bufferSpaceIndex] + 512;
  1235. }
  1236. const int toSkip = (size + nextFrameOffset) - 2880;
  1237. if (toSkip > 0)
  1238. {
  1239. stream.skipNextBytes (toSkip);
  1240. nextFrameOffset -= toSkip;
  1241. }
  1242. stream.read (bufferPointer, nextFrameOffset);
  1243. lastFrameSize += nextFrameOffset;
  1244. }
  1245. frame.decodeHeader (stream.readIntBigEndian());
  1246. headerParsed = true;
  1247. frameSize = frame.frameSize;
  1248. isFreeFormat = (frameSize == 0);
  1249. sideInfoSize = frame.lsf != 0 ? ((frame.numChannels == 1) ? 9 : 17)
  1250. : ((frame.numChannels == 1) ? 17 : 32);
  1251. if (frame.crc16FollowsHeader)
  1252. sideInfoSize += 2;
  1253. bufferSpaceIndex = 1 - bufferSpaceIndex;
  1254. bufferPointer = bufferSpace[bufferSpaceIndex] + 512;
  1255. bitIndex = 0;
  1256. if (lastFrameSize == -1)
  1257. return 1;
  1258. }
  1259. if (! sideParsed)
  1260. {
  1261. if (frame.layer == 3)
  1262. {
  1263. stream.read (bufferPointer, sideInfoSize);
  1264. if (frame.crc16FollowsHeader)
  1265. getBits (16);
  1266. const int bits = jmax (0, decodeLayer3SideInfo());
  1267. dataSize = (bits + 7) / 8;
  1268. if (! isFreeFormat)
  1269. dataSize = jmin (dataSize, frame.frameSize - sideInfoSize);
  1270. }
  1271. else
  1272. {
  1273. dataSize = frame.frameSize;
  1274. sideInfoSize = 0;
  1275. }
  1276. sideParsed = true;
  1277. }
  1278. int result = 1;
  1279. if (! dataParsed)
  1280. {
  1281. stream.read (bufferPointer, dataSize);
  1282. if (out0 != nullptr)
  1283. {
  1284. if (frame.layer < 3 && frame.crc16FollowsHeader)
  1285. getBits (16);
  1286. switch (frame.layer)
  1287. {
  1288. case 1: decodeLayer1Frame (out0, out1, done); break;
  1289. case 2: decodeLayer2Frame (out0, out1, done); break;
  1290. case 3: decodeLayer3Frame (out0, out1, done); break;
  1291. default: break;
  1292. }
  1293. }
  1294. bufferPointer = bufferSpace[bufferSpaceIndex] + 512 + sideInfoSize + dataSize;
  1295. dataParsed = true;
  1296. result = 0;
  1297. }
  1298. if (isFreeFormat)
  1299. {
  1300. if (wasFreeFormat)
  1301. {
  1302. frameSize = lastFrameSizeNoPadding + frame.padding;
  1303. }
  1304. else
  1305. {
  1306. const int nextFrameOffset = scanForNextFrameHeader (true);
  1307. if (nextFrameOffset < 0)
  1308. return result;
  1309. frameSize = nextFrameOffset + sideInfoSize + dataSize;
  1310. lastFrameSizeNoPadding = frameSize - frame.padding;
  1311. }
  1312. }
  1313. if (result == 0)
  1314. return result;
  1315. int bytes = frameSize - (sideInfoSize + dataSize);
  1316. if (bytes > 0)
  1317. {
  1318. const int toSkip = bytes - 512;
  1319. if (toSkip > 0)
  1320. {
  1321. stream.skipNextBytes (toSkip);
  1322. bytes -= toSkip;
  1323. frameSize -= toSkip;
  1324. }
  1325. stream.read (bufferPointer, bytes);
  1326. bufferPointer += bytes;
  1327. }
  1328. lastFrameSize = frameSize;
  1329. wasFreeFormat = isFreeFormat;
  1330. frameSize = 0;
  1331. headerParsed = sideParsed = dataParsed = false;
  1332. return result;
  1333. }
  1334. bool seek (int frameIndex)
  1335. {
  1336. frameIndex = jmax (0, frameIndex);
  1337. while (frameIndex >= frameStreamPositions.size() * storedStartPosInterval)
  1338. {
  1339. int dummy = 0;
  1340. const int result = decodeNextBlock (nullptr, nullptr, dummy);
  1341. if (result < 0)
  1342. return false;
  1343. if (result > 0)
  1344. break;
  1345. }
  1346. frameIndex = jmin (frameIndex & ~(storedStartPosInterval - 1),
  1347. frameStreamPositions.size() * storedStartPosInterval - 1);
  1348. stream.setPosition (frameStreamPositions.getUnchecked (frameIndex / storedStartPosInterval));
  1349. currentFrameIndex = frameIndex;
  1350. reset();
  1351. return true;
  1352. }
  1353. MP3Frame frame;
  1354. VBRTagData vbrTagData;
  1355. BufferedInputStream stream;
  1356. int numFrames, currentFrameIndex;
  1357. bool vbrHeaderFound;
  1358. private:
  1359. bool headerParsed, sideParsed, dataParsed, needToSyncBitStream;
  1360. bool isFreeFormat, wasFreeFormat;
  1361. int sideInfoSize, dataSize;
  1362. int frameSize, lastFrameSize, lastFrameSizeNoPadding;
  1363. int bufferSpaceIndex;
  1364. Layer3SideInfo sideinfo;
  1365. uint8 bufferSpace[2][2880 + 1024];
  1366. uint8* bufferPointer;
  1367. int bitIndex, synthBo;
  1368. float hybridBlock[2][2][32 * 18];
  1369. int hybridBlockIndex[2];
  1370. float synthBuffers[2][2][0x110];
  1371. float hybridIn[2][32][18];
  1372. float hybridOut[2][18][32];
  1373. void reset() noexcept
  1374. {
  1375. headerParsed = sideParsed = dataParsed = isFreeFormat = wasFreeFormat = false;
  1376. lastFrameSize = -1;
  1377. needToSyncBitStream = true;
  1378. frameSize = sideInfoSize = dataSize = frameSize = bitIndex = 0;
  1379. lastFrameSizeNoPadding = bufferSpaceIndex = 0;
  1380. bufferPointer = bufferSpace[bufferSpaceIndex] + 512;
  1381. synthBo = 1;
  1382. zerostruct (sideinfo);
  1383. zeromem (bufferSpace, sizeof (bufferSpace));
  1384. zeromem (hybridBlock, sizeof (hybridBlock));
  1385. zeromem (hybridBlockIndex, sizeof (hybridBlockIndex));
  1386. zeromem (synthBuffers, sizeof (synthBuffers));
  1387. }
  1388. enum { storedStartPosInterval = 4 };
  1389. Array<int64> frameStreamPositions;
  1390. struct SideInfoLayer1
  1391. {
  1392. uint8 allocation[32][2];
  1393. uint8 scaleFactor[32][2];
  1394. };
  1395. struct SideInfoLayer2
  1396. {
  1397. uint8 allocation[32][2];
  1398. uint8 scaleFactor[32][2][3];
  1399. };
  1400. static bool isValidHeader (const uint32 header, const int oldLayer) noexcept
  1401. {
  1402. const int newLayer = 4 - ((header >> 17) & 3);
  1403. return (header & 0xffe00000) == 0xffe00000
  1404. && newLayer != 4
  1405. && (oldLayer <= 0 || newLayer == oldLayer)
  1406. && ((header >> 12) & 15) != 15
  1407. && ((header >> 10) & 3) != 3
  1408. && (header & 3) != 2;
  1409. }
  1410. bool rollBackBufferPointer (int backstep) noexcept
  1411. {
  1412. if (lastFrameSize < 0 && backstep > 0)
  1413. return false;
  1414. const uint8* oldBuffer = bufferSpace[1 - bufferSpaceIndex] + 512;
  1415. bufferPointer -= backstep;
  1416. if (backstep != 0)
  1417. memcpy (bufferPointer, oldBuffer + lastFrameSize - backstep, (size_t) backstep);
  1418. bitIndex = 0;
  1419. return true;
  1420. }
  1421. uint32 getBits (const int numBits) noexcept
  1422. {
  1423. if (numBits <= 0 || bufferPointer == nullptr)
  1424. return 0;
  1425. const uint32 result = ((((((bufferPointer[0] << 8) | bufferPointer[1]) << 8)
  1426. | bufferPointer[2]) << bitIndex) & 0xffffff) >> (24 - numBits);
  1427. bitIndex += numBits;
  1428. bufferPointer += (bitIndex >> 3);
  1429. bitIndex &= 7;
  1430. return result;
  1431. }
  1432. uint32 getOneBit() noexcept
  1433. {
  1434. const uint8 result = (uint8) (*bufferPointer << bitIndex);
  1435. ++bitIndex;
  1436. bufferPointer += (bitIndex >> 3);
  1437. bitIndex &= 7;
  1438. return result >> 7;
  1439. }
  1440. uint32 getBitsUnchecked (const int numBits) noexcept
  1441. {
  1442. const uint32 result = ((((bufferPointer[0] << 8) | bufferPointer[1]) << bitIndex) & 0xffff) >> (16 - numBits);
  1443. bitIndex += numBits;
  1444. bufferPointer += (bitIndex >> 3);
  1445. bitIndex &= 7;
  1446. return result;
  1447. }
  1448. inline uint8 getBitsUint8 (const int numBits) noexcept { return (uint8) getBitsUnchecked (numBits); }
  1449. inline uint16 getBitsUint16 (const int numBits) noexcept { return (uint16) getBitsUnchecked (numBits); }
  1450. int scanForNextFrameHeader (const bool checkTypeAgainstLastFrame) noexcept
  1451. {
  1452. const int64 oldPos = stream.getPosition();
  1453. int offset = -3;
  1454. uint32 header = 0;
  1455. for (;;)
  1456. {
  1457. if (stream.isExhausted() || stream.getPosition() > oldPos + 32768)
  1458. {
  1459. offset = -1;
  1460. break;
  1461. }
  1462. header = (header << 8) | (uint8) stream.readByte();
  1463. if (offset >= 0 && isValidHeader (header, frame.layer))
  1464. {
  1465. if (! checkTypeAgainstLastFrame)
  1466. break;
  1467. const bool mpeg25 = (header & (1 << 20)) == 0;
  1468. const int lsf = mpeg25 ? 1 : ((header & (1 << 19)) ? 0 : 1);
  1469. const int sampleRateIndex = mpeg25 ? (6 + ((header >> 10) & 3)) : (((header >> 10) & 3) + (lsf * 3));
  1470. const int mode = (header >> 6) & 3;
  1471. const int numChannels = (mode == 3) ? 1 : 2;
  1472. if (numChannels == frame.numChannels && lsf == frame.lsf
  1473. && mpeg25 == frame.mpeg25 && sampleRateIndex == frame.sampleRateIndex)
  1474. break;
  1475. }
  1476. ++offset;
  1477. }
  1478. if (offset >= 0)
  1479. {
  1480. if ((currentFrameIndex & (storedStartPosInterval - 1)) == 0)
  1481. frameStreamPositions.set (currentFrameIndex / storedStartPosInterval, oldPos + offset);
  1482. ++currentFrameIndex;
  1483. }
  1484. stream.setPosition (oldPos);
  1485. return offset;
  1486. }
  1487. void readVBRHeader()
  1488. {
  1489. int64 oldPos = stream.getPosition();
  1490. uint8 xing[194];
  1491. stream.read (xing, sizeof (xing));
  1492. vbrHeaderFound = vbrTagData.read (xing);
  1493. if (vbrHeaderFound)
  1494. {
  1495. numFrames = vbrTagData.frames;
  1496. oldPos += jmax (vbrTagData.headersize, 1);
  1497. }
  1498. stream.setPosition (oldPos);
  1499. }
  1500. void decodeLayer1Frame (float* const pcm0, float* const pcm1, int& samplesDone) noexcept
  1501. {
  1502. float fraction[2][32];
  1503. SideInfoLayer1 si;
  1504. layer1Step1 (si);
  1505. const int single = (frame.numChannels == 1 || frame.single == 3) ? 0 : frame.single;
  1506. if (single >= 0)
  1507. {
  1508. for (int i = 0; i < 12; ++i)
  1509. {
  1510. layer1Step2 (si, fraction);
  1511. synthesise (fraction[single], 0, pcm0, samplesDone);
  1512. }
  1513. }
  1514. else
  1515. {
  1516. for (int i = 0; i < 12; ++i)
  1517. {
  1518. layer1Step2 (si, fraction);
  1519. synthesiseStereo (fraction[0], fraction[1], pcm0, pcm1, samplesDone);
  1520. }
  1521. }
  1522. }
  1523. void decodeLayer2Frame (float* const pcm0, float* const pcm1, int& samplesDone)
  1524. {
  1525. float fraction[2][4][32];
  1526. frame.selectLayer2Table();
  1527. SideInfoLayer2 si;
  1528. layer2Step1 (si);
  1529. const int single = (frame.numChannels == 1 || frame.single == 3) ? 0 : frame.single;
  1530. if (single >= 0)
  1531. {
  1532. for (int i = 0; i < 12; ++i)
  1533. {
  1534. layer2Step2 (si, i >> 2, fraction);
  1535. for (int j = 0; j < 3; ++j)
  1536. synthesise (fraction[single][j], 0, pcm0, samplesDone);
  1537. }
  1538. }
  1539. else
  1540. {
  1541. for (int i = 0; i < 12; ++i)
  1542. {
  1543. layer2Step2 (si, i >> 2, fraction);
  1544. for (int j = 0; j < 3; ++j)
  1545. synthesiseStereo (fraction[0][j], fraction[1][j], pcm0, pcm1, samplesDone);
  1546. }
  1547. }
  1548. }
  1549. void decodeLayer3Frame (float* const pcm0, float* const pcm1, int& samplesDone) noexcept
  1550. {
  1551. if (! rollBackBufferPointer ((int) sideinfo.mainDataStart))
  1552. return;
  1553. const int single = frame.numChannels == 1 ? 0 : frame.single;
  1554. const int numChans = (frame.numChannels == 1 || single >= 0) ? 1 : 2;
  1555. const bool msStereo = (frame.mode == 1) && (frame.modeExt & 2) != 0;
  1556. const bool iStereo = (frame.mode == 1) && (frame.modeExt & 1) != 0;
  1557. const int granules = frame.lsf ? 1 : 2;
  1558. int scaleFactors[2][39];
  1559. for (int gr = 0; gr < granules; ++gr)
  1560. {
  1561. {
  1562. Layer3SideInfo::Info& granule = sideinfo.ch[0].gr[gr];
  1563. const int part2bits = frame.lsf ? getLayer3ScaleFactors2 (scaleFactors[0], granule, 0)
  1564. : getLayer3ScaleFactors1 (scaleFactors[0], granule);
  1565. if (layer3DequantizeSample (hybridIn[0], scaleFactors[0], granule, frame.sampleRateIndex, part2bits))
  1566. return;
  1567. }
  1568. if (frame.numChannels == 2)
  1569. {
  1570. Layer3SideInfo::Info& granule = sideinfo.ch[1].gr[gr];
  1571. const int part2bits = frame.lsf ? getLayer3ScaleFactors2 (scaleFactors[1], granule, iStereo)
  1572. : getLayer3ScaleFactors1 (scaleFactors[1], granule);
  1573. if (layer3DequantizeSample (hybridIn[1], scaleFactors[1], granule, frame.sampleRateIndex, part2bits))
  1574. return;
  1575. if (msStereo)
  1576. {
  1577. for (int i = 0; i < 32 * 18; ++i)
  1578. {
  1579. const float tmp0 = ((const float*) hybridIn[0]) [i];
  1580. const float tmp1 = ((const float*) hybridIn[1]) [i];
  1581. ((float*) hybridIn[1]) [i] = tmp0 - tmp1;
  1582. ((float*) hybridIn[0]) [i] = tmp0 + tmp1;
  1583. }
  1584. }
  1585. if (iStereo)
  1586. granule.doIStereo (hybridIn, scaleFactors[1], frame.sampleRateIndex, msStereo, frame.lsf);
  1587. if (msStereo || iStereo || single == 3)
  1588. {
  1589. if (granule.maxb > sideinfo.ch[0].gr[gr].maxb)
  1590. sideinfo.ch[0].gr[gr].maxb = granule.maxb;
  1591. else
  1592. granule.maxb = sideinfo.ch[0].gr[gr].maxb;
  1593. }
  1594. switch (single)
  1595. {
  1596. case 3:
  1597. {
  1598. float* in0 = (float*) hybridIn[0];
  1599. const float* in1 = (const float*) hybridIn[1];
  1600. for (int i = 0; i < (int) (18 * granule.maxb); ++i, ++in0)
  1601. *in0 = (*in0 + *in1++);
  1602. }
  1603. break;
  1604. case 1:
  1605. {
  1606. float* in0 = (float*) hybridIn[0];
  1607. const float* in1 = (const float*) hybridIn[1];
  1608. for (int i = 0; i < (int) (18 * granule.maxb); ++i)
  1609. *in0++ = *in1++;
  1610. }
  1611. break;
  1612. }
  1613. }
  1614. for (int ch = 0; ch < numChans; ++ch)
  1615. {
  1616. const Layer3SideInfo::Info& granule = sideinfo.ch[ch].gr[gr];
  1617. granule.doAntialias (hybridIn[ch]);
  1618. layer3Hybrid (hybridIn[ch], hybridOut[ch], ch, granule);
  1619. }
  1620. for (int ss = 0; ss < 18; ++ss)
  1621. {
  1622. if (single >= 0)
  1623. synthesise (hybridOut[0][ss], 0, pcm0, samplesDone);
  1624. else
  1625. synthesiseStereo (hybridOut[0][ss], hybridOut[1][ss], pcm0, pcm1, samplesDone);
  1626. }
  1627. }
  1628. }
  1629. int decodeLayer3SideInfo() noexcept
  1630. {
  1631. const int numChannels = frame.numChannels;
  1632. const int sampleRate = frame.sampleRateIndex;
  1633. const int single = (numChannels == 1) ? 0 : frame.single;
  1634. const bool msStereo = (frame.mode == 1) && (frame.modeExt & 2) != 0;
  1635. const int granules = frame.lsf ? 1 : 2;
  1636. if (frame.lsf == 0)
  1637. getLayer3SideInfo1 (numChannels, msStereo, sampleRate, single);
  1638. else
  1639. getLayer3SideInfo2 (numChannels, msStereo, sampleRate, single);
  1640. int databits = 0;
  1641. for (int gr = 0; gr < granules; ++gr)
  1642. for (int ch = 0; ch < numChannels; ++ch)
  1643. databits += sideinfo.ch[ch].gr[gr].part2_3Length;
  1644. return databits - 8 * sideinfo.mainDataStart;
  1645. }
  1646. void layer1Step1 (SideInfoLayer1& si) noexcept
  1647. {
  1648. zerostruct (si);
  1649. int i, jsbound = (frame.mode == 1) ? (frame.modeExt << 2) + 4 : 32;
  1650. if (frame.numChannels == 2)
  1651. {
  1652. for (i = 0; i < jsbound; ++i)
  1653. {
  1654. si.allocation[i][0] = getBitsUint8 (4);
  1655. si.allocation[i][1] = getBitsUint8 (4);
  1656. }
  1657. for (i = jsbound; i < 32; ++i)
  1658. si.allocation[i][0] = si.allocation[i][1] = getBitsUint8 (4);
  1659. for (i = 0; i < 32; ++i)
  1660. {
  1661. si.scaleFactor[i][0] = si.allocation[i][0] ? getBitsUint8 (6) : 0;
  1662. si.scaleFactor[i][1] = si.allocation[i][1] ? getBitsUint8 (6) : 0;
  1663. }
  1664. }
  1665. else
  1666. {
  1667. for (i = 0; i < 32; ++i)
  1668. si.allocation[i][0] = getBitsUint8 (4);
  1669. for (i = 0; i < 32; ++i)
  1670. si.scaleFactor[i][0] = si.allocation[i][0] ? getBitsUint8 (6) : 0;
  1671. }
  1672. }
  1673. void layer1Step2 (SideInfoLayer1& si, float fraction[2][32]) noexcept
  1674. {
  1675. if (frame.numChannels == 2)
  1676. {
  1677. int i, jsbound = (frame.mode == 1) ? (frame.modeExt << 2) + 4 : 32;
  1678. for (i = 0; i < jsbound; ++i)
  1679. {
  1680. const uint8 n0 = si.allocation[i][0];
  1681. const uint8 n1 = si.allocation[i][1];
  1682. fraction[0][i] = n0 > 0 ? (float) (((-1 << n0) + getBitsUint16 (n0 + 1) + 1) * constants.muls[n0 + 1][si.scaleFactor[i][0]]) : 0;
  1683. fraction[1][i] = n1 > 0 ? (float) (((-1 << n1) + getBitsUint16 (n1 + 1) + 1) * constants.muls[n1 + 1][si.scaleFactor[i][1]]) : 0;
  1684. }
  1685. for (i = jsbound; i < 32; ++i)
  1686. {
  1687. const uint8 n = si.allocation[i][0];
  1688. if (n > 0)
  1689. {
  1690. const uint32 w = ((-1 << n) + getBitsUint16 (n + 1) + 1);
  1691. fraction[0][i] = (float) (w * constants.muls[n + 1][si.scaleFactor[i][0]]);
  1692. fraction[1][i] = (float) (w * constants.muls[n + 1][si.scaleFactor[i][1]]);
  1693. }
  1694. else
  1695. fraction[0][i] = fraction[1][i] = 0;
  1696. }
  1697. }
  1698. else
  1699. {
  1700. for (int i = 0; i < 32; ++i)
  1701. {
  1702. const uint8 n = si.allocation[i][0];
  1703. const uint8 j = si.scaleFactor[i][0];
  1704. if (n > 0)
  1705. fraction[0][i] = (float) (((-1 << n) + getBitsUint16 (n + 1) + 1) * constants.muls[n + 1][j]);
  1706. else
  1707. fraction[0][i] = 0;
  1708. }
  1709. }
  1710. }
  1711. void layer2Step1 (SideInfoLayer2& si) noexcept
  1712. {
  1713. zerostruct (si);
  1714. const int sblimit = frame.layer2SubBandLimit;
  1715. const int jsbound = (frame.mode == 1) ? (frame.modeExt << 2) + 4 : frame.layer2SubBandLimit;
  1716. const AllocationTable* allocTable = frame.allocationTable;
  1717. uint8 scfsi[32][2];
  1718. if (frame.numChannels == 2)
  1719. {
  1720. for (int i = 0; i < jsbound; ++i)
  1721. {
  1722. const int16 step = allocTable->bits;
  1723. allocTable += (1 << step);
  1724. si.allocation[i][0] = getBitsUint8 (step);
  1725. si.allocation[i][1] = getBitsUint8 (step);
  1726. }
  1727. for (int i = jsbound; i < sblimit; ++i)
  1728. {
  1729. const int16 step = allocTable->bits;
  1730. const uint8 b0 = getBitsUint8 (step);
  1731. allocTable += (1 << step);
  1732. si.allocation[i][0] = b0;
  1733. si.allocation[i][1] = b0;
  1734. }
  1735. for (int i = 0; i < sblimit; ++i)
  1736. {
  1737. scfsi[i][0] = si.allocation[i][0] ? getBitsUint8 (2) : 0;
  1738. scfsi[i][1] = si.allocation[i][1] ? getBitsUint8 (2) : 0;
  1739. }
  1740. }
  1741. else
  1742. {
  1743. for (int i = 0; i < sblimit; ++i)
  1744. {
  1745. const int16 step = allocTable->bits;
  1746. allocTable += (1 << step);
  1747. si.allocation[i][0] = getBitsUint8 (step);
  1748. }
  1749. for (int i = 0; i < sblimit; ++i)
  1750. scfsi[i][0] = si.allocation[i][0] ? getBitsUint8 (2) : 0;
  1751. }
  1752. for (int i = 0; i < sblimit; ++i)
  1753. {
  1754. for (int ch = 0; ch < frame.numChannels; ++ch)
  1755. {
  1756. uint8 s0 = 0, s1 = 0, s2 = 0;
  1757. if (si.allocation[i][ch])
  1758. {
  1759. switch (scfsi[i][ch])
  1760. {
  1761. case 0:
  1762. s0 = getBitsUint8 (6);
  1763. s1 = getBitsUint8 (6);
  1764. s2 = getBitsUint8 (6);
  1765. break;
  1766. case 1:
  1767. s1 = s0 = getBitsUint8 (6);
  1768. s2 = getBitsUint8 (6);
  1769. break;
  1770. case 2:
  1771. s2 = s1 = s0 = getBitsUint8 (6);
  1772. break;
  1773. case 3:
  1774. s0 = getBitsUint8 (6);
  1775. s2 = s1 = getBitsUint8 (6);
  1776. break;
  1777. default:
  1778. break;
  1779. }
  1780. }
  1781. si.scaleFactor[i][ch][0] = s0;
  1782. si.scaleFactor[i][ch][1] = s1;
  1783. si.scaleFactor[i][ch][2] = s2;
  1784. }
  1785. }
  1786. }
  1787. void layer2Step2 (SideInfoLayer2& si, const int gr, float fraction[2][4][32]) noexcept
  1788. {
  1789. const AllocationTable* allocTable = frame.allocationTable;
  1790. const int jsbound = (frame.mode == 1) ? (frame.modeExt << 2) + 4 : frame.layer2SubBandLimit;
  1791. for (int i = 0; i < jsbound; ++i)
  1792. {
  1793. const int16 step = allocTable->bits;
  1794. for (int ch = 0; ch < frame.numChannels; ++ch)
  1795. {
  1796. const uint8 ba = si.allocation[i][ch];
  1797. if (ba != 0)
  1798. {
  1799. const uint8 x1 = jmin ((uint8) 63, si.scaleFactor[i][ch][gr]);
  1800. const AllocationTable* const alloc2 = allocTable + ba;
  1801. const int16 k = jmin ((int16) 16, alloc2->bits);
  1802. const int16 d1 = alloc2->d;
  1803. if (d1 < 0)
  1804. {
  1805. const double cm = constants.muls[k][x1];
  1806. fraction[ch][0][i] = (float) ((getBits (k) + d1) * cm);
  1807. fraction[ch][1][i] = (float) ((getBits (k) + d1) * cm);
  1808. fraction[ch][2][i] = (float) ((getBits (k) + d1) * cm);
  1809. }
  1810. else
  1811. {
  1812. const uint8* const tab = constants.getGroupTable (d1, getBits (k));
  1813. fraction[ch][0][i] = (float) constants.muls[tab[0]][x1];
  1814. fraction[ch][1][i] = (float) constants.muls[tab[1]][x1];
  1815. fraction[ch][2][i] = (float) constants.muls[tab[2]][x1];
  1816. }
  1817. }
  1818. else
  1819. {
  1820. fraction[ch][0][i] = fraction[ch][1][i] = fraction[ch][2][i] = 0;
  1821. }
  1822. }
  1823. allocTable += (1 << step);
  1824. }
  1825. for (int i = jsbound; i < frame.layer2SubBandLimit; ++i)
  1826. {
  1827. const int16 step = allocTable->bits;
  1828. const uint8 ba = si.allocation[i][0];
  1829. if (ba != 0)
  1830. {
  1831. const AllocationTable* const alloc2 = allocTable + ba;
  1832. int16 k = alloc2->bits;
  1833. int16 d1 = alloc2->d;
  1834. k = (k <= 16) ? k : 16;
  1835. if (d1 < 0)
  1836. {
  1837. const int v0 = getBits (k);
  1838. const int v1 = getBits (k);
  1839. const int v2 = getBits (k);
  1840. for (int ch = 0; ch < frame.numChannels; ++ch)
  1841. {
  1842. const uint8 x1 = jmin ((uint8) 63, si.scaleFactor[i][ch][gr]);
  1843. const double cm = constants.muls[k][x1];
  1844. fraction[ch][0][i] = (float) ((v0 + d1) * cm);
  1845. fraction[ch][1][i] = (float) ((v1 + d1) * cm);
  1846. fraction[ch][2][i] = (float) ((v2 + d1) * cm);
  1847. }
  1848. }
  1849. else
  1850. {
  1851. const uint8* const tab = constants.getGroupTable (d1, getBits (k));
  1852. const uint8 k0 = tab[0];
  1853. const uint8 k1 = tab[1];
  1854. const uint8 k2 = tab[2];
  1855. for (int ch = 0; ch < frame.numChannels; ++ch)
  1856. {
  1857. const uint8 x1 = jmin ((uint8) 63, si.scaleFactor[i][ch][gr]);
  1858. fraction[ch][0][i] = (float) constants.muls[k0][x1];
  1859. fraction[ch][1][i] = (float) constants.muls[k1][x1];
  1860. fraction[ch][2][i] = (float) constants.muls[k2][x1];
  1861. }
  1862. }
  1863. }
  1864. else
  1865. {
  1866. fraction[0][0][i] = fraction[0][1][i] = fraction[0][2][i] = 0;
  1867. fraction[1][0][i] = fraction[1][1][i] = fraction[1][2][i] = 0;
  1868. }
  1869. allocTable += (1 << step);
  1870. }
  1871. for (int ch = 0; ch < frame.numChannels; ++ch)
  1872. for (int i = frame.layer2SubBandLimit; i < 32; ++i)
  1873. fraction[ch][0][i] = fraction[ch][1][i] = fraction[ch][2][i] = 0;
  1874. }
  1875. void getLayer3SideInfo1 (const int stereo, const bool msStereo, const int sampleRate, const int single) noexcept
  1876. {
  1877. const int powdiff = (single == 3) ? 4 : 0;
  1878. sideinfo.mainDataStart = getBits (9);
  1879. sideinfo.privateBits = getBitsUnchecked (stereo == 1 ? 5 : 3);
  1880. for (int ch = 0; ch < stereo; ++ch)
  1881. {
  1882. sideinfo.ch[ch].gr[0].scfsi = -1;
  1883. sideinfo.ch[ch].gr[1].scfsi = getBitsUnchecked (4);
  1884. }
  1885. for (int gr = 0; gr < 2; ++gr)
  1886. {
  1887. for (int ch = 0; ch < stereo; ++ch)
  1888. {
  1889. Layer3SideInfo::Info& granule = sideinfo.ch[ch].gr[gr];
  1890. granule.part2_3Length = getBits (12);
  1891. granule.bigValues = jmin (288, (int) getBitsUnchecked (9));
  1892. const int qss = getBitsUnchecked (8);
  1893. granule.pow2gain = constants.powToGains + 256 - qss + powdiff;
  1894. if (msStereo)
  1895. granule.pow2gain += 2;
  1896. granule.scaleFactorCompression = getBitsUnchecked (4);
  1897. if (getOneBit())
  1898. {
  1899. granule.blockType = getBitsUnchecked (2);
  1900. granule.mixedBlockFlag = getOneBit();
  1901. granule.tableSelect[0] = getBitsUnchecked (5);
  1902. granule.tableSelect[1] = getBitsUnchecked (5);
  1903. granule.tableSelect[2] = 0;
  1904. for (int i = 0; i < 3; ++i)
  1905. {
  1906. const int sbg = (getBitsUnchecked (3) << 3);
  1907. granule.fullGain[i] = granule.pow2gain + sbg;
  1908. }
  1909. granule.region1Start = 36 >> 1;
  1910. granule.region2Start = 576 >> 1;
  1911. }
  1912. else
  1913. {
  1914. for (int i = 0; i < 3; ++i)
  1915. granule.tableSelect[i] = getBitsUnchecked (5);
  1916. const int r0c = getBitsUnchecked (4);
  1917. const int r1c = getBitsUnchecked (3);
  1918. const int region0index = jmin (22, r0c + 1);
  1919. const int region1index = jmin (22, r0c + 1 + r1c + 1);
  1920. granule.region1Start = bandInfo[sampleRate].longIndex[region0index] >> 1;
  1921. granule.region2Start = bandInfo[sampleRate].longIndex[region1index] >> 1;
  1922. granule.blockType = 0;
  1923. granule.mixedBlockFlag = 0;
  1924. }
  1925. granule.preflag = getOneBit();
  1926. granule.scaleFactorScale = getOneBit();
  1927. granule.count1TableSelect = getOneBit();
  1928. }
  1929. }
  1930. }
  1931. void getLayer3SideInfo2 (const int stereo, const bool msStereo, const int sampleRate, const int single) noexcept
  1932. {
  1933. const int powdiff = (single == 3) ? 4 : 0;
  1934. sideinfo.mainDataStart = getBits (8);
  1935. sideinfo.privateBits = stereo == 1 ? getOneBit() : getBitsUnchecked (2);
  1936. for (int ch = 0; ch < stereo; ++ch)
  1937. {
  1938. Layer3SideInfo::Info& granule = sideinfo.ch[ch].gr[0];
  1939. granule.part2_3Length = getBits (12);
  1940. granule.bigValues = jmin (288, (int) getBitsUnchecked (9));
  1941. const uint32 qss = getBitsUnchecked (8);
  1942. granule.pow2gain = constants.powToGains + 256 - qss + powdiff;
  1943. if (msStereo)
  1944. granule.pow2gain += 2;
  1945. granule.scaleFactorCompression = getBits (9);
  1946. if (getOneBit())
  1947. {
  1948. granule.blockType = getBitsUnchecked (2);
  1949. granule.mixedBlockFlag = getOneBit();
  1950. granule.tableSelect[0] = getBitsUnchecked (5);
  1951. granule.tableSelect[1] = getBitsUnchecked (5);
  1952. granule.tableSelect[2] = 0;
  1953. for (int i = 0; i < 3; ++i)
  1954. {
  1955. const uint32 sbg = (getBitsUnchecked (3) << 3);
  1956. granule.fullGain[i] = granule.pow2gain + sbg;
  1957. }
  1958. if (granule.blockType == 0)
  1959. {}
  1960. if (granule.blockType == 2)
  1961. granule.region1Start = sampleRate == 8 ? 36 : (36 >> 1);
  1962. else
  1963. granule.region1Start = sampleRate == 8 ? (108 >> 1) : (54 >> 1);
  1964. granule.region2Start = 576 >> 1;
  1965. }
  1966. else
  1967. {
  1968. for (int i = 0; i < 3; ++i)
  1969. granule.tableSelect[i] = getBitsUnchecked (5);
  1970. const int r0c = getBitsUnchecked (4);
  1971. const int r1c = getBitsUnchecked (3);
  1972. const int region0index = jmin (22, r0c + 1);
  1973. const int region1index = jmin (22, r0c + 1 + r1c + 1);
  1974. granule.region1Start = bandInfo[sampleRate].longIndex[region0index] >> 1;
  1975. granule.region2Start = bandInfo[sampleRate].longIndex[region1index] >> 1;
  1976. granule.blockType = 0;
  1977. granule.mixedBlockFlag = 0;
  1978. }
  1979. granule.scaleFactorScale = getOneBit();
  1980. granule.count1TableSelect = getOneBit();
  1981. }
  1982. }
  1983. int getLayer3ScaleFactors1 (int* scf, const Layer3SideInfo::Info& granule) noexcept
  1984. {
  1985. static const uint8 lengths[2][16] =
  1986. {
  1987. { 0, 0, 0, 0, 3, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4 },
  1988. { 0, 1, 2, 3, 0, 1, 2, 3, 1, 2, 3, 1, 2, 3, 2, 3 }
  1989. };
  1990. int numBits;
  1991. const int num0 = lengths[0][granule.scaleFactorCompression];
  1992. const int num1 = lengths[1][granule.scaleFactorCompression];
  1993. if (granule.blockType == 2)
  1994. {
  1995. int i = 18;
  1996. numBits = (num0 + num1) * 18;
  1997. if (granule.mixedBlockFlag)
  1998. {
  1999. for (int j = 8; --j >= 0;) *scf++ = getBitsUnchecked (num0);
  2000. numBits -= num0;
  2001. i = 9;
  2002. }
  2003. for (; --i >= 0;) *scf++ = getBitsUnchecked (num0);
  2004. for (i = 18; --i >= 0;) *scf++ = getBitsUnchecked (num1);
  2005. *scf++ = 0;
  2006. *scf++ = 0;
  2007. *scf++ = 0;
  2008. }
  2009. else
  2010. {
  2011. const int scfsi = granule.scfsi;
  2012. if (scfsi < 0)
  2013. {
  2014. for (int i = 11; --i >= 0;) *scf++ = getBitsUnchecked (num0);
  2015. for (int j = 10; --j >= 0;) *scf++ = getBitsUnchecked (num1);
  2016. numBits = (num0 + num1) * 10 + num0;
  2017. }
  2018. else
  2019. {
  2020. numBits = 0;
  2021. if ((scfsi & 8) == 0)
  2022. {
  2023. for (int i = 6; --i >= 0;) *scf++ = getBitsUnchecked (num0);
  2024. numBits += num0 * 6;
  2025. }
  2026. else
  2027. scf += 6;
  2028. if ((scfsi & 4) == 0)
  2029. {
  2030. for (int i = 5; --i >= 0;) *scf++ = getBitsUnchecked (num0);
  2031. numBits += num0 * 5;
  2032. }
  2033. else
  2034. scf += 5;
  2035. if ((scfsi & 2) == 0)
  2036. {
  2037. for (int i = 5; --i >= 0;) *scf++ = getBitsUnchecked (num1);
  2038. numBits += num1 * 5;
  2039. }
  2040. else
  2041. scf += 5;
  2042. if ((scfsi & 1) == 0)
  2043. {
  2044. for (int i = 5; --i >= 0;) *scf++ = getBitsUnchecked (num1);
  2045. numBits += num1 * 5;
  2046. }
  2047. else
  2048. scf += 5;
  2049. }
  2050. *scf = 0;
  2051. }
  2052. return numBits;
  2053. }
  2054. int getLayer3ScaleFactors2 (int* scf, Layer3SideInfo::Info& granule, const bool iStereo) noexcept
  2055. {
  2056. static const uint8 scaleTable[3][6][4] =
  2057. {
  2058. { { 6, 5, 5, 5 }, { 6, 5, 7, 3 }, { 11, 10, 0, 0 }, { 7, 7, 7, 0 }, { 6, 6, 6, 3 }, { 8, 8, 5, 0 } },
  2059. { { 9, 9, 9, 9 }, { 9, 9, 12, 6 }, { 18, 18, 0, 0 }, { 12, 12, 12, 0 }, { 12, 9, 9, 6 }, { 15, 12, 9, 0 } },
  2060. { { 6, 9, 9, 9 }, { 6, 9, 12, 6 }, { 15, 18, 0, 0 }, { 6, 15, 12, 0 }, { 6, 12, 9, 6 }, { 6, 18, 9, 0 } }
  2061. };
  2062. uint32 len = iStereo ? constants.iLength2 [granule.scaleFactorCompression >> 1]
  2063. : constants.nLength2 [granule.scaleFactorCompression];
  2064. granule.preflag = (len >> 15) & 1;
  2065. int n = 0;
  2066. if (granule.blockType == 2)
  2067. {
  2068. ++n;
  2069. if (granule.mixedBlockFlag)
  2070. ++n;
  2071. }
  2072. const uint8* const data = scaleTable[n][(len >> 12) & 7];
  2073. int i, numBits = 0;
  2074. for (i = 0; i < 4; ++i)
  2075. {
  2076. int num = len & 7;
  2077. len >>= 3;
  2078. if (num)
  2079. {
  2080. for (int j = 0; j < (int) (data[i]); ++j)
  2081. *scf++ = getBitsUnchecked (num);
  2082. numBits += data[i] * num;
  2083. }
  2084. else
  2085. {
  2086. for (int j = 0; j < (int) (data[i]); ++j)
  2087. *scf++ = 0;
  2088. }
  2089. }
  2090. n = (n << 1) + 1;
  2091. for (i = 0; i < n; ++i)
  2092. *scf++ = 0;
  2093. return numBits;
  2094. }
  2095. bool layer3DequantizeSample (float xr[32][18], int* scf, Layer3SideInfo::Info& granule, int sampleRate, int part2bits) noexcept
  2096. {
  2097. const int shift = 1 + granule.scaleFactorScale;
  2098. float* xrpnt = (float*) xr;
  2099. int part2remain = granule.part2_3Length - part2bits;
  2100. zeromem (xrpnt, sizeof (float) * (&xr[32][0] - xrpnt));
  2101. const int bv = granule.bigValues;
  2102. const int region1 = granule.region1Start;
  2103. const int region2 = granule.region2Start;
  2104. int l3 = ((576 >> 1) - bv) >> 1;
  2105. int l[3];
  2106. if (bv <= region1)
  2107. {
  2108. l[0] = bv;
  2109. l[1] = 0;
  2110. l[2] = 0;
  2111. }
  2112. else
  2113. {
  2114. l[0] = region1;
  2115. if (bv <= region2)
  2116. {
  2117. l[1] = bv - l[0];
  2118. l[2] = 0;
  2119. }
  2120. else
  2121. {
  2122. l[1] = region2 - l[0];
  2123. l[2] = bv - region2;
  2124. }
  2125. }
  2126. for (int i = 0; i < 3; ++i)
  2127. if (l[i] < 0)
  2128. l[i] = 0;
  2129. if (granule.blockType == 2)
  2130. {
  2131. int max[4];
  2132. int step = 0, lwin = 0, cb = 0, mc = 0;
  2133. float v = 0;
  2134. int* map;
  2135. int* mapEnd;
  2136. if (granule.mixedBlockFlag)
  2137. {
  2138. max[3] = -1;
  2139. max[0] = max[1] = max[2] = 2;
  2140. map = constants.map [sampleRate][0];
  2141. mapEnd = constants.mapEnd [sampleRate][0];
  2142. }
  2143. else
  2144. {
  2145. max[0] = max[1] = max[2] = max[3] = -1;
  2146. map = constants.map [sampleRate][1];
  2147. mapEnd = constants.mapEnd [sampleRate][1];
  2148. }
  2149. for (int i = 0; i < 2; ++i)
  2150. {
  2151. const BitsToTableMap* h = huffmanTables1 + granule.tableSelect[i];
  2152. for (int lp = l[i]; lp != 0; --lp, --mc)
  2153. {
  2154. int x, y;
  2155. if (mc == 0)
  2156. {
  2157. mc = *map++;
  2158. xrpnt = ((float*) xr) + (*map++);
  2159. lwin = *map++;
  2160. cb = *map++;
  2161. if (lwin == 3)
  2162. {
  2163. v = granule.pow2gain[ (*scf++) << shift];
  2164. step = 1;
  2165. }
  2166. else
  2167. {
  2168. v = granule.fullGain[lwin][ (*scf++) << shift];
  2169. step = 3;
  2170. }
  2171. }
  2172. const int16* val = h->table;
  2173. while ((y = *val++) < 0)
  2174. {
  2175. if (getOneBit())
  2176. val -= y;
  2177. --part2remain;
  2178. }
  2179. x = y >> 4;
  2180. y &= 15;
  2181. if (x == 15)
  2182. {
  2183. max[lwin] = cb;
  2184. part2remain -= h->bits + 1;
  2185. x += getBits ((int) h->bits);
  2186. *xrpnt = constants.nToThe4Over3[x] * (getOneBit() ? -v : v);
  2187. }
  2188. else if (x)
  2189. {
  2190. max[lwin] = cb;
  2191. *xrpnt = constants.nToThe4Over3[x] * (getOneBit() ? -v : v);
  2192. --part2remain;
  2193. }
  2194. else
  2195. *xrpnt = 0;
  2196. xrpnt += step;
  2197. if (y == 15)
  2198. {
  2199. max[lwin] = cb;
  2200. part2remain -= h->bits + 1;
  2201. y += getBits ((int) h->bits);
  2202. *xrpnt = constants.nToThe4Over3[y] * (getOneBit() ? -v : v);
  2203. }
  2204. else if (y)
  2205. {
  2206. max[lwin] = cb;
  2207. *xrpnt = constants.nToThe4Over3[y] * (getOneBit() ? -v : v);
  2208. --part2remain;
  2209. }
  2210. else
  2211. *xrpnt = 0;
  2212. xrpnt += step;
  2213. }
  2214. }
  2215. for (; l3 && (part2remain > 0); --l3)
  2216. {
  2217. const BitsToTableMap* h = huffmanTables2 + granule.count1TableSelect;
  2218. const int16* val = h->table;
  2219. int16 a;
  2220. while ((a = *val++) < 0)
  2221. {
  2222. if (part2remain <= 0)
  2223. {
  2224. a = 0;
  2225. break;
  2226. }
  2227. --part2remain;
  2228. if (getOneBit())
  2229. val -= a;
  2230. }
  2231. for (int i = 0; i < 4; ++i)
  2232. {
  2233. if ((i & 1) == 0)
  2234. {
  2235. if (mc == 0)
  2236. {
  2237. mc = *map++;
  2238. xrpnt = ((float*) xr) + (*map++);
  2239. lwin = *map++;
  2240. cb = *map++;
  2241. if (lwin == 3)
  2242. {
  2243. v = granule.pow2gain[ (*scf++) << shift];
  2244. step = 1;
  2245. }
  2246. else
  2247. {
  2248. v = granule.fullGain[lwin][ (*scf++) << shift];
  2249. step = 3;
  2250. }
  2251. }
  2252. --mc;
  2253. }
  2254. if ((a & (8 >> i)))
  2255. {
  2256. max[lwin] = cb;
  2257. if (part2remain == 0)
  2258. break;
  2259. --part2remain;
  2260. *xrpnt = getOneBit() ? -v : v;
  2261. }
  2262. else
  2263. *xrpnt = 0;
  2264. xrpnt += step;
  2265. }
  2266. }
  2267. while (map < mapEnd)
  2268. {
  2269. if (mc == 0)
  2270. {
  2271. mc = *map++;
  2272. xrpnt = ((float*) xr) + *map++;
  2273. step = (*map++ == 3) ? 1 : 3;
  2274. ++map;
  2275. }
  2276. --mc;
  2277. *xrpnt = 0; xrpnt += step;
  2278. *xrpnt = 0; xrpnt += step;
  2279. }
  2280. granule.maxBand[0] = max[0] + 1;
  2281. granule.maxBand[1] = max[1] + 1;
  2282. granule.maxBand[2] = max[2] + 1;
  2283. granule.maxBandl = max[3] + 1;
  2284. const int rmax = jmax (max[0], max[1], max[3]) + 1;
  2285. granule.maxb = rmax ? constants.shortLimit[sampleRate][rmax]
  2286. : constants.longLimit[sampleRate][max[3] + 1];
  2287. }
  2288. else
  2289. {
  2290. static const int pretab1[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 2, 0 };
  2291. static const int pretab2[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
  2292. const int* pretab = (const int*) (granule.preflag ? pretab1 : pretab2);
  2293. int max = -1, cb = 0, mc = 0;
  2294. int* map = constants.map [sampleRate][2];
  2295. float v = 0;
  2296. for (int i = 0; i < 3; ++i)
  2297. {
  2298. const BitsToTableMap* h = huffmanTables1 + granule.tableSelect[i];
  2299. for (int lp = l[i]; lp != 0; --lp, --mc)
  2300. {
  2301. if (mc == 0)
  2302. {
  2303. mc = *map++;
  2304. v = granule.pow2gain [((*scf++) + (*pretab++)) << shift];
  2305. cb = *map++;
  2306. }
  2307. const int16* val = h->table;
  2308. int y;
  2309. while ((y = *val++) < 0)
  2310. {
  2311. if (getOneBit()) val -= y;
  2312. --part2remain;
  2313. }
  2314. int x = y >> 4;
  2315. y &= 15;
  2316. if (x == 15)
  2317. {
  2318. max = cb;
  2319. part2remain -= h->bits + 1;
  2320. x += getBits ((int) h->bits);
  2321. *xrpnt++ = constants.nToThe4Over3[x] * (getOneBit() ? -v : v);
  2322. }
  2323. else if (x)
  2324. {
  2325. max = cb;
  2326. *xrpnt++ = constants.nToThe4Over3[x] * (getOneBit() ? -v : v);
  2327. --part2remain;
  2328. }
  2329. else
  2330. *xrpnt++ = 0;
  2331. if (y == 15)
  2332. {
  2333. max = cb;
  2334. part2remain -= h->bits + 1;
  2335. y += getBits ((int) h->bits);
  2336. *xrpnt++ = constants.nToThe4Over3[y] * (getOneBit() ? -v : v);
  2337. }
  2338. else if (y)
  2339. {
  2340. max = cb;
  2341. *xrpnt++ = constants.nToThe4Over3[y] * (getOneBit() ? -v : v);
  2342. --part2remain;
  2343. }
  2344. else
  2345. *xrpnt++ = 0;
  2346. }
  2347. }
  2348. for (; l3 && part2remain > 0; --l3)
  2349. {
  2350. const BitsToTableMap* h = huffmanTables2 + granule.count1TableSelect;
  2351. const int16* values = h->table;
  2352. int16 a;
  2353. while ((a = *values++) < 0)
  2354. {
  2355. if (part2remain <= 0)
  2356. {
  2357. a = 0;
  2358. break;
  2359. }
  2360. --part2remain;
  2361. if (getOneBit())
  2362. values -= a;
  2363. }
  2364. for (int i = 0; i < 4; ++i)
  2365. {
  2366. if ((i & 1) == 0)
  2367. {
  2368. if (mc == 0)
  2369. {
  2370. mc = *map++;
  2371. cb = *map++;
  2372. v = granule.pow2gain [((*scf++) + (*pretab++)) << shift];
  2373. }
  2374. --mc;
  2375. }
  2376. if ((a & (0x8 >> i)))
  2377. {
  2378. max = cb;
  2379. if (part2remain <= 0)
  2380. break;
  2381. --part2remain;
  2382. *xrpnt++ = getOneBit() ? -v : v;
  2383. }
  2384. else
  2385. *xrpnt++ = 0;
  2386. }
  2387. }
  2388. zeromem (xrpnt, sizeof (float) * (&xr[32][0] - xrpnt));
  2389. granule.maxBandl = max + 1;
  2390. granule.maxb = constants.longLimit[sampleRate][granule.maxBandl];
  2391. }
  2392. while (part2remain > 16)
  2393. {
  2394. getBits (16);
  2395. part2remain -= 16;
  2396. }
  2397. if (part2remain > 0)
  2398. getBits (part2remain);
  2399. else if (part2remain < 0)
  2400. return true;
  2401. return false;
  2402. }
  2403. void layer3Hybrid (float fsIn[32][18], float tsOut[18][32], int ch, const Layer3SideInfo::Info& granule) noexcept
  2404. {
  2405. float* ts = (float*) tsOut;
  2406. float* rawout1, *rawout2;
  2407. int sb = 0;
  2408. {
  2409. int b = hybridBlockIndex[ch];
  2410. rawout1 = hybridBlock[b][ch];
  2411. b = 1 - b;
  2412. rawout2 = hybridBlock[b][ch];
  2413. hybridBlockIndex[ch] = b;
  2414. }
  2415. if (granule.mixedBlockFlag)
  2416. {
  2417. sb = 2;
  2418. DCT::dct36 (fsIn[0], rawout1, rawout2, constants.win[0], ts);
  2419. DCT::dct36 (fsIn[1], rawout1 + 18, rawout2 + 18, constants.win1[0], ts + 1);
  2420. rawout1 += 36;
  2421. rawout2 += 36;
  2422. ts += 2;
  2423. }
  2424. const int bt = granule.blockType;
  2425. if (bt == 2)
  2426. {
  2427. for (; sb < (int) granule.maxb; sb += 2, ts += 2, rawout1 += 36, rawout2 += 36)
  2428. {
  2429. DCT::dct12 (fsIn[sb], rawout1, rawout2, constants.win[2], ts);
  2430. DCT::dct12 (fsIn[sb + 1], rawout1 + 18, rawout2 + 18, constants.win1[2], ts + 1);
  2431. }
  2432. }
  2433. else
  2434. {
  2435. for (; sb < (int) granule.maxb; sb += 2, ts += 2, rawout1 += 36, rawout2 += 36)
  2436. {
  2437. DCT::dct36 (fsIn[sb], rawout1, rawout2, constants.win[bt], ts);
  2438. DCT::dct36 (fsIn[sb + 1], rawout1 + 18, rawout2 + 18, constants.win1[bt], ts + 1);
  2439. }
  2440. }
  2441. for (; sb < 32; ++sb, ++ts)
  2442. {
  2443. for (int i = 0; i < 18; ++i)
  2444. {
  2445. ts[i * 32] = *rawout1++;
  2446. *rawout2++ = 0;
  2447. }
  2448. }
  2449. }
  2450. void synthesiseStereo (const float* bandPtr0, const float* bandPtr1, float* out0, float* out1, int& samplesDone) noexcept
  2451. {
  2452. int dummy = samplesDone;
  2453. synthesise (bandPtr0, 0, out0, dummy);
  2454. synthesise (bandPtr1, 1, out1, samplesDone);
  2455. }
  2456. void synthesise (const float* bandPtr, const int channel, float* out, int& samplesDone)
  2457. {
  2458. out += samplesDone;
  2459. const int bo = channel == 0 ? ((synthBo - 1) & 15) : synthBo;
  2460. float (*buf)[0x110] = synthBuffers[channel];
  2461. float* b0;
  2462. int j, bo1 = bo;
  2463. if (bo & 1)
  2464. {
  2465. b0 = buf[0];
  2466. DCT::dct64 (buf[1] + ((bo + 1) & 15), buf[0] + bo, bandPtr);
  2467. }
  2468. else
  2469. {
  2470. ++bo1;
  2471. b0 = buf[1];
  2472. DCT::dct64 (buf[0] + bo, buf[1] + bo1, bandPtr);
  2473. }
  2474. synthBo = bo;
  2475. const float* window = constants.decodeWin + 16 - bo1;
  2476. for (j = 16; j != 0; --j, b0 += 16, window += 32)
  2477. {
  2478. float sum = window[0] * b0[0]; sum -= window[1] * b0[1];
  2479. sum += window[2] * b0[2]; sum -= window[3] * b0[3];
  2480. sum += window[4] * b0[4]; sum -= window[5] * b0[5];
  2481. sum += window[6] * b0[6]; sum -= window[7] * b0[7];
  2482. sum += window[8] * b0[8]; sum -= window[9] * b0[9];
  2483. sum += window[10] * b0[10]; sum -= window[11] * b0[11];
  2484. sum += window[12] * b0[12]; sum -= window[13] * b0[13];
  2485. sum += window[14] * b0[14]; sum -= window[15] * b0[15];
  2486. *out++ = sum;
  2487. }
  2488. {
  2489. float sum = window[0] * b0[0]; sum += window[2] * b0[2];
  2490. sum += window[4] * b0[4]; sum += window[6] * b0[6];
  2491. sum += window[8] * b0[8]; sum += window[10] * b0[10];
  2492. sum += window[12] * b0[12]; sum += window[14] * b0[14];
  2493. *out++ = sum;
  2494. b0 -= 16; window -= 32;
  2495. window += bo1 << 1;
  2496. }
  2497. for (j = 15; j != 0; --j, b0 -= 16, window -= 32)
  2498. {
  2499. float sum = -window[-1] * b0[0]; sum -= window[-2] * b0[1];
  2500. sum -= window[-3] * b0[2]; sum -= window[-4] * b0[3];
  2501. sum -= window[-5] * b0[4]; sum -= window[-6] * b0[5];
  2502. sum -= window[-7] * b0[6]; sum -= window[-8] * b0[7];
  2503. sum -= window[-9] * b0[8]; sum -= window[-10] * b0[9];
  2504. sum -= window[-11] * b0[10]; sum -= window[-12] * b0[11];
  2505. sum -= window[-13] * b0[12]; sum -= window[-14] * b0[13];
  2506. sum -= window[-15] * b0[14]; sum -= window[0] * b0[15];
  2507. *out++ = sum;
  2508. }
  2509. samplesDone += 32;
  2510. }
  2511. JUCE_DECLARE_NON_COPYABLE_WITH_LEAK_DETECTOR (MP3Stream)
  2512. };
  2513. //==============================================================================
  2514. static const char* const mp3FormatName = "MP3 file";
  2515. static const char* const mp3Extensions[] = { ".mp3", nullptr };
  2516. //==============================================================================
  2517. class MP3Reader : public AudioFormatReader
  2518. {
  2519. public:
  2520. MP3Reader (InputStream* const in)
  2521. : AudioFormatReader (in, TRANS (mp3FormatName)),
  2522. stream (*in), currentPosition (0),
  2523. decodedStart (0), decodedEnd (0)
  2524. {
  2525. skipID3();
  2526. const int64 streamPos = stream.stream.getPosition();
  2527. if (readNextBlock())
  2528. {
  2529. bitsPerSample = 32;
  2530. usesFloatingPointData = true;
  2531. sampleRate = stream.frame.getFrequency();
  2532. numChannels = stream.frame.numChannels;
  2533. lengthInSamples = findLength (streamPos);
  2534. }
  2535. }
  2536. //==============================================================================
  2537. bool readSamples (int** destSamples, int numDestChannels, int startOffsetInDestBuffer,
  2538. int64 startSampleInFile, int numSamples) override
  2539. {
  2540. jassert (destSamples != nullptr);
  2541. if (currentPosition != startSampleInFile)
  2542. {
  2543. if (! stream.seek ((int) (startSampleInFile / 1152 - 1)))
  2544. {
  2545. currentPosition = -1;
  2546. createEmptyDecodedData();
  2547. }
  2548. else
  2549. {
  2550. decodedStart = decodedEnd = 0;
  2551. const int64 streamPos = stream.currentFrameIndex * 1152;
  2552. int toSkip = (int) (startSampleInFile - streamPos);
  2553. jassert (toSkip >= 0);
  2554. while (toSkip > 0)
  2555. {
  2556. if (! readNextBlock())
  2557. {
  2558. createEmptyDecodedData();
  2559. break;
  2560. }
  2561. const int numReady = decodedEnd - decodedStart;
  2562. if (numReady > toSkip)
  2563. {
  2564. decodedStart += toSkip;
  2565. break;
  2566. }
  2567. toSkip -= numReady;
  2568. }
  2569. currentPosition = startSampleInFile;
  2570. }
  2571. }
  2572. while (numSamples > 0)
  2573. {
  2574. if (decodedEnd <= decodedStart && ! readNextBlock())
  2575. {
  2576. for (int i = numDestChannels; --i >= 0;)
  2577. if (destSamples[i] != nullptr)
  2578. zeromem (destSamples[i] + startOffsetInDestBuffer, sizeof (float) * numSamples);
  2579. return false;
  2580. }
  2581. const int numToCopy = jmin (decodedEnd - decodedStart, numSamples);
  2582. float* const* const dst = reinterpret_cast <float**> (destSamples);
  2583. memcpy (dst[0] + startOffsetInDestBuffer, decoded0 + decodedStart, sizeof (float) * numToCopy);
  2584. if (numDestChannels > 1 && dst[1] != nullptr)
  2585. memcpy (dst[1] + startOffsetInDestBuffer, (numChannels < 2 ? decoded0 : decoded1) + decodedStart, sizeof (float) * numToCopy);
  2586. startOffsetInDestBuffer += numToCopy;
  2587. decodedStart += numToCopy;
  2588. currentPosition += numToCopy;
  2589. numSamples -= numToCopy;
  2590. }
  2591. return true;
  2592. }
  2593. private:
  2594. MP3Stream stream;
  2595. int64 currentPosition;
  2596. enum { decodedDataSize = 1152 };
  2597. float decoded0 [decodedDataSize], decoded1 [decodedDataSize];
  2598. int decodedStart, decodedEnd;
  2599. void createEmptyDecodedData() noexcept
  2600. {
  2601. zeromem (decoded0, sizeof (decoded0));
  2602. zeromem (decoded1, sizeof (decoded1));
  2603. decodedStart = 0;
  2604. decodedEnd = decodedDataSize;
  2605. }
  2606. bool readNextBlock()
  2607. {
  2608. for (int attempts = 10; --attempts >= 0;)
  2609. {
  2610. int samplesDone = 0;
  2611. const int result = stream.decodeNextBlock (decoded0, decoded1, samplesDone);
  2612. if (result > 0 && stream.stream.isExhausted())
  2613. {
  2614. createEmptyDecodedData();
  2615. return true;
  2616. }
  2617. if (result <= 0)
  2618. {
  2619. decodedStart = 0;
  2620. decodedEnd = samplesDone;
  2621. return result == 0;
  2622. }
  2623. }
  2624. return false;
  2625. }
  2626. void skipID3()
  2627. {
  2628. const int64 originalPosition = stream.stream.getPosition();
  2629. const uint32 firstWord = stream.stream.readInt();
  2630. if ((firstWord & 0xffffff) == 0x334449)
  2631. {
  2632. uint8 buffer[6];
  2633. if (stream.stream.read (buffer, 6) == 6
  2634. && buffer[0] != 0xff
  2635. && ((buffer[2] | buffer[3] | buffer[4] | buffer[5]) & 0x80) == 0)
  2636. {
  2637. const int length = (((uint32) buffer[2]) << 21)
  2638. | (((uint32) buffer[3]) << 14)
  2639. | (((uint32) buffer[4]) << 7)
  2640. | ((uint32) buffer[5]);
  2641. stream.stream.skipNextBytes (length);
  2642. return;
  2643. }
  2644. }
  2645. stream.stream.setPosition (originalPosition);
  2646. }
  2647. int64 findLength (int64 streamStartPos)
  2648. {
  2649. int64 numFrames = stream.numFrames;
  2650. if (numFrames <= 0)
  2651. {
  2652. const int64 streamSize = stream.stream.getTotalLength();
  2653. if (streamSize > 0)
  2654. numFrames = (streamSize - streamStartPos) / (stream.frame.frameSize);
  2655. }
  2656. return numFrames * 1152;
  2657. }
  2658. JUCE_DECLARE_NON_COPYABLE_WITH_LEAK_DETECTOR (MP3Reader)
  2659. };
  2660. }
  2661. //==============================================================================
  2662. MP3AudioFormat::MP3AudioFormat()
  2663. : AudioFormat (MP3Decoder::mp3FormatName, StringArray (MP3Decoder::mp3Extensions))
  2664. {}
  2665. MP3AudioFormat::~MP3AudioFormat() {}
  2666. Array<int> MP3AudioFormat::getPossibleSampleRates() { return Array<int>(); }
  2667. Array<int> MP3AudioFormat::getPossibleBitDepths() { return Array<int>(); }
  2668. bool MP3AudioFormat::canDoStereo() { return true; }
  2669. bool MP3AudioFormat::canDoMono() { return true; }
  2670. bool MP3AudioFormat::isCompressed() { return true; }
  2671. StringArray MP3AudioFormat::getQualityOptions() { return StringArray(); }
  2672. AudioFormatReader* MP3AudioFormat::createReaderFor (InputStream* sourceStream, const bool deleteStreamIfOpeningFails)
  2673. {
  2674. ScopedPointer<MP3Decoder::MP3Reader> r (new MP3Decoder::MP3Reader (sourceStream));
  2675. if (r->lengthInSamples > 0)
  2676. return r.release();
  2677. if (! deleteStreamIfOpeningFails)
  2678. r->input = nullptr;
  2679. return nullptr;
  2680. }
  2681. AudioFormatWriter* MP3AudioFormat::createWriterFor (OutputStream*, double /*sampleRateToUse*/,
  2682. unsigned int /*numberOfChannels*/, int /*bitsPerSample*/,
  2683. const StringPairArray& /*metadataValues*/, int /*qualityOptionIndex*/)
  2684. {
  2685. return nullptr;
  2686. }
  2687. #endif