apps/codecs/libtremor/ffmpeg_stuff.h

   1 /**
   2  * @file
   3  * Common code for Vorbis I encoder and decoder
   4  * @author Denes Balatoni  ( dbalatoni programozo hu )
   5  *
   6  * This file is part of FFmpeg.
   7  *
   8  * FFmpeg is free software; you can redistribute it and/or
   9  * modify it under the terms of the GNU Lesser General Public
  10  * License as published by the Free Software Foundation; either
  11  * version 2.1 of the License, or (at your option) any later version.
  12  *
  13  * FFmpeg is distributed in the hope that it will be useful,
  14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  16  * Lesser General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU Lesser General Public
  19  * License along with FFmpeg; if not, write to the Free Software
  20  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21  */
  22
  23 /* render_line and friend taken from ffmpeg (libavcodec/vorbis.c) */
  24
  25 #include "misc.h"
  26
  27 static inline void render_line_unrolled(int x, int y, int x1,
  28                                         int sy, int ady, int adx,
  29                                         const ogg_int32_t *lookup, ogg_int32_t *buf)
  30 {
  31     int err = -adx;
  32     x -= x1 - 1;
  33     buf += x1 - 1;
  34     while (++x < 0) {
  35         err += ady;
  36         if (err >= 0) {
  37             err += ady - adx;
  38             y   += sy;
  39             buf[x] = MULT31_SHIFT15(buf[x],lookup[y]);
  40             x++;
  41         }
  42         buf[x] = MULT31_SHIFT15(buf[x],lookup[y]);
  43     }
  44     if (x <= 0) {
  45         if (err + ady >= 0)
  46             y += sy;
  47         buf[x] = MULT31_SHIFT15(buf[x],lookup[y]);
  48     }
  49 }
  50
  51 static inline void render_line(int x0, int y0, int x1, int y1,
  52                                const ogg_int32_t *lookup, ogg_int32_t *buf)
  53 {
  54     int dy  = y1 - y0;
  55     int adx = x1 - x0;
  56     int ady = abs(dy);
  57     int sy  = dy < 0 ? -1 : 1;
  58     buf[x0] = MULT31_SHIFT15(buf[x0],lookup[y0]);
  59     if (ady*2 <= adx) { // optimized common case
  60         render_line_unrolled(x0, y0, x1, sy, ady, adx, lookup, buf);
  61     } else {
  62         int base = dy / adx;
  63         int x    = x0;
  64         int y    = y0;
  65         int err  = -adx;
  66         ady -= abs(base) * adx;
  67         while (++x < x1) {
  68             y += base;
  69             err += ady;
  70             if (err >= 0) {
  71                 err -= adx;
  72                 y   += sy;
  73             }
  74             buf[x] = MULT31_SHIFT15(buf[x],lookup[y]);
  75         }
  76     }
  77 }
  78
  79 #ifndef INCL_OPTIMIZED_VECTOR_FMUL_WINDOW
  80 #define INCL_OPTIMIZED_VECTOR_FMUL_WINDOW
  81 static inline void ff_vector_fmul_window_c(ogg_int32_t *dst, const ogg_int32_t *src0,
  82                                            const ogg_int32_t *src1, const ogg_int32_t *win, int len){
  83     int i,j;
  84     dst += len;
  85     win += len;
  86     src0+= len;
  87     for(i=-len, j=len-1; i<0; i++, j--) {
  88         ogg_int32_t s0 = src0[i];
  89         ogg_int32_t s1 = src1[j];
  90         ogg_int32_t wi = win[i];
  91         ogg_int32_t wj = win[j];
  92         XNPROD31(s0, s1, wj, wi, &dst[i], &dst[j]);
  93         /*
  94         dst[i] = MULT31(s0,wj) - MULT31(s1,wi);
  95         dst[j] = MULT31(s0,wi) + MULT31(s1,wj);
  96         */
  97     }
  98 }
  99 #endif
 100
 101 static inline void copy_normalize(ogg_int32_t *dst, ogg_int32_t *src, int len)
 102 {
 103     memcpy(dst, src, len * sizeof(ogg_int32_t));
 104 }
 105
 106 static inline void window_overlap_add(unsigned int blocksize, unsigned int lastblock,
 107                                       unsigned int bs0, unsigned int bs1, int ch,
 108                                       const ogg_int32_t *win, vorbis_dsp_state *v)
 109 {
 110     unsigned retlen = (blocksize + lastblock) / 4;
 111     int j;
 112     for (j = 0; j < ch; j++) {
 113         ogg_int32_t *residue = v->residues[v->ri] + j * blocksize / 2;
 114         ogg_int32_t   *saved = v->saved_ptr[j];
 115         ogg_int32_t     *ret = v->floors + j * retlen;
 116         ogg_int32_t     *buf = residue;
 117
 118         if (v->W == v->lW) {
 119             ff_vector_fmul_window_c(ret, saved, buf, win, blocksize / 4);
 120         } else if (v->W > v->lW) {
 121             ff_vector_fmul_window_c(ret, saved, buf, win, bs0 / 4);
 122             copy_normalize(ret+bs0/2, buf+bs0/4, (bs1-bs0)/4);
 123         } else {
 124             copy_normalize(ret, saved, (bs1 - bs0) / 4);
 125             ff_vector_fmul_window_c(ret + (bs1 - bs0) / 4, saved + (bs1 - bs0) / 4, buf, win, bs0 / 4);
 126         }
 127         if (v->residues[1] == NULL) {
 128             memcpy(saved, buf + blocksize / 4, blocksize / 4 * sizeof(ogg_int32_t));
 129             v->saved_ptr[j] = v->saved + j * bs1 / 4;
 130         } else {
 131             v->saved_ptr[j] = buf + blocksize / 4;
 132         }
 133
 134         v->pcmb[j] = ret;
 135     }
 136
 137     if (v->residues[1] != NULL) {
 138       v->ri ^= 1;
 139     }
 140 }