| /fs/notify/ |
| D | notification.c | 82 if (!list_empty(&event->list)) { in fsnotify_destroy_event()
84 WARN_ON(!list_empty(&event->list)); in fsnotify_destroy_event()
103 struct list_head *list = &group->notification_list; in fsnotify_add_event() local
117 if (!list_empty(&group->overflow_event->list)) { in fsnotify_add_event()
125 if (!list_empty(list) && merge) { in fsnotify_add_event()
126 ret = merge(list, event); in fsnotify_add_event()
135 list_add_tail(&event->list, list); in fsnotify_add_event()
156 struct fsnotify_event, list); in fsnotify_remove_first_event()
161 list_del_init(&event->list); in fsnotify_remove_first_event()
176 struct fsnotify_event, list); in fsnotify_peek_first_event()
[all …]
|
| /fs/ubifs/ |
| D | gc.c | 131 sa = list_entry(a, struct ubifs_scan_node, list); in data_nodes_cmp()
132 sb = list_entry(b, struct ubifs_scan_node, list); in data_nodes_cmp()
175 sa = list_entry(a, struct ubifs_scan_node, list); in nondata_nodes_cmp()
176 sb = list_entry(b, struct ubifs_scan_node, list); in nondata_nodes_cmp()
252 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
264 list_del(&snod->list); in sort_nodes()
281 list_del(&snod->list); in sort_nodes()
290 list_move_tail(&snod->list, nondata); in sort_nodes()
330 list_del(&snod->list); in move_node()
371 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
[all …]
|
| D | commit.c | 510 struct list_head list; member
573 struct list_head list; in dbg_check_old_index() local
580 INIT_LIST_HEAD(&list); in dbg_check_old_index()
606 list_add_tail(&i->list, &list); in dbg_check_old_index()
670 list_del(&i->list); in dbg_check_old_index()
673 if (list_empty(&list)) in dbg_check_old_index()
676 i = list_entry(list.prev, struct idx_node, in dbg_check_old_index()
677 list); in dbg_check_old_index()
717 list_del(&i->list); in dbg_check_old_index()
719 if (!list_empty(&list)) { in dbg_check_old_index()
[all …]
|
| D | replay.c | 61 struct list_head list; member
81 struct list_head list; member
176 list_for_each_entry(b, &c->replay_buds, list) { in set_buds_lprops()
233 list_for_each_entry_reverse(r, &c->replay_list, list) { in inode_still_linked()
322 ra = list_entry(a, struct replay_entry, list); in replay_entries_cmp()
323 rb = list_entry(b, struct replay_entry, list); in replay_entries_cmp()
344 list_for_each_entry(r, &c->replay_list, list) { in apply_replay_list()
365 list_for_each_entry_safe(r, tmp, &c->replay_list, list) { in destroy_replay_list()
368 list_del(&r->list); in destroy_replay_list()
420 list_add_tail(&r->list, &c->replay_list); in insert_node()
[all …]
|
| D | lprops.c | 202 list_add(&lp->list, &c->uncat_list); in add_to_lpt_heap()
288 list_add(&lprops->list, &c->uncat_list); in ubifs_add_to_cat()
291 list_add(&lprops->list, &c->empty_list); in ubifs_add_to_cat()
294 list_add(&lprops->list, &c->freeable_list); in ubifs_add_to_cat()
298 list_add(&lprops->list, &c->frdi_idx_list); in ubifs_add_to_cat()
334 ubifs_assert(!list_empty(&lprops->list)); in ubifs_remove_from_cat()
335 list_del(&lprops->list); in ubifs_remove_from_cat()
371 list_replace(&old_lprops->list, &new_lprops->list); in ubifs_replace_cat()
801 lprops = list_entry(c->empty_list.next, struct ubifs_lprops, list); in ubifs_fast_find_empty()
824 lprops = list_entry(c->freeable_list.next, struct ubifs_lprops, list); in ubifs_fast_find_freeable()
[all …]
|
| /fs/dlm/ |
| D | plock.c | 26 struct list_head list; member
67 INIT_LIST_HEAD(&op->list); in send_op()
69 list_add_tail(&op->list, &send_list); in send_op()
153 list_del(&op->list); in dlm_posix_lock()
165 if (!list_empty(&op->list)) { in dlm_posix_lock()
168 list_del(&op->list); in dlm_posix_lock()
198 if (!list_empty(&op->list)) { in dlm_plock_callback()
201 list_del(&op->list); in dlm_plock_callback()
297 if (!list_empty(&op->list)) { in dlm_posix_unlock()
300 list_del(&op->list); in dlm_posix_unlock()
[all …]
|
| D | member.c | 131 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_copy_in()
180 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
188 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
228 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
245 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_slots_assign()
296 struct list_head *newlist = &new->list; in add_ordered_member()
300 memb = list_entry(tmp, struct dlm_member, list); in add_ordered_member()
343 list_for_each_entry(memb, head, list) { in find_memb()
369 memb = list_entry(head->next, struct dlm_member, list); in clear_memb_list()
370 list_del(&memb->list); in clear_memb_list()
[all …]
|
| D | dir.c | 80 list_for_each_entry(memb, &ls->ls_nodes, list) { in dlm_recover_directory()
239 struct list_head *list; in dlm_copy_master_names() local
254 list = r->res_root_list.next; in dlm_copy_master_names()
256 list = ls->ls_root_list.next; in dlm_copy_master_names()
259 for (offset = 0; list != &ls->ls_root_list; list = list->next) { in dlm_copy_master_names()
260 r = list_entry(list, struct dlm_rsb, res_root_list); in dlm_copy_master_names()
298 if ((list == &ls->ls_root_list) && in dlm_copy_master_names()
|
| D | requestqueue.c | 21 struct list_head list; member
50 list_add_tail(&e->list, &ls->ls_requestqueue); in dlm_add_requestqueue()
79 e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list); in dlm_process_requestqueue()
93 list_del(&e->list); in dlm_process_requestqueue()
161 list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) { in dlm_purge_requestqueue()
165 list_del(&e->list); in dlm_purge_requestqueue()
|
| /fs/overlayfs/ |
| D | readdir.c | 45 struct list_head *list; member
187 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
214 void ovl_cache_free(struct list_head *list) in ovl_cache_free() argument
219 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
222 INIT_LIST_HEAD(list); in ovl_cache_free()
336 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list, in ovl_dir_read_merged() argument
344 .list = list, in ovl_dir_read_merged()
363 list_add(&rdd.middle, rdd.list); in ovl_dir_read_merged()
503 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
508 static int ovl_dir_read_impure(struct path *path, struct list_head *list, in ovl_dir_read_impure() argument
[all …]
|
| /fs/ |
| D | xattr.c | 357 vfs_listxattr(struct dentry *dentry, char *list, size_t size) in vfs_listxattr() argument
367 error = inode->i_op->listxattr(dentry, list, size); in vfs_listxattr()
369 error = security_inode_listsecurity(inode, list, size); in vfs_listxattr()
616 listxattr(struct dentry *d, char __user *list, size_t size) in listxattr() argument
631 if (size && copy_to_user(list, klist, error)) in listxattr()
644 static ssize_t path_listxattr(const char __user *pathname, char __user *list, in path_listxattr() argument
653 error = listxattr(path.dentry, list, size); in path_listxattr()
662 SYSCALL_DEFINE3(listxattr, const char __user *, pathname, char __user *, list, in SYSCALL_DEFINE3() argument
665 return path_listxattr(pathname, list, size, LOOKUP_FOLLOW); in SYSCALL_DEFINE3()
668 SYSCALL_DEFINE3(llistxattr, const char __user *, pathname, char __user *, list, in SYSCALL_DEFINE3() argument
[all …]
|
| D | dcookies.c | 70 struct list_head * list; in find_dcookie() local
72 list = dcookie_hashtable + dcookie_hash(dcookie); in find_dcookie()
74 list_for_each(pos, list) { in find_dcookie()
88 struct list_head * list = dcookie_hashtable + dcookie_hash(dcookie_value(dcs)); in hash_dcookie() local
89 list_add(&dcs->hash_list, list); in hash_dcookie()
286 struct list_head * list; in dcookie_exit() local
293 list = dcookie_hashtable + i; in dcookie_exit()
294 list_for_each_safe(pos, pos2, list) { in dcookie_exit()
|
| /fs/proc/ |
| D | kcore.c | 73 list_add_tail(&new->list, &kclist_head); in kclist_add()
85 list_for_each_entry(m, &kclist_head, list) { in get_kcore_size()
106 list_for_each_entry_safe(pos, tmp, head, list) { in free_kclist_ents()
107 list_del(&pos->list); in free_kclist_ents()
114 static void __kcore_update_ram(struct list_head *list) in __kcore_update_ram() argument
123 list_for_each_entry_safe(pos, tmp, &kclist_head, list) { in __kcore_update_ram()
126 list_move(&pos->list, &garbage); in __kcore_update_ram()
128 list_splice_tail(list, &kclist_head); in __kcore_update_ram()
130 list_splice(list, &garbage); in __kcore_update_ram()
157 list_add(&ent->list, &head); in kcore_update_ram()
[all …]
|
| /fs/btrfs/ |
| D | relocation.c | 56 struct list_head list; member
93 struct list_head list[2]; member
227 struct backref_node, list); in backref_cache_cleanup()
254 INIT_LIST_HEAD(&node->list); in alloc_backref_node()
358 struct backref_edge, list[LOWER]); in walk_up_backref()
380 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
384 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
385 struct backref_edge, list[LOWER]); in walk_down_backref()
417 list_del(&node->list); in drop_backref_node()
439 list[LOWER]); in remove_backref_node()
[all …]
|
| /fs/squashfs/ |
| D | decompressor_multi.c | 51 struct list_head list; member
59 list_add(&decomp_strm->list, &stream->strm_list); in put_decomp_stream()
97 list_add(&decomp_strm->list, &stream->strm_list); in squashfs_decompressor_create()
116 struct decomp_stream, list); in squashfs_decompressor_destroy()
117 list_del(&decomp_strm->list); in squashfs_decompressor_destroy()
140 struct decomp_stream, list); in get_decomp_stream()
141 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 | 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 …]
|
| D | erase.c | 59 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
93 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_block()
125 jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
126 list_move(&jeb->list, &c->erase_checking_list); in jffs2_erase_pending_blocks()
138 jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); in jffs2_erase_pending_blocks()
141 list_del(&jeb->list); in jffs2_erase_pending_blocks()
149 list_add(&jeb->list, &c->erasing_list); in jffs2_erase_pending_blocks()
177 list_move_tail(&jeb->list, &c->erase_complete_list); in jffs2_erase_succeeded()
196 list_move(&jeb->list, &c->erase_pending_list); in jffs2_erase_failed()
210 list_move(&jeb->list, &c->bad_list); in jffs2_erase_failed()
[all …]
|
| D | nodelist.h | 279 struct list_head list; member
352 #define frag_erase(frag, list) rb_erase(&frag->rb, list); argument
359 #define tn_erase(tn, list) rb_erase(&tn->rb, list); argument
360 #define tn_last(list) rb_entry(rb_last(list), struct jffs2_tmp_dnode_info, rb) argument
361 #define tn_first(list) rb_entry(rb_first(list), struct jffs2_tmp_dnode_info, rb) argument
364 …d_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list);
374 uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
|
| /fs/nilfs2/ |
| D | cpfile.c | 614 struct nilfs_snapshot_list *list; in nilfs_cpfile_block_get_snapshot_list() local
618 list = &cp->cp_snapshot_list; in nilfs_cpfile_block_get_snapshot_list()
621 list = &header->ch_snapshot_list; in nilfs_cpfile_block_get_snapshot_list()
623 return list; in nilfs_cpfile_block_get_snapshot_list()
631 struct nilfs_snapshot_list *list; in nilfs_cpfile_set_snapshot() local
663 list = &header->ch_snapshot_list; in nilfs_cpfile_set_snapshot()
668 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
684 list = &cp->cp_snapshot_list; in nilfs_cpfile_set_snapshot()
685 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
700 list = nilfs_cpfile_block_get_snapshot_list( in nilfs_cpfile_set_snapshot()
[all …]
|
| /fs/orangefs/ |
| D | waitqueue.c | 35 list_for_each_entry_safe(op, tmp, &orangefs_request_list, list) { in purge_waiting_ops()
119 list_add(&op->list, &orangefs_request_list); in service_operation()
121 list_add_tail(&op->list, &orangefs_request_list); in service_operation()
234 list_add(&op->list, &orangefs_request_list); in orangefs_cancel_op_in_progress()
263 if (list_empty(&op->list)) { in orangefs_clean_up_interrupted_operation()
275 list_del_init(&op->list); in orangefs_clean_up_interrupted_operation()
284 list_del_init(&op->list); in orangefs_clean_up_interrupted_operation()
|
| /fs/ext4/ |
| D | page-io.c | 127 BUG_ON(!list_empty(&io_end->list)); in ext4_release_io_end()
157 io, inode->i_ino, io->list.next, io->list.prev); in ext4_end_io()
183 list_for_each_entry(io, head, list) { in dump_completed_IO()
184 cur = &io->list; in dump_completed_IO()
186 io0 = container_of(before, ext4_io_end_t, list); in dump_completed_IO()
188 io1 = container_of(after, ext4_io_end_t, list); in dump_completed_IO()
211 list_add_tail(&io_end->list, &ei->i_rsv_conversion_list); in ext4_add_complete_io()
230 io = list_entry(unwritten.next, ext4_io_end_t, list); in ext4_do_flush_completed_IO()
232 list_del_init(&io->list); in ext4_do_flush_completed_IO()
256 INIT_LIST_HEAD(&io->list); in ext4_init_io_end()
|
| /fs/xfs/ |
| D | xfs_extent_busy.h | 36 struct list_head list; /* transaction busy extent list */ member
50 xfs_extent_busy_clear(struct xfs_mount *mp, struct list_head *list,
75 static inline void xfs_extent_busy_sort(struct list_head *list) in xfs_extent_busy_sort() argument
77 list_sort(NULL, list, xfs_extent_busy_ag_cmp); in xfs_extent_busy_sort()
|
| /fs/f2fs/ |
| D | extent_cache.c | 215 INIT_LIST_HEAD(&en->list); in __attach_extent_node()
247 f2fs_bug_on(sbi, list_empty(&en->list)); in __release_extent_node()
248 list_del_init(&en->list); in __release_extent_node()
270 INIT_LIST_HEAD(&et->list); in __grab_extent_tree()
275 list_del_init(&et->list); in __grab_extent_tree()
359 list_add_tail(&en->list, &sbi->extent_list); in __f2fs_init_extent_tree()
411 if (!list_empty(&en->list)) { in f2fs_lookup_extent_tree()
412 list_move_tail(&en->list, &sbi->extent_list); in f2fs_lookup_extent_tree()
454 if (!list_empty(&en->list)) { in __try_merge_extent_node()
455 list_move_tail(&en->list, &sbi->extent_list); in __try_merge_extent_node()
[all …]
|