vrshoot

annotate libs/vorbis/floor1.c @ 0:b2f14e535253

find changesets by author, revision, files, or words in the commit message
initial commit
author John Tsiombikas <nuclear@member.fsf.org>
date Sat, 01 Feb 2014 19:58:19 +0200
parents
children
rev   line source
nuclear@0 1 /********************************************************************
nuclear@0 2 * *
nuclear@0 3 * THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. *
nuclear@0 4 * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
nuclear@0 5 * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
nuclear@0 6 * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
nuclear@0 7 * *
nuclear@0 8 * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2009 *
nuclear@0 9 * by the Xiph.Org Foundation http://www.xiph.org/ *
nuclear@0 10 * *
nuclear@0 11 ********************************************************************
nuclear@0 12
nuclear@0 13 function: floor backend 1 implementation
nuclear@0 14 last mod: $Id: floor1.c 18151 2012-01-20 07:35:26Z xiphmont $
nuclear@0 15
nuclear@0 16 ********************************************************************/
nuclear@0 17
nuclear@0 18 #include <stdlib.h>
nuclear@0 19 #include <string.h>
nuclear@0 20 #include <math.h>
nuclear@0 21 #include <ogg/ogg.h>
nuclear@0 22 #include "vorbis/codec.h"
nuclear@0 23 #include "codec_internal.h"
nuclear@0 24 #include "registry.h"
nuclear@0 25 #include "codebook.h"
nuclear@0 26 #include "misc.h"
nuclear@0 27 #include "scales.h"
nuclear@0 28
nuclear@0 29 #include <stdio.h>
nuclear@0 30
nuclear@0 31 #define floor1_rangedB 140 /* floor 1 fixed at -140dB to 0dB range */
nuclear@0 32
nuclear@0 33 typedef struct lsfit_acc{
nuclear@0 34 int x0;
nuclear@0 35 int x1;
nuclear@0 36
nuclear@0 37 int xa;
nuclear@0 38 int ya;
nuclear@0 39 int x2a;
nuclear@0 40 int y2a;
nuclear@0 41 int xya;
nuclear@0 42 int an;
nuclear@0 43
nuclear@0 44 int xb;
nuclear@0 45 int yb;
nuclear@0 46 int x2b;
nuclear@0 47 int y2b;
nuclear@0 48 int xyb;
nuclear@0 49 int bn;
nuclear@0 50 } lsfit_acc;
nuclear@0 51
nuclear@0 52 /***********************************************/
nuclear@0 53
nuclear@0 54 static void floor1_free_info(vorbis_info_floor *i){
nuclear@0 55 vorbis_info_floor1 *info=(vorbis_info_floor1 *)i;
nuclear@0 56 if(info){
nuclear@0 57 memset(info,0,sizeof(*info));
nuclear@0 58 _ogg_free(info);
nuclear@0 59 }
nuclear@0 60 }
nuclear@0 61
nuclear@0 62 static void floor1_free_look(vorbis_look_floor *i){
nuclear@0 63 vorbis_look_floor1 *look=(vorbis_look_floor1 *)i;
nuclear@0 64 if(look){
nuclear@0 65 /*fprintf(stderr,"floor 1 bit usage %f:%f (%f total)\n",
nuclear@0 66 (float)look->phrasebits/look->frames,
nuclear@0 67 (float)look->postbits/look->frames,
nuclear@0 68 (float)(look->postbits+look->phrasebits)/look->frames);*/
nuclear@0 69
nuclear@0 70 memset(look,0,sizeof(*look));
nuclear@0 71 _ogg_free(look);
nuclear@0 72 }
nuclear@0 73 }
nuclear@0 74
nuclear@0 75 static int ilog(unsigned int v){
nuclear@0 76 int ret=0;
nuclear@0 77 while(v){
nuclear@0 78 ret++;
nuclear@0 79 v>>=1;
nuclear@0 80 }
nuclear@0 81 return(ret);
nuclear@0 82 }
nuclear@0 83
nuclear@0 84 static int ilog2(unsigned int v){
nuclear@0 85 int ret=0;
nuclear@0 86 if(v)--v;
nuclear@0 87 while(v){
nuclear@0 88 ret++;
nuclear@0 89 v>>=1;
nuclear@0 90 }
nuclear@0 91 return(ret);
nuclear@0 92 }
nuclear@0 93
nuclear@0 94 static void floor1_pack (vorbis_info_floor *i,oggpack_buffer *opb){
nuclear@0 95 vorbis_info_floor1 *info=(vorbis_info_floor1 *)i;
nuclear@0 96 int j,k;
nuclear@0 97 int count=0;
nuclear@0 98 int rangebits;
nuclear@0 99 int maxposit=info->postlist[1];
nuclear@0 100 int maxclass=-1;
nuclear@0 101
nuclear@0 102 /* save out partitions */
nuclear@0 103 oggpack_write(opb,info->partitions,5); /* only 0 to 31 legal */
nuclear@0 104 for(j=0;j<info->partitions;j++){
nuclear@0 105 oggpack_write(opb,info->partitionclass[j],4); /* only 0 to 15 legal */
nuclear@0 106 if(maxclass<info->partitionclass[j])maxclass=info->partitionclass[j];
nuclear@0 107 }
nuclear@0 108
nuclear@0 109 /* save out partition classes */
nuclear@0 110 for(j=0;j<maxclass+1;j++){
nuclear@0 111 oggpack_write(opb,info->class_dim[j]-1,3); /* 1 to 8 */
nuclear@0 112 oggpack_write(opb,info->class_subs[j],2); /* 0 to 3 */
nuclear@0 113 if(info->class_subs[j])oggpack_write(opb,info->class_book[j],8);
nuclear@0 114 for(k=0;k<(1<<info->class_subs[j]);k++)
nuclear@0 115 oggpack_write(opb,info->class_subbook[j][k]+1,8);
nuclear@0 116 }
nuclear@0 117
nuclear@0 118 /* save out the post list */
nuclear@0 119 oggpack_write(opb,info->mult-1,2); /* only 1,2,3,4 legal now */
nuclear@0 120 oggpack_write(opb,ilog2(maxposit),4);
nuclear@0 121 rangebits=ilog2(maxposit);
nuclear@0 122
nuclear@0 123 for(j=0,k=0;j<info->partitions;j++){
nuclear@0 124 count+=info->class_dim[info->partitionclass[j]];
nuclear@0 125 for(;k<count;k++)
nuclear@0 126 oggpack_write(opb,info->postlist[k+2],rangebits);
nuclear@0 127 }
nuclear@0 128 }
nuclear@0 129
nuclear@0 130 static int icomp(const void *a,const void *b){
nuclear@0 131 return(**(int **)a-**(int **)b);
nuclear@0 132 }
nuclear@0 133
nuclear@0 134 static vorbis_info_floor *floor1_unpack (vorbis_info *vi,oggpack_buffer *opb){
nuclear@0 135 codec_setup_info *ci=vi->codec_setup;
nuclear@0 136 int j,k,count=0,maxclass=-1,rangebits;
nuclear@0 137
nuclear@0 138 vorbis_info_floor1 *info=_ogg_calloc(1,sizeof(*info));
nuclear@0 139 /* read partitions */
nuclear@0 140 info->partitions=oggpack_read(opb,5); /* only 0 to 31 legal */
nuclear@0 141 for(j=0;j<info->partitions;j++){
nuclear@0 142 info->partitionclass[j]=oggpack_read(opb,4); /* only 0 to 15 legal */
nuclear@0 143 if(info->partitionclass[j]<0)goto err_out;
nuclear@0 144 if(maxclass<info->partitionclass[j])maxclass=info->partitionclass[j];
nuclear@0 145 }
nuclear@0 146
nuclear@0 147 /* read partition classes */
nuclear@0 148 for(j=0;j<maxclass+1;j++){
nuclear@0 149 info->class_dim[j]=oggpack_read(opb,3)+1; /* 1 to 8 */
nuclear@0 150 info->class_subs[j]=oggpack_read(opb,2); /* 0,1,2,3 bits */
nuclear@0 151 if(info->class_subs[j]<0)
nuclear@0 152 goto err_out;
nuclear@0 153 if(info->class_subs[j])info->class_book[j]=oggpack_read(opb,8);
nuclear@0 154 if(info->class_book[j]<0 || info->class_book[j]>=ci->books)
nuclear@0 155 goto err_out;
nuclear@0 156 for(k=0;k<(1<<info->class_subs[j]);k++){
nuclear@0 157 info->class_subbook[j][k]=oggpack_read(opb,8)-1;
nuclear@0 158 if(info->class_subbook[j][k]<-1 || info->class_subbook[j][k]>=ci->books)
nuclear@0 159 goto err_out;
nuclear@0 160 }
nuclear@0 161 }
nuclear@0 162
nuclear@0 163 /* read the post list */
nuclear@0 164 info->mult=oggpack_read(opb,2)+1; /* only 1,2,3,4 legal now */
nuclear@0 165 rangebits=oggpack_read(opb,4);
nuclear@0 166 if(rangebits<0)goto err_out;
nuclear@0 167
nuclear@0 168 for(j=0,k=0;j<info->partitions;j++){
nuclear@0 169 count+=info->class_dim[info->partitionclass[j]];
nuclear@0 170 if(count>VIF_POSIT) goto err_out;
nuclear@0 171 for(;k<count;k++){
nuclear@0 172 int t=info->postlist[k+2]=oggpack_read(opb,rangebits);
nuclear@0 173 if(t<0 || t>=(1<<rangebits))
nuclear@0 174 goto err_out;
nuclear@0 175 }
nuclear@0 176 }
nuclear@0 177 info->postlist[0]=0;
nuclear@0 178 info->postlist[1]=1<<rangebits;
nuclear@0 179
nuclear@0 180 /* don't allow repeated values in post list as they'd result in
nuclear@0 181 zero-length segments */
nuclear@0 182 {
nuclear@0 183 int *sortpointer[VIF_POSIT+2];
nuclear@0 184 for(j=0;j<count+2;j++)sortpointer[j]=info->postlist+j;
nuclear@0 185 qsort(sortpointer,count+2,sizeof(*sortpointer),icomp);
nuclear@0 186
nuclear@0 187 for(j=1;j<count+2;j++)
nuclear@0 188 if(*sortpointer[j-1]==*sortpointer[j])goto err_out;
nuclear@0 189 }
nuclear@0 190
nuclear@0 191 return(info);
nuclear@0 192
nuclear@0 193 err_out:
nuclear@0 194 floor1_free_info(info);
nuclear@0 195 return(NULL);
nuclear@0 196 }
nuclear@0 197
nuclear@0 198 static vorbis_look_floor *floor1_look(vorbis_dsp_state *vd,
nuclear@0 199 vorbis_info_floor *in){
nuclear@0 200
nuclear@0 201 int *sortpointer[VIF_POSIT+2];
nuclear@0 202 vorbis_info_floor1 *info=(vorbis_info_floor1 *)in;
nuclear@0 203 vorbis_look_floor1 *look=_ogg_calloc(1,sizeof(*look));
nuclear@0 204 int i,j,n=0;
nuclear@0 205
nuclear@0 206 look->vi=info;
nuclear@0 207 look->n=info->postlist[1];
nuclear@0 208
nuclear@0 209 /* we drop each position value in-between already decoded values,
nuclear@0 210 and use linear interpolation to predict each new value past the
nuclear@0 211 edges. The positions are read in the order of the position
nuclear@0 212 list... we precompute the bounding positions in the lookup. Of
nuclear@0 213 course, the neighbors can change (if a position is declined), but
nuclear@0 214 this is an initial mapping */
nuclear@0 215
nuclear@0 216 for(i=0;i<info->partitions;i++)n+=info->class_dim[info->partitionclass[i]];
nuclear@0 217 n+=2;
nuclear@0 218 look->posts=n;
nuclear@0 219
nuclear@0 220 /* also store a sorted position index */
nuclear@0 221 for(i=0;i<n;i++)sortpointer[i]=info->postlist+i;
nuclear@0 222 qsort(sortpointer,n,sizeof(*sortpointer),icomp);
nuclear@0 223
nuclear@0 224 /* points from sort order back to range number */
nuclear@0 225 for(i=0;i<n;i++)look->forward_index[i]=sortpointer[i]-info->postlist;
nuclear@0 226 /* points from range order to sorted position */
nuclear@0 227 for(i=0;i<n;i++)look->reverse_index[look->forward_index[i]]=i;
nuclear@0 228 /* we actually need the post values too */
nuclear@0 229 for(i=0;i<n;i++)look->sorted_index[i]=info->postlist[look->forward_index[i]];
nuclear@0 230
nuclear@0 231 /* quantize values to multiplier spec */
nuclear@0 232 switch(info->mult){
nuclear@0 233 case 1: /* 1024 -> 256 */
nuclear@0 234 look->quant_q=256;
nuclear@0 235 break;
nuclear@0 236 case 2: /* 1024 -> 128 */
nuclear@0 237 look->quant_q=128;
nuclear@0 238 break;
nuclear@0 239 case 3: /* 1024 -> 86 */
nuclear@0 240 look->quant_q=86;
nuclear@0 241 break;
nuclear@0 242 case 4: /* 1024 -> 64 */
nuclear@0 243 look->quant_q=64;
nuclear@0 244 break;
nuclear@0 245 }
nuclear@0 246
nuclear@0 247 /* discover our neighbors for decode where we don't use fit flags
nuclear@0 248 (that would push the neighbors outward) */
nuclear@0 249 for(i=0;i<n-2;i++){
nuclear@0 250 int lo=0;
nuclear@0 251 int hi=1;
nuclear@0 252 int lx=0;
nuclear@0 253 int hx=look->n;
nuclear@0 254 int currentx=info->postlist[i+2];
nuclear@0 255 for(j=0;j<i+2;j++){
nuclear@0 256 int x=info->postlist[j];
nuclear@0 257 if(x>lx && x<currentx){
nuclear@0 258 lo=j;
nuclear@0 259 lx=x;
nuclear@0 260 }
nuclear@0 261 if(x<hx && x>currentx){
nuclear@0 262 hi=j;
nuclear@0 263 hx=x;
nuclear@0 264 }
nuclear@0 265 }
nuclear@0 266 look->loneighbor[i]=lo;
nuclear@0 267 look->hineighbor[i]=hi;
nuclear@0 268 }
nuclear@0 269
nuclear@0 270 return(look);
nuclear@0 271 }
nuclear@0 272
nuclear@0 273 static int render_point(int x0,int x1,int y0,int y1,int x){
nuclear@0 274 y0&=0x7fff; /* mask off flag */
nuclear@0 275 y1&=0x7fff;
nuclear@0 276
nuclear@0 277 {
nuclear@0 278 int dy=y1-y0;
nuclear@0 279 int adx=x1-x0;
nuclear@0 280 int ady=abs(dy);
nuclear@0 281 int err=ady*(x-x0);
nuclear@0 282
nuclear@0 283 int off=err/adx;
nuclear@0 284 if(dy<0)return(y0-off);
nuclear@0 285 return(y0+off);
nuclear@0 286 }
nuclear@0 287 }
nuclear@0 288
nuclear@0 289 static int vorbis_dBquant(const float *x){
nuclear@0 290 int i= *x*7.3142857f+1023.5f;
nuclear@0 291 if(i>1023)return(1023);
nuclear@0 292 if(i<0)return(0);
nuclear@0 293 return i;
nuclear@0 294 }
nuclear@0 295
nuclear@0 296 static const float FLOOR1_fromdB_LOOKUP[256]={
nuclear@0 297 1.0649863e-07F, 1.1341951e-07F, 1.2079015e-07F, 1.2863978e-07F,
nuclear@0 298 1.3699951e-07F, 1.4590251e-07F, 1.5538408e-07F, 1.6548181e-07F,
nuclear@0 299 1.7623575e-07F, 1.8768855e-07F, 1.9988561e-07F, 2.128753e-07F,
nuclear@0 300 2.2670913e-07F, 2.4144197e-07F, 2.5713223e-07F, 2.7384213e-07F,
nuclear@0 301 2.9163793e-07F, 3.1059021e-07F, 3.3077411e-07F, 3.5226968e-07F,
nuclear@0 302 3.7516214e-07F, 3.9954229e-07F, 4.2550680e-07F, 4.5315863e-07F,
nuclear@0 303 4.8260743e-07F, 5.1396998e-07F, 5.4737065e-07F, 5.8294187e-07F,
nuclear@0 304 6.2082472e-07F, 6.6116941e-07F, 7.0413592e-07F, 7.4989464e-07F,
nuclear@0 305 7.9862701e-07F, 8.5052630e-07F, 9.0579828e-07F, 9.6466216e-07F,
nuclear@0 306 1.0273513e-06F, 1.0941144e-06F, 1.1652161e-06F, 1.2409384e-06F,
nuclear@0 307 1.3215816e-06F, 1.4074654e-06F, 1.4989305e-06F, 1.5963394e-06F,
nuclear@0 308 1.7000785e-06F, 1.8105592e-06F, 1.9282195e-06F, 2.0535261e-06F,
nuclear@0 309 2.1869758e-06F, 2.3290978e-06F, 2.4804557e-06F, 2.6416497e-06F,
nuclear@0 310 2.8133190e-06F, 2.9961443e-06F, 3.1908506e-06F, 3.3982101e-06F,
nuclear@0 311 3.6190449e-06F, 3.8542308e-06F, 4.1047004e-06F, 4.3714470e-06F,
nuclear@0 312 4.6555282e-06F, 4.9580707e-06F, 5.2802740e-06F, 5.6234160e-06F,
nuclear@0 313 5.9888572e-06F, 6.3780469e-06F, 6.7925283e-06F, 7.2339451e-06F,
nuclear@0 314 7.7040476e-06F, 8.2047000e-06F, 8.7378876e-06F, 9.3057248e-06F,
nuclear@0 315 9.9104632e-06F, 1.0554501e-05F, 1.1240392e-05F, 1.1970856e-05F,
nuclear@0 316 1.2748789e-05F, 1.3577278e-05F, 1.4459606e-05F, 1.5399272e-05F,
nuclear@0 317 1.6400004e-05F, 1.7465768e-05F, 1.8600792e-05F, 1.9809576e-05F,
nuclear@0 318 2.1096914e-05F, 2.2467911e-05F, 2.3928002e-05F, 2.5482978e-05F,
nuclear@0 319 2.7139006e-05F, 2.8902651e-05F, 3.0780908e-05F, 3.2781225e-05F,
nuclear@0 320 3.4911534e-05F, 3.7180282e-05F, 3.9596466e-05F, 4.2169667e-05F,
nuclear@0 321 4.4910090e-05F, 4.7828601e-05F, 5.0936773e-05F, 5.4246931e-05F,
nuclear@0 322 5.7772202e-05F, 6.1526565e-05F, 6.5524908e-05F, 6.9783085e-05F,
nuclear@0 323 7.4317983e-05F, 7.9147585e-05F, 8.4291040e-05F, 8.9768747e-05F,
nuclear@0 324 9.5602426e-05F, 0.00010181521F, 0.00010843174F, 0.00011547824F,
nuclear@0 325 0.00012298267F, 0.00013097477F, 0.00013948625F, 0.00014855085F,
nuclear@0 326 0.00015820453F, 0.00016848555F, 0.00017943469F, 0.00019109536F,
nuclear@0 327 0.00020351382F, 0.00021673929F, 0.00023082423F, 0.00024582449F,
nuclear@0 328 0.00026179955F, 0.00027881276F, 0.00029693158F, 0.00031622787F,
nuclear@0 329 0.00033677814F, 0.00035866388F, 0.00038197188F, 0.00040679456F,
nuclear@0 330 0.00043323036F, 0.00046138411F, 0.00049136745F, 0.00052329927F,
nuclear@0 331 0.00055730621F, 0.00059352311F, 0.00063209358F, 0.00067317058F,
nuclear@0 332 0.00071691700F, 0.00076350630F, 0.00081312324F, 0.00086596457F,
nuclear@0 333 0.00092223983F, 0.00098217216F, 0.0010459992F, 0.0011139742F,
nuclear@0 334 0.0011863665F, 0.0012634633F, 0.0013455702F, 0.0014330129F,
nuclear@0 335 0.0015261382F, 0.0016253153F, 0.0017309374F, 0.0018434235F,
nuclear@0 336 0.0019632195F, 0.0020908006F, 0.0022266726F, 0.0023713743F,
nuclear@0 337 0.0025254795F, 0.0026895994F, 0.0028643847F, 0.0030505286F,
nuclear@0 338 0.0032487691F, 0.0034598925F, 0.0036847358F, 0.0039241906F,
nuclear@0 339 0.0041792066F, 0.0044507950F, 0.0047400328F, 0.0050480668F,
nuclear@0 340 0.0053761186F, 0.0057254891F, 0.0060975636F, 0.0064938176F,
nuclear@0 341 0.0069158225F, 0.0073652516F, 0.0078438871F, 0.0083536271F,
nuclear@0 342 0.0088964928F, 0.009474637F, 0.010090352F, 0.010746080F,
nuclear@0 343 0.011444421F, 0.012188144F, 0.012980198F, 0.013823725F,
nuclear@0 344 0.014722068F, 0.015678791F, 0.016697687F, 0.017782797F,
nuclear@0 345 0.018938423F, 0.020169149F, 0.021479854F, 0.022875735F,
nuclear@0 346 0.024362330F, 0.025945531F, 0.027631618F, 0.029427276F,
nuclear@0 347 0.031339626F, 0.033376252F, 0.035545228F, 0.037855157F,
nuclear@0 348 0.040315199F, 0.042935108F, 0.045725273F, 0.048696758F,
nuclear@0 349 0.051861348F, 0.055231591F, 0.058820850F, 0.062643361F,
nuclear@0 350 0.066714279F, 0.071049749F, 0.075666962F, 0.080584227F,
nuclear@0 351 0.085821044F, 0.091398179F, 0.097337747F, 0.10366330F,
nuclear@0 352 0.11039993F, 0.11757434F, 0.12521498F, 0.13335215F,
nuclear@0 353 0.14201813F, 0.15124727F, 0.16107617F, 0.17154380F,
nuclear@0 354 0.18269168F, 0.19456402F, 0.20720788F, 0.22067342F,
nuclear@0 355 0.23501402F, 0.25028656F, 0.26655159F, 0.28387361F,
nuclear@0 356 0.30232132F, 0.32196786F, 0.34289114F, 0.36517414F,
nuclear@0 357 0.38890521F, 0.41417847F, 0.44109412F, 0.46975890F,
nuclear@0 358 0.50028648F, 0.53279791F, 0.56742212F, 0.60429640F,
nuclear@0 359 0.64356699F, 0.68538959F, 0.72993007F, 0.77736504F,
nuclear@0 360 0.82788260F, 0.88168307F, 0.9389798F, 1.F,
nuclear@0 361 };
nuclear@0 362
nuclear@0 363 static void render_line(int n, int x0,int x1,int y0,int y1,float *d){
nuclear@0 364 int dy=y1-y0;
nuclear@0 365 int adx=x1-x0;
nuclear@0 366 int ady=abs(dy);
nuclear@0 367 int base=dy/adx;
nuclear@0 368 int sy=(dy<0?base-1:base+1);
nuclear@0 369 int x=x0;
nuclear@0 370 int y=y0;
nuclear@0 371 int err=0;
nuclear@0 372
nuclear@0 373 ady-=abs(base*adx);
nuclear@0 374
nuclear@0 375 if(n>x1)n=x1;
nuclear@0 376
nuclear@0 377 if(x<n)
nuclear@0 378 d[x]*=FLOOR1_fromdB_LOOKUP[y];
nuclear@0 379
nuclear@0 380 while(++x<n){
nuclear@0 381 err=err+ady;
nuclear@0 382 if(err>=adx){
nuclear@0 383 err-=adx;
nuclear@0 384 y+=sy;
nuclear@0 385 }else{
nuclear@0 386 y+=base;
nuclear@0 387 }
nuclear@0 388 d[x]*=FLOOR1_fromdB_LOOKUP[y];
nuclear@0 389 }
nuclear@0 390 }
nuclear@0 391
nuclear@0 392 static void render_line0(int n, int x0,int x1,int y0,int y1,int *d){
nuclear@0 393 int dy=y1-y0;
nuclear@0 394 int adx=x1-x0;
nuclear@0 395 int ady=abs(dy);
nuclear@0 396 int base=dy/adx;
nuclear@0 397 int sy=(dy<0?base-1:base+1);
nuclear@0 398 int x=x0;
nuclear@0 399 int y=y0;
nuclear@0 400 int err=0;
nuclear@0 401
nuclear@0 402 ady-=abs(base*adx);
nuclear@0 403
nuclear@0 404 if(n>x1)n=x1;
nuclear@0 405
nuclear@0 406 if(x<n)
nuclear@0 407 d[x]=y;
nuclear@0 408
nuclear@0 409 while(++x<n){
nuclear@0 410 err=err+ady;
nuclear@0 411 if(err>=adx){
nuclear@0 412 err-=adx;
nuclear@0 413 y+=sy;
nuclear@0 414 }else{
nuclear@0 415 y+=base;
nuclear@0 416 }
nuclear@0 417 d[x]=y;
nuclear@0 418 }
nuclear@0 419 }
nuclear@0 420
nuclear@0 421 /* the floor has already been filtered to only include relevant sections */
nuclear@0 422 static int accumulate_fit(const float *flr,const float *mdct,
nuclear@0 423 int x0, int x1,lsfit_acc *a,
nuclear@0 424 int n,vorbis_info_floor1 *info){
nuclear@0 425 long i;
nuclear@0 426
nuclear@0 427 int xa=0,ya=0,x2a=0,y2a=0,xya=0,na=0, xb=0,yb=0,x2b=0,y2b=0,xyb=0,nb=0;
nuclear@0 428
nuclear@0 429 memset(a,0,sizeof(*a));
nuclear@0 430 a->x0=x0;
nuclear@0 431 a->x1=x1;
nuclear@0 432 if(x1>=n)x1=n-1;
nuclear@0 433
nuclear@0 434 for(i=x0;i<=x1;i++){
nuclear@0 435 int quantized=vorbis_dBquant(flr+i);
nuclear@0 436 if(quantized){
nuclear@0 437 if(mdct[i]+info->twofitatten>=flr[i]){
nuclear@0 438 xa += i;
nuclear@0 439 ya += quantized;
nuclear@0 440 x2a += i*i;
nuclear@0 441 y2a += quantized*quantized;
nuclear@0 442 xya += i*quantized;
nuclear@0 443 na++;
nuclear@0 444 }else{
nuclear@0 445 xb += i;
nuclear@0 446 yb += quantized;
nuclear@0 447 x2b += i*i;
nuclear@0 448 y2b += quantized*quantized;
nuclear@0 449 xyb += i*quantized;
nuclear@0 450 nb++;
nuclear@0 451 }
nuclear@0 452 }
nuclear@0 453 }
nuclear@0 454
nuclear@0 455 a->xa=xa;
nuclear@0 456 a->ya=ya;
nuclear@0 457 a->x2a=x2a;
nuclear@0 458 a->y2a=y2a;
nuclear@0 459 a->xya=xya;
nuclear@0 460 a->an=na;
nuclear@0 461
nuclear@0 462 a->xb=xb;
nuclear@0 463 a->yb=yb;
nuclear@0 464 a->x2b=x2b;
nuclear@0 465 a->y2b=y2b;
nuclear@0 466 a->xyb=xyb;
nuclear@0 467 a->bn=nb;
nuclear@0 468
nuclear@0 469 return(na);
nuclear@0 470 }
nuclear@0 471
nuclear@0 472 static int fit_line(lsfit_acc *a,int fits,int *y0,int *y1,
nuclear@0 473 vorbis_info_floor1 *info){
nuclear@0 474 double xb=0,yb=0,x2b=0,y2b=0,xyb=0,bn=0;
nuclear@0 475 int i;
nuclear@0 476 int x0=a[0].x0;
nuclear@0 477 int x1=a[fits-1].x1;
nuclear@0 478
nuclear@0 479 for(i=0;i<fits;i++){
nuclear@0 480 double weight = (a[i].bn+a[i].an)*info->twofitweight/(a[i].an+1)+1.;
nuclear@0 481
nuclear@0 482 xb+=a[i].xb + a[i].xa * weight;
nuclear@0 483 yb+=a[i].yb + a[i].ya * weight;
nuclear@0 484 x2b+=a[i].x2b + a[i].x2a * weight;
nuclear@0 485 y2b+=a[i].y2b + a[i].y2a * weight;
nuclear@0 486 xyb+=a[i].xyb + a[i].xya * weight;
nuclear@0 487 bn+=a[i].bn + a[i].an * weight;
nuclear@0 488 }
nuclear@0 489
nuclear@0 490 if(*y0>=0){
nuclear@0 491 xb+= x0;
nuclear@0 492 yb+= *y0;
nuclear@0 493 x2b+= x0 * x0;
nuclear@0 494 y2b+= *y0 * *y0;
nuclear@0 495 xyb+= *y0 * x0;
nuclear@0 496 bn++;
nuclear@0 497 }
nuclear@0 498
nuclear@0 499 if(*y1>=0){
nuclear@0 500 xb+= x1;
nuclear@0 501 yb+= *y1;
nuclear@0 502 x2b+= x1 * x1;
nuclear@0 503 y2b+= *y1 * *y1;
nuclear@0 504 xyb+= *y1 * x1;
nuclear@0 505 bn++;
nuclear@0 506 }
nuclear@0 507
nuclear@0 508 {
nuclear@0 509 double denom=(bn*x2b-xb*xb);
nuclear@0 510
nuclear@0 511 if(denom>0.){
nuclear@0 512 double a=(yb*x2b-xyb*xb)/denom;
nuclear@0 513 double b=(bn*xyb-xb*yb)/denom;
nuclear@0 514 *y0=rint(a+b*x0);
nuclear@0 515 *y1=rint(a+b*x1);
nuclear@0 516
nuclear@0 517 /* limit to our range! */
nuclear@0 518 if(*y0>1023)*y0=1023;
nuclear@0 519 if(*y1>1023)*y1=1023;
nuclear@0 520 if(*y0<0)*y0=0;
nuclear@0 521 if(*y1<0)*y1=0;
nuclear@0 522
nuclear@0 523 return 0;
nuclear@0 524 }else{
nuclear@0 525 *y0=0;
nuclear@0 526 *y1=0;
nuclear@0 527 return 1;
nuclear@0 528 }
nuclear@0 529 }
nuclear@0 530 }
nuclear@0 531
nuclear@0 532 static int inspect_error(int x0,int x1,int y0,int y1,const float *mask,
nuclear@0 533 const float *mdct,
nuclear@0 534 vorbis_info_floor1 *info){
nuclear@0 535 int dy=y1-y0;
nuclear@0 536 int adx=x1-x0;
nuclear@0 537 int ady=abs(dy);
nuclear@0 538 int base=dy/adx;
nuclear@0 539 int sy=(dy<0?base-1:base+1);
nuclear@0 540 int x=x0;
nuclear@0 541 int y=y0;
nuclear@0 542 int err=0;
nuclear@0 543 int val=vorbis_dBquant(mask+x);
nuclear@0 544 int mse=0;
nuclear@0 545 int n=0;
nuclear@0 546
nuclear@0 547 ady-=abs(base*adx);
nuclear@0 548
nuclear@0 549 mse=(y-val);
nuclear@0 550 mse*=mse;
nuclear@0 551 n++;
nuclear@0 552 if(mdct[x]+info->twofitatten>=mask[x]){
nuclear@0 553 if(y+info->maxover<val)return(1);
nuclear@0 554 if(y-info->maxunder>val)return(1);
nuclear@0 555 }
nuclear@0 556
nuclear@0 557 while(++x<x1){
nuclear@0 558 err=err+ady;
nuclear@0 559 if(err>=adx){
nuclear@0 560 err-=adx;
nuclear@0 561 y+=sy;
nuclear@0 562 }else{
nuclear@0 563 y+=base;
nuclear@0 564 }
nuclear@0 565
nuclear@0 566 val=vorbis_dBquant(mask+x);
nuclear@0 567 mse+=((y-val)*(y-val));
nuclear@0 568 n++;
nuclear@0 569 if(mdct[x]+info->twofitatten>=mask[x]){
nuclear@0 570 if(val){
nuclear@0 571 if(y+info->maxover<val)return(1);
nuclear@0 572 if(y-info->maxunder>val)return(1);
nuclear@0 573 }
nuclear@0 574 }
nuclear@0 575 }
nuclear@0 576
nuclear@0 577 if(info->maxover*info->maxover/n>info->maxerr)return(0);
nuclear@0 578 if(info->maxunder*info->maxunder/n>info->maxerr)return(0);
nuclear@0 579 if(mse/n>info->maxerr)return(1);
nuclear@0 580 return(0);
nuclear@0 581 }
nuclear@0 582
nuclear@0 583 static int post_Y(int *A,int *B,int pos){
nuclear@0 584 if(A[pos]<0)
nuclear@0 585 return B[pos];
nuclear@0 586 if(B[pos]<0)
nuclear@0 587 return A[pos];
nuclear@0 588
nuclear@0 589 return (A[pos]+B[pos])>>1;
nuclear@0 590 }
nuclear@0 591
nuclear@0 592 int *floor1_fit(vorbis_block *vb,vorbis_look_floor1 *look,
nuclear@0 593 const float *logmdct, /* in */
nuclear@0 594 const float *logmask){
nuclear@0 595 long i,j;
nuclear@0 596 vorbis_info_floor1 *info=look->vi;
nuclear@0 597 long n=look->n;
nuclear@0 598 long posts=look->posts;
nuclear@0 599 long nonzero=0;
nuclear@0 600 lsfit_acc fits[VIF_POSIT+1];
nuclear@0 601 int fit_valueA[VIF_POSIT+2]; /* index by range list position */
nuclear@0 602 int fit_valueB[VIF_POSIT+2]; /* index by range list position */
nuclear@0 603
nuclear@0 604 int loneighbor[VIF_POSIT+2]; /* sorted index of range list position (+2) */
nuclear@0 605 int hineighbor[VIF_POSIT+2];
nuclear@0 606 int *output=NULL;
nuclear@0 607 int memo[VIF_POSIT+2];
nuclear@0 608
nuclear@0 609 for(i=0;i<posts;i++)fit_valueA[i]=-200; /* mark all unused */
nuclear@0 610 for(i=0;i<posts;i++)fit_valueB[i]=-200; /* mark all unused */
nuclear@0 611 for(i=0;i<posts;i++)loneighbor[i]=0; /* 0 for the implicit 0 post */
nuclear@0 612 for(i=0;i<posts;i++)hineighbor[i]=1; /* 1 for the implicit post at n */
nuclear@0 613 for(i=0;i<posts;i++)memo[i]=-1; /* no neighbor yet */
nuclear@0 614
nuclear@0 615 /* quantize the relevant floor points and collect them into line fit
nuclear@0 616 structures (one per minimal division) at the same time */
nuclear@0 617 if(posts==0){
nuclear@0 618 nonzero+=accumulate_fit(logmask,logmdct,0,n,fits,n,info);
nuclear@0 619 }else{
nuclear@0 620 for(i=0;i<posts-1;i++)
nuclear@0 621 nonzero+=accumulate_fit(logmask,logmdct,look->sorted_index[i],
nuclear@0 622 look->sorted_index[i+1],fits+i,
nuclear@0 623 n,info);
nuclear@0 624 }
nuclear@0 625
nuclear@0 626 if(nonzero){
nuclear@0 627 /* start by fitting the implicit base case.... */
nuclear@0 628 int y0=-200;
nuclear@0 629 int y1=-200;
nuclear@0 630 fit_line(fits,posts-1,&y0,&y1,info);
nuclear@0 631
nuclear@0 632 fit_valueA[0]=y0;
nuclear@0 633 fit_valueB[0]=y0;
nuclear@0 634 fit_valueB[1]=y1;
nuclear@0 635 fit_valueA[1]=y1;
nuclear@0 636
nuclear@0 637 /* Non degenerate case */
nuclear@0 638 /* start progressive splitting. This is a greedy, non-optimal
nuclear@0 639 algorithm, but simple and close enough to the best
nuclear@0 640 answer. */
nuclear@0 641 for(i=2;i<posts;i++){
nuclear@0 642 int sortpos=look->reverse_index[i];
nuclear@0 643 int ln=loneighbor[sortpos];
nuclear@0 644 int hn=hineighbor[sortpos];
nuclear@0 645
nuclear@0 646 /* eliminate repeat searches of a particular range with a memo */
nuclear@0 647 if(memo[ln]!=hn){
nuclear@0 648 /* haven't performed this error search yet */
nuclear@0 649 int lsortpos=look->reverse_index[ln];
nuclear@0 650 int hsortpos=look->reverse_index[hn];
nuclear@0 651 memo[ln]=hn;
nuclear@0 652
nuclear@0 653 {
nuclear@0 654 /* A note: we want to bound/minimize *local*, not global, error */
nuclear@0 655 int lx=info->postlist[ln];
nuclear@0 656 int hx=info->postlist[hn];
nuclear@0 657 int ly=post_Y(fit_valueA,fit_valueB,ln);
nuclear@0 658 int hy=post_Y(fit_valueA,fit_valueB,hn);
nuclear@0 659
nuclear@0 660 if(ly==-1 || hy==-1){
nuclear@0 661 exit(1);
nuclear@0 662 }
nuclear@0 663
nuclear@0 664 if(inspect_error(lx,hx,ly,hy,logmask,logmdct,info)){
nuclear@0 665 /* outside error bounds/begin search area. Split it. */
nuclear@0 666 int ly0=-200;
nuclear@0 667 int ly1=-200;
nuclear@0 668 int hy0=-200;
nuclear@0 669 int hy1=-200;
nuclear@0 670 int ret0=fit_line(fits+lsortpos,sortpos-lsortpos,&ly0,&ly1,info);
nuclear@0 671 int ret1=fit_line(fits+sortpos,hsortpos-sortpos,&hy0,&hy1,info);
nuclear@0 672
nuclear@0 673 if(ret0){
nuclear@0 674 ly0=ly;
nuclear@0 675 ly1=hy0;
nuclear@0 676 }
nuclear@0 677 if(ret1){
nuclear@0 678 hy0=ly1;
nuclear@0 679 hy1=hy;
nuclear@0 680 }
nuclear@0 681
nuclear@0 682 if(ret0 && ret1){
nuclear@0 683 fit_valueA[i]=-200;
nuclear@0 684 fit_valueB[i]=-200;
nuclear@0 685 }else{
nuclear@0 686 /* store new edge values */
nuclear@0 687 fit_valueB[ln]=ly0;
nuclear@0 688 if(ln==0)fit_valueA[ln]=ly0;
nuclear@0 689 fit_valueA[i]=ly1;
nuclear@0 690 fit_valueB[i]=hy0;
nuclear@0 691 fit_valueA[hn]=hy1;
nuclear@0 692 if(hn==1)fit_valueB[hn]=hy1;
nuclear@0 693
nuclear@0 694 if(ly1>=0 || hy0>=0){
nuclear@0 695 /* store new neighbor values */
nuclear@0 696 for(j=sortpos-1;j>=0;j--)
nuclear@0 697 if(hineighbor[j]==hn)
nuclear@0 698 hineighbor[j]=i;
nuclear@0 699 else
nuclear@0 700 break;
nuclear@0 701 for(j=sortpos+1;j<posts;j++)
nuclear@0 702 if(loneighbor[j]==ln)
nuclear@0 703 loneighbor[j]=i;
nuclear@0 704 else
nuclear@0 705 break;
nuclear@0 706 }
nuclear@0 707 }
nuclear@0 708 }else{
nuclear@0 709 fit_valueA[i]=-200;
nuclear@0 710 fit_valueB[i]=-200;
nuclear@0 711 }
nuclear@0 712 }
nuclear@0 713 }
nuclear@0 714 }
nuclear@0 715
nuclear@0 716 output=_vorbis_block_alloc(vb,sizeof(*output)*posts);
nuclear@0 717
nuclear@0 718 output[0]=post_Y(fit_valueA,fit_valueB,0);
nuclear@0 719 output[1]=post_Y(fit_valueA,fit_valueB,1);
nuclear@0 720
nuclear@0 721 /* fill in posts marked as not using a fit; we will zero
nuclear@0 722 back out to 'unused' when encoding them so long as curve
nuclear@0 723 interpolation doesn't force them into use */
nuclear@0 724 for(i=2;i<posts;i++){
nuclear@0 725 int ln=look->loneighbor[i-2];
nuclear@0 726 int hn=look->hineighbor[i-2];
nuclear@0 727 int x0=info->postlist[ln];
nuclear@0 728 int x1=info->postlist[hn];
nuclear@0 729 int y0=output[ln];
nuclear@0 730 int y1=output[hn];
nuclear@0 731
nuclear@0 732 int predicted=render_point(x0,x1,y0,y1,info->postlist[i]);
nuclear@0 733 int vx=post_Y(fit_valueA,fit_valueB,i);
nuclear@0 734
nuclear@0 735 if(vx>=0 && predicted!=vx){
nuclear@0 736 output[i]=vx;
nuclear@0 737 }else{
nuclear@0 738 output[i]= predicted|0x8000;
nuclear@0 739 }
nuclear@0 740 }
nuclear@0 741 }
nuclear@0 742
nuclear@0 743 return(output);
nuclear@0 744
nuclear@0 745 }
nuclear@0 746
nuclear@0 747 int *floor1_interpolate_fit(vorbis_block *vb,vorbis_look_floor1 *look,
nuclear@0 748 int *A,int *B,
nuclear@0 749 int del){
nuclear@0 750
nuclear@0 751 long i;
nuclear@0 752 long posts=look->posts;
nuclear@0 753 int *output=NULL;
nuclear@0 754
nuclear@0 755 if(A && B){
nuclear@0 756 output=_vorbis_block_alloc(vb,sizeof(*output)*posts);
nuclear@0 757
nuclear@0 758 /* overly simpleminded--- look again post 1.2 */
nuclear@0 759 for(i=0;i<posts;i++){
nuclear@0 760 output[i]=((65536-del)*(A[i]&0x7fff)+del*(B[i]&0x7fff)+32768)>>16;
nuclear@0 761 if(A[i]&0x8000 && B[i]&0x8000)output[i]|=0x8000;
nuclear@0 762 }
nuclear@0 763 }
nuclear@0 764
nuclear@0 765 return(output);
nuclear@0 766 }
nuclear@0 767
nuclear@0 768
nuclear@0 769 int floor1_encode(oggpack_buffer *opb,vorbis_block *vb,
nuclear@0 770 vorbis_look_floor1 *look,
nuclear@0 771 int *post,int *ilogmask){
nuclear@0 772
nuclear@0 773 long i,j;
nuclear@0 774 vorbis_info_floor1 *info=look->vi;
nuclear@0 775 long posts=look->posts;
nuclear@0 776 codec_setup_info *ci=vb->vd->vi->codec_setup;
nuclear@0 777 int out[VIF_POSIT+2];
nuclear@0 778 static_codebook **sbooks=ci->book_param;
nuclear@0 779 codebook *books=ci->fullbooks;
nuclear@0 780
nuclear@0 781 /* quantize values to multiplier spec */
nuclear@0 782 if(post){
nuclear@0 783 for(i=0;i<posts;i++){
nuclear@0 784 int val=post[i]&0x7fff;
nuclear@0 785 switch(info->mult){
nuclear@0 786 case 1: /* 1024 -> 256 */
nuclear@0 787 val>>=2;
nuclear@0 788 break;
nuclear@0 789 case 2: /* 1024 -> 128 */
nuclear@0 790 val>>=3;
nuclear@0 791 break;
nuclear@0 792 case 3: /* 1024 -> 86 */
nuclear@0 793 val/=12;
nuclear@0 794 break;
nuclear@0 795 case 4: /* 1024 -> 64 */
nuclear@0 796 val>>=4;
nuclear@0 797 break;
nuclear@0 798 }
nuclear@0 799 post[i]=val | (post[i]&0x8000);
nuclear@0 800 }
nuclear@0 801
nuclear@0 802 out[0]=post[0];
nuclear@0 803 out[1]=post[1];
nuclear@0 804
nuclear@0 805 /* find prediction values for each post and subtract them */
nuclear@0 806 for(i=2;i<posts;i++){
nuclear@0 807 int ln=look->loneighbor[i-2];
nuclear@0 808 int hn=look->hineighbor[i-2];
nuclear@0 809 int x0=info->postlist[ln];
nuclear@0 810 int x1=info->postlist[hn];
nuclear@0 811 int y0=post[ln];
nuclear@0 812 int y1=post[hn];
nuclear@0 813
nuclear@0 814 int predicted=render_point(x0,x1,y0,y1,info->postlist[i]);
nuclear@0 815
nuclear@0 816 if((post[i]&0x8000) || (predicted==post[i])){
nuclear@0 817 post[i]=predicted|0x8000; /* in case there was roundoff jitter
nuclear@0 818 in interpolation */
nuclear@0 819 out[i]=0;
nuclear@0 820 }else{
nuclear@0 821 int headroom=(look->quant_q-predicted<predicted?
nuclear@0 822 look->quant_q-predicted:predicted);
nuclear@0 823
nuclear@0 824 int val=post[i]-predicted;
nuclear@0 825
nuclear@0 826 /* at this point the 'deviation' value is in the range +/- max
nuclear@0 827 range, but the real, unique range can always be mapped to
nuclear@0 828 only [0-maxrange). So we want to wrap the deviation into
nuclear@0 829 this limited range, but do it in the way that least screws
nuclear@0 830 an essentially gaussian probability distribution. */
nuclear@0 831
nuclear@0 832 if(val<0)
nuclear@0 833 if(val<-headroom)
nuclear@0 834 val=headroom-val-1;
nuclear@0 835 else
nuclear@0 836 val=-1-(val<<1);
nuclear@0 837 else
nuclear@0 838 if(val>=headroom)
nuclear@0 839 val= val+headroom;
nuclear@0 840 else
nuclear@0 841 val<<=1;
nuclear@0 842
nuclear@0 843 out[i]=val;
nuclear@0 844 post[ln]&=0x7fff;
nuclear@0 845 post[hn]&=0x7fff;
nuclear@0 846 }
nuclear@0 847 }
nuclear@0 848
nuclear@0 849 /* we have everything we need. pack it out */
nuclear@0 850 /* mark nontrivial floor */
nuclear@0 851 oggpack_write(opb,1,1);
nuclear@0 852
nuclear@0 853 /* beginning/end post */
nuclear@0 854 look->frames++;
nuclear@0 855 look->postbits+=ilog(look->quant_q-1)*2;
nuclear@0 856 oggpack_write(opb,out[0],ilog(look->quant_q-1));
nuclear@0 857 oggpack_write(opb,out[1],ilog(look->quant_q-1));
nuclear@0 858
nuclear@0 859
nuclear@0 860 /* partition by partition */
nuclear@0 861 for(i=0,j=2;i<info->partitions;i++){
nuclear@0 862 int class=info->partitionclass[i];
nuclear@0 863 int cdim=info->class_dim[class];
nuclear@0 864 int csubbits=info->class_subs[class];
nuclear@0 865 int csub=1<<csubbits;
nuclear@0 866 int bookas[8]={0,0,0,0,0,0,0,0};
nuclear@0 867 int cval=0;
nuclear@0 868 int cshift=0;
nuclear@0 869 int k,l;
nuclear@0 870
nuclear@0 871 /* generate the partition's first stage cascade value */
nuclear@0 872 if(csubbits){
nuclear@0 873 int maxval[8];
nuclear@0 874 for(k=0;k<csub;k++){
nuclear@0 875 int booknum=info->class_subbook[class][k];
nuclear@0 876 if(booknum<0){
nuclear@0 877 maxval[k]=1;
nuclear@0 878 }else{
nuclear@0 879 maxval[k]=sbooks[info->class_subbook[class][k]]->entries;
nuclear@0 880 }
nuclear@0 881 }
nuclear@0 882 for(k=0;k<cdim;k++){
nuclear@0 883 for(l=0;l<csub;l++){
nuclear@0 884 int val=out[j+k];
nuclear@0 885 if(val<maxval[l]){
nuclear@0 886 bookas[k]=l;
nuclear@0 887 break;
nuclear@0 888 }
nuclear@0 889 }
nuclear@0 890 cval|= bookas[k]<<cshift;
nuclear@0 891 cshift+=csubbits;
nuclear@0 892 }
nuclear@0 893 /* write it */
nuclear@0 894 look->phrasebits+=
nuclear@0 895 vorbis_book_encode(books+info->class_book[class],cval,opb);
nuclear@0 896
nuclear@0 897 #ifdef TRAIN_FLOOR1
nuclear@0 898 {
nuclear@0 899 FILE *of;
nuclear@0 900 char buffer[80];
nuclear@0 901 sprintf(buffer,"line_%dx%ld_class%d.vqd",
nuclear@0 902 vb->pcmend/2,posts-2,class);
nuclear@0 903 of=fopen(buffer,"a");
nuclear@0 904 fprintf(of,"%d\n",cval);
nuclear@0 905 fclose(of);
nuclear@0 906 }
nuclear@0 907 #endif
nuclear@0 908 }
nuclear@0 909
nuclear@0 910 /* write post values */
nuclear@0 911 for(k=0;k<cdim;k++){
nuclear@0 912 int book=info->class_subbook[class][bookas[k]];
nuclear@0 913 if(book>=0){
nuclear@0 914 /* hack to allow training with 'bad' books */
nuclear@0 915 if(out[j+k]<(books+book)->entries)
nuclear@0 916 look->postbits+=vorbis_book_encode(books+book,
nuclear@0 917 out[j+k],opb);
nuclear@0 918 /*else
nuclear@0 919 fprintf(stderr,"+!");*/
nuclear@0 920
nuclear@0 921 #ifdef TRAIN_FLOOR1
nuclear@0 922 {
nuclear@0 923 FILE *of;
nuclear@0 924 char buffer[80];
nuclear@0 925 sprintf(buffer,"line_%dx%ld_%dsub%d.vqd",
nuclear@0 926 vb->pcmend/2,posts-2,class,bookas[k]);
nuclear@0 927 of=fopen(buffer,"a");
nuclear@0 928 fprintf(of,"%d\n",out[j+k]);
nuclear@0 929 fclose(of);
nuclear@0 930 }
nuclear@0 931 #endif
nuclear@0 932 }
nuclear@0 933 }
nuclear@0 934 j+=cdim;
nuclear@0 935 }
nuclear@0 936
nuclear@0 937 {
nuclear@0 938 /* generate quantized floor equivalent to what we'd unpack in decode */
nuclear@0 939 /* render the lines */
nuclear@0 940 int hx=0;
nuclear@0 941 int lx=0;
nuclear@0 942 int ly=post[0]*info->mult;
nuclear@0 943 int n=ci->blocksizes[vb->W]/2;
nuclear@0 944
nuclear@0 945 for(j=1;j<look->posts;j++){
nuclear@0 946 int current=look->forward_index[j];
nuclear@0 947 int hy=post[current]&0x7fff;
nuclear@0 948 if(hy==post[current]){
nuclear@0 949
nuclear@0 950 hy*=info->mult;
nuclear@0 951 hx=info->postlist[current];
nuclear@0 952
nuclear@0 953 render_line0(n,lx,hx,ly,hy,ilogmask);
nuclear@0 954
nuclear@0 955 lx=hx;
nuclear@0 956 ly=hy;
nuclear@0 957 }
nuclear@0 958 }
nuclear@0 959 for(j=hx;j<vb->pcmend/2;j++)ilogmask[j]=ly; /* be certain */
nuclear@0 960 return(1);
nuclear@0 961 }
nuclear@0 962 }else{
nuclear@0 963 oggpack_write(opb,0,1);
nuclear@0 964 memset(ilogmask,0,vb->pcmend/2*sizeof(*ilogmask));
nuclear@0 965 return(0);
nuclear@0 966 }
nuclear@0 967 }
nuclear@0 968
nuclear@0 969 static void *floor1_inverse1(vorbis_block *vb,vorbis_look_floor *in){
nuclear@0 970 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in;
nuclear@0 971 vorbis_info_floor1 *info=look->vi;
nuclear@0 972 codec_setup_info *ci=vb->vd->vi->codec_setup;
nuclear@0 973
nuclear@0 974 int i,j,k;
nuclear@0 975 codebook *books=ci->fullbooks;
nuclear@0 976
nuclear@0 977 /* unpack wrapped/predicted values from stream */
nuclear@0 978 if(oggpack_read(&vb->opb,1)==1){
nuclear@0 979 int *fit_value=_vorbis_block_alloc(vb,(look->posts)*sizeof(*fit_value));
nuclear@0 980
nuclear@0 981 fit_value[0]=oggpack_read(&vb->opb,ilog(look->quant_q-1));
nuclear@0 982 fit_value[1]=oggpack_read(&vb->opb,ilog(look->quant_q-1));
nuclear@0 983
nuclear@0 984 /* partition by partition */
nuclear@0 985 for(i=0,j=2;i<info->partitions;i++){
nuclear@0 986 int class=info->partitionclass[i];
nuclear@0 987 int cdim=info->class_dim[class];
nuclear@0 988 int csubbits=info->class_subs[class];
nuclear@0 989 int csub=1<<csubbits;
nuclear@0 990 int cval=0;
nuclear@0 991
nuclear@0 992 /* decode the partition's first stage cascade value */
nuclear@0 993 if(csubbits){
nuclear@0 994 cval=vorbis_book_decode(books+info->class_book[class],&vb->opb);
nuclear@0 995
nuclear@0 996 if(cval==-1)goto eop;
nuclear@0 997 }
nuclear@0 998
nuclear@0 999 for(k=0;k<cdim;k++){
nuclear@0 1000 int book=info->class_subbook[class][cval&(csub-1)];
nuclear@0 1001 cval>>=csubbits;
nuclear@0 1002 if(book>=0){
nuclear@0 1003 if((fit_value[j+k]=vorbis_book_decode(books+book,&vb->opb))==-1)
nuclear@0 1004 goto eop;
nuclear@0 1005 }else{
nuclear@0 1006 fit_value[j+k]=0;
nuclear@0 1007 }
nuclear@0 1008 }
nuclear@0 1009 j+=cdim;
nuclear@0 1010 }
nuclear@0 1011
nuclear@0 1012 /* unwrap positive values and reconsitute via linear interpolation */
nuclear@0 1013 for(i=2;i<look->posts;i++){
nuclear@0 1014 int predicted=render_point(info->postlist[look->loneighbor[i-2]],
nuclear@0 1015 info->postlist[look->hineighbor[i-2]],
nuclear@0 1016 fit_value[look->loneighbor[i-2]],
nuclear@0 1017 fit_value[look->hineighbor[i-2]],
nuclear@0 1018 info->postlist[i]);
nuclear@0 1019 int hiroom=look->quant_q-predicted;
nuclear@0 1020 int loroom=predicted;
nuclear@0 1021 int room=(hiroom<loroom?hiroom:loroom)<<1;
nuclear@0 1022 int val=fit_value[i];
nuclear@0 1023
nuclear@0 1024 if(val){
nuclear@0 1025 if(val>=room){
nuclear@0 1026 if(hiroom>loroom){
nuclear@0 1027 val = val-loroom;
nuclear@0 1028 }else{
nuclear@0 1029 val = -1-(val-hiroom);
nuclear@0 1030 }
nuclear@0 1031 }else{
nuclear@0 1032 if(val&1){
nuclear@0 1033 val= -((val+1)>>1);
nuclear@0 1034 }else{
nuclear@0 1035 val>>=1;
nuclear@0 1036 }
nuclear@0 1037 }
nuclear@0 1038
nuclear@0 1039 fit_value[i]=(val+predicted)&0x7fff;
nuclear@0 1040 fit_value[look->loneighbor[i-2]]&=0x7fff;
nuclear@0 1041 fit_value[look->hineighbor[i-2]]&=0x7fff;
nuclear@0 1042
nuclear@0 1043 }else{
nuclear@0 1044 fit_value[i]=predicted|0x8000;
nuclear@0 1045 }
nuclear@0 1046
nuclear@0 1047 }
nuclear@0 1048
nuclear@0 1049 return(fit_value);
nuclear@0 1050 }
nuclear@0 1051 eop:
nuclear@0 1052 return(NULL);
nuclear@0 1053 }
nuclear@0 1054
nuclear@0 1055 static int floor1_inverse2(vorbis_block *vb,vorbis_look_floor *in,void *memo,
nuclear@0 1056 float *out){
nuclear@0 1057 vorbis_look_floor1 *look=(vorbis_look_floor1 *)in;
nuclear@0 1058 vorbis_info_floor1 *info=look->vi;
nuclear@0 1059
nuclear@0 1060 codec_setup_info *ci=vb->vd->vi->codec_setup;
nuclear@0 1061 int n=ci->blocksizes[vb->W]/2;
nuclear@0 1062 int j;
nuclear@0 1063
nuclear@0 1064 if(memo){
nuclear@0 1065 /* render the lines */
nuclear@0 1066 int *fit_value=(int *)memo;
nuclear@0 1067 int hx=0;
nuclear@0 1068 int lx=0;
nuclear@0 1069 int ly=fit_value[0]*info->mult;
nuclear@0 1070 /* guard lookup against out-of-range values */
nuclear@0 1071 ly=(ly<0?0:ly>255?255:ly);
nuclear@0 1072
nuclear@0 1073 for(j=1;j<look->posts;j++){
nuclear@0 1074 int current=look->forward_index[j];
nuclear@0 1075 int hy=fit_value[current]&0x7fff;
nuclear@0 1076 if(hy==fit_value[current]){
nuclear@0 1077
nuclear@0 1078 hx=info->postlist[current];
nuclear@0 1079 hy*=info->mult;
nuclear@0 1080 /* guard lookup against out-of-range values */
nuclear@0 1081 hy=(hy<0?0:hy>255?255:hy);
nuclear@0 1082
nuclear@0 1083 render_line(n,lx,hx,ly,hy,out);
nuclear@0 1084
nuclear@0 1085 lx=hx;
nuclear@0 1086 ly=hy;
nuclear@0 1087 }
nuclear@0 1088 }
nuclear@0 1089 for(j=hx;j<n;j++)out[j]*=FLOOR1_fromdB_LOOKUP[ly]; /* be certain */
nuclear@0 1090 return(1);
nuclear@0 1091 }
nuclear@0 1092 memset(out,0,sizeof(*out)*n);
nuclear@0 1093 return(0);
nuclear@0 1094 }
nuclear@0 1095
nuclear@0 1096 /* export hooks */
nuclear@0 1097 const vorbis_func_floor floor1_exportbundle={
nuclear@0 1098 &floor1_pack,&floor1_unpack,&floor1_look,&floor1_free_info,
nuclear@0 1099 &floor1_free_look,&floor1_inverse1,&floor1_inverse2
nuclear@0 1100 };