media/libopus/silk/VQ_WMat_EC.c@ac0c01689b40 (annotated)
media/libopus/silk/VQ_WMat_EC.c
Thu, 15 Jan 2015 15:59:08 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 15 Jan 2015 15:59:08 +0100
- branch
- TOR_BUG_9701
- changeset 10
- ac0c01689b40
- permissions
- -rw-r--r--
Implement a real Private Browsing Mode condition by changing the API/ABI;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.
| michael@0 | 1 | /*********************************************************************** |
| michael@0 | 2 | Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| michael@0 | 3 | Redistribution and use in source and binary forms, with or without |
| michael@0 | 4 | modification, are permitted provided that the following conditions |
| michael@0 | 5 | are met: |
| michael@0 | 6 | - Redistributions of source code must retain the above copyright notice, |
| michael@0 | 7 | this list of conditions and the following disclaimer. |
| michael@0 | 8 | - Redistributions in binary form must reproduce the above copyright |
| michael@0 | 9 | notice, this list of conditions and the following disclaimer in the |
| michael@0 | 10 | documentation and/or other materials provided with the distribution. |
| michael@0 | 11 | - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| michael@0 | 12 | names of specific contributors, may be used to endorse or promote |
| michael@0 | 13 | products derived from this software without specific prior written |
| michael@0 | 14 | permission. |
| michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| michael@0 | 16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| michael@0 | 18 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| michael@0 | 19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| michael@0 | 20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| michael@0 | 21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| michael@0 | 22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| michael@0 | 23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| michael@0 | 24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| michael@0 | 25 | POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 26 | ***********************************************************************/ |
| michael@0 | 27 | |
| michael@0 | 28 | #ifdef HAVE_CONFIG_H |
| michael@0 | 29 | #include "config.h" |
| michael@0 | 30 | #endif |
| michael@0 | 31 | |
| michael@0 | 32 | #include "main.h" |
| michael@0 | 33 | |
| michael@0 | 34 | /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for a single input data vector */ |
| michael@0 | 35 | void silk_VQ_WMat_EC( |
| michael@0 | 36 | opus_int8 *ind, /* O index of best codebook vector */ |
| michael@0 | 37 | opus_int32 *rate_dist_Q14, /* O best weighted quant error + mu * rate */ |
| michael@0 | 38 | opus_int *gain_Q7, /* O sum of absolute LTP coefficients */ |
| michael@0 | 39 | const opus_int16 *in_Q14, /* I input vector to be quantized */ |
| michael@0 | 40 | const opus_int32 *W_Q18, /* I weighting matrix */ |
| michael@0 | 41 | const opus_int8 *cb_Q7, /* I codebook */ |
| michael@0 | 42 | const opus_uint8 *cb_gain_Q7, /* I codebook effective gain */ |
| michael@0 | 43 | const opus_uint8 *cl_Q5, /* I code length for each codebook vector */ |
| michael@0 | 44 | const opus_int mu_Q9, /* I tradeoff betw. weighted error and rate */ |
| michael@0 | 45 | const opus_int32 max_gain_Q7, /* I maximum sum of absolute LTP coefficients */ |
| michael@0 | 46 | opus_int L /* I number of vectors in codebook */ |
| michael@0 | 47 | ) |
| michael@0 | 48 | { |
| michael@0 | 49 | opus_int k, gain_tmp_Q7; |
| michael@0 | 50 | const opus_int8 *cb_row_Q7; |
| michael@0 | 51 | opus_int16 diff_Q14[ 5 ]; |
| michael@0 | 52 | opus_int32 sum1_Q14, sum2_Q16; |
| michael@0 | 53 | |
| michael@0 | 54 | /* Loop over codebook */ |
| michael@0 | 55 | *rate_dist_Q14 = silk_int32_MAX; |
| michael@0 | 56 | cb_row_Q7 = cb_Q7; |
| michael@0 | 57 | for( k = 0; k < L; k++ ) { |
| michael@0 | 58 | gain_tmp_Q7 = cb_gain_Q7[k]; |
| michael@0 | 59 | |
| michael@0 | 60 | diff_Q14[ 0 ] = in_Q14[ 0 ] - silk_LSHIFT( cb_row_Q7[ 0 ], 7 ); |
| michael@0 | 61 | diff_Q14[ 1 ] = in_Q14[ 1 ] - silk_LSHIFT( cb_row_Q7[ 1 ], 7 ); |
| michael@0 | 62 | diff_Q14[ 2 ] = in_Q14[ 2 ] - silk_LSHIFT( cb_row_Q7[ 2 ], 7 ); |
| michael@0 | 63 | diff_Q14[ 3 ] = in_Q14[ 3 ] - silk_LSHIFT( cb_row_Q7[ 3 ], 7 ); |
| michael@0 | 64 | diff_Q14[ 4 ] = in_Q14[ 4 ] - silk_LSHIFT( cb_row_Q7[ 4 ], 7 ); |
| michael@0 | 65 | |
| michael@0 | 66 | /* Weighted rate */ |
| michael@0 | 67 | sum1_Q14 = silk_SMULBB( mu_Q9, cl_Q5[ k ] ); |
| michael@0 | 68 | |
| michael@0 | 69 | /* Penalty for too large gain */ |
| michael@0 | 70 | sum1_Q14 = silk_ADD_LSHIFT32( sum1_Q14, silk_max( silk_SUB32( gain_tmp_Q7, max_gain_Q7 ), 0 ), 10 ); |
| michael@0 | 71 | |
| michael@0 | 72 | silk_assert( sum1_Q14 >= 0 ); |
| michael@0 | 73 | |
| michael@0 | 74 | /* first row of W_Q18 */ |
| michael@0 | 75 | sum2_Q16 = silk_SMULWB( W_Q18[ 1 ], diff_Q14[ 1 ] ); |
| michael@0 | 76 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 2 ], diff_Q14[ 2 ] ); |
| michael@0 | 77 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 3 ], diff_Q14[ 3 ] ); |
| michael@0 | 78 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 4 ], diff_Q14[ 4 ] ); |
| michael@0 | 79 | sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); |
| michael@0 | 80 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 0 ], diff_Q14[ 0 ] ); |
| michael@0 | 81 | sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 0 ] ); |
| michael@0 | 82 | |
| michael@0 | 83 | /* second row of W_Q18 */ |
| michael@0 | 84 | sum2_Q16 = silk_SMULWB( W_Q18[ 7 ], diff_Q14[ 2 ] ); |
| michael@0 | 85 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 8 ], diff_Q14[ 3 ] ); |
| michael@0 | 86 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 9 ], diff_Q14[ 4 ] ); |
| michael@0 | 87 | sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); |
| michael@0 | 88 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 6 ], diff_Q14[ 1 ] ); |
| michael@0 | 89 | sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 1 ] ); |
| michael@0 | 90 | |
| michael@0 | 91 | /* third row of W_Q18 */ |
| michael@0 | 92 | sum2_Q16 = silk_SMULWB( W_Q18[ 13 ], diff_Q14[ 3 ] ); |
| michael@0 | 93 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 14 ], diff_Q14[ 4 ] ); |
| michael@0 | 94 | sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); |
| michael@0 | 95 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 12 ], diff_Q14[ 2 ] ); |
| michael@0 | 96 | sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 2 ] ); |
| michael@0 | 97 | |
| michael@0 | 98 | /* fourth row of W_Q18 */ |
| michael@0 | 99 | sum2_Q16 = silk_SMULWB( W_Q18[ 19 ], diff_Q14[ 4 ] ); |
| michael@0 | 100 | sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); |
| michael@0 | 101 | sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 18 ], diff_Q14[ 3 ] ); |
| michael@0 | 102 | sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 3 ] ); |
| michael@0 | 103 | |
| michael@0 | 104 | /* last row of W_Q18 */ |
| michael@0 | 105 | sum2_Q16 = silk_SMULWB( W_Q18[ 24 ], diff_Q14[ 4 ] ); |
| michael@0 | 106 | sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 4 ] ); |
| michael@0 | 107 | |
| michael@0 | 108 | silk_assert( sum1_Q14 >= 0 ); |
| michael@0 | 109 | |
| michael@0 | 110 | /* find best */ |
| michael@0 | 111 | if( sum1_Q14 < *rate_dist_Q14 ) { |
| michael@0 | 112 | *rate_dist_Q14 = sum1_Q14; |
| michael@0 | 113 | *ind = (opus_int8)k; |
| michael@0 | 114 | *gain_Q7 = gain_tmp_Q7; |
| michael@0 | 115 | } |
| michael@0 | 116 | |
| michael@0 | 117 | /* Go to next cbk vector */ |
| michael@0 | 118 | cb_row_Q7 += LTP_ORDER; |
| michael@0 | 119 | } |
| michael@0 | 120 | } |
