OLD | NEW |
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 |
(...skipping 21 matching lines...) Expand all Loading... |
32 assertTrue(%HasFastSmiElements(a)); | 32 assertTrue(%HasFastSmiElements(a)); |
33 assertTrue(%HasFastHoleyElements(a)); | 33 assertTrue(%HasFastHoleyElements(a)); |
34 | 34 |
35 function hole(i) { | 35 function hole(i) { |
36 return a[i] << 0; | 36 return a[i] << 0; |
37 } | 37 } |
38 | 38 |
39 assertEquals(1, hole(0)); | 39 assertEquals(1, hole(0)); |
40 assertEquals(1, hole(0)); | 40 assertEquals(1, hole(0)); |
41 %OptimizeFunctionOnNextCall(hole); | 41 %OptimizeFunctionOnNextCall(hole); |
42 assertEquals(0, hole(1)); | 42 assertEquals(0, hole(1)); |
OLD | NEW |