mirror of
https://github.com/linux-msm/cdba.git
synced 2026-10-06 21:32:09 -07:00
Bjorn Andersson
a3adbc2437
Moving between the Linux kernel's list.h and this one is confusing, as list_add() prepends in one case and appends in the other. Rename the function to clarify the API. Introduce an operation for those cases where a prepend is desired. Also introduce a list_len() operation, which can be useful to save clients from open-coding this. Signed-off-by: Bjorn Andersson <bjorn.andersson@oss.qualcomm.com>
100 lines
2.2 KiB
C
100 lines
2.2 KiB
C
/*
|
|
* Copyright (c) 2016, Linaro Ltd.
|
|
* All rights reserved.
|
|
*
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*/
|
|
#ifndef __LIST_H__
|
|
#define __LIST_H__
|
|
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
|
|
#define container_of(ptr, type, member) ({ \
|
|
typeof(((type *)0)->member)*__mptr = (ptr); \
|
|
(type *)(void *)((char *)__mptr - offsetof(type, member)); \
|
|
})
|
|
|
|
struct list_head {
|
|
struct list_head *prev;
|
|
struct list_head *next;
|
|
};
|
|
|
|
#define LIST_INIT(list) { &(list), &(list) }
|
|
|
|
#define list_for_each(item, list) \
|
|
for (item = (list)->next; item != list; item = item->next)
|
|
|
|
#define list_for_each_safe(item, next, list) \
|
|
for (item = (list)->next, next = item->next; item != list; item = next, next = 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_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)) \
|
|
|
|
static inline void list_init(struct list_head *list)
|
|
{
|
|
list->prev = list->next = list;
|
|
}
|
|
|
|
static inline bool list_empty(struct list_head *list)
|
|
{
|
|
return list->next == list;
|
|
}
|
|
|
|
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 = list->prev = item;
|
|
}
|
|
|
|
static inline void list_prepend(struct list_head *list, struct list_head *item)
|
|
{
|
|
struct list_head *next = list->prev;
|
|
|
|
item->next = next;
|
|
item->prev = list;
|
|
|
|
list->next = next->prev = item;
|
|
}
|
|
|
|
static inline void list_del(struct list_head *item)
|
|
{
|
|
item->prev->next = item->next;
|
|
item->next->prev = item->prev;
|
|
}
|
|
|
|
static inline size_t list_len(struct list_head *list)
|
|
{
|
|
struct list_head *it;
|
|
size_t n = 0;
|
|
|
|
list_for_each(it, list)
|
|
n++;
|
|
|
|
return n;
|
|
}
|
|
|
|
#endif
|