summaryrefslogtreecommitdiffstats
path: root/libaf/af_delay.c
diff options
context:
space:
mode:
authordiego <diego@b3059339-0415-0410-9bf9-f77b7e298cf2>2009-05-13 02:58:57 +0000
committerdiego <diego@b3059339-0415-0410-9bf9-f77b7e298cf2>2009-05-13 02:58:57 +0000
commit6e9cbdc10448203e7c8b2de41447442fcc9f7bae (patch)
tree0ed465592509105fdbeab27fc12ddbb2e3590aa5 /libaf/af_delay.c
parenteafe5b7517bbf408ae1ffc936a3abe2313c3b334 (diff)
downloadmpv-6e9cbdc10448203e7c8b2de41447442fcc9f7bae.tar.bz2
mpv-6e9cbdc10448203e7c8b2de41447442fcc9f7bae.tar.xz
whitespace cosmetics: Remove all trailing whitespace.
git-svn-id: svn://svn.mplayerhq.hu/mplayer/trunk@29305 b3059339-0415-0410-9bf9-f77b7e298cf2
Diffstat (limited to 'libaf/af_delay.c')
-rw-r--r--libaf/af_delay.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/libaf/af_delay.c b/libaf/af_delay.c
index 4b94e00066..02327d0c53 100644
--- a/libaf/af_delay.c
+++ b/libaf/af_delay.c
@@ -37,7 +37,7 @@ typedef struct af_delay_s
void* q[AF_NCH]; // Circular queues used for delaying audio signal
int wi[AF_NCH]; // Write index
int ri; // Read index
- float d[AF_NCH]; // Delay [ms]
+ float d[AF_NCH]; // Delay [ms]
}af_delay_t;
// Initialization and runtime control
@@ -108,7 +108,7 @@ static int control(struct af_instance_s* af, int cmd, void* arg)
return AF_UNKNOWN;
}
-// Deallocate memory
+// Deallocate memory
static void uninit(struct af_instance_s* af)
{
int i;
@@ -134,7 +134,7 @@ static af_data_t* play(struct af_instance_s* af, af_data_t* data)
switch(c->bps){
case 1:{
int8_t* a = c->audio;
- int8_t* q = s->q[ch];
+ int8_t* q = s->q[ch];
int wi = s->wi[ch];
ri = s->ri;
for(i=ch;i<len;i+=nch){
@@ -148,7 +148,7 @@ static af_data_t* play(struct af_instance_s* af, af_data_t* data)
}
case 2:{
int16_t* a = c->audio;
- int16_t* q = s->q[ch];
+ int16_t* q = s->q[ch];
int wi = s->wi[ch];
ri = s->ri;
for(i=ch;i<len;i+=nch){
@@ -162,7 +162,7 @@ static af_data_t* play(struct af_instance_s* af, af_data_t* data)
}
case 4:{
int32_t* a = c->audio;
- int32_t* q = s->q[ch];
+ int32_t* q = s->q[ch];
int wi = s->wi[ch];
ri = s->ri;
for(i=ch;i<len;i+=nch){