/********************************************************************
* *
* THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. *
- * USE, DISTRIBUTION AND REPRODUCTION OF THIS SOURCE IS GOVERNED BY *
- * THE GNU LESSER/LIBRARY PUBLIC LICENSE, WHICH IS INCLUDED WITH *
- * THIS SOURCE. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
+ * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
+ * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
+ * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
* *
- * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2000 *
- * by Monty <monty@xiph.org> and the XIPHOPHORUS Company *
- * http://www.xiph.org/ *
+ * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2001 *
+ * by the Xiph.Org Foundation http://www.xiph.org/ *
* *
********************************************************************
function: residue backend 0 partitioner/classifier
- last mod: $Id: residuesplit.c,v 1.7 2000/11/08 03:23:23 xiphmont Exp $
+ last mod: $Id$
********************************************************************/
/* does not guard against invalid settings; eg, a subn of 16 and a
subgroup request of 32. Max subn of 128 */
-static void _testhack(float *vec,int n,float *entropy){
+static float _testhack(float *vec,int n){
int i,j=0;
- float max=0.;
+ float max=0.f;
float temp[128];
+ float entropy=0.;
/* setup */
for(i=0;i<n;i++)temp[i]=fabs(vec[i]);
for(i=0;i<n;i++)temp[i]=rint(temp[i]);
- while(1){
+ for(i=0;i<n;i++)
+ entropy+=temp[i];
+ return entropy;
+
+ /*while(1){
entropy[j]=max;
n>>=1;
j++;
for(i=0;i<n;i++){
temp[i]+=temp[i+n];
}
- max=0.;
+ max=0.f;
for(i=0;i<n;i++)
if(temp[i]>max)max=temp[i];
- }
+ }*/
}
static FILE *of;
/* This is currently a bit specific to/hardwired for mapping 0; things
will need to change in the future when we get real multichannel
mappings */
-int quantaux(float *res,int n,float *ebound,float *mbound,int *subgrp,int parts, int subn){
- long i,j;
- float entropy[8];
+int quantaux(float *res,int n,float *ebound,float *mbound,int *subgrp,int parts, int subn,
+ int *class){
+ long i,j,part=0;
int aux;
- for(i=0;i<=n-subn;i+=subn){
- float max=0.;
+ for(i=0;i<=n-subn;i+=subn,part++){
+ float max=0.f;
+ float lentropy=0.f;
+
+ lentropy=_testhack(res+i,subn);
- _testhack(res+i,subn,entropy);
for(j=0;j<subn;j++)
if(fabs(res[i+j])>max)max=fabs(res[i+j]);
for(j=0;j<parts-1;j++)
- if(entropy[subgrp[j]]<=ebound[j] &&
- max<=mbound[j])
- break;
- aux=j;
+ if(lentropy<=ebound[j] &&
+ max<=mbound[j] &&
+ part<subgrp[j])
+ break;
+ class[part]=aux=j;
fprintf(of,"%d, ",aux);
+ }
+ fprintf(of,"\n");
+
+ return(0);
+}
+
+int quantwrite(float *res,int n,int subn, int *class,int offset){
+ long i,j,part=0;
+ int aux;
+
+ for(i=0;i<=n-subn;i+=subn,part++){
+ aux=class[part];
for(j=0;j<subn;j++)
- fprintf(or[aux],"%g, ",res[j+i]);
+ fprintf(or[aux+offset],"%g, ",res[j+i]);
- fprintf(or[aux],"\n");
+ fprintf(or[aux+offset],"\n");
}
- fprintf(of,"\n");
-
return(0);
}
static void usage(){
fprintf(stderr,
- "usage:\n"
- "residuesplit <res> <begin,n,group> <baseout> <ent,peak,sub> [<ent,peak,sub>]...\n"
- " where begin,n,group is first scalar, \n"
- " number of scalars of each in line,\n"
- " number of scalars in a group\n"
- " ent is the maximum entropy value allowed for membership in a group\n"
- " peak is the maximum amplitude value allowed for membership in a group\n"
- " subn is the maximum entropy value allowed for membership in a group\n"
-
- "eg: residuesplit mask.vqd floor.vqd 0,1024,16 res 0,.5,16 3,1.5,8 \n"
- "produces resaux.vqd and res_0...n.vqd\n\n");
+ "usage:\n"
+ "residuesplit <res> [<res>] <begin,n,group> <baseout> <ent,peak,sub> [<ent,peak,sub>]...\n"
+ " where begin,n,group is first scalar, \n"
+ " number of scalars of each in line,\n"
+ " number of scalars in a group\n"
+ " ent is the maximum entropy value allowed for membership in a group\n"
+ " peak is the maximum amplitude value allowed for membership in a group\n"
+ " subn is the maximum subpartiton number allowed in the group\n\n");
exit(1);
}
int main(int argc, char *argv[]){
char *buffer;
char *base;
- int i,parts,begin,n,subn,*subgrp;
- FILE *res;
+ int i,j,parts,begin,n,subn,*subgrp,*class;
+ FILE **res;
+ int resfiles=0;
float *ebound,*mbound,*vec;
long c=0;
if(argc<5)usage();
- base=strdup(argv[3]);
+ /* count the res file names, open the files */
+ while(!strcmp(argv[resfiles+1]+strlen(argv[resfiles+1])-4,".vqd"))
+ resfiles++;
+ if(resfiles<1)usage();
+
+ res=alloca(sizeof(*res)*resfiles);
+ for(i=0;i<resfiles;i++){
+ res[i]=fopen(argv[i+1],"r");
+ if(!(res+i)){
+ fprintf(stderr,"Could not open file %s\n",argv[1+i]);
+ exit(1);
+ }
+ }
+
+ base=strdup(argv[2+resfiles]);
buffer=alloca(strlen(base)+20);
{
- char *pos=strchr(argv[2],',');
- begin=atoi(argv[2]);
+ char *pos=strchr(argv[1+resfiles],',');
+ begin=atoi(argv[1+resfiles]);
if(!pos)
usage();
else
}
/* how many parts?... */
- parts=argc-3;
+ parts=argc-resfiles-2;
ebound=_ogg_malloc(sizeof(float)*parts);
mbound=_ogg_malloc(sizeof(float)*parts);
subgrp=_ogg_malloc(sizeof(int)*parts);
for(i=0;i<parts-1;i++){
- char *pos=strchr(argv[4+i],',');
- if(*argv[4+i]==',')
- ebound[i]=1e50;
+ char *pos=strchr(argv[3+i+resfiles],',');
+ subgrp[i]=0;
+ if(*argv[3+i+resfiles]==',')
+ ebound[i]=1e50f;
else
- ebound[i]=atof(argv[4+i]);
+ ebound[i]=atof(argv[3+i+resfiles]);
if(!pos){
- mbound[i]=1e50;
- subgrp[i]=_ilog(subn)-1;
- }else{
- if(*(pos+1)==',')
- mbound[i]=1e50;
- else
- mbound[i]=atof(pos+1);
- pos=strchr(pos+1,',');
+ mbound[i]=1e50f;
+ }else{
+ if(*(pos+1)==',')
+ mbound[i]=1e50f;
+ else
+ mbound[i]=atof(pos+1);
+ pos=strchr(pos+1,',');
+
+ if(pos)
+ subgrp[i]=atoi(pos+1);
- if(!pos){
- subgrp[i]=_ilog(subn)-1;
- }else{
- subgrp[i]=_ilog(atoi(pos+1))-1;
- }
- }
+ }
+ if(subgrp[i]<=0)subgrp[i]=99999;
}
- ebound[i]=1e50;
- mbound[i]=1e50;
- subgrp[i]=_ilog(subn)-1;
-
- res=fopen(argv[1],"r");
- if(!res){
- fprintf(stderr,"Could not open file %s\n",argv[1]);
- exit(1);
- }
+ ebound[i]=1e50f;
+ mbound[i]=1e50f;
+ subgrp[i]=9999999;
- or=alloca(parts*sizeof(FILE*));
+ or=alloca(parts*resfiles*sizeof(FILE*));
sprintf(buffer,"%saux.vqd",base);
of=fopen(buffer,"w");
if(!of){
fprintf(stderr,"Could not open file %s for writing\n",buffer);
exit(1);
}
- for(i=0;i<parts;i++){
- sprintf(buffer,"%s_%d.vqd",base,i);
- or[i]=fopen(buffer,"w");
- if(!or[i]){
- fprintf(stderr,"Could not open file %s for writing\n",buffer);
- exit(1);
+
+ for(j=0;j<resfiles;j++){
+ for(i=0;i<parts;i++){
+ sprintf(buffer,"%s_%d%c.vqd",base,i,j+65);
+ or[i+j*parts]=fopen(buffer,"w");
+ if(!or[i+j*parts]){
+ fprintf(stderr,"Could not open file %s for writing\n",buffer);
+ exit(1);
+ }
}
}
vec=_ogg_malloc(sizeof(float)*n);
+ class=_ogg_malloc(sizeof(float)*n);
/* get the input line by line and process it */
- while(!feof(res)){
- if(getline(res,vec,begin,n))
- quantaux(vec,n,ebound,mbound,subgrp,parts,subn);
+ while(1){
+ if(getline(res[0],vec,begin,n)){
+ quantaux(vec,n,ebound,mbound,subgrp,parts,subn,class);
+ quantwrite(vec,n,subn,class,0);
+
+ for(i=1;i<resfiles;i++){
+ if(getline(res[i],vec,begin,n)){
+ quantwrite(vec,n,subn,class,parts*i);
+ }else{
+ fprintf(stderr,"Getline loss of sync (%d).\n\n",i);
+ exit(1);
+ }
+ }
+ }else{
+ if(feof(res[0]))break;
+ fprintf(stderr,"Getline loss of sync (0).\n\n");
+ exit(1);
+ }
+
c++;
if(!(c&0xf)){
- spinnit("kB so far...",(int)(ftell(res)/1024));
+ spinnit("kB so far...",(int)(ftell(res[0])/1024));
}
}
- fclose(res);
+ for(i=0;i<resfiles;i++)
+ fclose(res[i]);
fclose(of);
- for(i=0;i<parts;i++)
+ for(i=0;i<parts*resfiles;i++)
fclose(or[i]);
fprintf(stderr,"\rDone \n");
return(0);
projects / platform / upstream / libvorbis.git / blobdiff