739 	unsigned int inorder, j = 1;  in bch_bset_fix_invalidated_key()  local
750 	inorder = bkey_to_cacheline(t, k);  in bch_bset_fix_invalidated_key()
760 	j = inorder_to_tree(inorder, t);  in bch_bset_fix_invalidated_key()
770 	j = inorder_to_tree(inorder + 1, t);  in bch_bset_fix_invalidated_key()
960 	unsigned int inorder, j, n = 1;  in bset_search_tree()  local
984 	inorder = to_inorder(j, t);  in bset_search_tree()
991 		l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
993 		if (++inorder != t->size) {  in bset_search_tree()
995 			r = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
999 		r = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
1001 		if (--inorder) {  in bset_search_tree()
1003 			l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()