Home
last modified time | relevance | path

Searched refs:nr_paths (Results 1 – 6 of 6) sorted by relevance

/linux/drivers/md/
H A Ddm-switch.c42 unsigned int nr_paths; /* Number of paths in path_list. */ member
60 static struct switch_ctx *alloc_switch_ctx(struct dm_target *ti, unsigned int nr_paths, in alloc_switch_ctx() argument
65 sctx = kzalloc(struct_size(sctx, path_list, nr_paths), GFP_KERNEL); in alloc_switch_ctx()
77 static int alloc_region_table(struct dm_target *ti, unsigned int nr_paths) in alloc_region_table() argument
90 (region_table_slot_t)1 << sctx->region_table_entry_bits < nr_paths) in alloc_region_table()
169 if (unlikely(path_nr >= sctx->nr_paths)) in switch_get_path_nr()
200 if (++path_nr >= sctx->nr_paths) in initialise_region_table()
212 &sctx->path_list[sctx->nr_paths].dmdev); in parse_path()
220 dm_put_device(ti, sctx->path_list[sctx->nr_paths].dmdev); in parse_path()
224 sctx->path_list[sctx->nr_paths].start = start; in parse_path()
[all …]
/linux/fs/bcachefs/
H A Dbtree_iter.h25 EBUG_ON(idx >= trans->nr_paths); in __btree_path_get()
39 EBUG_ON(path - trans->paths >= trans->nr_paths); in __btree_path_put()
89 return &container_of(paths, struct btree_trans_paths, paths[0])->nr_paths; in trans_paths_nr()
112 while (*idx < trans->nr_paths) { in __trans_next_path()
755 if (bitmap_weight(trans->paths_allocated, trans->nr_paths) > BTREE_ITER_NORMAL_LIMIT - 8) in btree_trans_too_many_iters()
H A Dbtree_types.h473 unsigned long nr_paths; member
506 btree_path_idx_t nr_paths; member
H A Dbtree_iter.c1623 size_t nr = bitmap_weight(trans->paths_allocated, trans->nr_paths); in bch2_trans_update_max_paths()
1665 unsigned nr = trans->nr_paths * 2; in btree_paths_realloc()
1674 …memcpy(paths_allocated, trans->paths_allocated, BITS_TO_LONGS(trans->nr_paths) * sizeof(unsigned l… in btree_paths_realloc()
1680 memcpy(paths, trans->paths, trans->nr_paths * sizeof(struct btree_path)); in btree_paths_realloc()
1688 memcpy(updates, trans->updates, trans->nr_paths * sizeof(struct btree_insert_entry)); in btree_paths_realloc()
1697 trans->nr_paths = nr; in btree_paths_realloc()
1706 btree_path_idx_t idx = find_first_zero_bit(trans->paths_allocated, trans->nr_paths); in btree_path_alloc()
1708 if (unlikely(idx == trans->nr_paths)) { in btree_path_alloc()
1709 if (trans->nr_paths == BTREE_ITER_MAX) { in btree_path_alloc()
2986 BUG_ON(trans->nr_sorted != bitmap_weight(trans->paths_allocated, trans->nr_paths) - 1); in btree_trans_verify_sorted_refs()
[all …]
H A Dbtree_update.c376 EBUG_ON(trans->nr_updates >= trans->nr_paths); in bch2_trans_update_by_path()
/linux/fs/xfs/scrub/
H A Dtrace.h1833 __field(unsigned int, nr_paths)
1843 __entry->nr_paths = dl->nr_paths;
1853 __entry->nr_paths,