Lines Matching refs:pend
763 UCHAR_T *pend = end;
772 while (p < pend)
875 assert (p + *p < pend);
1670 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1723 `pend', `string1', `size1', `string2', and `size2'. */
1755 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1869 const CHAR_T *pend,
1874 const CHAR_T *pend,
1883 const char *pend,
1899 do {if (p == pend) return REG_EEND; \
1905 do {if (p == pend) return REG_EEND; \
1915 do {if (p == pend) return REG_EEND; \
2169 while (p != pend) \
2333 const CHAR_T *pend;
2336 const CHAR_T *pend = pattern + size;
2368 p = pend = pattern = TALLOC(csize + 1, CHAR_T);
2380 pend = p + size;
2471 while (p != pend)
2495 p == pend
2499 || PREFIX(at_endline_loc_p) (p, pend, syntax))
2540 if (p == pend)
2551 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2602 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
2658 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2740 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2747 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2781 ret = wcs_compile_range (range_start, &p, pend, translate,
2796 ret = wcs_compile_range (c, &p, pend, translate, syntax, b,
2812 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2817 if ((c == ':' && *p == ']') || p == pend)
2844 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2890 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2895 if ((c == delim && *p == ']') || p == pend)
3152 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3159 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
3188 = byte_compile_range (range_start, &p, pend, translate,
3201 ret = byte_compile_range (c, &p, pend, translate, syntax, b);
3217 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3222 if ((c == ':' && *p == ']') || p == pend)
3251 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3286 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3337 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3342 if ((c == '=' && *p == ']') || p == pend)
3471 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3476 if ((c == '.' && *p == ']') || p == pend)
3656 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
3850 if (p == pend)
3870 if (c != '\\' || p == pend)
3985 FREE_STACK_RETURN (p == pend ? REG_EBRACE : REG_BADBR);
4154 } /* while p != pend */
4316 PREFIX(at_endline_loc_p) (const CHAR_T *p, const CHAR_T *pend,
4321 const CHAR_T *next_next = p + 1 < pend ? p + 1 : 0;
4372 const CHAR_T **p_ptr, const CHAR_T *pend,
4383 if (p == pend)
4456 const char **p_ptr, const char *pend,
4471 if (p == pend)
4567 register UCHAR_T *pend = (UCHAR_T*) (bufp->buffer + bufp->used);
4570 register UCHAR_T *pend = pattern + bufp->used;
4598 if (p == pend || *p == succeed)
4617 assert (p < pend);
4796 fastmap entries beyond `pend'. Such a pattern can match
4798 if (p + j < pend)
4855 p = pend;
5602 register UCHAR_T *pend;
5605 register UCHAR_T *pend = p + bufp->used;
5718 offset = (p == pend \
5732 ptr = (p == pend ? &&end_of_pattern \
5889 pend = (CHAR_T*)(bufp->buffer + bufp->used);
5998 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
6017 if (p == pend)
6670 = PREFIX(group_match_null_string_p) (&p1, pend, reg_info);
6773 && (p + 2) < pend)
7041 while (p1 < pend && (re_opcode_t) *p1 == no_op)
7044 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
7087 if (p2 + 2 < pend
7091 else if (p2 + 2 + 2 * OFFSET_ADDRESS_SIZE < pend
7104 if (p2 == pend)
7550 assert (p <= pend);
7551 if (p < pend)