Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 function Module(stdlib, foreign, heap) { | |
| 6 "use asm"; | |
| 7 function f1(i) { | |
| 8 i = +i; | |
| 9 return +(i * -1); | |
| 10 } | |
| 11 function f2(i) { | |
| 12 i = +i; | |
| 13 return +(-1 * i); | |
| 14 } | |
| 15 return { f1: f1, f2: f2 }; | |
| 16 } | |
| 17 | |
| 18 var m = Module(this, {}, new ArrayBuffer(64 * 1024)); | |
| 19 | |
| 20 for (var i = -2147483648; i < 2147483648; i += 3999777) { | |
| 21 assertEquals(-i, m.f1(i)); | |
| 22 assertEquals(-i, m.f2(i)); | |
| 23 } | |
|
Jarin
2014/11/06 06:07:49
Could we possibly test the corner cases, such as -
Benedikt Meurer
2014/11/06 06:12:47
Done.
| |
| OLD | NEW |