| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | ir: move some filluses() to ir.c, rename optmem.c -> mem2reg.c | 2025-12-19 | 1 | -345/+0 | |
| | | |||||
| * | bitset: better implementation of bsiter() and stuff | 2025-12-16 | 1 | -1/+1 | |
| | | | | | Also changed the type to size_t for portability | ||||
| * | mem2reg: fix obvious inefficiency | 2025-12-16 | 1 | -16/+10 | |
| | | | | | | | | deltrivialphis() was iterating over every variably instead of just looking at the variable being examined. And I'd been wondering why mem2reg was such a bottleneck for a testcase like sqlite3 amalgamation.. it's easy to miss the forest for the trees. | ||||
| * | rename arraylength macro -> countof | 2025-12-11 | 1 | -1/+1 | |
| | | |||||
| * | ir: barebones IR passes checked contracts | 2025-11-21 | 1 | -1/+2 | |
| | | |||||
| * | change op names to match 285063eba44 | 2025-11-21 | 1 | -21/+21 | |
| | | |||||
| * | rename IR classes to reflect bitsize | 2025-11-21 | 1 | -7/+7 | |
| | | |||||
| * | mem2reg: implement marker algorithm from Braun et al | 2025-11-21 | 1 | -8/+40 | |
| | | |||||
| * | mem2reg: store pending phis implicitly | 2025-11-21 | 1 | -12/+8 | |
| | | |||||
| * | mem2reg: fix edgecase.. | 2025-11-19 | 1 | -1/+1 | |
| | | |||||
| * | debug output to stdout | 2025-11-19 | 1 | -1/+1 | |
| | | |||||
| * | mem2reg: handle uses in branches in cmpuse() | 2025-11-12 | 1 | -0/+2 | |
| | | |||||
| * | mem2reg: sort variable uses to match source order.. | 2025-11-12 | 1 | -0/+21 | |
| | | |||||
| * | amd64: fix aggregate abi stuff;; ir: fold, peephole optimizing constructors | 2025-11-05 | 1 | -0/+14 | |
| | | |||||
| * | mem2reg ssa construction silly optimization | 2025-10-24 | 1 | -1/+1 | |
| | | |||||
| * | Organize source files into directories | 2025-10-19 | 1 | -0/+285 | |
 |
index : antcc | |
| A little C compiler |
| aboutsummaryrefslogtreecommitdiffhomepage |