Searched refs:l_node (Results 1 - 2 of 2) sorted by relevance
| /kernel/linux/linux-5.10/fs/overlayfs/ |
| H A D | readdir.c | 23 struct list_head l_node; member
190 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
205 list_move_tail(&p->l_node, &rdd->middle); in ovl_fill_lowest()
211 list_add_tail(&p->l_node, &rdd->middle); in ovl_fill_lowest()
222 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
543 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
568 list_for_each_entry_safe(p, n, list, l_node) { in ovl_dir_read_impure()
576 list_del(&p->l_node); in ovl_dir_read_impure()
772 p = list_entry(od->cursor, struct ovl_cache_entry, l_node); in ovl_iterate()
782 od->cursor = p->l_node in ovl_iterate()
[all...] |
| /kernel/linux/linux-6.6/fs/overlayfs/ |
| H A D | readdir.c | 23 struct list_head l_node; member
190 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
205 list_move_tail(&p->l_node, &rdd->middle); in ovl_fill_lowest()
211 list_add_tail(&p->l_node, &rdd->middle); in ovl_fill_lowest()
222 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
547 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
572 list_for_each_entry_safe(p, n, list, l_node) { in ovl_dir_read_impure()
580 list_del(&p->l_node); in ovl_dir_read_impure()
779 p = list_entry(od->cursor, struct ovl_cache_entry, l_node); in ovl_iterate()
792 od->cursor = p->l_node in ovl_iterate()
[all...] |
Completed in 5 milliseconds