diff options
| author | Richard Braun <rbraun@sceen.net> | 2018-02-24 07:25:55 +0100 |
|---|---|---|
| committer | Richard Braun <rbraun@sceen.net> | 2018-02-24 07:25:55 +0100 |
| commit | c31ddfaf11320dea4828c753f48a29041643f552 (patch) | |
| tree | 88b5c776170c406f90e686c347c7b9fef09d9c38 /kern/hlist.h | |
| parent | 6a69c45189d3c576cc18dfac6e426cd606831657 (diff) | |
kern/{cbuf,fmt,hash,hlist,list,plist,rdxtree,shell,slist}: update from upstream
Note that this commit changes the order of some list operations without
triggering warnings.
Diffstat (limited to 'kern/hlist.h')
| -rw-r--r-- | kern/hlist.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/kern/hlist.h b/kern/hlist.h index 84458881..62b451ab 100644 --- a/kern/hlist.h +++ b/kern/hlist.h @@ -149,7 +149,7 @@ hlist_insert_head(struct hlist *list, struct hlist_node *node) * Insert a node before another node. */ static inline void -hlist_insert_before(struct hlist_node *next, struct hlist_node *node) +hlist_insert_before(struct hlist_node *node, struct hlist_node *next) { node->next = next; node->pprev = next->pprev; @@ -161,7 +161,7 @@ hlist_insert_before(struct hlist_node *next, struct hlist_node *node) * Insert a node after another node. */ static inline void -hlist_insert_after(struct hlist_node *prev, struct hlist_node *node) +hlist_insert_after(struct hlist_node *node, struct hlist_node *prev) { node->next = prev->next; node->pprev = &prev->next; @@ -303,7 +303,7 @@ hlist_rcu_insert_head(struct hlist *list, struct hlist_node *node) * Insert a node before another node. */ static inline void -hlist_rcu_insert_before(struct hlist_node *next, struct hlist_node *node) +hlist_rcu_insert_before(struct hlist_node *node, struct hlist_node *next) { node->next = next; node->pprev = next->pprev; @@ -315,7 +315,7 @@ hlist_rcu_insert_before(struct hlist_node *next, struct hlist_node *node) * Insert a node after another node. */ static inline void -hlist_rcu_insert_after(struct hlist_node *prev, struct hlist_node *node) +hlist_rcu_insert_after(struct hlist_node *node, struct hlist_node *prev) { node->next = prev->next; node->pprev = &prev->next; |