projects
/
project
/
libubox.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
51711be
)
list.h: rename parameter named "new" to "_new" to avoid using a reserved C++ keyword...
author
Felix Fietkau
<nbd@openwrt.org>
Thu, 27 Oct 2011 08:15:01 +0000
(10:15 +0200)
committer
Felix Fietkau
<nbd@openwrt.org>
Thu, 27 Oct 2011 08:16:09 +0000
(10:16 +0200)
list.h
patch
|
blob
|
history
diff --git
a/list.h
b/list.h
index
10dd4dc
..
76909c5
100644
(file)
--- a/
list.h
+++ b/
list.h
@@
-46,41
+46,41
@@
static inline void INIT_LIST_HEAD(struct list_head *list)
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
-static inline void __list_add(struct list_head *new,
+static inline void __list_add(struct list_head *
_
new,
struct list_head *prev,
struct list_head *next)
{
struct list_head *prev,
struct list_head *next)
{
- next->prev = new;
- new->next = next;
- new->prev = prev;
- prev->next = new;
+ next->prev =
_
new;
+
_
new->next = next;
+
_
new->prev = prev;
+ prev->next =
_
new;
}
/**
* list_add - add a new entry
}
/**
* list_add - add a new entry
- * @new: new entry to be added
+ * @
_
new: new entry to be added
* @head: list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
* @head: list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
-static inline void list_add(struct list_head *new, struct list_head *head)
+static inline void list_add(struct list_head *
_
new, struct list_head *head)
{
{
- __list_add(new, head, head->next);
+ __list_add(
_
new, head, head->next);
}
/**
* list_add_tail - add a new entry
}
/**
* list_add_tail - add a new entry
- * @new: new entry to be added
+ * @
_
new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
-static inline void list_add_tail(struct list_head *new, struct list_head *head)
+static inline void list_add_tail(struct list_head *
_
new, struct list_head *head)
{
{
- __list_add(new, head->prev, head);
+ __list_add(
_
new, head->prev, head);
}
}
@@
-113,23
+113,23
@@
static inline void list_del(struct list_head *entry)
/**
* list_replace - replace old entry by new one
* @old : the element to be replaced
/**
* list_replace - replace old entry by new one
* @old : the element to be replaced
- * @new : the new element to insert
+ * @
_
new : the new element to insert
*
* If @old was empty, it will be overwritten.
*/
static inline void list_replace(struct list_head *old,
*
* If @old was empty, it will be overwritten.
*/
static inline void list_replace(struct list_head *old,
- struct list_head *new)
+ struct list_head *
_
new)
{
{
- new->next = old->next;
-
new->next->prev =
new;
- new->prev = old->prev;
-
new->prev->next =
new;
+
_
new->next = old->next;
+
_new->next->prev = _
new;
+
_
new->prev = old->prev;
+
_new->prev->next = _
new;
}
static inline void list_replace_init(struct list_head *old,
}
static inline void list_replace_init(struct list_head *old,
- struct list_head *new)
+ struct list_head *
_
new)
{
{
- list_replace(old, new);
+ list_replace(old,
_
new);
INIT_LIST_HEAD(old);
}
INIT_LIST_HEAD(old);
}