mirror of
https://github.com/torvalds/linux.git
synced 2024-11-10 14:11:52 +00:00
414d0f45c3
Currently lists are being used to manage this, but best practice is usually to have these in an array instead as that it cheaper to manage. Outside of that detail, games are also played with KASAN as the list is inside the cached entry itself. Finally, all users of this need a struct io_cache_entry embedded in their struct, which is union'ized with something else in there that isn't used across the free -> realloc cycle. Get rid of all of that, and simply have it be an array. This will not change the memory used, as we're just trading an 8-byte member entry for the per-elem array size. This reduces the overhead of the recycled allocations, and it reduces the amount of code code needed to support recycling to about half of what it currently is. Signed-off-by: Jens Axboe <axboe@kernel.dk>
12 lines
347 B
C
12 lines
347 B
C
// SPDX-License-Identifier: GPL-2.0
|
|
|
|
struct uring_cache {
|
|
struct io_uring_sqe sqes[2];
|
|
};
|
|
|
|
int io_uring_cmd(struct io_kiocb *req, unsigned int issue_flags);
|
|
int io_uring_cmd_prep(struct io_kiocb *req, const struct io_uring_sqe *sqe);
|
|
|
|
bool io_uring_try_cancel_uring_cmd(struct io_ring_ctx *ctx,
|
|
struct task_struct *task, bool cancel_all);
|