| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | irsimpl: optimize away cond branches after constant propagation | 2026-01-07 | 1 | -21/+69 | |
| | | |||||
| * | basic CSE | 2026-01-04 | 1 | -0/+21 | |
| | | |||||
| * | simpl: handle multiplication by negative po2 too | 2025-12-22 | 1 | -5/+9 | |
| | | |||||
| * | simpl: optimize unsigned & signed division by power of 2 | 2025-12-21 | 1 | -16/+63 | |
| | | |||||
| * | ir: simpl: optimize some constant multiplications | 2025-12-21 | 1 | -11/+52 | |
| | | | | | Reuse irbinop() and irunop() for the constant results cases. | ||||
| * | backend: unify pass memory allocation strategies | 2025-12-20 | 1 | -2/+1 | |
| | | | | | | | It was all over the place for temporary data structures used by individual passes. Now there is an arena specifically for that, which is nicer. | ||||
| * | backend: general simplification pass skeleton | 2025-12-20 | 1 | -0/+146 | |
 |
index : antcc | |
| A little C compiler |
| aboutsummaryrefslogtreecommitdiffhomepage |