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 e=k(f,h)==1?1:0; | 55 e=k(f,h)==1?1:0; |
56 b.push(e) | 56 b.push(e) |
57 } | 57 } |
58 a.push(b) | 58 a.push(b) |
59 } | 59 } |
60 } | 60 } |
61 | 61 |
62 f(); | 62 f(); |
63 %OptimizeFunctionOnNextCall(f); | 63 %OptimizeFunctionOnNextCall(f); |
64 f(); | 64 f(); |
65 | |
OLD | NEW |