[regexp] Fix a test case for RE.proto[@@search]

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 723 matching lines @@
 
 // Test that changing a property on RegExp.prototype results in us taking the
 // slow path, which executes RegExp.prototype.exec instead of our
 // RegExpExecStub.
 const RegExpPrototypeExec = RegExp.prototype.exec;
 RegExp.prototype.exec = function() { throw new Error(); }
 assertThrows(() => "abc".replace(/./, ""));
 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 the
-// C++ implementation of @@search.
+// 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 };
-() => "abc".search(re);
+try { "abc".search(re); } catch (_) {}  // Ensure we don't crash.