geemili
/
drm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

tests/radeon: set the list* functions as inline 

To silence the chatty compiler.
As a future work we may want to merge these with libdrm_lists.h

Cc: Jerome Glisse <jglisse@redhat.com>
Signed-off-by: Emil Velikov <emil.l.velikov@gmail.com>
Reviewed-by: Jan Vesely <jan.vesely@rutgers.edu>
main
Emil Velikov 2015-02-23 14:17:19 +00:00
parent 0b3e540aa4
commit f799a527db
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
tests/radeon/list.h
View File

@ -44,13 +44,13 @@ struct list_head
struct list_head *next;
};
static void list_inithead(struct list_head *item)
static inline void list_inithead(struct list_head *item)
{
item->prev = item;
item->next = item;
}
static void list_add(struct list_head *item, struct list_head *list)
static inline void list_add(struct list_head *item, struct list_head *list)
{
item->prev = list;
item->next = list->next;
@ -58,7 +58,7 @@ static void list_add(struct list_head *item, struct list_head *list)
list->next = item;
}
static void list_addtail(struct list_head *item, struct list_head *list)
static inline void list_addtail(struct list_head *item, struct list_head *list)
{
item->next = list;
item->prev = list->prev;
@ -66,7 +66,7 @@ static void list_addtail(struct list_head *item, struct list_head *list)
list->prev = item;
}
static void list_replace(struct list_head *from, struct list_head *to)
static inline void list_replace(struct list_head *from, struct list_head *to)
{
to->prev = from->prev;
to->next = from->next;
@ -74,13 +74,13 @@ static void list_replace(struct list_head *from, struct list_head *to)
from->prev->next = to;
}
static void list_del(struct list_head *item)
static inline void list_del(struct list_head *item)
{
item->prev->next = item->next;
item->next->prev = item->prev;
}
static void list_delinit(struct list_head *item)
static inline void list_delinit(struct list_head *item)
{
item->prev->next = item->next;
item->next->prev = item->prev;