| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2018-08-22 | add testcases for bitfield & AND/OR simplification | Luc Van Oostenryck | 1 | -0/+44 | |
| The extraction & insertion of bitfields is made of relatively complex combinations of SHL/LSR/AND/OR and TRUNC/ZEXT/SEXT. Add a few testcases showing the effectiveness of their simplification and to catch possible future regressions. 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 |