Lines Matching refs:pend
677 unsigned char *pend = end;
686 while (p < pend)
734 assert (p + *p < pend);
1374 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1425 `pend', `string1', `size1', `string2', and `size2'. */
1458 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1573 static boolean at_endline_loc_p _RE_ARGS ((const char *p, const char *pend,
1576 const char *pend,
1587 do {if (p == pend) return REG_EEND; \
1596 do {if (p == pend) return REG_EEND; \
1770 { if (p != pend) \
1778 if (p == pend) \
1910 const char *pend = pattern + size;
2001 while (p != pend)
2025 p == pend
2029 || at_endline_loc_p (p, pend, syntax))
2070 if (p == pend)
2081 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2132 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
2180 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2211 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2218 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2246 = compile_range (&p, pend, translate, syntax, b);
2257 ret = compile_range (&p, pend, translate, syntax, b);
2272 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2277 if ((c == ':' && *p == ']') || p == pend)
2306 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2346 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2436 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2615 || (p - 2 == pattern && p == pend))
2627 if (p == pend)
2922 } /* while p != pend */
3087 at_endline_loc_p (p, pend, syntax)
3088 const char *p, *pend;
3093 const char *next_next = p + 1 < pend ? p + 1 : 0;
3137 compile_range (p_ptr, pend, translate, syntax, b)
3138 const char **p_ptr, *pend;
3148 if (p == pend)
3210 register unsigned char *pend = pattern + bufp->used;
3236 if (p == pend || *p == succeed)
3255 assert (p < pend);
3414 fastmap entries beyond `pend'. Such a pattern can match
3416 if (p + j < pend)
3473 p = pend;
3887 register unsigned char *pend = p + bufp->used;
4093 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
4109 if (p == pend)
4375 = group_match_null_string_p (&p1, pend, reg_info);
4477 && (p + 2) < pend)
4734 while (p1 < pend && (re_opcode_t) *p1 == no_op)
4737 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
4780 if (p2 + 2 < pend
4784 else if (p2 + 6 < pend
4797 if (p2 == pend)
5209 assert (p <= pend);
5210 if (p < pend)