author | sundar |
Wed, 06 May 2015 20:04:42 +0530 | |
changeset 30394 | 72a59e4dffea |
parent 24778 | 2ff5d7041566 |
permissions | -rw-r--r-- |
16147 | 1 |
/* |
16151 | 2 |
* Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved. |
16147 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
24778
2ff5d7041566
8044638: Tidy up Nashorn codebase for code standards
attila
parents:
16151
diff
changeset
|
4 |
* |
16147 | 5 |
* This code is free software; you can redistribute it and/or modify it |
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
24778
2ff5d7041566
8044638: Tidy up Nashorn codebase for code standards
attila
parents:
16151
diff
changeset
|
8 |
* |
16147 | 9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
24778
2ff5d7041566
8044638: Tidy up Nashorn codebase for code standards
attila
parents:
16151
diff
changeset
|
14 |
* |
16147 | 15 |
* You should have received a copy of the GNU General Public License version |
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
24778
2ff5d7041566
8044638: Tidy up Nashorn codebase for code standards
attila
parents:
16151
diff
changeset
|
18 |
* |
16147 | 19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
20 |
* or visit www.oracle.com if you need additional information or have any |
|
21 |
* questions. |
|
22 |
*/ |
|
23 |
||
24 |
/** |
|
25 |
* NASHORN-703 |
|
26 |
* |
|
27 |
* Self modifying assignments and ++/-- operators had two issues |
|
28 |
* 1) the base was loaded twice |
|
29 |
* 2) if the base was anything but an IdentNode, AccessNode or IndexNode and in the scope, it would |
|
30 |
* only be evaluated once, leading to bytecode stack underflow |
|
31 |
* |
|
32 |
* This file is split into two tests as the presence of eval affects the whole script |
|
33 |
* |
|
34 |
* @test |
|
24778
2ff5d7041566
8044638: Tidy up Nashorn codebase for code standards
attila
parents:
16151
diff
changeset
|
35 |
* @run |
16147 | 36 |
*/ |
37 |
||
38 |
function template() { |
|
39 |
this.count = 17; |
|
40 |
eval(); |
|
41 |
} |
|
42 |
||
43 |
//self assignment to accessnode in scope |
|
44 |
function test1() { |
|
45 |
a.count++; |
|
46 |
eval(); |
|
47 |
} |
|
48 |
||
49 |
function test2() { |
|
50 |
a2[0].count++; |
|
51 |
eval(); |
|
52 |
} |
|
53 |
||
54 |
function test3() { |
|
55 |
a3[0]++; |
|
56 |
eval(); |
|
57 |
} |
|
58 |
||
59 |
function test4() { |
|
60 |
a4 *= 17; |
|
61 |
eval(); |
|
62 |
} |
|
63 |
||
64 |
function test5() { |
|
65 |
a5.count *= 17; |
|
66 |
eval(); |
|
67 |
} |
|
68 |
||
69 |
function test6() { |
|
70 |
a6[0].count *= 17; |
|
71 |
eval(); |
|
72 |
} |
|
73 |
||
74 |
function test7() { |
|
75 |
a7[0] *= 17; |
|
76 |
eval(); |
|
77 |
} |
|
78 |
||
79 |
function tpl() { |
|
80 |
return new template(); |
|
81 |
} |
|
82 |
||
83 |
function count() { |
|
84 |
tpl().count++; |
|
85 |
eval(); |
|
86 |
} |
|
87 |
||
88 |
var a = new template(); |
|
89 |
test1(); |
|
90 |
print(a.count); |
|
91 |
||
92 |
var a2 = [new template()]; |
|
93 |
test2(); |
|
94 |
print(a2[0].count); |
|
95 |
||
96 |
var a3 = [1]; |
|
97 |
test3(); |
|
98 |
print(a3); |
|
99 |
||
100 |
var a4 = 4711; |
|
101 |
test4(); |
|
102 |
print(a4); |
|
103 |
||
104 |
var a5 = new template(); |
|
105 |
test5(); |
|
106 |
print(a5.count); |
|
107 |
||
108 |
var a6 = [new template()]; |
|
109 |
test6(); |
|
110 |
print(a6[0].count); |
|
111 |
||
112 |
var a7 = [1]; |
|
113 |
test7(); |
|
114 |
print(a7[0]); |
|
115 |
||
116 |
||
117 |
||
118 |
||
119 |
||
120 |
||
121 |
||
122 |