Lines Matching refs:keys
165 if (b->level && b->keys.nsets) in bch_btree_init_next()
166 bch_btree_sort(&b->keys, &b->c->sort); in bch_btree_init_next()
168 bch_btree_sort_lazy(&b->keys, &b->c->sort); in bch_btree_init_next()
171 bch_bset_init_next(&b->keys, write_block(b), in bch_btree_init_next()
209 iter->b = &b->keys; in bch_btree_node_read_done()
216 b->written < btree_blocks(b) && i->seq == b->keys.set[0].data->seq; in bch_btree_node_read_done()
244 if (i != b->keys.set[0].data && !i->keys) in bch_btree_node_read_done()
254 bset_sector_offset(&b->keys, i) < KEY_SIZE(&b->key); in bch_btree_node_read_done()
256 if (i->seq == b->keys.set[0].data->seq) in bch_btree_node_read_done()
259 bch_btree_sort_and_fix_extents(&b->keys, iter, &b->c->sort); in bch_btree_node_read_done()
261 i = b->keys.set[0].data; in bch_btree_node_read_done()
263 if (b->keys.set[0].size && in bch_btree_node_read_done()
264 bkey_cmp(&b->key, &b->keys.set[0].end) < 0) in bch_btree_node_read_done()
268 bch_bset_init_next(&b->keys, write_block(b), in bch_btree_node_read_done()
277 bset_block_offset(b, i), i->keys); in bch_btree_node_read_done()
303 bch_bio_map(bio, b->keys.set[0].data); in bch_btree_node_read()
421 bset_sector_offset(&b->keys, i)); in do_btree_node_write()
456 BUG_ON(b->written && !i->keys); in __bch_btree_node_write()
458 bch_check_keys(&b->keys, "writing"); in __bch_btree_node_write()
479 unsigned nsets = b->keys.nsets; in bch_btree_node_write()
489 if (nsets && !b->keys.nsets) in bch_btree_node_write()
526 BUG_ON(!i->keys); in bch_btree_leaf_dirty()
566 bch_btree_keys_free(&b->keys); in mca_data_free()
588 if (!bch_btree_keys_alloc(&b->keys, in mca_data_alloc()
630 BUG_ON(btree_node_dirty(b) && !b->keys.set[0].data); in mca_reap()
632 if (b->keys.page_order < min_order) in mca_reap()
801 c->verify_data->keys.set->data) in bch_btree_cache_alloc()
913 if (!b->keys.set[0].data) in mca_alloc()
924 if (!b->keys.set->data) in mca_alloc()
941 bch_btree_keys_init(&b->keys, &bch_extent_keys_ops, in mca_alloc()
944 bch_btree_keys_init(&b->keys, &bch_btree_keys_ops, in mca_alloc()
1008 for (; i <= b->keys.nsets && b->keys.set[i].size; i++) { in bch_btree_node_get()
1009 prefetch(b->keys.set[i].tree); in bch_btree_node_get()
1010 prefetch(b->keys.set[i].data); in bch_btree_node_get()
1013 for (; i <= b->keys.nsets; i++) in bch_btree_node_get()
1014 prefetch(b->keys.set[i].data); in bch_btree_node_get()
1092 bch_bset_init_next(&b->keys, b->keys.set->data, bset_magic(&b->c->sb)); in __bch_btree_node_alloc()
1120 bch_btree_sort_into(&b->keys, &n->keys, &b->c->sort); in btree_node_alloc_replacement()
1248 unsigned keys = 0, good_keys = 0; in btree_gc_mark_node() local
1255 for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) { in btree_gc_mark_node()
1257 keys++; in btree_gc_mark_node()
1259 if (bch_ptr_bad(&b->keys, k)) in btree_gc_mark_node()
1269 for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++) in btree_gc_mark_node()
1271 bset_written(&b->keys, t) && in btree_gc_mark_node()
1281 if ((keys - good_keys) * 2 > keys) in btree_gc_mark_node()
1291 unsigned keys; member
1300 unsigned i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1315 keys += r[nodes++].keys; in btree_gc_coalesce()
1320 __set_blocks(b->keys.set[0].data, keys, in btree_gc_coalesce()
1347 keys = 0; in btree_gc_coalesce()
1353 if (__set_blocks(n1, n1->keys + keys + in btree_gc_coalesce()
1359 keys += bkey_u64s(k); in btree_gc_coalesce()
1370 if (__set_blocks(n1, n1->keys + n2->keys, in btree_gc_coalesce()
1375 keys = n2->keys; in btree_gc_coalesce()
1380 BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c)) > in btree_gc_coalesce()
1388 (void *) bset_bkey_idx(n2, keys) - (void *) n2->start); in btree_gc_coalesce()
1390 n1->keys += keys; in btree_gc_coalesce()
1391 r[i].keys = n1->keys; in btree_gc_coalesce()
1394 bset_bkey_idx(n2, keys), in btree_gc_coalesce()
1396 (void *) bset_bkey_idx(n2, keys)); in btree_gc_coalesce()
1398 n2->keys -= keys; in btree_gc_coalesce()
1414 BUG_ON(btree_bset_first(new_nodes[0])->keys); in btree_gc_coalesce()
1467 struct keylist keys; in btree_gc_rewrite_node() local
1484 bch_keylist_init(&keys); in btree_gc_rewrite_node()
1485 bch_keylist_add(&keys, &n->key); in btree_gc_rewrite_node()
1487 make_btree_freeing_key(replace, keys.top); in btree_gc_rewrite_node()
1488 bch_keylist_push(&keys); in btree_gc_rewrite_node()
1490 bch_btree_insert_node(b, op, &keys, NULL, NULL); in btree_gc_rewrite_node()
1491 BUG_ON(!bch_keylist_empty(&keys)); in btree_gc_rewrite_node()
1506 for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad) in btree_gc_count_keys()
1522 bch_btree_iter_init(&b->keys, &iter, &b->c->gc_done); in btree_gc_recurse()
1528 k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad); in btree_gc_recurse()
1537 r->keys = btree_gc_count_keys(r->b); in btree_gc_recurse()
1687 &dc->writeback_keys.keys, node) in bch_btree_gc_finish()
1700 for (i = ca->sb.d; i < ca->sb.d + ca->sb.keys; i++) in bch_btree_gc_finish()
1815 for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) in bch_btree_check_recurse()
1821 bch_btree_iter_init(&b->keys, &iter, NULL); in bch_btree_check_recurse()
1824 k = bch_btree_iter_next_filter(&iter, &b->keys, in bch_btree_check_recurse()
1893 status = bch_btree_insert_key(&b->keys, k, replace_key); in btree_insert_key()
1895 bch_check_keys(&b->keys, "%u for %s", status, in btree_insert_key()
1907 long ret = bch_btree_keys_u64s_remaining(&b->keys); in insert_u64s_remaining()
1912 if (b->keys.ops->is_extents) in insert_u64s_remaining()
1923 int oldsize = bch_count_data(&b->keys); in bch_btree_insert_keys()
1926 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
1939 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
1942 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
1956 BUG_ON(bch_count_data(&b->keys) < oldsize); in bch_btree_insert_keys()
1988 unsigned keys = 0; in btree_split() local
1990 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); in btree_split()
2012 while (keys < (btree_bset_first(n1)->keys * 3) / 5) in btree_split()
2013 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), in btree_split()
2014 keys)); in btree_split()
2017 bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2018 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2020 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; in btree_split()
2021 btree_bset_first(n1)->keys = keys; in btree_split()
2025 btree_bset_first(n2)->keys * sizeof(uint64_t)); in btree_split()
2034 trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys); in btree_split()
2108 b->keys.last_set_unwritten) in bch_btree_insert_node()
2190 struct keylist *keys; member
2200 int ret = bch_btree_insert_node(b, &op->op, op->keys, in btree_insert_fn()
2202 if (ret && !bch_keylist_empty(op->keys)) in btree_insert_fn()
2208 int bch_btree_insert(struct cache_set *c, struct keylist *keys, in bch_btree_insert() argument
2215 BUG_ON(bch_keylist_empty(keys)); in bch_btree_insert()
2218 op.keys = keys; in bch_btree_insert()
2222 while (!ret && !bch_keylist_empty(keys)) { in bch_btree_insert()
2225 &START_KEY(keys->keys), in bch_btree_insert()
2234 while ((k = bch_keylist_pop(keys))) in bch_btree_insert()
2278 bch_btree_iter_init(&b->keys, &iter, from); in bch_btree_map_nodes_recurse()
2280 while ((k = bch_btree_iter_next_filter(&iter, &b->keys, in bch_btree_map_nodes_recurse()
2311 bch_btree_iter_init(&b->keys, &iter, from); in bch_btree_map_keys_recurse()
2313 while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad))) { in bch_btree_map_keys_recurse()
2391 if (RB_INSERT(&buf->keys, w, node, keybuf_cmp)) in refill_keybuf_fn()
2430 if (!RB_EMPTY_ROOT(&buf->keys)) { in bch_refill_keybuf()
2432 w = RB_FIRST(&buf->keys, struct keybuf_key, node); in bch_refill_keybuf()
2435 w = RB_LAST(&buf->keys, struct keybuf_key, node); in bch_refill_keybuf()
2447 rb_erase(&w->node, &buf->keys); in __bch_keybuf_del()
2470 w = RB_GREATER(&buf->keys, s, node, keybuf_nonoverlapping_cmp); in bch_keybuf_check_overlapping()
2491 w = RB_FIRST(&buf->keys, struct keybuf_key, node); in bch_keybuf_next()
2529 buf->keys = RB_ROOT; in bch_keybuf_init()