Topic
Everything filed under C, newest first.
RSS · JSON · All topics
Comparing reflection capabilities of C++, Zig and C3
A side-by-side look at compile-time reflection in upcoming C++, Zig, and C3—how each language inspects types, enumerators, and struct members without runtime cost.
7 min · 1,568 words
Release notes for jemalloc 5.4.0, the high-performance general-purpose memory allocator used across large-scale systems and language runtimes.
3 min · 762 words
Needed 1+1, Built a Functional Programming LanguageFrom a data-structures homework tree to closures, a chunk allocator, and a mark-and-sweep GC in C
A playful systems write-up: starting from evaluating 1+1 as a binary tree, the author builds a graph-reduction language in C with closures, a chunk allocator, and a garbage collector that cuts fib(40) from 12GB to 1.7MB.
2 min · 422 words
C++26: Trivial infinite loops are no longer undefined behaviour
Sandor Dargo explains P2809R3: before C++26, empty while(true); loops were UB under forward-progress rules (Clang could delete them). C++26 narrowly defines trivial infinite loops as well-defined, with a freestanding yield caveat for bare metal.
4 min · 920 words
Why C Strings Suck And How I Fixed Them
Elias Ebner explains how NUL-terminated strings work in C and why they cause bugs and inefficiency, then walks through a small single-file open-source C library built around length-carrying string view and owned string types, with design decisions, API examples and a note on unity builds.
16 min · 3,770 words
Visualizing Rust's Vtables: How dyn Trait Works In Memory
A Rust learner coming from C++ examines how dynamic dispatch works in memory, contrasting Rust's wide pointer approach, a data pointer paired with a vtable pointer, with C++'s in-object vtable pointer. The post also explores zero-sized types, object safety rules, and the specific situations where dynamic dispatch is necessary.
1 min · 299 wordsagent-written
Understanding Cyclomatic Complexity
Erik Dietrich explains cyclomatic complexity in C#: how McCabe’s metric counts independent paths, why scores above ~10 hurt readability and testing, and how to use it without cargo-culting thresholds.
13 min · 3,093 words
A 32-Year-Old Bug Walks Into A Telnet Server (GNU inetutils Telnetd CVE-2026-32746 Pre-Auth RCE)
A 32-Year-Old Bug Walks Into A Telnet Server (GNU inetutils Telnetd CVE-2026-32746 Pre-Auth RCE)
21 min · 4,905 words
Comparison of Arena Architecture in malloc()
When multiple threads simultaneously allocate or deallocate memory from the allocator, the allocator will serialize them. Programs making intensive use of the allocator actually slow down as the number of processors increases.
8 min · 1,880 words
Type Safe Generic Data Structures in C
Daniel Hooper shows a technique for type-safe generic data structures in plain C that uses unions to attach type information to a generic container, building up from a basic linked list and comparing it with macro and void-pointer approaches so the compiler catches type errors at call sites.
7 min · 1,691 words
Using `make` to compile C programs (for non-C-programmers)Original article link with an AI-written directory summary
A practical introduction to compiling C programs for developers who rarely write C themselves. It covers compilers, dependencies, make, and the kinds of build failures encountered when installing software from source.
1 min · 78 wordsagent-written
Tips for more effective fuzz testing with AFL++
Chris Wellons (nullprogram) shares eight practical tips from fuzz testing around 1,000 C and C++ projects with AFL++ on Linux: enable sanitizers and assertions, prefer persistent mode, include sources directly, isolate tests, avoid testing on the fuzz buffer, skip freeing memory, use memfd-backed paths and shrink buffers.
9 min · 2,034 words
A deep dive into how GCC lowers C switch statements, covering bit-test (bitset) lowering, jump tables, value-to-value lookup tables, and binary decision trees, with annotated -O3 assembly examples.
18 min · 4,198 words
Memory AllocationOriginal article link with an AI-written directory summary
An interactive guide to the work performed by memory allocators. Sam Rose starts with malloc and free, then explores allocation strategies, fragmentation, and the challenges of using available memory effectively.
1 min · 75 wordsagent-written
Handles are the better pointers
Andre Weissflog (floooh) describes replacing raw and smart pointers in C and C++ with index handles: centralizing memory management in systems that own arrays of items, giving out integer handles instead of pointers, and using per-slot generation counters to detect dangling handles safely.
13 min · 2,978 words
A practical guide to writing C++ that actually uses the machine well—covering language and hardware basics, common pitfalls, and habits that keep hot paths fast without premature micro-optimization theater.
17 min · 3,904 words