usr.bin/perl/util.c

811 beyond the final byte in the haystack.  C<little> points to the first byte in
815 The function returns C<NULL> if there is no occurrence of C<little> within
816 C<big>.  If C<little> is the empty string, C<big> is returned.
828 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
833     return ninstr(big, bigend, little, lend);
836     if (little >= lend) {
840         const U8 first = *little;
845         bigend -= lend - little;
846         little++;       /* Look for 'first', then the remainder is in here */
847         lsize = lend - little;
855             if (memEQ(big + 1, little, lsize)) {
880 Perl_rninstr(const char *big, const char *bigend, const char *little, const char *lend)
882     const Ptrdiff_t little_len = lend - little;
905         const char final = *little;
964             if memEQ(cur - prefix_len, little, prefix_len) {
1087     const unsigned char *little = (const unsigned char *)SvPV_const(littlestr,l);
1101                  || (*big == *little &&
1102                      memEQ((char *)big, (char *)little, littlelen - 1))))
1116             s = (unsigned char *)memchr((void*)big, *little, bigend-big);
1128             if (bigend[-2] == *little && bigend[-1] == '\n')
1130             if (bigend[-1] == *little)
1145             unsigned char c1 = little[0];
1146             unsigned char c2 = little[1];
1202             if (tail && bigend[0] == little[0])
1213         if (s >= big && bigend[-1] == '\n' && *s == *little
1215             && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1219         if (s[1] == *little
1220             && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
1230                          (char*)little, (char*)little + littlelen);
1249         little += littlelen;		/* last char */
1250         oldlittle = little;
1253             const unsigned char lastc = *little;
1282                     if (*--s == *--little)
1285                     little = oldlittle;