102 lines
3.2 KiB
C
102 lines
3.2 KiB
C
|
/* Copyright (c) 2007-2008 CSIRO
|
||
|
|
Copyright (c) 2007-2009 Xiph.Org Foundation
|
||
|
|
Written by Jean-Marc Valin */
|
||
|
|
/*
|
||
|
|
Redistribution and use in source and binary forms, with or without
|
||
|
|
modification, are permitted provided that the following conditions
|
||
|
|
are met:
|
||
|
|
|
||
|
|
- Redistributions of source code must retain the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer.
|
||
|
|
|
||
|
|
- Redistributions in binary form must reproduce the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer in the
|
||
|
|
documentation and/or other materials provided with the distribution.
|
||
|
|
|
||
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
||
|
|
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
||
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
||
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
||
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef RATE_H
|
||
|
|
#define RATE_H
|
||
|
|
|
||
|
|
#define MAX_PSEUDO 40
|
||
|
|
#define LOG_MAX_PSEUDO 6
|
||
|
|
|
||
|
|
#define CELT_MAX_PULSES 128
|
||
|
|
|
||
|
|
#define MAX_FINE_BITS 8
|
||
|
|
|
||
|
|
#define FINE_OFFSET 21
|
||
|
|
#define QTHETA_OFFSET 4
|
||
|
|
#define QTHETA_OFFSET_TWOPHASE 16
|
||
|
|
|
||
|
|
#include "cwrs.h"
|
||
|
|
#include "modes.h"
|
||
|
|
|
||
|
|
void compute_pulse_cache(CELTMode *m, int LM);
|
||
|
|
|
||
|
|
static OPUS_INLINE int get_pulses(int i)
|
||
|
|
{
|
||
|
|
return i<8 ? i : (8 + (i&7)) << ((i>>3)-1);
|
||
|
|
}
|
||
|
|
|
||
|
|
static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
int lo, hi;
|
||
|
|
const unsigned char *cache;
|
||
|
|
|
||
|
|
LM++;
|
||
|
|
cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
|
||
|
|
|
||
|
|
lo = 0;
|
||
|
|
hi = cache[0];
|
||
|
|
bits--;
|
||
|
|
for (i=0;i<LOG_MAX_PSEUDO;i++)
|
||
|
|
{
|
||
|
|
int mid = (lo+hi+1)>>1;
|
||
|
|
/* OPT: Make sure this is implemented with a conditional move */
|
||
|
|
if ((int)cache[mid] >= bits)
|
||
|
|
hi = mid;
|
||
|
|
else
|
||
|
|
lo = mid;
|
||
|
|
}
|
||
|
|
if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
|
||
|
|
return lo;
|
||
|
|
else
|
||
|
|
return hi;
|
||
|
|
}
|
||
|
|
|
||
|
|
static OPUS_INLINE int pulses2bits(const CELTMode *m, int band, int LM, int pulses)
|
||
|
|
{
|
||
|
|
const unsigned char *cache;
|
||
|
|
|
||
|
|
LM++;
|
||
|
|
cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
|
||
|
|
return pulses == 0 ? 0 : cache[pulses]+1;
|
||
|
|
}
|
||
|
|
|
||
|
|
/** Compute the pulse allocation, i.e. how many pulses will go in each
|
||
|
|
* band.
|
||
|
|
@param m mode
|
||
|
|
@param offsets Requested increase or decrease in the number of bits for
|
||
|
|
each band
|
||
|
|
@param total Number of bands
|
||
|
|
@param pulses Number of pulses per band (returned)
|
||
|
|
@return Total number of bits allocated
|
||
|
|
*/
|
||
|
|
int compute_allocation(const CELTMode *m, int start, int end, const int *offsets, const int *cap, int alloc_trim, int *intensity, int *dual_stero,
|
||
|
|
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);
|
||
|
|
|
||
|
|
#endif
|