Lines Matching refs:sorted

233 	darray_resize(&wb->sorted, wb->flushing.keys.size);
235 	if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) {
241 			wb->sorted.size - wb->flushing.keys.nr);
267 	BUG_ON(wb->sorted.size < wb->flushing.keys.nr);
308 		wb->sorted.data[i].idx = i;
309 		wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree;
310 		memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos));
312 	wb->sorted.nr = wb->flushing.keys.nr;
316 	 * then we attempt to flush in sorted btree order, as this is most
328 	wb_sort(wb->sorted.data, wb->sorted.nr);
330 	darray_for_each(wb->sorted, i) {
338 		for (struct wb_key_ref *n = i + 1; n < min(i + 4, &darray_top(wb->sorted)); n++)
349 		if (i + 1 < &darray_top(wb->sorted) &&
735 		ret = darray_resize(&wb->sorted, wb->flushing.keys.size);
751 		dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);
790 		dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);
869 	darray_exit(&wb->sorted);
892 		darray_make_room(&wb->sorted, initial_size);