ziglang/zig
259
6.0k
Fork
You've already forked zig
771

std.Io.Evented (io_uring): consider registered/fixed buffers for Reader/Writer fill paths #35734

Open
opened 2026年06月11日 18:40:19 +02:00 by ruihe774 · 11 comments

The current read/write path of std.Io for the io_uring backend issues unregistered READ / READV / WRITE/ WRITEV SQEs with a caller-supplied buffer pointer and buf_index = 0. There's no use of registered/fixed buffers (IORING_REGISTER_BUFFERS + READ_FIXED/WRITE_FIXED).

Unregistered SQEs suffer from a performance penalty. For repeated I/O against a long-lived buffer, fixed buffers let the kernel skip per-op page pinning, which measurably reduces CPU for small/frequent I/O. Using registered SQEs could improve performance and is considered the expected model to use io_uring. A Reader's internal buffer looks like a near-ideal candidate: allocated once, reused across many fills, contiguous. My thought is that an API could be added to register an Io to the io_uring upfront.

I wanted to raise this as a possible optimization but also flag a design wrinkle I don't have a clean answer to: The backend uses per-thread rings plus a work-stealing scheduler (findReadyFiber/steal_ready_search). Registered-buffer tables are per-ring, and a buf_index is only valid on the ring it was registered against. If a fiber registers its buffer on thread A's ring and is later stolen by thread B, a READ_FIXED issued on B's ring would reference the wrong/unregistered slot. The ring init already does ATTACH_WQ, but that shares the worker pool, not the buffer table. A solution is to pin Io to its registered ring, but it works against the work-stealing design.

The current read/write path of `std.Io` for the io_uring backend issues unregistered `READ` / `READV` / `WRITE`/ `WRITEV` SQEs with a caller-supplied buffer pointer and `buf_index = 0`. There's no use of registered/fixed buffers (`IORING_REGISTER_BUFFERS` + `READ_FIXED`/`WRITE_FIXED`). Unregistered SQEs suffer from a performance penalty. For repeated I/O against a long-lived buffer, fixed buffers let the kernel skip per-op page pinning, which measurably reduces CPU for small/frequent I/O. Using registered SQEs could improve performance and is considered the expected model to use io_uring. A `Reader`'s internal buffer looks like a near-ideal candidate: allocated once, reused across many fills, contiguous. My thought is that an API could be added to register an `Io` to the io_uring upfront. I wanted to raise this as a possible optimization but also flag a design wrinkle I don't have a clean answer to: The backend uses per-thread rings plus a work-stealing scheduler (`findReadyFiber`/`steal_ready_search`). Registered-buffer tables are per-ring, and a `buf_index` is only valid on the ring it was registered against. If a fiber registers its buffer on thread A's ring and is later stolen by thread B, a `READ_FIXED` issued on B's ring would reference the wrong/unregistered slot. The ring init already does `ATTACH_WQ`, but that shares the worker pool, not the buffer table. A solution is to pin `Io` to its registered ring, but it works against the work-stealing design.
Contributor
Copy link

A solution is to pin Io to its registered ring, but it works against the work-stealing design.

Side-tracking a bit here, but in general I think work-stealing tradeoffs are tricky when you're building a general-case abstraction and have no idea what the workload patterns really look like at runtime. I also think it goes against the general grain of ZIg's usual explicitness.

I tend to think there will be many cases where software wants precise control (or at least, predictability) in the mapping of tasks/work -> threads/rings, and even to control/pin the mapping of threads/rings to CPU cores and/or NUMA domains for higher-performance software, and we shouldn't have to exit the realm of std.Io to do so.

For the simpler case of Threaded, if work-stealing is an option that can be turned off (last I checked it doesn't exist yet, but I think it's planned!), then io.concurrent() explicitly and predictably makes new threads, which is good enough (cpu or numa pinning can then be handled even today with early OS-specific calls within the threads, or later abstracted if possible?).

