Lines Matching defs:list
135 struct list_head list;
296 * 32 entries per hash list if totally full and uniformly spread, but
454 req->work.list.next = NULL;
526 struct io_defer_entry, list);
530 list_del_init(&de->list);
668 LIST_HEAD(list);
671 list_splice_init(&ctx->cq_overflow_list, &list);
675 while (!list_empty(&list)) {
676 ocqe = list_first_entry(&list, struct io_overflow_cqe, list);
677 list_del(&ocqe->list);
700 struct io_overflow_cqe, list);
702 list_del(&ocqe->list);
812 list_add_tail(&ocqe->list, &ctx->cq_overflow_list);
1204 * io_llist_xchg - swap all entries in a lock-less list
1205 * @head: the head of lock-less list to delete all entries
1206 * @new: new entry as the head of the list
1208 * If list is empty, return NULL, otherwise, return the pointer to the first entry.
1630 * the poll to the issued list. Otherwise we can spin here
1675 * After the iocb has been issued, it's safe to be found on the poll list.
1676 * Adding the kiocb to the list AFTER submission ensures that we don't
1789 /* Still need defer if there is pending req in defer list. */
1818 list_add_tail(&de->list, &ctx->defer_list);
2998 * Don't flush cqring overflow list here, just do a simple check.
3214 LIST_HEAD(list);
3217 list_for_each_entry_reverse(de, &ctx->defer_list, list) {
3219 list_cut_position(&list, &ctx->defer_list, &de->list);
3224 if (list_empty(&list))
3227 while (!list_empty(&list)) {
3228 de = list_first_entry(&list, struct io_defer_entry, list);
3229 list_del_init(&de->list);