blob: 32b2c0cddb979e822fcf9be76fab276525bce30a [file] [log] [blame]
Ben Murdoch8b112d22011-06-08 16:22:53 +01001// Copyright 2011 the V8 project authors. All rights reserved.
Steve Blocka7e24c12009-10-30 11:49:00 +00002// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
4// met:
5//
6// * Redistributions of source code must retain the above copyright
7// notice, this list of conditions and the following disclaimer.
8// * Redistributions in binary form must reproduce the above
9// copyright notice, this list of conditions and the following
10// disclaimer in the documentation and/or other materials provided
11// with the distribution.
12// * Neither the name of Google Inc. nor the names of its
13// contributors may be used to endorse or promote products derived
14// from this software without specific prior written permission.
15//
16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
Ben Murdoch257744e2011-11-30 15:57:28 +000028// Flags: --allow-natives-syntax --expose-gc
Steve Blocka7e24c12009-10-30 11:49:00 +000029
Ben Murdoch8b112d22011-06-08 16:22:53 +010030// This is a regression test for overlapping key and value registers.
31function f(a) {
32 a[0] = 0;
33 a[1] = 0;
34}
Steve Blocka7e24c12009-10-30 11:49:00 +000035
Ben Murdoch8b112d22011-06-08 16:22:53 +010036var a = new Int32Array(2);
37for (var i = 0; i < 5; i++) {
38 f(a);
39}
40%OptimizeFunctionOnNextCall(f);
41f(a);
Steve Blocka7e24c12009-10-30 11:49:00 +000042
Ben Murdoch8b112d22011-06-08 16:22:53 +010043assertEquals(0, a[0]);
44assertEquals(0, a[1]);
Steve Blocka7e24c12009-10-30 11:49:00 +000045
Ben Murdoch8b112d22011-06-08 16:22:53 +010046// Test the correct behavior of the |BYTES_PER_ELEMENT| property (which is
47// "constant", but not read-only).
48a = new Int32Array(2);
49assertEquals(4, a.BYTES_PER_ELEMENT);
50a.BYTES_PER_ELEMENT = 42;
51assertEquals(42, a.BYTES_PER_ELEMENT);
52a = new Uint8Array(2);
53assertEquals(1, a.BYTES_PER_ELEMENT);
54a = new Int16Array(2);
55assertEquals(2, a.BYTES_PER_ELEMENT);
56
Ben Murdoch257744e2011-11-30 15:57:28 +000057// Test Float64Arrays.
58function get(a, index) {
59 return a[index];
60}
61function set(a, index, value) {
62 a[index] = value;
63}
64function temp() {
65var array = new Float64Array(2);
66for (var i = 0; i < 5; i++) {
67 set(array, 0, 2.5);
68 assertEquals(2.5, array[0]);
69}
70%OptimizeFunctionOnNextCall(set);
71set(array, 0, 2.5);
72assertEquals(2.5, array[0]);
73set(array, 1, 3.5);
74assertEquals(3.5, array[1]);
75for (var i = 0; i < 5; i++) {
76 assertEquals(2.5, get(array, 0));
77 assertEquals(3.5, array[1]);
78}
79%OptimizeFunctionOnNextCall(get);
80assertEquals(2.5, get(array, 0));
81assertEquals(3.5, get(array, 1));
82}
83
84// Test loads and stores.
85types = [Array, Int8Array, Uint8Array, Int16Array, Uint16Array, Int32Array,
86 Uint32Array, PixelArray, Float32Array, Float64Array];
87
88test_result_nan = [NaN, 0, 0, 0, 0, 0, 0, 0, NaN, NaN];
89test_result_low_int = [-1, -1, 255, -1, 65535, -1, 0xFFFFFFFF, 0, -1, -1];
90test_result_middle = [253.75, -3, 253, 253, 253, 253, 253, 254, 253.75, 253.75];
91test_result_high_int = [256, 0, 0, 256, 256, 256, 256, 255, 256, 256];
92
93const kElementCount = 40;
94
95function test_load(array, sum) {
96 for (var i = 0; i < kElementCount; i++) {
97 sum += array[i];
98 }
99 return sum;
100}
101
102function test_load_const_key(array, sum) {
103 sum += array[0];
104 sum += array[1];
105 sum += array[2];
106 return sum;
107}
108
109function test_store(array, sum) {
110 for (var i = 0; i < kElementCount; i++) {
111 sum += array[i] = i+1;
112 }
113 return sum;
114}
115
116function test_store_const_key(array, sum) {
117 sum += array[0] = 1;
118 sum += array[1] = 2;
119 sum += array[2] = 3;
120 return sum;
121}
122
123
124function test_store_middle_double(array, sum) {
125 array[0] = 253.75;
126 return array[0];
127}
128
129
130function test_store_high_double(array, sum) {
131 array[0] = 256.25;
132 return array[0];
133}
134
135function test_store_high_double(array, sum) {
136 array[0] = 256.25;
137 return array[0];
138}
139
140function test_store_low_int(array, sum) {
141 array[0] = -1;
142 return array[0];
143}
144
145function test_store_high_int(array, sum) {
146 array[0] = 256;
147 return array[0];
148}
149
150function test_store_nan(array, sum) {
151 array[0] = NaN;
152 return array[0];
153}
154
155const kRuns = 10;
156
157function run_test(test_func, array, expected_result) {
158 for (var i = 0; i < 5; i++) test_func(array, 0);
159 %OptimizeFunctionOnNextCall(test_func);
160 var sum = 0;
161 for (var i = 0; i < kRuns; i++) {
162 sum = test_func(array, sum);
163 }
164 assertEquals(expected_result, sum);
165 %DeoptimizeFunction(test_func);
166 gc(); // Makes V8 forget about type information for test_func.
167}
168
169for (var t = 0; t < types.length; t++) {
170 var type = types[t];
171 print ("type = " + t);
172 var a = new type(kElementCount);
173 for (var i = 0; i < kElementCount; i++) {
174 a[i] = i;
175 }
176
177 // Run test functions defined above.
178 run_test(test_load, a, 780 * kRuns);
179 run_test(test_load_const_key, a, 3 * kRuns);
180 run_test(test_store, a, 820 * kRuns);
181 run_test(test_store_const_key, a, 6 * kRuns);
182 run_test(test_store_low_int, a, test_result_low_int[t]);
183 run_test(test_store_high_int, a, test_result_high_int[t]);
184 run_test(test_store_nan, a, test_result_nan[t]);
185 run_test(test_store_middle_double, a, test_result_middle[t]);
186
187 // Test the correct behavior of the |length| property (which is read-only).
188 if (t != 0) {
189 assertEquals(kElementCount, a.length);
190 a.length = 2;
191 assertEquals(kElementCount, a.length);
192 assertTrue(delete a.length);
193 a.length = 2;
194 assertEquals(2, a.length);
195 }
196
197 function array_load_set_smi_check(a) {
198 return a[0] = a[0] = 1;
199 }
200
201 array_load_set_smi_check(a);
202 array_load_set_smi_check(0);
203
204 function array_load_set_smi_check2(a) {
205 return a[0] = a[0] = 1;
206 }
207
208 array_load_set_smi_check2(a);
209 %OptimizeFunctionOnNextCall(array_load_set_smi_check2);
210 array_load_set_smi_check2(a);
211 array_load_set_smi_check2(0);
212 %DeoptimizeFunction(array_load_set_smi_check2);
213 gc(); // Makes V8 forget about type information for array_load_set_smi_check.
214}