[thirdparty/linux.git] / io_uring / fdinfo.c

// SPDX-License-Identifier: GPL-2.0
#include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/fs.h>
#include <linux/file.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <linux/io_uring.h>

#include <uapi/linux/io_uring.h>

#include "io_uring.h"
#include "sqpoll.h"
#include "fdinfo.h"
#include "cancel.h"
#include "rsrc.h"

#ifdef CONFIG_PROC_FS
static __cold int io_uring_show_cred(struct seq_file *m, unsigned int id,
		const struct cred *cred)
{
	struct user_namespace *uns = seq_user_ns(m);
	struct group_info *gi;
	kernel_cap_t cap;
	int g;

	seq_printf(m, "%5d\n", id);
	seq_put_decimal_ull(m, "\tUid:\t", from_kuid_munged(uns, cred->uid));
	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->euid));
	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->suid));
	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->fsuid));
	seq_put_decimal_ull(m, "\n\tGid:\t", from_kgid_munged(uns, cred->gid));
	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->egid));
	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->sgid));
	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->fsgid));
	seq_puts(m, "\n\tGroups:\t");
	gi = cred->group_info;
	for (g = 0; g < gi->ngroups; g++) {
		seq_put_decimal_ull(m, g ? " " : "",
					from_kgid_munged(uns, gi->gid[g]));
	}
	seq_puts(m, "\n\tCapEff:\t");
	cap = cred->cap_effective;
	seq_put_hex_ll(m, NULL, cap.val, 16);
	seq_putc(m, '\n');
	return 0;
}

/*
 * Caller holds a reference to the file already, we don't need to do
 * anything else to get an extra reference.
 */
