New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

De-morgan's "and" law #1297

Merged
merged 5 commits into from Nov 30, 2017

Conversation

Projects
None yet
1 participant
@kripken
Member

kripken commented Nov 18, 2017

I was looking at fastcomp and wasm-backend code samples for perf and I noticed that binaryen doesn't do this:

(eqz X) and (eqz Y) === eqz (X or Y)

Normally de-morgan's laws apply only to boolean vars, but for the and (but not or or xor) version, it works in all cases, unless I am missing something (both sides are true iff X and Y have all zero bits).

kripken added some commits Nov 18, 2017

fix

@kripken kripken merged commit bcc6205 into master Nov 30, 2017

4 checks passed

continuous-integration/appveyor/branch AppVeyor build succeeded
Details
continuous-integration/appveyor/pr AppVeyor build succeeded
Details
continuous-integration/travis-ci/pr The Travis CI build passed
Details
continuous-integration/travis-ci/push The Travis CI build passed
Details

@kripken kripken deleted the de-morgan branch Nov 30, 2017

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment