The Tor Browser / annotate

media/libtremor/lib/tremor_floor1.c@b8a032363ba2 (annotated)

media/libtremor/lib/tremor_floor1.c

Thu, 22 Jan 2015 13:21:57 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Thu, 22 Jan 2015 13:21:57 +0100
branch
TOR_BUG_9701
changeset 15
b8a032363ba2
permissions
-rw-r--r--

Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6

michael@0 1 /********************************************************************
michael@0 2 * *
michael@0 3 * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. *
michael@0 4 * *
michael@0 5 * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
michael@0 6 * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
michael@0 7 * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
michael@0 8 * *
michael@0 9 * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2002 *
michael@0 10 * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ *
michael@0 11 * *
michael@0 12 ********************************************************************
michael@0 13
michael@0 14 function: floor backend 1 implementation
michael@0 15
michael@0 16 ********************************************************************/
michael@0 17
michael@0 18 #include <stdlib.h>
michael@0 19 #include <string.h>
michael@0 20 #include <math.h>
michael@0 21 #include <ogg/ogg.h>
michael@0 22 #include "ivorbiscodec.h"
michael@0 23 #include "codec_internal.h"
michael@0 24 #include "registry.h"
michael@0 25 #include "codebook.h"
michael@0 26 #include "misc.h"
michael@0 27 #include "block.h"
michael@0 28
michael@0 29 #define floor1_rangedB 140 /* floor 1 fixed at -140dB to 0dB range */
michael@0 30
michael@0 31 typedef struct {
michael@0 32 int forward_index[VIF_POSIT+2];
michael@0 33
michael@0 34 int hineighbor[VIF_POSIT];
michael@0 35 int loneighbor[VIF_POSIT];
michael@0 36 int posts;
michael@0 37
michael@0 38 int n;
michael@0 39 int quant_q;
michael@0 40 vorbis_info_floor1 *vi;
michael@0 41
michael@0 42 } vorbis_look_floor1;
michael@0 43
michael@0 44 /***********************************************/
michael@0 45
michael@0 46 static void floor1_free_info(vorbis_info_floor *i){
michael@0 47 vorbis_info_floor1 *info=(vorbis_info_floor1 *)i;
michael@0 48 if(info){
michael@0 49 memset(info,0,sizeof(*info));
michael@0 50 _ogg_free(info);
michael@0 51 }
michael@0 52 }
michael@0 53
michael@0 54 static void floor1_free_look(vorbis_look_floor *i){
michael@0 55 vorbis_look_floor1 *look=(vorbis_look_floor1 *)i;
michael@0 56 if(look){
michael@0 57 memset(look,0,sizeof(*look));
michael@0 58 _ogg_free(look);
michael@0 59 }
michael@0 60 }
michael@0 61
michael@0 62 static int ilog(unsigned int v){
michael@0 63 int ret=0;
michael@0 64 while(v){
michael@0 65 ret++;
michael@0 66 v>>=1;
michael@0 67 }
michael@0 68 return(ret);
michael@0 69 }
michael@0 70
michael@0 71 static int icomp(const void *a,const void *b){
michael@0 72 return(**(int **)a-**(int **)b);
michael@0 73 }
michael@0 74
michael@0 75 static vorbis_info_floor *floor1_unpack (vorbis_info *vi,oggpack_buffer *opb){
michael@0 76 codec_setup_info *ci=(codec_setup_info *)vi->codec_setup;
michael@0 77 int j,k,count=0,maxclass=-1,rangebits;
michael@0 78
michael@0 79 vorbis_info_floor1 *info=(vorbis_info_floor1 *)_ogg_calloc(1,sizeof(*info));
michael@0 80 /* read partitions */
michael@0 81 info->partitions=oggpack_read(opb,5); /* only 0 to 31 legal */
michael@0 82 for(j=0;j<info->partitions;j++){
michael@0 83 info->partitionclass[j]=oggpack_read(opb,4); /* only 0 to 15 legal */
michael@0 84 if(info->partitionclass[j]<0)goto err_out;
michael@0 85 if(maxclass<info->partitionclass[j])maxclass=info->partitionclass[j];
michael@0 86 }
michael@0 87
michael@0 88 /* read partition classes */
michael@0 89 for(j=0;j<maxclass+1;j++){
michael@0 90 info->class_dim[j]=oggpack_read(opb,3)+1; /* 1 to 8 */
michael@0 91 info->class_subs[j]=oggpack_read(opb,2); /* 0,1,2,3 bits */
michael@0 92 if(info->class_subs[j]<0)
michael@0 93 goto err_out;
michael@0 94 if(info->class_subs[j])info->class_book[j]=oggpack_read(opb,8);
michael@0 95 if(info->class_book[j]<0 || info->class_book[j]>=ci->books)
michael@0 96 goto err_out;
michael@0 97 for(k=0;k<(1<<info->class_subs[j]);k++){
michael@0 98 info->class_subbook[j][k]=oggpack_read(opb,8)-1;
michael@0 99 if(info->class_subbook[j][k]<-1 || info->class_subbook[j][k]>=ci->books)
michael@0 100 goto err_out;
michael@0 101 }
michael@0 102 }
michael@0 103
michael@0 104 /* read the post list */
michael@0 105 info->mult=oggpack_read(opb,2)+1; /* only 1,2,3,4 legal now */
michael@0 106 rangebits=oggpack_read(opb,4);
michael@0 107 if(rangebits<0)goto err_out;
michael@0 108
michael@0 109 for(j=0,k=0;j<info->partitions;j++){
michael@0 110 count+=info->class_dim[info->partitionclass[j]];
michael@0 111 if(count>VIF_POSIT)goto err_out;
michael@0 112 for(;k<count;k++){
michael@0 113 int t=info->postlist[k+2]=oggpack_read(opb,rangebits);
michael@0 114 if(t<0 || t>=(1<<rangebits))
michael@0 115 goto err_out;
michael@0 116 }
michael@0 117 }
michael@0 118 info->postlist[0]=0;
michael@0 119 info->postlist[1]=1<<rangebits;
michael@0 120
michael@0 121 /* don't allow repeated values in post list as they'd result in
michael@0 122 zero-length segments */
michael@0 123 {
michael@0 124 int *sortpointer[VIF_POSIT+2];
michael@0 125 for(j=0;j<count+2;j++)sortpointer[j]=info->postlist+j;
michael@0 126 qsort(sortpointer,count+2,sizeof(*sortpointer),icomp);
michael@0 127
michael@0 128 for(j=1;j<count+2;j++)
michael@0 129 if(*sortpointer[j-1]==*sortpointer[j])goto err_out;
michael@0 130 }
michael@0 131
michael@0 132 return(info);
michael@0 133
michael@0 134 err_out:
michael@0 135 floor1_free_info(info);
michael@0 136 return(NULL);
michael@0 137 }
michael@0 138
michael@0 139 static vorbis_look_floor *floor1_look(vorbis_dsp_state *vd,vorbis_info_mode *mi,
michael@0 140 vorbis_info_floor *in){
michael@0 141
michael@0 142 int *sortpointer[VIF_POSIT+2];
michael@0 143 vorbis_info_floor1 *info=(vorbis_info_floor1 *)in;
michael@0 144 vorbis_look_floor1 *look=(vorbis_look_floor1 *)_ogg_calloc(1,sizeof(*look));
michael@0 145 int i,j,n=0;
michael@0 146
michael@0 147 look->vi=info;
michael@0 148 look->n=info->postlist[1];
michael@0 149
michael@0 150 /* we drop each position value in-between already decoded values,
michael@0 151 and use linear interpolation to predict each new value past the
michael@0 152 edges. The positions are read in the order of the position
michael@0 153 list... we precompute the bounding positions in the lookup. Of
michael@0 154 course, the neighbors can change (if a position is declined), but
michael@0 155 this is an initial mapping */
michael@0 156
michael@0 157 for(i=0;i<info->partitions;i++)n+=info->class_dim[info->partitionclass[i]];
michael@0 158 n+=2;
michael@0 159 look->posts=n;
michael@0 160
michael@0 161 /* also store a sorted position index */
michael@0 162 for(i=0;i<n;i++)sortpointer[i]=info->postlist+i;
michael@0 163 qsort(sortpointer,n,sizeof(*sortpointer),icomp);
michael@0 164
michael@0 165 /* points from sort order back to range number */
michael@0 166 for(i=0;i<n;i++)look->forward_index[i]=sortpointer[i]-info->postlist;
michael@0 167
michael@0 168 /* quantize values to multiplier spec */
michael@0 169 switch(info->mult){
michael@0 170 case 1: /* 1024 -> 256 */
michael@0 171 look->quant_q=256;
michael@0 172 break;
michael@0 173 case 2: /* 1024 -> 128 */
michael@0 174 look->quant_q=128;
michael@0 175 break;
michael@0 176 case 3: /* 1024 -> 86 */
michael@0 177 look->quant_q=86;
michael@0 178 break;
michael@0 179 case 4: /* 1024 -> 64 */
michael@0 180 look->quant_q=64;
michael@0 181 break;
michael@0 182 }
michael@0 183
michael@0 184 /* discover our neighbors for decode where we don't use fit flags
michael@0 185 (that would push the neighbors outward) */
michael@0 186 for(i=0;i<n-2;i++){
michael@0 187 int lo=0;
michael@0 188 int hi=1;
michael@0 189 int lx=0;
michael@0 190 int hx=look->n;
michael@0 191 int currentx=info->postlist[i+2];
michael@0 192 for(j=0;j<i+2;j++){
michael@0 193 int x=info->postlist[j];
michael@0 194 if(x>lx && x<currentx){
michael@0 195 lo=j;
michael@0 196 lx=x;
michael@0 197 }
michael@0 198 if(x<hx && x>currentx){
michael@0 199 hi=j;
michael@0 200 hx=x;
michael@0 201 }
michael@0 202 }
michael@0 203 look->loneighbor[i]=lo;
michael@0 204 look->hineighbor[i]=hi;
michael@0 205 }
michael@0 206
michael@0 207 return(look);
michael@0 208 }
michael@0 209
michael@0 210 static int render_point(int x0,int x1,int y0,int y1,int x){
michael@0 211 y0&=0x7fff; /* mask off flag */
michael@0 212 y1&=0x7fff;
michael@0 213
michael@0 214 {
michael@0 215 int dy=y1-y0;
michael@0 216 int adx=x1-x0;
michael@0 217 int ady=abs(dy);
michael@0 218 int err=ady*(x-x0);
michael@0 219
michael@0 220 int off=err/adx;
michael@0 221 if(dy<0)return(y0-off);
michael@0 222 return(y0+off);
michael@0 223 }
michael@0 224 }
michael@0 225
michael@0 226 #ifdef _LOW_ACCURACY_
michael@0 227 # define XdB(n) ((((n)>>8)+1)>>1)
michael@0 228 #else
michael@0 229 # define XdB(n) (n)
michael@0 230 #endif
michael@0 231
michael@0 232 static const ogg_int32_t FLOOR_fromdB_LOOKUP[256]={
michael@0 233 XdB(0x000000e5), XdB(0x000000f4), XdB(0x00000103), XdB(0x00000114),
michael@0 234 XdB(0x00000126), XdB(0x00000139), XdB(0x0000014e), XdB(0x00000163),
michael@0 235 XdB(0x0000017a), XdB(0x00000193), XdB(0x000001ad), XdB(0x000001c9),
michael@0 236 XdB(0x000001e7), XdB(0x00000206), XdB(0x00000228), XdB(0x0000024c),
michael@0 237 XdB(0x00000272), XdB(0x0000029b), XdB(0x000002c6), XdB(0x000002f4),
michael@0 238 XdB(0x00000326), XdB(0x0000035a), XdB(0x00000392), XdB(0x000003cd),
michael@0 239 XdB(0x0000040c), XdB(0x00000450), XdB(0x00000497), XdB(0x000004e4),
michael@0 240 XdB(0x00000535), XdB(0x0000058c), XdB(0x000005e8), XdB(0x0000064a),
michael@0 241 XdB(0x000006b3), XdB(0x00000722), XdB(0x00000799), XdB(0x00000818),
michael@0 242 XdB(0x0000089e), XdB(0x0000092e), XdB(0x000009c6), XdB(0x00000a69),
michael@0 243 XdB(0x00000b16), XdB(0x00000bcf), XdB(0x00000c93), XdB(0x00000d64),
michael@0 244 XdB(0x00000e43), XdB(0x00000f30), XdB(0x0000102d), XdB(0x0000113a),
michael@0 245 XdB(0x00001258), XdB(0x0000138a), XdB(0x000014cf), XdB(0x00001629),
michael@0 246 XdB(0x0000179a), XdB(0x00001922), XdB(0x00001ac4), XdB(0x00001c82),
michael@0 247 XdB(0x00001e5c), XdB(0x00002055), XdB(0x0000226f), XdB(0x000024ac),
michael@0 248 XdB(0x0000270e), XdB(0x00002997), XdB(0x00002c4b), XdB(0x00002f2c),
michael@0 249 XdB(0x0000323d), XdB(0x00003581), XdB(0x000038fb), XdB(0x00003caf),
michael@0 250 XdB(0x000040a0), XdB(0x000044d3), XdB(0x0000494c), XdB(0x00004e10),
michael@0 251 XdB(0x00005323), XdB(0x0000588a), XdB(0x00005e4b), XdB(0x0000646b),
michael@0 252 XdB(0x00006af2), XdB(0x000071e5), XdB(0x0000794c), XdB(0x0000812e),
michael@0 253 XdB(0x00008993), XdB(0x00009283), XdB(0x00009c09), XdB(0x0000a62d),
michael@0 254 XdB(0x0000b0f9), XdB(0x0000bc79), XdB(0x0000c8b9), XdB(0x0000d5c4),
michael@0 255 XdB(0x0000e3a9), XdB(0x0000f274), XdB(0x00010235), XdB(0x000112fd),
michael@0 256 XdB(0x000124dc), XdB(0x000137e4), XdB(0x00014c29), XdB(0x000161bf),
michael@0 257 XdB(0x000178bc), XdB(0x00019137), XdB(0x0001ab4a), XdB(0x0001c70e),
michael@0 258 XdB(0x0001e4a1), XdB(0x0002041f), XdB(0x000225aa), XdB(0x00024962),
michael@0 259 XdB(0x00026f6d), XdB(0x000297f0), XdB(0x0002c316), XdB(0x0002f109),
michael@0 260 XdB(0x000321f9), XdB(0x00035616), XdB(0x00038d97), XdB(0x0003c8b4),
michael@0 261 XdB(0x000407a7), XdB(0x00044ab2), XdB(0x00049218), XdB(0x0004de23),
michael@0 262 XdB(0x00052f1e), XdB(0x0005855c), XdB(0x0005e135), XdB(0x00064306),
michael@0 263 XdB(0x0006ab33), XdB(0x00071a24), XdB(0x0007904b), XdB(0x00080e20),
michael@0 264 XdB(0x00089422), XdB(0x000922da), XdB(0x0009bad8), XdB(0x000a5cb6),
michael@0 265 XdB(0x000b091a), XdB(0x000bc0b1), XdB(0x000c8436), XdB(0x000d5471),
michael@0 266 XdB(0x000e3233), XdB(0x000f1e5f), XdB(0x001019e4), XdB(0x001125c1),
michael@0 267 XdB(0x00124306), XdB(0x001372d5), XdB(0x0014b663), XdB(0x00160ef7),
michael@0 268 XdB(0x00177df0), XdB(0x001904c1), XdB(0x001aa4f9), XdB(0x001c603d),
michael@0 269 XdB(0x001e384f), XdB(0x00202f0f), XdB(0x0022467a), XdB(0x002480b1),
michael@0 270 XdB(0x0026dff7), XdB(0x002966b3), XdB(0x002c1776), XdB(0x002ef4fc),
michael@0 271 XdB(0x0032022d), XdB(0x00354222), XdB(0x0038b828), XdB(0x003c67c2),
michael@0 272 XdB(0x004054ae), XdB(0x004482e8), XdB(0x0048f6af), XdB(0x004db488),
michael@0 273 XdB(0x0052c142), XdB(0x005821ff), XdB(0x005ddc33), XdB(0x0063f5b0),
michael@0 274 XdB(0x006a74a7), XdB(0x00715faf), XdB(0x0078bdce), XdB(0x0080967f),
michael@0 275 XdB(0x0088f1ba), XdB(0x0091d7f9), XdB(0x009b5247), XdB(0x00a56a41),
michael@0 276 XdB(0x00b02a27), XdB(0x00bb9ce2), XdB(0x00c7ce12), XdB(0x00d4ca17),
michael@0 277 XdB(0x00e29e20), XdB(0x00f15835), XdB(0x0101074b), XdB(0x0111bb4e),
michael@0 278 XdB(0x01238531), XdB(0x01367704), XdB(0x014aa402), XdB(0x016020a7),
michael@0 279 XdB(0x017702c3), XdB(0x018f6190), XdB(0x01a955cb), XdB(0x01c4f9cf),
michael@0 280 XdB(0x01e269a8), XdB(0x0201c33b), XdB(0x0223265a), XdB(0x0246b4ea),
michael@0 281 XdB(0x026c9302), XdB(0x0294e716), XdB(0x02bfda13), XdB(0x02ed9793),
michael@0 282 XdB(0x031e4e09), XdB(0x03522ee4), XdB(0x03896ed0), XdB(0x03c445e2),
michael@0 283 XdB(0x0402efd6), XdB(0x0445ac4b), XdB(0x048cbefc), XdB(0x04d87013),
michael@0 284 XdB(0x05290c67), XdB(0x057ee5ca), XdB(0x05da5364), XdB(0x063bb204),
michael@0 285 XdB(0x06a36485), XdB(0x0711d42b), XdB(0x0787710e), XdB(0x0804b299),
michael@0 286 XdB(0x088a17ef), XdB(0x0918287e), XdB(0x09af747c), XdB(0x0a50957e),
michael@0 287 XdB(0x0afc2f19), XdB(0x0bb2ef7f), XdB(0x0c759034), XdB(0x0d44d6ca),
michael@0 288 XdB(0x0e2195bc), XdB(0x0f0cad0d), XdB(0x10070b62), XdB(0x1111aeea),
michael@0 289 XdB(0x122da66c), XdB(0x135c120f), XdB(0x149e24d9), XdB(0x15f525b1),
michael@0 290 XdB(0x176270e3), XdB(0x18e7794b), XdB(0x1a85c9ae), XdB(0x1c3f06d1),
michael@0 291 XdB(0x1e14f07d), XdB(0x200963d7), XdB(0x221e5ccd), XdB(0x2455f870),
michael@0 292 XdB(0x26b2770b), XdB(0x29363e2b), XdB(0x2be3db5c), XdB(0x2ebe06b6),
michael@0 293 XdB(0x31c7a55b), XdB(0x3503ccd4), XdB(0x3875c5aa), XdB(0x3c210f44),
michael@0 294 XdB(0x4009632b), XdB(0x4432b8cf), XdB(0x48a149bc), XdB(0x4d59959e),
michael@0 295 XdB(0x52606733), XdB(0x57bad899), XdB(0x5d6e593a), XdB(0x6380b298),
michael@0 296 XdB(0x69f80e9a), XdB(0x70dafda8), XdB(0x78307d76), XdB(0x7fffffff),
michael@0 297 };
michael@0 298
michael@0 299 static void render_line(int n, int x0,int x1,int y0,int y1,ogg_int32_t *d){
michael@0 300 int dy=y1-y0;
michael@0 301 int adx=x1-x0;
michael@0 302 int ady=abs(dy);
michael@0 303 int base=dy/adx;
michael@0 304 int sy=(dy<0?base-1:base+1);
michael@0 305 int x=x0;
michael@0 306 int y=y0;
michael@0 307 int err=0;
michael@0 308
michael@0 309 if(n>x1)n=x1;
michael@0 310 ady-=abs(base*adx);
michael@0 311
michael@0 312 if(x<n)
michael@0 313 d[x]= MULT31_SHIFT15(d[x],FLOOR_fromdB_LOOKUP[y]);
michael@0 314
michael@0 315 while(++x<n){
michael@0 316 err=err+ady;
michael@0 317 if(err>=adx){
michael@0 318 err-=adx;
michael@0 319 y+=sy;
michael@0 320 }else{
michael@0 321 y+=base;
michael@0 322 }
michael@0 323 d[x]= MULT31_SHIFT15(d[x],FLOOR_fromdB_LOOKUP[y]);
michael@0 324 }
michael@0 325 }
michael@0 326
michael@0 327 static void *floor1_inverse1(vorbis_block *vb,vorbis_look_floor *in){
michael@0 328 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in;
michael@0 329 vorbis_info_floor1 *info=look->vi;
michael@0 330 codec_setup_info *ci=(codec_setup_info *)vb->vd->vi->codec_setup;
michael@0 331
michael@0 332 int i,j,k;
michael@0 333 codebook *books=ci->fullbooks;
michael@0 334
michael@0 335 /* unpack wrapped/predicted values from stream */
michael@0 336 if(oggpack_read(&vb->opb,1)==1){
michael@0 337 int *fit_value=(int *)_vorbis_block_alloc(vb,(look->posts)*sizeof(*fit_value));
michael@0 338
michael@0 339 fit_value[0]=oggpack_read(&vb->opb,ilog(look->quant_q-1));
michael@0 340 fit_value[1]=oggpack_read(&vb->opb,ilog(look->quant_q-1));
michael@0 341
michael@0 342 /* partition by partition */
michael@0 343 /* partition by partition */
michael@0 344 for(i=0,j=2;i<info->partitions;i++){
michael@0 345 int classv=info->partitionclass[i];
michael@0 346 int cdim=info->class_dim[classv];
michael@0 347 int csubbits=info->class_subs[classv];
michael@0 348 int csub=1<<csubbits;
michael@0 349 int cval=0;
michael@0 350
michael@0 351 /* decode the partition's first stage cascade value */
michael@0 352 if(csubbits){
michael@0 353 cval=vorbis_book_decode(books+info->class_book[classv],&vb->opb);
michael@0 354
michael@0 355 if(cval==-1)goto eop;
michael@0 356 }
michael@0 357
michael@0 358 for(k=0;k<cdim;k++){
michael@0 359 int book=info->class_subbook[classv][cval&(csub-1)];
michael@0 360 cval>>=csubbits;
michael@0 361 if(book>=0){
michael@0 362 if((fit_value[j+k]=vorbis_book_decode(books+book,&vb->opb))==-1)
michael@0 363 goto eop;
michael@0 364 }else{
michael@0 365 fit_value[j+k]=0;
michael@0 366 }
michael@0 367 }
michael@0 368 j+=cdim;
michael@0 369 }
michael@0 370
michael@0 371 /* unwrap positive values and reconsitute via linear interpolation */
michael@0 372 for(i=2;i<look->posts;i++){
michael@0 373 int predicted=render_point(info->postlist[look->loneighbor[i-2]],
michael@0 374 info->postlist[look->hineighbor[i-2]],
michael@0 375 fit_value[look->loneighbor[i-2]],
michael@0 376 fit_value[look->hineighbor[i-2]],
michael@0 377 info->postlist[i]);
michael@0 378 int hiroom=look->quant_q-predicted;
michael@0 379 int loroom=predicted;
michael@0 380 int room=(hiroom<loroom?hiroom:loroom)<<1;
michael@0 381 int val=fit_value[i];
michael@0 382
michael@0 383 if(val){
michael@0 384 if(val>=room){
michael@0 385 if(hiroom>loroom){
michael@0 386 val = val-loroom;
michael@0 387 }else{
michael@0 388 val = -1-(val-hiroom);
michael@0 389 }
michael@0 390 }else{
michael@0 391 if(val&1){
michael@0 392 val= -((val+1)>>1);
michael@0 393 }else{
michael@0 394 val>>=1;
michael@0 395 }
michael@0 396 }
michael@0 397
michael@0 398 fit_value[i]=(val+predicted)&0x7fff;;
michael@0 399 fit_value[look->loneighbor[i-2]]&=0x7fff;
michael@0 400 fit_value[look->hineighbor[i-2]]&=0x7fff;
michael@0 401
michael@0 402 }else{
michael@0 403 fit_value[i]=predicted|0x8000;
michael@0 404 }
michael@0 405
michael@0 406 }
michael@0 407
michael@0 408 return(fit_value);
michael@0 409 }
michael@0 410 eop:
michael@0 411 return(NULL);
michael@0 412 }
michael@0 413
michael@0 414 static int floor1_inverse2(vorbis_block *vb,vorbis_look_floor *in,void *memo,
michael@0 415 ogg_int32_t *out){
michael@0 416 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in;
michael@0 417 vorbis_info_floor1 *info=look->vi;
michael@0 418
michael@0 419 codec_setup_info *ci=(codec_setup_info *)vb->vd->vi->codec_setup;
michael@0 420 int n=ci->blocksizes[vb->W]/2;
michael@0 421 int j;
michael@0 422
michael@0 423 if(memo){
michael@0 424 /* render the lines */
michael@0 425 int *fit_value=(int *)memo;
michael@0 426 int hx=0;
michael@0 427 int lx=0;
michael@0 428 int ly=fit_value[0]*info->mult;
michael@0 429 /* guard lookup against out-of-rage values */
michael@0 430 ly=(ly<0?0:ly>255?255:ly);
michael@0 431
michael@0 432 for(j=1;j<look->posts;j++){
michael@0 433 int current=look->forward_index[j];
michael@0 434 int hy=fit_value[current]&0x7fff;
michael@0 435 if(hy==fit_value[current]){
michael@0 436
michael@0 437 hx=info->postlist[current];
michael@0 438 hy*=info->mult;
michael@0 439 /* guard lookup against out-of-rage values */
michael@0 440 hy=(hy<0?0:hy>255?255:hy);
michael@0 441
michael@0 442
michael@0 443 render_line(n,lx,hx,ly,hy,out);
michael@0 444
michael@0 445 lx=hx;
michael@0 446 ly=hy;
michael@0 447 }
michael@0 448 }
michael@0 449 for(j=hx;j<n;j++)out[j]*=ly; /* be certain */
michael@0 450 return(1);
michael@0 451 }
michael@0 452 memset(out,0,sizeof(*out)*n);
michael@0 453 return(0);
michael@0 454 }
michael@0 455
michael@0 456 /* export hooks */
michael@0 457 vorbis_func_floor floor1_exportbundle={
michael@0 458 &floor1_unpack,&floor1_look,&floor1_free_info,
michael@0 459 &floor1_free_look,&floor1_inverse1,&floor1_inverse2
michael@0 460 };
michael@0 461

Mercurial Repository: The Tor Browser

Europalab SCM Repository Server

mercurial