GNU Radio's GSM Package
|
#include <stddef.h>
Go to the source code of this file.
Classes | |
struct | llist_head |
Macros | |
#define | inline __inline__ |
#define | container_of(ptr, type, member) |
#define | LLIST_POISON1 ((void *) 0x00100100) |
#define | LLIST_POISON2 ((void *) 0x00200200) |
#define | LLIST_HEAD_INIT(name) { &(name), &(name) } |
#define | LLIST_HEAD(name) struct llist_head name = LLIST_HEAD_INIT(name) |
#define | INIT_LLIST_HEAD(ptr) |
#define | llist_entry(ptr, type, member) container_of(ptr, type, member) |
#define | llist_first_entry(ptr, type, member) llist_entry((ptr)->next, type, member) |
#define | llist_last_entry(ptr, type, member) llist_entry((ptr)->prev, type, member) |
#define | llist_first_entry_or_null(ptr, type, member) (!llist_empty(ptr) ? llist_first_entry(ptr, type, member) : NULL) |
#define | llist_for_each(pos, head) |
#define | __llist_for_each(pos, head) for (pos = (head)->next; pos != (head); pos = pos->next) |
#define | llist_for_each_prev(pos, head) |
#define | llist_for_each_safe(pos, n, head) |
#define | llist_for_each_entry(pos, head, member) |
#define | llist_for_each_entry_reverse(pos, head, member) |
#define | llist_for_each_entry_continue(pos, head, member) |
#define | llist_for_each_entry_safe(pos, n, head, member) |
#define | llist_for_each_rcu(pos, head) |
#define | __llist_for_each_rcu(pos, head) |
#define | llist_for_each_safe_rcu(pos, n, head) |
#define | llist_for_each_entry_rcu(pos, head, member) |
#define | llist_for_each_continue_rcu(pos, head) |
Functions | |
static void | prefetch (const void *x) |
static void | __llist_add (struct llist_head *_new, struct llist_head *prev, struct llist_head *next) |
static void | llist_add (struct llist_head *_new, struct llist_head *head) |
static void | llist_add_tail (struct llist_head *_new, struct llist_head *head) |
static void | __llist_del (struct llist_head *prev, struct llist_head *next) |
static void | llist_del (struct llist_head *entry) |
static void | llist_del_init (struct llist_head *entry) |
static void | llist_move (struct llist_head *llist, struct llist_head *head) |
static void | llist_move_tail (struct llist_head *llist, struct llist_head *head) |
static int | llist_empty (const struct llist_head *head) |
static void | __llist_splice (struct llist_head *llist, struct llist_head *head) |
static void | llist_splice (struct llist_head *llist, struct llist_head *head) |
static void | llist_splice_init (struct llist_head *llist, struct llist_head *head) |
static unsigned int | llist_count (struct llist_head *head) |
Simple doubly linked list implementation.
Some of the internal functions ("__xxx") are useful when manipulating whole llists rather than single entries, as sometimes we already know the next/prev entries and we can generate better code by using them directly rather than using the generic single-entry routines.