This series contains two more simplifications of bitfield accesses. This series is available for review & testing in the repository at: git://github.com/lucvoo/sparse-dev.git optim-bitfield ---------------------------------------------------------------- Luc Van Oostenryck (9): add testcase for (((x & M) | (y & M')) & M'') reorg simplify_and_or_mask() simplify ((A & M) | B ) & M' even when (M & M') != 0 dumber simplify_and_or_mask() let's try simplify_and_or_mask() on both sides move opcode test inside simplify_and_or_mask() small code reorg of simplify_or_lsr() simplify ((x & M) | (y << S)) >> S simplify TRUNC((x & M) | y, N) simplify.c | 73 +++++++++++++++++++++++++--------- validation/optim/and-or-mask.c | 18 +++++++++ 2 files changed, 73 insertions(+), 18 deletions(-) create mode 100644 validation/optim/and-or-mask.c -- 2.18.0 -- To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
