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 24 matching lines...) Expand all Loading... |
35 v = v + 1; | 35 v = v + 1; |
36 a[0] = v; | 36 a[0] = v; |
37 v = v - 1; | 37 v = v - 1; |
38 return v; | 38 return v; |
39 } | 39 } |
40 | 40 |
41 assertEquals(G, f(G)); | 41 assertEquals(G, f(G)); |
42 assertEquals(G, f(G)); | 42 assertEquals(G, f(G)); |
43 %OptimizeFunctionOnNextCall(f); | 43 %OptimizeFunctionOnNextCall(f); |
44 assertEquals(G, f(G)); | 44 assertEquals(G, f(G)); |
45 | |
OLD | NEW |