mirror of
https://github.com/tc39/test262.git
synced 2025-10-28 10:13:55 +01:00
7298a38552
sourceRevisionAtLastExport: 33f2fb0e53d135f0ee17cfccd9d993eb2a6f47de targetRevisionAtLastExport: 31340cbd9add103f586d501b0c3354b7b182abc0
62 lines
2.1 KiB
JavaScript
62 lines
2.1 KiB
JavaScript
// 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
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
// Test compilation of loops.
|
|
|
|
var n = 1;
|
|
for (var i = 1; (6 - i); i++) {
|
|
// Factorial!
|
|
n = n * i;
|
|
}
|
|
assertEquals(120, n);
|
|
|
|
// Test assignments in the loop condition.
|
|
function f(i, n) {
|
|
while((n = n - 1) >= 0) {
|
|
i = n + 1;
|
|
}
|
|
return i;
|
|
}
|
|
assertEquals(1, f(0, 42));
|
|
|
|
|
|
// Test do-while loop and continue.
|
|
function g(a) {
|
|
var x = 0, c = 0;
|
|
do {
|
|
x = x + 1;
|
|
if (x < 5) continue;
|
|
c = c + 1;
|
|
} while(x < a);
|
|
return c;
|
|
}
|
|
|
|
assertEquals(6, g(10));
|
|
|
|
// Test deoptimization in the loop condition.
|
|
assertEquals(0, g("foo"));
|