mlpdsp.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2007-2008 Ian Caulfield
3  * 2009 Ramiro Polla
4  *
5  * This file is part of Libav.
6  *
7  * Libav is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * Libav is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with Libav; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #include "config.h"
23 #include "mlpdsp.h"
24 #include "mlp.h"
25 
26 static void ff_mlp_filter_channel(int32_t *state, const int32_t *coeff,
27  int firorder, int iirorder,
28  unsigned int filter_shift, int32_t mask, int blocksize,
29  int32_t *sample_buffer)
30 {
31  int32_t *firbuf = state;
32  int32_t *iirbuf = state + MAX_BLOCKSIZE + MAX_FIR_ORDER;
33  const int32_t *fircoeff = coeff;
34  const int32_t *iircoeff = coeff + MAX_FIR_ORDER;
35  int i;
36 
37  for (i = 0; i < blocksize; i++) {
38  int32_t residual = *sample_buffer;
39  unsigned int order;
40  int64_t accum = 0;
41  int32_t result;
42 
43  for (order = 0; order < firorder; order++)
44  accum += (int64_t) firbuf[order] * fircoeff[order];
45  for (order = 0; order < iirorder; order++)
46  accum += (int64_t) iirbuf[order] * iircoeff[order];
47 
48  accum = accum >> filter_shift;
49  result = (accum + residual) & mask;
50 
51  *--firbuf = result;
52  *--iirbuf = result - accum;
53 
54  *sample_buffer = result;
55  sample_buffer += MAX_CHANNELS;
56  }
57 }
58 
60  const int32_t *coeffs,
61  const uint8_t *bypassed_lsbs,
62  const int8_t *noise_buffer,
63  int index,
64  unsigned int dest_ch,
65  uint16_t blockpos,
66  unsigned int maxchan,
67  int matrix_noise_shift,
68  int access_unit_size_pow2,
69  int32_t mask)
70 {
71  unsigned int src_ch, i;
72  int index2 = 2 * index + 1;
73  for (i = 0; i < blockpos; i++) {
74  int64_t accum = 0;
75 
76  for (src_ch = 0; src_ch <= maxchan; src_ch++)
77  accum += (int64_t) samples[src_ch] * coeffs[src_ch];
78 
79  if (matrix_noise_shift) {
80  index &= access_unit_size_pow2 - 1;
81  accum += noise_buffer[index] << (matrix_noise_shift + 7);
82  index += index2;
83  }
84 
85  samples[dest_ch] = ((accum >> 14) & mask) + *bypassed_lsbs;
86  bypassed_lsbs += MAX_CHANNELS;
87  samples += MAX_CHANNELS;
88  }
89 }
90 
92  int8_t *output_shift,
93  uint8_t max_matrix_channel,
94  int is32))(int32_t, uint16_t, int32_t (*)[], void *, uint8_t*, int8_t *, uint8_t, int)
95 {
96  return ff_mlp_pack_output;
97 }
98 
99 int32_t ff_mlp_pack_output(int32_t lossless_check_data,
100  uint16_t blockpos,
101  int32_t (*sample_buffer)[MAX_CHANNELS],
102  void *data,
103  uint8_t *ch_assign,
104  int8_t *output_shift,
105  uint8_t max_matrix_channel,
106  int is32)
107 {
108  unsigned int i, out_ch = 0;
109  int32_t *data_32 = data;
110  int16_t *data_16 = data;
111 
112  for (i = 0; i < blockpos; i++) {
113  for (out_ch = 0; out_ch <= max_matrix_channel; out_ch++) {
114  int mat_ch = ch_assign[out_ch];
115  int32_t sample = sample_buffer[i][mat_ch]
116  << output_shift[mat_ch];
117  lossless_check_data ^= (sample & 0xffffff) << mat_ch;
118  if (is32)
119  *data_32++ = sample << 8;
120  else
121  *data_16++ = sample >> 8;
122  }
123  }
124  return lossless_check_data;
125 }
126 
128 {
133  if (ARCH_ARM)
135  if (ARCH_X86)
137 }