# HG changeset patch # User reimar # Date 1236339078 0 # Node ID 5de88e6e2494d6ebd90983db9f8bf10c4278c588 # Parent 49aaf6f7052b0bfbb33a748d33f1bb5cdaf8d26c Comment typo fixes for af_resample diff -r 49aaf6f7052b -r 5de88e6e2494 libaf/af_resample.c --- a/libaf/af_resample.c Fri Mar 06 10:53:30 2009 +0000 +++ b/libaf/af_resample.c Fri Mar 06 11:31:18 2009 +0000 @@ -33,7 +33,7 @@ Valid definitions are L8 and L16, where the number denotes the length of the filter. This definition affects the computational complexity (see play()), the performance (see filter.h) and the - memory usage. The filterlength is choosen to 8 if the machine is + memory usage. The filter length is chosen to 8 if the machine is slow and to 16 if the machine is fast and has MMX. */ @@ -175,11 +175,11 @@ switch(cmd){ case AF_CONTROL_REINIT:{ af_resample_t* s = (af_resample_t*)af->setup; - af_data_t* n = (af_data_t*)arg; // New configureation + af_data_t* n = (af_data_t*)arg; // New configuration int i,d = 0; int rv = AF_OK; - // Free space for circular bufers + // Free space for circular buffers if(s->xq){ for(i=1;idata->nch;i++) if(s->xq[i]) @@ -216,13 +216,13 @@ d*=m; } - // Create space for circular bufers + // Create space for circular buffers s->xq = malloc(n->nch*sizeof(void*)); for(i=0;inch;i++) s->xq[i] = malloc(2*L*af->data->bps); s->xi = 0; - // Check if the the design needs to be redone + // Check if the design needs to be redone if(s->up != af->data->rate/d || s->dn != n->rate/d){ float* w; float* wt; @@ -233,9 +233,9 @@ s->wi = 0; s->i = 0; - // Calculate cuttof frequency for filter + // Calculate cutoff frequency for filter fc = 1/(float)(max(s->up,s->dn)); - // Allocate space for polyphase filter bank and protptype filter + // Allocate space for polyphase filter bank and prototype filter w = malloc(sizeof(float) * s->up *L); if(NULL != s->w) free(s->w);