Optimize simple constant cases for bitwise &, | and ^.
For integer bitwise operations we can replace x & -1 with x, x | 0 with x and x ^ 0 with x. Review URL: http://codereview.chromium.org/9177001 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@10382 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
Showing
Please
register
or
sign in
to comment