Searched refs:inorder_next (Results 1 - 2 of 2) sorted by relevance
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| H A D | bset.c | 371 static unsigned int inorder_next(unsigned int j, unsigned int size) in inorder_next() function
495 BUG_ON(inorder_prev(inorder_next(j, size), size) != j);
497 j = inorder_next(j, size);
712 for (j = inorder_next(0, t->size); in bch_bset_build_written_tree()
714 j = inorder_next(j, t->size)) { in bch_bset_build_written_tree()
728 for (j = inorder_next(0, t->size); in bch_bset_build_written_tree()
730 j = inorder_next(j, t->size)) in bch_bset_build_written_tree()
994 f = &t->tree[inorder_next(j, t->size)]; in bset_search_tree()
|
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| H A D | bset.c | 371 static unsigned int inorder_next(unsigned int j, unsigned int size) in inorder_next() function
495 BUG_ON(inorder_prev(inorder_next(j, size), size) != j);
497 j = inorder_next(j, size);
712 for (j = inorder_next(0, t->size); in bch_bset_build_written_tree()
714 j = inorder_next(j, t->size)) { in bch_bset_build_written_tree()
730 for (j = inorder_next(0, t->size); in bch_bset_build_written_tree()
732 j = inorder_next(j, t->size)) in bch_bset_build_written_tree()
998 f = &t->tree[inorder_next(j, t->size)]; in bset_search_tree()
|
Completed in 4 milliseconds