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.

413 lines
22KB

  1. /*
  2. * Copyright (c) 2012
  3. * MIPS Technologies, Inc., California.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the MIPS Technologies, Inc., nor the names of its
  14. * contributors may be used to endorse or promote products derived from
  15. * this software without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE MIPS TECHNOLOGIES, INC. ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE MIPS TECHNOLOGIES, INC. BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. *
  29. * Authors: Branimir Vasic (bvasic@mips.com)
  30. * Nedeljko Babic (nbabic@mips.com)
  31. *
  32. * Various AC-3 DSP Utils optimized for MIPS
  33. *
  34. * This file is part of FFmpeg.
  35. *
  36. * FFmpeg is free software; you can redistribute it and/or
  37. * modify it under the terms of the GNU Lesser General Public
  38. * License as published by the Free Software Foundation; either
  39. * version 2.1 of the License, or (at your option) any later version.
  40. *
  41. * FFmpeg is distributed in the hope that it will be useful,
  42. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  43. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  44. * Lesser General Public License for more details.
  45. *
  46. * You should have received a copy of the GNU Lesser General Public
  47. * License along with FFmpeg; if not, write to the Free Software
  48. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  49. */
  50. /**
  51. * @file
  52. * Reference: libavcodec/ac3dsp.c
  53. */
  54. #include "config.h"
  55. #include "libavcodec/ac3dsp.h"
  56. #include "libavcodec/ac3.h"
  57. #if HAVE_INLINE_ASM
  58. #if HAVE_MIPSDSPR1
  59. static void ac3_bit_alloc_calc_bap_mips(int16_t *mask, int16_t *psd,
  60. int start, int end,
  61. int snr_offset, int floor,
  62. const uint8_t *bap_tab, uint8_t *bap)
  63. {
  64. int band, band_end, cond;
  65. int m, address1, address2;
  66. int16_t *psd1, *psd_end;
  67. uint8_t *bap1;
  68. if (snr_offset == -960) {
  69. memset(bap, 0, AC3_MAX_COEFS);
  70. return;
  71. }
  72. psd1 = &psd[start];
  73. bap1 = &bap[start];
  74. band = ff_ac3_bin_to_band_tab[start];
  75. do {
  76. m = (FFMAX(mask[band] - snr_offset - floor, 0) & 0x1FE0) + floor;
  77. band_end = ff_ac3_band_start_tab[++band];
  78. band_end = FFMIN(band_end, end);
  79. psd_end = psd + band_end - 1;
  80. __asm__ volatile (
  81. "slt %[cond], %[psd1], %[psd_end] \n\t"
  82. "beqz %[cond], 1f \n\t"
  83. "2: \n\t"
  84. "lh %[address1], 0(%[psd1]) \n\t"
  85. "lh %[address2], 2(%[psd1]) \n\t"
  86. "addiu %[psd1], %[psd1], 4 \n\t"
  87. "subu %[address1], %[address1], %[m] \n\t"
  88. "sra %[address1], %[address1], 5 \n\t"
  89. "addiu %[address1], %[address1], -32 \n\t"
  90. "shll_s.w %[address1], %[address1], 26 \n\t"
  91. "subu %[address2], %[address2], %[m] \n\t"
  92. "sra %[address2], %[address2], 5 \n\t"
  93. "sra %[address1], %[address1], 26 \n\t"
  94. "addiu %[address1], %[address1], 32 \n\t"
  95. "lbux %[address1], %[address1](%[bap_tab]) \n\t"
  96. "addiu %[address2], %[address2], -32 \n\t"
  97. "shll_s.w %[address2], %[address2], 26 \n\t"
  98. "sb %[address1], 0(%[bap1]) \n\t"
  99. "slt %[cond], %[psd1], %[psd_end] \n\t"
  100. "sra %[address2], %[address2], 26 \n\t"
  101. "addiu %[address2], %[address2], 32 \n\t"
  102. "lbux %[address2], %[address2](%[bap_tab]) \n\t"
  103. "sb %[address2], 1(%[bap1]) \n\t"
  104. "addiu %[bap1], %[bap1], 2 \n\t"
  105. "bnez %[cond], 2b \n\t"
  106. "addiu %[psd_end], %[psd_end], 2 \n\t"
  107. "slt %[cond], %[psd1], %[psd_end] \n\t"
  108. "beqz %[cond], 3f \n\t"
  109. "1: \n\t"
  110. "lh %[address1], 0(%[psd1]) \n\t"
  111. "addiu %[psd1], %[psd1], 2 \n\t"
  112. "subu %[address1], %[address1], %[m] \n\t"
  113. "sra %[address1], %[address1], 5 \n\t"
  114. "addiu %[address1], %[address1], -32 \n\t"
  115. "shll_s.w %[address1], %[address1], 26 \n\t"
  116. "sra %[address1], %[address1], 26 \n\t"
  117. "addiu %[address1], %[address1], 32 \n\t"
  118. "lbux %[address1], %[address1](%[bap_tab]) \n\t"
  119. "sb %[address1], 0(%[bap1]) \n\t"
  120. "addiu %[bap1], %[bap1], 1 \n\t"
  121. "3: \n\t"
  122. : [address1]"=&r"(address1), [address2]"=&r"(address2),
  123. [cond]"=&r"(cond), [bap1]"+r"(bap1),
  124. [psd1]"+r"(psd1), [psd_end]"+r"(psd_end)
  125. : [m]"r"(m), [bap_tab]"r"(bap_tab)
  126. : "memory"
  127. );
  128. } while (end > band_end);
  129. }
  130. static void ac3_update_bap_counts_mips(uint16_t mant_cnt[16], uint8_t *bap,
  131. int len)
  132. {
  133. int temp0, temp1, temp2, temp3, temp4, temp5, temp6, temp7;
  134. __asm__ volatile (
  135. "andi %[temp3], %[len], 3 \n\t"
  136. "addu %[temp2], %[bap], %[len] \n\t"
  137. "addu %[temp4], %[bap], %[temp3] \n\t"
  138. "beq %[temp2], %[temp4], 4f \n\t"
  139. "1: \n\t"
  140. "lbu %[temp0], -1(%[temp2]) \n\t"
  141. "lbu %[temp5], -2(%[temp2]) \n\t"
  142. "lbu %[temp6], -3(%[temp2]) \n\t"
  143. "sll %[temp0], %[temp0], 1 \n\t"
  144. "addu %[temp0], %[mant_cnt], %[temp0] \n\t"
  145. "sll %[temp5], %[temp5], 1 \n\t"
  146. "addu %[temp5], %[mant_cnt], %[temp5] \n\t"
  147. "lhu %[temp1], 0(%[temp0]) \n\t"
  148. "sll %[temp6], %[temp6], 1 \n\t"
  149. "addu %[temp6], %[mant_cnt], %[temp6] \n\t"
  150. "addiu %[temp1], %[temp1], 1 \n\t"
  151. "sh %[temp1], 0(%[temp0]) \n\t"
  152. "lhu %[temp1], 0(%[temp5]) \n\t"
  153. "lbu %[temp7], -4(%[temp2]) \n\t"
  154. "addiu %[temp2], %[temp2], -4 \n\t"
  155. "addiu %[temp1], %[temp1], 1 \n\t"
  156. "sh %[temp1], 0(%[temp5]) \n\t"
  157. "lhu %[temp1], 0(%[temp6]) \n\t"
  158. "sll %[temp7], %[temp7], 1 \n\t"
  159. "addu %[temp7], %[mant_cnt], %[temp7] \n\t"
  160. "addiu %[temp1], %[temp1],1 \n\t"
  161. "sh %[temp1], 0(%[temp6]) \n\t"
  162. "lhu %[temp1], 0(%[temp7]) \n\t"
  163. "addiu %[temp1], %[temp1], 1 \n\t"
  164. "sh %[temp1], 0(%[temp7]) \n\t"
  165. "bne %[temp2], %[temp4], 1b \n\t"
  166. "4: \n\t"
  167. "beqz %[temp3], 2f \n\t"
  168. "3: \n\t"
  169. "addiu %[temp3], %[temp3], -1 \n\t"
  170. "lbu %[temp0], -1(%[temp2]) \n\t"
  171. "addiu %[temp2], %[temp2], -1 \n\t"
  172. "sll %[temp0], %[temp0], 1 \n\t"
  173. "addu %[temp0], %[mant_cnt], %[temp0] \n\t"
  174. "lhu %[temp1], 0(%[temp0]) \n\t"
  175. "addiu %[temp1], %[temp1], 1 \n\t"
  176. "sh %[temp1], 0(%[temp0]) \n\t"
  177. "bgtz %[temp3], 3b \n\t"
  178. "2: \n\t"
  179. : [temp0] "=&r" (temp0), [temp1] "=&r" (temp1),
  180. [temp2] "=&r" (temp2), [temp3] "=&r" (temp3),
  181. [temp4] "=&r" (temp4), [temp5] "=&r" (temp5),
  182. [temp6] "=&r" (temp6), [temp7] "=&r" (temp7)
  183. : [len] "r" (len), [bap] "r" (bap),
  184. [mant_cnt] "r" (mant_cnt)
  185. : "memory"
  186. );
  187. }
  188. #endif
  189. #if HAVE_MIPSFPU && HAVE_MIPS32R2
  190. static void float_to_fixed24_mips(int32_t *dst, const float *src, unsigned int len)
  191. {
  192. const float scale = 1 << 24;
  193. float src0, src1, src2, src3, src4, src5, src6, src7;
  194. int temp0, temp1, temp2, temp3, temp4, temp5, temp6, temp7;
  195. do {
  196. __asm__ volatile (
  197. "lwc1 %[src0], 0(%[src]) \n\t"
  198. "lwc1 %[src1], 4(%[src]) \n\t"
  199. "lwc1 %[src2], 8(%[src]) \n\t"
  200. "lwc1 %[src3], 12(%[src]) \n\t"
  201. "lwc1 %[src4], 16(%[src]) \n\t"
  202. "lwc1 %[src5], 20(%[src]) \n\t"
  203. "lwc1 %[src6], 24(%[src]) \n\t"
  204. "lwc1 %[src7], 28(%[src]) \n\t"
  205. "mul.s %[src0], %[src0], %[scale] \n\t"
  206. "mul.s %[src1], %[src1], %[scale] \n\t"
  207. "mul.s %[src2], %[src2], %[scale] \n\t"
  208. "mul.s %[src3], %[src3], %[scale] \n\t"
  209. "mul.s %[src4], %[src4], %[scale] \n\t"
  210. "mul.s %[src5], %[src5], %[scale] \n\t"
  211. "mul.s %[src6], %[src6], %[scale] \n\t"
  212. "mul.s %[src7], %[src7], %[scale] \n\t"
  213. "cvt.w.s %[src0], %[src0] \n\t"
  214. "cvt.w.s %[src1], %[src1] \n\t"
  215. "cvt.w.s %[src2], %[src2] \n\t"
  216. "cvt.w.s %[src3], %[src3] \n\t"
  217. "cvt.w.s %[src4], %[src4] \n\t"
  218. "cvt.w.s %[src5], %[src5] \n\t"
  219. "cvt.w.s %[src6], %[src6] \n\t"
  220. "cvt.w.s %[src7], %[src7] \n\t"
  221. "mfc1 %[temp0], %[src0] \n\t"
  222. "mfc1 %[temp1], %[src1] \n\t"
  223. "mfc1 %[temp2], %[src2] \n\t"
  224. "mfc1 %[temp3], %[src3] \n\t"
  225. "mfc1 %[temp4], %[src4] \n\t"
  226. "mfc1 %[temp5], %[src5] \n\t"
  227. "mfc1 %[temp6], %[src6] \n\t"
  228. "mfc1 %[temp7], %[src7] \n\t"
  229. "sw %[temp0], 0(%[dst]) \n\t"
  230. "sw %[temp1], 4(%[dst]) \n\t"
  231. "sw %[temp2], 8(%[dst]) \n\t"
  232. "sw %[temp3], 12(%[dst]) \n\t"
  233. "sw %[temp4], 16(%[dst]) \n\t"
  234. "sw %[temp5], 20(%[dst]) \n\t"
  235. "sw %[temp6], 24(%[dst]) \n\t"
  236. "sw %[temp7], 28(%[dst]) \n\t"
  237. : [dst] "+r" (dst), [src] "+r" (src),
  238. [src0] "=&f" (src0), [src1] "=&f" (src1),
  239. [src2] "=&f" (src2), [src3] "=&f" (src3),
  240. [src4] "=&f" (src4), [src5] "=&f" (src5),
  241. [src6] "=&f" (src6), [src7] "=&f" (src7),
  242. [temp0] "=r" (temp0), [temp1] "=r" (temp1),
  243. [temp2] "=r" (temp2), [temp3] "=r" (temp3),
  244. [temp4] "=r" (temp4), [temp5] "=r" (temp5),
  245. [temp6] "=r" (temp6), [temp7] "=r" (temp7)
  246. : [scale] "f" (scale)
  247. : "memory"
  248. );
  249. src = src + 8;
  250. dst = dst + 8;
  251. len -= 8;
  252. } while (len > 0);
  253. }
  254. static void ac3_downmix_mips(float **samples, float (*matrix)[2],
  255. int out_ch, int in_ch, int len)
  256. {
  257. int i, j, i1, i2, i3;
  258. float v0, v1, v2, v3;
  259. float v4, v5, v6, v7;
  260. float samples0, samples1, samples2, samples3, matrix_j, matrix_j2;
  261. float *samples_p,*matrix_p, **samples_x, **samples_end, **samples_sw;
  262. __asm__ volatile(
  263. ".set push \n\t"
  264. ".set noreorder \n\t"
  265. "li %[i1], 2 \n\t"
  266. "sll %[len], 2 \n\t"
  267. "move %[i], $zero \n\t"
  268. "sll %[j], %[in_ch], 2 \n\t"
  269. "bne %[out_ch], %[i1], 3f \n\t" // if (out_ch == 2)
  270. " li %[i2], 1 \n\t"
  271. "2: \n\t" // start of the for loop (for (i = 0; i < len; i+=4))
  272. "move %[matrix_p], %[matrix] \n\t"
  273. "move %[samples_x], %[samples] \n\t"
  274. "mtc1 $zero, %[v0] \n\t"
  275. "mtc1 $zero, %[v1] \n\t"
  276. "mtc1 $zero, %[v2] \n\t"
  277. "mtc1 $zero, %[v3] \n\t"
  278. "mtc1 $zero, %[v4] \n\t"
  279. "mtc1 $zero, %[v5] \n\t"
  280. "mtc1 $zero, %[v6] \n\t"
  281. "mtc1 $zero, %[v7] \n\t"
  282. "addiu %[i1], %[i], 4 \n\t"
  283. "addiu %[i2], %[i], 8 \n\t"
  284. "lw %[samples_p], 0(%[samples_x]) \n\t"
  285. "addiu %[i3], %[i], 12 \n\t"
  286. "addu %[samples_end], %[samples_x], %[j] \n\t"
  287. "move %[samples_sw], %[samples_p] \n\t"
  288. "1: \n\t" // start of the inner for loop (for (j = 0; j < in_ch; j++))
  289. "lwc1 %[matrix_j], 0(%[matrix_p]) \n\t"
  290. "lwc1 %[matrix_j2], 4(%[matrix_p]) \n\t"
  291. "lwxc1 %[samples0], %[i](%[samples_p]) \n\t"
  292. "lwxc1 %[samples1], %[i1](%[samples_p]) \n\t"
  293. "lwxc1 %[samples2], %[i2](%[samples_p]) \n\t"
  294. "lwxc1 %[samples3], %[i3](%[samples_p]) \n\t"
  295. "addiu %[matrix_p], 8 \n\t"
  296. "addiu %[samples_x], 4 \n\t"
  297. "madd.s %[v0], %[v0], %[samples0], %[matrix_j] \n\t"
  298. "madd.s %[v1], %[v1], %[samples1], %[matrix_j] \n\t"
  299. "madd.s %[v2], %[v2], %[samples2], %[matrix_j] \n\t"
  300. "madd.s %[v3], %[v3], %[samples3], %[matrix_j] \n\t"
  301. "madd.s %[v4], %[v4], %[samples0], %[matrix_j2]\n\t"
  302. "madd.s %[v5], %[v5], %[samples1], %[matrix_j2]\n\t"
  303. "madd.s %[v6], %[v6], %[samples2], %[matrix_j2]\n\t"
  304. "madd.s %[v7], %[v7], %[samples3], %[matrix_j2]\n\t"
  305. "bne %[samples_x], %[samples_end], 1b \n\t"
  306. " lw %[samples_p], 0(%[samples_x]) \n\t"
  307. "lw %[samples_p], 4(%[samples]) \n\t"
  308. "swxc1 %[v0], %[i](%[samples_sw]) \n\t"
  309. "swxc1 %[v1], %[i1](%[samples_sw]) \n\t"
  310. "swxc1 %[v2], %[i2](%[samples_sw]) \n\t"
  311. "swxc1 %[v3], %[i3](%[samples_sw]) \n\t"
  312. "swxc1 %[v4], %[i](%[samples_p]) \n\t"
  313. "addiu %[i], 16 \n\t"
  314. "swxc1 %[v5], %[i1](%[samples_p]) \n\t"
  315. "swxc1 %[v6], %[i2](%[samples_p]) \n\t"
  316. "bne %[i], %[len], 2b \n\t"
  317. " swxc1 %[v7], %[i3](%[samples_p]) \n\t"
  318. "3: \n\t"
  319. "bne %[out_ch], %[i2], 6f \n\t" // if (out_ch == 1)
  320. " nop \n\t"
  321. "5: \n\t" // start of the outer for loop (for (i = 0; i < len; i+=4))
  322. "move %[matrix_p], %[matrix] \n\t"
  323. "move %[samples_x], %[samples] \n\t"
  324. "mtc1 $zero, %[v0] \n\t"
  325. "mtc1 $zero, %[v1] \n\t"
  326. "mtc1 $zero, %[v2] \n\t"
  327. "mtc1 $zero, %[v3] \n\t"
  328. "addiu %[i1], %[i], 4 \n\t"
  329. "addiu %[i2], %[i], 8 \n\t"
  330. "lw %[samples_p], 0(%[samples_x]) \n\t"
  331. "addiu %[i3], %[i], 12 \n\t"
  332. "addu %[samples_end], %[samples_x], %[j] \n\t"
  333. "move %[samples_sw], %[samples_p] \n\t"
  334. "4: \n\t" // start of the inner for loop (for (j = 0; j < in_ch; j++))
  335. "lwc1 %[matrix_j], 0(%[matrix_p]) \n\t"
  336. "lwxc1 %[samples0], %[i](%[samples_p]) \n\t"
  337. "lwxc1 %[samples1], %[i1](%[samples_p]) \n\t"
  338. "lwxc1 %[samples2], %[i2](%[samples_p]) \n\t"
  339. "lwxc1 %[samples3], %[i3](%[samples_p]) \n\t"
  340. "addiu %[matrix_p], 8 \n\t"
  341. "addiu %[samples_x], 4 \n\t"
  342. "madd.s %[v0], %[v0], %[samples0], %[matrix_j] \n\t"
  343. "madd.s %[v1], %[v1], %[samples1], %[matrix_j] \n\t"
  344. "madd.s %[v2], %[v2], %[samples2], %[matrix_j] \n\t"
  345. "madd.s %[v3], %[v3], %[samples3], %[matrix_j] \n\t"
  346. "bne %[samples_x], %[samples_end], 4b \n\t"
  347. " lw %[samples_p], 0(%[samples_x]) \n\t"
  348. "swxc1 %[v0], %[i](%[samples_sw]) \n\t"
  349. "addiu %[i], 16 \n\t"
  350. "swxc1 %[v1], %[i1](%[samples_sw]) \n\t"
  351. "swxc1 %[v2], %[i2](%[samples_sw]) \n\t"
  352. "bne %[i], %[len], 5b \n\t"
  353. " swxc1 %[v3], %[i3](%[samples_sw]) \n\t"
  354. "6: \n\t"
  355. ".set pop"
  356. :[samples_p]"=&r"(samples_p), [matrix_j]"=&f"(matrix_j), [matrix_j2]"=&f"(matrix_j2),
  357. [samples0]"=&f"(samples0), [samples1]"=&f"(samples1),
  358. [samples2]"=&f"(samples2), [samples3]"=&f"(samples3),
  359. [v0]"=&f"(v0), [v1]"=&f"(v1), [v2]"=&f"(v2), [v3]"=&f"(v3),
  360. [v4]"=&f"(v4), [v5]"=&f"(v5), [v6]"=&f"(v6), [v7]"=&f"(v7),
  361. [samples_x]"=&r"(samples_x), [matrix_p]"=&r"(matrix_p),
  362. [samples_end]"=&r"(samples_end), [samples_sw]"=&r"(samples_sw),
  363. [i1]"=&r"(i1), [i2]"=&r"(i2), [i3]"=&r"(i3), [i]"=&r"(i),
  364. [j]"=&r"(j), [len]"+r"(len)
  365. :[samples]"r"(samples), [matrix]"r"(matrix),
  366. [in_ch]"r"(in_ch), [out_ch]"r"(out_ch)
  367. :"memory"
  368. );
  369. }
  370. #endif
  371. #endif /* HAVE_INLINE_ASM */
  372. void ff_ac3dsp_init_mips(AC3DSPContext *c, int bit_exact) {
  373. #if HAVE_INLINE_ASM
  374. #if HAVE_MIPSDSPR1
  375. c->bit_alloc_calc_bap = ac3_bit_alloc_calc_bap_mips;
  376. c->update_bap_counts = ac3_update_bap_counts_mips;
  377. #endif
  378. #if HAVE_MIPSFPU && HAVE_MIPS32R2
  379. c->float_to_fixed24 = float_to_fixed24_mips;
  380. c->downmix = ac3_downmix_mips;
  381. #endif
  382. #endif
  383. }