From b2645847a0b1bdd585a119504333e78e7c0ce02c Mon Sep 17 00:00:00 2001
From: Lukas Fleischer <calcurse@cryptocrack.de>
Date: Thu, 9 Jun 2011 21:36:37 +0200
Subject: Fix whitespace issues
Strip trailing whitespaces in all source files.
Signed-off-by: Lukas Fleischer <calcurse@cryptocrack.de>
---
src/calcurse.h | 18 +++++++++---------
src/event.c | 2 +-
src/htable.h | 6 +++---
src/llist.c | 4 ++--
src/recur.c | 4 ++--
5 files changed, 17 insertions(+), 17 deletions(-)
(limited to 'src')
diff --git a/src/calcurse.h b/src/calcurse.h
index 261a287..34de7ed 100644
--- a/src/calcurse.h
+++ b/src/calcurse.h
@@ -140,7 +140,7 @@
#define TAB 9
#define SPACE 32
-#define KEYS_KEYLEN 3 /* length of each keybinding */
+#define KEYS_KEYLEN 3 /* length of each keybinding */
#define KEYS_LABELEN 8 /* length of command description */
#define KEYS_CMDS_PER_LINE 6 /* max number of commands per line */
@@ -263,7 +263,7 @@ struct apoint
#define APOINT_NOTIFY 0x1 /* Item needs to be notified */
#define APOINT_NOTIFIED 0x2 /* Item was already notified */
int state;
-
+
char *mesg;
char *note;
};
@@ -311,7 +311,7 @@ enum recur_type {
RECUR_WEEKLY,
RECUR_MONTHLY,
RECUR_YEARLY,
- RECUR_TYPES
+ RECUR_TYPES
};
/* To describe an item's repetition. */
@@ -349,7 +349,7 @@ struct notify_app {
char state;
pthread_mutex_t mutex;
};
-
+
struct io_file {
FILE *fd;
char name[BUFSIZ];
@@ -381,7 +381,7 @@ enum key {
KEY_GENERIC_SCROLL_DOWN,
KEY_GENERIC_SCROLL_UP,
KEY_GENERIC_GOTO_TODAY,
-
+
KEY_MOVE_RIGHT,
KEY_MOVE_LEFT,
KEY_MOVE_DOWN,
@@ -398,7 +398,7 @@ enum key {
KEY_VIEW_NOTE,
KEY_RAISE_PRIORITY,
KEY_LOWER_PRIORITY,
-
+
NBKEYS,
KEY_UNDEF
};
@@ -477,9 +477,9 @@ enum eraseflg {
ERASE_FORCE,
ERASE_FORCE_KEEP_NOTE,
ERASE_FORCE_ONLY_NOTE,
- ERASE_CUT
+ ERASE_CUT
};
-
+
/* Return codes for the getstring() function. */
enum getstr {
GETSTRING_VALID,
@@ -731,7 +731,7 @@ void mem_stats (void);
# define mem_realloc(p, n, s) xrealloc ((p), (n), (s))
# define mem_strdup(s) xstrdup ((s))
# define mem_free(p) xfree ((p))
-# define mem_stats()
+# define mem_stats()
#endif /* CALCURSE_MEMORY_DEBUG */
diff --git a/src/event.c b/src/event.c
index 7e76097..c395ed8 100644
--- a/src/event.c
+++ b/src/event.c
@@ -105,7 +105,7 @@ event_new (char *mesg, char *note, long day, int id)
ev->day = day;
ev->id = id;
ev->note = (note != NULL) ? mem_strdup (note) : NULL;
-
+
LLIST_ADD_SORTED (&eventlist, ev, event_cmp_day);
return ev;
diff --git a/src/htable.h b/src/htable.h
index 2f7027b..10d04c1 100644
--- a/src/htable.h
+++ b/src/htable.h
@@ -44,7 +44,7 @@
* number). It works by transforming the key using a hash function into a hash,
* a number that is used as an index in an array to locate the desired location
* ("bucket") where the values should be.
- *
+ *
* Hash tables support the efficient insertion of new entries, in expected O(1)
* time. The time spent in searching depends on the hash function and the load
* of the hash table; both insertion and search approach O(1) time with well
@@ -59,7 +59,7 @@
* capacity of data would only be about twice as slow on average as the same
* table at its recommended capacity).
*/
-
+
#define HTABLE_HEAD(name, size, type) \
struct name { \
uint32_t noitems; /* Number of items stored in hash table. */ \
@@ -287,7 +287,7 @@ name##_HTABLE_NEXT(struct name *head, struct type *elm) \
#define HTABLE_LOOKUP(name, x, y) name##_HTABLE_LOOKUP(x, y)
#define HTABLE_FIRST_FROM(name, x, y) (HTABLE_EMPTY(x) ? NULL \
: name##_HTABLE_FIRST_FROM(x, y))
-#define HTABLE_FIRST(name, x) HTABLE_FIRST_FROM(name, x, FIRST_BKT)
+#define HTABLE_FIRST(name, x) HTABLE_FIRST_FROM(name, x, FIRST_BKT)
#define HTABLE_NEXT(name, x, y) (HTABLE_EMPTY(x) ? NULL \
: name##_HTABLE_NEXT(x, y))
diff --git a/src/llist.c b/src/llist.c
index 9a379c6..b1c2df7 100644
--- a/src/llist.c
+++ b/src/llist.c
@@ -34,7 +34,7 @@
*
*/
-#include "calcurse.h"
+#include "calcurse.h"
/*
* Initialize a list.
@@ -54,7 +54,7 @@ llist_free (llist_t *l)
llist_item_t *i, *t;
for (i = l->head; i; i = t)
- {
+ {
t = i->next;
mem_free (i);
}
diff --git a/src/recur.c b/src/recur.c
index 3697036..430e543 100644
--- a/src/recur.c
+++ b/src/recur.c
@@ -728,7 +728,7 @@ recur_event_erase (long start, unsigned num, unsigned delete_whole,
enum eraseflg flag)
{
llist_item_t *i;
-
+
i = LLIST_FIND_NTH (&recur_elist, num, start, recur_event_inday);
if (!i)
@@ -776,7 +776,7 @@ recur_apoint_erase (long start, unsigned num, unsigned delete_whole,
{
llist_item_t *i;
int need_check_notify = 0;
-
+
i = LLIST_TS_FIND_NTH (&recur_alist_p, num, start, recur_apoint_inday);
if (!i)
--
cgit v1.2.3-70-g09d2