u4 VS ccan

- https://github.com/xu4-engine/u4/tree/master/src/support

These include more exotic stuff like a grid based field-of-view calculation and a version of the sfxr synthesizer.

I've been stumped trying to figure out how to run xu4 on my Windows PC. I keep looking for a executable file but don't see any in the ZIP from https://github.com/xu4-engine/u4.

Hilarious!

But I remember the first time I saw such a program which never freed anything: jitterbug, the simple bug tracker which ran as a CGI script.

It indeed allows a very simple style!

Meanwhile, use ccan/tal (https://github.com/rustyrussell/ccan/blob/master/ccan/tal/_i...) and be happy :)

There's CCAN, maintained by kernel hacker Rusty Russell: http://ccodearchive.net/

Please note that the above link has been claimed by squatters and isn’t the right link for CCAN anymore! The maintainer suggests [1] just using the GitHub repo [2] instead.

[1] https://lists.ozlabs.org/pipermail/ccan/2022-September/00141...

[2] https://github.com/rustyrussell/ccan/

This is a great learning exercise but not very useful because using void* creates practical problems that the compiler cant help you with. IMHO, for a nice vector in C look at https://github.com/rustyrussell/ccan/blob/master/ccan/darray/darray.h

For more advanced intrusive lists in C, I've found that ccan's tlist2 (https://github.com/rustyrussell/ccan/blob/master/ccan/tlist2...) provides a decent model here.

Compared to the linux kernel's intrusive lists, it also tracks the offset of the list_node within the structure contained by the list, which eliminates another class of problems. It does still have the "using the iterator after the for loop is over" issue discussed in this article, but it also already tracks the types as Linus proposed doing in the article to resolve the issue.

ccan library https://github.com/rustyrussell/ccan I think it is used also in the linux kernel(?)

ccan (analagous to cpan, but for C rather than Perl.)

You could use a discriminated union in your list node. You could use a void pointer in your list node, allocate space as needed and memcpy the date into this space, or don't allocate and store pointers to the original data. You could use an intrusive list, like this.

The fallacy in the article is that anyone should code these functions. There's plenty of public domain libraries that do this correctly.

https://github.com/rustyrussell/ccan/blob/master/ccan/endian...