Interprocedural Sparse Conditional Type Propagation
(railsatscale.com)
It’s 11 o’clock. Do you know where your variables are pointing?
It’s 11 o’clock. Do you know where your variables are pointing?
I spent 181 minutes waiting for the Zig compiler this week
(zackoverflow.dev)
TLDR; The Zig compiler takes about 1 minute and 30 seconds to compile debug builds of Bun. Zig's language server doesn't do basic things like type-checking, so often have to run the compiler to see if my code works.
TLDR; The Zig compiler takes about 1 minute and 30 seconds to compile debug builds of Bun. Zig's language server doesn't do basic things like type-checking, so often have to run the compiler to see if my code works.
An Attempt to Catch Up with JITs: The False Lead of Optimizing Inline Caches
(programming-journal.org)
Is it possible to improve the performance of AoT compilers by adding Dynamic Binary Modification (DBM) to the executions?
Is it possible to improve the performance of AoT compilers by adding Dynamic Binary Modification (DBM) to the executions?
Smallest Hello World in Various Languages and Compilers
(drewdevault.com)
Let’s say you ask your programming language to do the simplest possible task: print out “hello world”. Generally this takes two syscalls: write and exit. The following assembly program is the ideal Linux x86_64 program for this purpose. A perfect compiler would emit this hello world program for any language.
Let’s say you ask your programming language to do the simplest possible task: print out “hello world”. Generally this takes two syscalls: write and exit. The following assembly program is the ideal Linux x86_64 program for this purpose. A perfect compiler would emit this hello world program for any language.
If C++ cmpler became smarter would't be opinionated as rust borrowchecker?
(ycombinator.com)
I'm not well versed with either language as I was reading the article published https://cacm.acm.org/blogcacm/21st-century-c/<p>I suddenly thought of the forward looking trajectory of the idea of making c++ compiler smart(er) as to ease the burden of memory copying (section 3) with zero overhead. If one traces this arc it means that one day c++ compilers would be equivalent to the borrow checker?
I'm not well versed with either language as I was reading the article published https://cacm.acm.org/blogcacm/21st-century-c/<p>I suddenly thought of the forward looking trajectory of the idea of making c++ compiler smart(er) as to ease the burden of memory copying (section 3) with zero overhead. If one traces this arc it means that one day c++ compilers would be equivalent to the borrow checker?
Flattening ASTs and other compiler data structures (2023)
(cs.cornell.edu)
Arenas, a.k.a. regions, are everywhere in modern language implementations. One form of arenas is both super simple and surprisingly effective for compilers and compiler-like things. Maybe because of its simplicity, I haven’t seen the basic technique in many compiler courses—or anywhere else in a CS curriculum for that matter. This post is an introduction to the idea and its many virtues.
Arenas, a.k.a. regions, are everywhere in modern language implementations. One form of arenas is both super simple and surprisingly effective for compilers and compiler-like things. Maybe because of its simplicity, I haven’t seen the basic technique in many compiler courses—or anywhere else in a CS curriculum for that matter. This post is an introduction to the idea and its many virtues.
You can use C-Reduce for any language
(bernsteinbear.com)
C-Reduce is a tool by Regehr and friends for minimizing C compiler bug reproducers.
C-Reduce is a tool by Regehr and friends for minimizing C compiler bug reproducers.
Ubuntu Praises 5~7% PGO Compiler Optimization Performance Benefits
(phoronix.com)
Over the past year we have seen Canonical engineers focus more on optimizing the performance potential of Ubuntu Linux.
Over the past year we have seen Canonical engineers focus more on optimizing the performance potential of Ubuntu Linux.
Scalable self-improvement for compiler optimization
(research.google)
We introduce Iterative BC-Max, a novel technique that aims to reduce the size of the compiled binary files by improving inlining decisions. We describe several benefits to using this approach compared to using off-the-shelf RL algorithms.
We introduce Iterative BC-Max, a novel technique that aims to reduce the size of the compiled binary files by improving inlining decisions. We describe several benefits to using this approach compared to using off-the-shelf RL algorithms.