| /fs/xfs/scrub/ |
| D | bitmap.c | 32 INIT_LIST_HEAD(&bmr->list); in xfs_bitmap_set()
35 list_add_tail(&bmr->list, &bitmap->list); in xfs_bitmap_set()
49 list_del(&bmr->list); in xfs_bitmap_destroy()
59 INIT_LIST_HEAD(&bitmap->list); in xfs_bitmap_init()
72 ap = container_of(a, struct xfs_bitmap_range, list); in xfs_bitmap_range_cmp()
73 bp = container_of(b, struct xfs_bitmap_range, list); in xfs_bitmap_range_cmp()
112 if (list_empty(&bitmap->list) || list_empty(&sub->list)) in xfs_bitmap_disunion()
114 ASSERT(!list_empty(&sub->list)); in xfs_bitmap_disunion()
116 list_sort(NULL, &bitmap->list, xfs_bitmap_range_cmp); in xfs_bitmap_disunion()
117 list_sort(NULL, &sub->list, xfs_bitmap_range_cmp); in xfs_bitmap_disunion()
[all …]
|
| D | refcount.c | 67 struct list_head list; member
133 list_add_tail(&frag->list, &refchk->fragments); in xchk_refcountbt_rmap_check()
177 list_for_each_entry(frag, &refchk->fragments, list) { in xchk_refcountbt_process_rmap_fragments()
187 list_for_each_entry_safe(frag, n, &refchk->fragments, list) { in xchk_refcountbt_process_rmap_fragments()
193 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
210 list_for_each_entry_safe(frag, n, &worklist, list) { in xchk_refcountbt_process_rmap_fragments()
217 list_del(&frag->list); in xchk_refcountbt_process_rmap_fragments()
223 list_for_each_entry_safe(frag, n, &refchk->fragments, list) { in xchk_refcountbt_process_rmap_fragments()
227 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
258 list_for_each_entry_safe(frag, n, &worklist, list) { in xchk_refcountbt_process_rmap_fragments()
[all …]
|
| D | bitmap.h | 10 struct list_head list; member
16 struct list_head list; member
23 list_for_each_entry_safe((bex), (n), &(bitmap)->list, list)
26 list_for_each_entry_safe((bex), (n), &(bitmap)->list, list) \
|
| /fs/notify/ |
| D | notification.c | 69 if (!list_empty(&event->list)) { in fsnotify_destroy_event()
71 WARN_ON(!list_empty(&event->list)); in fsnotify_destroy_event()
90 struct list_head *list = &group->notification_list; in fsnotify_add_event() local
105 if (!list_empty(&group->overflow_event->list)) { in fsnotify_add_event()
113 if (!list_empty(list) && merge) { in fsnotify_add_event()
114 ret = merge(list, event); in fsnotify_add_event()
123 list_add_tail(&event->list, list); in fsnotify_add_event()
139 list_del_init(&event->list); in fsnotify_remove_queued_event()
156 struct fsnotify_event, list); in fsnotify_remove_first_event()
170 struct fsnotify_event, list); in fsnotify_peek_first_event()
|
| /fs/proc/ |
| D | kcore.c | 88 list_add_tail(&new->list, &kclist_head); in kclist_add()
100 list_for_each_entry(m, &kclist_head, list) { in get_kcore_size()
136 list_add(&ent->list, head); in kcore_ram_list()
157 list_for_each_entry(tmp, head, list) { in get_sparsemem_vmemmap_info()
171 list_add_tail(&vmm->list, head); in get_sparsemem_vmemmap_info()
223 list_add_tail(&ent->list, head); in kclist_add_private()
226 list_del(&ent->list); in kclist_add_private()
236 static int kcore_ram_list(struct list_head *list) in kcore_ram_list() argument
251 ret = walk_system_ram_range(0, end_pfn, list, kclist_add_private); in kcore_ram_list()
260 LIST_HEAD(list); in kcore_update_ram()
[all …]
|
| /fs/dlm/ |
| D | plock.c | 23 struct list_head list; member
64 INIT_LIST_HEAD(&op->list); in send_op()
66 list_add_tail(&op->list, &send_list); in send_op()
150 list_del(&op->list); in dlm_posix_lock()
162 if (!list_empty(&op->list)) { in dlm_posix_lock()
165 list_del(&op->list); in dlm_posix_lock()
195 if (!list_empty(&op->list)) { in dlm_plock_callback()
198 list_del(&op->list); in dlm_plock_callback()
294 if (!list_empty(&op->list)) { in dlm_posix_unlock()
297 list_del(&op->list); in dlm_posix_unlock()
[all …]
|
| D | member.c | 129 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_copy_in()
178 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
186 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
226 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
243 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
294 struct list_head *newlist = &new->list; in add_ordered_member()
298 memb = list_entry(tmp, struct dlm_member, list); in add_ordered_member()
341 list_for_each_entry(memb, head, list) { in find_memb()
367 memb = list_entry(head->next, struct dlm_member, list); in clear_memb_list()
368 list_del(&memb->list); in clear_memb_list()
[all …]
|
| D | dir.c | 78 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_recover_directory()
237 struct list_head *list; in dlm_copy_master_names() local
252 list = r->res_root_list.next; in dlm_copy_master_names()
254 list = ls->ls_root_list.next; in dlm_copy_master_names()
257 for (offset = 0; list != &ls->ls_root_list; list = list->next) { in dlm_copy_master_names()
258 r = list_entry(list, struct dlm_rsb, res_root_list); in dlm_copy_master_names()
296 if ((list == &ls->ls_root_list) && in dlm_copy_master_names()
|
| D | requestqueue.c | 19 struct list_head list; member
48 list_add_tail(&e->list, &ls->ls_requestqueue); in dlm_add_requestqueue()
77 e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list); in dlm_process_requestqueue()
91 list_del(&e->list); in dlm_process_requestqueue()
159 list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) { in dlm_purge_requestqueue()
163 list_del(&e->list); in dlm_purge_requestqueue()
|
| /fs/ubifs/ |
| D | gc.c | 119 sa = list_entry(a, struct ubifs_scan_node, list); in data_nodes_cmp()
120 sb = list_entry(b, struct ubifs_scan_node, list); in data_nodes_cmp()
163 sa = list_entry(a, struct ubifs_scan_node, list); in nondata_nodes_cmp()
164 sb = list_entry(b, struct ubifs_scan_node, list); in nondata_nodes_cmp()
240 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
253 list_del(&snod->list); in sort_nodes()
270 list_del(&snod->list); in sort_nodes()
279 list_move_tail(&snod->list, nondata); in sort_nodes()
319 list_del(&snod->list); in move_node()
360 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
[all …]
|
| D | commit.c | 498 struct list_head list; member
561 struct list_head list; in dbg_check_old_index() local
568 INIT_LIST_HEAD(&list); in dbg_check_old_index()
594 list_add_tail(&i->list, &list); in dbg_check_old_index()
658 list_del(&i->list); in dbg_check_old_index()
661 if (list_empty(&list)) in dbg_check_old_index()
664 i = list_entry(list.prev, struct idx_node, in dbg_check_old_index()
665 list); in dbg_check_old_index()
705 list_del(&i->list); in dbg_check_old_index()
707 if (!list_empty(&list)) { in dbg_check_old_index()
[all …]
|
| D | replay.c | 52 struct list_head list; member
72 struct list_head list; member
167 list_for_each_entry(b, &c->replay_buds, list) { in set_buds_lprops()
224 list_for_each_entry_reverse(r, &c->replay_list, list) { in inode_still_linked()
311 ra = list_entry(a, struct replay_entry, list); in replay_entries_cmp()
312 rb = list_entry(b, struct replay_entry, list); in replay_entries_cmp()
333 list_for_each_entry(r, &c->replay_list, list) { in apply_replay_list()
354 list_for_each_entry_safe(r, tmp, &c->replay_list, list) { in destroy_replay_list()
357 list_del(&r->list); in destroy_replay_list()
410 list_add_tail(&r->list, &c->replay_list); in insert_node()
[all …]
|
| D | lprops.c | 190 list_add(&lp->list, &c->uncat_list); in add_to_lpt_heap()
274 list_add(&lprops->list, &c->uncat_list); in ubifs_add_to_cat()
277 list_add(&lprops->list, &c->empty_list); in ubifs_add_to_cat()
280 list_add(&lprops->list, &c->freeable_list); in ubifs_add_to_cat()
284 list_add(&lprops->list, &c->frdi_idx_list); in ubifs_add_to_cat()
320 ubifs_assert(c, !list_empty(&lprops->list)); in ubifs_remove_from_cat()
321 list_del(&lprops->list); in ubifs_remove_from_cat()
357 list_replace(&old_lprops->list, &new_lprops->list); in ubifs_replace_cat()
787 lprops = list_entry(c->empty_list.next, struct ubifs_lprops, list); in ubifs_fast_find_empty()
810 lprops = list_entry(c->freeable_list.next, struct ubifs_lprops, list); in ubifs_fast_find_freeable()
[all …]
|
| /fs/ |
| D | xattr.c | 347 vfs_listxattr(struct dentry *dentry, char *list, size_t size) in vfs_listxattr() argument
356 error = inode->i_op->listxattr(dentry, list, size); in vfs_listxattr()
358 error = security_inode_listsecurity(inode, list, size); in vfs_listxattr()
605 listxattr(struct dentry *d, char __user *list, size_t size) in listxattr() argument
620 if (size && copy_to_user(list, klist, error)) in listxattr()
633 static ssize_t path_listxattr(const char __user *pathname, char __user *list, in path_listxattr() argument
642 error = listxattr(path.dentry, list, size); in path_listxattr()
651 SYSCALL_DEFINE3(listxattr, const char __user *, pathname, char __user *, list, in SYSCALL_DEFINE3() argument
654 return path_listxattr(pathname, list, size, LOOKUP_FOLLOW); in SYSCALL_DEFINE3()
657 SYSCALL_DEFINE3(llistxattr, const char __user *, pathname, char __user *, list, in SYSCALL_DEFINE3() argument
[all …]
|
| D | dcookies.c | 71 struct list_head * list; in find_dcookie() local
73 list = dcookie_hashtable + dcookie_hash(dcookie); in find_dcookie()
75 list_for_each(pos, list) { in find_dcookie()
89 struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs)); in hash_dcookie() local
90 list_add(&dcs->hash_list, list); in hash_dcookie()
292 struct list_head * list; in dcookie_exit() local
299 list = dcookie_hashtable + i; in dcookie_exit()
300 list_for_each_safe(pos, pos2, list) { in dcookie_exit()
|
| /fs/overlayfs/ |
| D | readdir.c | 43 struct list_head *list; member
190 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
217 void ovl_cache_free(struct list_head *list) in ovl_cache_free() argument
222 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
225 INIT_LIST_HEAD(list); in ovl_cache_free()
355 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list, in ovl_dir_read_merged() argument
363 .list = list, in ovl_dir_read_merged()
382 list_add(&rdd.middle, rdd.list); in ovl_dir_read_merged()
540 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
545 static int ovl_dir_read_impure(struct path *path, struct list_head *list, in ovl_dir_read_impure() argument
[all …]
|
| /fs/btrfs/ |
| D | relocation.c | 45 struct list_head list; member
82 struct list_head list[2]; member
218 struct backref_node, list); in backref_cache_cleanup()
245 INIT_LIST_HEAD(&node->list); in alloc_backref_node()
349 struct backref_edge, list[LOWER]); in walk_up_backref()
371 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
375 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
376 struct backref_edge, list[LOWER]); in walk_down_backref()
408 list_del(&node->list); in drop_backref_node()
430 list[LOWER]); in remove_backref_node()
[all …]
|
| D | zstd.c | 49 struct list_head list; member
89 static inline struct workspace *list_to_workspace(struct list_head *list) in list_to_workspace() argument
91 return container_of(list, struct workspace, list); in list_to_workspace()
130 list_del(&victim->list); in zstd_reclaim_timer_fn()
131 zstd_free_workspace(&victim->list); in zstd_reclaim_timer_fn()
206 struct workspace, list); in zstd_cleanup_workspace_manager()
207 list_del(&workspace->list); in zstd_cleanup_workspace_manager()
209 zstd_free_workspace(&workspace->list); in zstd_cleanup_workspace_manager()
326 list_add(&workspace->list, &wsm.idle_ws[workspace->level - 1]); in zstd_put_workspace()
337 struct workspace *workspace = list_entry(ws, struct workspace, list); in zstd_free_workspace()
[all …]
|
| /fs/squashfs/ |
| D | decompressor_multi.c | 49 struct list_head list; member
57 list_add(&decomp_strm->list, &stream->strm_list); in put_decomp_stream()
95 list_add(&decomp_strm->list, &stream->strm_list); in squashfs_decompressor_create()
114 struct decomp_stream, list); in squashfs_decompressor_destroy()
115 list_del(&decomp_strm->list); in squashfs_decompressor_destroy()
138 struct decomp_stream, list); in get_decomp_stream()
139 list_del(&decomp_strm->list); in get_decomp_stream()
|
| /fs/jffs2/ |
| D | compr.c | 90 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_selected_compress()
176 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_compress()
276 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_decompress()
320 list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_register_compressor()
322 list_add(&comp->list, this->list.prev); in jffs2_register_compressor()
326 list_add_tail(&comp->list, &jffs2_compressor_list); in jffs2_register_compressor()
328 D2(list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_register_compressor()
350 list_del(&comp->list); in jffs2_unregister_compressor()
352 D2(list_for_each_entry(this, &jffs2_compressor_list, list) { in jffs2_unregister_compressor()
|
| D | debug.c | 184 list_for_each_entry(jeb, &c->clean_list, list) { in __jffs2_dbg_superblock_counts()
192 list_for_each_entry(jeb, &c->very_dirty_list, list) { in __jffs2_dbg_superblock_counts()
200 list_for_each_entry(jeb, &c->dirty_list, list) { in __jffs2_dbg_superblock_counts()
208 list_for_each_entry(jeb, &c->erasable_list, list) { in __jffs2_dbg_superblock_counts()
216 list_for_each_entry(jeb, &c->erasable_pending_wbuf_list, list) { in __jffs2_dbg_superblock_counts()
224 list_for_each_entry(jeb, &c->erase_pending_list, list) { in __jffs2_dbg_superblock_counts()
232 list_for_each_entry(jeb, &c->free_list, list) { in __jffs2_dbg_superblock_counts()
240 list_for_each_entry(jeb, &c->bad_used_list, list) { in __jffs2_dbg_superblock_counts()
249 list_for_each_entry(jeb, &c->erasing_list, list) { in __jffs2_dbg_superblock_counts()
253 list_for_each_entry(jeb, &c->erase_checking_list, list) { in __jffs2_dbg_superblock_counts()
[all …]
|
| D | erase.c | 51 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
82 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
114 jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
115 list_move(&jeb->list, &c->erase_checking_list); in jffs2_erase_pending_blocks()
127 jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
130 list_del(&jeb->list); in jffs2_erase_pending_blocks()
138 list_add(&jeb->list, &c->erasing_list); in jffs2_erase_pending_blocks()
166 list_move_tail(&jeb->list, &c->erase_complete_list); in jffs2_erase_succeeded()
185 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_failed()
199 list_move(&jeb->list, &c->bad_list); in jffs2_erase_failed()
[all …]
|
| D | nodemgmt.c | 261 list_add_tail(&jeb->list, &c->very_dirty_list); in jffs2_close_nextblock()
266 list_add_tail(&jeb->list, &c->dirty_list); in jffs2_close_nextblock()
272 list_add_tail(&jeb->list, &c->clean_list); in jffs2_close_nextblock()
292 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
293 list_move_tail(&ejeb->list, &c->erase_pending_list); in jffs2_find_nextblock()
336 c->nextblock = list_entry(next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
544 list_add_tail(&jeb->list, &c->clean_list); in jffs2_add_physical_node_ref()
653 if (on_list(&jeb->list, &c->bad_used_list)) { in jffs2_mark_node_obsolete()
700 list_del(&jeb->list); in jffs2_mark_node_obsolete()
704 list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list); in jffs2_mark_node_obsolete()
[all …]
|
| /fs/nilfs2/ |
| D | cpfile.c | 605 struct nilfs_snapshot_list *list; in nilfs_cpfile_block_get_snapshot_list() local
609 list = &cp->cp_snapshot_list; in nilfs_cpfile_block_get_snapshot_list()
612 list = &header->ch_snapshot_list; in nilfs_cpfile_block_get_snapshot_list()
614 return list; in nilfs_cpfile_block_get_snapshot_list()
622 struct nilfs_snapshot_list *list; in nilfs_cpfile_set_snapshot() local
654 list = &header->ch_snapshot_list; in nilfs_cpfile_set_snapshot()
659 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
675 list = &cp->cp_snapshot_list; in nilfs_cpfile_set_snapshot()
676 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
691 list = nilfs_cpfile_block_get_snapshot_list( in nilfs_cpfile_set_snapshot()
[all …]
|
| /fs/fuse/ |
| D | xattr.c | 90 static int fuse_verify_xattr_list(char *list, size_t size) in fuse_verify_xattr_list() argument
95 size_t thislen = strnlen(list, size); in fuse_verify_xattr_list()
101 list += thislen + 1; in fuse_verify_xattr_list()
107 ssize_t fuse_listxattr(struct dentry *entry, char *list, size_t size) in fuse_listxattr() argument
134 args.out_args[0].value = list; in fuse_listxattr()
143 ret = fuse_verify_xattr_list(list, ret); in fuse_listxattr()
236 .list = no_xattr_list,
244 .list = no_xattr_list,
|