Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(906)

Side by Side Diff: test.js

Issue 22545007: Hack forEach to use HasFastPackedElements (Closed) Base URL: http://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: Branch on proxies Created 7 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« src/array.js ('K') | « src/runtime.cc ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2013 the V8 project authors. All rights reserved. 1 // Copyright 2013 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without 2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are 3 // modification, are permitted provided that the following conditions are
4 // met: 4 // met:
5 // 5 //
6 // * Redistributions of source code must retain the above copyright 6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer. 7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above 8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following 9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided 10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution. 11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its 12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived 13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission. 14 // from this software without specific prior written permission.
15 // 15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 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. 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 27
28 // Flags: --allow-natives-syntax
29 28
30 function a() { 29 load('benchmarks/base.js');
31 var sum = 0; 30
32 for (var i = 0; i < 500; ++i) { 31
33 sum = (i + sum) | 0; 32 function createArray() {
33 var array = [];
34 for (var i = 0; i < 100; i++) {
35 array[i] = i;
34 } 36 }
35 return sum; 37 return array;
36 } 38 }
37 39
38 function b() { 40
39 var sum = 0; 41 function createArrayWithHoles() {
40 for (var i = -500; i < 0; ++i) { 42 var array = [];
41 sum = (i + sum) | 0; 43 for (var i = 0; i < 100; i += 2) {
44 array[i] = i;
42 } 45 }
43 return sum; 46 return array;
44 } 47 }
45 48
46 function c() { 49
47 var sum = 0; 50 var array = createArray();
48 for (var i = 0; i < 500; ++i) { 51 var arrayWithHoles = createArrayWithHoles();
49 sum += (i + -0x7fffffff) | 0; 52
50 } 53
51 return sum; 54 function f(value, index) {
55 if (value !== index)
56 throw new Error();
52 } 57 }
53 58
54 function d() { 59
55 var sum = 0; 60 function ForEach() {
56 for (var i = -501; i < 0; ++i) { 61 array.forEach(f);
57 sum += (i + 501) | 0;
58 }
59 return sum;
60 } 62 }
61 63
62 a();
63 a();
64 %OptimizeFunctionOnNextCall(a);
65 assertEquals(124750, a());
66 assertEquals(124750, a());
67 64
68 b(); 65 function ForEach2() {
69 b(); 66 array.forEach2(f);
70 %OptimizeFunctionOnNextCall(b); 67 }
71 assertEquals(-125250, b());
72 assertEquals(-125250, b());
73 68
74 c();
75 c();
76 %OptimizeFunctionOnNextCall(c);
77 assertEquals(-1073741698750, c());
78 assertEquals(-1073741698750, c());
79 69
80 d(); 70 function ForEach3() {
81 d(); 71 array.forEach3(f);
82 %OptimizeFunctionOnNextCall(d); 72 }
83 assertEquals(125250, d()); 73
84 assertEquals(125250, d()); 74
75 function ForEachWithHoles() {
76 arrayWithHoles.forEach(f);
77 }
78
79
80 function ForEach2WithHoles() {
81 arrayWithHoles.forEach2(f);
82 }
83
84
85 function ForEach3WithHoles() {
86 arrayWithHoles.forEach3(f);
87 }
88
89
90 [
91 ForEach,
92 ForEach2,
93 ForEach3,
94 ForEachWithHoles,
95 ForEach2WithHoles,
96 ForEach3WithHoles
97 ].forEach(function(f) {
98 var name = f.name;
99 new BenchmarkSuite(name, 1e4, [
100 new Benchmark(name, f, f)
101 ]);
102 });
103
104
105 BenchmarkSuite.RunSuites({
106 NotifyResult: function(name, result) {
107 print(name + ': ' + result);
108 }
109 });
OLDNEW
« src/array.js ('K') | « src/runtime.cc ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698