xref: /btstack/3rd-party/bluedroid/decoder/srce/bitalloc.c (revision 7bbeb3ad8cec0c1816689843bf9383cf4c644ef8)
1df25739fSMilanka Ringwald /******************************************************************************
2df25739fSMilanka Ringwald  *
3df25739fSMilanka Ringwald  *  Copyright (C) 2014 The Android Open Source Project
4df25739fSMilanka Ringwald  *  Copyright 2003 - 2004 Open Interface North America, Inc. All rights reserved.
5df25739fSMilanka Ringwald  *
6df25739fSMilanka Ringwald  *  Licensed under the Apache License, Version 2.0 (the "License");
7df25739fSMilanka Ringwald  *  you may not use this file except in compliance with the License.
8df25739fSMilanka Ringwald  *  You may obtain a copy of the License at:
9df25739fSMilanka Ringwald  *
10df25739fSMilanka Ringwald  *  http://www.apache.org/licenses/LICENSE-2.0
11df25739fSMilanka Ringwald  *
12df25739fSMilanka Ringwald  *  Unless required by applicable law or agreed to in writing, software
13df25739fSMilanka Ringwald  *  distributed under the License is distributed on an "AS IS" BASIS,
14df25739fSMilanka Ringwald  *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15df25739fSMilanka Ringwald  *  See the License for the specific language governing permissions and
16df25739fSMilanka Ringwald  *  limitations under the License.
17df25739fSMilanka Ringwald  *
18df25739fSMilanka Ringwald  ******************************************************************************/
19df25739fSMilanka Ringwald 
20df25739fSMilanka Ringwald /**********************************************************************************
21df25739fSMilanka Ringwald   $Revision: #1 $
22df25739fSMilanka Ringwald  ***********************************************************************************/
23df25739fSMilanka Ringwald 
24df25739fSMilanka Ringwald /**
25df25739fSMilanka Ringwald @file
26df25739fSMilanka Ringwald 
27df25739fSMilanka Ringwald The functions in this file relate to the allocation of available bits to
28df25739fSMilanka Ringwald subbands within the SBC/eSBC frame, along with support functions for computing
29df25739fSMilanka Ringwald frame length and bitrate.
30df25739fSMilanka Ringwald 
31df25739fSMilanka Ringwald @ingroup codec_internal
32df25739fSMilanka Ringwald */
33df25739fSMilanka Ringwald 
34df25739fSMilanka Ringwald /**
35df25739fSMilanka Ringwald @addtogroup codec_internal
36df25739fSMilanka Ringwald @{
37df25739fSMilanka Ringwald */
38df25739fSMilanka Ringwald 
39df25739fSMilanka Ringwald #include "oi_utils.h"
40df25739fSMilanka Ringwald #include <oi_codec_sbc_private.h>
41df25739fSMilanka Ringwald 
OI_SBC_MaxBitpool(OI_CODEC_SBC_FRAME_INFO * frame)42df25739fSMilanka Ringwald OI_UINT32 OI_SBC_MaxBitpool(OI_CODEC_SBC_FRAME_INFO *frame)
43df25739fSMilanka Ringwald {
44df25739fSMilanka Ringwald     switch (frame->mode) {
45df25739fSMilanka Ringwald         case SBC_MONO:
46df25739fSMilanka Ringwald         case SBC_DUAL_CHANNEL:
47df25739fSMilanka Ringwald             return 16 * frame->nrof_subbands;
48df25739fSMilanka Ringwald         case SBC_STEREO:
49df25739fSMilanka Ringwald         case SBC_JOINT_STEREO:
50df25739fSMilanka Ringwald             return 32 * frame->nrof_subbands;
51*7bbeb3adSMilanka Ringwald         default:
52*7bbeb3adSMilanka Ringwald             break;
53df25739fSMilanka Ringwald     }
54df25739fSMilanka Ringwald 
55df25739fSMilanka Ringwald     ERROR(("Invalid frame mode %d", frame->mode));
56df25739fSMilanka Ringwald     OI_ASSERT(FALSE);
57df25739fSMilanka Ringwald     return 0; /* Should never be reached */
58df25739fSMilanka Ringwald }
59df25739fSMilanka Ringwald 
60df25739fSMilanka Ringwald 
internal_CalculateFramelen(OI_CODEC_SBC_FRAME_INFO * frame)61df25739fSMilanka Ringwald PRIVATE OI_UINT16 internal_CalculateFramelen(OI_CODEC_SBC_FRAME_INFO *frame)
62df25739fSMilanka Ringwald {
63df25739fSMilanka Ringwald     OI_UINT16 nbits = frame->nrof_blocks * frame->bitpool;
64df25739fSMilanka Ringwald     OI_UINT16 nrof_subbands = frame->nrof_subbands;
65df25739fSMilanka Ringwald     OI_UINT16 result = nbits;
66df25739fSMilanka Ringwald 
67df25739fSMilanka Ringwald     if (frame->mode == SBC_JOINT_STEREO) {
68df25739fSMilanka Ringwald         result += nrof_subbands + (8 * nrof_subbands);
69df25739fSMilanka Ringwald     } else {
70df25739fSMilanka Ringwald         if (frame->mode == SBC_DUAL_CHANNEL) { result += nbits; }
71df25739fSMilanka Ringwald         if (frame->mode == SBC_MONO) { result += 4*nrof_subbands; } else { result += 8*nrof_subbands; }
72df25739fSMilanka Ringwald     }
73c1ab6cc1SMatthias Ringwald     return SBC_HEADER_LEN + ((result + 7) / 8);
74df25739fSMilanka Ringwald }
75df25739fSMilanka Ringwald 
76df25739fSMilanka Ringwald 
internal_CalculateBitrate(OI_CODEC_SBC_FRAME_INFO * frame)77df25739fSMilanka Ringwald PRIVATE OI_UINT32 internal_CalculateBitrate(OI_CODEC_SBC_FRAME_INFO *frame)
78df25739fSMilanka Ringwald {
79df25739fSMilanka Ringwald     OI_UINT blocksbands;
80df25739fSMilanka Ringwald     blocksbands = frame->nrof_subbands * frame->nrof_blocks;
81df25739fSMilanka Ringwald 
82df25739fSMilanka Ringwald     return DIVIDE(8 * internal_CalculateFramelen(frame) * frame->frequency, blocksbands);
83df25739fSMilanka Ringwald }
84df25739fSMilanka Ringwald 
85df25739fSMilanka Ringwald 
OI_SBC_CalculateFrameAndHeaderlen(OI_CODEC_SBC_FRAME_INFO * frame,OI_UINT * headerLen_)86df25739fSMilanka Ringwald INLINE OI_UINT16 OI_SBC_CalculateFrameAndHeaderlen(OI_CODEC_SBC_FRAME_INFO *frame, OI_UINT *headerLen_)
87df25739fSMilanka Ringwald {
88c1ab6cc1SMatthias Ringwald     OI_UINT headerLen = SBC_HEADER_LEN + (frame->nrof_subbands * frame->nrof_channels/2);
89df25739fSMilanka Ringwald 
90df25739fSMilanka Ringwald     if (frame->mode == SBC_JOINT_STEREO) { headerLen++; }
91df25739fSMilanka Ringwald 
92df25739fSMilanka Ringwald     *headerLen_ = headerLen;
93df25739fSMilanka Ringwald     return internal_CalculateFramelen(frame);
94df25739fSMilanka Ringwald }
95df25739fSMilanka Ringwald 
96df25739fSMilanka Ringwald 
97df25739fSMilanka Ringwald #define MIN(x, y)  ((x) < (y) ? (x) : (y))
98df25739fSMilanka Ringwald 
99df25739fSMilanka Ringwald 
100df25739fSMilanka Ringwald /*
101df25739fSMilanka Ringwald  * Computes the bit need for each sample and as also returns a counts of bit needs that are greater
102df25739fSMilanka Ringwald  * than one. This count is used in the first phase of bit allocation.
103df25739fSMilanka Ringwald  *
104df25739fSMilanka Ringwald  * We also compute a preferred bitpool value that this is the minimum bitpool needed to guarantee
105df25739fSMilanka Ringwald  * lossless representation of the audio data. The preferred bitpool may be larger than the bits
106df25739fSMilanka Ringwald  * actually required but the only input we have are the scale factors. For example, it takes 2 bits
107df25739fSMilanka Ringwald  * to represent values in the range -1 .. +1 but the scale factor is 0. To guarantee lossless
108df25739fSMilanka Ringwald  * representation we add 2 to each scale factor and sum them to come up with the preferred bitpool.
109df25739fSMilanka Ringwald  * This is not ideal because 0 requires 0 bits but we currently have no way of knowing this.
110df25739fSMilanka Ringwald  *
111df25739fSMilanka Ringwald  * @param bitneed       Array to return bitneeds for each subband
112df25739fSMilanka Ringwald  *
113df25739fSMilanka Ringwald  * @param ch            Channel 0 or 1
114df25739fSMilanka Ringwald  *
115df25739fSMilanka Ringwald  * @param preferredBitpool  Returns the number of reserved bits
116df25739fSMilanka Ringwald  *
117df25739fSMilanka Ringwald  * @return              The SBC bit need
118df25739fSMilanka Ringwald  *
119df25739fSMilanka Ringwald  */
computeBitneed(OI_CODEC_SBC_COMMON_CONTEXT * common,OI_UINT8 * bitneeds,OI_UINT ch,OI_UINT * preferredBitpool)120df25739fSMilanka Ringwald OI_UINT computeBitneed(OI_CODEC_SBC_COMMON_CONTEXT *common,
121df25739fSMilanka Ringwald                               OI_UINT8 *bitneeds,
122df25739fSMilanka Ringwald                               OI_UINT ch,
123df25739fSMilanka Ringwald                               OI_UINT *preferredBitpool)
124df25739fSMilanka Ringwald {
125df25739fSMilanka Ringwald     static const OI_INT8 offset4[4][4] = {
126df25739fSMilanka Ringwald         { -1, 0, 0, 0 },
127df25739fSMilanka Ringwald         { -2, 0, 0, 1 },
128df25739fSMilanka Ringwald         { -2, 0, 0, 1 },
129df25739fSMilanka Ringwald         { -2, 0, 0, 1 }
130df25739fSMilanka Ringwald     };
131df25739fSMilanka Ringwald 
132df25739fSMilanka Ringwald     static const OI_INT8 offset8[4][8] = {
133df25739fSMilanka Ringwald         { -2, 0, 0, 0, 0, 0, 0, 1 },
134df25739fSMilanka Ringwald         { -3, 0, 0, 0, 0, 0, 1, 2 },
135df25739fSMilanka Ringwald         { -4, 0, 0, 0, 0, 0, 1, 2 },
136df25739fSMilanka Ringwald         { -4, 0, 0, 0, 0, 0, 1, 2 }
137df25739fSMilanka Ringwald     };
138df25739fSMilanka Ringwald 
139df25739fSMilanka Ringwald     const OI_UINT nrof_subbands = common->frameInfo.nrof_subbands;
140df25739fSMilanka Ringwald     OI_UINT sb;
141df25739fSMilanka Ringwald     OI_INT8 *scale_factor = &common->scale_factor[ch ? nrof_subbands : 0];
142df25739fSMilanka Ringwald     OI_UINT bitcount = 0;
143df25739fSMilanka Ringwald     OI_UINT8 maxBits = 0;
144df25739fSMilanka Ringwald     OI_UINT8 prefBits = 0;
145df25739fSMilanka Ringwald 
146df25739fSMilanka Ringwald     if (common->frameInfo.alloc == SBC_SNR) {
147df25739fSMilanka Ringwald         for (sb = 0; sb < nrof_subbands; sb++) {
148df25739fSMilanka Ringwald             OI_INT bits = scale_factor[sb];
149df25739fSMilanka Ringwald             if (bits > maxBits) {
150df25739fSMilanka Ringwald                 maxBits = bits;
151df25739fSMilanka Ringwald             }
152df25739fSMilanka Ringwald             if ((bitneeds[sb] = bits) > 1) {
153df25739fSMilanka Ringwald                 bitcount += bits;
154df25739fSMilanka Ringwald             }
155df25739fSMilanka Ringwald             prefBits += 2 + bits;
156df25739fSMilanka Ringwald         }
157df25739fSMilanka Ringwald     } else {
158df25739fSMilanka Ringwald         const OI_INT8 *offset;
159df25739fSMilanka Ringwald         if (nrof_subbands == 4) {
160df25739fSMilanka Ringwald             offset = offset4[common->frameInfo.freqIndex];
161df25739fSMilanka Ringwald         } else {
162df25739fSMilanka Ringwald             offset = offset8[common->frameInfo.freqIndex];
163df25739fSMilanka Ringwald         }
164df25739fSMilanka Ringwald         for (sb = 0; sb < nrof_subbands; sb++) {
165df25739fSMilanka Ringwald             OI_INT bits = scale_factor[sb];
166df25739fSMilanka Ringwald             if (bits > maxBits) {
167df25739fSMilanka Ringwald                 maxBits = bits;
168df25739fSMilanka Ringwald             }
169df25739fSMilanka Ringwald             prefBits += 2 + bits;
170df25739fSMilanka Ringwald             if (bits) {
171df25739fSMilanka Ringwald                 bits -= offset[sb];
172df25739fSMilanka Ringwald                 if (bits > 0) {
173df25739fSMilanka Ringwald                     bits /= 2;
174df25739fSMilanka Ringwald                 }
175df25739fSMilanka Ringwald                 bits += 5;
176df25739fSMilanka Ringwald             }
177df25739fSMilanka Ringwald             if ((bitneeds[sb] = bits) > 1) {
178df25739fSMilanka Ringwald                 bitcount += bits;
179df25739fSMilanka Ringwald             }
180df25739fSMilanka Ringwald         }
181df25739fSMilanka Ringwald     }
182df25739fSMilanka Ringwald     common->maxBitneed = OI_MAX(maxBits, common->maxBitneed);
183df25739fSMilanka Ringwald     *preferredBitpool += prefBits;
184df25739fSMilanka Ringwald     return bitcount;
185df25739fSMilanka Ringwald }
186df25739fSMilanka Ringwald 
187df25739fSMilanka Ringwald 
188df25739fSMilanka Ringwald /*
189df25739fSMilanka Ringwald  * Explanation of the adjustToFitBitpool inner loop.
190df25739fSMilanka Ringwald  *
191df25739fSMilanka Ringwald  * The inner loop computes the effect of adjusting the bit allocation up or
192df25739fSMilanka Ringwald  * down. Allocations must be 0 or in the range 2..16. This is accomplished by
193df25739fSMilanka Ringwald  * the following code:
194df25739fSMilanka Ringwald  *
195df25739fSMilanka Ringwald  *           for (s = bands - 1; s >= 0; --s) {
196df25739fSMilanka Ringwald  *              OI_INT bits = bitadjust + bitneeds[s];
197df25739fSMilanka Ringwald  *              bits = bits < 2 ? 0 : bits;
198df25739fSMilanka Ringwald  *              bits = bits > 16 ? 16 : bits;
199df25739fSMilanka Ringwald  *              count += bits;
200df25739fSMilanka Ringwald  *          }
201df25739fSMilanka Ringwald  *
202df25739fSMilanka Ringwald  * This loop can be optimized to perform 4 operations at a time as follows:
203df25739fSMilanka Ringwald  *
204df25739fSMilanka Ringwald  * Adjustment is computed as a 7 bit signed value and added to the bitneed.
205df25739fSMilanka Ringwald  *
206df25739fSMilanka Ringwald  * Negative allocations are zeroed by masking. (n & 0x40) >> 6 puts the
207df25739fSMilanka Ringwald  * sign bit into bit 0, adding this to 0x7F give us a mask of 0x80
208df25739fSMilanka Ringwald  * for -ve values and 0x7F for +ve values.
209df25739fSMilanka Ringwald  *
210df25739fSMilanka Ringwald  * n &= 0x7F + (n & 0x40) >> 6)
211df25739fSMilanka Ringwald  *
212df25739fSMilanka Ringwald  * Allocations greater than 16 are truncated to 16. Adjusted allocations are in
213df25739fSMilanka Ringwald  * the range 0..31 so we know that bit 4 indicates values >= 16. We use this bit
214df25739fSMilanka Ringwald  * to create a mask that zeroes bits 0 .. 3 if bit 4 is set.
215df25739fSMilanka Ringwald  *
216df25739fSMilanka Ringwald  * n &= (15 + (n >> 4))
217df25739fSMilanka Ringwald  *
218df25739fSMilanka Ringwald  * Allocations of 1 are disallowed. Add and shift creates a mask that
219df25739fSMilanka Ringwald  * eliminates the illegal value
220df25739fSMilanka Ringwald  *
221df25739fSMilanka Ringwald  * n &= ((n + 14) >> 4) | 0x1E
222df25739fSMilanka Ringwald  *
223df25739fSMilanka Ringwald  * These operations can be performed in 8 bits without overflowing so we can
224df25739fSMilanka Ringwald  * operate on 4 values at once.
225df25739fSMilanka Ringwald  */
226df25739fSMilanka Ringwald 
227df25739fSMilanka Ringwald 
228df25739fSMilanka Ringwald /*
229df25739fSMilanka Ringwald  * Encoder/Decoder
230df25739fSMilanka Ringwald  *
231df25739fSMilanka Ringwald  * Computes adjustment +/- of bitneeds to fill bitpool and returns overall
232df25739fSMilanka Ringwald  * adjustment and excess bits.
233df25739fSMilanka Ringwald  *
234df25739fSMilanka Ringwald  * @param bitpool   The bitpool we have to work within
235df25739fSMilanka Ringwald  *
236df25739fSMilanka Ringwald  * @param bitneeds  An array of bit needs (more acturately allocation prioritities) for each
237df25739fSMilanka Ringwald  *                  subband across all blocks in the SBC frame
238df25739fSMilanka Ringwald  *
239df25739fSMilanka Ringwald  * @param subbands  The number of subbands over which the adkustment is calculated. For mono and
240df25739fSMilanka Ringwald  *                  dual mode this is 4 or 8, for stereo or joint stereo this is 8 or 16.
241df25739fSMilanka Ringwald  *
242df25739fSMilanka Ringwald  * @param bitcount  A starting point for the adjustment
243df25739fSMilanka Ringwald  *
244df25739fSMilanka Ringwald  * @param excess    Returns the excess bits after the adjustment
245df25739fSMilanka Ringwald  *
246df25739fSMilanka Ringwald  * @return   The adjustment.
247df25739fSMilanka Ringwald  */
adjustToFitBitpool(const OI_UINT bitpool,OI_UINT32 * bitneeds,const OI_UINT subbands,OI_UINT bitcount,OI_UINT * excess)248df25739fSMilanka Ringwald OI_INT adjustToFitBitpool(const OI_UINT bitpool,
249df25739fSMilanka Ringwald                                  OI_UINT32 *bitneeds,
250df25739fSMilanka Ringwald                                  const OI_UINT subbands,
251df25739fSMilanka Ringwald                                  OI_UINT bitcount,
252df25739fSMilanka Ringwald                                  OI_UINT *excess)
253df25739fSMilanka Ringwald {
254df25739fSMilanka Ringwald     OI_INT maxBitadjust = 0;
255df25739fSMilanka Ringwald     OI_INT bitadjust = (bitcount > bitpool) ? -8 : 8;
256df25739fSMilanka Ringwald     OI_INT chop = 8;
257df25739fSMilanka Ringwald 
258df25739fSMilanka Ringwald     /*
259df25739fSMilanka Ringwald      * This is essentially a binary search for the optimal adjustment value.
260df25739fSMilanka Ringwald      */
261df25739fSMilanka Ringwald     while ((bitcount != bitpool) && chop) {
262df25739fSMilanka Ringwald         OI_UINT32 total = 0;
263df25739fSMilanka Ringwald         OI_UINT count;
264df25739fSMilanka Ringwald         OI_UINT32 adjust4;
265df25739fSMilanka Ringwald         OI_INT i;
266df25739fSMilanka Ringwald 
267df25739fSMilanka Ringwald         adjust4 = bitadjust & 0x7F;
268df25739fSMilanka Ringwald         adjust4 |= (adjust4 << 8);
269df25739fSMilanka Ringwald         adjust4 |= (adjust4 << 16);
270df25739fSMilanka Ringwald 
271c1ab6cc1SMatthias Ringwald         for (i = ((subbands / 4) - 1); i >= 0; --i) {
272df25739fSMilanka Ringwald             OI_UINT32 mask;
273df25739fSMilanka Ringwald             OI_UINT32 n = bitneeds[i] + adjust4;
274df25739fSMilanka Ringwald             mask = 0x7F7F7F7F + ((n & 0x40404040) >> 6);
275df25739fSMilanka Ringwald             n &= mask;
276df25739fSMilanka Ringwald             mask = 0x0F0F0F0F + ((n & 0x10101010) >> 4);
277df25739fSMilanka Ringwald             n &= mask;
278df25739fSMilanka Ringwald             mask = (((n + 0x0E0E0E0E) >> 4) | 0x1E1E1E1E);
279df25739fSMilanka Ringwald             n &= mask;
280df25739fSMilanka Ringwald             total += n;
281df25739fSMilanka Ringwald         }
282df25739fSMilanka Ringwald 
283df25739fSMilanka Ringwald         count = (total & 0xFFFF) + (total >> 16);
284df25739fSMilanka Ringwald         count = (count & 0xFF) + (count >> 8);
285df25739fSMilanka Ringwald 
286df25739fSMilanka Ringwald         chop >>= 1;
287df25739fSMilanka Ringwald         if (count > bitpool) {
288df25739fSMilanka Ringwald             bitadjust -= chop;
289df25739fSMilanka Ringwald         } else {
290df25739fSMilanka Ringwald             maxBitadjust = bitadjust;
291df25739fSMilanka Ringwald             bitcount = count;
292df25739fSMilanka Ringwald             bitadjust += chop;
293df25739fSMilanka Ringwald         }
294df25739fSMilanka Ringwald     }
295df25739fSMilanka Ringwald 
296df25739fSMilanka Ringwald     *excess = bitpool - bitcount;
297df25739fSMilanka Ringwald 
298df25739fSMilanka Ringwald     return maxBitadjust;
299df25739fSMilanka Ringwald }
300df25739fSMilanka Ringwald 
301df25739fSMilanka Ringwald 
302df25739fSMilanka Ringwald /*
303df25739fSMilanka Ringwald  * The bit allocator trys to avoid single bit allocations except as a last resort. So in the case
304df25739fSMilanka Ringwald  * where a bitneed of 1 was passed over during the adsjustment phase 2 bits are now allocated.
305df25739fSMilanka Ringwald  */
allocAdjustedBits(OI_UINT8 * dest,OI_INT bits,OI_INT excess)306df25739fSMilanka Ringwald INLINE OI_INT allocAdjustedBits(OI_UINT8 *dest,
307df25739fSMilanka Ringwald                                 OI_INT bits,
308df25739fSMilanka Ringwald                                 OI_INT excess)
309df25739fSMilanka Ringwald {
310df25739fSMilanka Ringwald     if (bits < 16) {
311df25739fSMilanka Ringwald         if (bits > 1) {
312df25739fSMilanka Ringwald             if (excess) {
313df25739fSMilanka Ringwald                 ++bits;
314df25739fSMilanka Ringwald                 --excess;
315df25739fSMilanka Ringwald             }
316df25739fSMilanka Ringwald         } else if ((bits == 1) && (excess > 1)) {
317df25739fSMilanka Ringwald             bits = 2;
318df25739fSMilanka Ringwald             excess -= 2;
319df25739fSMilanka Ringwald         } else {
320df25739fSMilanka Ringwald             bits  = 0;
321df25739fSMilanka Ringwald         }
322df25739fSMilanka Ringwald     } else {
323df25739fSMilanka Ringwald         bits = 16;
324df25739fSMilanka Ringwald     }
325df25739fSMilanka Ringwald     *dest = (OI_UINT8)bits;
326df25739fSMilanka Ringwald     return excess;
327df25739fSMilanka Ringwald }
328df25739fSMilanka Ringwald 
329df25739fSMilanka Ringwald 
330df25739fSMilanka Ringwald /*
331df25739fSMilanka Ringwald  * Excess bits not allocated by allocaAdjustedBits are allocated round-robin.
332df25739fSMilanka Ringwald  */
allocExcessBits(OI_UINT8 * dest,OI_INT excess)333df25739fSMilanka Ringwald INLINE OI_INT allocExcessBits(OI_UINT8 *dest,
334df25739fSMilanka Ringwald                               OI_INT excess)
335df25739fSMilanka Ringwald {
336df25739fSMilanka Ringwald     if (*dest < 16) {
337df25739fSMilanka Ringwald         *dest += 1;
338df25739fSMilanka Ringwald         return excess - 1;
339df25739fSMilanka Ringwald     } else {
340df25739fSMilanka Ringwald         return excess;
341df25739fSMilanka Ringwald     }
342df25739fSMilanka Ringwald }
343df25739fSMilanka Ringwald 
oneChannelBitAllocation(OI_CODEC_SBC_COMMON_CONTEXT * common,BITNEED_UNION1 * bitneeds,OI_UINT ch,OI_UINT bitcount)344df25739fSMilanka Ringwald void oneChannelBitAllocation(OI_CODEC_SBC_COMMON_CONTEXT *common,
345df25739fSMilanka Ringwald                                     BITNEED_UNION1 *bitneeds,
346df25739fSMilanka Ringwald                                     OI_UINT ch,
347df25739fSMilanka Ringwald                                     OI_UINT bitcount)
348df25739fSMilanka Ringwald {
349df25739fSMilanka Ringwald     const OI_UINT8 nrof_subbands = common->frameInfo.nrof_subbands;
350df25739fSMilanka Ringwald     OI_UINT excess;
351df25739fSMilanka Ringwald     OI_UINT sb;
352df25739fSMilanka Ringwald     OI_INT bitadjust;
353df25739fSMilanka Ringwald     OI_UINT8 RESTRICT *allocBits;
354df25739fSMilanka Ringwald 
355df25739fSMilanka Ringwald 
356df25739fSMilanka Ringwald     {
357df25739fSMilanka Ringwald         OI_UINT ex;
358df25739fSMilanka Ringwald         bitadjust = adjustToFitBitpool(common->frameInfo.bitpool, bitneeds->uint32, nrof_subbands, bitcount, &ex);
359df25739fSMilanka Ringwald         /* We want the compiler to put excess into a register */
360df25739fSMilanka Ringwald         excess = ex;
361df25739fSMilanka Ringwald     }
362df25739fSMilanka Ringwald 
363df25739fSMilanka Ringwald     /*
364df25739fSMilanka Ringwald      * Allocate adjusted bits
365df25739fSMilanka Ringwald      */
366df25739fSMilanka Ringwald     allocBits = &common->bits.uint8[ch ? nrof_subbands : 0];
367df25739fSMilanka Ringwald 
368df25739fSMilanka Ringwald     sb = 0;
369df25739fSMilanka Ringwald     while (sb < nrof_subbands) {
370df25739fSMilanka Ringwald         excess = allocAdjustedBits(&allocBits[sb], bitneeds->uint8[sb] + bitadjust, excess);
371df25739fSMilanka Ringwald         ++sb;
372df25739fSMilanka Ringwald     }
373df25739fSMilanka Ringwald     sb = 0;
374df25739fSMilanka Ringwald     while (excess) {
375df25739fSMilanka Ringwald         excess = allocExcessBits(&allocBits[sb], excess);
376df25739fSMilanka Ringwald         ++sb;
377df25739fSMilanka Ringwald     }
378df25739fSMilanka Ringwald }
379df25739fSMilanka Ringwald 
380df25739fSMilanka Ringwald 
monoBitAllocation(OI_CODEC_SBC_COMMON_CONTEXT * common)381df25739fSMilanka Ringwald void monoBitAllocation(OI_CODEC_SBC_COMMON_CONTEXT *common)
382df25739fSMilanka Ringwald {
383df25739fSMilanka Ringwald     BITNEED_UNION1 bitneeds;
384df25739fSMilanka Ringwald     OI_UINT bitcount;
385df25739fSMilanka Ringwald     OI_UINT bitpoolPreference = 0;
386df25739fSMilanka Ringwald 
387df25739fSMilanka Ringwald     bitcount = computeBitneed(common, bitneeds.uint8, 0, &bitpoolPreference);
388df25739fSMilanka Ringwald 
389df25739fSMilanka Ringwald     oneChannelBitAllocation(common, &bitneeds, 0, bitcount);
390df25739fSMilanka Ringwald }
391df25739fSMilanka Ringwald 
392df25739fSMilanka Ringwald /**
393df25739fSMilanka Ringwald @}
394df25739fSMilanka Ringwald */
395