For a backend like Uring, support for something similar is trickier to design. InitOptions could carry some parameters about mapping threads -> cpus and/or numas, but we'd also need a way to specify a target thread(/ring) when calling some equivalent of io.concurrent(). Another option is just to have two different Uring backends: one that's general-purpose/automagic/work-stealing, and one that's built for explicit control: pinning threads, assigning concurrent tasks to specific threads/rings, registered buffers, etc.

> A solution is to pin Io to its registered ring, but it works against the work-stealing design. Side-tracking a bit here, but in general I think work-stealing tradeoffs are tricky when you're building a general-case abstraction and have no idea what the workload patterns really look like at runtime. I also think it goes against the general grain of ZIg's usual explicitness. I tend to think there will be many cases where software wants precise control (or at least, predictability) in the mapping of tasks/work -> threads/rings, and even to control/pin the mapping of threads/rings to CPU cores and/or NUMA domains for higher-performance software, and we shouldn't have to exit the realm of std.Io to do so. For the simpler case of Threaded, if work-stealing is an option that can be turned off (last I checked it doesn't exist yet, but I think it's planned!), then `io.concurrent()` explicitly and predictably makes new threads, which is good enough (cpu or numa pinning can then be handled even today with early OS-specific calls within the threads, or later abstracted if possible?). For a backend like Uring, support for something similar is trickier to design. InitOptions could carry some parameters about mapping threads -> cpus and/or numas, but we'd also need a way to specify a target thread(/ring) when calling some equivalent of `io.concurrent()`. Another option is just to have two different `Uring` backends: one that's general-purpose/automagic/work-stealing, and one that's built for explicit control: pinning threads, assigning concurrent tasks to specific threads/rings, registered buffers, etc.

I'm considering this and cannot think of a reason why Uring has to use a multithread and work-stealing design. Maybe I lack of some previous knowledge and information but I believe one uring can already handle submissions from concurrent sources. Submissions are in batch and non-blocking. And anyway the kernel is managing a thread pool for IO works if needed. I don't think there's a bottleneck or architectural requirement here forcing the backend to use multiple urings. As the SQE queue is just a memory space, multiple threads can write SQEs to it in a atomic lock-free way and let a dedicated thread to submit and reap them.

I'm considering this and cannot think of a reason why Uring has to use a multithread and work-stealing design. Maybe I lack of some previous knowledge and information but I believe one uring can already handle submissions from concurrent sources. Submissions are in batch and non-blocking. And anyway the kernel is managing a thread pool for IO works if needed. I don't think there's a bottleneck or architectural requirement here forcing the backend to use multiple urings. As the SQE queue is just a memory space, multiple threads can write SQEs to it in a atomic lock-free way and let a dedicated thread to submit and reap them.

For sharing the buffer registration across multiple urings, Linux 6.12 has introduced io_uring_clone_buffers. This is more handy than manually registering buffers in different urings.

For sharing the buffer registration across multiple urings, Linux 6.12 has introduced io_uring_clone_buffers. This is more handy than manually registering buffers in different urings.
Contributor
Copy link

@ruihe774 wrote in #35734 (comment):

I'm considering this and cannot think of a reason why Uring has to use a multithread and work-stealing design.

Well, a couple of points here re threading:

  • Not every kind of "I/O" will always be covered by io_uring. So the Uring abstraction would probably need some level of threading just to be able to abstract blocking non-ring calls regardless.
  • In the kinds of "high perf network server" sorts of environments I'm talking about re: cpu pinning, you'd want multiple rings anyways (one per thread). The idea is that setup code (both in the application, and outside at the system level) may want to arrange to use NIC steering efficiently. You can program NIC hardware, for instance, to split (by e.g. hashing on source IPs) all the incoming traffic into, say, 16 separate queues, and you can set up mapping so that you have 16 identical listening socket copies, each of which is bound to a specific queue, which is bound to a specific IRQ, which is all bound to a specific CPU core where you have a dedicated Thread for that socket (and if using io_uring, then a dedicated ring for this Thread). This keeps all the traffic local to a specific CPU core and scales ~linearly as strategy for handling large-scale traffic efficiently.
