Home
last modified time | relevance | path

Searched refs:nr_items (Results 1 – 13 of 13) sorted by relevance

/linux-6.3-rc2/mm/
A Dlist_lru.c131 if (!l->nr_items++) in list_lru_add()
134 nlru->nr_items++; in list_lru_add()
153 l->nr_items--; in list_lru_del()
154 nlru->nr_items--; in list_lru_del()
166 list->nr_items--; in list_lru_isolate()
174 list->nr_items--; in list_lru_isolate_move()
238 nlru->nr_items--; in __list_lru_walk_one()
334 l->nr_items = 0; in init_one_lru()
410 if (src->nr_items) { in memcg_reparent_list_lru_node()
411 dst->nr_items += src->nr_items; in memcg_reparent_list_lru_node()
[all …]
A Dvmscan.c210 static inline int shrinker_map_size(int nr_items) in shrinker_map_size() argument
212 return (DIV_ROUND_UP(nr_items, BITS_PER_LONG) * sizeof(unsigned long)); in shrinker_map_size()
215 static inline int shrinker_defer_size(int nr_items) in shrinker_defer_size() argument
217 return (round_up(nr_items, BITS_PER_LONG) * sizeof(atomic_long_t)); in shrinker_defer_size()
/linux-6.3-rc2/fs/btrfs/
A Dtree-mod-log.c37 int nr_items; member
253 int nr_items) in btrfs_tree_mod_log_insert_move() argument
277 tm->move.nr_items = nr_items; in btrfs_tree_mod_log_insert_move()
280 for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { in btrfs_tree_mod_log_insert_move()
313 for (i = 0; i < nr_items; i++) { in btrfs_tree_mod_log_insert_move()
484 int nr_items) in btrfs_tree_mod_log_eb_copy() argument
505 tm_list_rem = tm_list + nr_items; in btrfs_tree_mod_log_eb_copy()
506 for (i = 0; i < nr_items; i++) { in btrfs_tree_mod_log_eb_copy()
526 for (i = 0; i < nr_items; i++) { in btrfs_tree_mod_log_eb_copy()
541 for (i = 0; i < nr_items * 2; i++) { in btrfs_tree_mod_log_eb_copy()
[all …]
A Dtree-mod-log.h47 int nr_items);
50 int nr_items);
A Dctree.c125 int dst_item, int src_item, int nr_items) in memmove_leaf_items() argument
129 nr_items * sizeof(struct btrfs_item)); in memmove_leaf_items()
146 int dst_item, int src_item, int nr_items) in copy_leaf_items() argument
150 nr_items * sizeof(struct btrfs_item)); in copy_leaf_items()
A Dvolumes.c7339 const int nr_items = btrfs_header_nritems(node); in readahead_tree_node_children() local
7341 for (i = 0; i < nr_items; i++) in readahead_tree_node_children()
7757 if (stats->nr_items > i) in btrfs_get_dev_stats()
7767 if (stats->nr_items > i) in btrfs_get_dev_stats()
7770 if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX) in btrfs_get_dev_stats()
7771 stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX; in btrfs_get_dev_stats()
A Dextent-tree.c1793 int nr_items = 1; /* Dropping this ref head update. */ in btrfs_cleanup_ref_head_accounting() local
1803 nr_items += btrfs_csum_bytes_to_leaves(fs_info, head->num_bytes); in btrfs_cleanup_ref_head_accounting()
1806 btrfs_delayed_refs_rsv_release(fs_info, nr_items); in btrfs_cleanup_ref_head_accounting()
A Dioctl.c1624 if (*num_found >= sk->nr_items) { in copy_to_sk()
1723 sk->nr_items = num_found; in search_ioctl()
/linux-6.3-rc2/include/linux/
A Dlist_lru.h32 long nr_items; member
46 long nr_items; member
/linux-6.3-rc2/fs/xfs/
A Dxfs_trans_ail.c799 int nr_items, in xfs_trans_ail_update_bulk() argument
807 ASSERT(nr_items > 0); /* Not required, but true. */ in xfs_trans_ail_update_bulk()
810 for (i = 0; i < nr_items; i++) { in xfs_trans_ail_update_bulk()
A Dxfs_trans_priv.h73 struct xfs_log_item **log_items, int nr_items,
A Dxfs_trans.c723 int nr_items, in xfs_log_item_batch_insert() argument
730 xfs_trans_ail_update_bulk(ailp, cur, log_items, nr_items, commit_lsn); in xfs_log_item_batch_insert()
732 for (i = 0; i < nr_items; i++) { in xfs_log_item_batch_insert()
/linux-6.3-rc2/include/uapi/linux/
A Dbtrfs.h556 __u32 nr_items; /* in/out */ member
738 __u64 nr_items; /* in/out */ member

Completed in 64 milliseconds