kmillikin@chromium.org 9b5c312bfc Initial implementation of fast path operation for bitwise OR. ... Support a binary operation (bitwise OR) so long as it's not nested in the left subexpression. This ensures that the expression stack never has height greater than two and so can be kept fully in registers. The bounded expression stack height and the absence of any side effects on the fast path allows us to still bailout out to the very beginning of the function if any of our fast-path checks fail. Review URL: http://codereview.chromium.org/594008 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3822 ce2b1a6d-e550-0410-aec6-3dcde31c8c00		2010-02-09 13:44:43 +00:00
..
cctest	MIPS port initial commit	2010-02-04 20:36:58 +00:00
es5conform	MIPS port initial commit	2010-02-04 20:36:58 +00:00
message	MIPS port initial commit	2010-02-04 20:36:58 +00:00
mjsunit	Initial implementation of fast path operation for bitwise OR.	2010-02-09 13:44:43 +00:00
mozilla	Sort tests to increase predictability of mozilla test runs	2009-11-04 16:55:24 +00:00
sputnik	MIPS port initial commit	2010-02-04 20:36:58 +00:00