OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
197 } | 197 } |
198 | 198 |
199 a = new Array(1); | 199 a = new Array(1); |
200 grow_store(a,1,1); | 200 grow_store(a,1,1); |
201 grow_store(a,2,1); | 201 grow_store(a,2,1); |
202 %OptimizeFunctionOnNextCall(grow_store); | 202 %OptimizeFunctionOnNextCall(grow_store); |
203 grow_store(a,10,1); | 203 grow_store(a,10,1); |
204 assertOptimized(grow_store); | 204 assertOptimized(grow_store); |
205 grow_store(a,2048,1); | 205 grow_store(a,2048,1); |
206 assertUnoptimized(grow_store); | 206 assertUnoptimized(grow_store); |
| 207 %ClearFunctionTypeFeedback(grow_store); |
207 })(); | 208 })(); |
208 | 209 |
OLD | NEW |