Searched refs:nsets (Results 1 – 13 of 13) sorted by relevance
80 u32 nsets; member357 if (of_property_read_u32(np, "cache-sets", &data->nsets) || in __uniphier_cache_init()358 !is_power_of_2(data->nsets)) { in __uniphier_cache_init()366 cache_size == 0 || cache_size % (data->nsets * data->line_size)) { in __uniphier_cache_init()373 data->way_mask = GENMASK(cache_size / data->nsets / data->line_size - 1, in __uniphier_cache_init()
221 uint8_t nsets; member237 return b->set + b->nsets; in bset_tree_last()242 return t <= b->set + b->nsets - b->last_set_unwritten; in bset_written()247 return !b->last_set_unwritten || k < b->set[b->nsets].data->start; in bkey_written()
48 for (i = 0; i <= b->nsets; i++) in bch_dump_bucket()356 b->nsets = 0; in bch_btree_keys_init()673 b->set[++b->nsets].data = i; in bch_bset_init_next()1060 BUG_ON(!b->nsets && in __bch_bset_search()1280 b->nsets = start; in __btree_sort()1328 for (i = start; i <= b->nsets; i++) in bch_btree_sort_partial()1371 if (!b->nsets) in bch_btree_sort_lazy()1374 for (i = b->nsets - 1; i >= 0; --i) { in bch_btree_sort_lazy()1384 if (b->nsets + 1 == MAX_BSETS) { in bch_btree_sort_lazy()1397 for (i = 0; i <= b->nsets; i++) { in bch_btree_keys_stats()
115 if (b->level && b->keys.nsets) in bch_btree_init_next()436 unsigned int nsets = b->keys.nsets; in bch_btree_node_write() local446 if (nsets && !b->keys.nsets) in bch_btree_node_write()1053 for (; i <= b->keys.nsets && b->keys.set[i].size; i++) { in bch_btree_node_get()1058 for (; i <= b->keys.nsets; i++) in bch_btree_node_get()1333 for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++) in btree_gc_mark_node()
119 __btree_node_iter_used(iter), b->nsets); in bch2_dump_btree_node_iter()385 b->nsets = 0; in bch2_btree_keys_init()788 BUG_ON(b->nsets); in bch2_bset_init_first()794 t = &b->set[b->nsets++]; in bch2_bset_init_first()805 BUG_ON(b->nsets >= MAX_BSETS); in bch2_bset_init_next()811 t = &b->set[b->nsets++]; in bch2_bset_init_next()1325 for (i = 0; i < b->nsets; i++) { in bch2_btree_node_iter_init()1330 for (i = 0; i < b->nsets; i++) { in bch2_btree_node_iter_init()
307 end_idx == b->nsets; in btree_node_sort()368 b->nsets -= shift; in btree_node_sort()375 for (i = b->nsets; i < MAX_BSETS; i++) in btree_node_sort()394 BUG_ON(dst->nsets != 1); in bch2_btree_sort_into()428 unwritten_idx < b->nsets; in btree_node_compact()433 if (b->nsets - unwritten_idx > 1) { in btree_node_compact()491 if (b->nsets == MAX_BSETS && in bch2_btree_init_next()499 if (b->nsets == MAX_BSETS && in bch2_btree_init_next()503 BUG_ON(b->nsets >= MAX_BSETS); in bch2_btree_init_next()1241 b->nsets = 1; in bch2_btree_node_read_done()[all …]
209 for (struct bset_tree *_t = (_b)->set; _t < (_b)->set + (_b)->nsets; _t++)212 for (const struct bset_tree *_t = (_b)->set; _t < (_b)->set + (_b)->nsets; _t++)
80 u8 nsets; member643 EBUG_ON(!b->nsets); in bset_tree_last()644 return b->set + b->nsets - 1; in bset_tree_last()
156 BUG_ON(b->nsets != 1); in __bch2_btree_verify()
850 b->nsets = 0; in bch2_btree_node_mem_alloc()
1469 BUG_ON(n[i]->nsets != 1); in __btree_split_node()
275 __entry->keys = b->keys.set[b->keys.nsets].data->keys;
611 u32 nsets; member