# Dataflow Analyses and Compiler Optimizations that Use Them, for Free

DevFeed: [Dataflow Analyses and Compiler Optimizations that Use Them, for Free](<https://devfeed.tech/articles/dataflow-analyses-and-compiler-optimizations-that-use-them-for-free-39751.md>)

Original publisher: [Read original article](<https://blog.regehr.org/archives/2578>)

Author: regehr

Published: 2024-04-20T21:55:33Z

Content type: article

Language: en

Sources: [Embedded in Academia](<https://devfeed.tech/sources/embedded-in-academia.md>)

Topics: [Compiler](<https://devfeed.tech/topics/compiler.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [LLVM](<https://devfeed.tech/topics/llvm.md>), [gcc](<https://devfeed.tech/topics/gcc.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [compiler-optimization](<https://devfeed.tech/tags/compiler-optimization.md>), [gcc](<https://devfeed.tech/tags/gcc.md>), [llvm](<https://devfeed.tech/tags/llvm.md>), [uncategorized](<https://devfeed.tech/tags/uncategorized.md>)

## AI overview

The article discusses slow compiler evolution and proposes a self-improving compiler loop based on superoptimization, generalization, and benchmark suites. It then considers extending the approach to dataflow analyses, including integer range analysis and known-bits analysis used by optimizing compilers.

## Source excerpt

Compilers can be improved over time, but this is a slow process. "Proebsting's Law" is an old joke which suggested that advances in compiler optimization will double the speed of a computation every 18 years -- but if anything this is optimistic. Slow compiler evolution is never a good thing, but this is particularly problematic [...]