Lines Matching refs:pos
458 size_t pos = random() % state.MAX_LEN; in TEST() local
460 if (pos >= state.len[i] - 1) { in TEST()
467 state.ptr1[pos] = seek_char; in TEST()
468 expected = state.ptr1 + pos; in TEST()
492 size_t pos = 1 + (random() % (state.MAX_LEN - 1)); in TEST() local
495 if (pos >= state.len[i] - 1) { in TEST()
500 memcpy(state.ptr1, state.ptr2, pos); in TEST()
501 if (state.ptr1[pos] > state.ptr2[pos]) { in TEST()
503 } else if (state.ptr1[pos] == state.ptr2[pos]) { in TEST()
504 state.ptr1[pos + 1] = '\0'; in TEST()
505 state.ptr2[pos + 1] = '\0'; in TEST()
521 size_t pos = random() % state.MAX_LEN; in TEST() local
523 memset(state.ptr1, '\2', pos); in TEST()
524 state.ptr1[pos] = '\0'; in TEST()
533 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1); in TEST()
545 size_t pos = random() % state.MAX_LEN; in TEST() local
547 memset(state.ptr1, '\2', pos); in TEST()
548 state.ptr1[pos] = '\0'; in TEST()
557 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1); in TEST()
575 size_t pos = random() % state.MAX_LEN; in TEST() local
576 memset(state.ptr1, '\3', pos); in TEST()
577 state.ptr1[pos] = '\0'; in TEST()
578 if (pos < state.len[i]) { in TEST()
579 memcpy(state.ptr + state.MAX_LEN - 1, state.ptr1, pos + 1); in TEST()
602 size_t pos = random() % state.MAX_LEN; in TEST() local
603 if (pos < state.MAX_LEN) { in TEST()
604 state.ptr1[pos] = '\0'; in TEST()
611 if (pos > state.MAX_LEN - 1) { in TEST()
615 memcpy(state.ptr + state.MAX_LEN, state.ptr1, pos + 1); in TEST()
639 size_t pos = strlen(state.ptr1); in TEST() local
642 strncpy(state.ptr + state.MAX_LEN - 1, state.ptr1, std::min(actual, pos)); in TEST()
643 state.ptr[state.MAX_LEN + std::min(actual, pos) - 1] = '\0'; in TEST()
660 size_t pos = 1 + (random() % (state.MAX_LEN - 1)); in TEST() local
663 if (pos >= state.len[i] - 1) { in TEST()
668 memcpy(state.ptr1, state.ptr2, pos); in TEST()
669 if (state.ptr1[pos] > state.ptr2[pos]) { in TEST()
671 } else if (state.ptr1[pos] == state.ptr2[pos]) { in TEST()
672 state.ptr1[pos + 1] = '\0'; in TEST()
673 state.ptr2[pos + 1] = '\0'; in TEST()
770 size_t pos = random() % state.MAX_LEN; in TEST() local
772 if (pos >= state.len[i] - 1) { in TEST()
779 state.ptr1[pos] = seek_char; in TEST()
780 expected = state.ptr1 + pos; in TEST()
795 size_t pos = random() % state.MAX_LEN; in TEST() local
797 if (pos >= state.len[i]) { in TEST()
800 state.ptr1[pos] = seek_char; in TEST()
801 expected = state.ptr1 + pos; in TEST()
824 size_t pos = random() % state.MAX_LEN; in TEST() local
826 if (pos >= state.len[i]) { in TEST()
829 state.ptr1[pos] = seek_char; in TEST()
830 expected = state.ptr1 + pos; in TEST()
847 int pos = (state.len[i] == 0) ? 0 : (random() % state.len[i]); in TEST() local
848 state.ptr2[pos] = c2; in TEST()
869 int pos = (state.len[i] == 0) ? 0 : (random() % state.len[i]); in TEST() local
870 state.ptr2[pos] = c2; in TEST()
885 size_t pos = random() % (state.MAX_LEN - state.len[i]); in TEST() local
892 memset(state.ptr2 + pos, '\0', state.len[i]); in TEST()
894 ASSERT_FALSE(memcpy(state.ptr2 + pos, state.ptr1 + pos, state.len[i]) != state.ptr2 + pos); in TEST()
908 size_t pos = random () % (state.MAX_LEN - state.len[i]); in TEST() local
909 for (size_t k = pos; k < pos + state.len[i]; k++) { in TEST()
913 ASSERT_TRUE(memset(state.ptr2 + pos, ch, state.len[i]) == state.ptr2 + pos); in TEST()
926 size_t pos = random() % (state.MAX_LEN - state.len[i]); in TEST() local
931 memcpy(state.ptr1 + pos, state.ptr, state.len[i]); in TEST()
933 ASSERT_TRUE(memmove(state.ptr2 + pos, state.ptr2, state.len[i]) == state.ptr2 + pos); in TEST()
946 size_t pos = 64; in TEST() local
958 memcpy(ptr1 + pos, ptr, len); in TEST()
960 ASSERT_TRUE(memmove(ptr2 + pos, ptr, len) == ptr2 + pos); in TEST()