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.

3169 lines
132KB

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