Searched refs:ilist (Results 1 – 6 of 6) sorted by relevance
| /linux-4.4.14/tools/perf/util/ |
| D | intlist.c | 30 static void int_node__delete(struct int_node *ilist) in int_node__delete() argument
32 free(ilist); in int_node__delete()
51 int intlist__add(struct intlist *ilist, int i) in intlist__add() argument
53 return rblist__add_node(&ilist->rblist, (void *)((long)i)); in intlist__add()
56 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove() argument
58 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
61 static struct int_node *__intlist__findnew(struct intlist *ilist, in __intlist__findnew() argument
67 if (ilist == NULL) in __intlist__findnew()
71 rb_node = rblist__findnew(&ilist->rblist, (void *)((long)i)); in __intlist__findnew()
73 rb_node = rblist__find(&ilist->rblist, (void *)((long)i)); in __intlist__findnew()
[all …]
|
| D | intlist.h | 20 void intlist__delete(struct intlist *ilist);
22 void intlist__remove(struct intlist *ilist, struct int_node *in);
23 int intlist__add(struct intlist *ilist, int i);
25 struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
26 struct int_node *intlist__find(struct intlist *ilist, int i);
27 struct int_node *intlist__findnew(struct intlist *ilist, int i);
29 static inline bool intlist__has_entry(struct intlist *ilist, int i) in intlist__has_entry() argument
31 return intlist__find(ilist, i) != NULL; in intlist__has_entry()
34 static inline bool intlist__empty(const struct intlist *ilist) in intlist__empty() argument
36 return rblist__empty(&ilist->rblist); in intlist__empty()
[all …]
|
| /linux-4.4.14/drivers/md/ |
| D | dm-cache-policy-smq.c | 109 struct ilist { struct
114 static void l_init(struct ilist *l) in l_init() argument
120 static struct entry *l_head(struct entry_space *es, struct ilist *l) in l_head()
125 static struct entry *l_tail(struct entry_space *es, struct ilist *l) in l_tail()
140 static bool l_empty(struct ilist *l) in l_empty()
145 static void l_add_head(struct entry_space *es, struct ilist *l, struct entry *e) in l_add_head()
161 static void l_add_tail(struct entry_space *es, struct ilist *l, struct entry *e) in l_add_tail()
177 static void l_add_before(struct entry_space *es, struct ilist *l, in l_add_before()
195 static void l_del(struct entry_space *es, struct ilist *l, struct entry *e) in l_del()
214 static struct entry *l_pop_tail(struct entry_space *es, struct ilist *l) in l_pop_tail()
[all …]
|
| /linux-4.4.14/fs/f2fs/ |
| D | gc.h | 39 struct list_head ilist; member
|
| D | gc.c | 370 list_add_tail(&new_ie->list, &gc_list->ilist); in add_gc_inode()
376 list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) { in put_gc_inode()
825 .ilist = LIST_HEAD_INIT(gc_list.ilist), in f2fs_gc()
|
| /linux-4.4.14/fs/xfs/ |
| D | xfs_inode.c | 3188 xfs_inode_t **ilist; in xfs_iflush_cluster() local
3199 ilist = kmem_alloc(ilist_size, KM_MAYFAIL|KM_NOFS); in xfs_iflush_cluster()
3200 if (!ilist) in xfs_iflush_cluster()
3207 nr_found = radix_tree_gang_lookup(&pag->pag_ici_root, (void**)ilist, in xfs_iflush_cluster()
3213 iq = ilist[i]; in xfs_iflush_cluster()
3282 kmem_free(ilist); in xfs_iflush_cluster()
3326 kmem_free(ilist); in xfs_iflush_cluster()
|