Lines Matching full:paths
266 bch2_btree_path_verify(trans, &trans->paths[iter->update_path]); in bch2_btree_iter_verify()
662 i->old_v = bch2_btree_path_peek_slot(trans->paths + i->path, &i->old_k).v; in bch2_trans_revalidate_updates_in_node()
1010 if (trans->paths[idx].uptodate) { in bch2_btree_path_traverse_all()
1011 __btree_path_get(&trans->paths[idx], false); in bch2_btree_path_traverse_all()
1013 __btree_path_put(&trans->paths[idx], false); in bch2_btree_path_traverse_all()
1026 * We used to assert that all paths had been traversed here in bch2_btree_path_traverse_all()
1122 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1146 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1214 btree_path_copy(trans, trans->paths + new, trans->paths + src); in btree_path_clone()
1215 __btree_path_get(trans->paths + new, intent); in btree_path_clone()
1223 __btree_path_put(trans->paths + path, intent); in __bch2_btree_path_make_mut()
1225 trans->paths[path].preserve = false; in __bch2_btree_path_make_mut()
1234 int cmp = bpos_cmp(new_pos, trans->paths[path_idx].pos); in __bch2_btree_path_set_pos()
1237 EBUG_ON(!trans->paths[path_idx].ref); in __bch2_btree_path_set_pos()
1241 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos()
1319 __bch2_btree_path_unlock(trans, trans->paths + path); in __bch2_path_free()
1320 btree_path_list_remove(trans, trans->paths + path); in __bch2_path_free()
1326 struct btree_path *path = trans->paths + path_idx, *dup; in bch2_path_put()
1354 if (!__btree_path_put(trans->paths + path, intent)) in bch2_path_put_nokeep()
1420 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text()
1534 struct btree_path *paths = p; in btree_paths_realloc() local
1535 *trans_paths_nr(paths) = nr; in btree_paths_realloc()
1536 memcpy(paths, trans->paths, trans->nr_paths * sizeof(struct btree_path)); in btree_paths_realloc()
1549 rcu_assign_pointer(trans->paths, paths); in btree_paths_realloc()
1582 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc()
1620 trans->paths[path_pos].cached == cached && in bch2_path_get()
1621 trans->paths[path_pos].btree_id == btree_id && in bch2_path_get()
1622 trans->paths[path_pos].level == level) { in bch2_path_get()
1623 __btree_path_get(trans->paths + path_pos, intent); in bch2_path_get()
1625 path = trans->paths + path_idx; in bch2_path_get()
1628 path = trans->paths + path_idx; in bch2_path_get()
1732 btree_path_set_should_be_locked(trans->paths + iter->path); in bch2_btree_iter_traverse()
1744 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node()
1792 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
2018 btree_path_set_should_be_locked(trans->paths + iter->key_cache_path); in btree_trans_peek_key_cache()
2020 k = bch2_btree_path_peek_slot(trans->paths + iter->key_cache_path, &u); in btree_trans_peek_key_cache()
2165 !bkey_eq(trans->paths[iter->update_path].pos, k.k->p)) { in bch2_btree_iter_peek_upto()
2188 __btree_path_get(trans->paths + iter->path, iter->flags & BTREE_ITER_INTENT); in bch2_btree_iter_peek_upto()
2247 ret = bch2_btree_path_relock(trans, trans->paths + iter->update_path, _THIS_IP_); in bch2_btree_iter_peek_upto()
2251 btree_path_set_should_be_locked(trans->paths + iter->update_path); in bch2_btree_iter_peek_upto()
2487 k = bch2_btree_path_peek_slot(trans->paths + iter->path, &iter->k); in bch2_btree_iter_peek_slot()
2601 BUG_ON(trans->paths[idx].sorted_idx != i); in btree_trans_verify_sorted_refs()
2616 panic("trans paths out of order!\n"); in btree_trans_verify_sorted()
2646 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
2647 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
2649 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()
2650 trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1; in __bch2_btree_trans_sort_paths()
2681 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_remove()
2688 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add()
2690 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()
2704 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_add()
2766 __btree_path_get(trans->paths + src->path, src->flags & BTREE_ITER_INTENT); in bch2_trans_copy_iter()
2768 __btree_path_get(trans->paths + src->update_path, src->flags & BTREE_ITER_INTENT); in bch2_trans_copy_iter()
2999 trans->paths = trans->_paths; in __bch2_trans_get()
3002 *trans_paths_nr(trans->paths) = BTREE_ITER_INITIAL; in __bch2_trans_get()
3041 bch_err(c, "btree paths leaked from %s!", trans->fn); in check_btree_paths_leaked()
3060 __btree_path_put(trans->paths + i->path, true); in bch2_trans_put()
3085 trans->paths = NULL; in bch2_trans_put()
3150 /* trans->paths is rcu protected vs. freeing */ in bch2_btree_trans_to_text()
3154 struct btree_path *paths = rcu_dereference(trans->paths); in bch2_btree_trans_to_text() local
3155 if (!paths) in bch2_btree_trans_to_text()
3158 unsigned long *paths_allocated = trans_paths_allocated(paths); in bch2_btree_trans_to_text()
3160 trans_for_each_path_idx_from(paths_allocated, *trans_paths_nr(paths), idx, 1) { in bch2_btree_trans_to_text()
3161 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text()