Mercurial > jdk8-mips64-public > nashorn / annotate
test/script/basic/NASHORN-258.js@b1a7da25b547 (annotated)
test/script/basic/NASHORN-258.js
Wed, 27 Apr 2016 01:36:41 +0800
- author
- aoqi
- date
- Wed, 27 Apr 2016 01:36:41 +0800
- changeset 0
- b1a7da25b547
- child 952
- 6d5471a497fb
- permissions
- -rw-r--r--
Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/nashorn/
changeset: 1034:4b9cc65dd24d
tag: jdk8u25-b17
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | */ |
| aoqi@0 | 23 | |
| aoqi@0 | 24 | /** |
| aoqi@0 | 25 | * NASHORN-258 : Broken slot assignments to non constant members of multidimensional arrays in OP= |
| aoqi@0 | 26 | * |
| aoqi@0 | 27 | * @test |
| aoqi@0 | 28 | * @run |
| aoqi@0 | 29 | */ |
| aoqi@0 | 30 | |
| aoqi@0 | 31 | function test3(a) { |
| aoqi@0 | 32 | for (i = 0; i < a.length ; i++) { |
| aoqi@0 | 33 | for (j = 0; j < a[i].length ; j++) { |
| aoqi@0 | 34 | for (k = 0; k < a[i][j].length ; k++) { |
| aoqi@0 | 35 | a[i][j][k] *= 8; |
| aoqi@0 | 36 | } |
| aoqi@0 | 37 | } |
| aoqi@0 | 38 | } |
| aoqi@0 | 39 | } |
| aoqi@0 | 40 | |
| aoqi@0 | 41 | function test3local(a) { |
| aoqi@0 | 42 | for (var i = 0; i < a.length ; i++) { |
| aoqi@0 | 43 | for (var j = 0; j < a[i].length ; j++) { |
| aoqi@0 | 44 | for (var k = 0; k < a[i][j].length ; k++) { |
| aoqi@0 | 45 | a[i][j][k] *= 8; |
| aoqi@0 | 46 | } |
| aoqi@0 | 47 | } |
| aoqi@0 | 48 | } |
| aoqi@0 | 49 | } |
| aoqi@0 | 50 | |
| aoqi@0 | 51 | var array = [ [[1,1,1],[1,1,1],[1,1,1]], |
| aoqi@0 | 52 | [[1,1,1],[1,1,1],[1,1,1]], |
| aoqi@0 | 53 | [[1,1,1],[1,1,1],[1,1,1]] ]; |
| aoqi@0 | 54 | |
| aoqi@0 | 55 | test3(array); |
| aoqi@0 | 56 | print(array); |
| aoqi@0 | 57 | |
| aoqi@0 | 58 | test3local(array); |
| aoqi@0 | 59 | print(array); |
| aoqi@0 | 60 | |
| aoqi@0 | 61 | function outer() { |
| aoqi@0 | 62 | |
| aoqi@0 | 63 | var array2 = [ [[1,1,1],[1,1,1],[1,1,1]], |
| aoqi@0 | 64 | [[1,1,1],[1,1,1],[1,1,1]], |
| aoqi@0 | 65 | [[1,1,1],[1,1,1],[1,1,1]] ]; |
| aoqi@0 | 66 | |
| aoqi@0 | 67 | var f = function inner() { |
| aoqi@0 | 68 | for (var i = 0; i < array2.length ; i++) { |
| aoqi@0 | 69 | for (var j = 0; j < array2[i].length ; j++) { |
| aoqi@0 | 70 | array2[i][j][2] *= 8; |
| aoqi@0 | 71 | } |
| aoqi@0 | 72 | } |
| aoqi@0 | 73 | }; |
| aoqi@0 | 74 | |
| aoqi@0 | 75 | f(); |
| aoqi@0 | 76 | print(array2); |
| aoqi@0 | 77 | } |
| aoqi@0 | 78 | |
| aoqi@0 | 79 | outer(); |
