#define BCH_TIME_STATS() \
x(btree_node_mem_alloc) \
+ x(btree_node_split) \
+ x(btree_node_sort) \
+ x(btree_node_read) \
x(btree_gc) \
- x(btree_split) \
- x(btree_sort) \
- x(btree_read) \
+ x(btree_update) \
x(btree_lock_contended_read) \
x(btree_lock_contended_intent) \
x(btree_lock_contended_write) \
BUG_ON(vstruct_end(&out->keys) > (void *) out + (PAGE_SIZE << order));
if (sorting_entire_node)
- bch2_time_stats_update(&c->times[BCH_TIME_btree_sort],
+ bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
start_time);
/* Make sure we preserve bset journal_seq: */
&dst->format,
true);
- bch2_time_stats_update(&c->times[BCH_TIME_btree_sort], start_time);
+ bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
+ start_time);
set_btree_bset_end(dst, dst->set);
}
}
- bch2_time_stats_update(&c->times[BCH_TIME_btree_read], rb->start_time);
+ bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
+ rb->start_time);
bio_put(&rb->bio);
clear_btree_node_read_in_flight(b);
wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
struct btree_trans {
struct bch_fs *c;
size_t nr_restarts;
+ u64 commit_start;
u64 iters_live;
u64 iters_linked;
bch2_btree_iter_verify_locks(iter);
- bch2_time_stats_update(&c->times[BCH_TIME_btree_split], start_time);
+ bch2_time_stats_update(&c->times[BCH_TIME_btree_node_split],
+ start_time);
}
static void
{
struct bch_fs *c = trans->c;
struct btree_insert_entry *i;
- int ret;
+ int ret = 0;
if (!trans->nr_updates)
- return 0;
+ goto out;
/* for the sake of sanity: */
BUG_ON(trans->nr_updates > 1 && !(flags & BTREE_INSERT_ATOMIC));
!percpu_ref_tryget(&c->writes)))
return -EROFS;
+ if (!trans->commit_start)
+ trans->commit_start = local_clock();
+
ret = bch2_trans_journal_preres_get(trans);
if (ret)
goto err;
if (unlikely(!(trans->flags & BTREE_INSERT_NOCHECK_RW)))
percpu_ref_put(&c->writes);
+out:
+ if (!ret && trans->commit_start) {
+ bch2_time_stats_update(&c->times[BCH_TIME_btree_update],
+ trans->commit_start);
+ trans->commit_start = 0;
+ }
trans->nr_updates = 0;