#include <linux/rbtree.h>
#include <stdbool.h>
#include "rblist.h"
Go to the source code of this file.
◆ intlist__for_each_entry
intlist__for_each_entry - iterate over a intlist : the &struct int_node to use as a loop cursor. : the &struct intlist for loop.
Definition at line 65 of file intlist.h.
◆ intlist__for_each_entry_safe
#define intlist__for_each_entry_safe |
( |
|
pos, |
|
|
|
n, |
|
|
|
ilist |
|
) |
| |
Value:static struct int_node * intlist__first(struct intlist *ilist)
static struct int_node * intlist__next(struct int_node *in)
intlist__for_each_entry_safe - iterate over a intlist safe against removal of int_node : the &struct int_node to use as a loop cursor.
: another &struct int_node to use as temporary storage. : the &struct intlist for loop.
Definition at line 75 of file intlist.h.
◆ intlist__add()
int intlist__add |
( |
struct intlist * |
ilist, |
|
|
int |
i |
|
) |
| |
◆ intlist__delete()
void intlist__delete |
( |
struct intlist * |
ilist | ) |
|
◆ intlist__empty()
static bool intlist__empty |
( |
const struct intlist * |
ilist | ) |
|
|
inlinestatic |
◆ intlist__entry()
struct int_node* intlist__entry |
( |
const struct intlist * |
ilist, |
|
|
unsigned int |
idx |
|
) |
| |
◆ intlist__find()
◆ intlist__findnew()
◆ intlist__first()
◆ intlist__has_entry()
static bool intlist__has_entry |
( |
struct intlist * |
ilist, |
|
|
int |
i |
|
) |
| |
|
inlinestatic |
◆ intlist__new()
struct intlist* intlist__new |
( |
const char * |
slist | ) |
|
◆ intlist__next()
◆ intlist__nr_entries()
static unsigned int intlist__nr_entries |
( |
const struct intlist * |
ilist | ) |
|
|
inlinestatic |
◆ intlist__remove()