| /src/external/gpl3/binutils/dist/include/ |
| xregex.h | 15 # define re_search xre_search macro
|
| xregex2.h | 350 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
466 extern int re_search (struct re_pattern_buffer *buffer, const char *string,
471 /* Like `re_search', but search in the concatenation of STRING1 and
479 /* Like `re_search', but return how many characters in STRING the regexp
485 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| /src/external/gpl3/binutils.old/dist/include/ |
| xregex.h | 15 # define re_search xre_search macro
|
| xregex2.h | 350 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
466 extern int re_search (struct re_pattern_buffer *buffer, const char *string,
471 /* Like `re_search', but search in the concatenation of STRING1 and
479 /* Like `re_search', but return how many characters in STRING the regexp
485 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| /src/external/gpl3/gcc.old/dist/include/ |
| xregex.h | 15 # define re_search xre_search macro
|
| xregex2.h | 350 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
466 extern int re_search (struct re_pattern_buffer *buffer, const char *string,
471 /* Like `re_search', but search in the concatenation of STRING1 and
479 /* Like `re_search', but return how many characters in STRING the regexp
485 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| /src/external/gpl2/xcvs/dist/lib/ |
| regex.c | 40 # define re_search(bufp, string, size, startpos, range, regs) \ macro
|
| regex.h | 470 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
576 extern regoff_t re_search (struct re_pattern_buffer *__buffer,
582 /* Like `re_search', but search in the concatenation of STRING1 and
592 /* Like `re_search', but return how many characters in STRING the regexp
599 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| regexec.c | 260 /* re_match, re_search, re_match_2, re_search_2
269 re_search() first tries matching at index START, then it tries to match
271 is START + RANGE. (Thus RANGE = 0 forces re_search to operate the same
283 On success, re_match* functions return the length of the match, re_search*
298 re_search (struct re_pattern_buffer *bufp, const char *string,
305 weak_alias (__re_search, re_search)
373 /* The parameters have the same meaning as those of re_search.
605 START and RANGE have the same meaning as with re_search.
|
| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| regex.h | 354 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
464 extern int re_search (struct re_pattern_buffer *buffer, const char *string,
469 /* Like `re_search', but search in the concatenation of STRING1 and
477 /* Like `re_search', but return how many characters in STRING the regexp
483 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| m-regex.c | 392 if (0 <= (start = re_search (&(cregex->patterns[i].regexbuf), beg,
435 start = re_search (&(cregex->patterns[i].regexbuf), beg,
|
| regex.c | 62 # define re_search(bufp, string, size, startpos, range, regs) \ macro
262 re_search* or re_match* could cause memory leaks when C-g is used in
4525 is used by re_search to skip quickly over impossible starting points.
4930 re_search (struct re_pattern_buffer *bufp,
4939 weak_alias (__re_search, re_search)
7980 0 <= re_search (&re_comp_buf, s, len, 0, len, 0);
8147 ret = re_search (&private_preg, string, len,
8169 /* We want zero return to mean success, unlike `re_search'. */
|
| /src/external/gpl2/diffutils/dist/src/ |
| util.c | 692 || re_search (&ignore_regexp, line, len, 0, len, 0) < 0))
702 || re_search (&ignore_regexp, line, len, 0, len, 0) < 0))
|
| context.c | 472 /* FIXME: re_search's size args should be size_t, not int. */
475 if (0 <= re_search (&function_regexp, line, len, 0, len, 0))
|
| /src/external/gpl2/diffutils/dist/lib/posix/ |
| regex.h | 347 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
474 extern int re_search
479 /* Like `re_search', but search in the concatenation of STRING1 and
487 /* Like `re_search', but return how many characters in STRING the regexp
494 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| /src/external/gpl2/grep/dist/lib/posix/ |
| regex.h | 351 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
478 extern int re_search
483 /* Like `re_search', but search in the concatenation of STRING1 and
491 /* Like `re_search', but return how many characters in STRING the regexp
498 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
| /src/external/gpl2/grep/dist/src/ |
| search.c | 408 if (0 <= (start = re_search (&(patterns[i].regexbuf), beg,
448 start = re_search (&(patterns[i].regexbuf), beg,
|
| /src/external/gpl2/xcvs/dist/diff/ |
| util.c | 787 if (0 <= re_search (&r->buf, line, len, 0, len, 0))
803 if (0 <= re_search (&r->buf, line, len, 0, len, 0))
|
| context.c | 451 if (0 <= re_search (&r->buf, line, len, 0, len, 0))
|
| /src/external/bsd/less/dist/ |
| pattern.c | 315 matched = re_search(pattern, line, line_len, 0, line_len, &search_regs) >= 0;
|
| /src/external/gpl2/diffutils/dist/lib/ |
| regex.c | 75 # define re_search(bufp, string, size, startpos, range, regs) \ macro
315 re_search* or re_match* could cause memory leaks when C-g is used in
4623 is used by re_search to skip quickly over impossible starting points.
5033 re_search (bufp, string, size, startpos, range, regs)
5043 weak_alias (__re_search, re_search)
8104 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
8279 ret = re_search (&private_preg, string, len,
8301 /* We want zero return to mean success, unlike `re_search'. */
|
| /src/external/gpl2/grep/dist/lib/ |
| regex.c | 98 # define re_search(bufp, string, size, startpos, range, regs) \ macro
327 re_search* or re_match* could cause memory leaks when C-g is used in
4540 is used by re_search to skip quickly over impossible starting points.
4931 re_search (bufp, string, size, startpos, range, regs)
4941 weak_alias (__re_search, re_search)
7640 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
7810 ret = re_search (&private_preg, string, len,
7832 /* We want zero return to mean success, unlike `re_search'. */
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| regex.c | 82 # define re_search(bufp, string, size, startpos, range, regs) \ macro
316 re_search* or re_match* could cause memory leaks when C-g is used in
4529 is used by re_search to skip quickly over impossible starting points.
4938 re_search (struct re_pattern_buffer *bufp, const char *string, int size,
4945 weak_alias (__re_search, re_search)
7896 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
8064 ret = re_search (&private_preg, string, len,
8086 /* We want zero return to mean success, unlike `re_search'. */
|
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| regex.c | 82 # define re_search(bufp, string, size, startpos, range, regs) \ macro
316 re_search* or re_match* could cause memory leaks when C-g is used in
4529 is used by re_search to skip quickly over impossible starting points.
4938 re_search (struct re_pattern_buffer *bufp, const char *string, int size,
4945 weak_alias (__re_search, re_search)
7896 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
8064 ret = re_search (&private_preg, string, len,
8086 /* We want zero return to mean success, unlike `re_search'. */
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| regex.c | 82 # define re_search(bufp, string, size, startpos, range, regs) \ macro
316 re_search* or re_match* could cause memory leaks when C-g is used in
4529 is used by re_search to skip quickly over impossible starting points.
4938 re_search (struct re_pattern_buffer *bufp, const char *string, int size,
4945 weak_alias (__re_search, re_search)
7896 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
8064 ret = re_search (&private_preg, string, len,
8086 /* We want zero return to mean success, unlike `re_search'. */
|
