raible

I use something like this to turn __VA_ARGS__ into count/pointer:

  // Create a stack-allocated argv from N args gcc, clang, tcc, mingw, msvc, etc
  // argc is always correct, for portability argv has a dummy element when argc==0
  // This avoids problematic 0-length compound literal arrays.
  #define _ARG_CV(type, ...)  _ARG_CV1(((type []){0, __VA_ARGS__}))
  #define _ARG_CV1(array)     _ALEN(array) - 1, array + (_ALEN(array) > 1)
  #define _ALEN(array)         sizeof array / sizeof *array

Then it's just:

  #define sum(...) sum(_ARG_CV(int, __VA_ARGS__))

I'm working on a PEG-based Turing complete language. It is self-hosted, generates standalone/embedable C, is reasonably small, and comes with a fully-featured REPL. It has only a single keyword: "macro". Feel free to reach out if interested.

Weed + tree = bong!

Getting rear-ended is almost always the other driver's fault, but 7 years ago I was involved in a serious accident (minor injuries, both cars totaled) when the driver in the fast lane decided to pull over and pick up a hitchhiker. Crossed over two lanes, hard on the brakes, and I had no chance to even get off the gas.

The responsibility was 100% his because of "an unsafe lane change".

Well, maybe. I for one _absolutely_ didn't participate b.c. I didn't want my DNA and personally identifying information owned by any company. I can't imagine that there aren't many others like me.

I would, however, love to send my DNA to a company if they could provide the results without knowing any information about me whatsoever. For instance: I would be more than willing to buy the kit with cash and send it back with a burner email. Has anyone heard of such a service?

It's hard to imagine either Linux or Git if Ken Thompson and Dennis Ritchie hadn't laid the foundation.

Not exactly a diet tip, but first thing every day (after stretching) I drink a large glass of water (16oz), drink another large glass with a tablespoon or so of psyllium husk, then another large glass of water. Then whatever breakfast I feel like. Psyllium is cheap, safe, and readily available (and most of us should be eating more fiber, right?).

I've had great success with a fourth way: my project language compiles to C, which is loaded at runtime with libtcc (specifically: git://repo.or.cz/tinycc). I've gone down the .so/.dll route a few times in the past, but I can safely say: never again. libtcc has the advantages of a jit (native C speed), but with an elegant API and laudable portability.

This is an awesome project. In the video you mention that you might drop it... please don't!

Thanks for that, it's what I had hoped for (but again, have not yet measured).

It seems to me it's a super-handy way of "modifying" a compiler-allocated array of structs. I'm sticking with it!

FWIW I usefully use a "fake" linked list by adding a .next field to the struct in a compiler-allocated array of structs. On initialization I set the list head to &item[0], and in a trivial loop set the .next field of each entry (except the last) to entry+1.

Why bother? Because I can then easily add a few extra structs to the beginning of the (contiguously-allocated) linked-list without having to reallocate the whole thing.

Sure, pointer chasing with separately allocated structs is "slow", but I haven't yet measured to see if it's any different when (almost all) items are contiguous.

If you would... - what sort of cache behavior should one expect of this on a modern laptop CPU? - I haven't seen this approach before, have you?

Thanks for asking!

I've been working on a PEG-based Turing-complete language which creates completely standalone and trivially-embedded C. The "selling point" would be "A DSL for creating DSLs".

In the last few weeks I've been working on a libtcc-based add-on in order to build a REPL to help create/explore a desired grammar interactively.