Index: test/webkit/dfg-min-backwards-propagation.js |
diff --git a/test/webkit/concat-while-having-a-bad-time.js b/test/webkit/dfg-min-backwards-propagation.js |
similarity index 70% |
copy from test/webkit/concat-while-having-a-bad-time.js |
copy to test/webkit/dfg-min-backwards-propagation.js |
index dfda1e08a0b36194b787a44ee12a9693acd8aeaf..835aefa21735228256360ac7f48b5fc30515f04d 100644 |
--- a/test/webkit/concat-while-having-a-bad-time.js |
+++ b/test/webkit/dfg-min-backwards-propagation.js |
@@ -22,10 +22,28 @@ |
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
description( |
-"Tests the behavior of Array.prototype.concat while the array is having a bad time due to one of the elements we are concatenating." |
+"Tests that the DFG knows that a function that appears like Math.min could potentially use value in arbitrary ways, and not just in a context that converts values to numbers." |
); |
-Object.defineProperty(Array.prototype, 0, { writable: false }); |
-shouldBe("[42].concat()", "[42]"); |
+function foo(f, array, i) { |
+ return f(array[i], 2.5); |
+} |
+function bar(value) { |
+ return value; |
+} |
+ |
+for (var i = 0; i < 200; ++i) { |
+ var f, array, expected; |
+ if (i == 190) { |
+ f = "bar"; |
+ array = "[, 1.5]"; |
+ expected = "void 0"; |
+ } else { |
+ f = "Math.min"; |
+ array = "[1.5]"; |
+ expected = "Math.min(1.5, 2.5)"; |
+ } |
+ shouldBe("foo(" + f + ", " + array + ", 0)", expected); |
+} |