| /linux-6.15/fs/bcachefs/ |
| H A D | btree_update.c | 355 btree_path_idx_t path_idx = in flush_new_cached_update() local
358 ret = bch2_btree_path_traverse(trans, path_idx, 0); in flush_new_cached_update()
362 struct btree_path *btree_path = trans->paths + path_idx; in flush_new_cached_update()
378 ret = bch2_trans_update_by_path(trans, path_idx, i->k, flags, ip); in flush_new_cached_update()
380 bch2_path_put(trans, path_idx, true); in flush_new_cached_update()
393 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_by_path()
405 .path = path_idx, in bch2_trans_update_by_path()
517 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update() local
537 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update()
546 path_idx = iter->key_cache_path; in bch2_trans_update()
[all …]
|
| H A D | btree_locking.c | 63 u8 path_idx; member
294 btree_path_idx_t path_idx; in bch2_check_for_deadlock() local
326 path_idx, top->path_idx) { in bch2_check_for_deadlock()
327 struct btree_path *path = paths + path_idx; in bch2_check_for_deadlock()
331 if (path_idx != top->path_idx) { in bch2_check_for_deadlock()
332 top->path_idx = path_idx; in bch2_check_for_deadlock()
|
| H A D | btree_iter.c | 1139 btree_path_idx_t path_idx, in bch2_btree_path_traverse_one() argument
1169 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1281 path_idx = bch2_btree_path_make_mut(trans, path_idx, intent, ip); in __bch2_btree_path_set_pos()
1324 return path_idx; in __bch2_btree_path_set_pos()
1417 __bch2_path_free(trans, path_idx); in bch2_path_put()
1746 path_pos = iter.path_idx; in bch2_path_get()
1757 path = trans->paths + path_idx; in bch2_path_get()
1760 path = trans->paths + path_idx; in bch2_path_get()
1799 return path_idx; in bch2_path_get()
1810 path_idx = bch2_btree_path_make_mut(trans, path_idx, true, _RET_IP_); in bch2_path_get_unlocked_mut()
[all …]
|
| H A D | btree_update_interior.h | 138 btree_path_idx_t path_idx, in bch2_foreground_maybe_merge_sibling() argument
142 struct btree_path *path = trans->paths + path_idx; in bch2_foreground_maybe_merge_sibling()
154 return __bch2_foreground_maybe_merge(trans, path_idx, level, flags, sib); in bch2_foreground_maybe_merge_sibling()
|
| H A D | btree_key_cache.c | 350 btree_path_idx_t path_idx) in btree_path_traverse_cached_fast() argument
354 struct btree_path *path = trans->paths + path_idx; in btree_path_traverse_cached_fast()
381 btree_path_idx_t path_idx, in bch2_btree_path_traverse_cached() argument
384 EBUG_ON(trans->paths[path_idx].level); in bch2_btree_path_traverse_cached()
388 ret = btree_path_traverse_cached_fast(trans, path_idx); in bch2_btree_path_traverse_cached()
390 ret = btree_key_cache_fill(trans, path_idx, flags); in bch2_btree_path_traverse_cached()
393 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_traverse_cached()
|
| H A D | trace.h | 608 __field(u8, path_idx)
627 __entry->path_idx = path - trans->paths;
651 __entry->path_idx,
678 __field(u8, path_idx)
696 __entry->path_idx = path - trans->paths;
715 __entry->path_idx,
1499 __field(btree_path_idx_t, path_idx )
1509 __entry->path_idx = path - trans->paths;
1519 __entry->path_idx,
|
| H A D | btree_update_interior.c | 747 btree_path_idx_t path_idx = bch2_path_get_unlocked_mut(trans, in btree_update_nodes_written() local
749 struct btree_path *path = trans->paths + path_idx; in btree_update_nodes_written()
796 bch2_path_put(trans, path_idx, true); in btree_update_nodes_written()
1569 btree_path_idx_t path_idx, in btree_split_insert_keys() argument
1573 struct btree_path *path = trans->paths + path_idx; in btree_split_insert_keys()
1786 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node() argument
1790 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node()
1808 bch2_btree_path_to_text(&buf, trans, path_idx); in bch2_btree_insert_node()
1866 return btree_split(as, trans, path_idx, b, keys); in bch2_btree_insert_node()
1902 btree_path_idx_t path_idx) in __btree_increase_depth() argument
[all …]
|
| H A D | btree_iter.h | 159 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
165 btree_path_idx_t path_idx; member
170 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
171 _path = (_trans)->paths + _iter.path_idx, \
|
| /linux-6.15/sound/pci/hda/ |
| H A D | hda_generic.c | 1371 int *path_idx, in try_assign_dacs() argument
1387 path = snd_hda_get_path_from_idx(codec, path_idx[i]); in try_assign_dacs()
1410 invalidate_nid_path(codec, path_idx[j]); in try_assign_dacs()
1411 path_idx[j] = 0; in try_assign_dacs()
1452 path_idx[i] = snd_hda_get_path_idx(codec, path); in try_assign_dacs()
1636 path_idx[i] = snd_hda_get_path_idx(codec, path); in map_singles()
1655 path = snd_hda_get_path_from_idx(codec, path_idx); in check_aamix_out_path()
1725 hda_nid_t *dacs, int *path_idx) in refill_shared_dacs() argument
1733 path = snd_hda_get_path_from_idx(codec, path_idx[i]); in refill_shared_dacs()
2163 path = snd_hda_get_path_from_idx(codec, path_idx); in create_extra_out()
[all …]
|
| /linux-6.15/net/wireless/ |
| H A D | nl80211.c | 7945 int path_idx = cb->args[2]; in nl80211_dump_mpath() local
7965 err = rdev_dump_mpath(rdev, wdev->netdev, path_idx, dst, in nl80211_dump_mpath()
7978 path_idx++; in nl80211_dump_mpath()
7982 cb->args[2] = path_idx; in nl80211_dump_mpath()
8145 int path_idx = cb->args[2]; in nl80211_dump_mpp() local
8165 err = rdev_dump_mpp(rdev, wdev->netdev, path_idx, dst, in nl80211_dump_mpp()
8178 path_idx++; in nl80211_dump_mpp()
8182 cb->args[2] = path_idx; in nl80211_dump_mpp()
|