Lines Matching refs:pend
828 UCHAR_T *pend = end;
837 while (p < pend)
940 assert (p + *p < pend);
1738 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1791 `pend', `string1', `size1', `string2', and `size2'. */
1823 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1937 const CHAR_T *pend,
1942 const CHAR_T *pend,
1951 const char *pend,
1967 do {if (p == pend) return REG_EEND; \
1973 do {if (p == pend) return REG_EEND; \
1983 do {if (p == pend) return REG_EEND; \
2238 while (p != pend) \
2404 const CHAR_T *pend;
2407 const CHAR_T *pend = pattern + size;
2439 p = pend = pattern = TALLOC(csize + 1, CHAR_T);
2451 pend = p + size;
2542 while (p != pend)
2566 p == pend
2570 || PREFIX(at_endline_loc_p) (p, pend, syntax))
2611 if (p == pend)
2622 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2673 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
2729 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2811 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2818 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2852 ret = wcs_compile_range (range_start, &p, pend, translate,
2867 ret = wcs_compile_range (c, &p, pend, translate, syntax, b,
2883 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2888 if ((c == ':' && *p == ']') || p == pend)
2915 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2961 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2966 if ((c == delim && *p == ']') || p == pend)
3223 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3230 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
3259 = byte_compile_range (range_start, &p, pend, translate,
3272 ret = byte_compile_range (c, &p, pend, translate, syntax, b);
3288 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3293 if ((c == ':' && *p == ']') || p == pend)
3322 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3357 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3408 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3413 if ((c == '=' && *p == ']') || p == pend)
3542 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3547 if ((c == '.' && *p == ']') || p == pend)
3727 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
3921 if (p == pend)
3941 if (c != '\\' || p == pend)
4056 FREE_STACK_RETURN (p == pend ? REG_EBRACE : REG_BADBR);
4225 } /* while p != pend */
4403 PREFIX(at_endline_loc_p) (p, pend, syntax)
4404 const CHAR_T *p, *pend;
4409 const CHAR_T *next_next = p + 1 < pend ? p + 1 : 0;
4463 wcs_compile_range (range_start_char, p_ptr, pend, translate, syntax, b,
4466 const CHAR_T **p_ptr, *pend;
4478 if (p == pend)
4550 byte_compile_range (range_start_char, p_ptr, pend, translate, syntax, b)
4552 const char **p_ptr, *pend;
4568 if (p == pend)
4667 register UCHAR_T *pend = (UCHAR_T*) (bufp->buffer + bufp->used);
4670 register UCHAR_T *pend = pattern + bufp->used;
4698 if (p == pend || *p == succeed)
4717 assert (p < pend);
4896 fastmap entries beyond `pend'. Such a pattern can match
4898 if (p + j < pend)
4955 p = pend;
5718 register UCHAR_T *pend;
5721 register UCHAR_T *pend = p + bufp->used;
5834 offset = (p == pend \
5848 ptr = (p == pend ? &&end_of_pattern \
6005 pend = (CHAR_T*)(bufp->buffer + bufp->used);
6114 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
6133 if (p == pend)
6784 = PREFIX(group_match_null_string_p) (&p1, pend, reg_info);
6887 && (p + 2) < pend)
7155 while (p1 < pend && (re_opcode_t) *p1 == no_op)
7158 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
7201 if (p2 + 2 < pend
7205 else if (p2 + 2 + 2 * OFFSET_ADDRESS_SIZE < pend
7218 if (p2 == pend)
7664 assert (p <= pend);
7665 if (p < pend)