OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 |
(...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
55 if (N == 0) return new Node(x, null); | 55 if (N == 0) return new Node(x, null); |
56 return new Node(new Array(1024), LongList(N - 1, x)); | 56 return new Node(new Array(1024), LongList(N - 1, x)); |
57 } | 57 } |
58 | 58 |
59 var L = LongList(1024, function (O) { | 59 var L = LongList(1024, function (O) { |
60 for (var i = 0; i < 5; i++) O.f; | 60 for (var i = 0; i < 5; i++) O.f; |
61 }); | 61 }); |
62 | 62 |
63 | 63 |
64 | 64 |
| 65 %NeverOptimizeFunction(Incremental); |
65 function Incremental(O, x) { | 66 function Incremental(O, x) { |
66 if (!x) { | 67 if (!x) { |
67 return; | 68 return; |
68 } | 69 } |
69 function CreateCode(i) { | 70 function CreateCode(i) { |
70 var f = new Function("return O.f_" + i); | 71 var f = new Function("return O.f_" + i); |
71 CODE.push(f); | 72 CODE.push(f); |
72 f(); // compile | 73 f(); // compile |
73 f(); // compile | 74 f(); // compile |
74 f(); // compile | 75 f(); // compile |
75 } | 76 } |
76 | 77 |
77 for (var i = 0; i < 1e4; i++) CreateCode(i); | 78 for (var i = 0; i < 1e4; i++) CreateCode(i); |
78 gc(); | 79 gc(); |
79 gc(); | 80 gc(); |
80 gc(); | 81 gc(); |
81 | 82 |
82 print(">>> 1 <<<"); | 83 print(">>> 1 <<<"); |
83 | 84 |
84 L.execute(O); | 85 L.execute(O); |
85 | 86 |
86 %NeverOptimize(); | |
87 | |
88 L = null; | 87 L = null; |
89 print(">>> 2 <<<"); | 88 print(">>> 2 <<<"); |
90 AllocateXMb(8); | 89 AllocateXMb(8); |
91 //rint("1"); | 90 //rint("1"); |
92 //llocateXMb(8); | 91 //llocateXMb(8); |
93 //rint("1"); | 92 //rint("1"); |
94 //llocateXMb(8); | 93 //llocateXMb(8); |
95 | 94 |
96 } | 95 } |
97 | 96 |
(...skipping 20 matching lines...) Expand all Loading... |
118 var O1 = {}; | 117 var O1 = {}; |
119 var O2 = {}; | 118 var O2 = {}; |
120 var O3 = {}; | 119 var O3 = {}; |
121 var O4 = {f:0}; | 120 var O4 = {f:0}; |
122 | 121 |
123 foo(O1, false); | 122 foo(O1, false); |
124 foo(O2, false); | 123 foo(O2, false); |
125 foo(O3, false); | 124 foo(O3, false); |
126 %OptimizeFunctionOnNextCall(foo); | 125 %OptimizeFunctionOnNextCall(foo); |
127 foo(O4, true); | 126 foo(O4, true); |
OLD | NEW |