Index: test/webkit/number-cell-reuse-expected.txt |
diff --git a/test/webkit/concat-while-having-a-bad-time-expected.txt b/test/webkit/number-cell-reuse-expected.txt |
similarity index 70% |
copy from test/webkit/concat-while-having-a-bad-time-expected.txt |
copy to test/webkit/number-cell-reuse-expected.txt |
index f949db98fd7b911d30b20281c82ee0f801405c77..2aa0a27f60314c98e4b3c9df54f5199f91a606ae 100644 |
--- a/test/webkit/concat-while-having-a-bad-time-expected.txt |
+++ b/test/webkit/number-cell-reuse-expected.txt |
@@ -21,12 +21,23 @@ |
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
-Tests the behavior of Array.prototype.concat while the array is having a bad time due to one of the elements we are concatenating. |
+This test checks corner cases of the number cell reuse code. In particular, it checks for known cases where code generation for number cell reuse caused assertions to fail. |
On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE". |
-PASS [42].concat() is [42] |
+PASS leftConstantRightSimple(2) is 0.4 |
+PASS leftConstantRightComplex(1) is 0.2 |
+PASS leftSimpleRightConstant(2) is 0.4 |
+PASS leftComplexRightConstant(1) is 0.2 |
+PASS leftThisRightSimple(2) is NaN |
+PASS leftThisRightSimple.call(2, 2) is 8 |
+PASS leftThisRightComplex(2) is NaN |
+PASS leftThisRightComplex.call(2, 2) is 12 |
+PASS leftSimpleRightThis(2) is NaN |
+PASS leftSimpleRightThis.call(2, 2) is 8 |
+PASS leftComplexRightThis(2) is NaN |
+PASS leftComplexRightThis.call(2, 2) is 12 |
PASS successfullyParsed is true |
TEST COMPLETE |