/deps/v8/test/mjsunit/regress/regress-hoist-load-named-field.js
JavaScript | 66 lines | 30 code | 6 blank | 30 comment | 2 complexity | d1741e65519cc5e8bbb5d52cf990fb01 MD5 | raw file
Possible License(s): 0BSD, BSD-3-Clause, MPL-2.0-no-copyleft-exception, GPL-2.0, ISC, Apache-2.0, MIT, AGPL-3.0
- // Copyright 2013 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.
- // Flags: --allow-natives-syntax
- // Load fields should not be hoisted beyond their check maps when the check maps
- // cannot be hoisted due to changes in elements kinds.
- function f(o, a) {
- var v;
- var i = 1;
- while (i < 2) {
- v = o.y;
- a[0] = 1.5;
- i++;
- }
- return v;
- }
- f({y:1.4}, [1]);
- f({y:1.6}, [1]);
- %OptimizeFunctionOnNextCall(f);
- f({x:1}, [1]);
- // Polymorphic loads should not be hoisted beyond their compare maps.
- function f2(o) {
- var i = 0;
- var v;
- while (i < 1) {
- v = o.x;
- i++;
- }
- return v;
- }
- var o1 = { x: 1.5 };
- var o2 = { y: 1, x: 1 };
- f2(o1);
- f2(o1);
- f2(o2);
- %OptimizeFunctionOnNextCall(f2);
- f2(o2);