Searched refs:nr_paths (Results 1 – 8 of 8) sorted by relevance
| /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()
746 dl->nr_paths = 0; in xchk_dirtree_reset()
|
| A D | dirtree.h | 141 unsigned int nr_paths; member
|
| A D | trace.h | 1833 __field(unsigned int, nr_paths)
1843 __entry->nr_paths = dl->nr_paths;
1853 __entry->nr_paths,
|
| /fs/bcachefs/ |
| A D | btree_iter.h | 25 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()
|
| A D | btree_iter.c | 1623 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 …]
|
| A D | btree_types.h | 473 unsigned long nr_paths; member
506 btree_path_idx_t nr_paths; member
|
| A D | btree_update.c | 376 EBUG_ON(trans->nr_updates >= trans->nr_paths); in bch2_trans_update_by_path()
|
Completed in 704 milliseconds