| /fs/yaffs2/ |
| D | devextras.h | 42 struct ylist_head *next; /* next in chain */ member
56 (p)->next = (p);\
65 struct ylist_head *listNext = list->next; in ylist_add()
67 list->next = newEntry; in ylist_add()
69 newEntry->next = listNext; in ylist_add()
80 newEntry->next = list; in ylist_add_tail()
82 listPrev->next = newEntry; in ylist_add_tail()
91 struct ylist_head *listNext = entry->next; in ylist_del()
95 listPrev->next = listNext; in ylist_del()
102 entry->next = entry->prev = entry; in ylist_del_init()
[all …]
|
| /fs/smbfs/ |
| D | cache.c | 62 struct list_head *next; in smb_invalidate_dircache_entries() local
66 next = parent->d_subdirs.next; in smb_invalidate_dircache_entries()
67 while (next != &parent->d_subdirs) { in smb_invalidate_dircache_entries()
68 dentry = list_entry(next, struct dentry, d_u.d_child); in smb_invalidate_dircache_entries()
71 next = next->next; in smb_invalidate_dircache_entries()
84 struct list_head *next; in smb_dget_fpos() local
100 next = parent->d_subdirs.next; in smb_dget_fpos()
101 while (next != &parent->d_subdirs) { in smb_dget_fpos()
102 dent = list_entry(next, struct dentry, d_u.d_child); in smb_dget_fpos()
110 next = next->next; in smb_dget_fpos()
|
| /fs/autofs4/ |
| D | expire.c | 98 struct list_head *next = p->d_subdirs.next; in next_dentry() local
100 if (next == &p->d_subdirs) { in next_dentry()
104 next = p->d_u.d_child.next; in next_dentry()
105 if (next != &p->d_parent->d_subdirs) in next_dentry()
110 return list_entry(next, struct dentry, d_u.d_child); in next_dentry()
305 struct list_head *next; in autofs4_expire_indirect() local
318 next = root->d_subdirs.next; in autofs4_expire_indirect()
322 while ( next != &root->d_subdirs ) { in autofs4_expire_indirect()
323 struct dentry *dentry = list_entry(next, struct dentry, d_u.d_child); in autofs4_expire_indirect()
327 next = next->next; in autofs4_expire_indirect()
[all …]
|
| D | inode.c | 107 struct list_head *next; in autofs4_force_release() local
114 next = this_parent->d_subdirs.next; in autofs4_force_release()
116 while (next != &this_parent->d_subdirs) { in autofs4_force_release()
117 struct dentry *dentry = list_entry(next, struct dentry, d_u.d_child); in autofs4_force_release()
121 next = next->next; in autofs4_force_release()
130 next = next->next; in autofs4_force_release()
143 next = this_parent->d_u.d_child.next; in autofs4_force_release()
|
| /fs/jfs/ |
| D | jfs_txnmgr.c | 205 TxAnchor.freelock = TxLock[lid].next; in txLockAlloc()
219 TxLock[lid].next = TxAnchor.freelock; in txLockFree()
290 TxBlock[k].next = k + 1; in txInit()
294 TxBlock[k].next = 0; in txInit()
318 TxLock[k].next = k + 1; in txInit()
319 TxLock[k].next = 0; in txInit()
412 if ((tblk->next == 0) && !(flag & COMMIT_FORCE)) { in txBegin()
420 TxAnchor.freetid = tblk->next; in txBegin()
432 tblk->next = tblk->last = tblk->xflag = tblk->flag = tblk->lsn = 0; in txBegin()
537 assert(tblk->next == 0); in txEnd()
[all …]
|
| D | jfs_dtree.c | 495 static void free_index(tid_t tid, struct inode *ip, u32 index, u32 next) in free_index() argument
508 dirtab_slot->addr2 = cpu_to_le32(next); in free_index()
1409 nextbn = le64_to_cpu(sp->header.next); in dtSplitPage()
1410 rp->header.next = cpu_to_le64(nextbn); in dtSplitPage()
1412 sp->header.next = cpu_to_le64(rbn); in dtSplitPage()
1457 f->next = fsi; in dtSplitPage()
1458 f->next = -1; in dtSplitPage()
1574 f->next = fsi; in dtSplitPage()
1575 f->next = -1; in dtSplitPage()
1786 f->next = last; in dtExtendPage()
[all …]
|
| D | jfs_txnmgr.h | 48 lid_t next; /* index of first tlock of tid */ member
96 lid_t next; /* 2: index next lockword on tid locklist member
171 lid_t next; /* 2: next linelock */ member
187 lid_t next; /* 2: */ member
218 lid_t next; /* 2: */ member
246 lid_t next; /* 2: */ member
|
| /fs/ |
| D | char_dev.c | 50 struct char_device_struct *next; member
72 for (cd = chrdevs[offset]; cd; cd = cd->next) in chrdev_show()
127 for (cp = &chrdevs[i]; *cp; cp = &(*cp)->next) in __register_chrdev_region()
154 cd->next = *cp; in __register_chrdev_region()
171 for (cp = &chrdevs[i]; *cp; cp = &(*cp)->next) in __unregister_chrdev_region()
178 *cp = cd->next; in __unregister_chrdev_region()
197 dev_t n, next; in register_chrdev_region() local
199 for (n = from; n < to; n = next) { in register_chrdev_region()
200 next = MKDEV(MAJOR(n)+1, 0); in register_chrdev_region()
201 if (next > to) in register_chrdev_region()
[all …]
|
| D | filesystems.c | 49 for (p=&file_systems; *p; p=&(*p)->next) in find_filesystem()
75 if (fs->next) in register_filesystem()
110 *tmp = fs->next; in unregister_filesystem()
111 fs->next = NULL; in unregister_filesystem()
115 tmp = &(*tmp)->next; in unregister_filesystem()
136 for (tmp=file_systems, index=0 ; tmp ; tmp=tmp->next, index++) { in fs_index()
153 for (tmp = file_systems; tmp; tmp = tmp->next, index--) in fs_name()
173 for (tmp = file_systems, index = 0 ; tmp ; tmp = tmp->next, index++) in fs_maxindex()
213 tmp = tmp->next; in get_filesystem_list()
230 tmp = tmp->next; in filesystems_proc_show()
|
| D | dcache.c | 350 struct list_head *head, *next, *tmp; in __d_find_alias() local
354 next = inode->i_dentry.next; in __d_find_alias()
355 while (next != head) { in __d_find_alias()
356 tmp = next; in __d_find_alias()
357 next = tmp->next; in __d_find_alias()
358 prefetch(next); in __d_find_alias()
648 dentry = list_entry(dentry->d_subdirs.next, in shrink_dcache_for_umount_subtree()
704 dentry = list_entry(dentry->d_subdirs.next, in shrink_dcache_for_umount_subtree()
760 struct list_head *next; in have_submounts() local
766 next = this_parent->d_subdirs.next; in have_submounts()
[all …]
|
| D | file.c | 26 struct fdtable *next; member
72 fdt = f->next; in free_fdtable_work()
73 f->next = NULL; in free_fdtable_work()
76 struct fdtable *next = fdt->next; in free_fdtable_work() local
80 fdt = next; in free_fdtable_work()
107 fdt->next = fddef->next; in free_fdtable_rcu()
108 fddef->next = fdt; in free_fdtable_rcu()
181 fdt->next = NULL; in alloc_fdtable()
315 new_fdt->next = NULL; in dup_fd()
412 fddef->next = NULL; in fdtable_defer_list_init()
|
| D | pnode.c | 18 return list_entry(p->mnt_share.next, struct vfsmount, mnt_share); in next_peer()
23 return list_entry(p->mnt_slave_list.next, struct vfsmount, mnt_slave); in first_slave()
28 return list_entry(p->mnt_slave.next, struct vfsmount, mnt_slave); in next_slave()
159 struct vfsmount *next; in propagation_next() local
163 next = next_peer(m); in propagation_next()
164 return ((next == origin) ? NULL : next); in propagation_next()
165 } else if (m->mnt_slave.next != &master->mnt_slave_list) in propagation_next()
|
| /fs/ncpfs/ |
| D | ncplib_kernel.h | 192 struct list_head *next; in ncp_renew_dentries() local
196 next = parent->d_subdirs.next; in ncp_renew_dentries()
197 while (next != &parent->d_subdirs) { in ncp_renew_dentries()
198 dentry = list_entry(next, struct dentry, d_u.d_child); in ncp_renew_dentries()
205 next = next->next; in ncp_renew_dentries()
214 struct list_head *next; in ncp_invalidate_dircache_entries() local
218 next = parent->d_subdirs.next; in ncp_invalidate_dircache_entries()
219 while (next != &parent->d_subdirs) { in ncp_invalidate_dircache_entries()
220 dentry = list_entry(next, struct dentry, d_u.d_child); in ncp_invalidate_dircache_entries()
223 next = next->next; in ncp_invalidate_dircache_entries()
|
| /fs/autofs/ |
| D | dirhash.c | 49 ent = list_entry(dh->expiry_head.next, struct autofs_dir_ent, exp); in autofs_expire()
118 for ( dhn = dh->h[(unsigned) name->hash % AUTOFS_HASH_SIZE] ; dhn ; dhn = dhn->next ) { in autofs_hash_lookup()
140 ent->next = *dhnp; in autofs_hash_insert()
143 if ( ent->next ) in autofs_hash_insert()
144 ent->next->back = &(ent->next); in autofs_hash_insert()
149 *(ent->back) = ent->next; in autofs_hash_delete()
150 if ( ent->next ) in autofs_hash_delete()
151 ent->next->back = ent->back; in autofs_hash_delete()
184 ent = last ? last->next : NULL; in autofs_hash_enum()
192 ent = ent->next; in autofs_hash_enum()
[all …]
|
| /fs/partitions/ |
| D | msdos.c | 124 if (state->next == state->limit) in parse_extended()
148 u32 offs, size, next; in parse_extended() local
156 next = this_sector + offs; in parse_extended()
160 if (next < first_sector) in parse_extended()
162 if (next + size > first_sector + first_size) in parse_extended()
166 put_partition(state, state->next, next, size); in parse_extended()
168 state->parts[state->next].flags = ADDPART_FLAG_RAID; in parse_extended()
170 if (++state->next == state->limit) in parse_extended()
224 for (i=0; i<max_nparts && state->next<state->limit; i++) { in parse_solaris_x86()
231 put_partition(state, state->next++, in parse_solaris_x86()
[all …]
|
| /fs/jffs2/ |
| D | nodelist.c | 42 new->next = (*prev)->next; in jffs2_add_fd_to_list()
52 prev = &((*prev)->next); in jffs2_add_fd_to_list()
54 new->next = *prev; in jffs2_add_fd_to_list()
72 struct jffs2_node_frag *next = frag_next(frag); in jffs2_truncate_fragtree() local
76 frag = next; in jffs2_truncate_fragtree()
394 struct jffs2_node_frag *next = frag_next(newfrag); in jffs2_add_full_dnode_to_inode() local
396 if (next) { in jffs2_add_full_dnode_to_inode()
398 if (next->node) in jffs2_add_full_dnode_to_inode()
399 mark_ref_normal(next->node->raw); in jffs2_add_full_dnode_to_inode()
426 ret = ret->next; in jffs2_get_ino_cache()
[all …]
|
| D | xattr.c | 563 ref->next = ic->xref; in create_xattr_ref()
579 ref->next = c->xref_dead_list; in delete_xattr_ref()
600 _ref = ref->next; in jffs2_xattr_delete_inode()
615 _ref = ref->next; in jffs2_xattr_free_inode()
641 for (ref=ic->xref, pref=&ic->xref; ref; pref=&ref->next, ref=ref->next) { in check_xattr_ref_inode()
645 *pref = ref->next; in check_xattr_ref_inode()
651 for (cmp=ref->next, pcmp=&ref->next; cmp; pcmp=&cmp->next, cmp=cmp->next) { in check_xattr_ref_inode()
657 *pcmp = cmp->next; in check_xattr_ref_inode()
666 *pcmp = cmp->next; in check_xattr_ref_inode()
669 *pref = ref->next; in check_xattr_ref_inode()
[all …]
|
| D | build.c | 36 if (ic->next) in next_inode()
37 return ic->next; in next_inode()
56 for(fd = ic->scan_dents; fd; fd = fd->next) { in jffs2_build_inode_pass1()
145 dead_fds = fd->next; in jffs2_build_filesystem()
161 ic->scan_dents = fd->next; in jffs2_build_filesystem()
182 ic->scan_dents = fd->next; in jffs2_build_filesystem()
203 struct jffs2_raw_node_ref *next = raw->next_in_ino; in jffs2_build_remove_unlinked_inode() local
206 raw = next; in jffs2_build_remove_unlinked_inode()
217 ic->scan_dents = fd->next; in jffs2_build_remove_unlinked_inode()
249 fd->next = *dead_fds; in jffs2_build_remove_unlinked_inode()
|
| /fs/btrfs/ |
| D | extent_map.c | 181 static int mergable_maps(struct extent_map *prev, struct extent_map *next) in mergable_maps() argument
193 if (extent_map_end(prev) == next->start && in mergable_maps()
194 prev->flags == next->flags && in mergable_maps()
195 prev->bdev == next->bdev && in mergable_maps()
196 ((next->block_start == EXTENT_MAP_HOLE && in mergable_maps()
198 (next->block_start == EXTENT_MAP_INLINE && in mergable_maps()
200 (next->block_start == EXTENT_MAP_DELALLOC && in mergable_maps()
202 (next->block_start < EXTENT_MAP_LAST_BYTE - 1 && in mergable_maps()
203 next->block_start == extent_map_block_end(prev)))) { in mergable_maps()
295 struct rb_node *next = NULL; in lookup_extent_mapping() local
[all …]
|
| D | async-thread.c | 108 work = list_entry(workers->order_list.next, in run_ordered_completions()
148 cur = worker->pending.next; in worker_loop()
229 cur = workers->worker_list.next; in btrfs_stop_workers()
306 struct list_head *next; in next_worker() local
316 next = workers->idle_list.next; in next_worker()
317 worker = list_entry(next, struct btrfs_worker_thread, in next_worker()
330 next = workers->worker_list.next; in next_worker()
331 worker = list_entry(next, struct btrfs_worker_thread, worker_list); in next_worker()
336 list_move_tail(next, &workers->worker_list); in next_worker()
364 fallback = workers->worker_list.next; in find_worker()
[all …]
|
| /fs/omfs/ |
| D | file.c | 53 u64 next, last; in omfs_shrink_inode() local
61 next = inode->i_ino; in omfs_shrink_inode()
68 bh = sb_bread(inode->i_sb, clus_to_blk(sbi, next)); in omfs_shrink_inode()
77 if (omfs_is_bad(sbi, (struct omfs_header *) bh->b_data, next)) in omfs_shrink_inode()
85 last = next; in omfs_shrink_inode()
86 next = be64_to_cpu(oe->e_next); in omfs_shrink_inode()
105 if (next == ~0) in omfs_shrink_inode()
108 bh = sb_bread(inode->i_sb, clus_to_blk(sbi, next)); in omfs_shrink_inode()
238 sector_t next, offset; in omfs_get_block() local
256 next = inode->i_ino; in omfs_get_block()
[all …]
|
| /fs/xfs/ |
| D | xfs_mru_cache.c | 237 xfs_mru_cache_elem_t *elem, *next; in _xfs_mru_cache_clear_reap_list() local
241 list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) { in _xfs_mru_cache_clear_reap_list()
254 list_for_each_entry_safe(elem, next, &tmp, list_node) { in _xfs_mru_cache_clear_reap_list()
281 unsigned long now, next; in _xfs_mru_cache_reap() local
288 next = _xfs_mru_cache_migrate(mru, jiffies); in _xfs_mru_cache_reap()
291 mru->queued = next; in _xfs_mru_cache_reap()
294 if (next <= now) in _xfs_mru_cache_reap()
295 next = 0; in _xfs_mru_cache_reap()
297 next -= now; in _xfs_mru_cache_reap()
298 queue_delayed_work(xfs_mru_reap_wq, &mru->work, next); in _xfs_mru_cache_reap()
|
| D | xfs_trans_ail.c | 124 cur->next = ailp->xa_cursors.next; in xfs_trans_ail_cursor_init()
125 ailp->xa_cursors.next = cur; in xfs_trans_ail_cursor_init()
178 for (cur = prev->next; cur; prev = cur, cur = prev->next) { in xfs_trans_ail_cursor_done()
180 prev->next = cur->next; in xfs_trans_ail_cursor_done()
204 for (cur = &ailp->xa_cursors; cur; cur = cur->next) { in xfs_trans_ail_cursor_clear()
684 if (lip->li_ail.next == &ailp->xa_ail) in xfs_ail_next()
712 prev_lip = list_entry(lip->li_ail.next, xfs_log_item_t, li_ail); in xfs_ail_check()
|
| /fs/proc/ |
| D | generic.c | 269 const char *cp = name, *next; in xlate_proc_name() local
280 next = strchr(cp, '/'); in xlate_proc_name()
281 if (!next) in xlate_proc_name()
284 len = next - cp; in xlate_proc_name()
285 for (de = de->subdir; de ; de = de->next) { in xlate_proc_name()
382 for (de = de->subdir; de ; de = de->next) { in proc_lookup_de()
461 de = de->next; in proc_readdir_de()
466 struct proc_dir_entry *next; in proc_readdir_de() local
478 next = de->next; in proc_readdir_de()
480 de = next; in proc_readdir_de()
[all …]
|
| /fs/fat/ |
| D | fatent.c | 120 int next; in fat12_ent_get() local
124 next = (*ent12_p[0] >> 4) | (*ent12_p[1] << 4); in fat12_ent_get()
126 next = (*ent12_p[1] << 8) | *ent12_p[0]; in fat12_ent_get()
129 next &= 0x0fff; in fat12_ent_get()
130 if (next >= BAD_FAT12) in fat12_ent_get()
131 next = FAT_ENT_EOF; in fat12_ent_get()
132 return next; in fat12_ent_get()
137 int next = le16_to_cpu(*fatent->u.ent16_p); in fat16_ent_get() local
139 if (next >= BAD_FAT16) in fat16_ent_get()
140 next = FAT_ENT_EOF; in fat16_ent_get()
[all …]
|