Home
last modified time | relevance | path

Searched refs:updates (Results 1 – 7 of 7) sorted by relevance

/fs/bcachefs/
A Dbtree_trans_commit.c77 return i != trans->updates && in same_leaf_as_prev()
84 return i + 1 < trans->updates + trans->nr_updates && in same_leaf_as_next()
108 while (--i >= trans->updates) { in trans_lock_write_fail()
531 unsigned i, sort_id = trans->updates[sort_id_start].sort_order; in bch2_trans_commit_run_triggers()
547 i < trans->nr_updates && trans->updates[i].sort_order <= sort_id; in bch2_trans_commit_run_triggers()
549 if (trans->updates[i].sort_order < sort_id) { in bch2_trans_commit_run_triggers()
554 int ret = run_one_trans_trigger(trans, trans->updates + i); in bch2_trans_commit_run_triggers()
831 struct btree_insert_entry *i = trans->updates + idx; in do_bch2_trans_commit()
A Dbtree_update.c393 BUG_ON(i != trans->updates && in bch2_trans_update_by_path()
401 for (i = trans->updates; i < trans->updates + trans->nr_updates; i++) { in bch2_trans_update_by_path()
407 bool overwrite = !cmp && i < trans->updates + trans->nr_updates; in bch2_trans_update_by_path()
419 array_insert_item(trans->updates, trans->nr_updates, in bch2_trans_update_by_path()
420 i - trans->updates, n); in bch2_trans_update_by_path()
A Dbtree_update.h256 for (struct btree_insert_entry *_i = (_trans)->updates; \
257 (_i) < (_trans)->updates + (_trans)->nr_updates; \
A Dbtree_iter.c1687 struct btree_insert_entry *updates = p; in btree_paths_realloc() local
1688 memcpy(updates, trans->updates, trans->nr_paths * sizeof(struct btree_insert_entry)); in btree_paths_realloc()
1695 rcu_assign_pointer(trans->updates, updates); in btree_paths_realloc()
3480 trans->updates = trans->_updates; in __bch2_trans_get()
A Dbtree_types.h495 struct btree_insert_entry *updates; member
A Dtrace.h1463 __entry->update_idx = i - trans->updates;
/fs/ubifs/
A DKconfig60 updates). This may affect file-system performance and increase flash device wear,

Completed in 25 milliseconds