Lines Matching defs:node
238 struct list_head node;
814 struct io_wq_work_node node;
1287 struct llist_node *node = llist_del_all(&ctx->fallback_llist);
1292 llist_for_each_entry_safe(req, tmp, node, io_task_work.fallback_node)
2189 struct io_wq_work_node *node;
2195 node = tctx->task_list.first;
2197 if (!node)
2200 if (!node)
2204 struct io_wq_work_node *next = node->next;
2205 struct io_kiocb *req = container_of(node, struct io_kiocb,
2206 io_task_work.node);
2216 node = next;
2222 } while (node);
2237 struct io_wq_work_node *node;
2244 wq_list_add_tail(&req->io_task_work.node, &tctx->task_list);
2268 node = tctx->task_list.first;
2272 while (node) {
2273 req = container_of(node, struct io_kiocb, io_task_work.node);
2274 node = node->next;
6425 struct io_tctx_node *node;
6435 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
6436 struct io_uring_task *tctx = node->task->io_uring;
7792 struct io_rsrc_node *node = container_of(ref, struct io_rsrc_node, refs);
7793 struct io_ring_ctx *ctx = node->rsrc_data->ctx;
7799 node->done = true;
7802 if (node->rsrc_data->quiesce)
7806 node = list_first_entry(&ctx->rsrc_ref_list,
7807 struct io_rsrc_node, node);
7809 if (!node->done)
7811 list_del(&node->node);
7812 first_add |= llist_add(&node->llist, &ctx->rsrc_put_llist);
7833 INIT_LIST_HEAD(&ref_node->node);
7850 list_add_tail(&rsrc_node->node, &ctx->rsrc_ref_list);
8360 struct llist_node *node;
8363 node = llist_del_all(&ctx->rsrc_put_llist);
8365 while (node) {
8367 struct llist_node *next = node->next;
8369 ref_node = llist_entry(node, struct io_rsrc_node, llist);
8371 node = next;
8458 struct io_rsrc_node *node, void *rsrc)
8470 list_add(&prsrc->list, &node->rsrc_list);
9483 * node. It'll be removed by the end of cancellation, just ignore it.
9505 struct io_tctx_node *node;
9558 node = list_first_entry(&ctx->tctx_list, struct io_tctx_node,
9562 ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL);
9565 wake_up_process(node->task);
9690 struct io_tctx_node *node;
9695 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
9696 struct io_uring_task *tctx = node->task->io_uring;
9759 struct io_tctx_node *node;
9778 node = kmalloc(sizeof(*node), GFP_KERNEL);
9779 if (!node)
9781 node->ctx = ctx;
9782 node->task = current;
9785 node, GFP_KERNEL));
9787 kfree(node);
9792 list_add(&node->ctx_node, &ctx->tctx_list);
9817 struct io_tctx_node *node;
9821 node = xa_erase(&tctx->xa, index);
9822 if (!node)
9825 WARN_ON_ONCE(current != node->task);
9826 WARN_ON_ONCE(list_empty(&node->ctx_node));
9828 mutex_lock(&node->ctx->uring_lock);
9829 list_del(&node->ctx_node);
9830 mutex_unlock(&node->ctx->uring_lock);
9832 if (tctx->last == node->ctx)
9834 kfree(node);
9840 struct io_tctx_node *node;
9843 xa_for_each(&tctx->xa, index, node) {
9891 struct io_tctx_node *node;
9894 xa_for_each(&tctx->xa, index, node) {
9896 if (node->ctx->sq_data)
9898 io_uring_try_cancel_requests(node->ctx, current,
10434 /* always set a rsrc node */
10796 struct io_tctx_node *node;
10856 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
10857 struct io_uring_task *tctx = node->task->io_uring;