581 	unsigned inorder, j = 1;  in bch_bset_fix_invalidated_key()  local
592 	inorder = bkey_to_cacheline(t, k);  in bch_bset_fix_invalidated_key()
602 	j = inorder_to_tree(inorder, t);  in bch_bset_fix_invalidated_key()
612 	j = inorder_to_tree(inorder + 1, t);  in bch_bset_fix_invalidated_key()
722 	unsigned inorder, j, n = 1;  in bset_search_tree()  local
751 	inorder = to_inorder(j, t);  in bset_search_tree()
758 		l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
760 		if (++inorder != t->size) {  in bset_search_tree()
762 			r = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
766 		r = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
768 		if (--inorder) {  in bset_search_tree()
770 			l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()