Lines Matching full:paths
259 bch2_btree_path_verify(trans, &trans->paths[iter->update_path]); in bch2_btree_iter_verify()
638 i->old_v = bch2_btree_path_peek_slot(trans->paths + i->path, &i->old_k).v; in bch2_trans_revalidate_updates_in_node()
1031 if (trans->paths[idx].uptodate) { in bch2_btree_path_traverse_all()
1032 __btree_path_get(trans, &trans->paths[idx], false); in bch2_btree_path_traverse_all()
1034 __btree_path_put(trans, &trans->paths[idx], false); in bch2_btree_path_traverse_all()
1047 * We used to assert that all paths had been traversed here in bch2_btree_path_traverse_all()
1143 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1169 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1249 btree_path_copy(trans, trans->paths + new, trans->paths + src); in btree_path_clone()
1250 __btree_path_get(trans, trans->paths + new, intent); in btree_path_clone()
1252 trans->paths[new].ip_allocated = ip; in btree_path_clone()
1261 struct btree_path *old = trans->paths + path; in __bch2_btree_path_make_mut()
1262 __btree_path_put(trans, trans->paths + path, intent); in __bch2_btree_path_make_mut()
1264 trace_btree_path_clone(trans, old, trans->paths + path); in __bch2_btree_path_make_mut()
1265 trans->paths[path].preserve = false; in __bch2_btree_path_make_mut()
1274 int cmp = bpos_cmp(new_pos, trans->paths[path_idx].pos); in __bch2_btree_path_set_pos()
1277 EBUG_ON(!trans->paths[path_idx].ref); in __bch2_btree_path_set_pos()
1279 trace_btree_path_set_pos(trans, trans->paths + path_idx, &new_pos); in __bch2_btree_path_set_pos()
1283 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos()
1361 __bch2_btree_path_unlock(trans, trans->paths + path); in __bch2_path_free()
1362 btree_path_list_remove(trans, trans->paths + path); in __bch2_path_free()
1388 struct btree_path *path = trans->paths + path_idx, *dup; in bch2_path_put()
1423 if (!__btree_path_put(trans, trans->paths + path, intent)) in bch2_path_put_nokeep()
1500 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short()
1544 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text()
1664 struct btree_path *paths = p; in btree_paths_realloc() local
1665 *trans_paths_nr(paths) = nr; in btree_paths_realloc()
1666 memcpy(paths, trans->paths, trans->nr_paths * sizeof(struct btree_path)); in btree_paths_realloc()
1679 rcu_assign_pointer(trans->paths, paths); in btree_paths_realloc()
1712 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc()
1750 trans->paths[path_pos].cached == cached && in bch2_path_get()
1751 trans->paths[path_pos].btree_id == btree_id && in bch2_path_get()
1752 trans->paths[path_pos].level == level) { in bch2_path_get()
1753 trace_btree_path_get(trans, trans->paths + path_pos, &pos); in bch2_path_get()
1755 __btree_path_get(trans, trans->paths + path_pos, intent); in bch2_path_get()
1757 path = trans->paths + path_idx; in bch2_path_get()
1760 path = trans->paths + path_idx; in bch2_path_get()
1812 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut()
1904 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node()
1953 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
2221 k = bch2_btree_path_peek_slot(trans->paths + iter->key_cache_path, &u); in btree_trans_peek_key_cache()
2231 btree_path_set_should_be_locked(trans, trans->paths + iter->key_cache_path); in btree_trans_peek_key_cache()
2376 !bkey_eq(trans->paths[iter->update_path].pos, k.k->p)) { in bch2_btree_iter_peek_max()
2398 __btree_path_get(trans, trans->paths + iter->path, iter->flags & BTREE_ITER_intent); in bch2_btree_iter_peek_max()
2457 ret = bch2_btree_path_relock(trans, trans->paths + iter->update_path, _THIS_IP_); in bch2_btree_iter_peek_max()
2461 btree_path_set_should_be_locked(trans, trans->paths + iter->update_path); in bch2_btree_iter_peek_max()
2630 struct btree_path *s = saved_path ? trans->paths + saved_path : NULL; in bch2_btree_iter_peek_prev_min()
2677 trans->paths + iter->path, in bch2_btree_iter_peek_prev_min()
2678 trans->paths + saved_path); in bch2_btree_iter_peek_prev_min()
2923 BUG_ON(trans->paths[idx].sorted_idx != i); in btree_trans_verify_sorted_refs()
2938 panic("trans paths out of order!\n"); in btree_trans_verify_sorted()
2968 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
2969 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
2971 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()
2972 trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1; in __bch2_btree_trans_sort_paths()
3003 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_remove()
3010 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add()
3012 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()
3026 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_add()
3092 __btree_path_get(trans, trans->paths + src->path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3094 __btree_path_get(trans, trans->paths + src->update_path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3364 trans->paths = trans->_paths; in __bch2_trans_get()
3367 *trans_paths_nr(trans->paths) = BTREE_ITER_INITIAL; in __bch2_trans_get()
3412 bch_err(c, "btree paths leaked from %s!", trans->fn); in check_btree_paths_leaked()
3434 __btree_path_put(trans, trans->paths + i->path, true); in bch2_trans_put()
3460 trans->paths = NULL; in bch2_trans_put()
3537 /* trans->paths is rcu protected vs. freeing */ in bch2_btree_trans_to_text()
3541 struct btree_path *paths = rcu_dereference(trans->paths); in bch2_btree_trans_to_text() local
3542 if (!paths) in bch2_btree_trans_to_text()
3545 unsigned long *paths_allocated = trans_paths_allocated(paths); in bch2_btree_trans_to_text()
3547 trans_for_each_path_idx_from(paths_allocated, *trans_paths_nr(paths), idx, 1) { in bch2_btree_trans_to_text()
3548 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text()