266 	return PAGE_SIZE << b->page_order;  in btree_keys_bytes()
304 	free_pages((unsigned long) t->data, b->page_order);  in bch_btree_keys_free()
312 int bch_btree_keys_alloc(struct btree_keys *b, unsigned page_order, gfp_t gfp)  in bch_btree_keys_alloc()  argument
318 	b->page_order = page_order;  in bch_btree_keys_alloc()
320 	t->data = (void *) __get_free_pages(gfp, b->page_order);  in bch_btree_keys_alloc()
807 	       PAGE_SIZE << b->page_order);  in bch_bset_insert()
1123 int bch_bset_sort_state_init(struct bset_sort_state *state, unsigned page_order)  in bch_bset_sort_state_init()  argument
1127 	state->page_order = page_order;  in bch_bset_sort_state_init()
1128 	state->crit_factor = int_sqrt(1 << page_order);  in bch_bset_sort_state_init()
1130 	state->pool = mempool_create_page_pool(1, page_order);  in bch_bset_sort_state_init()
1190 		BUG_ON(order > state->page_order);  in __btree_sort()
1195 		order = state->page_order;  in __btree_sort()
1203 	if (!start && order == b->page_order) {  in __btree_sort()
1234 	size_t order = b->page_order, keys = 0;  in bch_btree_sort_partial()
1259 	__btree_sort(b, iter, 0, b->page_order, true, state);  in bch_btree_sort_and_fix_extents()