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 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
44 g(0); | 44 g(0); |
45 %OptimizeFunctionOnNextCall(g); | 45 %OptimizeFunctionOnNextCall(g); |
46 a[i] = g(i); | 46 a[i] = g(i); |
47 } | 47 } |
48 } | 48 } |
49 | 49 |
50 f(); | 50 f(); |
51 assertEquals(42, a[0]); | 51 assertEquals(42, a[0]); |
52 assertEquals(49, a[7]); | 52 assertEquals(49, a[7]); |
53 assertEquals(-19, a[23]); | 53 assertEquals(-19, a[23]); |
54 | |
55 | |
56 | |
57 | |
OLD | NEW |