201 	if (!wb->inc.keys.nr)  in move_keys_from_inc_to_flushing()
204 	bch2_journal_pin_add(j, wb->inc.keys.data[0].journal_seq, &wb->flushing.pin,  in move_keys_from_inc_to_flushing()
207 	darray_resize(&wb->flushing.keys, min_t(size_t, 1U << 20, wb->flushing.keys.nr + wb->inc.keys.nr));  in move_keys_from_inc_to_flushing()
208 	darray_resize(&wb->sorted, wb->flushing.keys.size);  in move_keys_from_inc_to_flushing()
210 	if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) {  in move_keys_from_inc_to_flushing()
211 		swap(wb->flushing.keys, wb->inc.keys);  in move_keys_from_inc_to_flushing()
215 	size_t nr = min(darray_room(wb->flushing.keys),  in move_keys_from_inc_to_flushing()
216 			wb->sorted.size - wb->flushing.keys.nr);  in move_keys_from_inc_to_flushing()
217 	nr = min(nr, wb->inc.keys.nr);  in move_keys_from_inc_to_flushing()
219 	memcpy(&darray_top(wb->flushing.keys),  in move_keys_from_inc_to_flushing()
220 	       wb->inc.keys.data,  in move_keys_from_inc_to_flushing()
221 	       sizeof(wb->inc.keys.data[0]) * nr);  in move_keys_from_inc_to_flushing()
223 	memmove(wb->inc.keys.data,  in move_keys_from_inc_to_flushing()
224 		wb->inc.keys.data + nr,  in move_keys_from_inc_to_flushing()
225 	       sizeof(wb->inc.keys.data[0]) * (wb->inc.keys.nr - nr));  in move_keys_from_inc_to_flushing()
227 	wb->flushing.keys.nr	+= nr;  in move_keys_from_inc_to_flushing()
228 	wb->inc.keys.nr		-= nr;  in move_keys_from_inc_to_flushing()
230 	if (!wb->inc.keys.nr)  in move_keys_from_inc_to_flushing()
233 		bch2_journal_pin_update(j, wb->inc.keys.data[0].journal_seq, &wb->inc.pin,  in move_keys_from_inc_to_flushing()
242 	BUG_ON(wb->sorted.size < wb->flushing.keys.nr);  in move_keys_from_inc_to_flushing()
262 	for (size_t i = 0; i < wb->flushing.keys.nr; i++) {  in bch2_btree_write_buffer_flush_locked()
264 		wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree;  in bch2_btree_write_buffer_flush_locked()
265 		memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos));  in bch2_btree_write_buffer_flush_locked()
267 	wb->sorted.nr = wb->flushing.keys.nr;  in bch2_btree_write_buffer_flush_locked()
281 	 * as many keys as possible in the fast path.  in bch2_btree_write_buffer_flush_locked()
286 		struct btree_write_buffered_key *k = &wb->flushing.keys.data[i->idx];  in bch2_btree_write_buffer_flush_locked()
289 			prefetch(&wb->flushing.keys.data[n->idx]);  in bch2_btree_write_buffer_flush_locked()
295 			struct btree_write_buffered_key *n = &wb->flushing.keys.data[i[1].idx];  in bch2_btree_write_buffer_flush_locked()
355 		 * The fastpath zapped the seq of keys that were successfully flushed so  in bch2_btree_write_buffer_flush_locked()
358 		trace_and_count(c, write_buffer_flush_slowpath, trans, slowpath, wb->flushing.keys.nr);  in bch2_btree_write_buffer_flush_locked()
360 		darray_for_each(wb->flushing.keys, i) {  in bch2_btree_write_buffer_flush_locked()
382 	trace_write_buffer_flush(trans, wb->flushing.keys.nr, skipped, fast, 0);  in bch2_btree_write_buffer_flush_locked()
384 	wb->flushing.keys.nr = 0;  in bch2_btree_write_buffer_flush_locked()
493 	ret = darray_make_room_gfp(&dst->wb->keys, 1, GFP_KERNEL);  in bch2_journal_key_to_wb_slowpath()
495 		ret = darray_resize(&wb->sorted, wb->flushing.keys.size);  in bch2_journal_key_to_wb_slowpath()
509 	dst->room = darray_room(dst->wb->keys);  in bch2_journal_key_to_wb_slowpath()
511 		dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);  in bch2_journal_key_to_wb_slowpath()
515 	struct btree_write_buffered_key *wb_k = &darray_top(dst->wb->keys);  in bch2_journal_key_to_wb_slowpath()
519 	dst->wb->keys.nr++;  in bch2_journal_key_to_wb_slowpath()
533 		 * Attempt to skip wb->inc, and add keys directly to  in bch2_journal_keys_to_write_buffer_start()
537 		if (!wb->inc.keys.nr) {  in bch2_journal_keys_to_write_buffer_start()
548 	dst->room = darray_room(dst->wb->keys);  in bch2_journal_keys_to_write_buffer_start()
550 		dst->room = min(dst->room, wb->sorted.size - wb->flushing.keys.nr);  in bch2_journal_keys_to_write_buffer_start()
561 	if (!dst->wb->keys.nr)  in bch2_journal_keys_to_write_buffer_end()
601 	if (wb->keys.size >= new_size)  in wb_keys_resize()
607 	int ret = darray_resize(&wb->keys, new_size);  in wb_keys_resize()
624 	BUG_ON((wb->inc.keys.nr || wb->flushing.keys.nr) &&  in bch2_fs_btree_write_buffer_exit()
628 	darray_exit(&wb->flushing.keys);  in bch2_fs_btree_write_buffer_exit()
629 	darray_exit(&wb->inc.keys);  in bch2_fs_btree_write_buffer_exit()
643 	return  darray_make_room(&wb->inc.keys, initial_size) ?:  in bch2_fs_btree_write_buffer_init()
644 		darray_make_room(&wb->flushing.keys, initial_size) ?:  in bch2_fs_btree_write_buffer_init()