mirrors/alsa-lib
1
0
Fork 0
mirror of https://github.com/alsa-project/alsa-lib.git synced 2025-10-28 05:40:23 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Avoid use of C++ keywords

Browse source
This commit is contained in:
Abramo Bagnara 2001-03-29 14:39:02 +00:00
parent 413d065421
commit ce8275b943
1 changed files with 11 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

22
include/list.h
View file

@ -36,14 +36,14 @@ struct list_head {
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static __inline__ void __list_add(struct list_head * new,
struct list_head * prev,
struct list_head * next)
static __inline__ void __list_add(struct list_head * _new,
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;
}
/**
@ -54,9 +54,9 @@ static __inline__ void __list_add(struct list_head * new,
* 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);
}
/**
@ -67,9 +67,9 @@ static __inline__ void list_add(struct list_head *new, struct list_head *head)
* 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);
}
/*