Is there any chance to modify Vyukov's MPMC queue implement (https://www.1024cores.net/home/lock-free-algorithms/queues/b...) to support drop handler? That work doesn't need 128 bit CAS.
Readit Newsxavierxwang commented on Put a ring on it: a lock-free MPMC ring buffer h4x0r.org/ring/... · Posted by u/signa11
xavierxwang commented on Put a ring on it: a lock-free MPMC ring buffer h4x0r.org/ring/... · Posted by u/signa11
I wrote my first SPSC circular buffer implementation in TS upon reading the previous post on futex [0] from the same author. It was more intricate than it had seemed, until I finally sat down and wrote my own code.
[0]: https://h4x0r.org/futex/ discussion: https://news.ycombinator.com/item?id=44951563
FYI: I have made a SPSC circular buffer for swap data in a pair of process: https://github.com/starwing/kaze-core
maybe that is what you want.
I spent a month porting Rust's Ariadne diagnostic renderer to C,
with Claude as a pair programming partner. The project taught me
a lot about working with LLMs on real system programming tasks -
what works, what doesn't, and where human expertise still matters.
In JS ecosystem, buffers that allow data loss is more common (aka ring buffers), but ringbuf.js [1] is the only complete implementation to my knowledge. In my use case on I/O between WASM modules where data must be transferred as-is, the process must block on buffer overrun/underrun in a synchronous manner. Therefore a circular buffer is required. I could not find such a niche library written in JS, so I decided to bite the bullet and reinvent the wheel [2].
[1]: https://github.com/padenot/ringbuf.js
[2]: https://github.com/andy0130tw/spsc
Btw, kaze-core uses a `used` atomic variable, to avoid reading both readPos/writePos in routine - they are not atomic at all.