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 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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); |
84 Vector<char> buffer = Vector<char>::New(i + 1); | 84 Vector<char> buffer = Vector<char>::New(i + 1); |
85 buffer[i] = kMarker; | 85 buffer[i] = kMarker; |
86 int n = OS::SNPrintF(Vector<char>(buffer.start(), i), "%s", s); | 86 int n = SNPrintF(Vector<char>(buffer.start(), i), "%s", s); |
87 CHECK(n <= i); | 87 CHECK(n <= i); |
88 CHECK(n == length || n == -1); | 88 CHECK(n == length || n == -1); |
89 CHECK_EQ(0, strncmp(buffer.start(), s, i - 1)); | 89 CHECK_EQ(0, strncmp(buffer.start(), s, i - 1)); |
90 CHECK_EQ(kMarker, buffer[i]); | 90 CHECK_EQ(kMarker, buffer[i]); |
91 if (i <= length) { | 91 if (i <= length) { |
92 CHECK_EQ(i - 1, StrLength(buffer.start())); | 92 CHECK_EQ(i - 1, StrLength(buffer.start())); |
93 } else { | 93 } else { |
94 CHECK_EQ(length, StrLength(buffer.start())); | 94 CHECK_EQ(length, StrLength(buffer.start())); |
95 } | 95 } |
96 buffer.Dispose(); | 96 buffer.Dispose(); |
(...skipping 114 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
211 TEST(SequenceCollectorRegression) { | 211 TEST(SequenceCollectorRegression) { |
212 SequenceCollector<char> collector(16); | 212 SequenceCollector<char> collector(16); |
213 collector.StartSequence(); | 213 collector.StartSequence(); |
214 collector.Add('0'); | 214 collector.Add('0'); |
215 collector.AddBlock( | 215 collector.AddBlock( |
216 i::Vector<const char>("12345678901234567890123456789012", 32)); | 216 i::Vector<const char>("12345678901234567890123456789012", 32)); |
217 i::Vector<char> seq = collector.EndSequence(); | 217 i::Vector<char> seq = collector.EndSequence(); |
218 CHECK_EQ(0, strncmp("0123456789012345678901234567890123", | 218 CHECK_EQ(0, strncmp("0123456789012345678901234567890123", |
219 seq.start(), seq.length())); | 219 seq.start(), seq.length())); |
220 } | 220 } |
OLD | NEW |