| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2018-08-08 | simplify ((x & M') | y ) & M into (y & M) when (M' & M) == 0 | Luc Van Oostenryck | 1 | -1/+0 | |
| This is a common pattern for bitfield simplification. Signed-off-by: Luc Van Oostenryck <luc.vanoostenryck@gmail.com> | |||||
| 2018-07-23 | add testcases for casts & bitfield insertion/extraction | Luc Van Oostenryck | 1 | -0/+13 | |
| There is several difficulties some related to unclear semantic of our IR instructions and/or type evaluation. Add testcases trying to cover this area. Signed-off-by: Luc Van Oostenryck <luc.vanoostenryck@gmail.com> | |||||
 |
index : sparse/sparse-dev.git | |
| Sparse's development tree with unstable git history | Chris Li |
| aboutsummaryrefslogtreecommitdiffstatshomepage |