129 int __bch_keylist_realloc(struct keylist *l, unsigned u64s)  in __bch_keylist_realloc()  argument
131 	size_t oldsize = bch_keylist_nkeys(l);  in __bch_keylist_realloc()
133 	uint64_t *old_keys = l->keys_p == l->inline_keys ? NULL : l->keys_p;  in __bch_keylist_realloc()
148 		memcpy(new_keys, l->inline_keys, sizeof(uint64_t) * oldsize);  in __bch_keylist_realloc()
150 	l->keys_p = new_keys;  in __bch_keylist_realloc()
151 	l->top_p = new_keys + oldsize;  in __bch_keylist_realloc()
156 struct bkey *bch_keylist_pop(struct keylist *l)  in bch_keylist_pop()  argument
158 	struct bkey *k = l->keys;  in bch_keylist_pop()
160 	if (k == l->top)  in bch_keylist_pop()
163 	while (bkey_next(k) != l->top)  in bch_keylist_pop()
166 	return l->top = k;  in bch_keylist_pop()
169 void bch_keylist_pop_front(struct keylist *l)  in bch_keylist_pop_front()  argument
171 	l->top_p -= bkey_u64s(l->keys);  in bch_keylist_pop_front()
173 	memmove(l->keys,  in bch_keylist_pop_front()
174 		bkey_next(l->keys),  in bch_keylist_pop_front()
175 		bch_keylist_bytes(l));  in bch_keylist_pop_front()
560 	struct bkey *l = is_power_of_2(j)  in make_bfloat()  local
568 	BUG_ON(m < l || m > r);  in make_bfloat()
571 	if (KEY_INODE(l) != KEY_INODE(r))  in make_bfloat()
572 		f->exponent = fls64(KEY_INODE(r) ^ KEY_INODE(l)) + 64;  in make_bfloat()
574 		f->exponent = fls64(r->low ^ l->low);  in make_bfloat()
781 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r)  in bch_bkey_try_merge()  argument
791 	if (!bch_bkey_equal_header(l, r) ||  in bch_bkey_try_merge()
792 	     bkey_cmp(l, &START_KEY(r)))  in bch_bkey_try_merge()
795 	return b->ops->key_merge(b, l, r);  in bch_bkey_try_merge()
868 	struct bkey *l, *r;  member
894 	struct bkey *l, *r;  in bset_search_tree()  local
932 		l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
944 			l = cacheline_to_bkey(t, inorder, f->m);  in bset_search_tree()
946 			l = t->data->start;  in bset_search_tree()
949 	return (struct bset_search_iter) {l, r};  in bset_search_tree()
973 		i.l = t->data->start;  in __bch_bset_search()
999 		       i.l != t->data->start &&  in __bch_bset_search()
1001 			  inorder_to_tree(bkey_to_cacheline(t, i.l), t)),  in __bch_bset_search()
1008 	while (likely(i.l != i.r) &&  in __bch_bset_search()
1009 	       bkey_cmp(i.l, search) <= 0)  in __bch_bset_search()
1010 		i.l = bkey_next(i.l);  in __bch_bset_search()
1012 	return i.l;  in __bch_bset_search()
1021 static inline bool btree_iter_cmp(struct btree_iter_set l,  in btree_iter_cmp()  argument
1024 	return bkey_cmp(l.k, r.k) > 0;  in btree_iter_cmp()