@ruihe774 wrote in https://codeberg.org/ziglang/zig/issues/35734#issuecomment-17512697: > I'm considering this and cannot think of a reason why Uring has to use a multithread and work-stealing design. Well, a couple of points here re threading: * Not every kind of "I/O" will always be covered by io_uring. So the Uring abstraction would probably need some level of threading just to be able to abstract blocking non-ring calls regardless. * In the kinds of "high perf network server" sorts of environments I'm talking about re: cpu pinning, you'd want multiple rings anyways (one per thread). The idea is that setup code (both in the application, and outside at the system level) may want to arrange to use NIC steering efficiently. You can program NIC hardware, for instance, to split (by e.g. hashing on source IPs) all the incoming traffic into, say, 16 separate queues, and you can set up mapping so that you have 16 identical listening socket copies, each of which is bound to a specific queue, which is bound to a specific IRQ, which is all bound to a specific CPU core where you have a dedicated Thread for that socket (and if using io_uring, then a dedicated ring for this Thread). This keeps all the traffic local to a specific CPU core and scales ~linearly as strategy for handling large-scale traffic efficiently.

In the kinds of "high perf network server" sorts of environments I'm talking about re: cpu pinning, you'd want multiple rings anyways (one per thread).

I think buffer registration can be easily implemented if cpu pinning is implemented. We only need to register the buffers to the pinned ring then

> In the kinds of "high perf network server" sorts of environments I'm talking about re: cpu pinning, you'd want multiple rings anyways (one per thread). I think buffer registration can be easily implemented if cpu pinning is implemented. We only need to register the buffers to the pinned ring then
Contributor
Copy link

In zio, I have a flag that disallows tasks to migrate across threads, so it is possible to have both models in a single codebase.

However, registered buffers are a problem for the std.Io API, which is really designed to work over user-provided buffers. I don't see how this could be integrated cleanly, unless you abandon the concept of std.Io.Reader/Writer which I think would be a bad decision. In my opinion, if you need optimizations like zero-copy io_uring, you should use io_uring directly, not via the std.Io interface.

In zio, I have a flag that disallows tasks to migrate across threads, so it is possible to have both models in a single codebase. However, registered buffers are a problem for the `std.Io` API, which is really designed to work over user-provided buffers. I don't see how this could be integrated cleanly, unless you abandon the concept of `std.Io.Reader/Writer` which I think would be a bad decision. In my opinion, if you need optimizations like zero-copy io_uring, you should use io_uring directly, not via the `std.Io` interface.

However, registered buffers are a problem for the std.Io API, which is really designed to work over user-provided buffers. I don't see how this could be integrated cleanly, unless you abandon the concept of std.Io.Reader/Writer which I think would be a bad decision. In my opinion, if you need optimizations like zero-copy io_uring, you should use io_uring directly, not via the std.Io interface.

The buffers are managed by std.Io interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes.

> However, registered buffers are a problem for the `std.Io` API, which is really designed to work over user-provided buffers. I don't see how this could be integrated cleanly, unless you abandon the concept of `std.Io.Reader/Writer` which I think would be a bad decision. In my opinion, if you need optimizations like zero-copy io_uring, you should use io_uring directly, not via the `std.Io` interface. The buffers are managed by `std.Io` interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes.
Contributor
Copy link

@ruihe774 wrote in #35734 (comment):

The buffers are managed by std.Io interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes.

Are you familiar with the API? Users provide buffers when doing stream.reader(io, buf). How you make it work with managed buffers? Copy from the managed ones to the user ones? Ignore the user ones?

@ruihe774 wrote in https://codeberg.org/ziglang/zig/issues/35734#issuecomment-17862197: > The buffers are managed by `std.Io` interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes. Are you familiar with the API? Users provide buffers when doing `stream.reader(io, buf)`. How you make it work with managed buffers? Copy from the managed ones to the user ones? Ignore the user ones?

@lukasl wrote in #35734 (comment):

@ruihe774 wrote in #35734 (comment):

The buffers are managed by std.Io interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes.

