Lines Matching full:pend
619 unsigned char *pend = end;
628 while (p < pend)
676 assert (p + *p < pend);
1212 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1263 `pend', `string1', `size1', `string2', and `size2'. */
1296 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1409 do {if (p == pend) return REG_EEND; \
1418 do {if (p == pend) return REG_EEND; \
1578 { if (p != pend) \
1586 if (p == pend) \
1698 const char *pend = pattern + size;
1789 while (p != pend)
1813 p == pend
1817 || at_endline_loc_p (p, pend, syntax))
1858 if (p == pend)
1869 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
1920 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
1968 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
1999 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2006 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2034 = compile_range (&p, pend, translate, syntax, b);
2045 ret = compile_range (&p, pend, translate, syntax, b);
2060 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2065 if (c == ':' || c == ']' || p == pend
2098 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2185 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2364 || (p - 2 == pattern && p == pend))
2376 if (p == pend)
2655 } /* while p != pend */
2818 at least one character after the $, i.e., `P < PEND'. */
2821 at_endline_loc_p (p, pend, syntax)
2822 const char *p, *pend;
2827 const char *next_next = p + 1 < pend ? p + 1 : 0;
2860 uncompiled pattern *P_PTR (which ends at PEND). We assume the
2871 compile_range (p_ptr, pend, translate, syntax, b)
2872 const char **p_ptr, *pend;
2882 if (p == pend)
2948 register unsigned char *pend = pattern + size;
2974 if (p == pend || *p == succeed)
2993 assert (p < pend);
3152 fastmap entries beyond `pend'. Such a pattern can match
3154 if (p + j < pend)
3211 p = pend;
3613 register unsigned char *pend = p + bufp->used;
3819 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
3831 if (p == pend)
4096 = group_match_null_string_p (&p1, pend, reg_info);
4198 && (p + 2) < pend)
4446 while (p1 < pend && (re_opcode_t) *p1 == no_op)
4449 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
4492 if (p2 + 2 < pend
4496 else if (p2 + 6 < pend
4509 if (p2 == pend)
4887 assert (p <= pend);
4888 if (p < pend)
