ilist
static void l_init(struct ilist *l)
static struct entry *l_head(struct entry_space *es, struct ilist *l)
static struct entry *l_tail(struct entry_space *es, struct ilist *l)
static bool l_empty(struct ilist *l)
static void l_add_head(struct entry_space *es, struct ilist *l, struct entry *e)
static void l_add_tail(struct entry_space *es, struct ilist *l, struct entry *e)
static void l_add_before(struct entry_space *es, struct ilist *l,
static void l_del(struct entry_space *es, struct ilist *l, struct entry *e)
static struct entry *l_pop_head(struct entry_space *es, struct ilist *l)
static struct entry *l_pop_tail(struct entry_space *es, struct ilist *l)
struct ilist qs[MAX_LEVELS];
struct ilist *l, *l_above;
struct ilist free;
struct list_head ilist;
hlist_for_each_entry(fid, h, ilist) {
hlist_add_head(&fid->ilist, (struct hlist_head *)&inode->i_private);
hlist_del(&fid->ilist);
list_add_tail(&new_ie->list, &gc_list->ilist);
list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
.ilist = LIST_HEAD_INIT(gc_list.ilist),
.ilist = LIST_HEAD_INIT(gc_list.ilist),
struct list_head ilist;
struct hlist_node ilist;
err = intlist__add(ilist, value);
struct intlist *ilist = malloc(sizeof(*ilist));
if (ilist != NULL) {
rblist__init(&ilist->rblist);
ilist->rblist.node_cmp = intlist__node_cmp;
ilist->rblist.node_new = intlist__node_new;
ilist->rblist.node_delete = intlist__node_delete;
if (slist && intlist__parse_list(ilist, slist))
return ilist;
intlist__delete(ilist);
void intlist__delete(struct intlist *ilist)
if (ilist != NULL)
rblist__delete(&ilist->rblist);
struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx)
rb_node = rblist__entry(&ilist->rblist, idx);
static void int_node__delete(struct int_node *ilist)
free(ilist);
int intlist__add(struct intlist *ilist, unsigned long i)
return rblist__add_node(&ilist->rblist, (void *)i);
void intlist__remove(struct intlist *ilist, struct int_node *node)
rblist__remove_node(&ilist->rblist, &node->rb_node);
static struct int_node *__intlist__findnew(struct intlist *ilist,
if (ilist == NULL)
rb_node = rblist__findnew(&ilist->rblist, (void *)i);
rb_node = rblist__find(&ilist->rblist, (void *)i);
struct int_node *intlist__find(struct intlist *ilist, unsigned long i)
return __intlist__findnew(ilist, i, false);
struct int_node *intlist__findnew(struct intlist *ilist, unsigned long i)
return __intlist__findnew(ilist, i, true);
static int intlist__parse_list(struct intlist *ilist, const char *s)
void intlist__delete(struct intlist *ilist);
void intlist__remove(struct intlist *ilist, struct int_node *in);
int intlist__add(struct intlist *ilist, unsigned long i);
struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
struct int_node *intlist__find(struct intlist *ilist, unsigned long i);
struct int_node *intlist__findnew(struct intlist *ilist, unsigned long i);
static inline bool intlist__has_entry(struct intlist *ilist, unsigned long i)
return intlist__find(ilist, i) != NULL;
static inline bool intlist__empty(const struct intlist *ilist)
return rblist__empty(&ilist->rblist);
static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
return rblist__nr_entries(&ilist->rblist);
static inline struct int_node *intlist__first(struct intlist *ilist)
struct rb_node *rn = rb_first_cached(&ilist->rblist.entries);
#define intlist__for_each_entry(pos, ilist) \
for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
#define intlist__for_each_entry_safe(pos, n, ilist) \
for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
struct inline_list *ilist;
list_for_each_entry(ilist, &args->node->val, list) {
if (args->leaf_srcline == ilist->srcline)
else if (ilist->srcline != srcline__unknown)
free(ilist->srcline);
ilist->srcline = call_srcline;
struct inline_list *ilist;
list_for_each_entry(ilist, &inline_node->val, list) {
ilist_ms.sym = ilist->symbol;
iter_cycles, branch_from, ilist->srcline);
NULL, 0, 0, 0, ilist->srcline);
struct inline_list *ilist;
ilist = zalloc(sizeof(*ilist));
if (ilist == NULL)
struct inline_list *ilist, *tmp;
list_for_each_entry_safe(ilist, tmp, &node->val, list) {
list_del_init(&ilist->list);
zfree_srcline(&ilist->srcline);
if (ilist->symbol && ilist->symbol->inlined)
symbol__delete(ilist->symbol);
free(ilist);
ilist->symbol = symbol;
ilist->srcline = srcline;
list_add_tail(&ilist->list, &node->val);
list_add(&ilist->list, &node->val);
struct inline_list *ilist;
ilist = zalloc(sizeof(*ilist));
if (ilist == NULL)
ilist->symbol = symbol;
ilist->srcline = srcline;
list_add(&ilist->list, &node->val);
list_add_tail(&ilist->list, &node->val);