summaryrefslogtreecommitdiff
path: root/accel-pppd/triton/list.h
diff options
context:
space:
mode:
Diffstat (limited to 'accel-pppd/triton/list.h')
-rw-r--r--accel-pppd/triton/list.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/accel-pppd/triton/list.h b/accel-pppd/triton/list.h
index b17afab7..a650037f 100644
--- a/accel-pppd/triton/list.h
+++ b/accel-pppd/triton/list.h
@@ -29,14 +29,14 @@ typedef struct list_head {
} while (0)
/*
- * Insert a new entry between two known consecutive entries.
+ * Insert a new entry between two known consecutive entries.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static void inline prefetch(void *p){}
-
+
static inline void __list_add(struct list_head *new,
struct list_head *prev,
struct list_head *next)
@@ -105,7 +105,7 @@ static inline void list_del(struct list_head *entry)
static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
- INIT_LIST_HEAD(entry);
+ INIT_LIST_HEAD(entry);
}
/**
@@ -231,7 +231,7 @@ static inline void list_splice_init(struct list_head *list,
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
pos = pos->prev, prefetch(pos->prev))
-
+
/**
* list_for_each_safe - iterate over a list safe against removal of list entry
* @pos: the &struct list_head to use as a loop counter.