Home
last modified time | relevance | path

Searched refs:nsets (Results 1 – 13 of 13) sorted by relevance

/linux/arch/arm/mm/
A Dcache-uniphier.c80 u32 nsets; member
357 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()
/linux/drivers/md/bcache/
A Dbset.h221 uint8_t nsets; member
237 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()
A Dbset.c48 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()
1288 b->nsets = start; in __btree_sort()
1336 for (i = start; i <= b->nsets; i++) in bch_btree_sort_partial()
1379 if (!b->nsets) in bch_btree_sort_lazy()
1382 for (i = b->nsets - 1; i >= 0; --i) { in bch_btree_sort_lazy()
1392 if (b->nsets + 1 == MAX_BSETS) { in bch_btree_sort_lazy()
1405 for (i = 0; i <= b->nsets; i++) { in bch_btree_keys_stats()
A Dbtree.c115 if (b->level && b->keys.nsets) in bch_btree_init_next()
436 unsigned int nsets = b->keys.nsets; in bch_btree_node_write() local
446 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()
/linux/fs/bcachefs/
A Dbtree_io.c306 end_idx == b->nsets; in btree_node_sort()
367 b->nsets -= shift; in btree_node_sort()
374 for (i = b->nsets; i < MAX_BSETS; i++) in btree_node_sort()
393 BUG_ON(dst->nsets != 1); in bch2_btree_sort_into()
427 unwritten_idx < b->nsets; in btree_node_compact()
432 if (b->nsets - unwritten_idx > 1) { in btree_node_compact()
490 if (b->nsets == MAX_BSETS && in bch2_btree_init_next()
498 if (b->nsets == MAX_BSETS && in bch2_btree_init_next()
502 BUG_ON(b->nsets >= MAX_BSETS); in bch2_btree_init_next()
1204 b->nsets = 1; in bch2_btree_node_read_done()
[all …]
A Dbset.c119 __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()
A Dbtree_types.h80 u8 nsets; member
637 EBUG_ON(!b->nsets); in bset_tree_last()
638 return b->set + b->nsets - 1; in bset_tree_last()
A Dbset.h209 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++)
A Ddebug.c154 BUG_ON(b->nsets != 1); in __bch2_btree_verify()
A Dbtree_cache.c846 b->nsets = 0; in bch2_btree_node_mem_alloc()
A Dbtree_update_interior.c1465 BUG_ON(n[i]->nsets != 1); in __btree_split_node()
/linux/include/trace/events/
A Dbcache.h275 __entry->keys = b->keys.set[b->keys.nsets].data->keys;
/linux/drivers/net/ethernet/microchip/sparx5/
A Dsparx5_main.h443 u32 nsets; member

Completed in 43 milliseconds