myunbin opened PR #13219 from myunbin:delete_bitops_rule to bytecodealliance:main:
This PR removes a simplification rule that does not appear to be profitable, since the LHS and RHS require the same number of operations.
((x & y) ^ y) + z --> (y + z) - (x & y)
myunbin requested cfallin for a review on PR #13219.
myunbin requested wasmtime-compiler-reviewers for a review on PR #13219.
github-actions[bot] added the label cranelift on PR #13219.
github-actions[bot] added the label isle on PR #13219.
github-actions[bot] commented on PR #13219:
Subscribe to Label Action
cc @cfallin, @fitzgen
<details>
This issue or pull request has been labeled: "cranelift", "isle"Thus the following users have been cc'd because of the following labels:
- cfallin: isle
- fitzgen: isle
To subscribe or unsubscribe from this label, edit the <code>.github/subscribe-to-label.json</code> configuration file.
Learn more.
</details>
:thumbs_up: cfallin submitted PR review.
cfallin added PR #13219 [Cranelift] remove unprofitable bitwise simplification rule to the merge queue.
:check: cfallin merged PR #13219.
cfallin removed PR #13219 [Cranelift] remove unprofitable bitwise simplification rule from the merge queue.
Last updated: May 03 2026 at 22:13 UTC