|
@@ -34,9 +34,11 @@ struct list_head {
|
|
|
#define LIST_HEAD(name) \
|
|
|
struct list_head name = LIST_HEAD_INIT(name)
|
|
|
|
|
|
-#define INIT_LIST_HEAD(ptr) do { \
|
|
|
- (ptr)->next = (ptr); (ptr)->prev = (ptr); \
|
|
|
-} while (0)
|
|
|
+static inline void INIT_LIST_HEAD(struct list_head *list)
|
|
|
+{
|
|
|
+ list->next = list;
|
|
|
+ list->prev = list;
|
|
|
+}
|
|
|
|
|
|
/*
|
|
|
* Insert a new entry between two known consecutive entries.
|
|
@@ -534,7 +536,11 @@ struct hlist_node {
|
|
|
#define HLIST_HEAD_INIT { .first = NULL }
|
|
|
#define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
|
|
|
#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
|
|
|
-#define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
|
|
|
+static inline void INIT_HLIST_NODE(struct hlist_node *h)
|
|
|
+{
|
|
|
+ h->next = NULL;
|
|
|
+ h->pprev = NULL;
|
|
|
+}
|
|
|
|
|
|
static inline int hlist_unhashed(const struct hlist_node *h)
|
|
|
{
|