1*a58d3d2aSXin Li /* Copyright (c) 2007-2008 CSIRO
2*a58d3d2aSXin Li Copyright (c) 2007-2009 Xiph.Org Foundation
3*a58d3d2aSXin Li Written by Jean-Marc Valin */
4*a58d3d2aSXin Li /*
5*a58d3d2aSXin Li Redistribution and use in source and binary forms, with or without
6*a58d3d2aSXin Li modification, are permitted provided that the following conditions
7*a58d3d2aSXin Li are met:
8*a58d3d2aSXin Li
9*a58d3d2aSXin Li - Redistributions of source code must retain the above copyright
10*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer.
11*a58d3d2aSXin Li
12*a58d3d2aSXin Li - Redistributions in binary form must reproduce the above copyright
13*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer in the
14*a58d3d2aSXin Li documentation and/or other materials provided with the distribution.
15*a58d3d2aSXin Li
16*a58d3d2aSXin Li THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17*a58d3d2aSXin Li ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18*a58d3d2aSXin Li LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19*a58d3d2aSXin Li A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
20*a58d3d2aSXin Li OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
21*a58d3d2aSXin Li EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22*a58d3d2aSXin Li PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
23*a58d3d2aSXin Li PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
24*a58d3d2aSXin Li LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
25*a58d3d2aSXin Li NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
26*a58d3d2aSXin Li SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27*a58d3d2aSXin Li */
28*a58d3d2aSXin Li
29*a58d3d2aSXin Li #ifndef RATE_H
30*a58d3d2aSXin Li #define RATE_H
31*a58d3d2aSXin Li
32*a58d3d2aSXin Li #define MAX_PSEUDO 40
33*a58d3d2aSXin Li #define LOG_MAX_PSEUDO 6
34*a58d3d2aSXin Li
35*a58d3d2aSXin Li #define CELT_MAX_PULSES 128
36*a58d3d2aSXin Li
37*a58d3d2aSXin Li #define MAX_FINE_BITS 8
38*a58d3d2aSXin Li
39*a58d3d2aSXin Li #define FINE_OFFSET 21
40*a58d3d2aSXin Li #define QTHETA_OFFSET 4
41*a58d3d2aSXin Li #define QTHETA_OFFSET_TWOPHASE 16
42*a58d3d2aSXin Li
43*a58d3d2aSXin Li #include "cwrs.h"
44*a58d3d2aSXin Li #include "modes.h"
45*a58d3d2aSXin Li
46*a58d3d2aSXin Li void compute_pulse_cache(CELTMode *m, int LM);
47*a58d3d2aSXin Li
get_pulses(int i)48*a58d3d2aSXin Li static OPUS_INLINE int get_pulses(int i)
49*a58d3d2aSXin Li {
50*a58d3d2aSXin Li return i<8 ? i : (8 + (i&7)) << ((i>>3)-1);
51*a58d3d2aSXin Li }
52*a58d3d2aSXin Li
bits2pulses(const CELTMode * m,int band,int LM,int bits)53*a58d3d2aSXin Li static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits)
54*a58d3d2aSXin Li {
55*a58d3d2aSXin Li int i;
56*a58d3d2aSXin Li int lo, hi;
57*a58d3d2aSXin Li const unsigned char *cache;
58*a58d3d2aSXin Li
59*a58d3d2aSXin Li LM++;
60*a58d3d2aSXin Li cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
61*a58d3d2aSXin Li
62*a58d3d2aSXin Li lo = 0;
63*a58d3d2aSXin Li hi = cache[0];
64*a58d3d2aSXin Li bits--;
65*a58d3d2aSXin Li for (i=0;i<LOG_MAX_PSEUDO;i++)
66*a58d3d2aSXin Li {
67*a58d3d2aSXin Li int mid = (lo+hi+1)>>1;
68*a58d3d2aSXin Li /* OPT: Make sure this is implemented with a conditional move */
69*a58d3d2aSXin Li if ((int)cache[mid] >= bits)
70*a58d3d2aSXin Li hi = mid;
71*a58d3d2aSXin Li else
72*a58d3d2aSXin Li lo = mid;
73*a58d3d2aSXin Li }
74*a58d3d2aSXin Li if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
75*a58d3d2aSXin Li return lo;
76*a58d3d2aSXin Li else
77*a58d3d2aSXin Li return hi;
78*a58d3d2aSXin Li }
79*a58d3d2aSXin Li
pulses2bits(const CELTMode * m,int band,int LM,int pulses)80*a58d3d2aSXin Li static OPUS_INLINE int pulses2bits(const CELTMode *m, int band, int LM, int pulses)
81*a58d3d2aSXin Li {
82*a58d3d2aSXin Li const unsigned char *cache;
83*a58d3d2aSXin Li
84*a58d3d2aSXin Li LM++;
85*a58d3d2aSXin Li cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
86*a58d3d2aSXin Li return pulses == 0 ? 0 : cache[pulses]+1;
87*a58d3d2aSXin Li }
88*a58d3d2aSXin Li
89*a58d3d2aSXin Li /** Compute the pulse allocation, i.e. how many pulses will go in each
90*a58d3d2aSXin Li * band.
91*a58d3d2aSXin Li @param m mode
92*a58d3d2aSXin Li @param offsets Requested increase or decrease in the number of bits for
93*a58d3d2aSXin Li each band
94*a58d3d2aSXin Li @param total Number of bands
95*a58d3d2aSXin Li @param pulses Number of pulses per band (returned)
96*a58d3d2aSXin Li @return Total number of bits allocated
97*a58d3d2aSXin Li */
98*a58d3d2aSXin Li int clt_compute_allocation(const CELTMode *m, int start, int end, const int *offsets, const int *cap, int alloc_trim, int *intensity, int *dual_stereo,
99*a58d3d2aSXin Li opus_int32 total, opus_int32 *balance, int *pulses, int *ebits, int *fine_priority, int C, int LM, ec_ctx *ec, int encode, int prev, int signalBandwidth);
100*a58d3d2aSXin Li
101*a58d3d2aSXin Li #endif
102