A small case study in compiler optimization of loops using pointers calling functions.
Compilers can't optimize loops with function calls (unknown side effects); `restrict` eliminates redundant memory dereferences per iteration. In library code and hot paths, `restrict` on pointers delivers measurable throughput gains — a zero-cost keyword that compounds at scale.
Introduction
While all code should be efficient, code for library-like components, especially involving loops, should be as efficient as possible since such code is often widely used.
In my A Simple Dynamic Array for C, I included the source code for a function to clean-up a dynamic array:
void array_cleanup( array_t *array, array_free_fn_t free_fn ) {
if ( array == NULL )
A full implementation of a simple dynamic array for C.
Preface Link to the repository containing all examples Back when I was at my first class...
` A hands-on guide to one of the most powerful algorithmic patterns you'll use every week — with real...
Post 2 of the Dynamic Arrays in C series · Full source code Where We Left Off In Post 1...
Introduction: Bridging the Gap Between JavaScript Object References and C Pointers The...
How I optimized my JIT compiler arithmetic, replacing division and modulo instructions with lookup tables and bitwise operations.
