[regexp] Move RegExp.prototype[@@search] to TF

test/mjsunit/regexp.js

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 730 matching lines @@
 RegExp.prototype.exec = RegExpPrototypeExec;
 
 // Test the code path in RE.proto[@@search] when previousLastIndex is a receiver
 // but can't be converted to a primitive. This exposed a crash in an older
 // C++ implementation of @@search which a) still relied on Object::Equals,
 // and b) incorrectly returned isolate->pending_exception() on error.
 
 var re = /./;
 re.lastIndex = { [Symbol.toPrimitive]: 42 };
 try { "abc".search(re); } catch (_) {}  // Ensure we don't crash.
+
+// Test lastIndex values of -0.0 and NaN (since @@search uses SameValue).
+
+var re = /./;
+re.exec = function(str) { assertEquals(0, re.lastIndex); return []; }
+re.lastIndex = -0.0;
+assertEquals(-0, re.lastIndex);
+"abc".search(re);
+assertEquals(-0, re.lastIndex);
+
+var re = /./;
+re.exec = function(str) { assertEquals(0, re.lastIndex); return []; }
+re.lastIndex = NaN;
+assertEquals(NaN, re.lastIndex);
+"abc".search(re);
+assertEquals(NaN, re.lastIndex);