Lines Matching defs:pend

818   UCHAR_T *pend = end;
827 while (p < pend)
930 assert (p + *p < pend);
1666 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1719 `pend', `string1', `size1', `string2', and `size2'. */
1751 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1865 const CHAR_T *pend,
1870 const CHAR_T *pend,
1879 const char *pend,
1895 do {if (p == pend) return REG_EEND; \
1901 do {if (p == pend) return REG_EEND; \
1911 do {if (p == pend) return REG_EEND; \
2166 while (p != pend) \
2328 const CHAR_T *pend;
2331 const CHAR_T *pend = pattern + size;
2363 p = pend = pattern = TALLOC(csize + 1, CHAR_T);
2375 pend = p + size;
2466 while (p != pend)
2490 p == pend
2494 || PREFIX(at_endline_loc_p) (p, pend, syntax))
2535 if (p == pend)
2546 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2597 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
2653 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2735 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2742 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
2776 ret = wcs_compile_range (range_start, &p, pend, translate,
2791 ret = wcs_compile_range (c, &p, pend, translate, syntax, b,
2807 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2812 if ((c == ':' && *p == ']') || p == pend)
2839 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2885 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
2890 if ((c == delim && *p == ']') || p == pend)
3147 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3154 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
3183 = byte_compile_range (range_start, &p, pend, translate,
3196 ret = byte_compile_range (c, &p, pend, translate, syntax, b);
3212 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
3217 if ((c == ':' && *p == ']') || p == pend)
3246 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 */
4318 PREFIX(at_endline_loc_p) (const CHAR_T *p, const CHAR_T *pend,
4323 const CHAR_T *next_next = p + 1 < pend ? p + 1 : 0;
4373 const CHAR_T *pend, RE_TRANSLATE_TYPE translate,
4383 if (p == pend)
4456 const char *pend, RE_TRANSLATE_TYPE translate,
4470 if (p == pend)
4571 register UCHAR_T *pend = (UCHAR_T*) (bufp->buffer + bufp->used);
4574 register UCHAR_T *pend = pattern + bufp->used;
4602 if (p == pend || *p == (UCHAR_T) succeed)
4621 assert (p < pend);
4800 fastmap entries beyond `pend'. Such a pattern can match
4802 if (p + j < pend)
4859 p = pend;
5590 register UCHAR_T *pend;
5593 register UCHAR_T *pend = p + bufp->used;
5795 pend = (CHAR_T*)(bufp->buffer + bufp->used);
5904 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
5920 if (p == pend)
6599 = PREFIX(group_match_null_string_p) (&p1, pend, reg_info);
6702 && (p + 2) < pend)
6960 while (p1 < pend && (re_opcode_t) *p1 == no_op)
6963 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
7006 if (p2 + 2 < pend
7010 else if (p2 + 2 + 2 * OFFSET_ADDRESS_SIZE < pend
7023 if (p2 == pend)
7457 assert (p <= pend);
7458 if (p < pend)