Are you familiar with the API? Users provide buffers when doing stream.reader(io, buf). How you make it work with managed buffers? Copy from the managed ones to the user ones? Ignore the user ones?

Let me clarify it. What I meant is that the buffers are managed by Reader & Writer after they were used to initialize them. So it's possible to make the buffers registered within the lifetime of Reader & Writer. And, alternative initialization methods can be added to have Reader & Writer created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs.

@lukasl wrote in https://codeberg.org/ziglang/zig/issues/35734#issuecomment-17874431: > @ruihe774 wrote in #35734 (comment): > > > The buffers are managed by `std.Io` interfaces, not supplied by the user. So I think registration can be done transparently or semi-transparently without major API changes. > > Are you familiar with the API? Users provide buffers when doing `stream.reader(io, buf)`. How you make it work with managed buffers? Copy from the managed ones to the user ones? Ignore the user ones? Let me clarify it. What I meant is that the buffers are managed by `Reader` & `Writer` *after* they were used to initialize them. So it's possible to make the buffers registered within the lifetime of `Reader` & `Writer`. And, alternative initialization methods can be added to have `Reader` & `Writer` created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs.
Contributor
Copy link

@ruihe774 wrote in #35734 (comment):

Let me clarify it. What I meant is that the buffers are managed by Reader & Writer after they were used to initialize them. So it's possible to make the buffers registered within the lifetime of Reader & Writer. And, alternative initialization methods can be added to have Reader & Writer created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs.

But this would essentially mean "WriterGate v2.0". I don't know if that's justifiable, especially now that the std.Io.Uring backend doesn't even work properly. Maybe finishing it up should come first, and then decide if it makes sense to break the reader/writer interface in order to support managed buffers.

@ruihe774 wrote in https://codeberg.org/ziglang/zig/issues/35734#issuecomment-17874788: > Let me clarify it. What I meant is that the buffers are managed by `Reader` & `Writer` _after_ they were used to initialize them. So it's possible to make the buffers registered within the lifetime of `Reader` & `Writer`. And, alternative initialization methods can be added to have `Reader` & `Writer` created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs. But this would essentially mean "WriterGate v2.0". I don't know if that's justifiable, especially now that the `std.Io.Uring` backend doesn't even work properly. Maybe finishing it up should come first, and then decide if it makes sense to break the reader/writer interface in order to support managed buffers.

@lukasl wrote in #35734 (comment):

@ruihe774 wrote in #35734 (comment):

Let me clarify it. What I meant is that the buffers are managed by Reader & Writer after they were used to initialize them. So it's possible to make the buffers registered within the lifetime of Reader & Writer. And, alternative initialization methods can be added to have Reader & Writer created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs.

But this would essentially mean "WriterGate v2.0". I don't know if that's justifiable, especially now that the std.Io.Uring backend doesn't even work properly. Maybe finishing it up should come first, and then decide if it makes sense to break the reader/writer interface in order to support managed buffers.

Yes, new methods are required in the vtable. But the downstream APIs of Reader & Writer can remain unchanged.

