Home
last modified time | relevance | path

Searched refs:ilist (Results 1 – 9 of 9) sorted by relevance

/Linux-v5.4/tools/perf/util/
Dintlist.c29 static void int_node__delete(struct int_node *ilist) in int_node__delete() argument
31 free(ilist); in int_node__delete()
50 int intlist__add(struct intlist *ilist, int i) in intlist__add() argument
52 return rblist__add_node(&ilist->rblist, (void *)((long)i)); in intlist__add()
55 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove() argument
57 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
60 static struct int_node *__intlist__findnew(struct intlist *ilist, in __intlist__findnew() argument
66 if (ilist == NULL) in __intlist__findnew()
70 rb_node = rblist__findnew(&ilist->rblist, (void *)((long)i)); in __intlist__findnew()
72 rb_node = rblist__find(&ilist->rblist, (void *)((long)i)); in __intlist__findnew()
[all …]
Dintlist.h21 void intlist__delete(struct intlist *ilist);
23 void intlist__remove(struct intlist *ilist, struct int_node *in);
24 int intlist__add(struct intlist *ilist, int i);
26 struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
27 struct int_node *intlist__find(struct intlist *ilist, int i);
28 struct int_node *intlist__findnew(struct intlist *ilist, int i);
30 static inline bool intlist__has_entry(struct intlist *ilist, int i) in intlist__has_entry() argument
32 return intlist__find(ilist, i) != NULL; in intlist__has_entry()
35 static inline bool intlist__empty(const struct intlist *ilist) in intlist__empty() argument
37 return rblist__empty(&ilist->rblist); in intlist__empty()
[all …]
Dsrcline.c42 struct inline_list *ilist; in inline_list__append() local
44 ilist = zalloc(sizeof(*ilist)); in inline_list__append()
45 if (ilist == NULL) in inline_list__append()
48 ilist->symbol = symbol; in inline_list__append()
49 ilist->srcline = srcline; in inline_list__append()
52 list_add_tail(&ilist->list, &node->val); in inline_list__append()
54 list_add(&ilist->list, &node->val); in inline_list__append()
677 struct inline_list *ilist, *tmp; in inline_node__delete() local
679 list_for_each_entry_safe(ilist, tmp, &node->val, list) { in inline_node__delete()
680 list_del_init(&ilist->list); in inline_node__delete()
[all …]
Dmachine.c2451 struct inline_list *ilist; in append_inlines() local
2469 list_for_each_entry(ilist, &inline_node->val, list) { in append_inlines()
2471 ilist->symbol, false, in append_inlines()
2472 NULL, 0, 0, 0, ilist->srcline); in append_inlines()
/Linux-v5.4/drivers/md/
Ddm-cache-policy-smq.c111 struct ilist { struct
116 static void l_init(struct ilist *l) in l_init() argument
122 static struct entry *l_head(struct entry_space *es, struct ilist *l) in l_head()
127 static struct entry *l_tail(struct entry_space *es, struct ilist *l) in l_tail()
142 static bool l_empty(struct ilist *l) in l_empty()
147 static void l_add_head(struct entry_space *es, struct ilist *l, struct entry *e) in l_add_head()
163 static void l_add_tail(struct entry_space *es, struct ilist *l, struct entry *e) in l_add_tail()
179 static void l_add_before(struct entry_space *es, struct ilist *l, in l_add_before()
197 static void l_del(struct entry_space *es, struct ilist *l, struct entry *e) in l_del()
216 static struct entry *l_pop_head(struct entry_space *es, struct ilist *l) in l_pop_head()
[all …]
/Linux-v5.4/fs/f2fs/
Dgc.h40 struct list_head ilist; member
Dgc.c473 list_add_tail(&new_ie->list, &gc_list->ilist); in add_gc_inode()
479 list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) { in put_gc_inode()
1261 .ilist = LIST_HEAD_INIT(gc_list.ilist), in f2fs_gc()
1400 .ilist = LIST_HEAD_INIT(gc_list.ilist), in free_segment_range()
/Linux-v5.4/drivers/scsi/ibmvscsi_tgt/
Dlibsrp.h100 struct list_head ilist; member
/Linux-v5.4/tools/power/pm-graph/
Dsleepgraph.py5956 ilist = []
5976 ilist.append('%sx%d' % (i, elist[i]) if elist[i] > 1 else i)
5992 ilist.append(issue)
6031 'issues': ' '.join(ilist),