| /external/libdivsufsort/lib/ |
| utils.c | 264 saidx_t match, lmatch, rmatch; local
275 for(i = j = k = 0, lmatch = rmatch = 0, size = SAsize, half = size >> 1;
278 match = MIN(lmatch, rmatch);
285 rmatch = match;
305 for(rlmatch = match, rrmatch = rmatch, half = rsize >> 1;
308 rmatch = MIN(rlmatch, rrmatch);
309 r = _compare(T, Tsize, P, Psize, SA[k + half], &rmatch);
313 rlmatch = rmatch;
315 rrmatch = rmatch;
|
| /external/pcre/dist2/src/ |
| pcre2_match.c | 271 provide a unique number for each call to RMATCH. There is no way of generating
284 /* Numbers for RMATCH calls. When this list is changed, the code at HEAP_RETURN
296 argument of RMATCH isn't actually used in this definition. */
300 #define RMATCH(ra,rb,rc,rd,re,rw) \
306 the "rd" argument of RMATCH isn't actually used in this definition. It's the mb
311 #define RMATCH(ra,rb,rc,rd,re,rw)\
587 register int i; /* Used for loops not involving calls to RMATCH() */
588 register uint32_t c; /* Character values not kept over RMATCH() calls */
596 preserved over calls to RMATCH() are part of a "frame". We set up the top-level
598 whenever RMATCH() does a "recursion". See the macro definitions above. Puttin
[all...] |
| /external/toybox/toys/posix/ |
| sed.c | 195 int rmatch[2]; // offset of regex struct for prefix matches (/abc/,/def/p) member in struct:sedcmd
286 if (*command->lmatch || *command->rmatch) {
293 if (!command->rmatch[1]) command->hit = 0;
295 void *rm = get_regex(command, command->rmatch[1]);
305 void *rm = get_regex(command, *command->rmatch);
310 if (!command->lmatch[1] && !command->rmatch[1]) miss = 1;
782 if (!*s) command->rmatch[i] = 0;
785 command->rmatch[i] = reg-toybuf;
[all...] |
| /external/kmod/testsuite/ |
| testsuite.c | 407 int rmatch = read(fd_match, local
409 if (rmatch == 0)
412 if (rmatch < 0) {
421 done += rmatch;
|
