Home
last modified time | relevance | path

Searched refs:shift (Results 1 – 4 of 4) sorted by relevance

/string/
A Dmemmem.c39 #define hash2(p) (((size_t)(p)[0] - ((size_t)(p)[-1] << 3)) % sizeof (shift))
82 uint8_t shift[256]; in __memmem() local
87 memset (shift, 0, sizeof (shift)); in __memmem()
89 shift[hash2 (ne + i)] = i; in __memmem()
92 shift1 = m1 - shift[hash2 (ne + m1)]; in __memmem()
93 shift[hash2 (ne + m1)] = m1; in __memmem()
101 tmp = shift[hash2 (hs)]; in __memmem()
A Dstrstr.c62 #define hash2(p) (((size_t)(p)[0] - ((size_t)(p)[-1] << 3)) % sizeof (shift))
110 uint8_t shift[256]; in STRSTR() local
116 memset (shift, 0, sizeof (shift)); in STRSTR()
118 shift[hash2 (ne + i)] = i; in STRSTR()
121 shift1 = m1 - shift[hash2 (ne + m1)]; in STRSTR()
122 shift[hash2 (ne + m1)] = m1; in STRSTR()
137 tmp = shift[hash2 (hs)]; in STRSTR()
A Dstr-two-way.h421 size_t shift; in two_way_long_needle() local
430 shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])]; in two_way_long_needle()
431 if (0 < shift) in two_way_long_needle()
433 if (memory && shift < period) in two_way_long_needle()
438 shift = needle_len - period; in two_way_long_needle()
441 j += shift; in two_way_long_needle()
479 size_t shift; in two_way_long_needle() local
489 shift = shift_table[CANON_ELEMENT (haystack[j + needle_len - 1])]; in two_way_long_needle()
490 if (0 < shift) in two_way_long_needle()
492 j += shift; in two_way_long_needle()
A Dtest-memmem.c107 size_t shift = random () % 11; in do_random_tests() local
108 size_t rel = random () % ((2 << (shift + 1)) * 64); in do_random_tests()
109 size_t idx = MIN ((2 << shift) * 64 + rel, BUF1PAGES * page_size - 2); in do_random_tests()

Completed in 11 milliseconds