remove trailing whitespace

alsa.c

@@ -23,7 +23,7 @@
  * Open
  * SND_PCM_STATE_OPEN = 0,
  * 
- * Setup installed 
+ * Setup installed
  * SND_PCM_STATE_SETUP = 1,
  * 
  * Ready to start

browser.c

@@ -139,7 +139,7 @@ static int do_browser_load(const char *name)
 	if (S_ISREG(st.st_mode) && cmus_is_playlist(name)) {
 		char *buf;
 		int size;
-		
+
 		buf = mmap_file(name, &size);
 		if (size == -1)
 			return -1;

command_mode.c

@@ -1894,7 +1894,7 @@ static void cmd_lqueue(char *arg)
 		struct album_list *a = container_of(item, struct album_list, node);
 		struct tree_track *t;
 		struct rb_node *tmp;
- 
+
 		rb_for_each_entry(t, tmp, &a->album->track_root, tree_node)
 			play_queue_append(tree_track_info(t));
 		free(a);

convert.c

@@ -104,7 +104,7 @@ int utf8_encode(const char *inbuf, const char *encoding, char **outbuf)
 	outbuf_size = inbuf_size;
 	for (i = 0; i < inbuf_size; i++) {
 		unsigned char ch;
-		
+
 		ch = inbuf[i];
 		if (ch > 127)
 			outbuf_size++;

ffmpeg.c

@@ -523,7 +523,7 @@ static int ffmpeg_read_comments(struct input_plugin_data *ip_data, struct keyval
 #else
 	GROWING_KEYVALS(c);
 	AVDictionaryEntry *tag = NULL;
- 
+
 	while ((tag = av_dict_get(ic->metadata, "", tag, AV_DICT_IGNORE_SUFFIX))) {
 		if (tag && tag->value[0])
 			comments_add_const(&c, tag->key, tag->value);

history.c

@@ -128,7 +128,7 @@ void history_add_line(struct history *history, const char *line)
 	while (item != &history->head) {
 		struct list_head *next = item->next;
 		struct history_entry *hentry;
-		
+
 		hentry = container_of(item, struct history_entry, node);
 		if (strcmp(hentry->text, new->text) == 0) {
 			list_del(item);
@@ -170,7 +170,7 @@ const char *history_search_forward(struct history *history, const char *text)
 	search_len = strlen(text);
 	while (item != &history->head) {
 		struct history_entry *hentry;
-		
+
 		hentry = list_entry(item, struct history_entry, node);
 		if (strncmp(text, hentry->text, search_len) == 0) {
 			history->search_pos = item;
@@ -192,7 +192,7 @@ const char *history_search_backward(struct history *history, const char *text)
 	search_len = strlen(text);
 	while (item != &history->head) {
 		struct history_entry *hentry;
-		
+
 		hentry = list_entry(item, struct history_entry, node);
 		if (strncmp(text, hentry->text, search_len) == 0) {
 			history->search_pos = item;

http.c

@@ -397,7 +397,7 @@ int http_get(struct http_get *hg, struct keyval *headers, int timeout_ms)
 		gbuf_add_str(&buf, "\r\n");
 	}
 	gbuf_add_str(&buf, "\r\n");
-	
+
 	rc = http_write(hg->fd, buf.buffer, buf.len, timeout_ms);
 	if (rc)
 		goto out;

mad.c

@@ -104,15 +104,15 @@ static int mad_close(struct input_plugin_data *ip_data)
 static int mad_read(struct input_plugin_data *ip_data, char *buffer, int count)
 {
 	struct nomad *nomad;
-	
+
 	nomad = ip_data->private;
 	return nomad_read(nomad, buffer, count);
 }
 
 static int mad_seek(struct input_plugin_data *ip_data, double offset)
 {
 	struct nomad *nomad;
-	
+
 	nomad = ip_data->private;
 	return nomad_time_seek(nomad, offset);
 }

modplug.c

@@ -114,7 +114,7 @@ static int mod_read(struct input_plugin_data *ip_data, char *buffer, int count)
 {
 	struct mod_private *priv = ip_data->private;
 	int rc;
-	
+
 	errno = 0;
 	rc = ModPlug_Read(priv->file, buffer, count);
 	if (rc < 0) {

nomad.c

@@ -106,7 +106,7 @@ static inline int scale(mad_fixed_t sample)
 static inline double timer_to_seconds(mad_timer_t timer)
 {
 	signed long ms;
-	
+
 	ms = mad_timer_count(timer, MAD_UNITS_MILLISECONDS);
 	return (double)ms / 1000.0;
 }
@@ -628,7 +628,7 @@ void nomad_close(struct nomad *nomad)
 int nomad_read(struct nomad *nomad, char *buffer, int count)
 {
 	int i, j, size, psize, to;
-	
+
 	if (nomad->i == -1) {
 		int rc;
 

player.c

@@ -1069,7 +1069,7 @@ void player_exit(void)
 	producer_running = 0;
 	pthread_cond_broadcast(&producer_playing);
 	player_unlock();
-	
+
 	rc = pthread_join(consumer_thread, NULL);
 	BUG_ON(rc);
 	rc = pthread_join(producer_thread, NULL);

rbtree.c

@@ -4,7 +4,7 @@
   Red Black Trees
   (C) 1999  Andrea Arcangeli <[email protected]>
   (C) 2002  David Woodhouse <[email protected]>
-  
+
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
@@ -318,7 +318,7 @@ struct rb_node *rb_next(const struct rb_node *node)
 	/* If we have a right-hand child, go down and then left as far
 	   as we can. */
 	if (node->rb_right) {
-		node = node->rb_right; 
+		node = node->rb_right;
 		while (node->rb_left)
 			node=node->rb_left;
 		return (struct rb_node *)node;
@@ -346,7 +346,7 @@ struct rb_node *rb_prev(const struct rb_node *node)
 	/* If we have a left-hand child, go down and then right as far
 	   as we can. */
 	if (node->rb_left) {
-		node = node->rb_left; 
+		node = node->rb_left;
 		while (node->rb_right)
 			node=node->rb_right;
 		return (struct rb_node *)node;

rbtree.h

@@ -3,7 +3,7 @@
 /*
   Red Black Trees
   (C) 1999  Andrea Arcangeli <[email protected]>
-  
+
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
@@ -147,7 +147,7 @@ struct rb_node *rb_first(const struct rb_root *);
 struct rb_node *rb_last(const struct rb_root *);
 
 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
-void rb_replace_node(struct rb_node *victim, struct rb_node *new, 
+void rb_replace_node(struct rb_node *victim, struct rb_node *new,
 			struct rb_root *root);
 
 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,

uchar.c

@@ -184,7 +184,7 @@ int u_char_width(uchar u)
 	if (u < 0x1100U)
 		goto narrow;
 
-	/* Hangul Jamo init. consonants */ 
+	/* Hangul Jamo init. consonants */
 	if (u <= 0x115fU)
 		goto wide;
 

waveout.c

@@ -206,7 +206,7 @@ static int waveout_write(const char *buffer, int count)
 			waveout_error("waveOutWrite", rc);
 			break;
 		}
- 
+
 		written += len;
 		count -= len;
 		buffer_idx = (buffer_idx + 1) % buffer_count;