Searched refs:re_search (Results 1 - 9 of 9) sorted by relevance
/haiku/src/bin/keymap/ |
H A D | Keymap.cpp | 364 if (re_search(&versionBuf, buffer, length, 0, length, ®s) >= 0) { 366 } else if (re_search(&capslockBuf, buffer, length, 0, length, ®s) 369 } else if (re_search(&scrolllockBuf, buffer, length, 0, length, ®s) 372 } else if (re_search(&numlockBuf, buffer, length, 0, length, ®s) 375 } else if (re_search(&lshiftBuf, buffer, length, 0, length, ®s) 379 } else if (re_search(&rshiftBuf, buffer, length, 0, length, ®s) 383 } else if (re_search(&lcommandBuf, buffer, length, 0, length, ®s) 387 } else if (re_search(&rcommandBuf, buffer, length, 0, length, ®s) 391 } else if (re_search(&lcontrolBuf, buffer, length, 0, length, ®s) 395 } else if (re_search( [all...] |
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regex.c | 43 # define re_search(bufp, string, size, startpos, range, regs) \ macro
|
H A D | regexec.c | 280 /* re_match, re_search, re_match_2, re_search_2 289 re_search() first tries matching at index START, then it tries to match 291 is START + RANGE. (Thus RANGE = 0 forces re_search to operate the same 303 On success, re_match* functions return the length of the match, re_search* 321 re_search (bufp, string, length, start, range, regs) 330 weak_alias (__re_search, re_search) 406 /* The parameters have the same meaning as those of re_search. 616 with re_search.
|
/haiku/src/build/libgnuregex/ |
H A D | regex.h | 298 /* Pointer to a fastmap, if any, otherwise zero. re_search uses 432 extern int re_search 437 /* Like `re_search', but search in the concatenation of STRING1 and 445 /* Like `re_search', but return how many characters in STRING the regexp 452 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
H A D | regex.c | 170 re_search* or re_match* could cause memory leaks when C-g is used in 2527 is used by re_search to skip quickly over impossible starting points. 2852 re_search (bufp, string, size, startpos, range, regs) 4706 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0); 4858 ret = re_search (&private_preg, string, len, 4881 /* We want zero return to mean success, unlike `re_search'. */ 2838 re_search (bufp, string, size, startpos, range, regs) function
|
/haiku/headers/posix/ |
H A D | regex.h | 365 /* Pointer to a fastmap, if any, otherwise zero. re_search uses the 477 extern int re_search (struct re_pattern_buffer *__buffer, const char *__string, 482 /* Like `re_search', but search in the concatenation of STRING1 and 490 /* Like `re_search', but return how many characters in STRING the regexp 496 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
|
/haiku/src/kits/mail/ |
H A D | mail_util.cpp | 1257 for (int start = 0; (start = re_search(gRebuf, string.String(),
|
/haiku/src/system/libroot/stubbed/ |
H A D | libroot_stubs.c | 2313 void re_search() {} function
|
H A D | libroot_stubs_legacy.c | 2292 void re_search() {} function
|
Completed in 193 milliseconds