Lines Matching +defs:end +defs:re
262 bool anchorEnd:1; /* '$': match only at end of word */
722 /* we will need to re-export the global version */
745 * Flag the variable as something we need to re-export.
796 * re-exported.
1395 SepBuf_AddRange(SepBuf *buf, const char *start, const char *end)
1397 SepBuf_AddBytes(buf, start, (size_t)(end - start));
1409 SepBuf_AddRange(buf, sub.start, sub.end);
1451 SepBuf_AddRange(buf, lastDot + 1, word.end);
1457 const char *lastDot, *end;
1460 end = lastDot != NULL ? lastDot : word.end;
1461 SepBuf_AddRange(buf, word.start, end);
1498 word.end - Substring_Length(args->lhsSuffix));
1546 SepBuf_AddRange(buf, word.start + lhsLen, word.end);
1554 if (memcmp(word.end - lhsLen, args->lhs.start, lhsLen) != 0)
1558 SepBuf_AddRange(buf, word.start, word.end - lhsLen);
1621 for (rp = replace.start; rp != replace.end; rp++) {
1622 if (*rp == '\\' && rp + 1 != replace.end &&
1625 else if (*rp == '\\' && rp + 1 != replace.end &&
1638 regex_t re;
1654 assert(word.end[0] == '\0'); /* assume null-terminated word */
1660 xrv = regexec(&args->re, wp, args->nsub, m, flags);
1664 RegexError(xrv, &args->re, "Unexpected regex error");
1666 SepBuf_AddRange(buf, wp, word.end);
1707 assert(word.end[0] == '\0'); /* assume null-terminated word */
1732 int len, start, end, step;
1757 end = last < 1 ? 0 : last - 1;
1761 end = last > len ? len : last;
1765 for (i = start; (step < 0) == (i >= end); i += step) {
1783 assert(word.end[0] == '\0'); /* assume null-terminated word */
1807 Buf_AddRange(&buf, words.words[i].start, words.words[i].end);
2234 } else if (p[1] == end2) { /* Unescaped '$' at end */
2291 char *end;
2295 n = strtol(*pp, &end, 0);
2297 if (end == *pp)
2304 *pp = end;
2312 char *end;
2319 n = strtoul(*pp, &end, 10);
2325 *pp = end;
2333 char *end;
2340 n = strtoul(*pp, &end, base);
2346 *pp = end;
2533 char *end;
2540 n = strtoul(*pp, &end, 10);
2544 *pp = end;
2816 assert(word.end[0] == '\0'); /* assume null-terminated word */
2865 assert(word.end[0] == '\0'); /* assume null-terminated word */
2999 FStr re;
3014 re = LazyBuf_DoneGet(&reBuf);
3018 FStr_Done(&re);
3031 error = regcomp(&args.re, re.str, REG_EXTENDED);
3033 RegexError(error, &args.re, "Regex compilation error");
3035 FStr_Done(&re);
3039 args.nsub = args.re.re_nsub + 1;
3045 regfree(&args.re);
3048 FStr_Done(&re);
3309 /* Expect ":[N]" or ":[start..end]" */
3396 for (; a.start < a.end && b.start < b.end; a.start++, b.start++)
3400 return (int)((a.end - a.start) - (b.end - b.start));
3472 assert(words.words[0].end[0] == '\0');
3773 args.lhsSuffix = Substring_Init(lhsSuffix, lhs.end);
3826 * be used since the end of the modifier is not yet known.
4020 * Guess the end of the current modifier.
4212 * Parse a variable name, until the end character or a colon, whichever
4450 * In the end, after applying all modifiers, if the expression
4531 * location of the parse error, or at the end of the
4755 * Skip as many characters as possible -- either to the end of the string,