Onion VS ck

I've also recently fallen into (reading/watching about) it, and from what I've seen, some of them have really impressive levels of community software support

e.g. https://onionui.github.io

OnionOS is your best choice. It's as simple as dropping the files onto your SD card. Then, moving your game files to their respective folders. Here is a video guide. Here is the official page with download and any information you would need. If you're still using the stock card, I'd highly recommend getting a better quality one so that you don't lose all your data again.

Download Onion OS to your computer. Onion OS is available from the link below: https://onionui.github.io/

Update PixelReader to v0.6 by @Aemiii91 in #1208

(Please note that I am using Onion OS V4.2.0-RC, if you are using other version, it may not work.

I followed the instructions from here and used the specialized software. It's a Samsung Pro Evo SD card bought in an official store and the reduction is completely reversible by using the Windows formatter. I don't really mind that much, but am wondering if I didn't noob myself out of twice as much space!

Maybe I'm missing something, but x is not volatile and the compiler is free to assume that it is not modified concurrently outside the bounds of C's memory model. Compilers can and do hoist out loop invariants, and https://github.com/concurrencykit/ck/commit/b54ae5c4ace9b94442bbb46858449069f566d269 seems like an example of compilers doing what you say they don't. What am I missing?

Recommend checking out http://concurrencykit.org instead.

If you're interested in how other approaches work, or how one achieves concurrency on shared mutable state without mutual exclusion, would recommend checking out concurrency kit.

There are plenty of practical solutions to the safe memory reclamation problem in C. The language just doesn't force one on you.

From epoch-based reclamation (https://github.com/concurrencykit/ck/blob/master/include/ck_..., especially with the multiplexing extension to Fraser's classic scheme), to quiescence schemes (https://liburcu.org/), or hazard pointers (https://github.com/facebook/folly/blob/master/folly/synchron..., or https://pvk.ca/Blog/2020/07/07/flatter-wait-free-hazard-poin...)... or even simple using a type-stable (https://www.usenix.org/legacy/publications/library/proceedin...) memory allocator.

In my experience, it's easier to write code that is resilient to hiccups in C than in Java. Solving SMR with GC only offers something close to lock-freedom when you can guarantee global GC pauses are short enough... and common techniques to bound pauses, like explicitly managed freelists land you back in the same problem space as C.

ck - Concurrency primitives, safe memory reclamation mechanisms and non-blocking data structures. BSD-2-Clause

Indeed they do, https://github.com/concurrencykit/ck