__cold void io_uring_show_fdinfo(struct seq_file *m, struct file *f)
{
	struct io_ring_ctx *ctx = f->private_data;
	struct io_overflow_cqe *ocqe;
	struct io_rings *r = ctx->rings;
	unsigned int sq_mask = ctx->sq_entries - 1, cq_mask = ctx->cq_entries - 1;
	unsigned int sq_head = READ_ONCE(r->sq.head);
	unsigned int sq_tail = READ_ONCE(r->sq.tail);
	unsigned int cq_head = READ_ONCE(r->cq.head);
	unsigned int cq_tail = READ_ONCE(r->cq.tail);
	unsigned int cq_shift = 0;
	unsigned int sq_shift = 0;
	unsigned int sq_entries, cq_entries;
	int sq_pid = -1, sq_cpu = -1;
	bool has_lock;
	unsigned int i;

	if (ctx->flags & IORING_SETUP_CQE32)
		cq_shift = 1;
	if (ctx->flags & IORING_SETUP_SQE128)
		sq_shift = 1;

	/*
	 * we may get imprecise sqe and cqe info if uring is actively running
	 * since we get cached_sq_head and cached_cq_tail without uring_lock
	 * and sq_tail and cq_head are changed by userspace. But it's ok since
	 * we usually use these info when it is stuck.
	 */
	seq_printf(m, "SqMask:\t0x%x\n", sq_mask);
	seq_printf(m, "SqHead:\t%u\n", sq_head);
	seq_printf(m, "SqTail:\t%u\n", sq_tail);
	seq_printf(m, "CachedSqHead:\t%u\n", ctx->cached_sq_head);
	seq_printf(m, "CqMask:\t0x%x\n", cq_mask);
	seq_printf(m, "CqHead:\t%u\n", cq_head);
	seq_printf(m, "CqTail:\t%u\n", cq_tail);
	seq_printf(m, "CachedCqTail:\t%u\n", ctx->cached_cq_tail);
	seq_printf(m, "SQEs:\t%u\n", sq_tail - sq_head);
	sq_entries = min(sq_tail - sq_head, ctx->sq_entries);
	for (i = 0; i < sq_entries; i++) {
		unsigned int entry = i + sq_head;
		struct io_uring_sqe *sqe;
		unsigned int sq_idx;

		if (ctx->flags & IORING_SETUP_NO_SQARRAY)
			break;
		sq_idx = READ_ONCE(ctx->sq_array[entry & sq_mask]);
		if (sq_idx > sq_mask)
			continue;
		sqe = &ctx->sq_sqes[sq_idx << sq_shift];
		seq_printf(m, "%5u: opcode:%s, fd:%d, flags:%x, off:%llu, "
			      "addr:0x%llx, rw_flags:0x%x, buf_index:%d "
			      "user_data:%llu",
			   sq_idx, io_uring_get_opcode(sqe->opcode), sqe->fd,
			   sqe->flags, (unsigned long long) sqe->off,
			   (unsigned long long) sqe->addr, sqe->rw_flags,
			   sqe->buf_index, sqe->user_data);
		if (sq_shift) {
			u64 *sqeb = (void *) (sqe + 1);
			int size = sizeof(struct io_uring_sqe) / sizeof(u64);
			int j;

			for (j = 0; j < size; j++) {
				seq_printf(m, ", e%d:0x%llx", j,
						(unsigned long long) *sqeb);
				sqeb++;
			}
		}
		seq_printf(m, "\n");
	}
	seq_printf(m, "CQEs:\t%u\n", cq_tail - cq_head);
	cq_entries = min(cq_tail - cq_head, ctx->cq_entries);
	for (i = 0; i < cq_entries; i++) {
		unsigned int entry = i + cq_head;
		struct io_uring_cqe *cqe = &r->cqes[(entry & cq_mask) << cq_shift];

		seq_printf(m, "%5u: user_data:%llu, res:%d, flag:%x",
			   entry & cq_mask, cqe->user_data, cqe->res,
			   cqe->flags);
		if (cq_shift)
			seq_printf(m, ", extra1:%llu, extra2:%llu\n",
					cqe->big_cqe[0], cqe->big_cqe[1]);
		seq_printf(m, "\n");
	}

	/*
	 * Avoid ABBA deadlock between the seq lock and the io_uring mutex,
	 * since fdinfo case grabs it in the opposite direction of normal use
	 * cases. If we fail to get the lock, we just don't iterate any
	 * structures that could be going away outside the io_uring mutex.
	 */
	has_lock = mutex_trylock(&ctx->uring_lock);

	if (has_lock && (ctx->flags & IORING_SETUP_SQPOLL)) {
		struct io_sq_data *sq = ctx->sq_data;

		sq_pid = sq->task_pid;
		sq_cpu = sq->sq_cpu;
	}

	seq_printf(m, "SqThread:\t%d\n", sq_pid);
	seq_printf(m, "SqThreadCpu:\t%d\n", sq_cpu);
	seq_printf(m, "UserFiles:\t%u\n", ctx->nr_user_files);
	for (i = 0; has_lock && i < ctx->nr_user_files; i++) {
		struct file *f = io_file_from_index(&ctx->file_table, i);

		if (f)
			seq_printf(m, "%5u: %s\n", i, file_dentry(f)->d_iname);
		else
			seq_printf(m, "%5u: <none>\n", i);
	}
	seq_printf(m, "UserBufs:\t%u\n", ctx->nr_user_bufs);
	for (i = 0; has_lock && i < ctx->nr_user_bufs; i++) {
		struct io_mapped_ubuf *buf = ctx->user_bufs[i];
		unsigned int len = buf->ubuf_end - buf->ubuf;

		seq_printf(m, "%5u: 0x%llx/%u\n", i, buf->ubuf, len);
	}
	if (has_lock && !xa_empty(&ctx->personalities)) {
		unsigned long index;
		const struct cred *cred;

		seq_printf(m, "Personalities:\n");
		xa_for_each(&ctx->personalities, index, cred)
			io_uring_show_cred(m, index, cred);
	}

	seq_puts(m, "PollList:\n");
	for (i = 0; i < (1U << ctx->cancel_table.hash_bits); i++) {
		struct io_hash_bucket *hb = &ctx->cancel_table.hbs[i];
		struct io_hash_bucket *hbl = &ctx->cancel_table_locked.hbs[i];
		struct io_kiocb *req;

		spin_lock(&hb->lock);
		hlist_for_each_entry(req, &hb->list, hash_node)
			seq_printf(m, "  op=%d, task_works=%d\n", req->opcode,
					task_work_pending(req->task));
		spin_unlock(&hb->lock);

		if (!has_lock)
			continue;
		hlist_for_each_entry(req, &hbl->list, hash_node)
			seq_printf(m, "  op=%d, task_works=%d\n", req->opcode,
					task_work_pending(req->task));
	}

	if (has_lock)
		mutex_unlock(&ctx->uring_lock);

	seq_puts(m, "CqOverflowList:\n");
	spin_lock(&ctx->completion_lock);
	list_for_each_entry(ocqe, &ctx->cq_overflow_list, list) {
		struct io_uring_cqe *cqe = &ocqe->cqe;

		seq_printf(m, "  user_data=%llu, res=%d, flags=%x\n",
			   cqe->user_data, cqe->res, cqe->flags);

	}

	spin_unlock(&ctx->completion_lock);
}
#endif
Commit	Line	Data
a4ad4f74 JA	1	// SPDX-License-Identifier: GPL-2.0
	2	#include <linux/kernel.h>
	3	#include <linux/errno.h>
	4	#include <linux/fs.h>
	5	#include <linux/file.h>
	6	#include <linux/proc_fs.h>
	7	#include <linux/seq_file.h>
	8	#include <linux/io_uring.h>
	9
	10	#include <uapi/linux/io_uring.h>
	11
