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 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 CHECK_EQ(1000000, FastD2IChecked(1000000.0)); | 63 CHECK_EQ(1000000, FastD2IChecked(1000000.0)); |
64 | 64 |
65 CHECK_EQ(-1000000, FastD2IChecked(-1000000.123)); | 65 CHECK_EQ(-1000000, FastD2IChecked(-1000000.123)); |
66 CHECK_EQ(-1, FastD2IChecked(-1.234)); | 66 CHECK_EQ(-1, FastD2IChecked(-1.234)); |
67 CHECK_EQ(0, FastD2IChecked(0.345)); | 67 CHECK_EQ(0, FastD2IChecked(0.345)); |
68 CHECK_EQ(1, FastD2IChecked(1.234)); | 68 CHECK_EQ(1, FastD2IChecked(1.234)); |
69 CHECK_EQ(1000000, FastD2IChecked(1000000.123)); | 69 CHECK_EQ(1000000, FastD2IChecked(1000000.123)); |
70 | 70 |
71 CHECK_EQ(INT_MAX, FastD2IChecked(1.0e100)); | 71 CHECK_EQ(INT_MAX, FastD2IChecked(1.0e100)); |
72 CHECK_EQ(INT_MIN, FastD2IChecked(-1.0e100)); | 72 CHECK_EQ(INT_MIN, FastD2IChecked(-1.0e100)); |
73 CHECK_EQ(INT_MIN, FastD2IChecked(NAN)); | 73 CHECK_EQ(INT_MIN, FastD2IChecked(OS::nan_value())); |
74 } | 74 } |
75 | 75 |
76 | 76 |
77 TEST(SNPrintF) { | 77 TEST(SNPrintF) { |
78 // Make sure that strings that are truncated because of too small | 78 // Make sure that strings that are truncated because of too small |
79 // buffers are zero-terminated anyway. | 79 // buffers are zero-terminated anyway. |
80 const char* s = "the quick lazy .... oh forget it!"; | 80 const char* s = "the quick lazy .... oh forget it!"; |
81 int length = StrLength(s); | 81 int length = StrLength(s); |
82 for (int i = 1; i < length * 2; i++) { | 82 for (int i = 1; i < length * 2; i++) { |
83 static const char kMarker = static_cast<char>(42); | 83 static const char kMarker = static_cast<char>(42); |
(...skipping 132 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
216 TEST(SequenceCollectorRegression) { | 216 TEST(SequenceCollectorRegression) { |
217 SequenceCollector<char> collector(16); | 217 SequenceCollector<char> collector(16); |
218 collector.StartSequence(); | 218 collector.StartSequence(); |
219 collector.Add('0'); | 219 collector.Add('0'); |
220 collector.AddBlock( | 220 collector.AddBlock( |
221 i::Vector<const char>("12345678901234567890123456789012", 32)); | 221 i::Vector<const char>("12345678901234567890123456789012", 32)); |
222 i::Vector<char> seq = collector.EndSequence(); | 222 i::Vector<char> seq = collector.EndSequence(); |
223 CHECK_EQ(0, strncmp("0123456789012345678901234567890123", | 223 CHECK_EQ(0, strncmp("0123456789012345678901234567890123", |
224 seq.start(), seq.length())); | 224 seq.start(), seq.length())); |
225 } | 225 } |
OLD | NEW |