268 	return PAGE_SIZE << b->page_order;  in btree_keys_bytes()
306 	free_pages((unsigned long) t->data, b->page_order);  in bch_btree_keys_free()
315 			 unsigned int page_order,  in bch_btree_keys_alloc()  argument
322 	b->page_order = page_order;  in bch_btree_keys_alloc()
324 	t->data = (void *) __get_free_pages(gfp, b->page_order);  in bch_btree_keys_alloc()
868 	       PAGE_SIZE << b->page_order);  in bch_bset_insert()
1190 			     unsigned int page_order)  in bch_bset_sort_state_init()  argument
1194 	state->page_order = page_order;  in bch_bset_sort_state_init()
1195 	state->crit_factor = int_sqrt(1 << page_order);  in bch_bset_sort_state_init()
1197 	return mempool_init_page_pool(&state->pool, 1, page_order);  in bch_bset_sort_state_init()
1253 		BUG_ON(order > state->page_order);  in __btree_sort()
1258 		order = state->page_order;  in __btree_sort()
1266 	if (!start && order == b->page_order) {  in __btree_sort()
1297 	size_t order = b->page_order, keys = 0;  in bch_btree_sort_partial()
1322 	__btree_sort(b, iter, 0, b->page_order, true, state);  in bch_btree_sort_and_fix_extents()