| 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 18 matching lines...) Expand all Loading... |
| 29 | 29 |
| 30 function mod(a, b) { return a % b; } | 30 function mod(a, b) { return a % b; } |
| 31 | 31 |
| 32 // Feed integer type info and optimize. | 32 // Feed integer type info and optimize. |
| 33 assertEquals(0, mod(4, 2)); | 33 assertEquals(0, mod(4, 2)); |
| 34 assertEquals(1, mod(3, 2)); | 34 assertEquals(1, mod(3, 2)); |
| 35 %OptimizeFunctionOnNextCall(mod); | 35 %OptimizeFunctionOnNextCall(mod); |
| 36 | 36 |
| 37 // Surprise mod with overflow. | 37 // Surprise mod with overflow. |
| 38 assertEquals(-Infinity, 1/mod(-2147483648, -1)); | 38 assertEquals(-Infinity, 1/mod(-2147483648, -1)); |
| 39 | |
| OLD | NEW |