2 * Copyright (C) 2012 The Android Open Source Project
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
22 #include <gtest/gtest.h>
30 #include "buffer_tests.h"
32 #if defined(NOFORTIFY)
33 #define STRING_TEST string_nofortify
35 #define STRING_TEST string
38 #if defined(__BIONIC__)
39 #define STRLCPY_SUPPORTED
40 #define STRLCAT_SUPPORTED
43 constexpr auto KB = 1024;
44 constexpr auto SMALL = 1 * KB;
45 constexpr auto MEDIUM = 4 * KB;
46 constexpr auto LARGE = 64 * KB;
48 static int signum(int i) {
57 TEST(STRING_TEST, strerror) {
59 ASSERT_STREQ("Success", strerror(0));
60 ASSERT_STREQ("Operation not permitted", strerror(1));
63 ASSERT_STREQ("Unknown error -1", strerror(-1));
64 ASSERT_STREQ("Unknown error 1234", strerror(1234));
67 #if defined(__BIONIC__)
68 static void* ConcurrentStrErrorFn(void*) {
69 bool equal = (strcmp("Unknown error 2002", strerror(2002)) == 0);
70 return reinterpret_cast<void*>(equal);
74 // glibc's strerror isn't thread safe, only its strsignal.
75 TEST(STRING_TEST, strerror_concurrent) {
76 #if defined(__BIONIC__)
77 const char* strerror1001 = strerror(1001);
78 ASSERT_STREQ("Unknown error 1001", strerror1001);
81 ASSERT_EQ(0, pthread_create(&t, NULL, ConcurrentStrErrorFn, NULL));
83 ASSERT_EQ(0, pthread_join(t, &result));
84 ASSERT_TRUE(static_cast<bool>(result));
86 ASSERT_STREQ("Unknown error 1001", strerror1001);
88 GTEST_LOG_(INFO) << "Skipping test, requires a thread safe strerror.";
92 TEST(STRING_TEST, gnu_strerror_r) {
95 // Note that glibc doesn't necessarily write into the buffer.
98 ASSERT_STREQ("Success", strerror_r(0, buf, sizeof(buf)));
99 #if defined(__BIONIC__)
100 ASSERT_STREQ("Success", buf);
102 ASSERT_STREQ("Operation not permitted", strerror_r(1, buf, sizeof(buf)));
103 #if defined(__BIONIC__)
104 ASSERT_STREQ("Operation not permitted", buf);
108 ASSERT_STREQ("Unknown error -1", strerror_r(-1, buf, sizeof(buf)));
109 ASSERT_STREQ("Unknown error -1", buf);
110 ASSERT_STREQ("Unknown error 1234", strerror_r(1234, buf, sizeof(buf)));
111 ASSERT_STREQ("Unknown error 1234", buf);
115 memset(buf, 0, sizeof(buf));
116 ASSERT_EQ(buf, strerror_r(4567, buf, 2));
117 ASSERT_STREQ("U", buf);
118 // The GNU strerror_r doesn't set errno (the POSIX one sets it to ERANGE).
122 TEST(STRING_TEST, strsignal) {
124 ASSERT_STREQ("Hangup", strsignal(1));
126 // A real-time signal.
127 ASSERT_STREQ("Real-time signal 14", strsignal(SIGRTMIN + 14));
128 // One of the signals the C library keeps to itself.
129 ASSERT_STREQ("Unknown signal 32", strsignal(__SIGRTMIN));
132 ASSERT_STREQ("Unknown signal -1", strsignal(-1)); // Too small.
133 ASSERT_STREQ("Unknown signal 0", strsignal(0)); // Still too small.
134 ASSERT_STREQ("Unknown signal 1234", strsignal(1234)); // Too large.
137 static void* ConcurrentStrSignalFn(void*) {
138 bool equal = (strcmp("Unknown signal 2002", strsignal(2002)) == 0);
139 return reinterpret_cast<void*>(equal);
142 TEST(STRING_TEST, strsignal_concurrent) {
143 const char* strsignal1001 = strsignal(1001);
144 ASSERT_STREQ("Unknown signal 1001", strsignal1001);
147 ASSERT_EQ(0, pthread_create(&t, NULL, ConcurrentStrSignalFn, NULL));
149 ASSERT_EQ(0, pthread_join(t, &result));
150 ASSERT_TRUE(static_cast<bool>(result));
152 ASSERT_STREQ("Unknown signal 1001", strsignal1001);
155 // TODO: where did this number come from?
158 // For every length we want to test, vary and change alignment
159 // of allocated memory, fill it with some values, calculate
160 // expected result and then run function and compare what we got.
161 // These tests contributed by Intel Corporation.
162 // TODO: make these tests more intention-revealing and less random.
163 template<class Character>
164 class StringTestState {
166 explicit StringTestState(size_t MAX_LEN) : MAX_LEN(MAX_LEN), align1_index_(0), align2_index_(0) {
167 int max_alignment = 64;
169 // TODO: fix the tests to not sometimes use twice their specified "MAX_LEN".
170 glob_ptr = reinterpret_cast<Character*>(memalign(sysconf(_SC_PAGESIZE), 2 * sizeof(Character) * MAX_LEN + max_alignment));
171 glob_ptr1 = reinterpret_cast<Character*>(memalign(sysconf(_SC_PAGESIZE), 2 * sizeof(Character) * MAX_LEN + max_alignment));
172 glob_ptr2 = reinterpret_cast<Character*>(memalign(sysconf(_SC_PAGESIZE), 2 * sizeof(Character) * MAX_LEN + max_alignment));
185 void BeginIterations() {
192 bool HasNextIteration() {
193 return (align1_index_ != (alignments_size - 1) || align2_index_ != (alignments_size - 1));
196 void NextIteration() {
197 if (align1_index_ == (alignments_size - 1) && align2_index_ == (alignments_size - 1)) {
201 if (align1_index_ == (alignments_size - 1)) {
211 const size_t MAX_LEN;
212 Character *ptr, *ptr1, *ptr2;
214 size_t len[ITER + 1];
217 static size_t alignments[];
218 static size_t alignments_size;
219 Character *glob_ptr, *glob_ptr1, *glob_ptr2;
220 size_t align1_index_, align2_index_;
222 // Calculate input lengths and fill state.len with them.
223 // Test small lengths with more density than big ones. Manually push
224 // smallest (0) and biggest (MAX_LEN) lengths. Avoid repeats.
225 // Return number of lengths to test.
226 void InitLenArray() {
229 for (size_t i = 1; i < ITER; ++i) {
230 size_t l = static_cast<size_t>(exp(log(static_cast<double>(MAX_LEN)) * i / ITER));
231 if (l != len[n - 1]) {
238 void ResetPointers() {
239 if (align1_index_ == alignments_size || align2_index_ == alignments_size) {
240 ptr = ptr1 = ptr2 = nullptr;
242 ptr = glob_ptr + alignments[align1_index_];
243 ptr1 = glob_ptr1 + alignments[align1_index_];
244 ptr2 = glob_ptr2 + alignments[align2_index_];
249 template<class Character>
250 size_t StringTestState<Character>::alignments[] = { 24, 32, 16, 48, 0, 1, 2, 3, 4, 5, 6, 7, 11 };
252 template<class Character>
253 size_t StringTestState<Character>::alignments_size = sizeof(alignments)/sizeof(size_t);
255 TEST(STRING_TEST, strcat) {
256 StringTestState<char> state(SMALL);
257 for (size_t i = 1; i < state.n; i++) {
258 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
259 memset(state.ptr2, '\2', state.MAX_LEN);
260 state.ptr2[state.MAX_LEN - 1] = '\0';
261 memcpy(state.ptr, state.ptr2, 2 * state.MAX_LEN);
263 memset(state.ptr1, 'L', state.len[i]);
264 state.ptr1[random() % state.len[i]] = '\0';
265 state.ptr1[state.len[i] - 1] = '\0';
267 strcpy(state.ptr + state.MAX_LEN - 1, state.ptr1);
269 EXPECT_TRUE(strcat(state.ptr2, state.ptr1) == state.ptr2);
270 EXPECT_TRUE(memcmp(state.ptr, state.ptr2, 2 * state.MAX_LEN) == 0);
275 // one byte target with "\0" source
276 TEST(STRING_TEST, strcpy2) {
278 char* orig = strdup("");
279 ASSERT_EQ(buf, strcpy(buf, orig));
280 ASSERT_EQ('\0', buf[0]);
284 // multibyte target where we under fill target
285 TEST(STRING_TEST, strcpy3) {
287 char* orig = strdup("12345");
288 memset(buf, 'A', sizeof(buf));
289 ASSERT_EQ(buf, strcpy(buf, orig));
290 ASSERT_STREQ("12345", buf);
291 ASSERT_EQ('A', buf[6]);
292 ASSERT_EQ('A', buf[7]);
293 ASSERT_EQ('A', buf[8]);
294 ASSERT_EQ('A', buf[9]);
298 // multibyte target where we fill target exactly
299 TEST(STRING_TEST, strcpy4) {
301 char* orig = strdup("123456789");
302 memset(buf, 'A', sizeof(buf));
303 ASSERT_EQ(buf, strcpy(buf, orig));
304 ASSERT_STREQ("123456789", buf);
308 // one byte target with "\0" source
309 TEST(STRING_TEST, stpcpy2) {
311 char* orig = strdup("");
312 ASSERT_EQ(buf, stpcpy(buf, orig));
313 ASSERT_EQ('\0', buf[0]);
317 // multibyte target where we under fill target
318 TEST(STRING_TEST, stpcpy3) {
320 char* orig = strdup("12345");
321 memset(buf, 'A', sizeof(buf));
322 ASSERT_EQ(buf+strlen(orig), stpcpy(buf, orig));
323 ASSERT_STREQ("12345", buf);
324 ASSERT_EQ('A', buf[6]);
325 ASSERT_EQ('A', buf[7]);
326 ASSERT_EQ('A', buf[8]);
327 ASSERT_EQ('A', buf[9]);
331 // multibyte target where we fill target exactly
332 TEST(STRING_TEST, stpcpy4) {
334 char* orig = strdup("123456789");
335 memset(buf, 'A', sizeof(buf));
336 ASSERT_EQ(buf+strlen(orig), stpcpy(buf, orig));
337 ASSERT_STREQ("123456789", buf);
341 TEST(STRING_TEST, strcat2) {
343 memset(buf, 'A', sizeof(buf));
346 char* res = strcat(buf, "01234");
348 ASSERT_STREQ("a01234", buf);
349 ASSERT_EQ('A', buf[7]);
350 ASSERT_EQ('A', buf[8]);
351 ASSERT_EQ('A', buf[9]);
354 TEST(STRING_TEST, strcat3) {
356 memset(buf, 'A', sizeof(buf));
359 char* res = strcat(buf, "01234567");
361 ASSERT_STREQ("a01234567", buf);
364 TEST(STRING_TEST, strncat2) {
366 memset(buf, 'A', sizeof(buf));
369 char* res = strncat(buf, "01234", sizeof(buf) - strlen(buf) - 1);
371 ASSERT_STREQ("a01234", buf);
372 ASSERT_EQ('A', buf[7]);
373 ASSERT_EQ('A', buf[8]);
374 ASSERT_EQ('A', buf[9]);
377 TEST(STRING_TEST, strncat3) {
379 memset(buf, 'A', sizeof(buf));
382 char* res = strncat(buf, "0123456789", 5);
384 ASSERT_STREQ("a01234", buf);
385 ASSERT_EQ('A', buf[7]);
386 ASSERT_EQ('A', buf[8]);
387 ASSERT_EQ('A', buf[9]);
390 TEST(STRING_TEST, strncat4) {
392 memset(buf, 'A', sizeof(buf));
395 char* res = strncat(buf, "01234567", 8);
397 ASSERT_STREQ("a01234567", buf);
400 TEST(STRING_TEST, strncat5) {
402 memset(buf, 'A', sizeof(buf));
405 char* res = strncat(buf, "01234567", 9);
407 ASSERT_STREQ("a01234567", buf);
410 TEST(STRING_TEST, strchr_with_0) {
412 const char* s = "01234";
413 memcpy(buf, s, strlen(s) + 1);
414 EXPECT_TRUE(strchr(buf, '\0') == (buf + strlen(s)));
417 TEST(STRING_TEST, strchr_multiple) {
419 memset(str, 'a', sizeof(str) - 1);
420 str[sizeof(str)-1] = '\0';
422 // Verify that strchr finds the first occurrence of 'a' in a string
423 // filled with 'a' characters. Iterate over the string putting
424 // non 'a' characters at the front of the string during each iteration
425 // and continue to verify that strchr can find the first occurrence
426 // properly. The idea is to cover all possible alignments of the location
427 // of the first occurrence of the 'a' character and which includes
428 // other 'a' characters close by.
429 for (size_t i = 0; i < sizeof(str) - 1; i++) {
430 EXPECT_EQ(&str[i], strchr(str, 'a'));
435 TEST(STRING_TEST, strchr) {
438 StringTestState<char> state(SMALL);
439 for (size_t i = 1; i < state.n; i++) {
440 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
441 if (~seek_char > 0) {
442 memset(state.ptr1, ~seek_char, state.len[i]);
444 memset(state.ptr1, '\1', state.len[i]);
446 state.ptr1[state.len[i] - 1] = '\0';
448 size_t pos = random() % state.MAX_LEN;
450 if (pos >= state.len[i] - 1) {
451 if (seek_char == 0) {
452 expected = state.ptr1 + state.len[i] - 1;
457 state.ptr1[pos] = seek_char;
458 expected = state.ptr1 + pos;
461 ASSERT_TRUE(strchr(state.ptr1, seek_char) == expected);
466 TEST(STRING_TEST, strchrnul) {
467 const char* s = "01234222";
468 EXPECT_TRUE(strchrnul(s, '2') == &s[2]);
469 EXPECT_TRUE(strchrnul(s, '8') == (s + strlen(s)));
470 EXPECT_TRUE(strchrnul(s, '\0') == (s + strlen(s)));
473 TEST(STRING_TEST, strcmp) {
474 StringTestState<char> state(SMALL);
475 for (size_t i = 1; i < state.n; i++) {
476 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
477 memset(state.ptr1, 'v', state.MAX_LEN);
478 memset(state.ptr2, 'n', state.MAX_LEN);
479 state.ptr1[state.len[i] - 1] = '\0';
480 state.ptr2[state.len[i] - 1] = '\0';
482 size_t pos = 1 + (random() % (state.MAX_LEN - 1));
485 if (pos >= state.len[i] - 1) {
486 memcpy(state.ptr1, state.ptr2, state.len[i]);
488 actual = strcmp(state.ptr1, state.ptr2);
490 memcpy(state.ptr1, state.ptr2, pos);
491 if (state.ptr1[pos] > state.ptr2[pos]) {
493 } else if (state.ptr1[pos] == state.ptr2[pos]) {
494 state.ptr1[pos + 1] = '\0';
495 state.ptr2[pos + 1] = '\0';
500 actual = strcmp(state.ptr1, state.ptr2);
503 ASSERT_EQ(expected, signum(actual));
508 TEST(STRING_TEST, stpcpy) {
509 StringTestState<char> state(SMALL);
510 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
511 size_t pos = random() % state.MAX_LEN;
513 memset(state.ptr1, '\2', pos);
514 state.ptr1[pos] = '\0';
515 state.ptr1[state.MAX_LEN - 1] = '\0';
517 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
519 memset(state.ptr2, '\1', state.MAX_LEN);
520 state.ptr2[state.MAX_LEN - 1] = '\0';
522 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
523 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1);
524 state.ptr[2 * state.MAX_LEN - 1] = '\0';
526 ASSERT_TRUE(stpcpy(state.ptr2, state.ptr1) == state.ptr2 + strlen(state.ptr1));
527 ASSERT_FALSE((memcmp(state.ptr1, state.ptr, state.MAX_LEN)) != 0 ||
528 (memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN) != 0));
532 TEST(STRING_TEST, strcpy) {
533 StringTestState<char> state(SMALL);
534 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
535 size_t pos = random() % state.MAX_LEN;
537 memset(state.ptr1, '\2', pos);
538 state.ptr1[pos] = '\0';
539 state.ptr1[state.MAX_LEN - 1] = '\0';
541 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
543 memset(state.ptr2, '\1', state.MAX_LEN);
544 state.ptr2[state.MAX_LEN - 1] = '\0';
546 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
547 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1);
548 state.ptr[2 * state.MAX_LEN - 1] = '\0';
550 ASSERT_TRUE(strcpy(state.ptr2, state.ptr1) == state.ptr2);
551 ASSERT_FALSE((memcmp(state.ptr1, state.ptr, state.MAX_LEN)) != 0 ||
552 (memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN) != 0));
556 TEST(STRING_TEST, strlcat) {
557 #if defined(STRLCAT_SUPPORTED)
558 StringTestState<char> state(SMALL);
559 for (size_t i = 0; i < state.n; i++) {
560 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
561 memset(state.ptr2, '\2', state.MAX_LEN + state.len[i]);
562 state.ptr2[state.MAX_LEN - 1] = '\0';
563 memcpy(state.ptr, state.ptr2, state.MAX_LEN + state.len[i]);
565 size_t pos = random() % state.MAX_LEN;
566 memset(state.ptr1, '\3', pos);
567 state.ptr1[pos] = '\0';
568 if (pos < state.len[i]) {
569 memcpy(state.ptr + state.MAX_LEN - 1, state.ptr1, pos + 1);
571 memcpy(state.ptr + state.MAX_LEN - 1, state.ptr1, state.len[i]);
572 state.ptr[state.MAX_LEN + state.len[i] - 1] = '\0';
575 strlcat(state.ptr2, state.ptr1, state.MAX_LEN + state.len[i]);
577 ASSERT_TRUE(memcmp(state.ptr, state.ptr2, state.MAX_LEN + state.len[i]) == 0);
581 GTEST_LOG_(INFO) << "Skipping test, strlcat not supported on this platform.";
585 TEST(STRING_TEST, strlcpy) {
586 #if defined(STRLCPY_SUPPORTED)
587 StringTestState<char> state(SMALL);
588 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
590 memset(state.ptr1, rand, state.MAX_LEN);
592 size_t pos = random() % state.MAX_LEN;
593 if (pos < state.MAX_LEN) {
594 state.ptr1[pos] = '\0';
596 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
598 memset(state.ptr2, 'I', state.MAX_LEN);
599 memcpy(state.ptr + state.MAX_LEN, state.ptr2, state.MAX_LEN);
601 if (pos > state.MAX_LEN - 1) {
602 memcpy(state.ptr + state.MAX_LEN, state.ptr1, state.MAX_LEN);
603 state.ptr[2 * state.MAX_LEN - 1] = '\0';
605 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1);
608 ASSERT_EQ(strlcpy(state.ptr2, state.ptr1, state.MAX_LEN), strlen(state.ptr1));
609 ASSERT_FALSE((memcmp(state.ptr1, state.ptr, state.MAX_LEN) != 0) ||
610 (memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN) != 0));
613 GTEST_LOG_(INFO) << "Skipping test, strlcpy not supported on this platform.";
617 TEST(STRING_TEST, strncat) {
618 StringTestState<char> state(SMALL);
619 for (size_t i = 1; i < state.n; i++) {
620 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
621 memset(state.ptr2, '\2', state.MAX_LEN);
622 state.ptr2[state.MAX_LEN - 1] = '\0';
623 memcpy(state.ptr, state.ptr2, 2 * state.MAX_LEN);
625 memset(state.ptr1, 'I', state.len[i]);
626 state.ptr1[random() % state.len[i]] = '\0';
627 state.ptr1[state.len[i] - 1] = '\0';
629 size_t pos = strlen(state.ptr1);
631 size_t actual = random() % state.len[i];
632 strncpy(state.ptr + state.MAX_LEN - 1, state.ptr1, std::min(actual, pos));
633 state.ptr[state.MAX_LEN + std::min(actual, pos) - 1] = '\0';
635 ASSERT_TRUE(strncat(state.ptr2, state.ptr1, actual) == state.ptr2);
636 ASSERT_EQ(memcmp(state.ptr, state.ptr2, 2 * state.MAX_LEN), 0);
641 TEST(STRING_TEST, strncmp) {
642 StringTestState<char> state(SMALL);
643 for (size_t i = 1; i < state.n; i++) {
644 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
645 memset(state.ptr1, 'v', state.MAX_LEN);
646 memset(state.ptr2, 'n', state.MAX_LEN);
647 state.ptr1[state.len[i] - 1] = '\0';
648 state.ptr2[state.len[i] - 1] = '\0';
650 size_t pos = 1 + (random() % (state.MAX_LEN - 1));
653 if (pos >= state.len[i] - 1) {
654 memcpy(state.ptr1, state.ptr2, state.len[i]);
656 actual = strncmp(state.ptr1, state.ptr2, state.len[i]);
658 memcpy(state.ptr1, state.ptr2, pos);
659 if (state.ptr1[pos] > state.ptr2[pos]) {
661 } else if (state.ptr1[pos] == state.ptr2[pos]) {
662 state.ptr1[pos + 1] = '\0';
663 state.ptr2[pos + 1] = '\0';
668 actual = strncmp(state.ptr1, state.ptr2, state.len[i]);
671 ASSERT_EQ(expected, signum(actual));
676 TEST(STRING_TEST, stpncpy) {
677 StringTestState<char> state(SMALL);
678 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
679 memset(state.ptr1, 'J', state.MAX_LEN);
680 // Choose a random size for our src buffer.
681 size_t ptr1_len = random() % state.MAX_LEN;
682 state.ptr1[ptr1_len] = '\0';
683 // Copy ptr1 into ptr, used to verify that ptr1 does not get modified.
684 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
685 // Init ptr2 to a set value.
686 memset(state.ptr2, '\1', state.MAX_LEN);
688 // Choose a random amount of data to copy.
689 size_t copy_len = random() % state.MAX_LEN;
691 // Set the second half of ptr to the expected pattern in ptr2.
692 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
693 memcpy(state.ptr + state.MAX_LEN, state.ptr1, copy_len);
695 if (copy_len > ptr1_len) {
696 memset(state.ptr + state.MAX_LEN + ptr1_len, '\0', copy_len - ptr1_len);
697 expected_end = ptr1_len;
699 expected_end = copy_len;
702 ASSERT_EQ(state.ptr2 + expected_end, stpncpy(state.ptr2, state.ptr1, copy_len));
704 // Verify ptr1 was not modified.
705 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr, state.MAX_LEN));
706 // Verify ptr2 contains the expected data.
707 ASSERT_EQ(0, memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN));
711 TEST(STRING_TEST, strncpy) {
712 StringTestState<char> state(SMALL);
713 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
714 // Choose a random value to fill the string, except \0 (string terminator),
715 // or \1 (guarantees it's different from anything in ptr2).
716 memset(state.ptr1, 'K', state.MAX_LEN);
717 // Choose a random size for our src buffer.
718 size_t ptr1_len = random() % state.MAX_LEN;
719 state.ptr1[ptr1_len] = '\0';
720 // Copy ptr1 into ptr, used to verify that ptr1 does not get modified.
721 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
722 // Init ptr2 to a set value.
723 memset(state.ptr2, '\1', state.MAX_LEN);
725 // Choose a random amount of data to copy.
726 size_t copy_len = random() % state.MAX_LEN;
728 // Set the second half of ptr to the expected pattern in ptr2.
729 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
730 memcpy(state.ptr + state.MAX_LEN, state.ptr1, copy_len);
732 if (copy_len > ptr1_len) {
733 memset(state.ptr + state.MAX_LEN + ptr1_len, '\0', copy_len - ptr1_len);
734 expected_end = ptr1_len;
736 expected_end = copy_len;
739 ASSERT_EQ(state.ptr2 + expected_end, stpncpy(state.ptr2, state.ptr1, copy_len));
741 // Verify ptr1 was not modified.
742 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr, state.MAX_LEN));
743 // Verify ptr2 contains the expected data.
744 ASSERT_EQ(0, memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN));
748 TEST(STRING_TEST, strrchr) {
750 StringTestState<char> state(SMALL);
751 for (size_t i = 1; i < state.n; i++) {
752 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
753 if (~seek_char > 0) {
754 memset(state.ptr1, ~seek_char, state.len[i]);
756 memset(state.ptr1, '\1', state.len[i]);
758 state.ptr1[state.len[i] - 1] = '\0';
760 size_t pos = random() % state.MAX_LEN;
762 if (pos >= state.len[i] - 1) {
763 if (seek_char == 0) {
764 expected = state.ptr1 + state.len[i] - 1;
769 state.ptr1[pos] = seek_char;
770 expected = state.ptr1 + pos;
773 ASSERT_TRUE(strrchr(state.ptr1, seek_char) == expected);
778 TEST(STRING_TEST, memchr) {
780 StringTestState<char> state(SMALL);
781 for (size_t i = 0; i < state.n; i++) {
782 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
783 memset(state.ptr1, ~seek_char, state.len[i]);
785 size_t pos = random() % state.MAX_LEN;
787 if (pos >= state.len[i]) {
790 state.ptr1[pos] = seek_char;
791 expected = state.ptr1 + pos;
794 ASSERT_TRUE(memchr(state.ptr1, seek_char, state.len[i]) == expected);
799 TEST(STRING_TEST, memchr_zero) {
801 ASSERT_EQ(0, posix_memalign(reinterpret_cast<void**>(&buffer), 64, 64));
802 memset(buffer, 10, 64);
803 ASSERT_TRUE(NULL == memchr(buffer, 5, 0));
804 ASSERT_TRUE(NULL == memchr(buffer, 10, 0));
807 TEST(STRING_TEST, memrchr) {
809 StringTestState<char> state(SMALL);
810 for (size_t i = 0; i < state.n; i++) {
811 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
812 memset(state.ptr1, ~seek_char, state.len[i]);
814 size_t pos = random() % state.MAX_LEN;
816 if (pos >= state.len[i]) {
819 state.ptr1[pos] = seek_char;
820 expected = state.ptr1 + pos;
823 ASSERT_TRUE(memrchr(state.ptr1, seek_char, state.len[i]) == expected);
828 TEST(STRING_TEST, memcmp) {
829 StringTestState<char> state(SMALL);
830 for (size_t i = 0; i < state.n; i++) {
831 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
834 memset(state.ptr1, c1, state.MAX_LEN);
835 memset(state.ptr2, c1, state.MAX_LEN);
837 int pos = (state.len[i] == 0) ? 0 : (random() % state.len[i]);
838 state.ptr2[pos] = c2;
840 int expected = (static_cast<int>(c1) - static_cast<int>(c2));
841 int actual = memcmp(state.ptr1, state.ptr2, state.MAX_LEN);
843 ASSERT_EQ(signum(expected), signum(actual));
848 TEST(STRING_TEST, wmemcmp) {
849 StringTestState<wchar_t> state(SMALL);
851 for (size_t i = 0; i < state.n; i++) {
852 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
853 long long mask = ((long long) 1 << 8 * sizeof(wchar_t)) - 1;
854 int c1 = rand() & mask;
855 int c2 = rand() & mask;
856 wmemset(state.ptr1, c1, state.MAX_LEN);
857 wmemset(state.ptr2, c1, state.MAX_LEN);
859 int pos = (state.len[i] == 0) ? 0 : (random() % state.len[i]);
860 state.ptr2[pos] = c2;
862 int expected = (static_cast<int>(c1) - static_cast<int>(c2));
863 int actual = wmemcmp(state.ptr1, state.ptr2, (size_t) state.MAX_LEN);
865 ASSERT_EQ(signum(expected), signum(actual));
870 TEST(STRING_TEST, memcpy) {
871 StringTestState<char> state(LARGE);
873 for (size_t i = 0; i < state.n - 1; i++) {
874 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
875 size_t pos = random() % (state.MAX_LEN - state.len[i]);
877 memset(state.ptr1, rand, state.len[i]);
878 memset(state.ptr1 + state.len[i], ~rand, state.MAX_LEN - state.len[i]);
880 memset(state.ptr2, rand, state.len[i]);
881 memset(state.ptr2 + state.len[i], ~rand, state.MAX_LEN - state.len[i]);
882 memset(state.ptr2 + pos, '\0', state.len[i]);
884 ASSERT_FALSE(memcpy(state.ptr2 + pos, state.ptr1 + pos, state.len[i]) != state.ptr2 + pos);
885 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr2, state.MAX_LEN));
890 TEST(STRING_TEST, memset) {
891 StringTestState<char> state(LARGE);
893 for (size_t i = 0; i < state.n - 1; i++) {
894 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
895 memset(state.ptr1, ~ch, state.MAX_LEN);
896 memcpy(state.ptr2, state.ptr1, state.MAX_LEN);
898 size_t pos = random () % (state.MAX_LEN - state.len[i]);
899 for (size_t k = pos; k < pos + state.len[i]; k++) {
903 ASSERT_TRUE(memset(state.ptr2 + pos, ch, state.len[i]) == state.ptr2 + pos);
905 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr2, state.MAX_LEN));
910 TEST(STRING_TEST, memmove) {
911 StringTestState<char> state(LARGE);
912 for (size_t i = 0; i < state.n - 1; i++) {
913 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
914 memset(state.ptr1, 'Q', 2 * state.MAX_LEN);
916 size_t pos = random() % (state.MAX_LEN - state.len[i]);
918 memset(state.ptr1, 'R', state.len[i]);
919 memcpy(state.ptr2, state.ptr1, 2 * state.MAX_LEN);
920 memcpy(state.ptr, state.ptr1, state.len[i]);
921 memcpy(state.ptr1 + pos, state.ptr, state.len[i]);
923 ASSERT_TRUE(memmove(state.ptr2 + pos, state.ptr2, state.len[i]) == state.ptr2 + pos);
924 ASSERT_EQ(0, memcmp(state.ptr2, state.ptr1, 2 * state.MAX_LEN));
929 TEST(STRING_TEST, memmove_cache_size) {
931 int max_alignment = 31;
932 int alignments[] = {0, 5, 11, 29, 30};
933 char* ptr = reinterpret_cast<char*>(malloc(sizeof(char) * len));
934 char* ptr1 = reinterpret_cast<char*>(malloc(2 * sizeof(char) * len));
935 char* glob_ptr2 = reinterpret_cast<char*>(malloc(2 * sizeof(char) * len + max_alignment));
938 ASSERT_TRUE(ptr != NULL);
939 ASSERT_TRUE(ptr1 != NULL);
940 ASSERT_TRUE(glob_ptr2 != NULL);
942 for (int i = 0; i < 5; i++) {
943 char* ptr2 = glob_ptr2 + alignments[i];
944 memset(ptr1, 'S', 2 * len);
945 memset(ptr1, 'T', len);
946 memcpy(ptr2, ptr1, 2 * len);
947 memcpy(ptr, ptr1, len);
948 memcpy(ptr1 + pos, ptr, len);
950 ASSERT_TRUE(memmove(ptr2 + pos, ptr, len) == ptr2 + pos);
951 ASSERT_EQ(0, memcmp(ptr2, ptr1, 2 * len));
958 static void verify_memmove(char* src_copy, char* dst, char* src, size_t size) {
959 memset(dst, 0, size);
960 memcpy(src, src_copy, size);
961 ASSERT_EQ(dst, memmove(dst, src, size));
962 ASSERT_EQ(0, memcmp(dst, src_copy, size));
965 #define MEMMOVE_DATA_SIZE (1024*1024*3)
967 TEST(STRING_TEST, memmove_check) {
968 char* buffer = reinterpret_cast<char*>(malloc(MEMMOVE_DATA_SIZE));
969 ASSERT_TRUE(buffer != NULL);
971 char* src_data = reinterpret_cast<char*>(malloc(MEMMOVE_DATA_SIZE));
972 ASSERT_TRUE(src_data != NULL);
973 // Initialize to a known pattern to copy into src for each test and
974 // to compare dst against.
975 for (size_t i = 0; i < MEMMOVE_DATA_SIZE; i++) {
976 src_data[i] = (i + 1) % 255;
979 // Check all different dst offsets between 0 and 127 inclusive.
981 for (size_t i = 0; i < 127; i++) {
982 char* dst = buffer + 256 + i;
984 verify_memmove(src_data, dst, src, 1024);
987 verify_memmove(src_data, dst, src, 64 * 1024);
990 verify_memmove(src_data, dst, src, 1024 * 1024 + 128 * 1024);
993 // Check all leftover size offsets between 1 and 127 inclusive.
994 char* dst = buffer + 256;
996 for (size_t size = 1; size < 127; size++) {
998 verify_memmove(src_data, dst, src, 1024);
1001 verify_memmove(src_data, dst, src, 64 * 1024);
1004 verify_memmove(src_data, dst, src, 1024 * 1024 + 128 * 1024);
1008 TEST(STRING_TEST, bcopy) {
1009 StringTestState<char> state(LARGE);
1010 for (size_t i = 0; i < state.n; i++) {
1011 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
1012 memset(state.ptr1, '4', state.MAX_LEN);
1013 memset(state.ptr1 + state.MAX_LEN, 'a', state.MAX_LEN);
1014 memcpy(state.ptr2, state.ptr1, 2 * state.MAX_LEN);
1016 size_t start = random() % (2 * state.MAX_LEN - state.len[i]);
1017 memcpy(state.ptr2 + start, state.ptr1, state.len[i]);
1019 bcopy(state.ptr1, state.ptr1 + start, state.len[i]);
1020 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr2, 2 * state.MAX_LEN));
1025 TEST(STRING_TEST, bzero) {
1026 StringTestState<char> state(LARGE);
1027 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
1028 memset(state.ptr1, 'R', state.MAX_LEN);
1030 size_t start = random() % state.MAX_LEN;
1031 size_t end = start + random() % (state.MAX_LEN - start);
1033 memcpy(state.ptr2, state.ptr1, start);
1034 memset(state.ptr2 + start, '\0', end - start);
1035 memcpy(state.ptr2 + end, state.ptr1 + end, state.MAX_LEN - end);
1037 bzero(state.ptr1 + start, end - start);
1039 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr2, state.MAX_LEN));
1043 static void DoMemcpyTest(uint8_t* src, uint8_t* dst, size_t len) {
1044 memset(src, (len % 255) + 1, len);
1045 memset(dst, 0, len);
1047 ASSERT_EQ(dst, memcpy(dst, src, len));
1048 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1051 TEST(STRING_TEST, memcpy_align) {
1052 RunSrcDstBufferAlignTest(LARGE, DoMemcpyTest);
1055 TEST(STRING_TEST, memcpy_overread) {
1056 RunSrcDstBufferOverreadTest(DoMemcpyTest);
1059 static void DoMemmoveTest(uint8_t* src, uint8_t* dst, size_t len) {
1060 memset(src, (len % 255) + 1, len);
1061 memset(dst, 0, len);
1063 ASSERT_EQ(dst, memmove(dst, src, len));
1064 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1067 TEST(STRING_TEST, memmove_align) {
1068 RunSrcDstBufferAlignTest(LARGE, DoMemmoveTest);
1071 TEST(STRING_TEST, memmove_overread) {
1072 RunSrcDstBufferOverreadTest(DoMemmoveTest);
1075 static void DoMemsetTest(uint8_t* buf, size_t len) {
1076 for (size_t i = 0; i < len; i++) {
1079 int value = (len % 255) + 1;
1080 ASSERT_EQ(buf, memset(buf, value, len));
1081 for (size_t i = 0; i < len; i++) {
1082 ASSERT_EQ(value, buf[i]);
1086 TEST(STRING_TEST, memset_align) {
1087 RunSingleBufferAlignTest(LARGE, DoMemsetTest);
1090 static void DoStrlenTest(uint8_t* buf, size_t len) {
1092 memset(buf, (32 + (len % 96)), len - 1);
1094 ASSERT_EQ(len-1, strlen(reinterpret_cast<char*>(buf)));
1098 TEST(STRING_TEST, strlen_align) {
1099 RunSingleBufferAlignTest(LARGE, DoStrlenTest);
1102 TEST(STRING_TEST, strlen_overread) {
1103 RunSingleBufferOverreadTest(DoStrlenTest);
1106 static void DoStrcpyTest(uint8_t* src, uint8_t* dst, size_t len) {
1108 memset(src, (32 + (len % 96)), len - 1);
1110 memset(dst, 0, len);
1111 ASSERT_EQ(dst, reinterpret_cast<uint8_t*>(strcpy(reinterpret_cast<char*>(dst),
1112 reinterpret_cast<char*>(src))));
1113 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1117 TEST(STRING_TEST, strcpy_align) {
1118 RunSrcDstBufferAlignTest(LARGE, DoStrcpyTest);
1121 TEST(STRING_TEST, strcpy_overread) {
1122 RunSrcDstBufferOverreadTest(DoStrcpyTest);
1125 #if defined(STRLCPY_SUPPORTED)
1126 static void DoStrlcpyTest(uint8_t* src, uint8_t* dst, size_t len) {
1128 memset(src, (32 + (len % 96)), len - 1);
1130 memset(dst, 0, len);
1131 ASSERT_EQ(len-1, strlcpy(reinterpret_cast<char*>(dst),
1132 reinterpret_cast<char*>(src), len));
1133 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1138 TEST(STRING_TEST, strlcpy_align) {
1139 #if defined(STRLCPY_SUPPORTED)
1140 RunSrcDstBufferAlignTest(LARGE, DoStrlcpyTest);
1142 GTEST_LOG_(INFO) << "Skipping test, strlcpy not supported on this platform.";
1146 TEST(STRING_TEST, strlcpy_overread) {
1147 #if defined(STRLCPY_SUPPORTED)
1148 RunSrcDstBufferOverreadTest(DoStrlcpyTest);
1150 GTEST_LOG_(INFO) << "Skipping test, strlcpy not supported on this platform.";
1155 static void DoStpcpyTest(uint8_t* src, uint8_t* dst, size_t len) {
1157 memset(src, (32 + (len % 96)), len - 1);
1159 memset(dst, 0, len);
1160 ASSERT_EQ(dst+len-1, reinterpret_cast<uint8_t*>(stpcpy(reinterpret_cast<char*>(dst),
1161 reinterpret_cast<char*>(src))));
1162 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1166 TEST(STRING_TEST, stpcpy_align) {
1167 RunSrcDstBufferAlignTest(LARGE, DoStpcpyTest);
1170 TEST(STRING_TEST, stpcpy_overread) {
1171 RunSrcDstBufferOverreadTest(DoStpcpyTest);
1174 // Use our own incrementer to cut down on the total number of calls.
1175 static size_t LargeSetIncrement(size_t len) {
1178 } else if (len >= 1024) {
1180 } else if (len >= 256) {
1186 #define STRCAT_DST_LEN 64
1188 static void DoStrcatTest(uint8_t* src, uint8_t* dst, size_t len) {
1190 int value = 32 + (len % 96);
1191 memset(src, value, len - 1);
1194 if (len >= STRCAT_DST_LEN) {
1195 // Create a small buffer for doing quick compares in each loop.
1196 uint8_t cmp_buf[STRCAT_DST_LEN];
1197 // Make sure dst string contains a different value then the src string.
1198 int value2 = 32 + (value + 2) % 96;
1199 memset(cmp_buf, value2, sizeof(cmp_buf));
1201 for (size_t i = 1; i <= STRCAT_DST_LEN;) {
1202 memset(dst, value2, i-1);
1203 memset(dst+i-1, 0, len-i);
1205 ASSERT_EQ(dst, reinterpret_cast<uint8_t*>(strcat(reinterpret_cast<char*>(dst),
1206 reinterpret_cast<char*>(src))));
1207 ASSERT_TRUE(memcmp(dst, cmp_buf, i-1) == 0);
1208 ASSERT_TRUE(memcmp(src, dst+i-1, len-i+1) == 0);
1209 // This is an expensive loop, so don't loop through every value,
1210 // get to a certain size and then start doubling.
1219 ASSERT_EQ(dst, reinterpret_cast<uint8_t*>(strcat(reinterpret_cast<char*>(dst),
1220 reinterpret_cast<char*>(src))));
1221 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1226 TEST(STRING_TEST, strcat_align) {
1227 RunSrcDstBufferAlignTest(MEDIUM, DoStrcatTest, LargeSetIncrement);
1230 TEST(STRING_TEST, strcat_overread) {
1231 RunSrcDstBufferOverreadTest(DoStrcatTest);
1234 #if defined(STRLCAT_SUPPORTED)
1235 static void DoStrlcatTest(uint8_t* src, uint8_t* dst, size_t len) {
1237 int value = 32 + (len % 96);
1238 memset(src, value, len - 1);
1241 if (len >= STRCAT_DST_LEN) {
1242 // Create a small buffer for doing quick compares in each loop.
1243 uint8_t cmp_buf[STRCAT_DST_LEN];
1244 // Make sure dst string contains a different value then the src string.
1245 int value2 = 32 + (value + 2) % 96;
1246 memset(cmp_buf, value2, sizeof(cmp_buf));
1248 for (size_t i = 1; i <= STRCAT_DST_LEN;) {
1249 memset(dst, value2, i-1);
1250 memset(dst+i-1, 0, len-i);
1252 ASSERT_EQ(len-1, strlcat(reinterpret_cast<char*>(dst),
1253 reinterpret_cast<char*>(src), len));
1254 ASSERT_TRUE(memcmp(dst, cmp_buf, i-1) == 0);
1255 ASSERT_TRUE(memcmp(src, dst+i-1, len-i+1) == 0);
1256 // This is an expensive loop, so don't loop through every value,
1257 // get to a certain size and then start doubling.
1266 ASSERT_EQ(len-1, strlcat(reinterpret_cast<char*>(dst),
1267 reinterpret_cast<char*>(src), len));
1268 ASSERT_TRUE(memcmp(src, dst, len) == 0);
1274 TEST(STRING_TEST, strlcat_align) {
1275 #if defined(STRLCAT_SUPPORTED)
1276 RunSrcDstBufferAlignTest(MEDIUM, DoStrlcatTest, LargeSetIncrement);
1278 GTEST_LOG_(INFO) << "Skipping test, strlcat not supported on this platform.";
1282 TEST(STRING_TEST, strlcat_overread) {
1283 #if defined(STRLCAT_SUPPORTED)
1284 RunSrcDstBufferOverreadTest(DoStrlcatTest);
1286 GTEST_LOG_(INFO) << "Skipping test, strlcat not supported on this platform.";
1290 static void DoStrcmpTest(uint8_t* buf1, uint8_t* buf2, size_t len) {
1292 memset(buf1, (32 + (len % 96)), len - 1);
1294 memset(buf2, (32 + (len % 96)), len - 1);
1296 ASSERT_EQ(0, strcmp(reinterpret_cast<char*>(buf1),
1297 reinterpret_cast<char*>(buf2)));
1301 static void DoStrcmpFailTest(uint8_t* buf1, uint8_t* buf2, size_t len1, size_t len2) {
1302 // Do string length differences.
1303 int c = (32 + (len1 % 96));
1304 memset(buf1, c, len1 - 1);
1305 buf1[len1-1] = '\0';
1306 memset(buf2, c, len2 - 1);
1307 buf2[len2-1] = '\0';
1308 ASSERT_NE(0, strcmp(reinterpret_cast<char*>(buf1),
1309 reinterpret_cast<char*>(buf2)));
1311 // Do single character differences.
1318 // Need at least a two character buffer to do this test.
1322 int diff_c = (c + 1) % 96;
1324 buf1[len-2] = diff_c;
1325 ASSERT_NE(0, strcmp(reinterpret_cast<char*>(buf1),
1326 reinterpret_cast<char*>(buf2)));
1329 buf2[len-2] = diff_c;
1330 ASSERT_NE(0, strcmp(reinterpret_cast<char*>(buf1),
1331 reinterpret_cast<char*>(buf2)));
1335 TEST(STRING_TEST, strcmp_align) {
1336 RunCmpBufferAlignTest(MEDIUM, DoStrcmpTest, DoStrcmpFailTest, LargeSetIncrement);
1339 TEST(STRING_TEST, strcmp_overread) {
1340 RunCmpBufferOverreadTest(DoStrcmpTest, DoStrcmpFailTest);
1343 static void DoMemcmpTest(uint8_t* buf1, uint8_t* buf2, size_t len) {
1344 memset(buf1, len+1, len);
1345 memset(buf2, len+1, len);
1346 ASSERT_EQ(0, memcmp(buf1, buf2, len));
1349 static void DoMemcmpFailTest(uint8_t* buf1, uint8_t* buf2, size_t len1, size_t len2) {
1357 memset(buf1, len2+1, len);
1359 memset(buf2, len2+1, len);
1360 ASSERT_NE(0, memcmp(buf1, buf2, len));
1362 buf1[len-1] = len2+1;
1364 ASSERT_NE(0, memcmp(buf1, buf2, len));
1367 TEST(STRING_TEST, memcmp_align) {
1368 RunCmpBufferAlignTest(MEDIUM, DoMemcmpTest, DoMemcmpFailTest, LargeSetIncrement);
1371 TEST(STRING_TEST, memcmp_overread) {
1372 RunCmpBufferOverreadTest(DoMemcmpTest, DoMemcmpFailTest);
1375 static void DoStrchrTest(uint8_t* buf, size_t len) {
1377 char value = 32 + (len % 96);
1378 char search_value = 33 + (len % 96);
1379 memset(buf, value, len - 1);
1381 ASSERT_EQ(NULL, strchr(reinterpret_cast<char*>(buf), search_value));
1382 ASSERT_EQ(reinterpret_cast<char*>(&buf[len-1]), strchr(reinterpret_cast<char*>(buf), '\0'));
1384 buf[0] = search_value;
1385 ASSERT_EQ(reinterpret_cast<char*>(&buf[0]), strchr(reinterpret_cast<char*>(buf), search_value));
1387 buf[len-2] = search_value;
1388 ASSERT_EQ(reinterpret_cast<char*>(&buf[len-2]), strchr(reinterpret_cast<char*>(buf), search_value));
1393 TEST(STRING_TEST, strchr_align) {
1394 RunSingleBufferAlignTest(MEDIUM, DoStrchrTest);
1397 TEST(STRING_TEST, strchr_overread) {
1398 RunSingleBufferOverreadTest(DoStrchrTest);
1401 static void TestBasename(const char* in, const char* expected_out) {
1403 const char* out = basename(in);
1404 ASSERT_STREQ(expected_out, out) << in;
1405 ASSERT_EQ(0, errno) << in;
1408 TEST(STRING_TEST, __gnu_basename) {
1409 TestBasename("", "");
1410 TestBasename("/usr/lib", "lib");
1411 TestBasename("/usr/", "");
1412 TestBasename("usr", "usr");
1413 TestBasename("/", "");
1414 TestBasename(".", ".");
1415 TestBasename("..", "..");
1416 TestBasename("///", "");
1417 TestBasename("//usr//lib//", "");
1420 TEST(STRING_TEST, strnlen_147048) {
1421 // https://code.google.com/p/android/issues/detail?id=147048
1422 char stack_src[64] = {0};
1423 EXPECT_EQ(0U, strnlen(stack_src, 1024*1024*1024));
1424 char* heap_src = new char[1];
1426 EXPECT_EQ(0U, strnlen(heap_src, 1024*1024*1024));
1430 TEST(STRING_TEST, strnlen_74741) {
1431 ASSERT_EQ(4U, strnlen("test", SIZE_MAX));
1434 TEST(STRING_TEST, mempcpy) {
1436 ASSERT_EQ(&dst[4], reinterpret_cast<char*>(mempcpy(dst, "hello", 4)));
1439 // clang depends on the fact that a memcpy where src and dst is the same
1440 // still operates correctly. This test verifies that this assumption
1442 // See https://llvm.org/bugs/show_bug.cgi?id=11763 for more information.
1443 static std::vector<uint8_t> g_memcpy_same_buffer;
1445 static void DoMemcpySameTest(uint8_t* buffer, size_t len) {
1446 memcpy(buffer, g_memcpy_same_buffer.data(), len);
1447 ASSERT_EQ(buffer, memcpy(buffer, buffer, len));
1448 ASSERT_TRUE(memcmp(buffer, g_memcpy_same_buffer.data(), len) == 0);
1451 TEST(STRING_TEST, memcpy_src_dst_same) {
1452 g_memcpy_same_buffer.resize(MEDIUM);
1453 for (size_t i = 0; i < MEDIUM; i++) {
1454 g_memcpy_same_buffer[i] = i;
1456 RunSingleBufferAlignTest(MEDIUM, DoMemcpySameTest);
1459 TEST(STRING_TEST, memmem_strstr_empty_needle) {
1460 const char* some_haystack = "haystack";
1461 const char* empty_haystack = "";
1463 ASSERT_EQ(some_haystack, memmem(some_haystack, 8, "", 0));
1464 ASSERT_EQ(empty_haystack, memmem(empty_haystack, 0, "", 0));
1466 ASSERT_EQ(some_haystack, strstr(some_haystack, ""));
1467 ASSERT_EQ(empty_haystack, strstr(empty_haystack, ""));
1470 TEST(STRING_TEST, memmem_smoke) {
1471 const char haystack[] = "big\0daddy\0giant\0haystacks";
1472 ASSERT_EQ(haystack, memmem(haystack, sizeof(haystack), "", 0));
1473 ASSERT_EQ(haystack + 3, memmem(haystack, sizeof(haystack), "", 1));
1474 ASSERT_EQ(haystack + 0, memmem(haystack, sizeof(haystack), "b", 1));
1475 ASSERT_EQ(haystack + 1, memmem(haystack, sizeof(haystack), "i", 1));
1476 ASSERT_EQ(haystack + 4, memmem(haystack, sizeof(haystack), "da", 2));
1477 ASSERT_EQ(haystack + 8, memmem(haystack, sizeof(haystack), "y\0g", 3));
1480 TEST(STRING_TEST, strstr_smoke) {
1481 const char* haystack = "big daddy/giant haystacks";
1482 ASSERT_EQ(haystack, strstr(haystack, ""));
1483 ASSERT_EQ(haystack + 0, strstr(haystack, "b"));
1484 ASSERT_EQ(haystack + 1, strstr(haystack, "i"));
1485 ASSERT_EQ(haystack + 4, strstr(haystack, "da"));