RegExp: remove last match info override.

test/mjsunit/string-replace.js

 // Copyright 2009 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 145 matching lines @@
   assertEquals("x", m, "replace(/(x)(?=(.))/g,func(m,..))");
   assertEquals("x", c1, "replace(/(x)(?=(.))/g,func(..,c1,..))");
   assertEquals(["a","b","c"][ctr], c2, "replace(/(x)(?=(.))/g,func(..,c2,..))");
   assertEquals(ctr * 2, i, "replace(/(x)(?=(.))/g,func(..,i,..))");
   assertEquals(short, s, "replace(/(x)(?=(.))/g,func(..,s))");
   return String(ctr++);
 });
 assertEquals(3, ctr, "replace(/x/g,func) num-match");
 
 
+replaceTest("ABCD", "abcd", /(.)/g, function r(m, c1, i, s) {
+  assertEquals("d", RegExp.lastMatch);
+  assertEquals("d", RegExp.$1);
+  assertEquals("abc", RegExp.leftContext);
+  return m.toUpperCase();
+});
+
+
+var long = "";
+while (long.length < 0x2000) {
+  long += String.fromCharCode(65 + Math.random() * 26);
+}
+
+for (var i = 0; i < 3; i++) {
+  replaceTest(long.toLowerCase(), long, /(..)/g, function r(m, c1, i, s) {
+    var expected = long.substring(0x1ffe, 0x2000);
+    assertEquals(expected, RegExp.lastMatch);
+    assertEquals(expected, RegExp.$1);
+    assertEquals(long.substring(0, 0x1ffe), RegExp.leftContext);
+    return m.toLowerCase();
+  });
+}
+
+
 // Test special cases of replacement parts longer than 1<<11.
 var longstring = "xyzzy";
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
 longstring = longstring + longstring;
@@ skipping 11 matching lines @@
 replaceTest("string 42", "string x", /[xy]/, function() { return 42; });
 replaceTest("string true", "string x", /x/g, function() { return true; });
 replaceTest("string null", "string x", /x/g, function() { return null; });
 replaceTest("string undefined", "string x", /x/g, function() { return undefined; });
 
 replaceTest("aundefinedbundefinedcundefined",
             "abc", /(.)|(.)/g, function(m, m1, m2, i, s) { return m1+m2; });
 
 // Test nested calls to replace, including that it sets RegExp.$& correctly.
 
-function replacer(m,i,s) {
-  assertEquals(m,RegExp['$&']);
-  return "[" + RegExp['$&'] + "-"
-             + m.replace(/./g,"$&$&") + "-"
-             + m.replace(/./g,function() { return RegExp['$&']; })
-             + "-" + RegExp['$&'] + "]";
-}
-
-replaceTest("[ab-aabb-ab-b][az-aazz-az-z]",
-            "abaz", /a./g, replacer);
-
-replaceTest("[ab-aabb-ab-b][az-aazz-az-z]",
-            "abaz", /a(.)/g, replacer);
-
 var str = 'She sells seashells by the seashore.';
 var re = /sh/g;
 assertEquals('She sells sea$schells by the sea$schore.',
              str.replace(re,"$$" + 'sch'))
 
 
 var replace_obj = { length: 0, toString: function() { return "x"; }};
 assertEquals("axc", "abc".replace(/b/, replace_obj));
 assertEquals("axc", "abc".replace(/b/g, replace_obj));
 
@@ skipping 45 matching lines @@
   // followed by "0", $61 as $6, followed by "1" and so on.
   var tail = subject.substr(59);
   for (var i = 60; i < 100; i++) {
     assertEquals(String.fromCharCode(i / 10 + 23) + (i % 10) + tail,
                  subject.replace(re, "$" + i));
   }
 }
 
 testIndices59(new RegExp(regexp59pattern));
 testIndices59(new RegExp(regexp59pattern, "g"));