@lukasl wrote in https://codeberg.org/ziglang/zig/issues/35734#issuecomment-17887760: > @ruihe774 wrote in #35734 (comment): > > > Let me clarify it. What I meant is that the buffers are managed by `Reader` & `Writer` _after_ they were used to initialize them. So it's possible to make the buffers registered within the lifetime of `Reader` & `Writer`. And, alternative initialization methods can be added to have `Reader` & `Writer` created with buffers owned and registered, so further IO performed on the interfaces can be done using indexed SQEs. > > But this would essentially mean "WriterGate v2.0". I don't know if that's justifiable, especially now that the `std.Io.Uring` backend doesn't even work properly. Maybe finishing it up should come first, and then decide if it makes sense to break the reader/writer interface in order to support managed buffers. Yes, new methods are required in the vtable. But the downstream APIs of `Reader` & `Writer` can remain unchanged.
Sign in to join this conversation.
No Branch/Tag specified
master
elfv2
spork8
restricted
0.16.x
panic-rewrite
parking-futex-lockfree
windows-Io-cleanup
Io-watch
ParseCommandLineOptions
windows-async-files
poll-ring
debug-file-leaks-differently
debug-file-leaks
ProcessPrng
elfv2-dyn
jobserver
threadtheft
io-threaded-no-queue
0.15.x
Io.net
comptime-allocator
restricted-function-pointers
cli
wasm-linker-writer
wrangle-writer-buffering
sha1-stream
async-await-demo
fixes
0.14.x
ast-node-methods
macos-debug-info
make-vs-configure
fuzz-macos
sans-aro
ArrayList-reserve
incr-bug
llvm-ir-nosanitize-metadata
ci-tarballs
ci-scripts
threadpool
0.12.x
new-pkg-hash
json-diagnostics
more-doctests
rework-comptime-mutation
0.11.x
ci-perf-comment
stage2-async
0.10.x
autofix
0.9.x
aro
hcs
0.8.x
0.7.x
0.16.0
0.15.2
0.15.1
0.15.0
0.14.1
0.14.0
0.12.1
0.13.0
0.12.0
0.11.0
0.10.1
0.10.0
0.9.1
0.9.0
0.8.1
0.8.0
0.7.1
0.7.0
0.6.0
0.5.0
0.4.0
0.3.0
0.2.0
0.1.1
0.1.0
Labels
Clear labels
abi/f32
abi/ilp32
abi/sf
accepted
This proposal is planned.
arch/21k
arch/6502
arch/aarch64
arch/alpha
arch/amdgcn
arch/arc
arch/arc32
arch/arc64
arch/arm
arch/avr
arch/bfin
arch/bpf
arch/colossus
arch/cris
arch/csky
arch/dlx
arch/epiphany
arch/fr30
arch/frv
arch/hexagon
arch/hppa
arch/hppa64
arch/ia64
arch/kalimba
arch/kvx
arch/lanai
arch/lm32
arch/loongarch32
arch/loongarch64
arch/m32r
arch/m68k
arch/m88k
arch/mcore
arch/microblaze
arch/mips
arch/mips64
arch/mmix
arch/moxie
arch/mrisc32
arch/msp430
arch/nds32
arch/ns32k
arch/nvptx
arch/or1k
arch/powerpc
arch/powerpc64
arch/propeller
arch/riscv32
arch/riscv64
arch/rl78
arch/rx
arch/s390x
arch/sh
arch/sparc
arch/sparc64
arch/spirv
arch/spu
arch/tricore
arch/v850
arch/vax
arch/vc4
arch/ve
arch/wasm
arch/x86
arch/x86_64
arch/xcore
arch/xtensa
autodoc
The web application for interactive documentation and generation of its assets.
backend/c
The C backend outputs C source code.
backend/llvm
The LLVM backend outputs an LLVM bitcode module.
backend/self-hosted
The self-hosted backends produce machine code directly.
binutils
Zig's included binary utilities: zig ar, zig dlltool, zig lib, zig ranlib, zig objcopy, and zig rc.
breaking
Implementing this issue could cause existing code to no longer compile or have different behavior.
build system
The Zig build system - zig build, std.Build, the build runner, and package management.
debug info
An issue related to debug information (e.g. DWARF) produced by the Zig compiler.
docs
An issue with documentation, e.g. the language reference or standard library doc comments.
error message
This issue points out an error message that is unhelpful and should be improved.
frontend
Tokenization, parsing, AstGen, ZonGen, Sema, Legalize, and Liveness.
fuzzing
An issue related to Zig's integrated fuzz testing.
incremental
Reuse of internal compiler state for faster compilation.
lib/c
This issue relates to Zig's libc implementation and/or vendored libcs.
lib/compiler-rt
This issue relates to Zig's compiler-rt library.
lib/cxx
This issue relates to Zig's vendored libc++ and/or libc++abi.
lib/std
This issue relates to Zig's standard library.
lib/tsan
This issue relates to Zig's vendored libtsan.
lib/ubsan-rt
This issue relates to Zig's ubsan-rt library.
lib/unwind
This issue relates to Zig's vendored libunwind.
linking
Zig's integrated object file and incremental linker.
miscompilation
The compiler reports success but produces semantically incorrect code.
os/android
os/contiki
os/dragonfly
os/driverkit
os/emscripten
os/freebsd
os/fuchsia
os/haiku
os/hermit
os/hurd
os/illumos
os/ios
os/linux
os/maccatalyst
os/macos
os/managarm
os/netbsd
os/ohos
os/openbsd
os/plan9
os/redox
os/rtems
os/serenity
os/tvos
os/uefi
os/visionos
os/wasi
os/watchos
os/windows
proposal
This issue suggests language modifications. If it also has the "accepted" label then it is planned.
release notes
This issue or pull request should be mentioned in the release notes.
testing
This issue is related to testing the compiler, standard library, or other parts of Zig.
zig cc
Zig as a drop-in C-family compiler.
zig fmt
The Zig source code formatter.
zig reduce
The Zig source code reduction tool.
bounty
https://ziglang.org/news/announcing-donor-bounties
bug
Observed behavior contradicts documented or intended behavior.
contributor-friendly
This issue is limited in scope and/or knowledge of project internals.
downstream
An issue with a third-party project that uses this project.
enhancement
Solving this issue will likely involve adding new logic or components to the codebase.
infra
An issue related to project infrastructure, e.g. continuous integration.
optimization
A task to improve performance and/or resource usage.
question
No questions on the issue tracker; use a community space instead.
regression
Something that used to work in a previous version stopped working
upstream
An issue with a third-party project that this project uses.
use case
Describes a real use case that is difficult or impossible, but does not propose a solution.
No labels
abi/f32
abi/ilp32
abi/sf
accepted
arch/21k
arch/6502
arch/aarch64
arch/alpha
arch/amdgcn
arch/arc
arch/arc32
arch/arc64
arch/arm
arch/avr
arch/bfin
arch/bpf
arch/colossus
arch/cris
arch/csky
arch/dlx
arch/epiphany
arch/fr30
arch/frv
arch/hexagon
arch/hppa
arch/hppa64
arch/ia64
arch/kalimba
arch/kvx
arch/lanai
arch/lm32
arch/loongarch32
arch/loongarch64
arch/m32r
arch/m68k
arch/m88k
arch/mcore
arch/microblaze
arch/mips
arch/mips64
arch/mmix
arch/moxie
arch/mrisc32
arch/msp430
arch/nds32
arch/ns32k
arch/nvptx
arch/or1k
arch/powerpc
arch/powerpc64
arch/propeller
arch/riscv32
arch/riscv64
arch/rl78
arch/rx
arch/s390x
arch/sh
arch/sparc
arch/sparc64
arch/spirv
arch/spu
arch/tricore
arch/v850
arch/vax
arch/vc4
arch/ve
arch/wasm
arch/x86
arch/x86_64
arch/xcore
arch/xtensa
autodoc
backend/c
backend/llvm
backend/self-hosted
binutils
breaking
build system
debug info
docs
error message
frontend
fuzzing
incremental
lib/c
lib/compiler-rt
lib/cxx
lib/std
lib/tsan
lib/ubsan-rt
lib/unwind
linking
miscompilation
os/android
os/contiki
os/dragonfly
os/driverkit
os/emscripten
os/freebsd
os/fuchsia
os/haiku
os/hermit
os/hurd
os/illumos
os/ios
os/linux
os/maccatalyst
os/macos
os/managarm
os/netbsd
os/ohos
os/openbsd
os/plan9
os/redox
os/rtems
os/serenity
os/tvos
os/uefi
os/visionos
os/wasi
os/watchos
os/windows
proposal
release notes
testing
zig cc
zig fmt
zig reduce
bounty
bug
contributor-friendly
downstream
enhancement
infra
optimization
question
regression
upstream
use case
Milestone
Clear milestone
No items
No milestone
Projects
Clear projects
No items
No project
Assignees
Clear assignees
No assignees
3 participants
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
ziglang/zig#35734
Reference in a new issue
ziglang/zig
No description provided.
Delete branch "%!s()"

Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?