a4ad4f74 JA	12	#include "io_uring.h"
	13	#include "sqpoll.h"
	14	#include "fdinfo.h"
38513c46	15	#include "cancel.h"
ad163a7e	16	#include "rsrc.h"
a4ad4f74 JA	17
	18	#ifdef CONFIG_PROC_FS
	19	static __cold int io_uring_show_cred(struct seq_file *m, unsigned int id,
	20	const struct cred *cred)
	21	{
	22	struct user_namespace *uns = seq_user_ns(m);
	23	struct group_info *gi;
	24	kernel_cap_t cap;
a4ad4f74 JA	25	int g;
	26
	27	seq_printf(m, "%5d\n", id);
	28	seq_put_decimal_ull(m, "\tUid:\t", from_kuid_munged(uns, cred->uid));
	29	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->euid));
	30	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->suid));
	31	seq_put_decimal_ull(m, "\t\t", from_kuid_munged(uns, cred->fsuid));
	32	seq_put_decimal_ull(m, "\n\tGid:\t", from_kgid_munged(uns, cred->gid));
	33	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->egid));
	34	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->sgid));
	35	seq_put_decimal_ull(m, "\t\t", from_kgid_munged(uns, cred->fsgid));
	36	seq_puts(m, "\n\tGroups:\t");
	37	gi = cred->group_info;
	38	for (g = 0; g < gi->ngroups; g++) {
	39	seq_put_decimal_ull(m, g ? " " : "",
	40	from_kgid_munged(uns, gi->gid[g]));
	41	}
	42	seq_puts(m, "\n\tCapEff:\t");
	43	cap = cred->cap_effective;
f122a08b	44	seq_put_hex_ll(m, NULL, cap.val, 16);
a4ad4f74 JA	45	seq_putc(m, '\n');
	46	return 0;
	47	}
	48
3aaf22b6 JA	49	/*
	50	* Caller holds a reference to the file already, we don't need to do
	51	* anything else to get an extra reference.
	52	*/
	53	__cold void io_uring_show_fdinfo(struct seq_file m, struct file f)
