🛠️🐜 Antkeeper superbuild with dependencies included https://antkeeper.com
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.

274 lines
9.4 KiB

  1. #include "config.h"
  2. #include "sample_cvt.h"
  3. #include "AL/al.h"
  4. #include "alu.h"
  5. #include "alBuffer.h"
  6. /* A quick'n'dirty lookup table to decode a muLaw-encoded byte sample into a
  7. * signed 16-bit sample */
  8. const ALshort muLawDecompressionTable[256] = {
  9. -32124,-31100,-30076,-29052,-28028,-27004,-25980,-24956,
  10. -23932,-22908,-21884,-20860,-19836,-18812,-17788,-16764,
  11. -15996,-15484,-14972,-14460,-13948,-13436,-12924,-12412,
  12. -11900,-11388,-10876,-10364, -9852, -9340, -8828, -8316,
  13. -7932, -7676, -7420, -7164, -6908, -6652, -6396, -6140,
  14. -5884, -5628, -5372, -5116, -4860, -4604, -4348, -4092,
  15. -3900, -3772, -3644, -3516, -3388, -3260, -3132, -3004,
  16. -2876, -2748, -2620, -2492, -2364, -2236, -2108, -1980,
  17. -1884, -1820, -1756, -1692, -1628, -1564, -1500, -1436,
  18. -1372, -1308, -1244, -1180, -1116, -1052, -988, -924,
  19. -876, -844, -812, -780, -748, -716, -684, -652,
  20. -620, -588, -556, -524, -492, -460, -428, -396,
  21. -372, -356, -340, -324, -308, -292, -276, -260,
  22. -244, -228, -212, -196, -180, -164, -148, -132,
  23. -120, -112, -104, -96, -88, -80, -72, -64,
  24. -56, -48, -40, -32, -24, -16, -8, 0,
  25. 32124, 31100, 30076, 29052, 28028, 27004, 25980, 24956,
  26. 23932, 22908, 21884, 20860, 19836, 18812, 17788, 16764,
  27. 15996, 15484, 14972, 14460, 13948, 13436, 12924, 12412,
  28. 11900, 11388, 10876, 10364, 9852, 9340, 8828, 8316,
  29. 7932, 7676, 7420, 7164, 6908, 6652, 6396, 6140,
  30. 5884, 5628, 5372, 5116, 4860, 4604, 4348, 4092,
  31. 3900, 3772, 3644, 3516, 3388, 3260, 3132, 3004,
  32. 2876, 2748, 2620, 2492, 2364, 2236, 2108, 1980,
  33. 1884, 1820, 1756, 1692, 1628, 1564, 1500, 1436,
  34. 1372, 1308, 1244, 1180, 1116, 1052, 988, 924,
  35. 876, 844, 812, 780, 748, 716, 684, 652,
  36. 620, 588, 556, 524, 492, 460, 428, 396,
  37. 372, 356, 340, 324, 308, 292, 276, 260,
  38. 244, 228, 212, 196, 180, 164, 148, 132,
  39. 120, 112, 104, 96, 88, 80, 72, 64,
  40. 56, 48, 40, 32, 24, 16, 8, 0
  41. };
  42. /* A quick'n'dirty lookup table to decode an aLaw-encoded byte sample into a
  43. * signed 16-bit sample */
  44. const ALshort aLawDecompressionTable[256] = {
  45. -5504, -5248, -6016, -5760, -4480, -4224, -4992, -4736,
  46. -7552, -7296, -8064, -7808, -6528, -6272, -7040, -6784,
  47. -2752, -2624, -3008, -2880, -2240, -2112, -2496, -2368,
  48. -3776, -3648, -4032, -3904, -3264, -3136, -3520, -3392,
  49. -22016,-20992,-24064,-23040,-17920,-16896,-19968,-18944,
  50. -30208,-29184,-32256,-31232,-26112,-25088,-28160,-27136,
  51. -11008,-10496,-12032,-11520, -8960, -8448, -9984, -9472,
  52. -15104,-14592,-16128,-15616,-13056,-12544,-14080,-13568,
  53. -344, -328, -376, -360, -280, -264, -312, -296,
  54. -472, -456, -504, -488, -408, -392, -440, -424,
  55. -88, -72, -120, -104, -24, -8, -56, -40,
  56. -216, -200, -248, -232, -152, -136, -184, -168,
  57. -1376, -1312, -1504, -1440, -1120, -1056, -1248, -1184,
  58. -1888, -1824, -2016, -1952, -1632, -1568, -1760, -1696,
  59. -688, -656, -752, -720, -560, -528, -624, -592,
  60. -944, -912, -1008, -976, -816, -784, -880, -848,
  61. 5504, 5248, 6016, 5760, 4480, 4224, 4992, 4736,
  62. 7552, 7296, 8064, 7808, 6528, 6272, 7040, 6784,
  63. 2752, 2624, 3008, 2880, 2240, 2112, 2496, 2368,
  64. 3776, 3648, 4032, 3904, 3264, 3136, 3520, 3392,
  65. 22016, 20992, 24064, 23040, 17920, 16896, 19968, 18944,
  66. 30208, 29184, 32256, 31232, 26112, 25088, 28160, 27136,
  67. 11008, 10496, 12032, 11520, 8960, 8448, 9984, 9472,
  68. 15104, 14592, 16128, 15616, 13056, 12544, 14080, 13568,
  69. 344, 328, 376, 360, 280, 264, 312, 296,
  70. 472, 456, 504, 488, 408, 392, 440, 424,
  71. 88, 72, 120, 104, 24, 8, 56, 40,
  72. 216, 200, 248, 232, 152, 136, 184, 168,
  73. 1376, 1312, 1504, 1440, 1120, 1056, 1248, 1184,
  74. 1888, 1824, 2016, 1952, 1632, 1568, 1760, 1696,
  75. 688, 656, 752, 720, 560, 528, 624, 592,
  76. 944, 912, 1008, 976, 816, 784, 880, 848
  77. };
  78. namespace {
  79. /* IMA ADPCM Stepsize table */
  80. constexpr int IMAStep_size[89] = {
  81. 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19,
  82. 21, 23, 25, 28, 31, 34, 37, 41, 45, 50, 55,
  83. 60, 66, 73, 80, 88, 97, 107, 118, 130, 143, 157,
  84. 173, 190, 209, 230, 253, 279, 307, 337, 371, 408, 449,
  85. 494, 544, 598, 658, 724, 796, 876, 963, 1060, 1166, 1282,
  86. 1411, 1552, 1707, 1878, 2066, 2272, 2499, 2749, 3024, 3327, 3660,
  87. 4026, 4428, 4871, 5358, 5894, 6484, 7132, 7845, 8630, 9493,10442,
  88. 11487,12635,13899,15289,16818,18500,20350,22358,24633,27086,29794,
  89. 32767
  90. };
  91. /* IMA4 ADPCM Codeword decode table */
  92. constexpr int IMA4Codeword[16] = {
  93. 1, 3, 5, 7, 9, 11, 13, 15,
  94. -1,-3,-5,-7,-9,-11,-13,-15,
  95. };
  96. /* IMA4 ADPCM Step index adjust decode table */
  97. constexpr int IMA4Index_adjust[16] = {
  98. -1,-1,-1,-1, 2, 4, 6, 8,
  99. -1,-1,-1,-1, 2, 4, 6, 8
  100. };
  101. /* MSADPCM Adaption table */
  102. constexpr int MSADPCMAdaption[16] = {
  103. 230, 230, 230, 230, 307, 409, 512, 614,
  104. 768, 614, 512, 409, 307, 230, 230, 230
  105. };
  106. /* MSADPCM Adaption Coefficient tables */
  107. constexpr int MSADPCMAdaptionCoeff[7][2] = {
  108. { 256, 0 },
  109. { 512, -256 },
  110. { 0, 0 },
  111. { 192, 64 },
  112. { 240, 0 },
  113. { 460, -208 },
  114. { 392, -232 }
  115. };
  116. void DecodeIMA4Block(ALshort *dst, const ALubyte *src, ALint numchans, ALsizei align)
  117. {
  118. ALint sample[MAX_INPUT_CHANNELS]{};
  119. ALint index[MAX_INPUT_CHANNELS]{};
  120. ALuint code[MAX_INPUT_CHANNELS]{};
  121. for(int c{0};c < numchans;c++)
  122. {
  123. sample[c] = *(src++);
  124. sample[c] |= *(src++) << 8;
  125. sample[c] = (sample[c]^0x8000) - 32768;
  126. index[c] = *(src++);
  127. index[c] |= *(src++) << 8;
  128. index[c] = (index[c]^0x8000) - 32768;
  129. index[c] = clampi(index[c], 0, 88);
  130. dst[c] = sample[c];
  131. }
  132. for(int i{1};i < align;i++)
  133. {
  134. if((i&7) == 1)
  135. {
  136. for(int c{0};c < numchans;c++)
  137. {
  138. code[c] = *(src++);
  139. code[c] |= *(src++) << 8;
  140. code[c] |= *(src++) << 16;
  141. code[c] |= *(src++) << 24;
  142. }
  143. }
  144. for(int c{0};c < numchans;c++)
  145. {
  146. int nibble = code[c]&0xf;
  147. code[c] >>= 4;
  148. sample[c] += IMA4Codeword[nibble] * IMAStep_size[index[c]] / 8;
  149. sample[c] = clampi(sample[c], -32768, 32767);
  150. index[c] += IMA4Index_adjust[nibble];
  151. index[c] = clampi(index[c], 0, 88);
  152. *(dst++) = sample[c];
  153. }
  154. }
  155. }
  156. void DecodeMSADPCMBlock(ALshort *dst, const ALubyte *src, ALint numchans, ALsizei align)
  157. {
  158. ALubyte blockpred[MAX_INPUT_CHANNELS]{};
  159. ALint delta[MAX_INPUT_CHANNELS]{};
  160. ALshort samples[MAX_INPUT_CHANNELS][2]{};
  161. for(int c{0};c < numchans;c++)
  162. {
  163. blockpred[c] = *(src++);
  164. blockpred[c] = minu(blockpred[c], 6);
  165. }
  166. for(int c{0};c < numchans;c++)
  167. {
  168. delta[c] = *(src++);
  169. delta[c] |= *(src++) << 8;
  170. delta[c] = (delta[c]^0x8000) - 32768;
  171. }
  172. for(int c{0};c < numchans;c++)
  173. {
  174. samples[c][0] = *(src++);
  175. samples[c][0] |= *(src++) << 8;
  176. samples[c][0] = (samples[c][0]^0x8000) - 32768;
  177. }
  178. for(int c{0};c < numchans;c++)
  179. {
  180. samples[c][1] = *(src++);
  181. samples[c][1] |= *(src++) << 8;
  182. samples[c][1] = (samples[c][1]^0x8000) - 0x8000;
  183. }
  184. /* Second sample is written first. */
  185. for(int c{0};c < numchans;c++)
  186. *(dst++) = samples[c][1];
  187. for(int c{0};c < numchans;c++)
  188. *(dst++) = samples[c][0];
  189. for(int i{2};i < align;i++)
  190. {
  191. for(int c{0};c < numchans;c++)
  192. {
  193. const ALint num = (i*numchans) + c;
  194. ALint nibble, pred;
  195. /* Read the nibble (first is in the upper bits). */
  196. if(!(num&1))
  197. nibble = (*src>>4)&0x0f;
  198. else
  199. nibble = (*(src++))&0x0f;
  200. pred = (samples[c][0]*MSADPCMAdaptionCoeff[blockpred[c]][0] +
  201. samples[c][1]*MSADPCMAdaptionCoeff[blockpred[c]][1]) / 256;
  202. pred += ((nibble^0x08) - 0x08) * delta[c];
  203. pred = clampi(pred, -32768, 32767);
  204. samples[c][1] = samples[c][0];
  205. samples[c][0] = pred;
  206. delta[c] = (MSADPCMAdaption[nibble] * delta[c]) / 256;
  207. delta[c] = maxi(16, delta[c]);
  208. *(dst++) = pred;
  209. }
  210. }
  211. }
  212. } // namespace
  213. void Convert_ALshort_ALima4(ALshort *dst, const ALubyte *src, ALsizei numchans, ALsizei len,
  214. ALsizei align)
  215. {
  216. ALsizei byte_align = ((align-1)/2 + 4) * numchans;
  217. assert(align > 0 && (len%align) == 0);
  218. len /= align;
  219. while(len--)
  220. {
  221. DecodeIMA4Block(dst, src, numchans, align);
  222. src += byte_align;
  223. dst += align*numchans;
  224. }
  225. }
  226. void Convert_ALshort_ALmsadpcm(ALshort *dst, const ALubyte *src, ALsizei numchans, ALsizei len,
  227. ALsizei align)
  228. {
  229. const ALsizei byte_align = ((align-2)/2 + 7) * numchans;
  230. assert(align > 1 && (len%align) == 0);
  231. len /= align;
  232. while(len--)
  233. {
  234. DecodeMSADPCMBlock(dst, src, numchans, align);
  235. src += byte_align;
  236. dst += align*numchans;
  237. }
  238. }