Lines Matching refs:first
560 /* NOTE: kiocb has the file as the first member, so don't do it here */
731 /* first byte is taken by user flags, shift it to not overlap */
758 /* drain existing IO first */
827 * as the first entry in their struct definition. So you can
2140 * didn't fail this request, queue the first one up, moving any other
2191 if (!tctx->task_list.first && locked && ctx->submit_state.compl_nr)
2195 node = tctx->task_list.first;
2268 node = tctx->task_list.first;
2566 * and complete those lists first, if we have entries there.
2884 * it to the front so we find it first.
3142 * first and last bvec
3145 * If the offset is within the first bvec (or the whole first
3147 * since we can just skip the first segment, which may not
3157 /* skip first vec */
5451 * lock in the first place can race with the waitqueue being freed.
5497 * cqe.res contains only events of the first wake up
5651 /* for instances that support it check for an event match first */
5681 struct io_poll_iocb *first = poll;
5684 if (first->head == head)
5699 io_init_poll_iocb(poll, first->events, first->wait.func);
6323 * Insertion sort, ensuring the first entry in the list is always
6324 * the one we need first.
6627 /* not interested in head, start from the first linked */