Home
last modified time | relevance | path

Searched refs:items (Results 1 – 23 of 23) sorted by relevance

/fs/bcachefs/
A Dfast_list.h11 GENRADIX(void *) items;
21 while ((p = genradix_iter_peek(iter, &list->items)) && !*p) in fast_list_iter_peek()
22 genradix_iter_advance(iter, &list->items); in fast_list_iter_peek()
28 for (_iter = genradix_iter_init(&(_list)->items, _start); \
30 genradix_iter_advance(&(_iter), &(_list)->items))
A Dfast_list.c28 if (unlikely(!genradix_ptr_alloc_inlined(&l->items, idx, gfp))) { in fast_list_alloc_idx()
103 *genradix_ptr_inlined(&l->items, idx) = item; in fast_list_add()
123 *genradix_ptr_inlined(&l->items, idx) = NULL; in fast_list_remove()
145 genradix_free(&l->items); in fast_list_exit()
150 genradix_init(&l->items); in fast_list_init()
A Dbtree_key_cache.c765 LIST_HEAD(items); in bch2_fs_btree_key_cache_exit()
/fs/ceph/
A Dmetric.c37 s32 items = 0; in ceph_mdsc_send_metrics() local
71 items++; in ceph_mdsc_send_metrics()
84 items++; in ceph_mdsc_send_metrics()
97 items++; in ceph_mdsc_send_metrics()
110 items++; in ceph_mdsc_send_metrics()
121 items++; in ceph_mdsc_send_metrics()
133 items++; in ceph_mdsc_send_metrics()
143 items++; in ceph_mdsc_send_metrics()
153 items++; in ceph_mdsc_send_metrics()
163 items++; in ceph_mdsc_send_metrics()
[all …]
/fs/xfs/
A Dxfs_refcount_item.c311 struct list_head *items, in __xfs_refcount_update_create_intent() argument
324 list_sort(mp, items, xfs_refcount_update_diff_items); in __xfs_refcount_update_create_intent()
325 list_for_each_entry(ri, items, ri_list) in __xfs_refcount_update_create_intent()
333 struct list_head *items, in xfs_refcount_update_create_intent() argument
337 return __xfs_refcount_update_create_intent(tp, items, count, sort, in xfs_refcount_update_create_intent()
609 struct list_head *items, in xfs_rtrefcount_update_create_intent() argument
613 return __xfs_refcount_update_create_intent(tp, items, count, sort, in xfs_rtrefcount_update_create_intent()
A Dxfs_rmap_item.c336 struct list_head *items, in __xfs_rmap_update_create_intent() argument
349 list_sort(mp, items, xfs_rmap_update_diff_items); in __xfs_rmap_update_create_intent()
350 list_for_each_entry(ri, items, ri_list) in __xfs_rmap_update_create_intent()
358 struct list_head *items, in xfs_rmap_update_create_intent() argument
362 return __xfs_rmap_update_create_intent(tp, items, count, sort, in xfs_rmap_update_create_intent()
662 struct list_head *items, in xfs_rtrmap_update_create_intent() argument
666 return __xfs_rmap_update_create_intent(tp, items, count, sort, in xfs_rtrmap_update_create_intent()
A Dxfs_icache.c1970 WRITE_ONCE(gc->items, 0); in xfs_inodegc_worker()
2105 unsigned int items) in xfs_inodegc_want_queue_work() argument
2109 if (items > mp->m_ino_geo.inodes_per_cluster) in xfs_inodegc_want_queue_work()
2152 unsigned int items, in xfs_inodegc_want_flush_work() argument
2161 if (items > XFS_INODEGC_MAX_BACKLOG) in xfs_inodegc_want_flush_work()
2178 int items; in xfs_inodegc_queue() local
2191 items = READ_ONCE(gc->items); in xfs_inodegc_queue()
2192 WRITE_ONCE(gc->items, items + 1); in xfs_inodegc_queue()
2213 if (xfs_inodegc_want_queue_work(ip, items)) in xfs_inodegc_queue()
2221 if (xfs_inodegc_want_flush_work(ip, items, shrinker_hits)) { in xfs_inodegc_queue()
A Dxfs_extfree_item.c420 struct list_head *items, in __xfs_extent_free_create_intent() argument
433 list_sort(mp, items, xfs_extent_free_diff_items); in __xfs_extent_free_create_intent()
434 list_for_each_entry(xefi, items, xefi_list) in __xfs_extent_free_create_intent()
442 struct list_head *items, in xfs_extent_free_create_intent() argument
446 return __xfs_extent_free_create_intent(tp, items, count, sort, in xfs_extent_free_create_intent()
760 struct list_head *items, in xfs_rtextent_free_create_intent() argument
764 return __xfs_extent_free_create_intent(tp, items, count, sort, in xfs_rtextent_free_create_intent()
A Dxfs_bmap_item.c295 struct list_head *items, in xfs_bmap_update_create_intent() argument
306 list_sort(mp, items, xfs_bmap_update_diff_items); in xfs_bmap_update_create_intent()
307 list_for_each_entry(bi, items, bi_list) in xfs_bmap_update_create_intent()
A Dxfs_exchmaps_item.c217 struct list_head *items, in xfs_exchmaps_create_intent() argument
227 xmi = list_first_entry_or_null(items, struct xfs_exchmaps_intent, in xfs_exchmaps_create_intent()
A Dxfs_attr_item.c414 struct list_head *items, in xfs_attr_create_intent() argument
429 attr = list_first_entry_or_null(items, struct xfs_attr_intent, in xfs_attr_create_intent()
A Dxfs_mount.h69 unsigned int items; member
A Dxfs_super.c1223 gc->items = 0; in xfs_inodegc_init_percpu()
/fs/
A Dbinfmt_elf.c126 #define STACK_ADD(sp, items) ((elf_addr_t __user *)(sp) + (items)) argument
127 #define STACK_ROUND(sp, items) \ argument
128 ((15 + (unsigned long) ((sp) + (items))) &~ 15UL)
133 #define STACK_ADD(sp, items) ((elf_addr_t __user *)(sp) - (items)) argument
134 #define STACK_ROUND(sp, items) \ argument
135 (((unsigned long) (sp - items)) &~ 15UL)
164 int items; in create_elf_tables() local
287 items = (argc + 1) + (envc + 1) + 1; in create_elf_tables()
288 bprm->p = STACK_ROUND(sp, items); in create_elf_tables()
292 sp = (elf_addr_t __user *)bprm->p - items - ei_index; in create_elf_tables()
/fs/btrfs/
A Ddelayed-inode.c44 atomic_set(&delayed_root->items, 0); in btrfs_init_delayed_root()
399 atomic_inc(&delayed_node->root->fs_info->delayed_root->items); in __btrfs_add_delayed_item()
408 if ((atomic_dec_return(&delayed_root->items) < in finish_one_item()
1320 if (atomic_read(&delayed_root->items) < in btrfs_async_run_delayed_root()
1393 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) in could_end_wait()
1403 if ((atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) || in btrfs_balance_delayed_items()
1407 if (atomic_read(&delayed_root->items) >= BTRFS_DELAYED_WRITEBACK) { in btrfs_balance_delayed_items()
1926 atomic_inc(&root->fs_info->delayed_root->items); in btrfs_delayed_update_inode()
1970 atomic_inc(&fs_info->delayed_root->items); in btrfs_delayed_delete_inode_ref()
A Ddelayed-inode.h41 atomic_t items; /* for delayed items */ member
A Droot-tree.c510 struct btrfs_block_rsv *rsv, int items, in btrfs_subvolume_reserve_metadata() argument
529 num_bytes = btrfs_calc_insert_metadata_size(fs_info, items); in btrfs_subvolume_reserve_metadata()
A Dspace-info.c681 u64 items; in shrink_delalloc() local
692 items = U64_MAX; in shrink_delalloc()
707 items = calc_reclaim_items_nr(fs_info, to_reclaim) * 2; in shrink_delalloc()
769 btrfs_wait_ordered_roots(fs_info, items, NULL); in shrink_delalloc()
A Daccessors.h439 return offsetof(struct btrfs_leaf, items) + in btrfs_item_nr_offset()
A Dctree.c761 p = offsetof(struct btrfs_leaf, items); in btrfs_bin_search()
/fs/xfs/libxfs/
A Dxfs_defer.h53 struct list_head *items, unsigned int count, bool sort);
A Dxfs_defer.c190 struct list_head *items, in xfs_defer_barrier_create_intent() argument
/fs/cramfs/
A DREADME5 a bit looser, e.g. it doesn't care if the <file_data> items are

Completed in 647 milliseconds