mirror of
https://github.com/linux-msm/qdl.git
synced 2026-10-07 06:29:17 -07:00
Bjorn Andersson
5d93a92f45
It's not obvious that list_add() appends elements to the list, and upcoming patches needs a few new list operations. Improve the implementation by renaming list_add() to list_append() and introduce list_prepend() for cases where we need to inject entries in the beginning of the queue. Conditionally defined container_of() to allow using list.h without including qdl.h. Signed-off-by: Bjorn Andersson <bjorn.andersson@oss.qualcomm.com>
90 lines
2.1 KiB
C
90 lines
2.1 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause */
|
|
/*
|
|
* Copyright (c) 2016, Linaro Ltd.
|
|
*/
|
|
#ifndef __LIST_H__
|
|
#define __LIST_H__
|
|
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
|
|
struct list_head {
|
|
struct list_head *prev;
|
|
struct list_head *next;
|
|
};
|
|
|
|
#define LIST_INIT(list) { &(list), &(list) }
|
|
|
|
static inline void list_init(struct list_head *list)
|
|
{
|
|
list->prev = list;
|
|
list->next = list;
|
|
}
|
|
|
|
static inline bool list_empty(struct list_head *list)
|
|
{
|
|
return list->next == list;
|
|
}
|
|
|
|
static inline void list_prepend(struct list_head *list, struct list_head *item)
|
|
{
|
|
struct list_head *first = list->next;
|
|
|
|
item->next = first;
|
|
item->prev = list;
|
|
|
|
list->next = item;
|
|
first->prev = item;
|
|
}
|
|
|
|
static inline void list_append(struct list_head *list, struct list_head *item)
|
|
{
|
|
struct list_head *prev = list->prev;
|
|
|
|
item->next = list;
|
|
item->prev = prev;
|
|
|
|
prev->next = item;
|
|
list->prev = item;
|
|
}
|
|
|
|
static inline void list_del(struct list_head *item)
|
|
{
|
|
item->prev->next = item->next;
|
|
item->next->prev = item->prev;
|
|
}
|
|
|
|
#define list_for_each(item, list) \
|
|
for (item = (list)->next; item != list; item = item->next)
|
|
|
|
#define list_for_each_safe(item, tmp, list) \
|
|
for (item = (list)->next, tmp = item->next; item != list; item = tmp, tmp = item->next)
|
|
|
|
#define list_entry(item, type, member) \
|
|
container_of(item, type, member)
|
|
|
|
#define list_entry_first(list, type, member) \
|
|
container_of((list)->next, type, member)
|
|
|
|
#define list_entry_next(item, member) \
|
|
container_of((item)->member.next, typeof(*(item)), member)
|
|
|
|
#define list_for_each_entry(item, list, member) \
|
|
for (item = list_entry_first(list, typeof(*(item)), member); \
|
|
&item->member != list; \
|
|
item = list_entry_next(item, member))
|
|
|
|
#define list_for_each_entry_continue(item, list, member) \
|
|
for (item = list_entry_next(item, member); \
|
|
&item->member != list; \
|
|
item = list_entry_next(item, member))
|
|
|
|
#define list_for_each_entry_safe(item, next, list, member) \
|
|
for (item = list_entry_first(list, typeof(*(item)), member), \
|
|
next = list_entry_next(item, member); \
|
|
&item->member != list; \
|
|
item = next, \
|
|
next = list_entry_next(item, member)) \
|
|
|
|
#endif
|