Lines Matching refs:state
222 // Calculate input lengths and fill state.len with them.
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);
438 StringTestState<char> state(SMALL);
439 for (size_t i = 1; i < state.n; i++) {
440 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
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) {
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);
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);
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));
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));
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
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);
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));
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);
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]);
677 StringTestState<char> state(SMALL);
678 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
679 memset(state.ptr1, 'J', state.MAX_LEN);
681 size_t ptr1_len = random() % state.MAX_LEN;
682 state.ptr1[ptr1_len] = '\0';
684 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
686 memset(state.ptr2, '\1', state.MAX_LEN);
689 size_t copy_len = random() % state.MAX_LEN;
692 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
693 memcpy(state.ptr + state.MAX_LEN, state.ptr1, copy_len);
696 memset(state.ptr + state.MAX_LEN + ptr1_len, '\0', copy_len - ptr1_len);
702 ASSERT_EQ(state.ptr2 + expected_end, stpncpy(state.ptr2, state.ptr1, copy_len));
705 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr, state.MAX_LEN));
707 ASSERT_EQ(0, memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN));
712 StringTestState<char> state(SMALL);
713 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
716 memset(state.ptr1, 'K', state.MAX_LEN);
718 size_t ptr1_len = random() % state.MAX_LEN;
719 state.ptr1[ptr1_len] = '\0';
721 memcpy(state.ptr, state.ptr1, state.MAX_LEN);
723 memset(state.ptr2, '\1', state.MAX_LEN);
726 size_t copy_len = random() % state.MAX_LEN;
729 memset(state.ptr + state.MAX_LEN, '\1', state.MAX_LEN);
730 memcpy(state.ptr + state.MAX_LEN, state.ptr1, copy_len);
733 memset(state.ptr + state.MAX_LEN + ptr1_len, '\0', copy_len - ptr1_len);
739 ASSERT_EQ(state.ptr2 + expected_end, stpncpy(state.ptr2, state.ptr1, copy_len));
742 ASSERT_EQ(0, memcmp(state.ptr1, state.ptr, state.MAX_LEN));
744 ASSERT_EQ(0, memcmp(state.ptr2, state.ptr + state.MAX_LEN, state.MAX_LEN));
750 StringTestState<char> state(SMALL);
751 for (size_t i = 1; i < state.n; i++) {
752 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
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) {
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);
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);
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);
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;
841 int actual = memcmp(state.ptr1, state.ptr2, state.MAX_LEN);
849 StringTestState<wchar_t> state(SMALL);
851 for (size_t i = 0; i < state.n; i++) {
852 for (state.BeginIterations(); state.HasNextIteration(); state.NextIteration()) {
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;
863 int actual = wmemcmp(state.ptr1, state.ptr2, (size_t) state.MAX_LEN);
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));
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++) {
900 state.ptr1[k] = ch;
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));
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));
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));
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));
