| Index: test/mjsunit/regress/regress-672041.js
|
| diff --git a/test/mjsunit/regress/regress-672041.js b/test/mjsunit/regress/regress-672041.js
|
| new file mode 100644
|
| index 0000000000000000000000000000000000000000..ceea4fd59076ac960d9bc727fc1e6dabf65d4fee
|
| --- /dev/null
|
| +++ b/test/mjsunit/regress/regress-672041.js
|
| @@ -0,0 +1,23 @@
|
| +// Copyright 2016 the V8 project authors. All rights reserved.
|
| +// Use of this source code is governed by a BSD-style license that can be
|
| +// found in the LICENSE file.
|
| +
|
| +// Trigger an infinite loop through RegExp.prototype[@@match], which results
|
| +// in unbounded growth of the results array.
|
| +
|
| +// Limit the number of iterations to avoid OOM while still triggering large
|
| +// object space allocation.
|
| +const min_ptr_size = 4;
|
| +const max_regular_heap_object_size = 507136;
|
| +const num_iterations = max_regular_heap_object_size / min_ptr_size;
|
| +
|
| +const RegExpPrototypeExec = RegExp.prototype.exec;
|
| +
|
| +let i = 0;
|
| +
|
| +RegExp.prototype.__defineGetter__("global", () => true);
|
| +RegExp.prototype.exec = function(str) {
|
| + return (i++ < num_iterations) ? RegExpPrototypeExec.call(this, str) : null;
|
| +};
|
| +
|
| +"a".match();
|
|
|