| commit | 96798493170521691d709be50dd2102ead47b083 | [log] [tgz] |
|---|---|---|
| author | Kevin Brodsky <kevin.brodsky@linaro.org> | Fri Jan 15 09:49:20 2016 +0000 |
| committer | Kevin Brodsky <kevin.brodsky@linaro.org> | Fri Jan 22 14:43:37 2016 +0000 |
| tree | 34d03d55e9a2eeaa3f06bc7198c192156aa676b4 | |
| parent | 7d9f95f29d07c455c3ab76d89b7952755a3e0a28 [diff] |
Optimizing: double-negated bitwise operations simplifications Generic instruction simplifications applying to bitwise operations when both inputs are Not's. And and Or are handled by De Morgan's laws, removing one instruction: ~a & ~b -> ~(a | b) ~a | ~b -> ~(a & b) Xor is handled by this trivial relation, removing two instructions: ~a ^ ~b = a ^ b The simplifications only happen when neither Not is used by other instructions. Change-Id: I5d5187af2f625c475c3e49466af6bc3e87595f8f