a4ad4f74	54	{
3aaf22b6	55	struct io_ring_ctx *ctx = f->private_data;
a4ad4f74 JA	56	struct io_overflow_cqe *ocqe;
	57	struct io_rings *r = ctx->rings;
	58	unsigned int sq_mask = ctx->sq_entries - 1, cq_mask = ctx->cq_entries - 1;
	59	unsigned int sq_head = READ_ONCE(r->sq.head);
	60	unsigned int sq_tail = READ_ONCE(r->sq.tail);
	61	unsigned int cq_head = READ_ONCE(r->cq.head);
	62	unsigned int cq_tail = READ_ONCE(r->cq.tail);
	63	unsigned int cq_shift = 0;
3b8fdd1d	64	unsigned int sq_shift = 0;
a4ad4f74	65	unsigned int sq_entries, cq_entries;
7644b1a1	66	int sq_pid = -1, sq_cpu = -1;
a4ad4f74	67	bool has_lock;
a4ad4f74 JA	68	unsigned int i;
a4ad4f74 JA	69
4f731705	70	if (ctx->flags & IORING_SETUP_CQE32)
a4ad4f74	71	cq_shift = 1;
3b8fdd1d JA	72	if (ctx->flags & IORING_SETUP_SQE128)
3b8fdd1d JA	73	sq_shift = 1;
a4ad4f74 JA	74
	75	/*
	76	* we may get imprecise sqe and cqe info if uring is actively running
	77	* since we get cached_sq_head and cached_cq_tail without uring_lock
	78	* and sq_tail and cq_head are changed by userspace. But it's ok since
	79	* we usually use these info when it is stuck.
	80	*/
	81	seq_printf(m, "SqMask:\t0x%x\n", sq_mask);
	82	seq_printf(m, "SqHead:\t%u\n", sq_head);
	83	seq_printf(m, "SqTail:\t%u\n", sq_tail);
	84	seq_printf(m, "CachedSqHead:\t%u\n", ctx->cached_sq_head);
	85	seq_printf(m, "CqMask:\t0x%x\n", cq_mask);
	86	seq_printf(m, "CqHead:\t%u\n", cq_head);
	87	seq_printf(m, "CqTail:\t%u\n", cq_tail);
	88	seq_printf(m, "CachedCqTail:\t%u\n", ctx->cached_cq_tail);
3b8fdd1d	89	seq_printf(m, "SQEs:\t%u\n", sq_tail - sq_head);
a4ad4f74 JA	90	sq_entries = min(sq_tail - sq_head, ctx->sq_entries);
	91	for (i = 0; i < sq_entries; i++) {
	92	unsigned int entry = i + sq_head;
a4ad4f74	93	struct io_uring_sqe *sqe;
3b8fdd1d	94	unsigned int sq_idx;
a4ad4f74	95
32f5dea0 JA	96	if (ctx->flags & IORING_SETUP_NO_SQARRAY)
32f5dea0 JA	97	break;
3b8fdd1d	98	sq_idx = READ_ONCE(ctx->sq_array[entry & sq_mask]);
a4ad4f74 JA	99	if (sq_idx > sq_mask)
a4ad4f74 JA	100	continue;
00927931	101	sqe = &ctx->sq_sqes[sq_idx << sq_shift];
3b8fdd1d JA	102	seq_printf(m, "%5u: opcode:%s, fd:%d, flags:%x, off:%llu, "
	103	"addr:0x%llx, rw_flags:0x%x, buf_index:%d "
	104	"user_data:%llu",
	105	sq_idx, io_uring_get_opcode(sqe->opcode), sqe->fd,
	106	sqe->flags, (unsigned long long) sqe->off,
	107	(unsigned long long) sqe->addr, sqe->rw_flags,
	108	sqe->buf_index, sqe->user_data);
	109	if (sq_shift) {
	110	u64 sqeb = (void ) (sqe + 1);
	111	int size = sizeof(struct io_uring_sqe) / sizeof(u64);
	112	int j;
	113
	114	for (j = 0; j < size; j++) {
	115	seq_printf(m, ", e%d:0x%llx", j,
	116	(unsigned long long) *sqeb);
	117	sqeb++;
	118	}
	119	}
	120	seq_printf(m, "\n");
a4ad4f74 JA	121	}
	122	seq_printf(m, "CQEs:\t%u\n", cq_tail - cq_head);
	123	cq_entries = min(cq_tail - cq_head, ctx->cq_entries);
	124	for (i = 0; i < cq_entries; i++) {
	125	unsigned int entry = i + cq_head;
	126	struct io_uring_cqe *cqe = &r->cqes[(entry & cq_mask) << cq_shift];
	127
4f731705	128	seq_printf(m, "%5u: user_data:%llu, res:%d, flag:%x",
a4ad4f74 JA	129	entry & cq_mask, cqe->user_data, cqe->res,
a4ad4f74 JA	130	cqe->flags);
4f731705 JA	131	if (cq_shift)
	132	seq_printf(m, ", extra1:%llu, extra2:%llu\n",
	133	cqe->big_cqe[0], cqe->big_cqe[1]);
	134	seq_printf(m, "\n");
a4ad4f74 JA	135	}
	136
	137	/*
	138	* Avoid ABBA deadlock between the seq lock and the io_uring mutex,
	139	* since fdinfo case grabs it in the opposite direction of normal use
	140	* cases. If we fail to get the lock, we just don't iterate any
	141	* structures that could be going away outside the io_uring mutex.
	142	*/
	143	has_lock = mutex_trylock(&ctx->uring_lock);
	144
	145	if (has_lock && (ctx->flags & IORING_SETUP_SQPOLL)) {
7644b1a1 JA	146	struct io_sq_data *sq = ctx->sq_data;
7644b1a1 JA	147
a0d45c3f JA	148	sq_pid = sq->task_pid;
a0d45c3f JA	149	sq_cpu = sq->sq_cpu;
a4ad4f74 JA	150	}
a4ad4f74 JA	151
7644b1a1 JA	152	seq_printf(m, "SqThread:\t%d\n", sq_pid);
7644b1a1 JA	153	seq_printf(m, "SqThreadCpu:\t%d\n", sq_cpu);
a4ad4f74 JA	154	seq_printf(m, "UserFiles:\t%u\n", ctx->nr_user_files);
	155	for (i = 0; has_lock && i < ctx->nr_user_files; i++) {
	156	struct file *f = io_file_from_index(&ctx->file_table, i);
	157
	158	if (f)
	159	seq_printf(m, "%5u: %s\n", i, file_dentry(f)->d_iname);
	160	else
	161	seq_printf(m, "%5u: <none>\n", i);
	162	}
	163	seq_printf(m, "UserBufs:\t%u\n", ctx->nr_user_bufs);
	164	for (i = 0; has_lock && i < ctx->nr_user_bufs; i++) {
	165	struct io_mapped_ubuf *buf = ctx->user_bufs[i];
	166	unsigned int len = buf->ubuf_end - buf->ubuf;
	167
	168	seq_printf(m, "%5u: 0x%llx/%u\n", i, buf->ubuf, len);
	169	}
	170	if (has_lock && !xa_empty(&ctx->personalities)) {
	171	unsigned long index;
	172	const struct cred *cred;
	173
	174	seq_printf(m, "Personalities:\n");
	175	xa_for_each(&ctx->personalities, index, cred)
	176	io_uring_show_cred(m, index, cred);
	177	}
a4ad4f74 JA	178
a4ad4f74 JA	179	seq_puts(m, "PollList:\n");
e6f89be6 PB	180	for (i = 0; i < (1U << ctx->cancel_table.hash_bits); i++) {
e6f89be6 PB	181	struct io_hash_bucket *hb = &ctx->cancel_table.hbs[i];
ea97cbeb	182	struct io_hash_bucket *hbl = &ctx->cancel_table_locked.hbs[i];
a4ad4f74 JA	183	struct io_kiocb *req;
a4ad4f74 JA	184
38513c46 HX	185	spin_lock(&hb->lock);
38513c46 HX	186	hlist_for_each_entry(req, &hb->list, hash_node)
a4ad4f74 JA	187	seq_printf(m, " op=%d, task_works=%d\n", req->opcode,
a4ad4f74 JA	188	task_work_pending(req->task));
38513c46	189	spin_unlock(&hb->lock);
ea97cbeb JA	190
	191	if (!has_lock)
	192	continue;
	193	hlist_for_each_entry(req, &hbl->list, hash_node)
	194	seq_printf(m, " op=%d, task_works=%d\n", req->opcode,
	195	task_work_pending(req->task));
a4ad4f74 JA	196	}
a4ad4f74 JA	197
ea97cbeb JA	198	if (has_lock)
	199	mutex_unlock(&ctx->uring_lock);
	200
a4ad4f74	201	seq_puts(m, "CqOverflowList:\n");
38513c46	202	spin_lock(&ctx->completion_lock);
a4ad4f74 JA	203	list_for_each_entry(ocqe, &ctx->cq_overflow_list, list) {
	204	struct io_uring_cqe *cqe = &ocqe->cqe;
	205
	206	seq_printf(m, " user_data=%llu, res=%d, flags=%x\n",
	207	cqe->user_data, cqe->res, cqe->flags);
	208
	209	}
	210
	211	spin_unlock(&ctx->completion_lock);
	212	}
a4ad4f74	213	#endif