Searched refs:btree_split (Results 1 - 7 of 7) sorted by relevance

/linux-4.1.27/include/trace/events/
H A Dbcache.h342 DECLARE_EVENT_CLASS(btree_split,
359 DEFINE_EVENT(btree_split, bcache_btree_node_split,
364 DEFINE_EVENT(btree_split, bcache_btree_node_compact,
/linux-4.1.27/drivers/md/bcache/
H A Dbtree.h71 * This is handy because btree_split() and garbage collection can issue writes
107 /* If btree_split() frees a btree node, it writes a new pointer to that
111 * refcount that btree_split() took.
209 /* for waiting on btree reserve in btree_split() */
H A Dsysfs.c54 sysfs_time_stats_attribute(btree_split, sec, us);
533 sysfs_print_time_stats(&c->btree_split_time, btree_split, sec, us); SHOW()
707 sysfs_time_stats_attribute_list(btree_split, sec, us)
H A Dbset.h471 /* Enough room for btree_split's keys without realloc */
H A Dbtree.c1960 static int btree_split(struct btree *b, struct btree_op *op, btree_split() function
2140 int ret = btree_split(b, op, insert_keys, replace_key); bch_btree_insert_node()
H A Dbcache.h175 * - updates to non leaf nodes just happen synchronously (see btree_split()).
H A Dbset.c734 /* We're getting called from btree_split() or btree_gc, just bail out */ bch_bset_fix_lookup_table()

Completed in 248 milliseconds