Searched refs:nr_paths (Results 1 – 9 of 9) sorted by relevance
| /linux/drivers/md/ |
| A D | dm-switch.c | 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()
224 sctx->path_list[sctx->nr_paths].start = start; in parse_path()
226 sctx->nr_paths++; in parse_path()
238 while (sctx->nr_paths--) in switch_dtr()
269 r = dm_read_arg(_args, &as, &nr_paths, &ti->error); in switch_ctr()
282 if (as.argc != nr_paths * 2) { in switch_ctr()
287 sctx = alloc_switch_ctx(ti, nr_paths, region_size); in switch_ctr()
303 r = alloc_region_table(ti, nr_paths); in switch_ctr()
[all …]
|
| /linux/fs/xfs/scrub/ |
| A D | dirtree_repair.c | 561 if (dl->nr_paths > XFS_MAXLINK) { in xrep_dirtree_create_adoption_path()
562 ASSERT(dl->nr_paths <= XFS_MAXLINK); in xrep_dirtree_create_adoption_path()
590 trace_xrep_dirtree_create_adoption(sc, sc->ip, dl->nr_paths, in xrep_dirtree_create_adoption_path()
600 path->path_nr = dl->nr_paths; in xrep_dirtree_create_adoption_path()
603 dl->nr_paths++; in xrep_dirtree_create_adoption_path()
|
| A D | dirtree.c | 233 if (dl->nr_paths >= XFS_MAXLINK) in xchk_dirtree_create_path()
236 trace_xchk_dirtree_create_path(sc, ip, dl->nr_paths, &xname, rec); in xchk_dirtree_create_path()
257 path->path_nr = dl->nr_paths; in xchk_dirtree_create_path()
260 dl->nr_paths++; in xchk_dirtree_create_path()
735 dl->nr_paths = 0; in xchk_dirtree_reset()
|
| A D | dirtree.h | 141 unsigned int nr_paths; member
|
| A D | trace.h | 1819 __field(unsigned int, nr_paths)
1829 __entry->nr_paths = dl->nr_paths;
1839 __entry->nr_paths,
|
| /linux/fs/bcachefs/ |
| A D | btree_types.h | 476 unsigned long nr_paths; member
493 btree_path_idx_t nr_paths; member
|
| A D | btree_iter.c | 1596 size_t nr = bitmap_weight(trans->paths_allocated, trans->nr_paths); in bch2_trans_update_max_paths()
1638 unsigned nr = trans->nr_paths * 2; in btree_paths_realloc()
1647 …memcpy(paths_allocated, trans->paths_allocated, BITS_TO_LONGS(trans->nr_paths) * sizeof(unsigned l… in btree_paths_realloc()
1653 memcpy(paths, trans->paths, trans->nr_paths * sizeof(struct btree_path)); in btree_paths_realloc()
1661 memcpy(updates, trans->updates, trans->nr_paths * sizeof(struct btree_insert_entry)); in btree_paths_realloc()
1670 trans->nr_paths = nr; in btree_paths_realloc()
1679 btree_path_idx_t idx = find_first_zero_bit(trans->paths_allocated, trans->nr_paths); in btree_path_alloc()
1681 if (unlikely(idx == trans->nr_paths)) { in btree_path_alloc()
1682 if (trans->nr_paths == BTREE_ITER_MAX) { in btree_path_alloc()
2763 BUG_ON(trans->nr_sorted != bitmap_weight(trans->paths_allocated, trans->nr_paths) - 1); in btree_trans_verify_sorted_refs()
[all …]
|
| A D | btree_iter.h | 86 return &container_of(paths, struct btree_trans_paths, paths[0])->nr_paths; in trans_paths_nr()
109 while (*idx < trans->nr_paths) { in __trans_next_path()
697 if (bitmap_weight(trans->paths_allocated, trans->nr_paths) > BTREE_ITER_NORMAL_LIMIT - 8) in btree_trans_too_many_iters()
|
| A D | btree_update.c | 395 EBUG_ON(trans->nr_updates >= trans->nr_paths); in bch2_trans_update_by_path()
|
Completed in 29 milliseconds