Searched refs:path_idx (Results 1 – 8 of 8) sorted by relevance
| /fs/bcachefs/ |
| A D | btree_update.c | 336 btree_path_idx_t path_idx = in flush_new_cached_update() local
339 ret = bch2_btree_path_traverse(trans, path_idx, 0); in flush_new_cached_update()
343 struct btree_path *btree_path = trans->paths + path_idx; in flush_new_cached_update()
359 ret = bch2_trans_update_by_path(trans, path_idx, i->k, flags, ip); in flush_new_cached_update()
361 bch2_path_put(trans, path_idx, true); in flush_new_cached_update()
374 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_by_path()
386 .path = path_idx, in bch2_trans_update_by_path()
499 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update_ip() local
519 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_ip()
528 path_idx = iter->key_cache_path; in bch2_trans_update_ip()
[all …]
|
| A D | btree_iter.c | 1153 btree_path_idx_t path_idx, in bch2_btree_path_traverse_one() argument
1183 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1295 path_idx = bch2_btree_path_make_mut(trans, path_idx, intent, ip); in __bch2_btree_path_set_pos()
1338 return path_idx; in __bch2_btree_path_set_pos()
1440 __bch2_path_free(trans, path_idx); in bch2_path_put()
1764 path_pos = iter.path_idx; in bch2_path_get()
1776 path = trans->paths + path_idx; in bch2_path_get()
1779 path = trans->paths + path_idx; in bch2_path_get()
1811 return path_idx; in bch2_path_get()
1822 path_idx = bch2_btree_path_make_mut(trans, path_idx, true, _RET_IP_); in bch2_path_get_unlocked_mut()
[all …]
|
| A D | btree_locking.c | 64 u8 path_idx; member
298 btree_path_idx_t path_idx; in bch2_check_for_deadlock() local
330 path_idx, top->path_idx) { in bch2_check_for_deadlock()
331 struct btree_path *path = paths + path_idx; in bch2_check_for_deadlock()
335 if (path_idx != top->path_idx) { in bch2_check_for_deadlock()
336 top->path_idx = path_idx; in bch2_check_for_deadlock()
|
| A D | btree_update_interior.h | 145 btree_path_idx_t path_idx, in bch2_foreground_maybe_merge_sibling() argument
149 struct btree_path *path = trans->paths + path_idx; in bch2_foreground_maybe_merge_sibling()
161 return __bch2_foreground_maybe_merge(trans, path_idx, level, flags, sib); in bch2_foreground_maybe_merge_sibling()
|
| A D | btree_key_cache.c | 359 btree_path_idx_t path_idx) in btree_path_traverse_cached_fast() argument
363 struct btree_path *path = trans->paths + path_idx; in btree_path_traverse_cached_fast()
390 btree_path_idx_t path_idx, in bch2_btree_path_traverse_cached() argument
393 EBUG_ON(trans->paths[path_idx].level); in bch2_btree_path_traverse_cached()
397 ret = btree_path_traverse_cached_fast(trans, path_idx); in bch2_btree_path_traverse_cached()
399 ret = btree_key_cache_fill(trans, path_idx, flags); in bch2_btree_path_traverse_cached()
402 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_traverse_cached()
|
| A D | trace.h | 657 __field(u8, path_idx)
676 __entry->path_idx = path - trans->paths;
700 __entry->path_idx,
727 __field(u8, path_idx)
745 __entry->path_idx = path - trans->paths;
764 __entry->path_idx,
1449 __field(btree_path_idx_t, path_idx )
1459 __entry->path_idx = path - trans->paths;
1469 __entry->path_idx,
|
| A D | btree_update_interior.c | 771 btree_path_idx_t path_idx = bch2_path_get_unlocked_mut(trans, in btree_update_nodes_written() local
773 struct btree_path *path = trans->paths + path_idx; in btree_update_nodes_written()
820 bch2_path_put(trans, path_idx, true); in btree_update_nodes_written()
1611 btree_path_idx_t path_idx, in btree_split_insert_keys() argument
1615 struct btree_path *path = trans->paths + path_idx; in btree_split_insert_keys()
1828 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node() argument
1832 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node()
1850 bch2_btree_path_to_text(&buf, trans, path_idx); in bch2_btree_insert_node()
1908 return btree_split(as, trans, path_idx, b, keys); in bch2_btree_insert_node()
1944 btree_path_idx_t path_idx) in __btree_increase_depth() argument
[all …]
|
| A D | btree_iter.h | 161 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
167 btree_path_idx_t path_idx; member
172 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
173 _path = (_trans)->paths + _iter.path_idx, \
|
Completed in 33 milliseconds