Lines Matching refs:sorted
230 darray_resize(&wb->sorted, wb->flushing.keys.size);
232 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) {
238 wb->sorted.size - wb->flushing.keys.nr);
264 BUG_ON(wb->sorted.size < wb->flushing.keys.nr);
306 wb->sorted.data[i].idx = i;
307 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree;
308 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos));
310 wb->sorted.nr = wb->flushing.keys.nr;
314 * then we attempt to flush in sorted btree order, as this is most
326 wb_sort(wb->sorted.data, wb->sorted.nr);
328 darray_for_each(wb->sorted, i) {
336 for (struct wb_key_ref *n = i + 1; n < min(i + 4, &darray_top(wb->sorted)); n++)
347 if (i + 1 < &darray_top(wb->sorted) &&
730 ret = darray_resize(&wb->sorted, wb->flushing.keys.size);
746 dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);
785 dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);
864 darray_exit(&wb->sorted);
882 darray_make_room(&wb->sorted, initial_size);