Optimize the slow case implementations of bit operations by
authorkasperl@chromium.org <kasperl@chromium.org@ce2b1a6d-e550-0410-aec6-3dcde31c8c00>
Mon, 15 Jun 2009 09:49:17 +0000 (09:49 +0000)
committerkasperl@chromium.org <kasperl@chromium.org@ce2b1a6d-e550-0410-aec6-3dcde31c8c00>
Mon, 15 Jun 2009 09:49:17 +0000 (09:49 +0000)
commitf36f5f23317bfb669f5682cb3361b7f81b6d949a
tree74abb95608ef5cf0bc25e39332326195c69964d2
parent3a3a6924a1ead392a9cfcc0d173719e519c93472
Optimize the slow case implementations of bit operations by
avoiding excessive ToNumber calls and by dealing with NaNs
in BIT_AND and SAR.
Review URL: http://codereview.chromium.org/125118

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@2163 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
src/runtime.js