OLD | NEW |
1 // Copyright 2006-2008 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 |
11 // with the distribution. | 11 // with the distribution. |
(...skipping 10 matching lines...) Expand all Loading... |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include <stdlib.h> | 28 #include <stdlib.h> |
29 | 29 |
30 #include "v8.h" | 30 #include "v8.h" |
31 | 31 |
| 32 #include "cctest.h" |
32 #include "platform.h" | 33 #include "platform.h" |
33 #include "cctest.h" | 34 #include "utils-inl.h" |
34 | 35 |
35 using namespace v8::internal; | 36 using namespace v8::internal; |
36 | 37 |
37 | 38 |
38 TEST(Utils1) { | 39 TEST(Utils1) { |
39 CHECK_EQ(-1000000, FastD2I(-1000000.0)); | 40 CHECK_EQ(-1000000, FastD2I(-1000000.0)); |
40 CHECK_EQ(-1, FastD2I(-1.0)); | 41 CHECK_EQ(-1, FastD2I(-1.0)); |
41 CHECK_EQ(0, FastD2I(0.0)); | 42 CHECK_EQ(0, FastD2I(0.0)); |
42 CHECK_EQ(1, FastD2I(1.0)); | 43 CHECK_EQ(1, FastD2I(1.0)); |
43 CHECK_EQ(1000000, FastD2I(1000000.0)); | 44 CHECK_EQ(1000000, FastD2I(1000000.0)); |
(...skipping 143 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
187 int offset = 0; | 188 int offset = 0; |
188 for (int loop = 0; loop < kLoops; loop++) { | 189 for (int loop = 0; loop < kLoops; loop++) { |
189 int seq_length = loop % kMaxSequenceSize; | 190 int seq_length = loop % kMaxSequenceSize; |
190 for (int j = 0; j < seq_length; j++) { | 191 for (int j = 0; j < seq_length; j++) { |
191 CHECK_EQ(j, result[offset]); | 192 CHECK_EQ(j, result[offset]); |
192 offset++; | 193 offset++; |
193 } | 194 } |
194 } | 195 } |
195 result.Dispose(); | 196 result.Dispose(); |
196 } | 197 } |
OLD | NEW |