DescriptionOptimize 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.
Committed: http://code.google.com/p/v8/source/detail?r=10382
Patch Set 1 #Patch Set 2 : '' #
Total comments: 4
Patch Set 3 : '' #
Messages
Total messages: 3 (0 generated)
|