Mercurial > vim
annotate src/regexp.c @ 2686:7b44c70ee8ab v7.3.104
updated for version 7.3.104
Problem: Conceal: using Tab for cchar causes problems. (ZyX)
Solution: Do not accept a control character for cchar.
| author | Bram Moolenaar <bram@vim.org> |
|---|---|
| date | Sat, 22 Jan 2011 00:58:20 +0100 |
| parents | 766918de9e3a |
| children | c249d9aa60f7 |
| rev | line source |
|---|---|
| 7 | 1 /* vi:set ts=8 sts=4 sw=4: |
| 2 * | |
| 3 * Handling of regular expressions: vim_regcomp(), vim_regexec(), vim_regsub() | |
| 4 * | |
| 5 * NOTICE: | |
| 6 * | |
| 7 * This is NOT the original regular expression code as written by Henry | |
| 8 * Spencer. This code has been modified specifically for use with the VIM | |
| 9 * editor, and should not be used separately from Vim. If you want a good | |
| 10 * regular expression library, get the original code. The copyright notice | |
| 11 * that follows is from the original. | |
| 12 * | |
| 13 * END NOTICE | |
| 14 * | |
| 15 * Copyright (c) 1986 by University of Toronto. | |
| 16 * Written by Henry Spencer. Not derived from licensed software. | |
| 17 * | |
| 18 * Permission is granted to anyone to use this software for any | |
| 19 * purpose on any computer system, and to redistribute it freely, | |
| 20 * subject to the following restrictions: | |
| 21 * | |
| 22 * 1. The author is not responsible for the consequences of use of | |
| 23 * this software, no matter how awful, even if they arise | |
| 24 * from defects in it. | |
| 25 * | |
| 26 * 2. The origin of this software must not be misrepresented, either | |
| 27 * by explicit claim or by omission. | |
| 28 * | |
| 29 * 3. Altered versions must be plainly marked as such, and must not | |
| 30 * be misrepresented as being the original software. | |
| 31 * | |
| 32 * Beware that some of this code is subtly aware of the way operator | |
| 33 * precedence is structured in regular expressions. Serious changes in | |
| 34 * regular-expression syntax might require a total rethink. | |
| 35 * | |
| 24 | 36 * Changes have been made by Tony Andrews, Olaf 'Rhialto' Seibert, Robert |
| 37 * Webb, Ciaran McCreesh and Bram Moolenaar. | |
| 7 | 38 * Named character class support added by Walter Briscoe (1998 Jul 01) |
| 39 */ | |
| 40 | |
| 41 #include "vim.h" | |
| 42 | |
| 43 #undef DEBUG | |
| 44 | |
| 45 /* | |
| 46 * The "internal use only" fields in regexp.h are present to pass info from | |
| 47 * compile to execute that permits the execute phase to run lots faster on | |
| 48 * simple cases. They are: | |
| 49 * | |
| 50 * regstart char that must begin a match; NUL if none obvious; Can be a | |
| 51 * multi-byte character. | |
| 52 * reganch is the match anchored (at beginning-of-line only)? | |
| 53 * regmust string (pointer into program) that match must include, or NULL | |
| 54 * regmlen length of regmust string | |
| 55 * regflags RF_ values or'ed together | |
| 56 * | |
| 57 * Regstart and reganch permit very fast decisions on suitable starting points | |
| 58 * for a match, cutting down the work a lot. Regmust permits fast rejection | |
| 59 * of lines that cannot possibly match. The regmust tests are costly enough | |
| 60 * that vim_regcomp() supplies a regmust only if the r.e. contains something | |
| 61 * potentially expensive (at present, the only such thing detected is * or + | |
| 62 * at the start of the r.e., which can involve a lot of backup). Regmlen is | |
| 63 * supplied because the test in vim_regexec() needs it and vim_regcomp() is | |
| 64 * computing it anyway. | |
| 65 */ | |
| 66 | |
| 67 /* | |
| 68 * Structure for regexp "program". This is essentially a linear encoding | |
| 69 * of a nondeterministic finite-state machine (aka syntax charts or | |
| 70 * "railroad normal form" in parsing technology). Each node is an opcode | |
| 71 * plus a "next" pointer, possibly plus an operand. "Next" pointers of | |
| 72 * all nodes except BRANCH and BRACES_COMPLEX implement concatenation; a "next" | |
| 73 * pointer with a BRANCH on both ends of it is connecting two alternatives. | |
| 74 * (Here we have one of the subtle syntax dependencies: an individual BRANCH | |
| 75 * (as opposed to a collection of them) is never concatenated with anything | |
| 76 * because of operator precedence). The "next" pointer of a BRACES_COMPLEX | |
| 167 | 77 * node points to the node after the stuff to be repeated. |
| 78 * The operand of some types of node is a literal string; for others, it is a | |
| 79 * node leading into a sub-FSM. In particular, the operand of a BRANCH node | |
| 80 * is the first node of the branch. | |
| 81 * (NB this is *not* a tree structure: the tail of the branch connects to the | |
| 82 * thing following the set of BRANCHes.) | |
| 7 | 83 * |
| 84 * pattern is coded like: | |
| 85 * | |
| 86 * +-----------------+ | |
| 87 * | V | |
| 88 * <aa>\|<bb> BRANCH <aa> BRANCH <bb> --> END | |
| 89 * | ^ | ^ | |
| 90 * +------+ +----------+ | |
| 91 * | |
| 92 * | |
| 93 * +------------------+ | |
| 94 * V | | |
| 95 * <aa>* BRANCH BRANCH <aa> --> BACK BRANCH --> NOTHING --> END | |
| 96 * | | ^ ^ | |
| 97 * | +---------------+ | | |
| 98 * +---------------------------------------------+ | |
| 99 * | |
| 100 * | |
| 167 | 101 * +----------------------+ |
| 102 * V | | |
| 233 | 103 * <aa>\+ BRANCH <aa> --> BRANCH --> BACK BRANCH --> NOTHING --> END |
| 856 | 104 * | | ^ ^ |
| 105 * | +-----------+ | | |
| 179 | 106 * +--------------------------------------------------+ |
| 167 | 107 * |
| 108 * | |
| 7 | 109 * +-------------------------+ |
| 110 * V | | |
| 111 * <aa>\{} BRANCH BRACE_LIMITS --> BRACE_COMPLEX <aa> --> BACK END | |
| 112 * | | ^ | |
| 113 * | +----------------+ | |
| 114 * +-----------------------------------------------+ | |
| 115 * | |
| 116 * | |
| 117 * <aa>\@!<bb> BRANCH NOMATCH <aa> --> END <bb> --> END | |
| 118 * | | ^ ^ | |
| 119 * | +----------------+ | | |
| 120 * +--------------------------------+ | |
| 121 * | |
| 122 * +---------+ | |
| 123 * | V | |
| 124 * \z[abc] BRANCH BRANCH a BRANCH b BRANCH c BRANCH NOTHING --> END | |
| 125 * | | | | ^ ^ | |
| 126 * | | | +-----+ | | |
| 127 * | | +----------------+ | | |
| 128 * | +---------------------------+ | | |
| 129 * +------------------------------------------------------+ | |
| 130 * | |
| 1209 | 131 * They all start with a BRANCH for "\|" alternatives, even when there is only |
| 7 | 132 * one alternative. |
| 133 */ | |
| 134 | |
| 135 /* | |
| 136 * The opcodes are: | |
| 137 */ | |
| 138 | |
| 139 /* definition number opnd? meaning */ | |
| 140 #define END 0 /* End of program or NOMATCH operand. */ | |
| 141 #define BOL 1 /* Match "" at beginning of line. */ | |
| 142 #define EOL 2 /* Match "" at end of line. */ | |
| 143 #define BRANCH 3 /* node Match this alternative, or the | |
| 144 * next... */ | |
| 145 #define BACK 4 /* Match "", "next" ptr points backward. */ | |
| 146 #define EXACTLY 5 /* str Match this string. */ | |
| 147 #define NOTHING 6 /* Match empty string. */ | |
| 148 #define STAR 7 /* node Match this (simple) thing 0 or more | |
| 149 * times. */ | |
| 150 #define PLUS 8 /* node Match this (simple) thing 1 or more | |
| 151 * times. */ | |
| 152 #define MATCH 9 /* node match the operand zero-width */ | |
| 153 #define NOMATCH 10 /* node check for no match with operand */ | |
| 154 #define BEHIND 11 /* node look behind for a match with operand */ | |
| 155 #define NOBEHIND 12 /* node look behind for no match with operand */ | |
| 156 #define SUBPAT 13 /* node match the operand here */ | |
| 157 #define BRACE_SIMPLE 14 /* node Match this (simple) thing between m and | |
| 158 * n times (\{m,n\}). */ | |
| 159 #define BOW 15 /* Match "" after [^a-zA-Z0-9_] */ | |
| 160 #define EOW 16 /* Match "" at [^a-zA-Z0-9_] */ | |
| 161 #define BRACE_LIMITS 17 /* nr nr define the min & max for BRACE_SIMPLE | |
| 162 * and BRACE_COMPLEX. */ | |
| 163 #define NEWL 18 /* Match line-break */ | |
| 164 #define BHPOS 19 /* End position for BEHIND or NOBEHIND */ | |
| 165 | |
| 166 | |
| 167 /* character classes: 20-48 normal, 50-78 include a line-break */ | |
| 168 #define ADD_NL 30 | |
| 169 #define FIRST_NL ANY + ADD_NL | |
| 170 #define ANY 20 /* Match any one character. */ | |
| 171 #define ANYOF 21 /* str Match any character in this string. */ | |
| 172 #define ANYBUT 22 /* str Match any character not in this | |
| 173 * string. */ | |
| 174 #define IDENT 23 /* Match identifier char */ | |
| 175 #define SIDENT 24 /* Match identifier char but no digit */ | |
| 176 #define KWORD 25 /* Match keyword char */ | |
| 177 #define SKWORD 26 /* Match word char but no digit */ | |
| 178 #define FNAME 27 /* Match file name char */ | |
| 179 #define SFNAME 28 /* Match file name char but no digit */ | |
| 180 #define PRINT 29 /* Match printable char */ | |
| 181 #define SPRINT 30 /* Match printable char but no digit */ | |
| 182 #define WHITE 31 /* Match whitespace char */ | |
| 183 #define NWHITE 32 /* Match non-whitespace char */ | |
| 184 #define DIGIT 33 /* Match digit char */ | |
| 185 #define NDIGIT 34 /* Match non-digit char */ | |
| 186 #define HEX 35 /* Match hex char */ | |
| 187 #define NHEX 36 /* Match non-hex char */ | |
| 188 #define OCTAL 37 /* Match octal char */ | |
| 189 #define NOCTAL 38 /* Match non-octal char */ | |
| 190 #define WORD 39 /* Match word char */ | |
| 191 #define NWORD 40 /* Match non-word char */ | |
| 192 #define HEAD 41 /* Match head char */ | |
| 193 #define NHEAD 42 /* Match non-head char */ | |
| 194 #define ALPHA 43 /* Match alpha char */ | |
| 195 #define NALPHA 44 /* Match non-alpha char */ | |
| 196 #define LOWER 45 /* Match lowercase char */ | |
| 197 #define NLOWER 46 /* Match non-lowercase char */ | |
| 198 #define UPPER 47 /* Match uppercase char */ | |
| 199 #define NUPPER 48 /* Match non-uppercase char */ | |
| 200 #define LAST_NL NUPPER + ADD_NL | |
| 201 #define WITH_NL(op) ((op) >= FIRST_NL && (op) <= LAST_NL) | |
| 202 | |
| 203 #define MOPEN 80 /* -89 Mark this point in input as start of | |
| 204 * \( subexpr. MOPEN + 0 marks start of | |
| 205 * match. */ | |
| 206 #define MCLOSE 90 /* -99 Analogous to MOPEN. MCLOSE + 0 marks | |
| 207 * end of match. */ | |
| 208 #define BACKREF 100 /* -109 node Match same string again \1-\9 */ | |
| 209 | |
| 210 #ifdef FEAT_SYN_HL | |
| 211 # define ZOPEN 110 /* -119 Mark this point in input as start of | |
| 212 * \z( subexpr. */ | |
| 213 # define ZCLOSE 120 /* -129 Analogous to ZOPEN. */ | |
| 214 # define ZREF 130 /* -139 node Match external submatch \z1-\z9 */ | |
| 215 #endif | |
| 216 | |
| 217 #define BRACE_COMPLEX 140 /* -149 node Match nodes between m & n times */ | |
| 218 | |
| 219 #define NOPEN 150 /* Mark this point in input as start of | |
| 220 \%( subexpr. */ | |
| 221 #define NCLOSE 151 /* Analogous to NOPEN. */ | |
| 222 | |
| 223 #define MULTIBYTECODE 200 /* mbc Match one multi-byte character */ | |
| 224 #define RE_BOF 201 /* Match "" at beginning of file. */ | |
| 225 #define RE_EOF 202 /* Match "" at end of file. */ | |
| 226 #define CURSOR 203 /* Match location of cursor. */ | |
| 227 | |
| 228 #define RE_LNUM 204 /* nr cmp Match line number */ | |
| 229 #define RE_COL 205 /* nr cmp Match column number */ | |
| 230 #define RE_VCOL 206 /* nr cmp Match virtual column number */ | |
| 231 | |
| 639 | 232 #define RE_MARK 207 /* mark cmp Match mark position */ |
| 233 #define RE_VISUAL 208 /* Match Visual area */ | |
| 234 | |
| 7 | 235 /* |
| 236 * Magic characters have a special meaning, they don't match literally. | |
| 237 * Magic characters are negative. This separates them from literal characters | |
| 238 * (possibly multi-byte). Only ASCII characters can be Magic. | |
| 239 */ | |
| 240 #define Magic(x) ((int)(x) - 256) | |
| 241 #define un_Magic(x) ((x) + 256) | |
| 242 #define is_Magic(x) ((x) < 0) | |
| 243 | |
| 244 static int no_Magic __ARGS((int x)); | |
| 245 static int toggle_Magic __ARGS((int x)); | |
| 246 | |
| 247 static int | |
| 248 no_Magic(x) | |
| 249 int x; | |
| 250 { | |
| 251 if (is_Magic(x)) | |
| 252 return un_Magic(x); | |
| 253 return x; | |
| 254 } | |
| 255 | |
| 256 static int | |
| 257 toggle_Magic(x) | |
| 258 int x; | |
| 259 { | |
| 260 if (is_Magic(x)) | |
| 261 return un_Magic(x); | |
| 262 return Magic(x); | |
| 263 } | |
| 264 | |
| 265 /* | |
| 266 * The first byte of the regexp internal "program" is actually this magic | |
| 267 * number; the start node begins in the second byte. It's used to catch the | |
| 268 * most severe mutilation of the program by the caller. | |
| 269 */ | |
| 270 | |
| 271 #define REGMAGIC 0234 | |
| 272 | |
| 273 /* | |
| 274 * Opcode notes: | |
| 275 * | |
| 276 * BRANCH The set of branches constituting a single choice are hooked | |
| 277 * together with their "next" pointers, since precedence prevents | |
| 278 * anything being concatenated to any individual branch. The | |
| 279 * "next" pointer of the last BRANCH in a choice points to the | |
| 280 * thing following the whole choice. This is also where the | |
| 281 * final "next" pointer of each individual branch points; each | |
| 282 * branch starts with the operand node of a BRANCH node. | |
| 283 * | |
| 284 * BACK Normal "next" pointers all implicitly point forward; BACK | |
| 285 * exists to make loop structures possible. | |
| 286 * | |
| 287 * STAR,PLUS '=', and complex '*' and '+', are implemented as circular | |
| 288 * BRANCH structures using BACK. Simple cases (one character | |
| 289 * per match) are implemented with STAR and PLUS for speed | |
| 290 * and to minimize recursive plunges. | |
| 291 * | |
| 292 * BRACE_LIMITS This is always followed by a BRACE_SIMPLE or BRACE_COMPLEX | |
| 293 * node, and defines the min and max limits to be used for that | |
| 294 * node. | |
| 295 * | |
| 296 * MOPEN,MCLOSE ...are numbered at compile time. | |
| 297 * ZOPEN,ZCLOSE ...ditto | |
| 298 */ | |
| 299 | |
| 300 /* | |
| 301 * A node is one char of opcode followed by two chars of "next" pointer. | |
| 302 * "Next" pointers are stored as two 8-bit bytes, high order first. The | |
| 303 * value is a positive offset from the opcode of the node containing it. | |
| 304 * An operand, if any, simply follows the node. (Note that much of the | |
| 305 * code generation knows about this implicit relationship.) | |
| 306 * | |
| 307 * Using two bytes for the "next" pointer is vast overkill for most things, | |
| 308 * but allows patterns to get big without disasters. | |
| 309 */ | |
| 310 #define OP(p) ((int)*(p)) | |
| 311 #define NEXT(p) (((*((p) + 1) & 0377) << 8) + (*((p) + 2) & 0377)) | |
| 312 #define OPERAND(p) ((p) + 3) | |
| 313 /* Obtain an operand that was stored as four bytes, MSB first. */ | |
| 314 #define OPERAND_MIN(p) (((long)(p)[3] << 24) + ((long)(p)[4] << 16) \ | |
| 315 + ((long)(p)[5] << 8) + (long)(p)[6]) | |
| 316 /* Obtain a second operand stored as four bytes. */ | |
| 317 #define OPERAND_MAX(p) OPERAND_MIN((p) + 4) | |
| 318 /* Obtain a second single-byte operand stored after a four bytes operand. */ | |
| 319 #define OPERAND_CMP(p) (p)[7] | |
| 320 | |
| 321 /* | |
| 322 * Utility definitions. | |
| 323 */ | |
| 324 #define UCHARAT(p) ((int)*(char_u *)(p)) | |
| 325 | |
| 326 /* Used for an error (down from) vim_regcomp(): give the error message, set | |
| 327 * rc_did_emsg and return NULL */ | |
| 653 | 328 #define EMSG_RET_NULL(m) return (EMSG(m), rc_did_emsg = TRUE, (void *)NULL) |
| 329 #define EMSG_M_RET_NULL(m, c) return (EMSG2((m), (c) ? "" : "\\"), rc_did_emsg = TRUE, (void *)NULL) | |
| 308 | 330 #define EMSG_RET_FAIL(m) return (EMSG(m), rc_did_emsg = TRUE, FAIL) |
| 7 | 331 #define EMSG_ONE_RET_NULL EMSG_M_RET_NULL(_("E369: invalid item in %s%%[]"), reg_magic == MAGIC_ALL) |
| 332 | |
| 333 #define MAX_LIMIT (32767L << 16L) | |
| 334 | |
| 335 static int re_multi_type __ARGS((int)); | |
| 336 static int cstrncmp __ARGS((char_u *s1, char_u *s2, int *n)); | |
| 337 static char_u *cstrchr __ARGS((char_u *, int)); | |
| 338 | |
| 339 #ifdef DEBUG | |
| 340 static void regdump __ARGS((char_u *, regprog_T *)); | |
| 341 static char_u *regprop __ARGS((char_u *)); | |
| 342 #endif | |
| 343 | |
| 344 #define NOT_MULTI 0 | |
| 345 #define MULTI_ONE 1 | |
| 346 #define MULTI_MULT 2 | |
| 347 /* | |
| 348 * Return NOT_MULTI if c is not a "multi" operator. | |
| 349 * Return MULTI_ONE if c is a single "multi" operator. | |
| 350 * Return MULTI_MULT if c is a multi "multi" operator. | |
| 351 */ | |
| 352 static int | |
| 353 re_multi_type(c) | |
| 354 int c; | |
| 355 { | |
| 356 if (c == Magic('@') || c == Magic('=') || c == Magic('?')) | |
| 357 return MULTI_ONE; | |
| 358 if (c == Magic('*') || c == Magic('+') || c == Magic('{')) | |
| 359 return MULTI_MULT; | |
| 360 return NOT_MULTI; | |
| 361 } | |
| 362 | |
| 363 /* | |
| 364 * Flags to be passed up and down. | |
| 365 */ | |
| 366 #define HASWIDTH 0x1 /* Known never to match null string. */ | |
| 367 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */ | |
| 368 #define SPSTART 0x4 /* Starts with * or +. */ | |
| 369 #define HASNL 0x8 /* Contains some \n. */ | |
| 370 #define HASLOOKBH 0x10 /* Contains "\@<=" or "\@<!". */ | |
| 371 #define WORST 0 /* Worst case. */ | |
| 372 | |
| 373 /* | |
| 374 * When regcode is set to this value, code is not emitted and size is computed | |
| 375 * instead. | |
| 376 */ | |
| 377 #define JUST_CALC_SIZE ((char_u *) -1) | |
| 378 | |
| 359 | 379 static char_u *reg_prev_sub = NULL; |
| 380 | |
| 7 | 381 /* |
| 382 * REGEXP_INRANGE contains all characters which are always special in a [] | |
| 383 * range after '\'. | |
| 384 * REGEXP_ABBR contains all characters which act as abbreviations after '\'. | |
| 385 * These are: | |
| 386 * \n - New line (NL). | |
| 387 * \r - Carriage Return (CR). | |
| 388 * \t - Tab (TAB). | |
| 389 * \e - Escape (ESC). | |
| 390 * \b - Backspace (Ctrl_H). | |
| 24 | 391 * \d - Character code in decimal, eg \d123 |
| 392 * \o - Character code in octal, eg \o80 | |
| 393 * \x - Character code in hex, eg \x4a | |
| 394 * \u - Multibyte character code, eg \u20ac | |
| 395 * \U - Long multibyte character code, eg \U12345678 | |
| 7 | 396 */ |
| 397 static char_u REGEXP_INRANGE[] = "]^-n\\"; | |
| 24 | 398 static char_u REGEXP_ABBR[] = "nrtebdoxuU"; |
| 7 | 399 |
| 400 static int backslash_trans __ARGS((int c)); | |
| 167 | 401 static int get_char_class __ARGS((char_u **pp)); |
| 402 static int get_equi_class __ARGS((char_u **pp)); | |
| 403 static void reg_equi_class __ARGS((int c)); | |
| 404 static int get_coll_element __ARGS((char_u **pp)); | |
| 7 | 405 static char_u *skip_anyof __ARGS((char_u *p)); |
| 406 static void init_class_tab __ARGS((void)); | |
| 407 | |
| 408 /* | |
| 409 * Translate '\x' to its control character, except "\n", which is Magic. | |
| 410 */ | |
| 411 static int | |
| 412 backslash_trans(c) | |
| 413 int c; | |
| 414 { | |
| 415 switch (c) | |
| 416 { | |
| 417 case 'r': return CAR; | |
| 418 case 't': return TAB; | |
| 419 case 'e': return ESC; | |
| 420 case 'b': return BS; | |
| 421 } | |
| 422 return c; | |
| 423 } | |
| 424 | |
| 425 /* | |
| 167 | 426 * Check for a character class name "[:name:]". "pp" points to the '['. |
| 7 | 427 * Returns one of the CLASS_ items. CLASS_NONE means that no item was |
| 428 * recognized. Otherwise "pp" is advanced to after the item. | |
| 429 */ | |
| 430 static int | |
| 167 | 431 get_char_class(pp) |
| 7 | 432 char_u **pp; |
| 433 { | |
| 434 static const char *(class_names[]) = | |
| 435 { | |
| 436 "alnum:]", | |
| 437 #define CLASS_ALNUM 0 | |
| 438 "alpha:]", | |
| 439 #define CLASS_ALPHA 1 | |
| 440 "blank:]", | |
| 441 #define CLASS_BLANK 2 | |
| 442 "cntrl:]", | |
| 443 #define CLASS_CNTRL 3 | |
| 444 "digit:]", | |
| 445 #define CLASS_DIGIT 4 | |
| 446 "graph:]", | |
| 447 #define CLASS_GRAPH 5 | |
| 448 "lower:]", | |
| 449 #define CLASS_LOWER 6 | |
| 450 "print:]", | |
| 451 #define CLASS_PRINT 7 | |
| 452 "punct:]", | |
| 453 #define CLASS_PUNCT 8 | |
| 454 "space:]", | |
| 455 #define CLASS_SPACE 9 | |
| 456 "upper:]", | |
| 457 #define CLASS_UPPER 10 | |
| 458 "xdigit:]", | |
| 459 #define CLASS_XDIGIT 11 | |
| 460 "tab:]", | |
| 461 #define CLASS_TAB 12 | |
| 462 "return:]", | |
| 463 #define CLASS_RETURN 13 | |
| 464 "backspace:]", | |
| 465 #define CLASS_BACKSPACE 14 | |
| 466 "escape:]", | |
| 467 #define CLASS_ESCAPE 15 | |
| 468 }; | |
| 469 #define CLASS_NONE 99 | |
| 470 int i; | |
| 471 | |
| 472 if ((*pp)[1] == ':') | |
| 473 { | |
| 1877 | 474 for (i = 0; i < (int)(sizeof(class_names) / sizeof(*class_names)); ++i) |
| 7 | 475 if (STRNCMP(*pp + 2, class_names[i], STRLEN(class_names[i])) == 0) |
| 476 { | |
| 477 *pp += STRLEN(class_names[i]) + 2; | |
| 478 return i; | |
| 479 } | |
| 480 } | |
| 481 return CLASS_NONE; | |
| 482 } | |
| 483 | |
| 484 /* | |
| 485 * Specific version of character class functions. | |
| 486 * Using a table to keep this fast. | |
| 487 */ | |
| 488 static short class_tab[256]; | |
| 489 | |
| 490 #define RI_DIGIT 0x01 | |
| 491 #define RI_HEX 0x02 | |
| 492 #define RI_OCTAL 0x04 | |
| 493 #define RI_WORD 0x08 | |
| 494 #define RI_HEAD 0x10 | |
| 495 #define RI_ALPHA 0x20 | |
| 496 #define RI_LOWER 0x40 | |
| 497 #define RI_UPPER 0x80 | |
| 498 #define RI_WHITE 0x100 | |
| 499 | |
| 500 static void | |
| 501 init_class_tab() | |
| 502 { | |
| 503 int i; | |
| 504 static int done = FALSE; | |
| 505 | |
| 506 if (done) | |
| 507 return; | |
| 508 | |
| 509 for (i = 0; i < 256; ++i) | |
| 510 { | |
| 511 if (i >= '0' && i <= '7') | |
| 512 class_tab[i] = RI_DIGIT + RI_HEX + RI_OCTAL + RI_WORD; | |
| 513 else if (i >= '8' && i <= '9') | |
| 514 class_tab[i] = RI_DIGIT + RI_HEX + RI_WORD; | |
| 515 else if (i >= 'a' && i <= 'f') | |
| 516 class_tab[i] = RI_HEX + RI_WORD + RI_HEAD + RI_ALPHA + RI_LOWER; | |
| 517 #ifdef EBCDIC | |
| 518 else if ((i >= 'g' && i <= 'i') || (i >= 'j' && i <= 'r') | |
| 519 || (i >= 's' && i <= 'z')) | |
| 520 #else | |
| 521 else if (i >= 'g' && i <= 'z') | |
| 522 #endif | |
| 523 class_tab[i] = RI_WORD + RI_HEAD + RI_ALPHA + RI_LOWER; | |
| 524 else if (i >= 'A' && i <= 'F') | |
| 525 class_tab[i] = RI_HEX + RI_WORD + RI_HEAD + RI_ALPHA + RI_UPPER; | |
| 526 #ifdef EBCDIC | |
| 527 else if ((i >= 'G' && i <= 'I') || ( i >= 'J' && i <= 'R') | |
| 528 || (i >= 'S' && i <= 'Z')) | |
| 529 #else | |
| 530 else if (i >= 'G' && i <= 'Z') | |
| 531 #endif | |
| 532 class_tab[i] = RI_WORD + RI_HEAD + RI_ALPHA + RI_UPPER; | |
| 533 else if (i == '_') | |
| 534 class_tab[i] = RI_WORD + RI_HEAD; | |
| 535 else | |
| 536 class_tab[i] = 0; | |
| 537 } | |
| 538 class_tab[' '] |= RI_WHITE; | |
| 539 class_tab['\t'] |= RI_WHITE; | |
| 540 done = TRUE; | |
| 541 } | |
| 542 | |
| 543 #ifdef FEAT_MBYTE | |
| 544 # define ri_digit(c) (c < 0x100 && (class_tab[c] & RI_DIGIT)) | |
| 545 # define ri_hex(c) (c < 0x100 && (class_tab[c] & RI_HEX)) | |
| 546 # define ri_octal(c) (c < 0x100 && (class_tab[c] & RI_OCTAL)) | |
| 547 # define ri_word(c) (c < 0x100 && (class_tab[c] & RI_WORD)) | |
| 548 # define ri_head(c) (c < 0x100 && (class_tab[c] & RI_HEAD)) | |
| 549 # define ri_alpha(c) (c < 0x100 && (class_tab[c] & RI_ALPHA)) | |
| 550 # define ri_lower(c) (c < 0x100 && (class_tab[c] & RI_LOWER)) | |
| 551 # define ri_upper(c) (c < 0x100 && (class_tab[c] & RI_UPPER)) | |
| 552 # define ri_white(c) (c < 0x100 && (class_tab[c] & RI_WHITE)) | |
| 553 #else | |
| 554 # define ri_digit(c) (class_tab[c] & RI_DIGIT) | |
| 555 # define ri_hex(c) (class_tab[c] & RI_HEX) | |
| 556 # define ri_octal(c) (class_tab[c] & RI_OCTAL) | |
| 557 # define ri_word(c) (class_tab[c] & RI_WORD) | |
| 558 # define ri_head(c) (class_tab[c] & RI_HEAD) | |
| 559 # define ri_alpha(c) (class_tab[c] & RI_ALPHA) | |
| 560 # define ri_lower(c) (class_tab[c] & RI_LOWER) | |
| 561 # define ri_upper(c) (class_tab[c] & RI_UPPER) | |
| 562 # define ri_white(c) (class_tab[c] & RI_WHITE) | |
| 563 #endif | |
| 564 | |
| 565 /* flags for regflags */ | |
| 566 #define RF_ICASE 1 /* ignore case */ | |
| 567 #define RF_NOICASE 2 /* don't ignore case */ | |
| 568 #define RF_HASNL 4 /* can match a NL */ | |
| 569 #define RF_ICOMBINE 8 /* ignore combining characters */ | |
| 570 #define RF_LOOKBH 16 /* uses "\@<=" or "\@<!" */ | |
| 571 | |
| 572 /* | |
| 573 * Global work variables for vim_regcomp(). | |
| 574 */ | |
| 575 | |
| 576 static char_u *regparse; /* Input-scan pointer. */ | |
| 577 static int prevchr_len; /* byte length of previous char */ | |
| 578 static int num_complex_braces; /* Complex \{...} count */ | |
| 579 static int regnpar; /* () count. */ | |
| 580 #ifdef FEAT_SYN_HL | |
| 581 static int regnzpar; /* \z() count. */ | |
| 582 static int re_has_z; /* \z item detected */ | |
| 583 #endif | |
| 584 static char_u *regcode; /* Code-emit pointer, or JUST_CALC_SIZE */ | |
| 585 static long regsize; /* Code size. */ | |
| 2010 | 586 static int reg_toolong; /* TRUE when offset out of range */ |
| 7 | 587 static char_u had_endbrace[NSUBEXP]; /* flags, TRUE if end of () found */ |
| 588 static unsigned regflags; /* RF_ flags for prog */ | |
| 589 static long brace_min[10]; /* Minimums for complex brace repeats */ | |
| 590 static long brace_max[10]; /* Maximums for complex brace repeats */ | |
| 591 static int brace_count[10]; /* Current counts for complex brace repeats */ | |
| 592 #if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 593 static int had_eol; /* TRUE when EOL found by vim_regcomp() */ | |
| 594 #endif | |
| 595 static int one_exactly = FALSE; /* only do one char for EXACTLY */ | |
| 596 | |
| 597 static int reg_magic; /* magicness of the pattern: */ | |
| 598 #define MAGIC_NONE 1 /* "\V" very unmagic */ | |
| 599 #define MAGIC_OFF 2 /* "\M" or 'magic' off */ | |
| 600 #define MAGIC_ON 3 /* "\m" or 'magic' */ | |
| 601 #define MAGIC_ALL 4 /* "\v" very magic */ | |
| 602 | |
| 603 static int reg_string; /* matching with a string instead of a buffer | |
| 604 line */ | |
| 481 | 605 static int reg_strict; /* "[abc" is illegal */ |
| 7 | 606 |
| 607 /* | |
| 608 * META contains all characters that may be magic, except '^' and '$'. | |
| 609 */ | |
| 610 | |
| 611 #ifdef EBCDIC | |
| 612 static char_u META[] = "%&()*+.123456789<=>?@ACDFHIKLMOPSUVWX[_acdfhiklmnopsuvwxz{|~"; | |
| 613 #else | |
| 614 /* META[] is used often enough to justify turning it into a table. */ | |
| 615 static char_u META_flags[] = { | |
| 616 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
| 617 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
| 618 /* % & ( ) * + . */ | |
| 619 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, | |
| 620 /* 1 2 3 4 5 6 7 8 9 < = > ? */ | |
| 621 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, | |
| 622 /* @ A C D F H I K L M O */ | |
| 623 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, | |
| 624 /* P S U V W X Z [ _ */ | |
| 625 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, | |
| 626 /* a c d f h i k l m n o */ | |
| 627 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, | |
| 628 /* p s u v w x z { | ~ */ | |
| 629 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1 | |
| 630 }; | |
| 631 #endif | |
| 632 | |
| 633 static int curchr; | |
| 634 | |
| 635 /* arguments for reg() */ | |
| 636 #define REG_NOPAREN 0 /* toplevel reg() */ | |
| 637 #define REG_PAREN 1 /* \(\) */ | |
| 638 #define REG_ZPAREN 2 /* \z(\) */ | |
| 639 #define REG_NPAREN 3 /* \%(\) */ | |
| 640 | |
| 641 /* | |
| 642 * Forward declarations for vim_regcomp()'s friends. | |
| 643 */ | |
| 644 static void initchr __ARGS((char_u *)); | |
| 645 static int getchr __ARGS((void)); | |
| 646 static void skipchr_keepstart __ARGS((void)); | |
| 647 static int peekchr __ARGS((void)); | |
| 648 static void skipchr __ARGS((void)); | |
| 649 static void ungetchr __ARGS((void)); | |
| 24 | 650 static int gethexchrs __ARGS((int maxinputlen)); |
| 651 static int getoctchrs __ARGS((void)); | |
| 652 static int getdecchrs __ARGS((void)); | |
| 653 static int coll_get_char __ARGS((void)); | |
| 7 | 654 static void regcomp_start __ARGS((char_u *expr, int flags)); |
| 655 static char_u *reg __ARGS((int, int *)); | |
| 656 static char_u *regbranch __ARGS((int *flagp)); | |
| 657 static char_u *regconcat __ARGS((int *flagp)); | |
| 658 static char_u *regpiece __ARGS((int *)); | |
| 659 static char_u *regatom __ARGS((int *)); | |
| 660 static char_u *regnode __ARGS((int)); | |
| 714 | 661 #ifdef FEAT_MBYTE |
| 662 static int use_multibytecode __ARGS((int c)); | |
| 663 #endif | |
| 7 | 664 static int prog_magic_wrong __ARGS((void)); |
| 665 static char_u *regnext __ARGS((char_u *)); | |
| 666 static void regc __ARGS((int b)); | |
| 667 #ifdef FEAT_MBYTE | |
| 668 static void regmbc __ARGS((int c)); | |
| 167 | 669 #else |
| 670 # define regmbc(c) regc(c) | |
| 7 | 671 #endif |
| 672 static void reginsert __ARGS((int, char_u *)); | |
| 673 static void reginsert_limits __ARGS((int, long, long, char_u *)); | |
| 674 static char_u *re_put_long __ARGS((char_u *pr, long_u val)); | |
| 675 static int read_limits __ARGS((long *, long *)); | |
| 676 static void regtail __ARGS((char_u *, char_u *)); | |
| 677 static void regoptail __ARGS((char_u *, char_u *)); | |
| 678 | |
| 679 /* | |
| 680 * Return TRUE if compiled regular expression "prog" can match a line break. | |
| 681 */ | |
| 682 int | |
| 683 re_multiline(prog) | |
| 684 regprog_T *prog; | |
| 685 { | |
| 686 return (prog->regflags & RF_HASNL); | |
| 687 } | |
| 688 | |
| 689 /* | |
| 690 * Return TRUE if compiled regular expression "prog" looks before the start | |
| 691 * position (pattern contains "\@<=" or "\@<!"). | |
| 692 */ | |
| 693 int | |
| 694 re_lookbehind(prog) | |
| 695 regprog_T *prog; | |
| 696 { | |
| 697 return (prog->regflags & RF_LOOKBH); | |
| 698 } | |
| 699 | |
| 700 /* | |
| 167 | 701 * Check for an equivalence class name "[=a=]". "pp" points to the '['. |
| 702 * Returns a character representing the class. Zero means that no item was | |
| 703 * recognized. Otherwise "pp" is advanced to after the item. | |
| 704 */ | |
| 705 static int | |
| 706 get_equi_class(pp) | |
| 707 char_u **pp; | |
| 708 { | |
| 709 int c; | |
| 710 int l = 1; | |
| 711 char_u *p = *pp; | |
| 712 | |
| 713 if (p[1] == '=') | |
| 714 { | |
| 715 #ifdef FEAT_MBYTE | |
| 716 if (has_mbyte) | |
| 474 | 717 l = (*mb_ptr2len)(p + 2); |
| 167 | 718 #endif |
| 719 if (p[l + 2] == '=' && p[l + 3] == ']') | |
| 720 { | |
| 721 #ifdef FEAT_MBYTE | |
| 722 if (has_mbyte) | |
| 723 c = mb_ptr2char(p + 2); | |
| 724 else | |
| 725 #endif | |
| 726 c = p[2]; | |
| 727 *pp += l + 4; | |
| 728 return c; | |
| 729 } | |
| 730 } | |
| 731 return 0; | |
| 732 } | |
| 733 | |
|
2247
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
734 #ifdef EBCDIC |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
735 /* |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
736 * Table for equivalence class "c". (IBM-1047) |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
737 */ |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
738 char *EQUIVAL_CLASS_C[16] = { |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
739 "A\x62\x63\x64\x65\x66\x67", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
740 "C\x68", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
741 "E\x71\x72\x73\x74", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
742 "I\x75\x76\x77\x78", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
743 "N\x69", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
744 "O\xEB\xEC\xED\xEE\xEF", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
745 "U\xFB\xFC\xFD\xFE", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
746 "Y\xBA", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
747 "a\x42\x43\x44\x45\x46\x47", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
748 "c\x48", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
749 "e\x51\x52\x53\x54", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
750 "i\x55\x56\x57\x58", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
751 "n\x49", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
752 "o\xCB\xCC\xCD\xCE\xCF", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
753 "u\xDB\xDC\xDD\xDE", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
754 "y\x8D\xDF", |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
755 }; |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
756 #endif |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
757 |
| 167 | 758 /* |
| 759 * Produce the bytes for equivalence class "c". | |
| 760 * Currently only handles latin1, latin9 and utf-8. | |
| 761 */ | |
| 762 static void | |
| 763 reg_equi_class(c) | |
| 764 int c; | |
| 765 { | |
| 766 #ifdef FEAT_MBYTE | |
| 767 if (enc_utf8 || STRCMP(p_enc, "latin1") == 0 | |
| 492 | 768 || STRCMP(p_enc, "iso-8859-15") == 0) |
| 167 | 769 #endif |
| 770 { | |
|
2247
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
771 #ifdef EBCDIC |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
772 int i; |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
773 |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
774 /* This might be slower than switch/case below. */ |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
775 for (i = 0; i < 16; i++) |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
776 { |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
777 if (vim_strchr(EQUIVAL_CLASS_C[i], c) != NULL) |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
778 { |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
779 char *p = EQUIVAL_CLASS_C[i]; |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
780 |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
781 while (*p != 0) |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
782 regmbc(*p++); |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
783 return; |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
784 } |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
785 } |
|
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
786 #else |
| 167 | 787 switch (c) |
| 788 { | |
| 236 | 789 case 'A': case '\300': case '\301': case '\302': |
| 790 case '\303': case '\304': case '\305': | |
| 791 regmbc('A'); regmbc('\300'); regmbc('\301'); | |
| 792 regmbc('\302'); regmbc('\303'); regmbc('\304'); | |
| 793 regmbc('\305'); | |
| 167 | 794 return; |
| 236 | 795 case 'C': case '\307': |
| 796 regmbc('C'); regmbc('\307'); | |
| 167 | 797 return; |
| 236 | 798 case 'E': case '\310': case '\311': case '\312': case '\313': |
| 799 regmbc('E'); regmbc('\310'); regmbc('\311'); | |
| 800 regmbc('\312'); regmbc('\313'); | |
| 167 | 801 return; |
| 236 | 802 case 'I': case '\314': case '\315': case '\316': case '\317': |
| 803 regmbc('I'); regmbc('\314'); regmbc('\315'); | |
| 804 regmbc('\316'); regmbc('\317'); | |
| 167 | 805 return; |
| 236 | 806 case 'N': case '\321': |
| 807 regmbc('N'); regmbc('\321'); | |
| 167 | 808 return; |
| 236 | 809 case 'O': case '\322': case '\323': case '\324': case '\325': |
| 810 case '\326': | |
| 811 regmbc('O'); regmbc('\322'); regmbc('\323'); | |
| 812 regmbc('\324'); regmbc('\325'); regmbc('\326'); | |
| 167 | 813 return; |
| 236 | 814 case 'U': case '\331': case '\332': case '\333': case '\334': |
| 815 regmbc('U'); regmbc('\331'); regmbc('\332'); | |
| 816 regmbc('\333'); regmbc('\334'); | |
| 167 | 817 return; |
| 236 | 818 case 'Y': case '\335': |
| 819 regmbc('Y'); regmbc('\335'); | |
| 167 | 820 return; |
| 236 | 821 case 'a': case '\340': case '\341': case '\342': |
| 822 case '\343': case '\344': case '\345': | |
| 823 regmbc('a'); regmbc('\340'); regmbc('\341'); | |
| 824 regmbc('\342'); regmbc('\343'); regmbc('\344'); | |
| 825 regmbc('\345'); | |
| 167 | 826 return; |
| 236 | 827 case 'c': case '\347': |
| 828 regmbc('c'); regmbc('\347'); | |
| 167 | 829 return; |
| 236 | 830 case 'e': case '\350': case '\351': case '\352': case '\353': |
| 831 regmbc('e'); regmbc('\350'); regmbc('\351'); | |
| 832 regmbc('\352'); regmbc('\353'); | |
| 167 | 833 return; |
| 236 | 834 case 'i': case '\354': case '\355': case '\356': case '\357': |
| 835 regmbc('i'); regmbc('\354'); regmbc('\355'); | |
| 836 regmbc('\356'); regmbc('\357'); | |
| 167 | 837 return; |
| 236 | 838 case 'n': case '\361': |
| 839 regmbc('n'); regmbc('\361'); | |
| 167 | 840 return; |
| 236 | 841 case 'o': case '\362': case '\363': case '\364': case '\365': |
| 842 case '\366': | |
| 843 regmbc('o'); regmbc('\362'); regmbc('\363'); | |
| 844 regmbc('\364'); regmbc('\365'); regmbc('\366'); | |
| 167 | 845 return; |
| 236 | 846 case 'u': case '\371': case '\372': case '\373': case '\374': |
| 847 regmbc('u'); regmbc('\371'); regmbc('\372'); | |
| 848 regmbc('\373'); regmbc('\374'); | |
| 167 | 849 return; |
| 236 | 850 case 'y': case '\375': case '\377': |
| 851 regmbc('y'); regmbc('\375'); regmbc('\377'); | |
| 167 | 852 return; |
| 853 } | |
|
2247
c40cd9aad546
Add patch to improve support of z/OS (OS/390). (Ralf Schandl)
Bram Moolenaar <bram@vim.org>
parents:
2173
diff
changeset
|
854 #endif |
| 167 | 855 } |
| 856 regmbc(c); | |
| 857 } | |
| 858 | |
| 859 /* | |
| 860 * Check for a collating element "[.a.]". "pp" points to the '['. | |
| 861 * Returns a character. Zero means that no item was recognized. Otherwise | |
| 862 * "pp" is advanced to after the item. | |
| 863 * Currently only single characters are recognized! | |
| 864 */ | |
| 865 static int | |
| 866 get_coll_element(pp) | |
| 867 char_u **pp; | |
| 868 { | |
| 869 int c; | |
| 870 int l = 1; | |
| 871 char_u *p = *pp; | |
| 872 | |
| 873 if (p[1] == '.') | |
| 874 { | |
| 875 #ifdef FEAT_MBYTE | |
| 876 if (has_mbyte) | |
| 474 | 877 l = (*mb_ptr2len)(p + 2); |
| 167 | 878 #endif |
| 879 if (p[l + 2] == '.' && p[l + 3] == ']') | |
| 880 { | |
| 881 #ifdef FEAT_MBYTE | |
| 882 if (has_mbyte) | |
| 883 c = mb_ptr2char(p + 2); | |
| 884 else | |
| 885 #endif | |
| 886 c = p[2]; | |
| 887 *pp += l + 4; | |
| 888 return c; | |
| 889 } | |
| 890 } | |
| 891 return 0; | |
| 892 } | |
| 893 | |
| 894 | |
| 895 /* | |
| 896 * Skip over a "[]" range. | |
| 897 * "p" must point to the character after the '['. | |
| 898 * The returned pointer is on the matching ']', or the terminating NUL. | |
| 899 */ | |
| 900 static char_u * | |
| 901 skip_anyof(p) | |
| 902 char_u *p; | |
| 903 { | |
| 904 int cpo_lit; /* 'cpoptions' contains 'l' flag */ | |
| 905 int cpo_bsl; /* 'cpoptions' contains '\' flag */ | |
| 906 #ifdef FEAT_MBYTE | |
| 907 int l; | |
| 908 #endif | |
| 909 | |
| 410 | 910 cpo_lit = vim_strchr(p_cpo, CPO_LITERAL) != NULL; |
| 911 cpo_bsl = vim_strchr(p_cpo, CPO_BACKSL) != NULL; | |
| 167 | 912 |
| 913 if (*p == '^') /* Complement of range. */ | |
| 914 ++p; | |
| 915 if (*p == ']' || *p == '-') | |
| 916 ++p; | |
| 917 while (*p != NUL && *p != ']') | |
| 918 { | |
| 919 #ifdef FEAT_MBYTE | |
| 474 | 920 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
| 167 | 921 p += l; |
| 922 else | |
| 923 #endif | |
| 924 if (*p == '-') | |
| 925 { | |
| 926 ++p; | |
| 927 if (*p != ']' && *p != NUL) | |
| 928 mb_ptr_adv(p); | |
| 929 } | |
| 930 else if (*p == '\\' | |
| 931 && !cpo_bsl | |
| 932 && (vim_strchr(REGEXP_INRANGE, p[1]) != NULL | |
| 933 || (!cpo_lit && vim_strchr(REGEXP_ABBR, p[1]) != NULL))) | |
| 934 p += 2; | |
| 935 else if (*p == '[') | |
| 936 { | |
| 937 if (get_char_class(&p) == CLASS_NONE | |
| 938 && get_equi_class(&p) == 0 | |
| 939 && get_coll_element(&p) == 0) | |
| 940 ++p; /* It was not a class name */ | |
| 941 } | |
| 942 else | |
| 943 ++p; | |
| 944 } | |
| 945 | |
| 946 return p; | |
| 947 } | |
| 948 | |
| 949 /* | |
| 7 | 950 * Skip past regular expression. |
| 153 | 951 * Stop at end of "startp" or where "dirc" is found ('/', '?', etc). |
| 7 | 952 * Take care of characters with a backslash in front of it. |
| 953 * Skip strings inside [ and ]. | |
| 954 * When "newp" is not NULL and "dirc" is '?', make an allocated copy of the | |
| 955 * expression and change "\?" to "?". If "*newp" is not NULL the expression | |
| 956 * is changed in-place. | |
| 957 */ | |
| 958 char_u * | |
| 959 skip_regexp(startp, dirc, magic, newp) | |
| 960 char_u *startp; | |
| 961 int dirc; | |
| 962 int magic; | |
| 963 char_u **newp; | |
| 964 { | |
| 965 int mymagic; | |
| 966 char_u *p = startp; | |
| 967 | |
| 968 if (magic) | |
| 969 mymagic = MAGIC_ON; | |
| 970 else | |
| 971 mymagic = MAGIC_OFF; | |
| 972 | |
| 39 | 973 for (; p[0] != NUL; mb_ptr_adv(p)) |
| 7 | 974 { |
| 975 if (p[0] == dirc) /* found end of regexp */ | |
| 976 break; | |
| 977 if ((p[0] == '[' && mymagic >= MAGIC_ON) | |
| 978 || (p[0] == '\\' && p[1] == '[' && mymagic <= MAGIC_OFF)) | |
| 979 { | |
| 980 p = skip_anyof(p + 1); | |
| 981 if (p[0] == NUL) | |
| 982 break; | |
| 983 } | |
| 984 else if (p[0] == '\\' && p[1] != NUL) | |
| 985 { | |
| 986 if (dirc == '?' && newp != NULL && p[1] == '?') | |
| 987 { | |
| 988 /* change "\?" to "?", make a copy first. */ | |
| 989 if (*newp == NULL) | |
| 990 { | |
| 991 *newp = vim_strsave(startp); | |
| 992 if (*newp != NULL) | |
| 993 p = *newp + (p - startp); | |
| 994 } | |
| 995 if (*newp != NULL) | |
| 1621 | 996 STRMOVE(p, p + 1); |
| 7 | 997 else |
| 998 ++p; | |
| 999 } | |
| 1000 else | |
| 1001 ++p; /* skip next character */ | |
| 1002 if (*p == 'v') | |
| 1003 mymagic = MAGIC_ALL; | |
| 1004 else if (*p == 'V') | |
| 1005 mymagic = MAGIC_NONE; | |
| 1006 } | |
| 1007 } | |
| 1008 return p; | |
| 1009 } | |
| 1010 | |
| 1011 /* | |
| 41 | 1012 * vim_regcomp() - compile a regular expression into internal code |
| 1013 * Returns the program in allocated space. Returns NULL for an error. | |
| 7 | 1014 * |
| 1015 * We can't allocate space until we know how big the compiled form will be, | |
| 1016 * but we can't compile it (and thus know how big it is) until we've got a | |
| 1017 * place to put the code. So we cheat: we compile it twice, once with code | |
| 1018 * generation turned off and size counting turned on, and once "for real". | |
| 1019 * This also means that we don't allocate space until we are sure that the | |
| 1020 * thing really will compile successfully, and we never have to move the | |
| 1021 * code and thus invalidate pointers into it. (Note that it has to be in | |
| 1022 * one piece because vim_free() must be able to free it all.) | |
| 1023 * | |
| 1024 * Whether upper/lower case is to be ignored is decided when executing the | |
| 1025 * program, it does not matter here. | |
| 1026 * | |
| 1027 * Beware that the optimization-preparation code in here knows about some | |
| 1028 * of the structure of the compiled regexp. | |
| 1029 * "re_flags": RE_MAGIC and/or RE_STRING. | |
| 1030 */ | |
| 1031 regprog_T * | |
| 1032 vim_regcomp(expr, re_flags) | |
| 1033 char_u *expr; | |
| 1034 int re_flags; | |
| 1035 { | |
| 1036 regprog_T *r; | |
| 1037 char_u *scan; | |
| 1038 char_u *longest; | |
| 1039 int len; | |
| 1040 int flags; | |
| 1041 | |
| 1042 if (expr == NULL) | |
| 1043 EMSG_RET_NULL(_(e_null)); | |
| 1044 | |
| 1045 init_class_tab(); | |
| 1046 | |
| 1047 /* | |
| 1048 * First pass: determine size, legality. | |
| 1049 */ | |
| 1050 regcomp_start(expr, re_flags); | |
| 1051 regcode = JUST_CALC_SIZE; | |
| 1052 regc(REGMAGIC); | |
| 1053 if (reg(REG_NOPAREN, &flags) == NULL) | |
| 1054 return NULL; | |
| 1055 | |
| 1056 /* Small enough for pointer-storage convention? */ | |
| 1057 #ifdef SMALL_MALLOC /* 16 bit storage allocation */ | |
| 1058 if (regsize >= 65536L - 256L) | |
| 1059 EMSG_RET_NULL(_("E339: Pattern too long")); | |
| 1060 #endif | |
| 1061 | |
| 1062 /* Allocate space. */ | |
| 1063 r = (regprog_T *)lalloc(sizeof(regprog_T) + regsize, TRUE); | |
| 1064 if (r == NULL) | |
| 1065 return NULL; | |
| 1066 | |
| 1067 /* | |
| 1068 * Second pass: emit code. | |
| 1069 */ | |
| 1070 regcomp_start(expr, re_flags); | |
| 1071 regcode = r->program; | |
| 1072 regc(REGMAGIC); | |
| 2010 | 1073 if (reg(REG_NOPAREN, &flags) == NULL || reg_toolong) |
| 7 | 1074 { |
| 1075 vim_free(r); | |
| 2010 | 1076 if (reg_toolong) |
| 1077 EMSG_RET_NULL(_("E339: Pattern too long")); | |
| 7 | 1078 return NULL; |
| 1079 } | |
| 1080 | |
| 1081 /* Dig out information for optimizations. */ | |
| 1082 r->regstart = NUL; /* Worst-case defaults. */ | |
| 1083 r->reganch = 0; | |
| 1084 r->regmust = NULL; | |
| 1085 r->regmlen = 0; | |
| 1086 r->regflags = regflags; | |
| 1087 if (flags & HASNL) | |
| 1088 r->regflags |= RF_HASNL; | |
| 1089 if (flags & HASLOOKBH) | |
| 1090 r->regflags |= RF_LOOKBH; | |
| 1091 #ifdef FEAT_SYN_HL | |
| 1092 /* Remember whether this pattern has any \z specials in it. */ | |
| 1093 r->reghasz = re_has_z; | |
| 1094 #endif | |
| 1095 scan = r->program + 1; /* First BRANCH. */ | |
| 1096 if (OP(regnext(scan)) == END) /* Only one top-level choice. */ | |
| 1097 { | |
| 1098 scan = OPERAND(scan); | |
| 1099 | |
| 1100 /* Starting-point info. */ | |
| 1101 if (OP(scan) == BOL || OP(scan) == RE_BOF) | |
| 1102 { | |
| 1103 r->reganch++; | |
| 1104 scan = regnext(scan); | |
| 1105 } | |
| 1106 | |
| 1107 if (OP(scan) == EXACTLY) | |
| 1108 { | |
| 1109 #ifdef FEAT_MBYTE | |
| 1110 if (has_mbyte) | |
| 1111 r->regstart = (*mb_ptr2char)(OPERAND(scan)); | |
| 1112 else | |
| 1113 #endif | |
| 1114 r->regstart = *OPERAND(scan); | |
| 1115 } | |
| 1116 else if ((OP(scan) == BOW | |
| 1117 || OP(scan) == EOW | |
| 1118 || OP(scan) == NOTHING | |
| 1119 || OP(scan) == MOPEN + 0 || OP(scan) == NOPEN | |
| 1120 || OP(scan) == MCLOSE + 0 || OP(scan) == NCLOSE) | |
| 1121 && OP(regnext(scan)) == EXACTLY) | |
| 1122 { | |
| 1123 #ifdef FEAT_MBYTE | |
| 1124 if (has_mbyte) | |
| 1125 r->regstart = (*mb_ptr2char)(OPERAND(regnext(scan))); | |
| 1126 else | |
| 1127 #endif | |
| 1128 r->regstart = *OPERAND(regnext(scan)); | |
| 1129 } | |
| 1130 | |
| 1131 /* | |
| 1132 * If there's something expensive in the r.e., find the longest | |
| 1133 * literal string that must appear and make it the regmust. Resolve | |
| 1134 * ties in favor of later strings, since the regstart check works | |
| 1135 * with the beginning of the r.e. and avoiding duplication | |
| 1136 * strengthens checking. Not a strong reason, but sufficient in the | |
| 1137 * absence of others. | |
| 1138 */ | |
| 1139 /* | |
| 1140 * When the r.e. starts with BOW, it is faster to look for a regmust | |
| 1141 * first. Used a lot for "#" and "*" commands. (Added by mool). | |
| 1142 */ | |
| 1143 if ((flags & SPSTART || OP(scan) == BOW || OP(scan) == EOW) | |
| 1144 && !(flags & HASNL)) | |
| 1145 { | |
| 1146 longest = NULL; | |
| 1147 len = 0; | |
| 1148 for (; scan != NULL; scan = regnext(scan)) | |
| 1149 if (OP(scan) == EXACTLY && STRLEN(OPERAND(scan)) >= (size_t)len) | |
| 1150 { | |
| 1151 longest = OPERAND(scan); | |
| 1152 len = (int)STRLEN(OPERAND(scan)); | |
| 1153 } | |
| 1154 r->regmust = longest; | |
| 1155 r->regmlen = len; | |
| 1156 } | |
| 1157 } | |
| 1158 #ifdef DEBUG | |
| 1159 regdump(expr, r); | |
| 1160 #endif | |
| 1161 return r; | |
| 1162 } | |
| 1163 | |
| 1164 /* | |
| 1165 * Setup to parse the regexp. Used once to get the length and once to do it. | |
| 1166 */ | |
| 1167 static void | |
| 1168 regcomp_start(expr, re_flags) | |
| 1169 char_u *expr; | |
| 1170 int re_flags; /* see vim_regcomp() */ | |
| 1171 { | |
| 1172 initchr(expr); | |
| 1173 if (re_flags & RE_MAGIC) | |
| 1174 reg_magic = MAGIC_ON; | |
| 1175 else | |
| 1176 reg_magic = MAGIC_OFF; | |
| 1177 reg_string = (re_flags & RE_STRING); | |
| 481 | 1178 reg_strict = (re_flags & RE_STRICT); |
| 7 | 1179 |
| 1180 num_complex_braces = 0; | |
| 1181 regnpar = 1; | |
| 1182 vim_memset(had_endbrace, 0, sizeof(had_endbrace)); | |
| 1183 #ifdef FEAT_SYN_HL | |
| 1184 regnzpar = 1; | |
| 1185 re_has_z = 0; | |
| 1186 #endif | |
| 1187 regsize = 0L; | |
| 2010 | 1188 reg_toolong = FALSE; |
| 7 | 1189 regflags = 0; |
| 1190 #if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 1191 had_eol = FALSE; | |
| 1192 #endif | |
| 1193 } | |
| 1194 | |
| 1195 #if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 1196 /* | |
| 1197 * Check if during the previous call to vim_regcomp the EOL item "$" has been | |
| 1198 * found. This is messy, but it works fine. | |
| 1199 */ | |
| 1200 int | |
| 1201 vim_regcomp_had_eol() | |
| 1202 { | |
| 1203 return had_eol; | |
| 1204 } | |
| 1205 #endif | |
| 1206 | |
| 1207 /* | |
| 1208 * reg - regular expression, i.e. main body or parenthesized thing | |
| 1209 * | |
| 1210 * Caller must absorb opening parenthesis. | |
| 1211 * | |
| 1212 * Combining parenthesis handling with the base level of regular expression | |
| 1213 * is a trifle forced, but the need to tie the tails of the branches to what | |
| 1214 * follows makes it hard to avoid. | |
| 1215 */ | |
| 1216 static char_u * | |
| 1217 reg(paren, flagp) | |
| 1218 int paren; /* REG_NOPAREN, REG_PAREN, REG_NPAREN or REG_ZPAREN */ | |
| 1219 int *flagp; | |
| 1220 { | |
| 1221 char_u *ret; | |
| 1222 char_u *br; | |
| 1223 char_u *ender; | |
| 1224 int parno = 0; | |
| 1225 int flags; | |
| 1226 | |
| 1227 *flagp = HASWIDTH; /* Tentatively. */ | |
| 1228 | |
| 1229 #ifdef FEAT_SYN_HL | |
| 1230 if (paren == REG_ZPAREN) | |
| 1231 { | |
| 1232 /* Make a ZOPEN node. */ | |
| 1233 if (regnzpar >= NSUBEXP) | |
| 1234 EMSG_RET_NULL(_("E50: Too many \\z(")); | |
| 1235 parno = regnzpar; | |
| 1236 regnzpar++; | |
| 1237 ret = regnode(ZOPEN + parno); | |
| 1238 } | |
| 1239 else | |
| 1240 #endif | |
| 1241 if (paren == REG_PAREN) | |
| 1242 { | |
| 1243 /* Make a MOPEN node. */ | |
| 1244 if (regnpar >= NSUBEXP) | |
| 1245 EMSG_M_RET_NULL(_("E51: Too many %s("), reg_magic == MAGIC_ALL); | |
| 1246 parno = regnpar; | |
| 1247 ++regnpar; | |
| 1248 ret = regnode(MOPEN + parno); | |
| 1249 } | |
| 1250 else if (paren == REG_NPAREN) | |
| 1251 { | |
| 1252 /* Make a NOPEN node. */ | |
| 1253 ret = regnode(NOPEN); | |
| 1254 } | |
| 1255 else | |
| 1256 ret = NULL; | |
| 1257 | |
| 1258 /* Pick up the branches, linking them together. */ | |
| 1259 br = regbranch(&flags); | |
| 1260 if (br == NULL) | |
| 1261 return NULL; | |
| 1262 if (ret != NULL) | |
| 1263 regtail(ret, br); /* [MZ]OPEN -> first. */ | |
| 1264 else | |
| 1265 ret = br; | |
| 1266 /* If one of the branches can be zero-width, the whole thing can. | |
| 1267 * If one of the branches has * at start or matches a line-break, the | |
| 1268 * whole thing can. */ | |
| 1269 if (!(flags & HASWIDTH)) | |
| 1270 *flagp &= ~HASWIDTH; | |
| 1271 *flagp |= flags & (SPSTART | HASNL | HASLOOKBH); | |
| 1272 while (peekchr() == Magic('|')) | |
| 1273 { | |
| 1274 skipchr(); | |
| 1275 br = regbranch(&flags); | |
| 2010 | 1276 if (br == NULL || reg_toolong) |
| 7 | 1277 return NULL; |
| 1278 regtail(ret, br); /* BRANCH -> BRANCH. */ | |
| 1279 if (!(flags & HASWIDTH)) | |
| 1280 *flagp &= ~HASWIDTH; | |
| 1281 *flagp |= flags & (SPSTART | HASNL | HASLOOKBH); | |
| 1282 } | |
| 1283 | |
| 1284 /* Make a closing node, and hook it on the end. */ | |
| 1285 ender = regnode( | |
| 1286 #ifdef FEAT_SYN_HL | |
| 1287 paren == REG_ZPAREN ? ZCLOSE + parno : | |
| 1288 #endif | |
| 1289 paren == REG_PAREN ? MCLOSE + parno : | |
| 1290 paren == REG_NPAREN ? NCLOSE : END); | |
| 1291 regtail(ret, ender); | |
| 1292 | |
| 1293 /* Hook the tails of the branches to the closing node. */ | |
| 1294 for (br = ret; br != NULL; br = regnext(br)) | |
| 1295 regoptail(br, ender); | |
| 1296 | |
| 1297 /* Check for proper termination. */ | |
| 1298 if (paren != REG_NOPAREN && getchr() != Magic(')')) | |
| 1299 { | |
| 1300 #ifdef FEAT_SYN_HL | |
| 1301 if (paren == REG_ZPAREN) | |
| 308 | 1302 EMSG_RET_NULL(_("E52: Unmatched \\z(")); |
| 7 | 1303 else |
| 1304 #endif | |
| 1305 if (paren == REG_NPAREN) | |
| 308 | 1306 EMSG_M_RET_NULL(_("E53: Unmatched %s%%("), reg_magic == MAGIC_ALL); |
| 7 | 1307 else |
| 308 | 1308 EMSG_M_RET_NULL(_("E54: Unmatched %s("), reg_magic == MAGIC_ALL); |
| 7 | 1309 } |
| 1310 else if (paren == REG_NOPAREN && peekchr() != NUL) | |
| 1311 { | |
| 1312 if (curchr == Magic(')')) | |
| 308 | 1313 EMSG_M_RET_NULL(_("E55: Unmatched %s)"), reg_magic == MAGIC_ALL); |
| 7 | 1314 else |
| 308 | 1315 EMSG_RET_NULL(_(e_trailing)); /* "Can't happen". */ |
| 7 | 1316 /* NOTREACHED */ |
| 1317 } | |
| 1318 /* | |
| 1319 * Here we set the flag allowing back references to this set of | |
| 1320 * parentheses. | |
| 1321 */ | |
| 1322 if (paren == REG_PAREN) | |
| 1323 had_endbrace[parno] = TRUE; /* have seen the close paren */ | |
| 1324 return ret; | |
| 1325 } | |
| 1326 | |
| 1327 /* | |
| 1468 | 1328 * Handle one alternative of an | operator. |
| 7 | 1329 * Implements the & operator. |
| 1330 */ | |
| 1331 static char_u * | |
| 1332 regbranch(flagp) | |
| 1333 int *flagp; | |
| 1334 { | |
| 1335 char_u *ret; | |
| 1336 char_u *chain = NULL; | |
| 1337 char_u *latest; | |
| 1338 int flags; | |
| 1339 | |
| 1340 *flagp = WORST | HASNL; /* Tentatively. */ | |
| 1341 | |
| 1342 ret = regnode(BRANCH); | |
| 1343 for (;;) | |
| 1344 { | |
| 1345 latest = regconcat(&flags); | |
| 1346 if (latest == NULL) | |
| 1347 return NULL; | |
| 1348 /* If one of the branches has width, the whole thing has. If one of | |
| 1349 * the branches anchors at start-of-line, the whole thing does. | |
| 1350 * If one of the branches uses look-behind, the whole thing does. */ | |
| 1351 *flagp |= flags & (HASWIDTH | SPSTART | HASLOOKBH); | |
| 1352 /* If one of the branches doesn't match a line-break, the whole thing | |
| 1353 * doesn't. */ | |
| 1354 *flagp &= ~HASNL | (flags & HASNL); | |
| 1355 if (chain != NULL) | |
| 1356 regtail(chain, latest); | |
| 1357 if (peekchr() != Magic('&')) | |
| 1358 break; | |
| 1359 skipchr(); | |
| 1360 regtail(latest, regnode(END)); /* operand ends */ | |
| 2010 | 1361 if (reg_toolong) |
| 1362 break; | |
| 7 | 1363 reginsert(MATCH, latest); |
| 1364 chain = latest; | |
| 1365 } | |
| 1366 | |
| 1367 return ret; | |
| 1368 } | |
| 1369 | |
| 1370 /* | |
| 1468 | 1371 * Handle one alternative of an | or & operator. |
| 7 | 1372 * Implements the concatenation operator. |
| 1373 */ | |
| 1374 static char_u * | |
| 1375 regconcat(flagp) | |
| 1376 int *flagp; | |
| 1377 { | |
| 1378 char_u *first = NULL; | |
| 1379 char_u *chain = NULL; | |
| 1380 char_u *latest; | |
| 1381 int flags; | |
| 1382 int cont = TRUE; | |
| 1383 | |
| 1384 *flagp = WORST; /* Tentatively. */ | |
| 1385 | |
| 1386 while (cont) | |
| 1387 { | |
| 1388 switch (peekchr()) | |
| 1389 { | |
| 1390 case NUL: | |
| 1391 case Magic('|'): | |
| 1392 case Magic('&'): | |
| 1393 case Magic(')'): | |
| 1394 cont = FALSE; | |
| 1395 break; | |
| 1396 case Magic('Z'): | |
| 1397 #ifdef FEAT_MBYTE | |
| 1398 regflags |= RF_ICOMBINE; | |
| 1399 #endif | |
| 1400 skipchr_keepstart(); | |
| 1401 break; | |
| 1402 case Magic('c'): | |
| 1403 regflags |= RF_ICASE; | |
| 1404 skipchr_keepstart(); | |
| 1405 break; | |
| 1406 case Magic('C'): | |
| 1407 regflags |= RF_NOICASE; | |
| 1408 skipchr_keepstart(); | |
| 1409 break; | |
| 1410 case Magic('v'): | |
| 1411 reg_magic = MAGIC_ALL; | |
| 1412 skipchr_keepstart(); | |
| 1413 curchr = -1; | |
| 1414 break; | |
| 1415 case Magic('m'): | |
| 1416 reg_magic = MAGIC_ON; | |
| 1417 skipchr_keepstart(); | |
| 1418 curchr = -1; | |
| 1419 break; | |
| 1420 case Magic('M'): | |
| 1421 reg_magic = MAGIC_OFF; | |
| 1422 skipchr_keepstart(); | |
| 1423 curchr = -1; | |
| 1424 break; | |
| 1425 case Magic('V'): | |
| 1426 reg_magic = MAGIC_NONE; | |
| 1427 skipchr_keepstart(); | |
| 1428 curchr = -1; | |
| 1429 break; | |
| 1430 default: | |
| 1431 latest = regpiece(&flags); | |
| 2010 | 1432 if (latest == NULL || reg_toolong) |
| 7 | 1433 return NULL; |
| 1434 *flagp |= flags & (HASWIDTH | HASNL | HASLOOKBH); | |
| 1435 if (chain == NULL) /* First piece. */ | |
| 1436 *flagp |= flags & SPSTART; | |
| 1437 else | |
| 1438 regtail(chain, latest); | |
| 1439 chain = latest; | |
| 1440 if (first == NULL) | |
| 1441 first = latest; | |
| 1442 break; | |
| 1443 } | |
| 1444 } | |
| 1445 if (first == NULL) /* Loop ran zero times. */ | |
| 1446 first = regnode(NOTHING); | |
| 1447 return first; | |
| 1448 } | |
| 1449 | |
| 1450 /* | |
| 1451 * regpiece - something followed by possible [*+=] | |
| 1452 * | |
| 1453 * Note that the branching code sequences used for = and the general cases | |
| 1454 * of * and + are somewhat optimized: they use the same NOTHING node as | |
| 1455 * both the endmarker for their branch list and the body of the last branch. | |
| 1456 * It might seem that this node could be dispensed with entirely, but the | |
| 1457 * endmarker role is not redundant. | |
| 1458 */ | |
| 1459 static char_u * | |
| 1460 regpiece(flagp) | |
| 1461 int *flagp; | |
| 1462 { | |
| 1463 char_u *ret; | |
| 1464 int op; | |
| 1465 char_u *next; | |
| 1466 int flags; | |
| 1467 long minval; | |
| 1468 long maxval; | |
| 1469 | |
| 1470 ret = regatom(&flags); | |
| 1471 if (ret == NULL) | |
| 1472 return NULL; | |
| 1473 | |
| 1474 op = peekchr(); | |
| 1475 if (re_multi_type(op) == NOT_MULTI) | |
| 1476 { | |
| 1477 *flagp = flags; | |
| 1478 return ret; | |
| 1479 } | |
| 1480 /* default flags */ | |
| 1481 *flagp = (WORST | SPSTART | (flags & (HASNL | HASLOOKBH))); | |
| 1482 | |
| 1483 skipchr(); | |
| 1484 switch (op) | |
| 1485 { | |
| 1486 case Magic('*'): | |
| 1487 if (flags & SIMPLE) | |
| 1488 reginsert(STAR, ret); | |
| 1489 else | |
| 1490 { | |
| 1491 /* Emit x* as (x&|), where & means "self". */ | |
| 1492 reginsert(BRANCH, ret); /* Either x */ | |
| 1493 regoptail(ret, regnode(BACK)); /* and loop */ | |
| 1494 regoptail(ret, ret); /* back */ | |
| 1495 regtail(ret, regnode(BRANCH)); /* or */ | |
| 1496 regtail(ret, regnode(NOTHING)); /* null. */ | |
| 1497 } | |
| 1498 break; | |
| 1499 | |
| 1500 case Magic('+'): | |
| 1501 if (flags & SIMPLE) | |
| 1502 reginsert(PLUS, ret); | |
| 1503 else | |
| 1504 { | |
| 1505 /* Emit x+ as x(&|), where & means "self". */ | |
| 1506 next = regnode(BRANCH); /* Either */ | |
| 1507 regtail(ret, next); | |
| 233 | 1508 regtail(regnode(BACK), ret); /* loop back */ |
| 7 | 1509 regtail(next, regnode(BRANCH)); /* or */ |
| 1510 regtail(ret, regnode(NOTHING)); /* null. */ | |
| 1511 } | |
| 1512 *flagp = (WORST | HASWIDTH | (flags & (HASNL | HASLOOKBH))); | |
| 1513 break; | |
| 1514 | |
| 1515 case Magic('@'): | |
| 1516 { | |
| 1517 int lop = END; | |
| 1518 | |
| 1519 switch (no_Magic(getchr())) | |
| 1520 { | |
| 1521 case '=': lop = MATCH; break; /* \@= */ | |
| 1522 case '!': lop = NOMATCH; break; /* \@! */ | |
| 1523 case '>': lop = SUBPAT; break; /* \@> */ | |
| 1524 case '<': switch (no_Magic(getchr())) | |
| 1525 { | |
| 1526 case '=': lop = BEHIND; break; /* \@<= */ | |
| 1527 case '!': lop = NOBEHIND; break; /* \@<! */ | |
| 1528 } | |
| 1529 } | |
| 1530 if (lop == END) | |
| 1531 EMSG_M_RET_NULL(_("E59: invalid character after %s@"), | |
| 1532 reg_magic == MAGIC_ALL); | |
| 1533 /* Look behind must match with behind_pos. */ | |
| 1534 if (lop == BEHIND || lop == NOBEHIND) | |
| 1535 { | |
| 1536 regtail(ret, regnode(BHPOS)); | |
| 1537 *flagp |= HASLOOKBH; | |
| 1538 } | |
| 1539 regtail(ret, regnode(END)); /* operand ends */ | |
| 1540 reginsert(lop, ret); | |
| 1541 break; | |
| 1542 } | |
| 1543 | |
| 1544 case Magic('?'): | |
| 1545 case Magic('='): | |
| 1546 /* Emit x= as (x|) */ | |
| 1547 reginsert(BRANCH, ret); /* Either x */ | |
| 1548 regtail(ret, regnode(BRANCH)); /* or */ | |
| 1549 next = regnode(NOTHING); /* null. */ | |
| 1550 regtail(ret, next); | |
| 1551 regoptail(ret, next); | |
| 1552 break; | |
| 1553 | |
| 1554 case Magic('{'): | |
| 1555 if (!read_limits(&minval, &maxval)) | |
| 1556 return NULL; | |
| 1557 if (flags & SIMPLE) | |
| 1558 { | |
| 1559 reginsert(BRACE_SIMPLE, ret); | |
| 1560 reginsert_limits(BRACE_LIMITS, minval, maxval, ret); | |
| 1561 } | |
| 1562 else | |
| 1563 { | |
| 1564 if (num_complex_braces >= 10) | |
| 1565 EMSG_M_RET_NULL(_("E60: Too many complex %s{...}s"), | |
| 1566 reg_magic == MAGIC_ALL); | |
| 1567 reginsert(BRACE_COMPLEX + num_complex_braces, ret); | |
| 1568 regoptail(ret, regnode(BACK)); | |
| 1569 regoptail(ret, ret); | |
| 1570 reginsert_limits(BRACE_LIMITS, minval, maxval, ret); | |
| 1571 ++num_complex_braces; | |
| 1572 } | |
| 1573 if (minval > 0 && maxval > 0) | |
| 1574 *flagp = (HASWIDTH | (flags & (HASNL | HASLOOKBH))); | |
| 1575 break; | |
| 1576 } | |
| 1577 if (re_multi_type(peekchr()) != NOT_MULTI) | |
| 1578 { | |
| 1579 /* Can't have a multi follow a multi. */ | |
| 1580 if (peekchr() == Magic('*')) | |
| 1581 sprintf((char *)IObuff, _("E61: Nested %s*"), | |
| 1582 reg_magic >= MAGIC_ON ? "" : "\\"); | |
| 1583 else | |
| 1584 sprintf((char *)IObuff, _("E62: Nested %s%c"), | |
| 1585 reg_magic == MAGIC_ALL ? "" : "\\", no_Magic(peekchr())); | |
| 1586 EMSG_RET_NULL(IObuff); | |
| 1587 } | |
| 1588 | |
| 1589 return ret; | |
| 1590 } | |
| 1591 | |
| 1592 /* | |
| 1593 * regatom - the lowest level | |
| 1594 * | |
| 1595 * Optimization: gobbles an entire sequence of ordinary characters so that | |
| 1596 * it can turn them into a single node, which is smaller to store and | |
| 1597 * faster to run. Don't do this when one_exactly is set. | |
| 1598 */ | |
| 1599 static char_u * | |
| 1600 regatom(flagp) | |
| 1601 int *flagp; | |
| 1602 { | |
| 1603 char_u *ret; | |
| 1604 int flags; | |
| 1605 int cpo_lit; /* 'cpoptions' contains 'l' flag */ | |
| 167 | 1606 int cpo_bsl; /* 'cpoptions' contains '\' flag */ |
| 7 | 1607 int c; |
| 1608 static char_u *classchars = (char_u *)".iIkKfFpPsSdDxXoOwWhHaAlLuU"; | |
| 1609 static int classcodes[] = {ANY, IDENT, SIDENT, KWORD, SKWORD, | |
| 1610 FNAME, SFNAME, PRINT, SPRINT, | |
| 1611 WHITE, NWHITE, DIGIT, NDIGIT, | |
| 1612 HEX, NHEX, OCTAL, NOCTAL, | |
| 1613 WORD, NWORD, HEAD, NHEAD, | |
| 1614 ALPHA, NALPHA, LOWER, NLOWER, | |
| 1615 UPPER, NUPPER | |
| 1616 }; | |
| 1617 char_u *p; | |
| 1618 int extra = 0; | |
| 1619 | |
| 1620 *flagp = WORST; /* Tentatively. */ | |
| 410 | 1621 cpo_lit = vim_strchr(p_cpo, CPO_LITERAL) != NULL; |
| 1622 cpo_bsl = vim_strchr(p_cpo, CPO_BACKSL) != NULL; | |
| 7 | 1623 |
| 1624 c = getchr(); | |
| 1625 switch (c) | |
| 1626 { | |
| 1627 case Magic('^'): | |
| 1628 ret = regnode(BOL); | |
| 1629 break; | |
| 1630 | |
| 1631 case Magic('$'): | |
| 1632 ret = regnode(EOL); | |
| 1633 #if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 1634 had_eol = TRUE; | |
| 1635 #endif | |
| 1636 break; | |
| 1637 | |
| 1638 case Magic('<'): | |
| 1639 ret = regnode(BOW); | |
| 1640 break; | |
| 1641 | |
| 1642 case Magic('>'): | |
| 1643 ret = regnode(EOW); | |
| 1644 break; | |
| 1645 | |
| 1646 case Magic('_'): | |
| 1647 c = no_Magic(getchr()); | |
| 1648 if (c == '^') /* "\_^" is start-of-line */ | |
| 1649 { | |
| 1650 ret = regnode(BOL); | |
| 1651 break; | |
| 1652 } | |
| 1653 if (c == '$') /* "\_$" is end-of-line */ | |
| 1654 { | |
| 1655 ret = regnode(EOL); | |
| 1656 #if defined(FEAT_SYN_HL) || defined(PROTO) | |
| 1657 had_eol = TRUE; | |
| 1658 #endif | |
| 1659 break; | |
| 1660 } | |
| 1661 | |
| 1662 extra = ADD_NL; | |
| 1663 *flagp |= HASNL; | |
| 1664 | |
| 1665 /* "\_[" is character range plus newline */ | |
| 1666 if (c == '[') | |
| 1667 goto collection; | |
| 1668 | |
| 1669 /* "\_x" is character class plus newline */ | |
| 1670 /*FALLTHROUGH*/ | |
| 1671 | |
| 1672 /* | |
| 1673 * Character classes. | |
| 1674 */ | |
| 1675 case Magic('.'): | |
| 1676 case Magic('i'): | |
| 1677 case Magic('I'): | |
| 1678 case Magic('k'): | |
| 1679 case Magic('K'): | |
| 1680 case Magic('f'): | |
| 1681 case Magic('F'): | |
| 1682 case Magic('p'): | |
| 1683 case Magic('P'): | |
| 1684 case Magic('s'): | |
| 1685 case Magic('S'): | |
| 1686 case Magic('d'): | |
| 1687 case Magic('D'): | |
| 1688 case Magic('x'): | |
| 1689 case Magic('X'): | |
| 1690 case Magic('o'): | |
| 1691 case Magic('O'): | |
| 1692 case Magic('w'): | |
| 1693 case Magic('W'): | |
| 1694 case Magic('h'): | |
| 1695 case Magic('H'): | |
| 1696 case Magic('a'): | |
| 1697 case Magic('A'): | |
| 1698 case Magic('l'): | |
| 1699 case Magic('L'): | |
| 1700 case Magic('u'): | |
| 1701 case Magic('U'): | |
| 1702 p = vim_strchr(classchars, no_Magic(c)); | |
| 1703 if (p == NULL) | |
| 1704 EMSG_RET_NULL(_("E63: invalid use of \\_")); | |
| 714 | 1705 #ifdef FEAT_MBYTE |
| 1706 /* When '.' is followed by a composing char ignore the dot, so that | |
| 1707 * the composing char is matched here. */ | |
| 1708 if (enc_utf8 && c == Magic('.') && utf_iscomposing(peekchr())) | |
| 1709 { | |
| 1710 c = getchr(); | |
| 1711 goto do_multibyte; | |
| 1712 } | |
| 1713 #endif | |
| 7 | 1714 ret = regnode(classcodes[p - classchars] + extra); |
| 1715 *flagp |= HASWIDTH | SIMPLE; | |
| 1716 break; | |
| 1717 | |
| 1718 case Magic('n'): | |
| 1719 if (reg_string) | |
| 1720 { | |
| 1721 /* In a string "\n" matches a newline character. */ | |
| 1722 ret = regnode(EXACTLY); | |
| 1723 regc(NL); | |
| 1724 regc(NUL); | |
| 1725 *flagp |= HASWIDTH | SIMPLE; | |
| 1726 } | |
| 1727 else | |
| 1728 { | |
| 1729 /* In buffer text "\n" matches the end of a line. */ | |
| 1730 ret = regnode(NEWL); | |
| 1731 *flagp |= HASWIDTH | HASNL; | |
| 1732 } | |
| 1733 break; | |
| 1734 | |
| 1735 case Magic('('): | |
| 1736 if (one_exactly) | |
| 1737 EMSG_ONE_RET_NULL; | |
| 1738 ret = reg(REG_PAREN, &flags); | |
| 1739 if (ret == NULL) | |
| 1740 return NULL; | |
| 1741 *flagp |= flags & (HASWIDTH | SPSTART | HASNL | HASLOOKBH); | |
| 1742 break; | |
| 1743 | |
| 1744 case NUL: | |
| 1745 case Magic('|'): | |
| 1746 case Magic('&'): | |
| 1747 case Magic(')'): | |
| 1468 | 1748 if (one_exactly) |
| 1749 EMSG_ONE_RET_NULL; | |
| 7 | 1750 EMSG_RET_NULL(_(e_internal)); /* Supposed to be caught earlier. */ |
| 1751 /* NOTREACHED */ | |
| 1752 | |
| 1753 case Magic('='): | |
| 1754 case Magic('?'): | |
| 1755 case Magic('+'): | |
| 1756 case Magic('@'): | |
| 1757 case Magic('{'): | |
| 1758 case Magic('*'): | |
| 1759 c = no_Magic(c); | |
| 1760 sprintf((char *)IObuff, _("E64: %s%c follows nothing"), | |
| 1761 (c == '*' ? reg_magic >= MAGIC_ON : reg_magic == MAGIC_ALL) | |
| 1762 ? "" : "\\", c); | |
| 1763 EMSG_RET_NULL(IObuff); | |
| 1764 /* NOTREACHED */ | |
| 1765 | |
| 1766 case Magic('~'): /* previous substitute pattern */ | |
| 359 | 1767 if (reg_prev_sub != NULL) |
| 7 | 1768 { |
| 1769 char_u *lp; | |
| 1770 | |
| 1771 ret = regnode(EXACTLY); | |
| 1772 lp = reg_prev_sub; | |
| 1773 while (*lp != NUL) | |
| 1774 regc(*lp++); | |
| 1775 regc(NUL); | |
| 1776 if (*reg_prev_sub != NUL) | |
| 1777 { | |
| 1778 *flagp |= HASWIDTH; | |
| 1779 if ((lp - reg_prev_sub) == 1) | |
| 1780 *flagp |= SIMPLE; | |
| 1781 } | |
| 1782 } | |
| 1783 else | |
| 1784 EMSG_RET_NULL(_(e_nopresub)); | |
| 1785 break; | |
| 1786 | |
| 1787 case Magic('1'): | |
| 1788 case Magic('2'): | |
| 1789 case Magic('3'): | |
| 1790 case Magic('4'): | |
| 1791 case Magic('5'): | |
| 1792 case Magic('6'): | |
| 1793 case Magic('7'): | |
| 1794 case Magic('8'): | |
| 1795 case Magic('9'): | |
| 1796 { | |
| 1797 int refnum; | |
| 1798 | |
| 1799 refnum = c - Magic('0'); | |
| 1800 /* | |
| 1801 * Check if the back reference is legal. We must have seen the | |
| 1802 * close brace. | |
| 1803 * TODO: Should also check that we don't refer to something | |
| 1804 * that is repeated (+*=): what instance of the repetition | |
| 1805 * should we match? | |
| 1806 */ | |
| 1807 if (!had_endbrace[refnum]) | |
| 1808 { | |
| 1809 /* Trick: check if "@<=" or "@<!" follows, in which case | |
| 1810 * the \1 can appear before the referenced match. */ | |
| 1811 for (p = regparse; *p != NUL; ++p) | |
| 1812 if (p[0] == '@' && p[1] == '<' | |
| 1813 && (p[2] == '!' || p[2] == '=')) | |
| 1814 break; | |
| 1815 if (*p == NUL) | |
| 1816 EMSG_RET_NULL(_("E65: Illegal back reference")); | |
| 1817 } | |
| 1818 ret = regnode(BACKREF + refnum); | |
| 1819 } | |
| 1820 break; | |
| 1821 | |
| 1822 case Magic('z'): | |
| 1823 { | |
| 1824 c = no_Magic(getchr()); | |
| 1825 switch (c) | |
| 1826 { | |
| 741 | 1827 #ifdef FEAT_SYN_HL |
| 7 | 1828 case '(': if (reg_do_extmatch != REX_SET) |
| 1829 EMSG_RET_NULL(_("E66: \\z( not allowed here")); | |
| 1830 if (one_exactly) | |
| 1831 EMSG_ONE_RET_NULL; | |
| 1832 ret = reg(REG_ZPAREN, &flags); | |
| 1833 if (ret == NULL) | |
| 1834 return NULL; | |
| 1835 *flagp |= flags & (HASWIDTH|SPSTART|HASNL|HASLOOKBH); | |
| 1836 re_has_z = REX_SET; | |
| 1837 break; | |
| 1838 | |
| 1839 case '1': | |
| 1840 case '2': | |
| 1841 case '3': | |
| 1842 case '4': | |
| 1843 case '5': | |
| 1844 case '6': | |
| 1845 case '7': | |
| 1846 case '8': | |
| 1847 case '9': if (reg_do_extmatch != REX_USE) | |
| 1848 EMSG_RET_NULL(_("E67: \\z1 et al. not allowed here")); | |
| 1849 ret = regnode(ZREF + c - '0'); | |
| 1850 re_has_z = REX_USE; | |
| 1851 break; | |
| 741 | 1852 #endif |
| 7 | 1853 |
| 1854 case 's': ret = regnode(MOPEN + 0); | |
| 1855 break; | |
| 1856 | |
| 1857 case 'e': ret = regnode(MCLOSE + 0); | |
| 1858 break; | |
| 1859 | |
| 1860 default: EMSG_RET_NULL(_("E68: Invalid character after \\z")); | |
| 1861 } | |
| 1862 } | |
| 1863 break; | |
| 1864 | |
| 1865 case Magic('%'): | |
| 1866 { | |
| 1867 c = no_Magic(getchr()); | |
| 1868 switch (c) | |
| 1869 { | |
| 1870 /* () without a back reference */ | |
| 1871 case '(': | |
| 1872 if (one_exactly) | |
| 1873 EMSG_ONE_RET_NULL; | |
| 1874 ret = reg(REG_NPAREN, &flags); | |
| 1875 if (ret == NULL) | |
| 1876 return NULL; | |
| 1877 *flagp |= flags & (HASWIDTH | SPSTART | HASNL | HASLOOKBH); | |
| 1878 break; | |
| 1879 | |
| 1880 /* Catch \%^ and \%$ regardless of where they appear in the | |
| 1881 * pattern -- regardless of whether or not it makes sense. */ | |
| 1882 case '^': | |
| 1883 ret = regnode(RE_BOF); | |
| 1884 break; | |
| 1885 | |
| 1886 case '$': | |
| 1887 ret = regnode(RE_EOF); | |
| 1888 break; | |
| 1889 | |
| 1890 case '#': | |
| 1891 ret = regnode(CURSOR); | |
| 1892 break; | |
| 1893 | |
| 639 | 1894 case 'V': |
| 1895 ret = regnode(RE_VISUAL); | |
| 1896 break; | |
| 1897 | |
| 7 | 1898 /* \%[abc]: Emit as a list of branches, all ending at the last |
| 1899 * branch which matches nothing. */ | |
| 1900 case '[': | |
| 1901 if (one_exactly) /* doesn't nest */ | |
| 1902 EMSG_ONE_RET_NULL; | |
| 1903 { | |
| 1904 char_u *lastbranch; | |
| 1905 char_u *lastnode = NULL; | |
| 1906 char_u *br; | |
| 1907 | |
| 1908 ret = NULL; | |
| 1909 while ((c = getchr()) != ']') | |
| 1910 { | |
| 1911 if (c == NUL) | |
| 1912 EMSG_M_RET_NULL(_("E69: Missing ] after %s%%["), | |
| 1913 reg_magic == MAGIC_ALL); | |
| 1914 br = regnode(BRANCH); | |
| 1915 if (ret == NULL) | |
| 1916 ret = br; | |
| 1917 else | |
| 1918 regtail(lastnode, br); | |
| 1919 | |
| 1920 ungetchr(); | |
| 1921 one_exactly = TRUE; | |
| 1922 lastnode = regatom(flagp); | |
| 1923 one_exactly = FALSE; | |
| 1924 if (lastnode == NULL) | |
| 1925 return NULL; | |
| 1926 } | |
| 1927 if (ret == NULL) | |
| 1928 EMSG_M_RET_NULL(_("E70: Empty %s%%[]"), | |
| 1929 reg_magic == MAGIC_ALL); | |
| 1930 lastbranch = regnode(BRANCH); | |
| 1931 br = regnode(NOTHING); | |
| 1932 if (ret != JUST_CALC_SIZE) | |
| 1933 { | |
| 1934 regtail(lastnode, br); | |
| 1935 regtail(lastbranch, br); | |
| 1936 /* connect all branches to the NOTHING | |
| 1937 * branch at the end */ | |
| 1938 for (br = ret; br != lastnode; ) | |
| 1939 { | |
| 1940 if (OP(br) == BRANCH) | |
| 1941 { | |
| 1942 regtail(br, lastbranch); | |
| 1943 br = OPERAND(br); | |
| 1944 } | |
| 1945 else | |
| 1946 br = regnext(br); | |
| 1947 } | |
| 1948 } | |
| 1701 | 1949 *flagp &= ~(HASWIDTH | SIMPLE); |
| 7 | 1950 break; |
| 1951 } | |
| 1952 | |
| 24 | 1953 case 'd': /* %d123 decimal */ |
| 1954 case 'o': /* %o123 octal */ | |
| 1955 case 'x': /* %xab hex 2 */ | |
| 1956 case 'u': /* %uabcd hex 4 */ | |
| 1957 case 'U': /* %U1234abcd hex 8 */ | |
| 1958 { | |
| 1959 int i; | |
| 1960 | |
| 1961 switch (c) | |
| 1962 { | |
| 1963 case 'd': i = getdecchrs(); break; | |
| 1964 case 'o': i = getoctchrs(); break; | |
| 1965 case 'x': i = gethexchrs(2); break; | |
| 1966 case 'u': i = gethexchrs(4); break; | |
| 1967 case 'U': i = gethexchrs(8); break; | |
| 1968 default: i = -1; break; | |
| 1969 } | |
| 1970 | |
| 1971 if (i < 0) | |
| 856 | 1972 EMSG_M_RET_NULL( |
| 24 | 1973 _("E678: Invalid character after %s%%[dxouU]"), |
| 1974 reg_magic == MAGIC_ALL); | |
| 714 | 1975 #ifdef FEAT_MBYTE |
| 1976 if (use_multibytecode(i)) | |
| 1977 ret = regnode(MULTIBYTECODE); | |
| 1978 else | |
| 1979 #endif | |
| 1980 ret = regnode(EXACTLY); | |
| 24 | 1981 if (i == 0) |
| 1982 regc(0x0a); | |
| 1983 else | |
| 1984 #ifdef FEAT_MBYTE | |
| 1985 regmbc(i); | |
| 1986 #else | |
| 1987 regc(i); | |
| 1988 #endif | |
| 1989 regc(NUL); | |
| 1990 *flagp |= HASWIDTH; | |
| 1991 break; | |
| 1992 } | |
| 1993 | |
| 7 | 1994 default: |
| 639 | 1995 if (VIM_ISDIGIT(c) || c == '<' || c == '>' |
| 1996 || c == '\'') | |
| 7 | 1997 { |
| 1998 long_u n = 0; | |
| 1999 int cmp; | |
| 2000 | |
| 2001 cmp = c; | |
| 2002 if (cmp == '<' || cmp == '>') | |
| 2003 c = getchr(); | |
| 2004 while (VIM_ISDIGIT(c)) | |
| 2005 { | |
| 2006 n = n * 10 + (c - '0'); | |
| 2007 c = getchr(); | |
| 2008 } | |
| 639 | 2009 if (c == '\'' && n == 0) |
| 2010 { | |
| 2011 /* "\%'m", "\%<'m" and "\%>'m": Mark */ | |
| 2012 c = getchr(); | |
| 2013 ret = regnode(RE_MARK); | |
| 2014 if (ret == JUST_CALC_SIZE) | |
| 2015 regsize += 2; | |
| 2016 else | |
| 2017 { | |
| 2018 *regcode++ = c; | |
| 2019 *regcode++ = cmp; | |
| 2020 } | |
| 2021 break; | |
| 2022 } | |
| 2023 else if (c == 'l' || c == 'c' || c == 'v') | |
| 7 | 2024 { |
| 2025 if (c == 'l') | |
| 2026 ret = regnode(RE_LNUM); | |
| 2027 else if (c == 'c') | |
| 2028 ret = regnode(RE_COL); | |
| 2029 else | |
| 2030 ret = regnode(RE_VCOL); | |
| 2031 if (ret == JUST_CALC_SIZE) | |
| 2032 regsize += 5; | |
| 2033 else | |
| 2034 { | |
| 2035 /* put the number and the optional | |
| 2036 * comparator after the opcode */ | |
| 2037 regcode = re_put_long(regcode, n); | |
| 2038 *regcode++ = cmp; | |
| 2039 } | |
| 2040 break; | |
| 2041 } | |
| 2042 } | |
| 2043 | |
| 2044 EMSG_M_RET_NULL(_("E71: Invalid character after %s%%"), | |
| 2045 reg_magic == MAGIC_ALL); | |
| 2046 } | |
| 2047 } | |
| 2048 break; | |
| 2049 | |
| 2050 case Magic('['): | |
| 2051 collection: | |
| 2052 { | |
| 2053 char_u *lp; | |
| 2054 | |
| 2055 /* | |
| 2056 * If there is no matching ']', we assume the '[' is a normal | |
| 2057 * character. This makes 'incsearch' and ":help [" work. | |
| 2058 */ | |
| 2059 lp = skip_anyof(regparse); | |
| 2060 if (*lp == ']') /* there is a matching ']' */ | |
| 2061 { | |
| 2062 int startc = -1; /* > 0 when next '-' is a range */ | |
| 2063 int endc; | |
| 2064 | |
| 2065 /* | |
| 2066 * In a character class, different parsing rules apply. | |
| 2067 * Not even \ is special anymore, nothing is. | |
| 2068 */ | |
| 2069 if (*regparse == '^') /* Complement of range. */ | |
| 2070 { | |
| 2071 ret = regnode(ANYBUT + extra); | |
| 2072 regparse++; | |
| 2073 } | |
| 2074 else | |
| 2075 ret = regnode(ANYOF + extra); | |
| 2076 | |
| 2077 /* At the start ']' and '-' mean the literal character. */ | |
| 2078 if (*regparse == ']' || *regparse == '-') | |
| 167 | 2079 { |
| 2080 startc = *regparse; | |
| 7 | 2081 regc(*regparse++); |
| 167 | 2082 } |
| 7 | 2083 |
| 2084 while (*regparse != NUL && *regparse != ']') | |
| 2085 { | |
| 2086 if (*regparse == '-') | |
| 2087 { | |
| 2088 ++regparse; | |
| 2089 /* The '-' is not used for a range at the end and | |
| 2090 * after or before a '\n'. */ | |
| 2091 if (*regparse == ']' || *regparse == NUL | |
| 2092 || startc == -1 | |
| 2093 || (regparse[0] == '\\' && regparse[1] == 'n')) | |
| 2094 { | |
| 2095 regc('-'); | |
| 2096 startc = '-'; /* [--x] is a range */ | |
| 2097 } | |
| 2098 else | |
| 2099 { | |
| 167 | 2100 /* Also accept "a-[.z.]" */ |
| 2101 endc = 0; | |
| 2102 if (*regparse == '[') | |
| 2103 endc = get_coll_element(®parse); | |
| 2104 if (endc == 0) | |
| 2105 { | |
| 7 | 2106 #ifdef FEAT_MBYTE |
| 167 | 2107 if (has_mbyte) |
| 2108 endc = mb_ptr2char_adv(®parse); | |
| 2109 else | |
| 7 | 2110 #endif |
| 167 | 2111 endc = *regparse++; |
| 2112 } | |
| 24 | 2113 |
| 2114 /* Handle \o40, \x20 and \u20AC style sequences */ | |
| 167 | 2115 if (endc == '\\' && !cpo_lit && !cpo_bsl) |
| 24 | 2116 endc = coll_get_char(); |
| 2117 | |
| 7 | 2118 if (startc > endc) |
| 2119 EMSG_RET_NULL(_(e_invrange)); | |
| 2120 #ifdef FEAT_MBYTE | |
| 2121 if (has_mbyte && ((*mb_char2len)(startc) > 1 | |
| 2122 || (*mb_char2len)(endc) > 1)) | |
| 2123 { | |
| 2124 /* Limit to a range of 256 chars */ | |
| 2125 if (endc > startc + 256) | |
| 2126 EMSG_RET_NULL(_(e_invrange)); | |
| 2127 while (++startc <= endc) | |
| 2128 regmbc(startc); | |
| 2129 } | |
| 2130 else | |
| 2131 #endif | |
| 2132 { | |
| 2133 #ifdef EBCDIC | |
| 2134 int alpha_only = FALSE; | |
| 2135 | |
| 2136 /* for alphabetical range skip the gaps | |
| 2137 * 'i'-'j', 'r'-'s', 'I'-'J' and 'R'-'S'. */ | |
| 2138 if (isalpha(startc) && isalpha(endc)) | |
| 2139 alpha_only = TRUE; | |
| 2140 #endif | |
| 2141 while (++startc <= endc) | |
| 2142 #ifdef EBCDIC | |
| 2143 if (!alpha_only || isalpha(startc)) | |
| 2144 #endif | |
| 2145 regc(startc); | |
| 2146 } | |
| 2147 startc = -1; | |
| 2148 } | |
| 2149 } | |
| 2150 /* | |
| 2151 * Only "\]", "\^", "\]" and "\\" are special in Vi. Vim | |
| 2152 * accepts "\t", "\e", etc., but only when the 'l' flag in | |
| 2153 * 'cpoptions' is not included. | |
| 167 | 2154 * Posix doesn't recognize backslash at all. |
| 7 | 2155 */ |
| 2156 else if (*regparse == '\\' | |
| 167 | 2157 && !cpo_bsl |
| 7 | 2158 && (vim_strchr(REGEXP_INRANGE, regparse[1]) != NULL |
| 2159 || (!cpo_lit | |
| 2160 && vim_strchr(REGEXP_ABBR, | |
| 2161 regparse[1]) != NULL))) | |
| 2162 { | |
| 2163 regparse++; | |
| 2164 if (*regparse == 'n') | |
| 2165 { | |
| 2166 /* '\n' in range: also match NL */ | |
| 2167 if (ret != JUST_CALC_SIZE) | |
| 2168 { | |
| 2169 if (*ret == ANYBUT) | |
| 2170 *ret = ANYBUT + ADD_NL; | |
| 2171 else if (*ret == ANYOF) | |
| 2172 *ret = ANYOF + ADD_NL; | |
| 2173 /* else: must have had a \n already */ | |
| 2174 } | |
| 2175 *flagp |= HASNL; | |
| 2176 regparse++; | |
| 2177 startc = -1; | |
| 2178 } | |
| 24 | 2179 else if (*regparse == 'd' |
| 2180 || *regparse == 'o' | |
| 2181 || *regparse == 'x' | |
| 2182 || *regparse == 'u' | |
| 2183 || *regparse == 'U') | |
| 2184 { | |
| 2185 startc = coll_get_char(); | |
| 2186 if (startc == 0) | |
| 2187 regc(0x0a); | |
| 2188 else | |
| 2189 #ifdef FEAT_MBYTE | |
| 2190 regmbc(startc); | |
| 2191 #else | |
| 2192 regc(startc); | |
| 2193 #endif | |
| 2194 } | |
| 7 | 2195 else |
| 2196 { | |
| 2197 startc = backslash_trans(*regparse++); | |
| 2198 regc(startc); | |
| 2199 } | |
| 2200 } | |
| 2201 else if (*regparse == '[') | |
| 2202 { | |
| 2203 int c_class; | |
| 2204 int cu; | |
| 2205 | |
| 167 | 2206 c_class = get_char_class(®parse); |
| 7 | 2207 startc = -1; |
| 2208 /* Characters assumed to be 8 bits! */ | |
| 2209 switch (c_class) | |
| 2210 { | |
| 2211 case CLASS_NONE: | |
| 167 | 2212 c_class = get_equi_class(®parse); |
| 2213 if (c_class != 0) | |
| 2214 { | |
| 2215 /* produce equivalence class */ | |
| 2216 reg_equi_class(c_class); | |
| 2217 } | |
| 2218 else if ((c_class = | |
| 2219 get_coll_element(®parse)) != 0) | |
| 2220 { | |
| 2221 /* produce a collating element */ | |
| 2222 regmbc(c_class); | |
| 2223 } | |
| 2224 else | |
| 2225 { | |
| 2226 /* literal '[', allow [[-x] as a range */ | |
| 2227 startc = *regparse++; | |
| 2228 regc(startc); | |
| 2229 } | |
| 7 | 2230 break; |
| 2231 case CLASS_ALNUM: | |
| 2232 for (cu = 1; cu <= 255; cu++) | |
| 2233 if (isalnum(cu)) | |
| 2234 regc(cu); | |
| 2235 break; | |
| 2236 case CLASS_ALPHA: | |
| 2237 for (cu = 1; cu <= 255; cu++) | |
| 2238 if (isalpha(cu)) | |
| 2239 regc(cu); | |
| 2240 break; | |
| 2241 case CLASS_BLANK: | |
| 2242 regc(' '); | |
| 2243 regc('\t'); | |
| 2244 break; | |
| 2245 case CLASS_CNTRL: | |
| 2246 for (cu = 1; cu <= 255; cu++) | |
| 2247 if (iscntrl(cu)) | |
| 2248 regc(cu); | |
| 2249 break; | |
| 2250 case CLASS_DIGIT: | |
| 2251 for (cu = 1; cu <= 255; cu++) | |
| 2252 if (VIM_ISDIGIT(cu)) | |
| 2253 regc(cu); | |
| 2254 break; | |
| 2255 case CLASS_GRAPH: | |
| 2256 for (cu = 1; cu <= 255; cu++) | |
| 2257 if (isgraph(cu)) | |
| 2258 regc(cu); | |
| 2259 break; | |
| 2260 case CLASS_LOWER: | |
| 2261 for (cu = 1; cu <= 255; cu++) | |
| 1347 | 2262 if (MB_ISLOWER(cu)) |
| 7 | 2263 regc(cu); |
| 2264 break; | |
| 2265 case CLASS_PRINT: | |
| 2266 for (cu = 1; cu <= 255; cu++) | |
| 2267 if (vim_isprintc(cu)) | |
| 2268 regc(cu); | |
| 2269 break; | |
| 2270 case CLASS_PUNCT: | |
| 2271 for (cu = 1; cu <= 255; cu++) | |
| 2272 if (ispunct(cu)) | |
| 2273 regc(cu); | |
| 2274 break; | |
| 2275 case CLASS_SPACE: | |
| 2276 for (cu = 9; cu <= 13; cu++) | |
| 2277 regc(cu); | |
| 2278 regc(' '); | |
| 2279 break; | |
| 2280 case CLASS_UPPER: | |
| 2281 for (cu = 1; cu <= 255; cu++) | |
| 1347 | 2282 if (MB_ISUPPER(cu)) |
| 7 | 2283 regc(cu); |
| 2284 break; | |
| 2285 case CLASS_XDIGIT: | |
| 2286 for (cu = 1; cu <= 255; cu++) | |
| 2287 if (vim_isxdigit(cu)) | |
| 2288 regc(cu); | |
| 2289 break; | |
| 2290 case CLASS_TAB: | |
| 2291 regc('\t'); | |
| 2292 break; | |
| 2293 case CLASS_RETURN: | |
| 2294 regc('\r'); | |
| 2295 break; | |
| 2296 case CLASS_BACKSPACE: | |
| 2297 regc('\b'); | |
| 2298 break; | |
| 2299 case CLASS_ESCAPE: | |
| 2300 regc('\033'); | |
| 2301 break; | |
| 2302 } | |
| 2303 } | |
| 2304 else | |
| 2305 { | |
| 2306 #ifdef FEAT_MBYTE | |
| 2307 if (has_mbyte) | |
| 2308 { | |
| 2309 int len; | |
| 2310 | |
| 2311 /* produce a multibyte character, including any | |
| 2312 * following composing characters */ | |
| 2313 startc = mb_ptr2char(regparse); | |
| 474 | 2314 len = (*mb_ptr2len)(regparse); |
| 7 | 2315 if (enc_utf8 && utf_char2len(startc) != len) |
| 2316 startc = -1; /* composing chars */ | |
| 2317 while (--len >= 0) | |
| 2318 regc(*regparse++); | |
| 2319 } | |
| 2320 else | |
| 2321 #endif | |
| 2322 { | |
| 2323 startc = *regparse++; | |
| 2324 regc(startc); | |
| 2325 } | |
| 2326 } | |
| 2327 } | |
| 2328 regc(NUL); | |
| 2329 prevchr_len = 1; /* last char was the ']' */ | |
| 2330 if (*regparse != ']') | |
| 2331 EMSG_RET_NULL(_(e_toomsbra)); /* Cannot happen? */ | |
| 2332 skipchr(); /* let's be friends with the lexer again */ | |
| 2333 *flagp |= HASWIDTH | SIMPLE; | |
| 2334 break; | |
| 2335 } | |
| 481 | 2336 else if (reg_strict) |
| 2337 EMSG_M_RET_NULL(_("E769: Missing ] after %s["), | |
| 2338 reg_magic > MAGIC_OFF); | |
| 7 | 2339 } |
| 2340 /* FALLTHROUGH */ | |
| 2341 | |
| 2342 default: | |
| 2343 { | |
| 2344 int len; | |
| 2345 | |
| 2346 #ifdef FEAT_MBYTE | |
| 2347 /* A multi-byte character is handled as a separate atom if it's | |
| 714 | 2348 * before a multi and when it's a composing char. */ |
| 2349 if (use_multibytecode(c)) | |
| 7 | 2350 { |
| 714 | 2351 do_multibyte: |
| 7 | 2352 ret = regnode(MULTIBYTECODE); |
| 2353 regmbc(c); | |
| 2354 *flagp |= HASWIDTH | SIMPLE; | |
| 2355 break; | |
| 2356 } | |
| 2357 #endif | |
| 2358 | |
| 2359 ret = regnode(EXACTLY); | |
| 2360 | |
| 2361 /* | |
| 2362 * Append characters as long as: | |
| 2363 * - there is no following multi, we then need the character in | |
| 2364 * front of it as a single character operand | |
| 2365 * - not running into a Magic character | |
| 2366 * - "one_exactly" is not set | |
| 2367 * But always emit at least one character. Might be a Multi, | |
| 2368 * e.g., a "[" without matching "]". | |
| 2369 */ | |
| 2370 for (len = 0; c != NUL && (len == 0 | |
| 2371 || (re_multi_type(peekchr()) == NOT_MULTI | |
| 2372 && !one_exactly | |
| 2373 && !is_Magic(c))); ++len) | |
| 2374 { | |
| 2375 c = no_Magic(c); | |
| 2376 #ifdef FEAT_MBYTE | |
| 2377 if (has_mbyte) | |
| 2378 { | |
| 2379 regmbc(c); | |
| 2380 if (enc_utf8) | |
| 2381 { | |
| 2382 int l; | |
| 2383 | |
| 714 | 2384 /* Need to get composing character too. */ |
| 7 | 2385 for (;;) |
| 2386 { | |
| 714 | 2387 l = utf_ptr2len(regparse); |
| 2388 if (!UTF_COMPOSINGLIKE(regparse, regparse + l)) | |
| 7 | 2389 break; |
| 714 | 2390 regmbc(utf_ptr2char(regparse)); |
| 2391 skipchr(); | |
| 7 | 2392 } |
| 2393 } | |
| 2394 } | |
| 2395 else | |
| 2396 #endif | |
| 2397 regc(c); | |
| 2398 c = getchr(); | |
| 2399 } | |
| 2400 ungetchr(); | |
| 2401 | |
| 2402 regc(NUL); | |
| 2403 *flagp |= HASWIDTH; | |
| 2404 if (len == 1) | |
| 2405 *flagp |= SIMPLE; | |
| 2406 } | |
| 2407 break; | |
| 2408 } | |
| 2409 | |
| 2410 return ret; | |
| 2411 } | |
| 2412 | |
| 714 | 2413 #ifdef FEAT_MBYTE |
| 2414 /* | |
| 2415 * Return TRUE if MULTIBYTECODE should be used instead of EXACTLY for | |
| 2416 * character "c". | |
| 2417 */ | |
| 2418 static int | |
| 2419 use_multibytecode(c) | |
| 2420 int c; | |
| 2421 { | |
| 2422 return has_mbyte && (*mb_char2len)(c) > 1 | |
| 2423 && (re_multi_type(peekchr()) != NOT_MULTI | |
| 2424 || (enc_utf8 && utf_iscomposing(c))); | |
| 2425 } | |
| 2426 #endif | |
| 2427 | |
| 7 | 2428 /* |
| 2429 * emit a node | |
| 2430 * Return pointer to generated code. | |
| 2431 */ | |
| 2432 static char_u * | |
| 2433 regnode(op) | |
| 2434 int op; | |
| 2435 { | |
| 2436 char_u *ret; | |
| 2437 | |
| 2438 ret = regcode; | |
| 2439 if (ret == JUST_CALC_SIZE) | |
| 2440 regsize += 3; | |
| 2441 else | |
| 2442 { | |
| 2443 *regcode++ = op; | |
| 2444 *regcode++ = NUL; /* Null "next" pointer. */ | |
| 2445 *regcode++ = NUL; | |
| 2446 } | |
| 2447 return ret; | |
| 2448 } | |
| 2449 | |
| 2450 /* | |
| 2451 * Emit (if appropriate) a byte of code | |
| 2452 */ | |
| 2453 static void | |
| 2454 regc(b) | |
| 2455 int b; | |
| 2456 { | |
| 2457 if (regcode == JUST_CALC_SIZE) | |
| 2458 regsize++; | |
| 2459 else | |
| 2460 *regcode++ = b; | |
| 2461 } | |
| 2462 | |
| 2463 #ifdef FEAT_MBYTE | |
| 2464 /* | |
| 2465 * Emit (if appropriate) a multi-byte character of code | |
| 2466 */ | |
| 2467 static void | |
| 2468 regmbc(c) | |
| 2469 int c; | |
| 2470 { | |
| 2471 if (regcode == JUST_CALC_SIZE) | |
| 2472 regsize += (*mb_char2len)(c); | |
| 2473 else | |
| 2474 regcode += (*mb_char2bytes)(c, regcode); | |
| 2475 } | |
| 2476 #endif | |
| 2477 | |
| 2478 /* | |
| 2479 * reginsert - insert an operator in front of already-emitted operand | |
| 2480 * | |
| 2481 * Means relocating the operand. | |
| 2482 */ | |
| 2483 static void | |
| 2484 reginsert(op, opnd) | |
| 2485 int op; | |
| 2486 char_u *opnd; | |
| 2487 { | |
| 2488 char_u *src; | |
| 2489 char_u *dst; | |
| 2490 char_u *place; | |
| 2491 | |
| 2492 if (regcode == JUST_CALC_SIZE) | |
| 2493 { | |
| 2494 regsize += 3; | |
| 2495 return; | |
| 2496 } | |
| 2497 src = regcode; | |
| 2498 regcode += 3; | |
| 2499 dst = regcode; | |
| 2500 while (src > opnd) | |
| 2501 *--dst = *--src; | |
| 2502 | |
| 2503 place = opnd; /* Op node, where operand used to be. */ | |
| 2504 *place++ = op; | |
| 2505 *place++ = NUL; | |
| 2506 *place = NUL; | |
| 2507 } | |
| 2508 | |
| 2509 /* | |
| 2510 * reginsert_limits - insert an operator in front of already-emitted operand. | |
| 2511 * The operator has the given limit values as operands. Also set next pointer. | |
| 2512 * | |
| 2513 * Means relocating the operand. | |
| 2514 */ | |
| 2515 static void | |
| 2516 reginsert_limits(op, minval, maxval, opnd) | |
| 2517 int op; | |
| 2518 long minval; | |
| 2519 long maxval; | |
| 2520 char_u *opnd; | |
| 2521 { | |
| 2522 char_u *src; | |
| 2523 char_u *dst; | |
| 2524 char_u *place; | |
| 2525 | |
| 2526 if (regcode == JUST_CALC_SIZE) | |
| 2527 { | |
| 2528 regsize += 11; | |
| 2529 return; | |
| 2530 } | |
| 2531 src = regcode; | |
| 2532 regcode += 11; | |
| 2533 dst = regcode; | |
| 2534 while (src > opnd) | |
| 2535 *--dst = *--src; | |
| 2536 | |
| 2537 place = opnd; /* Op node, where operand used to be. */ | |
| 2538 *place++ = op; | |
| 2539 *place++ = NUL; | |
| 2540 *place++ = NUL; | |
| 2541 place = re_put_long(place, (long_u)minval); | |
| 2542 place = re_put_long(place, (long_u)maxval); | |
| 2543 regtail(opnd, place); | |
| 2544 } | |
| 2545 | |
| 2546 /* | |
| 2547 * Write a long as four bytes at "p" and return pointer to the next char. | |
| 2548 */ | |
| 2549 static char_u * | |
| 2550 re_put_long(p, val) | |
| 2551 char_u *p; | |
| 2552 long_u val; | |
| 2553 { | |
| 2554 *p++ = (char_u) ((val >> 24) & 0377); | |
| 2555 *p++ = (char_u) ((val >> 16) & 0377); | |
| 2556 *p++ = (char_u) ((val >> 8) & 0377); | |
| 2557 *p++ = (char_u) (val & 0377); | |
| 2558 return p; | |
| 2559 } | |
| 2560 | |
| 2561 /* | |
| 2562 * regtail - set the next-pointer at the end of a node chain | |
| 2563 */ | |
| 2564 static void | |
| 2565 regtail(p, val) | |
| 2566 char_u *p; | |
| 2567 char_u *val; | |
| 2568 { | |
| 2569 char_u *scan; | |
| 2570 char_u *temp; | |
| 2571 int offset; | |
| 2572 | |
| 2573 if (p == JUST_CALC_SIZE) | |
| 2574 return; | |
| 2575 | |
| 2576 /* Find last node. */ | |
| 2577 scan = p; | |
| 2578 for (;;) | |
| 2579 { | |
| 2580 temp = regnext(scan); | |
| 2581 if (temp == NULL) | |
| 2582 break; | |
| 2583 scan = temp; | |
| 2584 } | |
| 2585 | |
| 233 | 2586 if (OP(scan) == BACK) |
| 7 | 2587 offset = (int)(scan - val); |
| 2588 else | |
| 2589 offset = (int)(val - scan); | |
| 2010 | 2590 /* When the offset uses more than 16 bits it can no longer fit in the two |
| 2591 * bytes avaliable. Use a global flag to avoid having to check return | |
| 2592 * values in too many places. */ | |
| 2593 if (offset > 0xffff) | |
| 2594 reg_toolong = TRUE; | |
| 2595 else | |
| 2596 { | |
| 2597 *(scan + 1) = (char_u) (((unsigned)offset >> 8) & 0377); | |
| 2598 *(scan + 2) = (char_u) (offset & 0377); | |
| 2599 } | |
| 7 | 2600 } |
| 2601 | |
| 2602 /* | |
| 2603 * regoptail - regtail on item after a BRANCH; nop if none | |
| 2604 */ | |
| 2605 static void | |
| 2606 regoptail(p, val) | |
| 2607 char_u *p; | |
| 2608 char_u *val; | |
| 2609 { | |
| 2610 /* When op is neither BRANCH nor BRACE_COMPLEX0-9, it is "operandless" */ | |
| 2611 if (p == NULL || p == JUST_CALC_SIZE | |
| 2612 || (OP(p) != BRANCH | |
| 2613 && (OP(p) < BRACE_COMPLEX || OP(p) > BRACE_COMPLEX + 9))) | |
| 2614 return; | |
| 2615 regtail(OPERAND(p), val); | |
| 2616 } | |
| 2617 | |
| 2618 /* | |
| 2619 * getchr() - get the next character from the pattern. We know about | |
| 2620 * magic and such, so therefore we need a lexical analyzer. | |
| 2621 */ | |
| 2622 | |
| 2623 /* static int curchr; */ | |
| 2624 static int prevprevchr; | |
| 2625 static int prevchr; | |
| 2626 static int nextchr; /* used for ungetchr() */ | |
| 2627 /* | |
| 2628 * Note: prevchr is sometimes -1 when we are not at the start, | |
| 2629 * eg in /[ ^I]^ the pattern was never found even if it existed, because ^ was | |
| 2630 * taken to be magic -- webb | |
| 2631 */ | |
| 2632 static int at_start; /* True when on the first character */ | |
| 2633 static int prev_at_start; /* True when on the second character */ | |
| 2634 | |
| 2635 static void | |
| 2636 initchr(str) | |
| 2637 char_u *str; | |
| 2638 { | |
| 2639 regparse = str; | |
| 2640 prevchr_len = 0; | |
| 2641 curchr = prevprevchr = prevchr = nextchr = -1; | |
| 2642 at_start = TRUE; | |
| 2643 prev_at_start = FALSE; | |
| 2644 } | |
| 2645 | |
| 2646 static int | |
| 2647 peekchr() | |
| 2648 { | |
| 167 | 2649 static int after_slash = FALSE; |
| 2650 | |
| 7 | 2651 if (curchr == -1) |
| 2652 { | |
| 2653 switch (curchr = regparse[0]) | |
| 2654 { | |
| 2655 case '.': | |
| 2656 case '[': | |
| 2657 case '~': | |
| 2658 /* magic when 'magic' is on */ | |
| 2659 if (reg_magic >= MAGIC_ON) | |
| 2660 curchr = Magic(curchr); | |
| 2661 break; | |
| 2662 case '(': | |
| 2663 case ')': | |
| 2664 case '{': | |
| 2665 case '%': | |
| 2666 case '+': | |
| 2667 case '=': | |
| 2668 case '?': | |
| 2669 case '@': | |
| 2670 case '!': | |
| 2671 case '&': | |
| 2672 case '|': | |
| 2673 case '<': | |
| 2674 case '>': | |
| 2675 case '#': /* future ext. */ | |
| 2676 case '"': /* future ext. */ | |
| 2677 case '\'': /* future ext. */ | |
| 2678 case ',': /* future ext. */ | |
| 2679 case '-': /* future ext. */ | |
| 2680 case ':': /* future ext. */ | |
| 2681 case ';': /* future ext. */ | |
| 2682 case '`': /* future ext. */ | |
| 2683 case '/': /* Can't be used in / command */ | |
| 2684 /* magic only after "\v" */ | |
| 2685 if (reg_magic == MAGIC_ALL) | |
| 2686 curchr = Magic(curchr); | |
| 2687 break; | |
| 2688 case '*': | |
| 167 | 2689 /* * is not magic as the very first character, eg "?*ptr", when |
| 2690 * after '^', eg "/^*ptr" and when after "\(", "\|", "\&". But | |
| 2691 * "\(\*" is not magic, thus must be magic if "after_slash" */ | |
| 2692 if (reg_magic >= MAGIC_ON | |
| 2693 && !at_start | |
| 2694 && !(prev_at_start && prevchr == Magic('^')) | |
| 2695 && (after_slash | |
| 2696 || (prevchr != Magic('(') | |
| 2697 && prevchr != Magic('&') | |
| 2698 && prevchr != Magic('|')))) | |
| 7 | 2699 curchr = Magic('*'); |
| 2700 break; | |
| 2701 case '^': | |
| 2702 /* '^' is only magic as the very first character and if it's after | |
| 2703 * "\(", "\|", "\&' or "\n" */ | |
| 2704 if (reg_magic >= MAGIC_OFF | |
| 2705 && (at_start | |
| 2706 || reg_magic == MAGIC_ALL | |
| 2707 || prevchr == Magic('(') | |
| 2708 || prevchr == Magic('|') | |
| 2709 || prevchr == Magic('&') | |
| 2710 || prevchr == Magic('n') | |
| 2711 || (no_Magic(prevchr) == '(' | |
| 2712 && prevprevchr == Magic('%')))) | |
| 2713 { | |
| 2714 curchr = Magic('^'); | |
| 2715 at_start = TRUE; | |
| 2716 prev_at_start = FALSE; | |
| 2717 } | |
| 2718 break; | |
| 2719 case '$': | |
| 2720 /* '$' is only magic as the very last char and if it's in front of | |
| 2721 * either "\|", "\)", "\&", or "\n" */ | |
| 2722 if (reg_magic >= MAGIC_OFF) | |
| 2723 { | |
| 2724 char_u *p = regparse + 1; | |
| 2725 | |
| 2726 /* ignore \c \C \m and \M after '$' */ | |
| 2727 while (p[0] == '\\' && (p[1] == 'c' || p[1] == 'C' | |
| 2728 || p[1] == 'm' || p[1] == 'M' || p[1] == 'Z')) | |
| 2729 p += 2; | |
| 2730 if (p[0] == NUL | |
| 2731 || (p[0] == '\\' | |
| 2732 && (p[1] == '|' || p[1] == '&' || p[1] == ')' | |
| 2733 || p[1] == 'n')) | |
| 2734 || reg_magic == MAGIC_ALL) | |
| 2735 curchr = Magic('$'); | |
| 2736 } | |
| 2737 break; | |
| 2738 case '\\': | |
| 2739 { | |
| 2740 int c = regparse[1]; | |
| 2741 | |
| 2742 if (c == NUL) | |
| 2743 curchr = '\\'; /* trailing '\' */ | |
| 2744 else if ( | |
| 2745 #ifdef EBCDIC | |
| 2746 vim_strchr(META, c) | |
| 2747 #else | |
| 2748 c <= '~' && META_flags[c] | |
| 2749 #endif | |
| 2750 ) | |
| 2751 { | |
| 2752 /* | |
| 2753 * META contains everything that may be magic sometimes, | |
| 2754 * except ^ and $ ("\^" and "\$" are only magic after | |
| 2755 * "\v"). We now fetch the next character and toggle its | |
| 2756 * magicness. Therefore, \ is so meta-magic that it is | |
| 2757 * not in META. | |
| 2758 */ | |
| 2759 curchr = -1; | |
| 2760 prev_at_start = at_start; | |
| 2761 at_start = FALSE; /* be able to say "/\*ptr" */ | |
| 2762 ++regparse; | |
| 167 | 2763 ++after_slash; |
| 7 | 2764 peekchr(); |
| 2765 --regparse; | |
| 167 | 2766 --after_slash; |
| 7 | 2767 curchr = toggle_Magic(curchr); |
| 2768 } | |
| 2769 else if (vim_strchr(REGEXP_ABBR, c)) | |
| 2770 { | |
| 2771 /* | |
| 2772 * Handle abbreviations, like "\t" for TAB -- webb | |
| 2773 */ | |
| 2774 curchr = backslash_trans(c); | |
| 2775 } | |
| 2776 else if (reg_magic == MAGIC_NONE && (c == '$' || c == '^')) | |
| 2777 curchr = toggle_Magic(c); | |
| 2778 else | |
| 2779 { | |
| 2780 /* | |
| 2781 * Next character can never be (made) magic? | |
| 2782 * Then backslashing it won't do anything. | |
| 2783 */ | |
| 2784 #ifdef FEAT_MBYTE | |
| 2785 if (has_mbyte) | |
| 2786 curchr = (*mb_ptr2char)(regparse + 1); | |
| 2787 else | |
| 2788 #endif | |
| 2789 curchr = c; | |
| 2790 } | |
| 2791 break; | |
| 2792 } | |
| 2793 | |
| 2794 #ifdef FEAT_MBYTE | |
| 2795 default: | |
| 2796 if (has_mbyte) | |
| 2797 curchr = (*mb_ptr2char)(regparse); | |
| 2798 #endif | |
| 2799 } | |
| 2800 } | |
| 2801 | |
| 2802 return curchr; | |
| 2803 } | |
| 2804 | |
| 2805 /* | |
| 2806 * Eat one lexed character. Do this in a way that we can undo it. | |
| 2807 */ | |
| 2808 static void | |
| 2809 skipchr() | |
| 2810 { | |
| 2811 /* peekchr() eats a backslash, do the same here */ | |
| 2812 if (*regparse == '\\') | |
| 2813 prevchr_len = 1; | |
| 2814 else | |
| 2815 prevchr_len = 0; | |
| 2816 if (regparse[prevchr_len] != NUL) | |
| 2817 { | |
| 2818 #ifdef FEAT_MBYTE | |
| 714 | 2819 if (enc_utf8) |
| 1449 | 2820 /* exclude composing chars that mb_ptr2len does include */ |
| 2821 prevchr_len += utf_ptr2len(regparse + prevchr_len); | |
| 714 | 2822 else if (has_mbyte) |
| 474 | 2823 prevchr_len += (*mb_ptr2len)(regparse + prevchr_len); |
| 7 | 2824 else |
| 2825 #endif | |
| 2826 ++prevchr_len; | |
| 2827 } | |
| 2828 regparse += prevchr_len; | |
| 2829 prev_at_start = at_start; | |
| 2830 at_start = FALSE; | |
| 2831 prevprevchr = prevchr; | |
| 2832 prevchr = curchr; | |
| 2833 curchr = nextchr; /* use previously unget char, or -1 */ | |
| 2834 nextchr = -1; | |
| 2835 } | |
| 2836 | |
| 2837 /* | |
| 2838 * Skip a character while keeping the value of prev_at_start for at_start. | |
| 2839 * prevchr and prevprevchr are also kept. | |
| 2840 */ | |
| 2841 static void | |
| 2842 skipchr_keepstart() | |
| 2843 { | |
| 2844 int as = prev_at_start; | |
| 2845 int pr = prevchr; | |
| 2846 int prpr = prevprevchr; | |
| 2847 | |
| 2848 skipchr(); | |
| 2849 at_start = as; | |
| 2850 prevchr = pr; | |
| 2851 prevprevchr = prpr; | |
| 2852 } | |
| 2853 | |
| 2854 static int | |
| 2855 getchr() | |
| 2856 { | |
| 2857 int chr = peekchr(); | |
| 2858 | |
| 2859 skipchr(); | |
| 2860 return chr; | |
| 2861 } | |
| 2862 | |
| 2863 /* | |
| 2864 * put character back. Works only once! | |
| 2865 */ | |
| 2866 static void | |
| 2867 ungetchr() | |
| 2868 { | |
| 2869 nextchr = curchr; | |
| 2870 curchr = prevchr; | |
| 2871 prevchr = prevprevchr; | |
| 2872 at_start = prev_at_start; | |
| 2873 prev_at_start = FALSE; | |
| 2874 | |
| 2875 /* Backup regparse, so that it's at the same position as before the | |
| 2876 * getchr(). */ | |
| 2877 regparse -= prevchr_len; | |
| 2878 } | |
| 2879 | |
| 2880 /* | |
| 29 | 2881 * Get and return the value of the hex string at the current position. |
| 2882 * Return -1 if there is no valid hex number. | |
| 2883 * The position is updated: | |
| 24 | 2884 * blahblah\%x20asdf |
| 856 | 2885 * before-^ ^-after |
| 24 | 2886 * The parameter controls the maximum number of input characters. This will be |
| 2887 * 2 when reading a \%x20 sequence and 4 when reading a \%u20AC sequence. | |
| 2888 */ | |
| 2889 static int | |
| 2890 gethexchrs(maxinputlen) | |
| 2891 int maxinputlen; | |
| 2892 { | |
| 2893 int nr = 0; | |
| 2894 int c; | |
| 2895 int i; | |
| 2896 | |
| 2897 for (i = 0; i < maxinputlen; ++i) | |
| 2898 { | |
| 2899 c = regparse[0]; | |
| 2900 if (!vim_isxdigit(c)) | |
| 2901 break; | |
| 2902 nr <<= 4; | |
| 2903 nr |= hex2nr(c); | |
| 2904 ++regparse; | |
| 2905 } | |
| 2906 | |
| 2907 if (i == 0) | |
| 2908 return -1; | |
| 2909 return nr; | |
| 2910 } | |
| 2911 | |
| 2912 /* | |
| 2913 * get and return the value of the decimal string immediately after the | |
| 2914 * current position. Return -1 for invalid. Consumes all digits. | |
| 2915 */ | |
| 2916 static int | |
| 2917 getdecchrs() | |
| 2918 { | |
| 2919 int nr = 0; | |
| 2920 int c; | |
| 2921 int i; | |
| 2922 | |
| 2923 for (i = 0; ; ++i) | |
| 2924 { | |
| 2925 c = regparse[0]; | |
| 2926 if (c < '0' || c > '9') | |
| 2927 break; | |
| 2928 nr *= 10; | |
| 2929 nr += c - '0'; | |
| 2930 ++regparse; | |
| 2931 } | |
| 2932 | |
| 2933 if (i == 0) | |
| 2934 return -1; | |
| 2935 return nr; | |
| 2936 } | |
| 2937 | |
| 2938 /* | |
| 2939 * get and return the value of the octal string immediately after the current | |
| 2940 * position. Return -1 for invalid, or 0-255 for valid. Smart enough to handle | |
| 2941 * numbers > 377 correctly (for example, 400 is treated as 40) and doesn't | |
| 2942 * treat 8 or 9 as recognised characters. Position is updated: | |
| 2943 * blahblah\%o210asdf | |
| 856 | 2944 * before-^ ^-after |
| 24 | 2945 */ |
| 2946 static int | |
| 2947 getoctchrs() | |
| 2948 { | |
| 2949 int nr = 0; | |
| 2950 int c; | |
| 2951 int i; | |
| 2952 | |
| 2953 for (i = 0; i < 3 && nr < 040; ++i) | |
| 2954 { | |
| 2955 c = regparse[0]; | |
| 2956 if (c < '0' || c > '7') | |
| 2957 break; | |
| 2958 nr <<= 3; | |
| 2959 nr |= hex2nr(c); | |
| 2960 ++regparse; | |
| 2961 } | |
| 2962 | |
| 2963 if (i == 0) | |
| 2964 return -1; | |
| 2965 return nr; | |
| 2966 } | |
| 2967 | |
| 2968 /* | |
| 2969 * Get a number after a backslash that is inside []. | |
| 2970 * When nothing is recognized return a backslash. | |
| 2971 */ | |
| 2972 static int | |
| 2973 coll_get_char() | |
| 2974 { | |
| 2975 int nr = -1; | |
| 2976 | |
| 2977 switch (*regparse++) | |
| 2978 { | |
| 2979 case 'd': nr = getdecchrs(); break; | |
| 2980 case 'o': nr = getoctchrs(); break; | |
| 2981 case 'x': nr = gethexchrs(2); break; | |
| 2982 case 'u': nr = gethexchrs(4); break; | |
| 2983 case 'U': nr = gethexchrs(8); break; | |
| 2984 } | |
| 2985 if (nr < 0) | |
| 2986 { | |
| 2987 /* If getting the number fails be backwards compatible: the character | |
| 2988 * is a backslash. */ | |
| 2989 --regparse; | |
| 2990 nr = '\\'; | |
| 2991 } | |
| 2992 return nr; | |
| 2993 } | |
| 2994 | |
| 2995 /* | |
| 7 | 2996 * read_limits - Read two integers to be taken as a minimum and maximum. |
| 2997 * If the first character is '-', then the range is reversed. | |
| 2998 * Should end with 'end'. If minval is missing, zero is default, if maxval is | |
| 2999 * missing, a very big number is the default. | |
| 3000 */ | |
| 3001 static int | |
| 3002 read_limits(minval, maxval) | |
| 3003 long *minval; | |
| 3004 long *maxval; | |
| 3005 { | |
| 3006 int reverse = FALSE; | |
| 3007 char_u *first_char; | |
| 3008 long tmp; | |
| 3009 | |
| 3010 if (*regparse == '-') | |
| 3011 { | |
| 3012 /* Starts with '-', so reverse the range later */ | |
| 3013 regparse++; | |
| 3014 reverse = TRUE; | |
| 3015 } | |
| 3016 first_char = regparse; | |
| 3017 *minval = getdigits(®parse); | |
| 3018 if (*regparse == ',') /* There is a comma */ | |
| 3019 { | |
| 3020 if (vim_isdigit(*++regparse)) | |
| 3021 *maxval = getdigits(®parse); | |
| 3022 else | |
| 3023 *maxval = MAX_LIMIT; | |
| 3024 } | |
| 3025 else if (VIM_ISDIGIT(*first_char)) | |
| 3026 *maxval = *minval; /* It was \{n} or \{-n} */ | |
| 3027 else | |
| 3028 *maxval = MAX_LIMIT; /* It was \{} or \{-} */ | |
| 3029 if (*regparse == '\\') | |
| 3030 regparse++; /* Allow either \{...} or \{...\} */ | |
| 167 | 3031 if (*regparse != '}') |
| 7 | 3032 { |
| 3033 sprintf((char *)IObuff, _("E554: Syntax error in %s{...}"), | |
| 3034 reg_magic == MAGIC_ALL ? "" : "\\"); | |
| 3035 EMSG_RET_FAIL(IObuff); | |
| 3036 } | |
| 3037 | |
| 3038 /* | |
| 3039 * Reverse the range if there was a '-', or make sure it is in the right | |
| 3040 * order otherwise. | |
| 3041 */ | |
| 3042 if ((!reverse && *minval > *maxval) || (reverse && *minval < *maxval)) | |
| 3043 { | |
| 3044 tmp = *minval; | |
| 3045 *minval = *maxval; | |
| 3046 *maxval = tmp; | |
| 3047 } | |
| 3048 skipchr(); /* let's be friends with the lexer again */ | |
| 3049 return OK; | |
| 3050 } | |
| 3051 | |
| 3052 /* | |
| 3053 * vim_regexec and friends | |
| 3054 */ | |
| 3055 | |
| 3056 /* | |
| 3057 * Global work variables for vim_regexec(). | |
| 3058 */ | |
| 3059 | |
| 3060 /* The current match-position is remembered with these variables: */ | |
| 3061 static linenr_T reglnum; /* line number, relative to first line */ | |
| 3062 static char_u *regline; /* start of current line */ | |
| 3063 static char_u *reginput; /* current input, points into "regline" */ | |
| 3064 | |
| 3065 static int need_clear_subexpr; /* subexpressions still need to be | |
| 3066 * cleared */ | |
| 3067 #ifdef FEAT_SYN_HL | |
| 3068 static int need_clear_zsubexpr = FALSE; /* extmatch subexpressions | |
| 3069 * still need to be cleared */ | |
| 3070 #endif | |
| 3071 | |
| 3072 /* | |
| 3073 * Structure used to save the current input state, when it needs to be | |
| 3074 * restored after trying a match. Used by reg_save() and reg_restore(). | |
| 233 | 3075 * Also stores the length of "backpos". |
| 7 | 3076 */ |
| 3077 typedef struct | |
| 3078 { | |
| 3079 union | |
| 3080 { | |
| 3081 char_u *ptr; /* reginput pointer, for single-line regexp */ | |
| 3082 lpos_T pos; /* reginput pos, for multi-line regexp */ | |
| 3083 } rs_u; | |
| 233 | 3084 int rs_len; |
| 7 | 3085 } regsave_T; |
| 3086 | |
| 3087 /* struct to save start/end pointer/position in for \(\) */ | |
| 3088 typedef struct | |
| 3089 { | |
| 3090 union | |
| 3091 { | |
| 3092 char_u *ptr; | |
| 3093 lpos_T pos; | |
| 3094 } se_u; | |
| 3095 } save_se_T; | |
| 3096 | |
| 1579 | 3097 /* used for BEHIND and NOBEHIND matching */ |
| 3098 typedef struct regbehind_S | |
| 3099 { | |
| 3100 regsave_T save_after; | |
| 3101 regsave_T save_behind; | |
| 1602 | 3102 int save_need_clear_subexpr; |
| 1579 | 3103 save_se_T save_start[NSUBEXP]; |
| 3104 save_se_T save_end[NSUBEXP]; | |
| 3105 } regbehind_T; | |
| 3106 | |
| 7 | 3107 static char_u *reg_getline __ARGS((linenr_T lnum)); |
| 1521 | 3108 static long vim_regexec_both __ARGS((char_u *line, colnr_T col, proftime_T *tm)); |
| 7 | 3109 static long regtry __ARGS((regprog_T *prog, colnr_T col)); |
| 3110 static void cleanup_subexpr __ARGS((void)); | |
| 3111 #ifdef FEAT_SYN_HL | |
| 3112 static void cleanup_zsubexpr __ARGS((void)); | |
| 3113 #endif | |
| 1579 | 3114 static void save_subexpr __ARGS((regbehind_T *bp)); |
| 3115 static void restore_subexpr __ARGS((regbehind_T *bp)); | |
| 7 | 3116 static void reg_nextline __ARGS((void)); |
| 233 | 3117 static void reg_save __ARGS((regsave_T *save, garray_T *gap)); |
| 3118 static void reg_restore __ARGS((regsave_T *save, garray_T *gap)); | |
| 7 | 3119 static int reg_save_equal __ARGS((regsave_T *save)); |
| 3120 static void save_se_multi __ARGS((save_se_T *savep, lpos_T *posp)); | |
| 3121 static void save_se_one __ARGS((save_se_T *savep, char_u **pp)); | |
| 3122 | |
| 3123 /* Save the sub-expressions before attempting a match. */ | |
| 3124 #define save_se(savep, posp, pp) \ | |
| 3125 REG_MULTI ? save_se_multi((savep), (posp)) : save_se_one((savep), (pp)) | |
| 3126 | |
| 3127 /* After a failed match restore the sub-expressions. */ | |
| 3128 #define restore_se(savep, posp, pp) { \ | |
| 3129 if (REG_MULTI) \ | |
| 3130 *(posp) = (savep)->se_u.pos; \ | |
| 3131 else \ | |
| 3132 *(pp) = (savep)->se_u.ptr; } | |
| 3133 | |
| 3134 static int re_num_cmp __ARGS((long_u val, char_u *scan)); | |
| 180 | 3135 static int regmatch __ARGS((char_u *prog)); |
| 7 | 3136 static int regrepeat __ARGS((char_u *p, long maxcount)); |
| 3137 | |
| 3138 #ifdef DEBUG | |
| 3139 int regnarrate = 0; | |
| 3140 #endif | |
| 3141 | |
| 3142 /* | |
| 3143 * Internal copy of 'ignorecase'. It is set at each call to vim_regexec(). | |
| 3144 * Normally it gets the value of "rm_ic" or "rmm_ic", but when the pattern | |
| 3145 * contains '\c' or '\C' the value is overruled. | |
| 3146 */ | |
| 3147 static int ireg_ic; | |
| 3148 | |
| 3149 #ifdef FEAT_MBYTE | |
| 3150 /* | |
| 3151 * Similar to ireg_ic, but only for 'combining' characters. Set with \Z flag | |
| 3152 * in the regexp. Defaults to false, always. | |
| 3153 */ | |
| 3154 static int ireg_icombine; | |
| 3155 #endif | |
| 3156 | |
| 3157 /* | |
| 410 | 3158 * Copy of "rmm_maxcol": maximum column to search for a match. Zero when |
| 3159 * there is no maximum. | |
| 3160 */ | |
| 418 | 3161 static colnr_T ireg_maxcol; |
| 410 | 3162 |
| 3163 /* | |
| 7 | 3164 * Sometimes need to save a copy of a line. Since alloc()/free() is very |
| 3165 * slow, we keep one allocated piece of memory and only re-allocate it when | |
| 3166 * it's too small. It's freed in vim_regexec_both() when finished. | |
| 3167 */ | |
| 1468 | 3168 static char_u *reg_tofree = NULL; |
| 7 | 3169 static unsigned reg_tofreelen; |
| 3170 | |
| 3171 /* | |
| 3172 * These variables are set when executing a regexp to speed up the execution. | |
| 1209 | 3173 * Which ones are set depends on whether a single-line or multi-line match is |
| 7 | 3174 * done: |
| 3175 * single-line multi-line | |
| 3176 * reg_match ®match_T NULL | |
| 3177 * reg_mmatch NULL ®mmatch_T | |
| 3178 * reg_startp reg_match->startp <invalid> | |
| 3179 * reg_endp reg_match->endp <invalid> | |
| 3180 * reg_startpos <invalid> reg_mmatch->startpos | |
| 3181 * reg_endpos <invalid> reg_mmatch->endpos | |
| 3182 * reg_win NULL window in which to search | |
| 3183 * reg_buf <invalid> buffer in which to search | |
| 3184 * reg_firstlnum <invalid> first line in which to search | |
| 3185 * reg_maxline 0 last line nr | |
| 3186 * reg_line_lbr FALSE or TRUE FALSE | |
| 3187 */ | |
| 3188 static regmatch_T *reg_match; | |
| 3189 static regmmatch_T *reg_mmatch; | |
| 3190 static char_u **reg_startp = NULL; | |
| 3191 static char_u **reg_endp = NULL; | |
| 3192 static lpos_T *reg_startpos = NULL; | |
| 3193 static lpos_T *reg_endpos = NULL; | |
| 3194 static win_T *reg_win; | |
| 3195 static buf_T *reg_buf; | |
| 3196 static linenr_T reg_firstlnum; | |
| 3197 static linenr_T reg_maxline; | |
| 3198 static int reg_line_lbr; /* "\n" in string is line break */ | |
| 3199 | |
| 270 | 3200 /* Values for rs_state in regitem_T. */ |
| 3201 typedef enum regstate_E | |
| 3202 { | |
| 3203 RS_NOPEN = 0 /* NOPEN and NCLOSE */ | |
| 3204 , RS_MOPEN /* MOPEN + [0-9] */ | |
| 3205 , RS_MCLOSE /* MCLOSE + [0-9] */ | |
| 3206 #ifdef FEAT_SYN_HL | |
| 3207 , RS_ZOPEN /* ZOPEN + [0-9] */ | |
| 3208 , RS_ZCLOSE /* ZCLOSE + [0-9] */ | |
| 3209 #endif | |
| 3210 , RS_BRANCH /* BRANCH */ | |
| 3211 , RS_BRCPLX_MORE /* BRACE_COMPLEX and trying one more match */ | |
| 3212 , RS_BRCPLX_LONG /* BRACE_COMPLEX and trying longest match */ | |
| 3213 , RS_BRCPLX_SHORT /* BRACE_COMPLEX and trying shortest match */ | |
| 3214 , RS_NOMATCH /* NOMATCH */ | |
| 3215 , RS_BEHIND1 /* BEHIND / NOBEHIND matching rest */ | |
| 3216 , RS_BEHIND2 /* BEHIND / NOBEHIND matching behind part */ | |
| 3217 , RS_STAR_LONG /* STAR/PLUS/BRACE_SIMPLE longest match */ | |
| 3218 , RS_STAR_SHORT /* STAR/PLUS/BRACE_SIMPLE shortest match */ | |
| 3219 } regstate_T; | |
| 3220 | |
| 3221 /* | |
| 3222 * When there are alternatives a regstate_T is put on the regstack to remember | |
| 3223 * what we are doing. | |
| 3224 * Before it may be another type of item, depending on rs_state, to remember | |
| 3225 * more things. | |
| 3226 */ | |
| 3227 typedef struct regitem_S | |
| 3228 { | |
| 3229 regstate_T rs_state; /* what we are doing, one of RS_ above */ | |
| 3230 char_u *rs_scan; /* current node in program */ | |
| 3231 union | |
| 3232 { | |
| 3233 save_se_T sesave; | |
| 3234 regsave_T regsave; | |
| 3235 } rs_un; /* room for saving reginput */ | |
| 1579 | 3236 short rs_no; /* submatch nr or BEHIND/NOBEHIND */ |
| 270 | 3237 } regitem_T; |
| 3238 | |
| 3239 static regitem_T *regstack_push __ARGS((regstate_T state, char_u *scan)); | |
| 3240 static void regstack_pop __ARGS((char_u **scan)); | |
| 3241 | |
| 3242 /* used for STAR, PLUS and BRACE_SIMPLE matching */ | |
| 3243 typedef struct regstar_S | |
| 3244 { | |
| 3245 int nextb; /* next byte */ | |
| 3246 int nextb_ic; /* next byte reverse case */ | |
| 3247 long count; | |
| 3248 long minval; | |
| 3249 long maxval; | |
| 3250 } regstar_T; | |
| 3251 | |
| 3252 /* used to store input position when a BACK was encountered, so that we now if | |
| 3253 * we made any progress since the last time. */ | |
| 3254 typedef struct backpos_S | |
| 3255 { | |
| 3256 char_u *bp_scan; /* "scan" where BACK was encountered */ | |
| 3257 regsave_T bp_pos; /* last input position */ | |
| 3258 } backpos_T; | |
| 3259 | |
| 3260 /* | |
| 1520 | 3261 * "regstack" and "backpos" are used by regmatch(). They are kept over calls |
| 3262 * to avoid invoking malloc() and free() often. | |
| 3263 * "regstack" is a stack with regitem_T items, sometimes preceded by regstar_T | |
| 3264 * or regbehind_T. | |
| 3265 * "backpos_T" is a table with backpos_T for BACK | |
| 270 | 3266 */ |
| 1520 | 3267 static garray_T regstack = {0, 0, 0, 0, NULL}; |
| 3268 static garray_T backpos = {0, 0, 0, 0, NULL}; | |
| 3269 | |
| 3270 /* | |
| 3271 * Both for regstack and backpos tables we use the following strategy of | |
| 3272 * allocation (to reduce malloc/free calls): | |
| 3273 * - Initial size is fairly small. | |
| 3274 * - When needed, the tables are grown bigger (8 times at first, double after | |
| 3275 * that). | |
| 3276 * - After executing the match we free the memory only if the array has grown. | |
| 3277 * Thus the memory is kept allocated when it's at the initial size. | |
| 3278 * This makes it fast while not keeping a lot of memory allocated. | |
| 3279 * A three times speed increase was observed when using many simple patterns. | |
| 3280 */ | |
| 3281 #define REGSTACK_INITIAL 2048 | |
| 3282 #define BACKPOS_INITIAL 64 | |
| 3283 | |
| 3284 #if defined(EXITFREE) || defined(PROTO) | |
| 3285 void | |
| 3286 free_regexp_stuff() | |
| 3287 { | |
| 3288 ga_clear(®stack); | |
| 3289 ga_clear(&backpos); | |
| 3290 vim_free(reg_tofree); | |
| 3291 vim_free(reg_prev_sub); | |
| 3292 } | |
| 3293 #endif | |
| 270 | 3294 |
| 7 | 3295 /* |
| 3296 * Get pointer to the line "lnum", which is relative to "reg_firstlnum". | |
| 3297 */ | |
| 3298 static char_u * | |
| 3299 reg_getline(lnum) | |
| 3300 linenr_T lnum; | |
| 3301 { | |
| 3302 /* when looking behind for a match/no-match lnum is negative. But we | |
| 3303 * can't go before line 1 */ | |
| 3304 if (reg_firstlnum + lnum < 1) | |
| 3305 return NULL; | |
| 482 | 3306 if (lnum > reg_maxline) |
| 481 | 3307 /* Must have matched the "\n" in the last line. */ |
| 3308 return (char_u *)""; | |
| 7 | 3309 return ml_get_buf(reg_buf, reg_firstlnum + lnum, FALSE); |
| 3310 } | |
| 3311 | |
| 3312 static regsave_T behind_pos; | |
| 3313 | |
| 3314 #ifdef FEAT_SYN_HL | |
| 3315 static char_u *reg_startzp[NSUBEXP]; /* Workspace to mark beginning */ | |
| 3316 static char_u *reg_endzp[NSUBEXP]; /* and end of \z(...\) matches */ | |
| 3317 static lpos_T reg_startzpos[NSUBEXP]; /* idem, beginning pos */ | |
| 3318 static lpos_T reg_endzpos[NSUBEXP]; /* idem, end pos */ | |
| 3319 #endif | |
| 3320 | |
| 3321 /* TRUE if using multi-line regexp. */ | |
| 3322 #define REG_MULTI (reg_match == NULL) | |
| 3323 | |
| 3324 /* | |
| 3325 * Match a regexp against a string. | |
| 3326 * "rmp->regprog" is a compiled regexp as returned by vim_regcomp(). | |
| 3327 * Uses curbuf for line count and 'iskeyword'. | |
| 3328 * | |
| 3329 * Return TRUE if there is a match, FALSE if not. | |
| 3330 */ | |
| 3331 int | |
| 3332 vim_regexec(rmp, line, col) | |
| 3333 regmatch_T *rmp; | |
| 3334 char_u *line; /* string to match against */ | |
| 3335 colnr_T col; /* column to start looking for match */ | |
| 3336 { | |
| 3337 reg_match = rmp; | |
| 3338 reg_mmatch = NULL; | |
| 3339 reg_maxline = 0; | |
| 3340 reg_line_lbr = FALSE; | |
| 3341 reg_win = NULL; | |
| 3342 ireg_ic = rmp->rm_ic; | |
| 3343 #ifdef FEAT_MBYTE | |
| 3344 ireg_icombine = FALSE; | |
| 3345 #endif | |
| 410 | 3346 ireg_maxcol = 0; |
| 1521 | 3347 return (vim_regexec_both(line, col, NULL) != 0); |
| 7 | 3348 } |
| 3349 | |
| 39 | 3350 #if defined(FEAT_MODIFY_FNAME) || defined(FEAT_EVAL) \ |
| 3351 || defined(FIND_REPLACE_DIALOG) || defined(PROTO) | |
| 7 | 3352 /* |
| 3353 * Like vim_regexec(), but consider a "\n" in "line" to be a line break. | |
| 3354 */ | |
| 3355 int | |
| 3356 vim_regexec_nl(rmp, line, col) | |
| 3357 regmatch_T *rmp; | |
| 3358 char_u *line; /* string to match against */ | |
| 3359 colnr_T col; /* column to start looking for match */ | |
| 3360 { | |
| 3361 reg_match = rmp; | |
| 3362 reg_mmatch = NULL; | |
| 3363 reg_maxline = 0; | |
| 3364 reg_line_lbr = TRUE; | |
| 3365 reg_win = NULL; | |
| 3366 ireg_ic = rmp->rm_ic; | |
| 3367 #ifdef FEAT_MBYTE | |
| 3368 ireg_icombine = FALSE; | |
| 3369 #endif | |
| 410 | 3370 ireg_maxcol = 0; |
| 1521 | 3371 return (vim_regexec_both(line, col, NULL) != 0); |
| 7 | 3372 } |
| 3373 #endif | |
| 3374 | |
| 3375 /* | |
| 3376 * Match a regexp against multiple lines. | |
| 3377 * "rmp->regprog" is a compiled regexp as returned by vim_regcomp(). | |
| 3378 * Uses curbuf for line count and 'iskeyword'. | |
| 3379 * | |
| 3380 * Return zero if there is no match. Return number of lines contained in the | |
| 3381 * match otherwise. | |
| 3382 */ | |
| 3383 long | |
| 1521 | 3384 vim_regexec_multi(rmp, win, buf, lnum, col, tm) |
| 7 | 3385 regmmatch_T *rmp; |
| 3386 win_T *win; /* window in which to search or NULL */ | |
| 3387 buf_T *buf; /* buffer in which to search */ | |
| 3388 linenr_T lnum; /* nr of line to start looking for match */ | |
| 3389 colnr_T col; /* column to start looking for match */ | |
| 1521 | 3390 proftime_T *tm; /* timeout limit or NULL */ |
| 7 | 3391 { |
| 3392 long r; | |
| 3393 buf_T *save_curbuf = curbuf; | |
| 3394 | |
| 3395 reg_match = NULL; | |
| 3396 reg_mmatch = rmp; | |
| 3397 reg_buf = buf; | |
| 3398 reg_win = win; | |
| 3399 reg_firstlnum = lnum; | |
| 3400 reg_maxline = reg_buf->b_ml.ml_line_count - lnum; | |
| 3401 reg_line_lbr = FALSE; | |
| 3402 ireg_ic = rmp->rmm_ic; | |
| 3403 #ifdef FEAT_MBYTE | |
| 3404 ireg_icombine = FALSE; | |
| 3405 #endif | |
| 410 | 3406 ireg_maxcol = rmp->rmm_maxcol; |
| 7 | 3407 |
| 3408 /* Need to switch to buffer "buf" to make vim_iswordc() work. */ | |
| 3409 curbuf = buf; | |
| 1521 | 3410 r = vim_regexec_both(NULL, col, tm); |
| 7 | 3411 curbuf = save_curbuf; |
| 3412 | |
| 3413 return r; | |
| 3414 } | |
| 3415 | |
| 3416 /* | |
| 3417 * Match a regexp against a string ("line" points to the string) or multiple | |
| 3418 * lines ("line" is NULL, use reg_getline()). | |
| 3419 */ | |
| 3420 static long | |
| 1521 | 3421 vim_regexec_both(line, col, tm) |
| 7 | 3422 char_u *line; |
| 3423 colnr_T col; /* column to start looking for match */ | |
| 1877 | 3424 proftime_T *tm UNUSED; /* timeout limit or NULL */ |
| 7 | 3425 { |
| 3426 regprog_T *prog; | |
| 3427 char_u *s; | |
| 189 | 3428 long retval = 0L; |
| 7 | 3429 |
| 1520 | 3430 /* Create "regstack" and "backpos" if they are not allocated yet. |
| 3431 * We allocate *_INITIAL amount of bytes first and then set the grow size | |
| 3432 * to much bigger value to avoid many malloc calls in case of deep regular | |
| 3433 * expressions. */ | |
| 3434 if (regstack.ga_data == NULL) | |
| 3435 { | |
| 3436 /* Use an item size of 1 byte, since we push different things | |
| 3437 * onto the regstack. */ | |
| 3438 ga_init2(®stack, 1, REGSTACK_INITIAL); | |
| 3439 ga_grow(®stack, REGSTACK_INITIAL); | |
| 3440 regstack.ga_growsize = REGSTACK_INITIAL * 8; | |
| 3441 } | |
| 3442 | |
| 3443 if (backpos.ga_data == NULL) | |
| 3444 { | |
| 3445 ga_init2(&backpos, sizeof(backpos_T), BACKPOS_INITIAL); | |
| 3446 ga_grow(&backpos, BACKPOS_INITIAL); | |
| 3447 backpos.ga_growsize = BACKPOS_INITIAL * 8; | |
| 3448 } | |
| 270 | 3449 |
| 7 | 3450 if (REG_MULTI) |
| 3451 { | |
| 3452 prog = reg_mmatch->regprog; | |
| 3453 line = reg_getline((linenr_T)0); | |
| 3454 reg_startpos = reg_mmatch->startpos; | |
| 3455 reg_endpos = reg_mmatch->endpos; | |
| 3456 } | |
| 3457 else | |
| 3458 { | |
| 3459 prog = reg_match->regprog; | |
| 3460 reg_startp = reg_match->startp; | |
| 3461 reg_endp = reg_match->endp; | |
| 3462 } | |
| 3463 | |
| 3464 /* Be paranoid... */ | |
| 3465 if (prog == NULL || line == NULL) | |
| 3466 { | |
| 3467 EMSG(_(e_null)); | |
| 3468 goto theend; | |
| 3469 } | |
| 3470 | |
| 3471 /* Check validity of program. */ | |
| 3472 if (prog_magic_wrong()) | |
| 3473 goto theend; | |
| 3474 | |
| 410 | 3475 /* If the start column is past the maximum column: no need to try. */ |
| 3476 if (ireg_maxcol > 0 && col >= ireg_maxcol) | |
| 3477 goto theend; | |
| 3478 | |
| 7 | 3479 /* If pattern contains "\c" or "\C": overrule value of ireg_ic */ |
| 3480 if (prog->regflags & RF_ICASE) | |
| 3481 ireg_ic = TRUE; | |
| 3482 else if (prog->regflags & RF_NOICASE) | |
| 3483 ireg_ic = FALSE; | |
| 3484 | |
| 3485 #ifdef FEAT_MBYTE | |
| 3486 /* If pattern contains "\Z" overrule value of ireg_icombine */ | |
| 3487 if (prog->regflags & RF_ICOMBINE) | |
| 3488 ireg_icombine = TRUE; | |
| 3489 #endif | |
| 3490 | |
| 3491 /* If there is a "must appear" string, look for it. */ | |
| 3492 if (prog->regmust != NULL) | |
| 3493 { | |
| 3494 int c; | |
| 3495 | |
| 3496 #ifdef FEAT_MBYTE | |
| 3497 if (has_mbyte) | |
| 3498 c = (*mb_ptr2char)(prog->regmust); | |
| 3499 else | |
| 3500 #endif | |
| 3501 c = *prog->regmust; | |
| 3502 s = line + col; | |
| 170 | 3503 |
| 3504 /* | |
| 3505 * This is used very often, esp. for ":global". Use three versions of | |
| 3506 * the loop to avoid overhead of conditions. | |
| 3507 */ | |
| 3508 if (!ireg_ic | |
| 3509 #ifdef FEAT_MBYTE | |
| 3510 && !has_mbyte | |
| 3511 #endif | |
| 3512 ) | |
| 3513 while ((s = vim_strbyte(s, c)) != NULL) | |
| 3514 { | |
| 3515 if (cstrncmp(s, prog->regmust, &prog->regmlen) == 0) | |
| 3516 break; /* Found it. */ | |
| 3517 ++s; | |
| 3518 } | |
| 3519 #ifdef FEAT_MBYTE | |
| 3520 else if (!ireg_ic || (!enc_utf8 && mb_char2len(c) > 1)) | |
| 3521 while ((s = vim_strchr(s, c)) != NULL) | |
| 3522 { | |
| 3523 if (cstrncmp(s, prog->regmust, &prog->regmlen) == 0) | |
| 3524 break; /* Found it. */ | |
| 3525 mb_ptr_adv(s); | |
| 3526 } | |
| 3527 #endif | |
| 3528 else | |
| 3529 while ((s = cstrchr(s, c)) != NULL) | |
| 3530 { | |
| 3531 if (cstrncmp(s, prog->regmust, &prog->regmlen) == 0) | |
| 3532 break; /* Found it. */ | |
| 3533 mb_ptr_adv(s); | |
| 3534 } | |
| 7 | 3535 if (s == NULL) /* Not present. */ |
| 3536 goto theend; | |
| 3537 } | |
| 3538 | |
| 3539 regline = line; | |
| 3540 reglnum = 0; | |
| 2578 | 3541 reg_toolong = FALSE; |
| 7 | 3542 |
| 3543 /* Simplest case: Anchored match need be tried only once. */ | |
| 3544 if (prog->reganch) | |
| 3545 { | |
| 3546 int c; | |
| 3547 | |
| 3548 #ifdef FEAT_MBYTE | |
| 3549 if (has_mbyte) | |
| 3550 c = (*mb_ptr2char)(regline + col); | |
| 3551 else | |
| 3552 #endif | |
| 3553 c = regline[col]; | |
| 3554 if (prog->regstart == NUL | |
| 3555 || prog->regstart == c | |
| 3556 || (ireg_ic && (( | |
| 3557 #ifdef FEAT_MBYTE | |
| 3558 (enc_utf8 && utf_fold(prog->regstart) == utf_fold(c))) | |
| 3559 || (c < 255 && prog->regstart < 255 && | |
| 3560 #endif | |
| 1347 | 3561 MB_TOLOWER(prog->regstart) == MB_TOLOWER(c))))) |
| 7 | 3562 retval = regtry(prog, col); |
| 3563 else | |
| 3564 retval = 0; | |
| 3565 } | |
| 3566 else | |
| 3567 { | |
| 1521 | 3568 #ifdef FEAT_RELTIME |
| 3569 int tm_count = 0; | |
| 3570 #endif | |
| 7 | 3571 /* Messy cases: unanchored match. */ |
| 180 | 3572 while (!got_int) |
| 7 | 3573 { |
| 3574 if (prog->regstart != NUL) | |
| 3575 { | |
| 170 | 3576 /* Skip until the char we know it must start with. |
| 3577 * Used often, do some work to avoid call overhead. */ | |
| 3578 if (!ireg_ic | |
| 3579 #ifdef FEAT_MBYTE | |
| 3580 && !has_mbyte | |
| 3581 #endif | |
| 3582 ) | |
| 3583 s = vim_strbyte(regline + col, prog->regstart); | |
| 3584 else | |
| 3585 s = cstrchr(regline + col, prog->regstart); | |
| 7 | 3586 if (s == NULL) |
| 3587 { | |
| 3588 retval = 0; | |
| 3589 break; | |
| 3590 } | |
| 3591 col = (int)(s - regline); | |
| 3592 } | |
| 3593 | |
| 410 | 3594 /* Check for maximum column to try. */ |
| 3595 if (ireg_maxcol > 0 && col >= ireg_maxcol) | |
| 3596 { | |
| 3597 retval = 0; | |
| 3598 break; | |
| 3599 } | |
| 3600 | |
| 7 | 3601 retval = regtry(prog, col); |
| 3602 if (retval > 0) | |
| 3603 break; | |
| 3604 | |
| 3605 /* if not currently on the first line, get it again */ | |
| 3606 if (reglnum != 0) | |
| 3607 { | |
| 481 | 3608 reglnum = 0; |
| 7 | 3609 regline = reg_getline((linenr_T)0); |
| 3610 } | |
| 3611 if (regline[col] == NUL) | |
| 3612 break; | |
| 3613 #ifdef FEAT_MBYTE | |
| 3614 if (has_mbyte) | |
| 474 | 3615 col += (*mb_ptr2len)(regline + col); |
| 7 | 3616 else |
| 3617 #endif | |
| 3618 ++col; | |
| 1521 | 3619 #ifdef FEAT_RELTIME |
| 3620 /* Check for timeout once in a twenty times to avoid overhead. */ | |
| 3621 if (tm != NULL && ++tm_count == 20) | |
| 3622 { | |
| 3623 tm_count = 0; | |
| 3624 if (profile_passed_limit(tm)) | |
| 3625 break; | |
| 3626 } | |
| 3627 #endif | |
| 7 | 3628 } |
| 3629 } | |
| 3630 | |
| 3631 theend: | |
| 1520 | 3632 /* Free "reg_tofree" when it's a bit big. |
| 3633 * Free regstack and backpos if they are bigger than their initial size. */ | |
| 3634 if (reg_tofreelen > 400) | |
| 3635 { | |
| 3636 vim_free(reg_tofree); | |
| 3637 reg_tofree = NULL; | |
| 3638 } | |
| 3639 if (regstack.ga_maxlen > REGSTACK_INITIAL) | |
| 3640 ga_clear(®stack); | |
| 3641 if (backpos.ga_maxlen > BACKPOS_INITIAL) | |
| 3642 ga_clear(&backpos); | |
| 270 | 3643 |
| 7 | 3644 return retval; |
| 3645 } | |
| 3646 | |
| 3647 #ifdef FEAT_SYN_HL | |
| 3648 static reg_extmatch_T *make_extmatch __ARGS((void)); | |
| 3649 | |
| 3650 /* | |
| 3651 * Create a new extmatch and mark it as referenced once. | |
| 3652 */ | |
| 3653 static reg_extmatch_T * | |
| 3654 make_extmatch() | |
| 3655 { | |
| 3656 reg_extmatch_T *em; | |
| 3657 | |
| 3658 em = (reg_extmatch_T *)alloc_clear((unsigned)sizeof(reg_extmatch_T)); | |
| 3659 if (em != NULL) | |
| 3660 em->refcnt = 1; | |
| 3661 return em; | |
| 3662 } | |
| 3663 | |
| 3664 /* | |
| 3665 * Add a reference to an extmatch. | |
| 3666 */ | |
| 3667 reg_extmatch_T * | |
| 3668 ref_extmatch(em) | |
| 3669 reg_extmatch_T *em; | |
| 3670 { | |
| 3671 if (em != NULL) | |
| 3672 em->refcnt++; | |
| 3673 return em; | |
| 3674 } | |
| 3675 | |
| 3676 /* | |
| 3677 * Remove a reference to an extmatch. If there are no references left, free | |
| 3678 * the info. | |
| 3679 */ | |
| 3680 void | |
| 3681 unref_extmatch(em) | |
| 3682 reg_extmatch_T *em; | |
| 3683 { | |
| 3684 int i; | |
| 3685 | |
| 3686 if (em != NULL && --em->refcnt <= 0) | |
| 3687 { | |
| 3688 for (i = 0; i < NSUBEXP; ++i) | |
| 3689 vim_free(em->matches[i]); | |
| 3690 vim_free(em); | |
| 3691 } | |
| 3692 } | |
| 3693 #endif | |
| 3694 | |
| 3695 /* | |
| 3696 * regtry - try match of "prog" with at regline["col"]. | |
| 3697 * Returns 0 for failure, number of lines contained in the match otherwise. | |
| 3698 */ | |
| 3699 static long | |
| 3700 regtry(prog, col) | |
| 3701 regprog_T *prog; | |
| 3702 colnr_T col; | |
| 3703 { | |
| 3704 reginput = regline + col; | |
| 3705 need_clear_subexpr = TRUE; | |
| 3706 #ifdef FEAT_SYN_HL | |
| 3707 /* Clear the external match subpointers if necessary. */ | |
| 3708 if (prog->reghasz == REX_SET) | |
| 3709 need_clear_zsubexpr = TRUE; | |
| 3710 #endif | |
| 3711 | |
| 189 | 3712 if (regmatch(prog->program + 1) == 0) |
| 3713 return 0; | |
| 3714 | |
| 3715 cleanup_subexpr(); | |
| 3716 if (REG_MULTI) | |
| 7 | 3717 { |
| 189 | 3718 if (reg_startpos[0].lnum < 0) |
| 7 | 3719 { |
| 189 | 3720 reg_startpos[0].lnum = 0; |
| 3721 reg_startpos[0].col = col; | |
| 3722 } | |
| 3723 if (reg_endpos[0].lnum < 0) | |
| 3724 { | |
| 3725 reg_endpos[0].lnum = reglnum; | |
| 3726 reg_endpos[0].col = (int)(reginput - regline); | |
| 7 | 3727 } |
| 3728 else | |
| 189 | 3729 /* Use line number of "\ze". */ |
| 3730 reglnum = reg_endpos[0].lnum; | |
| 3731 } | |
| 3732 else | |
| 3733 { | |
| 3734 if (reg_startp[0] == NULL) | |
| 3735 reg_startp[0] = regline + col; | |
| 3736 if (reg_endp[0] == NULL) | |
| 3737 reg_endp[0] = reginput; | |
| 3738 } | |
| 7 | 3739 #ifdef FEAT_SYN_HL |
| 189 | 3740 /* Package any found \z(...\) matches for export. Default is none. */ |
| 3741 unref_extmatch(re_extmatch_out); | |
| 3742 re_extmatch_out = NULL; | |
| 3743 | |
| 3744 if (prog->reghasz == REX_SET) | |
| 3745 { | |
| 3746 int i; | |
| 3747 | |
| 3748 cleanup_zsubexpr(); | |
| 3749 re_extmatch_out = make_extmatch(); | |
| 3750 for (i = 0; i < NSUBEXP; i++) | |
| 7 | 3751 { |
| 189 | 3752 if (REG_MULTI) |
| 7 | 3753 { |
| 189 | 3754 /* Only accept single line matches. */ |
| 3755 if (reg_startzpos[i].lnum >= 0 | |
| 3756 && reg_endzpos[i].lnum == reg_startzpos[i].lnum) | |
| 3757 re_extmatch_out->matches[i] = | |
| 3758 vim_strnsave(reg_getline(reg_startzpos[i].lnum) | |
| 7 | 3759 + reg_startzpos[i].col, |
| 189 | 3760 reg_endzpos[i].col - reg_startzpos[i].col); |
| 3761 } | |
| 3762 else | |
| 3763 { | |
| 3764 if (reg_startzp[i] != NULL && reg_endzp[i] != NULL) | |
| 3765 re_extmatch_out->matches[i] = | |
| 7 | 3766 vim_strnsave(reg_startzp[i], |
| 189 | 3767 (int)(reg_endzp[i] - reg_startzp[i])); |
| 7 | 3768 } |
| 3769 } | |
| 189 | 3770 } |
| 7 | 3771 #endif |
| 189 | 3772 return 1 + reglnum; |
| 7 | 3773 } |
| 3774 | |
| 3775 #ifdef FEAT_MBYTE | |
| 3776 static int reg_prev_class __ARGS((void)); | |
| 3777 | |
| 3778 /* | |
| 3779 * Get class of previous character. | |
| 3780 */ | |
| 3781 static int | |
| 3782 reg_prev_class() | |
| 3783 { | |
| 3784 if (reginput > regline) | |
| 3785 return mb_get_class(reginput - 1 | |
| 3786 - (*mb_head_off)(regline, reginput - 1)); | |
| 3787 return -1; | |
| 3788 } | |
| 3789 | |
| 3790 #endif | |
| 39 | 3791 #define ADVANCE_REGINPUT() mb_ptr_adv(reginput) |
| 7 | 3792 |
| 3793 /* | |
| 3794 * The arguments from BRACE_LIMITS are stored here. They are actually local | |
| 3795 * to regmatch(), but they are here to reduce the amount of stack space used | |
| 3796 * (it can be called recursively many times). | |
| 3797 */ | |
| 3798 static long bl_minval; | |
| 3799 static long bl_maxval; | |
| 3800 | |
| 3801 /* | |
| 3802 * regmatch - main matching routine | |
| 3803 * | |
| 180 | 3804 * Conceptually the strategy is simple: Check to see whether the current node |
| 3805 * matches, push an item onto the regstack and loop to see whether the rest | |
| 3806 * matches, and then act accordingly. In practice we make some effort to | |
| 3807 * avoid using the regstack, in particular by going through "ordinary" nodes | |
| 3808 * (that don't need to know whether the rest of the match failed) by a nested | |
| 3809 * loop. | |
| 7 | 3810 * |
| 3811 * Returns TRUE when there is a match. Leaves reginput and reglnum just after | |
| 3812 * the last matched character. | |
| 3813 * Returns FALSE when there is no match. Leaves reginput and reglnum in an | |
| 3814 * undefined state! | |
| 3815 */ | |
| 3816 static int | |
| 180 | 3817 regmatch(scan) |
| 7 | 3818 char_u *scan; /* Current node. */ |
| 3819 { | |
| 180 | 3820 char_u *next; /* Next node. */ |
| 3821 int op; | |
| 3822 int c; | |
| 3823 regitem_T *rp; | |
| 3824 int no; | |
| 3825 int status; /* one of the RA_ values: */ | |
| 3826 #define RA_FAIL 1 /* something failed, abort */ | |
| 3827 #define RA_CONT 2 /* continue in inner loop */ | |
| 3828 #define RA_BREAK 3 /* break inner loop */ | |
| 3829 #define RA_MATCH 4 /* successful match */ | |
| 3830 #define RA_NOMATCH 5 /* didn't match */ | |
| 270 | 3831 |
| 1520 | 3832 /* Make "regstack" and "backpos" empty. They are allocated and freed in |
| 3833 * vim_regexec_both() to reduce malloc()/free() calls. */ | |
| 270 | 3834 regstack.ga_len = 0; |
| 3835 backpos.ga_len = 0; | |
| 233 | 3836 |
| 180 | 3837 /* |
| 233 | 3838 * Repeat until "regstack" is empty. |
| 180 | 3839 */ |
| 3840 for (;;) | |
| 3841 { | |
| 7 | 3842 /* Some patterns my cause a long time to match, even though they are not |
| 3843 * illegal. E.g., "\([a-z]\+\)\+Q". Allow breaking them with CTRL-C. */ | |
| 3844 fast_breakcheck(); | |
| 3845 | |
| 3846 #ifdef DEBUG | |
| 3847 if (scan != NULL && regnarrate) | |
| 3848 { | |
| 3849 mch_errmsg(regprop(scan)); | |
| 3850 mch_errmsg("(\n"); | |
| 3851 } | |
| 3852 #endif | |
| 180 | 3853 |
| 3854 /* | |
| 233 | 3855 * Repeat for items that can be matched sequentially, without using the |
| 180 | 3856 * regstack. |
| 3857 */ | |
| 3858 for (;;) | |
| 7 | 3859 { |
| 180 | 3860 if (got_int || scan == NULL) |
| 3861 { | |
| 3862 status = RA_FAIL; | |
| 3863 break; | |
| 3864 } | |
| 3865 status = RA_CONT; | |
| 3866 | |
| 7 | 3867 #ifdef DEBUG |
| 3868 if (regnarrate) | |
| 3869 { | |
| 3870 mch_errmsg(regprop(scan)); | |
| 3871 mch_errmsg("...\n"); | |
| 3872 # ifdef FEAT_SYN_HL | |
| 3873 if (re_extmatch_in != NULL) | |
| 3874 { | |
| 3875 int i; | |
| 3876 | |
| 3877 mch_errmsg(_("External submatches:\n")); | |
| 3878 for (i = 0; i < NSUBEXP; i++) | |
| 3879 { | |
| 3880 mch_errmsg(" \""); | |
| 3881 if (re_extmatch_in->matches[i] != NULL) | |
| 3882 mch_errmsg(re_extmatch_in->matches[i]); | |
| 3883 mch_errmsg("\"\n"); | |
| 3884 } | |
| 3885 } | |
| 3886 # endif | |
| 3887 } | |
| 3888 #endif | |
| 3889 next = regnext(scan); | |
| 3890 | |
| 3891 op = OP(scan); | |
| 3892 /* Check for character class with NL added. */ | |
| 1018 | 3893 if (!reg_line_lbr && WITH_NL(op) && REG_MULTI |
| 3894 && *reginput == NUL && reglnum <= reg_maxline) | |
| 7 | 3895 { |
| 3896 reg_nextline(); | |
| 3897 } | |
| 3898 else if (reg_line_lbr && WITH_NL(op) && *reginput == '\n') | |
| 3899 { | |
| 3900 ADVANCE_REGINPUT(); | |
| 3901 } | |
| 3902 else | |
| 3903 { | |
| 3904 if (WITH_NL(op)) | |
| 180 | 3905 op -= ADD_NL; |
| 7 | 3906 #ifdef FEAT_MBYTE |
| 3907 if (has_mbyte) | |
| 3908 c = (*mb_ptr2char)(reginput); | |
| 3909 else | |
| 3910 #endif | |
| 3911 c = *reginput; | |
| 3912 switch (op) | |
| 3913 { | |
| 3914 case BOL: | |
| 3915 if (reginput != regline) | |
| 180 | 3916 status = RA_NOMATCH; |
| 7 | 3917 break; |
| 3918 | |
| 3919 case EOL: | |
| 3920 if (c != NUL) | |
| 180 | 3921 status = RA_NOMATCH; |
| 7 | 3922 break; |
| 3923 | |
| 3924 case RE_BOF: | |
| 1458 | 3925 /* We're not at the beginning of the file when below the first |
| 3926 * line where we started, not at the start of the line or we | |
| 3927 * didn't start at the first line of the buffer. */ | |
| 7 | 3928 if (reglnum != 0 || reginput != regline |
| 1458 | 3929 || (REG_MULTI && reg_firstlnum > 1)) |
| 180 | 3930 status = RA_NOMATCH; |
| 7 | 3931 break; |
| 3932 | |
| 3933 case RE_EOF: | |
| 3934 if (reglnum != reg_maxline || c != NUL) | |
| 180 | 3935 status = RA_NOMATCH; |
| 7 | 3936 break; |
| 3937 | |
| 3938 case CURSOR: | |
| 3939 /* Check if the buffer is in a window and compare the | |
| 3940 * reg_win->w_cursor position to the match position. */ | |
| 3941 if (reg_win == NULL | |
| 3942 || (reglnum + reg_firstlnum != reg_win->w_cursor.lnum) | |
| 3943 || ((colnr_T)(reginput - regline) != reg_win->w_cursor.col)) | |
| 180 | 3944 status = RA_NOMATCH; |
| 7 | 3945 break; |
| 3946 | |
| 639 | 3947 case RE_MARK: |
| 3948 /* Compare the mark position to the match position. NOTE: Always | |
| 3949 * uses the current buffer. */ | |
| 3950 { | |
| 3951 int mark = OPERAND(scan)[0]; | |
| 3952 int cmp = OPERAND(scan)[1]; | |
| 3953 pos_T *pos; | |
| 3954 | |
| 3955 pos = getmark(mark, FALSE); | |
| 1148 | 3956 if (pos == NULL /* mark doesn't exist */ |
| 639 | 3957 || pos->lnum <= 0 /* mark isn't set (in curbuf) */ |
| 3958 || (pos->lnum == reglnum + reg_firstlnum | |
| 3959 ? (pos->col == (colnr_T)(reginput - regline) | |
| 3960 ? (cmp == '<' || cmp == '>') | |
| 3961 : (pos->col < (colnr_T)(reginput - regline) | |
| 3962 ? cmp != '>' | |
| 3963 : cmp != '<')) | |
| 3964 : (pos->lnum < reglnum + reg_firstlnum | |
| 3965 ? cmp != '>' | |
| 3966 : cmp != '<'))) | |
| 3967 status = RA_NOMATCH; | |
| 3968 } | |
| 3969 break; | |
| 3970 | |
| 3971 case RE_VISUAL: | |
| 3972 #ifdef FEAT_VISUAL | |
| 3973 /* Check if the buffer is the current buffer. and whether the | |
| 3974 * position is inside the Visual area. */ | |
| 3975 if (reg_buf != curbuf || VIsual.lnum == 0) | |
| 3976 status = RA_NOMATCH; | |
| 3977 else | |
| 3978 { | |
| 3979 pos_T top, bot; | |
| 3980 linenr_T lnum; | |
| 3981 colnr_T col; | |
| 3982 win_T *wp = reg_win == NULL ? curwin : reg_win; | |
| 3983 int mode; | |
| 3984 | |
| 3985 if (VIsual_active) | |
| 3986 { | |
| 3987 if (lt(VIsual, wp->w_cursor)) | |
| 3988 { | |
| 3989 top = VIsual; | |
| 3990 bot = wp->w_cursor; | |
| 3991 } | |
| 3992 else | |
| 3993 { | |
| 3994 top = wp->w_cursor; | |
| 3995 bot = VIsual; | |
| 3996 } | |
| 3997 mode = VIsual_mode; | |
| 3998 } | |
| 3999 else | |
| 4000 { | |
| 692 | 4001 if (lt(curbuf->b_visual.vi_start, curbuf->b_visual.vi_end)) |
| 685 | 4002 { |
| 692 | 4003 top = curbuf->b_visual.vi_start; |
| 4004 bot = curbuf->b_visual.vi_end; | |
| 685 | 4005 } |
| 4006 else | |
| 4007 { | |
| 692 | 4008 top = curbuf->b_visual.vi_end; |
| 4009 bot = curbuf->b_visual.vi_start; | |
| 685 | 4010 } |
| 692 | 4011 mode = curbuf->b_visual.vi_mode; |
| 639 | 4012 } |
| 4013 lnum = reglnum + reg_firstlnum; | |
| 4014 col = (colnr_T)(reginput - regline); | |
| 4015 if (lnum < top.lnum || lnum > bot.lnum) | |
| 4016 status = RA_NOMATCH; | |
| 4017 else if (mode == 'v') | |
| 4018 { | |
| 4019 if ((lnum == top.lnum && col < top.col) | |
| 4020 || (lnum == bot.lnum | |
| 4021 && col >= bot.col + (*p_sel != 'e'))) | |
| 4022 status = RA_NOMATCH; | |
| 4023 } | |
| 4024 else if (mode == Ctrl_V) | |
| 4025 { | |
| 4026 colnr_T start, end; | |
| 4027 colnr_T start2, end2; | |
| 944 | 4028 colnr_T cols; |
| 639 | 4029 |
| 4030 getvvcol(wp, &top, &start, NULL, &end); | |
| 4031 getvvcol(wp, &bot, &start2, NULL, &end2); | |
| 4032 if (start2 < start) | |
| 4033 start = start2; | |
| 4034 if (end2 > end) | |
| 4035 end = end2; | |
| 4036 if (top.col == MAXCOL || bot.col == MAXCOL) | |
| 4037 end = MAXCOL; | |
| 944 | 4038 cols = win_linetabsize(wp, |
| 639 | 4039 regline, (colnr_T)(reginput - regline)); |
| 944 | 4040 if (cols < start || cols > end - (*p_sel == 'e')) |
| 639 | 4041 status = RA_NOMATCH; |
| 4042 } | |
| 4043 } | |
| 4044 #else | |
| 4045 status = RA_NOMATCH; | |
| 4046 #endif | |
| 4047 break; | |
| 4048 | |
| 7 | 4049 case RE_LNUM: |
| 4050 if (!REG_MULTI || !re_num_cmp((long_u)(reglnum + reg_firstlnum), | |
| 4051 scan)) | |
| 180 | 4052 status = RA_NOMATCH; |
| 7 | 4053 break; |
| 4054 | |
| 4055 case RE_COL: | |
| 4056 if (!re_num_cmp((long_u)(reginput - regline) + 1, scan)) | |
| 180 | 4057 status = RA_NOMATCH; |
| 7 | 4058 break; |
| 4059 | |
| 4060 case RE_VCOL: | |
| 4061 if (!re_num_cmp((long_u)win_linetabsize( | |
| 4062 reg_win == NULL ? curwin : reg_win, | |
| 4063 regline, (colnr_T)(reginput - regline)) + 1, scan)) | |
| 180 | 4064 status = RA_NOMATCH; |
| 7 | 4065 break; |
| 4066 | |
| 4067 case BOW: /* \<word; reginput points to w */ | |
| 4068 if (c == NUL) /* Can't match at end of line */ | |
| 180 | 4069 status = RA_NOMATCH; |
| 7 | 4070 #ifdef FEAT_MBYTE |
| 180 | 4071 else if (has_mbyte) |
| 7 | 4072 { |
| 4073 int this_class; | |
| 4074 | |
| 4075 /* Get class of current and previous char (if it exists). */ | |
| 4076 this_class = mb_get_class(reginput); | |
| 4077 if (this_class <= 1) | |
| 180 | 4078 status = RA_NOMATCH; /* not on a word at all */ |
| 4079 else if (reg_prev_class() == this_class) | |
| 4080 status = RA_NOMATCH; /* previous char is in same word */ | |
| 7 | 4081 } |
| 4082 #endif | |
| 4083 else | |
| 4084 { | |
| 4085 if (!vim_iswordc(c) | |
| 4086 || (reginput > regline && vim_iswordc(reginput[-1]))) | |
| 180 | 4087 status = RA_NOMATCH; |
| 7 | 4088 } |
| 4089 break; | |
| 4090 | |
| 4091 case EOW: /* word\>; reginput points after d */ | |
| 4092 if (reginput == regline) /* Can't match at start of line */ | |
| 180 | 4093 status = RA_NOMATCH; |
| 7 | 4094 #ifdef FEAT_MBYTE |
| 180 | 4095 else if (has_mbyte) |
| 7 | 4096 { |
| 4097 int this_class, prev_class; | |
| 4098 | |
| 4099 /* Get class of current and previous char (if it exists). */ | |
| 4100 this_class = mb_get_class(reginput); | |
| 4101 prev_class = reg_prev_class(); | |
| 180 | 4102 if (this_class == prev_class |
| 4103 || prev_class == 0 || prev_class == 1) | |
| 4104 status = RA_NOMATCH; | |
| 7 | 4105 } |
| 180 | 4106 #endif |
| 7 | 4107 else |
| 4108 { | |
| 180 | 4109 if (!vim_iswordc(reginput[-1]) |
| 4110 || (reginput[0] != NUL && vim_iswordc(c))) | |
| 4111 status = RA_NOMATCH; | |
| 7 | 4112 } |
| 4113 break; /* Matched with EOW */ | |
| 4114 | |
| 4115 case ANY: | |
| 4116 if (c == NUL) | |
| 180 | 4117 status = RA_NOMATCH; |
| 4118 else | |
| 4119 ADVANCE_REGINPUT(); | |
| 7 | 4120 break; |
| 4121 | |
| 4122 case IDENT: | |
| 4123 if (!vim_isIDc(c)) | |
| 180 | 4124 status = RA_NOMATCH; |
| 4125 else | |
| 4126 ADVANCE_REGINPUT(); | |
| 7 | 4127 break; |
| 4128 | |
| 4129 case SIDENT: | |
| 4130 if (VIM_ISDIGIT(*reginput) || !vim_isIDc(c)) | |
| 180 | 4131 status = RA_NOMATCH; |
| 4132 else | |
| 4133 ADVANCE_REGINPUT(); | |
| 7 | 4134 break; |
| 4135 | |
| 4136 case KWORD: | |
| 4137 if (!vim_iswordp(reginput)) | |
| 180 | 4138 status = RA_NOMATCH; |
| 4139 else | |
| 4140 ADVANCE_REGINPUT(); | |
| 7 | 4141 break; |
| 4142 | |
| 4143 case SKWORD: | |
| 4144 if (VIM_ISDIGIT(*reginput) || !vim_iswordp(reginput)) | |
| 180 | 4145 status = RA_NOMATCH; |
| 4146 else | |
| 4147 ADVANCE_REGINPUT(); | |
| 7 | 4148 break; |
| 4149 | |
| 4150 case FNAME: | |
| 4151 if (!vim_isfilec(c)) | |
| 180 | 4152 status = RA_NOMATCH; |
| 4153 else | |
| 4154 ADVANCE_REGINPUT(); | |
| 7 | 4155 break; |
| 4156 | |
| 4157 case SFNAME: | |
| 4158 if (VIM_ISDIGIT(*reginput) || !vim_isfilec(c)) | |
| 180 | 4159 status = RA_NOMATCH; |
| 4160 else | |
| 4161 ADVANCE_REGINPUT(); | |
| 7 | 4162 break; |
| 4163 | |
| 4164 case PRINT: | |
| 4165 if (ptr2cells(reginput) != 1) | |
| 180 | 4166 status = RA_NOMATCH; |
| 4167 else | |
| 4168 ADVANCE_REGINPUT(); | |
| 7 | 4169 break; |
| 4170 | |
| 4171 case SPRINT: | |
| 4172 if (VIM_ISDIGIT(*reginput) || ptr2cells(reginput) != 1) | |
| 180 | 4173 status = RA_NOMATCH; |
| 4174 else | |
| 4175 ADVANCE_REGINPUT(); | |
| 7 | 4176 break; |
| 4177 | |
| 4178 case WHITE: | |
| 4179 if (!vim_iswhite(c)) | |
| 180 | 4180 status = RA_NOMATCH; |
| 4181 else | |
| 4182 ADVANCE_REGINPUT(); | |
| 7 | 4183 break; |
| 4184 | |
| 4185 case NWHITE: | |
| 4186 if (c == NUL || vim_iswhite(c)) | |
| 180 | 4187 status = RA_NOMATCH; |
| 4188 else | |
| 4189 ADVANCE_REGINPUT(); | |
| 7 | 4190 break; |
| 4191 | |
| 4192 case DIGIT: | |
| 4193 if (!ri_digit(c)) | |
| 180 | 4194 status = RA_NOMATCH; |
| 4195 else | |
| 4196 ADVANCE_REGINPUT(); | |
| 7 | 4197 break; |
| 4198 | |
| 4199 case NDIGIT: | |
| 4200 if (c == NUL || ri_digit(c)) | |
| 180 | 4201 status = RA_NOMATCH; |
| 4202 else | |
| 4203 ADVANCE_REGINPUT(); | |
| 7 | 4204 break; |
| 4205 | |
| 4206 case HEX: | |
| 4207 if (!ri_hex(c)) | |
| 180 | 4208 status = RA_NOMATCH; |
| 4209 else | |
| 4210 ADVANCE_REGINPUT(); | |
| 7 | 4211 break; |
| 4212 | |
| 4213 case NHEX: | |
| 4214 if (c == NUL || ri_hex(c)) | |
| 180 | 4215 status = RA_NOMATCH; |
| 4216 else | |
| 4217 ADVANCE_REGINPUT(); | |
| 7 | 4218 break; |
| 4219 | |
| 4220 case OCTAL: | |
| 4221 if (!ri_octal(c)) | |
| 180 | 4222 status = RA_NOMATCH; |
| 4223 else | |
| 4224 ADVANCE_REGINPUT(); | |
| 7 | 4225 break; |
| 4226 | |
| 4227 case NOCTAL: | |
| 4228 if (c == NUL || ri_octal(c)) | |
| 180 | 4229 status = RA_NOMATCH; |
| 4230 else | |
| 4231 ADVANCE_REGINPUT(); | |
| 7 | 4232 break; |
| 4233 | |
| 4234 case WORD: | |
| 4235 if (!ri_word(c)) | |
| 180 | 4236 status = RA_NOMATCH; |
| 4237 else | |
| 4238 ADVANCE_REGINPUT(); | |
| 7 | 4239 break; |
| 4240 | |
| 4241 case NWORD: | |
| 4242 if (c == NUL || ri_word(c)) | |
| 180 | 4243 status = RA_NOMATCH; |
| 4244 else | |
| 4245 ADVANCE_REGINPUT(); | |
| 7 | 4246 break; |
| 4247 | |
| 4248 case HEAD: | |
| 4249 if (!ri_head(c)) | |
| 180 | 4250 status = RA_NOMATCH; |
| 4251 else | |
| 4252 ADVANCE_REGINPUT(); | |
| 7 | 4253 break; |
| 4254 | |
| 4255 case NHEAD: | |
| 4256 if (c == NUL || ri_head(c)) | |
| 180 | 4257 status = RA_NOMATCH; |
| 4258 else | |
| 4259 ADVANCE_REGINPUT(); | |
| 7 | 4260 break; |
| 4261 | |
| 4262 case ALPHA: | |
| 4263 if (!ri_alpha(c)) | |
| 180 | 4264 status = RA_NOMATCH; |
| 4265 else | |
| 4266 ADVANCE_REGINPUT(); | |
| 7 | 4267 break; |
| 4268 | |
| 4269 case NALPHA: | |
| 4270 if (c == NUL || ri_alpha(c)) | |
| 180 | 4271 status = RA_NOMATCH; |
| 4272 else | |
| 4273 ADVANCE_REGINPUT(); | |
| 7 | 4274 break; |
| 4275 | |
| 4276 case LOWER: | |
| 4277 if (!ri_lower(c)) | |
| 180 | 4278 status = RA_NOMATCH; |
| 4279 else | |
| 4280 ADVANCE_REGINPUT(); | |
| 7 | 4281 break; |
| 4282 | |
| 4283 case NLOWER: | |
| 4284 if (c == NUL || ri_lower(c)) | |
| 180 | 4285 status = RA_NOMATCH; |
| 4286 else | |
| 4287 ADVANCE_REGINPUT(); | |
| 7 | 4288 break; |
| 4289 | |
| 4290 case UPPER: | |
| 4291 if (!ri_upper(c)) | |
| 180 | 4292 status = RA_NOMATCH; |
| 4293 else | |
| 4294 ADVANCE_REGINPUT(); | |
| 7 | 4295 break; |
| 4296 | |
| 4297 case NUPPER: | |
| 4298 if (c == NUL || ri_upper(c)) | |
| 180 | 4299 status = RA_NOMATCH; |
| 4300 else | |
| 4301 ADVANCE_REGINPUT(); | |
| 7 | 4302 break; |
| 4303 | |
| 4304 case EXACTLY: | |
| 4305 { | |
| 4306 int len; | |
| 4307 char_u *opnd; | |
| 4308 | |
| 4309 opnd = OPERAND(scan); | |
| 4310 /* Inline the first byte, for speed. */ | |
| 4311 if (*opnd != *reginput | |
| 4312 && (!ireg_ic || ( | |
| 4313 #ifdef FEAT_MBYTE | |
| 4314 !enc_utf8 && | |
| 4315 #endif | |
| 1347 | 4316 MB_TOLOWER(*opnd) != MB_TOLOWER(*reginput)))) |
| 180 | 4317 status = RA_NOMATCH; |
| 4318 else if (*opnd == NUL) | |
| 7 | 4319 { |
| 4320 /* match empty string always works; happens when "~" is | |
| 4321 * empty. */ | |
| 4322 } | |
| 4323 else if (opnd[1] == NUL | |
| 4324 #ifdef FEAT_MBYTE | |
| 4325 && !(enc_utf8 && ireg_ic) | |
| 4326 #endif | |
| 4327 ) | |
| 4328 ++reginput; /* matched a single char */ | |
| 4329 else | |
| 4330 { | |
| 4331 len = (int)STRLEN(opnd); | |
| 4332 /* Need to match first byte again for multi-byte. */ | |
| 4333 if (cstrncmp(opnd, reginput, &len) != 0) | |
| 180 | 4334 status = RA_NOMATCH; |
| 7 | 4335 #ifdef FEAT_MBYTE |
| 4336 /* Check for following composing character. */ | |
| 180 | 4337 else if (enc_utf8 |
| 4338 && UTF_COMPOSINGLIKE(reginput, reginput + len)) | |
| 7 | 4339 { |
| 4340 /* raaron: This code makes a composing character get | |
| 4341 * ignored, which is the correct behavior (sometimes) | |
| 4342 * for voweled Hebrew texts. */ | |
| 4343 if (!ireg_icombine) | |
| 180 | 4344 status = RA_NOMATCH; |
| 7 | 4345 } |
| 180 | 4346 #endif |
| 7 | 4347 else |
| 180 | 4348 reginput += len; |
| 7 | 4349 } |
| 4350 } | |
| 4351 break; | |
| 4352 | |
| 4353 case ANYOF: | |
| 4354 case ANYBUT: | |
| 4355 if (c == NUL) | |
| 180 | 4356 status = RA_NOMATCH; |
| 4357 else if ((cstrchr(OPERAND(scan), c) == NULL) == (op == ANYOF)) | |
| 4358 status = RA_NOMATCH; | |
| 4359 else | |
| 4360 ADVANCE_REGINPUT(); | |
| 7 | 4361 break; |
| 4362 | |
| 4363 #ifdef FEAT_MBYTE | |
| 4364 case MULTIBYTECODE: | |
| 4365 if (has_mbyte) | |
| 4366 { | |
| 4367 int i, len; | |
| 4368 char_u *opnd; | |
| 944 | 4369 int opndc = 0, inpc; |
| 7 | 4370 |
| 4371 opnd = OPERAND(scan); | |
| 4372 /* Safety check (just in case 'encoding' was changed since | |
| 4373 * compiling the program). */ | |
| 474 | 4374 if ((len = (*mb_ptr2len)(opnd)) < 2) |
| 180 | 4375 { |
| 4376 status = RA_NOMATCH; | |
| 4377 break; | |
| 4378 } | |
| 714 | 4379 if (enc_utf8) |
| 4380 opndc = mb_ptr2char(opnd); | |
| 4381 if (enc_utf8 && utf_iscomposing(opndc)) | |
| 4382 { | |
| 4383 /* When only a composing char is given match at any | |
| 4384 * position where that composing char appears. */ | |
| 4385 status = RA_NOMATCH; | |
| 4386 for (i = 0; reginput[i] != NUL; i += utf_char2len(inpc)) | |
| 180 | 4387 { |
| 714 | 4388 inpc = mb_ptr2char(reginput + i); |
| 4389 if (!utf_iscomposing(inpc)) | |
| 4390 { | |
| 4391 if (i > 0) | |
| 4392 break; | |
| 4393 } | |
| 4394 else if (opndc == inpc) | |
| 4395 { | |
| 4396 /* Include all following composing chars. */ | |
| 4397 len = i + mb_ptr2len(reginput + i); | |
| 4398 status = RA_MATCH; | |
| 4399 break; | |
| 4400 } | |
| 180 | 4401 } |
| 714 | 4402 } |
| 4403 else | |
| 4404 for (i = 0; i < len; ++i) | |
| 4405 if (opnd[i] != reginput[i]) | |
| 4406 { | |
| 4407 status = RA_NOMATCH; | |
| 4408 break; | |
| 4409 } | |
| 7 | 4410 reginput += len; |
| 4411 } | |
| 4412 else | |
| 180 | 4413 status = RA_NOMATCH; |
| 7 | 4414 break; |
| 4415 #endif | |
| 4416 | |
| 4417 case NOTHING: | |
| 4418 break; | |
| 4419 | |
| 4420 case BACK: | |
| 233 | 4421 { |
| 4422 int i; | |
| 4423 backpos_T *bp; | |
| 4424 | |
| 4425 /* | |
| 4426 * When we run into BACK we need to check if we don't keep | |
| 4427 * looping without matching any input. The second and later | |
| 4428 * times a BACK is encountered it fails if the input is still | |
| 4429 * at the same position as the previous time. | |
| 4430 * The positions are stored in "backpos" and found by the | |
| 4431 * current value of "scan", the position in the RE program. | |
| 4432 */ | |
| 4433 bp = (backpos_T *)backpos.ga_data; | |
| 4434 for (i = 0; i < backpos.ga_len; ++i) | |
| 4435 if (bp[i].bp_scan == scan) | |
| 4436 break; | |
| 4437 if (i == backpos.ga_len) | |
| 4438 { | |
| 4439 /* First time at this BACK, make room to store the pos. */ | |
| 4440 if (ga_grow(&backpos, 1) == FAIL) | |
| 4441 status = RA_FAIL; | |
| 4442 else | |
| 4443 { | |
| 4444 /* get "ga_data" again, it may have changed */ | |
| 4445 bp = (backpos_T *)backpos.ga_data; | |
| 4446 bp[i].bp_scan = scan; | |
| 4447 ++backpos.ga_len; | |
| 4448 } | |
| 4449 } | |
| 4450 else if (reg_save_equal(&bp[i].bp_pos)) | |
| 4451 /* Still at same position as last time, fail. */ | |
| 4452 status = RA_NOMATCH; | |
| 4453 | |
| 4454 if (status != RA_FAIL && status != RA_NOMATCH) | |
| 4455 reg_save(&bp[i].bp_pos, &backpos); | |
| 4456 } | |
| 179 | 4457 break; |
| 4458 | |
| 7 | 4459 case MOPEN + 0: /* Match start: \zs */ |
| 4460 case MOPEN + 1: /* \( */ | |
| 4461 case MOPEN + 2: | |
| 4462 case MOPEN + 3: | |
| 4463 case MOPEN + 4: | |
| 4464 case MOPEN + 5: | |
| 4465 case MOPEN + 6: | |
| 4466 case MOPEN + 7: | |
| 4467 case MOPEN + 8: | |
| 4468 case MOPEN + 9: | |
| 4469 { | |
| 4470 no = op - MOPEN; | |
| 4471 cleanup_subexpr(); | |
| 270 | 4472 rp = regstack_push(RS_MOPEN, scan); |
| 180 | 4473 if (rp == NULL) |
| 4474 status = RA_FAIL; | |
| 4475 else | |
| 4476 { | |
| 4477 rp->rs_no = no; | |
| 4478 save_se(&rp->rs_un.sesave, ®_startpos[no], | |
| 4479 ®_startp[no]); | |
| 4480 /* We simply continue and handle the result when done. */ | |
| 4481 } | |
| 7 | 4482 } |
| 180 | 4483 break; |
| 7 | 4484 |
| 4485 case NOPEN: /* \%( */ | |
| 4486 case NCLOSE: /* \) after \%( */ | |
| 270 | 4487 if (regstack_push(RS_NOPEN, scan) == NULL) |
| 180 | 4488 status = RA_FAIL; |
| 4489 /* We simply continue and handle the result when done. */ | |
| 4490 break; | |
| 7 | 4491 |
| 4492 #ifdef FEAT_SYN_HL | |
| 4493 case ZOPEN + 1: | |
| 4494 case ZOPEN + 2: | |
| 4495 case ZOPEN + 3: | |
| 4496 case ZOPEN + 4: | |
| 4497 case ZOPEN + 5: | |
| 4498 case ZOPEN + 6: | |
| 4499 case ZOPEN + 7: | |
| 4500 case ZOPEN + 8: | |
| 4501 case ZOPEN + 9: | |
| 4502 { | |
| 4503 no = op - ZOPEN; | |
| 4504 cleanup_zsubexpr(); | |
| 270 | 4505 rp = regstack_push(RS_ZOPEN, scan); |
| 180 | 4506 if (rp == NULL) |
| 4507 status = RA_FAIL; | |
| 4508 else | |
| 4509 { | |
| 4510 rp->rs_no = no; | |
| 4511 save_se(&rp->rs_un.sesave, ®_startzpos[no], | |
| 4512 ®_startzp[no]); | |
| 4513 /* We simply continue and handle the result when done. */ | |
| 4514 } | |
| 7 | 4515 } |
| 180 | 4516 break; |
| 7 | 4517 #endif |
| 4518 | |
| 4519 case MCLOSE + 0: /* Match end: \ze */ | |
| 4520 case MCLOSE + 1: /* \) */ | |
| 4521 case MCLOSE + 2: | |
| 4522 case MCLOSE + 3: | |
| 4523 case MCLOSE + 4: | |
| 4524 case MCLOSE + 5: | |
| 4525 case MCLOSE + 6: | |
| 4526 case MCLOSE + 7: | |
| 4527 case MCLOSE + 8: | |
| 4528 case MCLOSE + 9: | |
| 4529 { | |
| 4530 no = op - MCLOSE; | |
| 4531 cleanup_subexpr(); | |
| 270 | 4532 rp = regstack_push(RS_MCLOSE, scan); |
| 180 | 4533 if (rp == NULL) |
| 4534 status = RA_FAIL; | |
| 4535 else | |
| 4536 { | |
| 4537 rp->rs_no = no; | |
| 4538 save_se(&rp->rs_un.sesave, ®_endpos[no], ®_endp[no]); | |
| 4539 /* We simply continue and handle the result when done. */ | |
| 4540 } | |
| 7 | 4541 } |
| 180 | 4542 break; |
| 7 | 4543 |
| 4544 #ifdef FEAT_SYN_HL | |
| 4545 case ZCLOSE + 1: /* \) after \z( */ | |
| 4546 case ZCLOSE + 2: | |
| 4547 case ZCLOSE + 3: | |
| 4548 case ZCLOSE + 4: | |
| 4549 case ZCLOSE + 5: | |
| 4550 case ZCLOSE + 6: | |
| 4551 case ZCLOSE + 7: | |
| 4552 case ZCLOSE + 8: | |
| 4553 case ZCLOSE + 9: | |
| 4554 { | |
| 4555 no = op - ZCLOSE; | |
| 4556 cleanup_zsubexpr(); | |
| 270 | 4557 rp = regstack_push(RS_ZCLOSE, scan); |
| 180 | 4558 if (rp == NULL) |
| 4559 status = RA_FAIL; | |
| 4560 else | |
| 4561 { | |
| 4562 rp->rs_no = no; | |
| 4563 save_se(&rp->rs_un.sesave, ®_endzpos[no], | |
| 4564 ®_endzp[no]); | |
| 4565 /* We simply continue and handle the result when done. */ | |
| 4566 } | |
| 7 | 4567 } |
| 180 | 4568 break; |
| 7 | 4569 #endif |
| 4570 | |
| 4571 case BACKREF + 1: | |
| 4572 case BACKREF + 2: | |
| 4573 case BACKREF + 3: | |
| 4574 case BACKREF + 4: | |
| 4575 case BACKREF + 5: | |
| 4576 case BACKREF + 6: | |
| 4577 case BACKREF + 7: | |
| 4578 case BACKREF + 8: | |
| 4579 case BACKREF + 9: | |
| 4580 { | |
| 4581 int len; | |
| 4582 linenr_T clnum; | |
| 4583 colnr_T ccol; | |
| 4584 char_u *p; | |
| 4585 | |
| 4586 no = op - BACKREF; | |
| 4587 cleanup_subexpr(); | |
| 4588 if (!REG_MULTI) /* Single-line regexp */ | |
| 4589 { | |
| 1815 | 4590 if (reg_startp[no] == NULL || reg_endp[no] == NULL) |
| 7 | 4591 { |
| 4592 /* Backref was not set: Match an empty string. */ | |
| 4593 len = 0; | |
| 4594 } | |
| 4595 else | |
| 4596 { | |
| 4597 /* Compare current input with back-ref in the same | |
| 4598 * line. */ | |
| 4599 len = (int)(reg_endp[no] - reg_startp[no]); | |
| 4600 if (cstrncmp(reg_startp[no], reginput, &len) != 0) | |
| 180 | 4601 status = RA_NOMATCH; |
| 7 | 4602 } |
| 4603 } | |
| 4604 else /* Multi-line regexp */ | |
| 4605 { | |
| 1815 | 4606 if (reg_startpos[no].lnum < 0 || reg_endpos[no].lnum < 0) |
| 7 | 4607 { |
| 4608 /* Backref was not set: Match an empty string. */ | |
| 4609 len = 0; | |
| 4610 } | |
| 4611 else | |
| 4612 { | |
| 4613 if (reg_startpos[no].lnum == reglnum | |
| 4614 && reg_endpos[no].lnum == reglnum) | |
| 4615 { | |
| 4616 /* Compare back-ref within the current line. */ | |
| 4617 len = reg_endpos[no].col - reg_startpos[no].col; | |
| 4618 if (cstrncmp(regline + reg_startpos[no].col, | |
| 4619 reginput, &len) != 0) | |
| 180 | 4620 status = RA_NOMATCH; |
| 7 | 4621 } |
| 4622 else | |
| 4623 { | |
| 4624 /* Messy situation: Need to compare between two | |
| 4625 * lines. */ | |
| 4626 ccol = reg_startpos[no].col; | |
| 4627 clnum = reg_startpos[no].lnum; | |
| 4628 for (;;) | |
| 4629 { | |
| 4630 /* Since getting one line may invalidate | |
| 4631 * the other, need to make copy. Slow! */ | |
| 4632 if (regline != reg_tofree) | |
| 4633 { | |
| 4634 len = (int)STRLEN(regline); | |
| 4635 if (reg_tofree == NULL | |
| 4636 || len >= (int)reg_tofreelen) | |
| 4637 { | |
| 4638 len += 50; /* get some extra */ | |
| 4639 vim_free(reg_tofree); | |
| 4640 reg_tofree = alloc(len); | |
| 4641 if (reg_tofree == NULL) | |
| 180 | 4642 { |
| 4643 status = RA_FAIL; /* outof memory!*/ | |
| 4644 break; | |
| 4645 } | |
| 7 | 4646 reg_tofreelen = len; |
| 4647 } | |
| 4648 STRCPY(reg_tofree, regline); | |
| 4649 reginput = reg_tofree | |
| 4650 + (reginput - regline); | |
| 4651 regline = reg_tofree; | |
| 4652 } | |
| 4653 | |
| 4654 /* Get the line to compare with. */ | |
| 4655 p = reg_getline(clnum); | |
| 4656 if (clnum == reg_endpos[no].lnum) | |
| 4657 len = reg_endpos[no].col - ccol; | |
| 4658 else | |
| 4659 len = (int)STRLEN(p + ccol); | |
| 4660 | |
| 4661 if (cstrncmp(p + ccol, reginput, &len) != 0) | |
| 180 | 4662 { |
| 4663 status = RA_NOMATCH; /* doesn't match */ | |
| 4664 break; | |
| 4665 } | |
| 7 | 4666 if (clnum == reg_endpos[no].lnum) |
| 4667 break; /* match and at end! */ | |
| 481 | 4668 if (reglnum >= reg_maxline) |
| 180 | 4669 { |
| 4670 status = RA_NOMATCH; /* text too short */ | |
| 4671 break; | |
| 4672 } | |
| 7 | 4673 |
| 4674 /* Advance to next line. */ | |
| 4675 reg_nextline(); | |
| 4676 ++clnum; | |
| 4677 ccol = 0; | |
| 180 | 4678 if (got_int) |
| 4679 { | |
| 4680 status = RA_FAIL; | |
| 4681 break; | |
| 4682 } | |
| 7 | 4683 } |
| 4684 | |
| 4685 /* found a match! Note that regline may now point | |
| 4686 * to a copy of the line, that should not matter. */ | |
| 4687 } | |
| 4688 } | |
| 4689 } | |
| 4690 | |
| 4691 /* Matched the backref, skip over it. */ | |
| 4692 reginput += len; | |
| 4693 } | |
| 4694 break; | |
| 4695 | |
| 4696 #ifdef FEAT_SYN_HL | |
| 4697 case ZREF + 1: | |
| 4698 case ZREF + 2: | |
| 4699 case ZREF + 3: | |
| 4700 case ZREF + 4: | |
| 4701 case ZREF + 5: | |
| 4702 case ZREF + 6: | |
| 4703 case ZREF + 7: | |
| 4704 case ZREF + 8: | |
| 4705 case ZREF + 9: | |
| 4706 { | |
| 4707 int len; | |
| 4708 | |
| 4709 cleanup_zsubexpr(); | |
| 4710 no = op - ZREF; | |
| 4711 if (re_extmatch_in != NULL | |
| 4712 && re_extmatch_in->matches[no] != NULL) | |
| 4713 { | |
| 4714 len = (int)STRLEN(re_extmatch_in->matches[no]); | |
| 4715 if (cstrncmp(re_extmatch_in->matches[no], | |
| 4716 reginput, &len) != 0) | |
| 180 | 4717 status = RA_NOMATCH; |
| 4718 else | |
| 4719 reginput += len; | |
| 7 | 4720 } |
| 4721 else | |
| 4722 { | |
| 4723 /* Backref was not set: Match an empty string. */ | |
| 4724 } | |
| 4725 } | |
| 4726 break; | |
| 4727 #endif | |
| 4728 | |
| 4729 case BRANCH: | |
| 4730 { | |
| 4731 if (OP(next) != BRANCH) /* No choice. */ | |
| 4732 next = OPERAND(scan); /* Avoid recursion. */ | |
| 4733 else | |
| 4734 { | |
| 270 | 4735 rp = regstack_push(RS_BRANCH, scan); |
| 180 | 4736 if (rp == NULL) |
| 4737 status = RA_FAIL; | |
| 4738 else | |
| 4739 status = RA_BREAK; /* rest is below */ | |
| 7 | 4740 } |
| 4741 } | |
| 4742 break; | |
| 4743 | |
| 4744 case BRACE_LIMITS: | |
| 4745 { | |
| 4746 if (OP(next) == BRACE_SIMPLE) | |
| 4747 { | |
| 4748 bl_minval = OPERAND_MIN(scan); | |
| 4749 bl_maxval = OPERAND_MAX(scan); | |
| 4750 } | |
| 4751 else if (OP(next) >= BRACE_COMPLEX | |
| 4752 && OP(next) < BRACE_COMPLEX + 10) | |
| 4753 { | |
| 4754 no = OP(next) - BRACE_COMPLEX; | |
| 4755 brace_min[no] = OPERAND_MIN(scan); | |
| 4756 brace_max[no] = OPERAND_MAX(scan); | |
| 4757 brace_count[no] = 0; | |
| 4758 } | |
| 4759 else | |
| 4760 { | |
| 4761 EMSG(_(e_internal)); /* Shouldn't happen */ | |
| 180 | 4762 status = RA_FAIL; |
| 7 | 4763 } |
| 4764 } | |
| 4765 break; | |
| 4766 | |
| 4767 case BRACE_COMPLEX + 0: | |
| 4768 case BRACE_COMPLEX + 1: | |
| 4769 case BRACE_COMPLEX + 2: | |
| 4770 case BRACE_COMPLEX + 3: | |
| 4771 case BRACE_COMPLEX + 4: | |
| 4772 case BRACE_COMPLEX + 5: | |
| 4773 case BRACE_COMPLEX + 6: | |
| 4774 case BRACE_COMPLEX + 7: | |
| 4775 case BRACE_COMPLEX + 8: | |
| 4776 case BRACE_COMPLEX + 9: | |
| 4777 { | |
| 4778 no = op - BRACE_COMPLEX; | |
| 4779 ++brace_count[no]; | |
| 4780 | |
| 4781 /* If not matched enough times yet, try one more */ | |
| 4782 if (brace_count[no] <= (brace_min[no] <= brace_max[no] | |
| 180 | 4783 ? brace_min[no] : brace_max[no])) |
| 7 | 4784 { |
| 270 | 4785 rp = regstack_push(RS_BRCPLX_MORE, scan); |
| 180 | 4786 if (rp == NULL) |
| 4787 status = RA_FAIL; | |
| 4788 else | |
| 4789 { | |
| 4790 rp->rs_no = no; | |
| 233 | 4791 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 4792 next = OPERAND(scan); |
| 4793 /* We continue and handle the result when done. */ | |
| 4794 } | |
| 4795 break; | |
| 7 | 4796 } |
| 4797 | |
| 4798 /* If matched enough times, may try matching some more */ | |
| 4799 if (brace_min[no] <= brace_max[no]) | |
| 4800 { | |
| 4801 /* Range is the normal way around, use longest match */ | |
| 4802 if (brace_count[no] <= brace_max[no]) | |
| 4803 { | |
| 270 | 4804 rp = regstack_push(RS_BRCPLX_LONG, scan); |
| 180 | 4805 if (rp == NULL) |
| 4806 status = RA_FAIL; | |
| 4807 else | |
| 4808 { | |
| 4809 rp->rs_no = no; | |
| 233 | 4810 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 4811 next = OPERAND(scan); |
| 4812 /* We continue and handle the result when done. */ | |
| 4813 } | |
| 7 | 4814 } |
| 4815 } | |
| 4816 else | |
| 4817 { | |
| 4818 /* Range is backwards, use shortest match first */ | |
| 4819 if (brace_count[no] <= brace_min[no]) | |
| 4820 { | |
| 270 | 4821 rp = regstack_push(RS_BRCPLX_SHORT, scan); |
| 180 | 4822 if (rp == NULL) |
| 4823 status = RA_FAIL; | |
| 4824 else | |
| 4825 { | |
| 233 | 4826 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 4827 /* We continue and handle the result when done. */ |
| 4828 } | |
| 7 | 4829 } |
| 4830 } | |
| 4831 } | |
| 4832 break; | |
| 4833 | |
| 4834 case BRACE_SIMPLE: | |
| 4835 case STAR: | |
| 4836 case PLUS: | |
| 4837 { | |
| 180 | 4838 regstar_T rst; |
| 7 | 4839 |
| 4840 /* | |
| 4841 * Lookahead to avoid useless match attempts when we know | |
| 4842 * what character comes next. | |
| 4843 */ | |
| 4844 if (OP(next) == EXACTLY) | |
| 4845 { | |
| 180 | 4846 rst.nextb = *OPERAND(next); |
| 7 | 4847 if (ireg_ic) |
| 4848 { | |
| 1347 | 4849 if (MB_ISUPPER(rst.nextb)) |
| 4850 rst.nextb_ic = MB_TOLOWER(rst.nextb); | |
| 7 | 4851 else |
| 1347 | 4852 rst.nextb_ic = MB_TOUPPER(rst.nextb); |
| 7 | 4853 } |
| 4854 else | |
| 180 | 4855 rst.nextb_ic = rst.nextb; |
| 7 | 4856 } |
| 4857 else | |
| 4858 { | |
| 180 | 4859 rst.nextb = NUL; |
| 4860 rst.nextb_ic = NUL; | |
| 7 | 4861 } |
| 4862 if (op != BRACE_SIMPLE) | |
| 4863 { | |
| 180 | 4864 rst.minval = (op == STAR) ? 0 : 1; |
| 4865 rst.maxval = MAX_LIMIT; | |
| 7 | 4866 } |
| 4867 else | |
| 4868 { | |
| 180 | 4869 rst.minval = bl_minval; |
| 4870 rst.maxval = bl_maxval; | |
| 7 | 4871 } |
| 4872 | |
| 4873 /* | |
| 4874 * When maxval > minval, try matching as much as possible, up | |
| 4875 * to maxval. When maxval < minval, try matching at least the | |
| 4876 * minimal number (since the range is backwards, that's also | |
| 4877 * maxval!). | |
| 4878 */ | |
| 180 | 4879 rst.count = regrepeat(OPERAND(scan), rst.maxval); |
| 7 | 4880 if (got_int) |
| 180 | 4881 { |
| 4882 status = RA_FAIL; | |
| 4883 break; | |
| 4884 } | |
| 4885 if (rst.minval <= rst.maxval | |
| 4886 ? rst.count >= rst.minval : rst.count >= rst.maxval) | |
| 7 | 4887 { |
| 180 | 4888 /* It could match. Prepare for trying to match what |
| 4889 * follows. The code is below. Parameters are stored in | |
| 4890 * a regstar_T on the regstack. */ | |
| 212 | 4891 if ((long)((unsigned)regstack.ga_len >> 10) >= p_mmp) |
| 189 | 4892 { |
| 4893 EMSG(_(e_maxmempat)); | |
| 4894 status = RA_FAIL; | |
| 4895 } | |
| 4896 else if (ga_grow(®stack, sizeof(regstar_T)) == FAIL) | |
| 180 | 4897 status = RA_FAIL; |
| 4898 else | |
| 7 | 4899 { |
| 180 | 4900 regstack.ga_len += sizeof(regstar_T); |
| 270 | 4901 rp = regstack_push(rst.minval <= rst.maxval |
| 233 | 4902 ? RS_STAR_LONG : RS_STAR_SHORT, scan); |
| 180 | 4903 if (rp == NULL) |
| 4904 status = RA_FAIL; | |
| 4905 else | |
| 7 | 4906 { |
| 180 | 4907 *(((regstar_T *)rp) - 1) = rst; |
| 4908 status = RA_BREAK; /* skip the restore bits */ | |
| 7 | 4909 } |
| 4910 } | |
| 4911 } | |
| 4912 else | |
| 180 | 4913 status = RA_NOMATCH; |
| 4914 | |
| 7 | 4915 } |
| 180 | 4916 break; |
| 7 | 4917 |
| 4918 case NOMATCH: | |
| 4919 case MATCH: | |
| 4920 case SUBPAT: | |
| 270 | 4921 rp = regstack_push(RS_NOMATCH, scan); |
| 180 | 4922 if (rp == NULL) |
| 4923 status = RA_FAIL; | |
| 4924 else | |
| 7 | 4925 { |
| 180 | 4926 rp->rs_no = op; |
| 233 | 4927 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 4928 next = OPERAND(scan); |
| 4929 /* We continue and handle the result when done. */ | |
| 7 | 4930 } |
| 4931 break; | |
| 4932 | |
| 4933 case BEHIND: | |
| 4934 case NOBEHIND: | |
| 180 | 4935 /* Need a bit of room to store extra positions. */ |
| 212 | 4936 if ((long)((unsigned)regstack.ga_len >> 10) >= p_mmp) |
| 189 | 4937 { |
| 4938 EMSG(_(e_maxmempat)); | |
| 4939 status = RA_FAIL; | |
| 4940 } | |
| 4941 else if (ga_grow(®stack, sizeof(regbehind_T)) == FAIL) | |
| 180 | 4942 status = RA_FAIL; |
| 4943 else | |
| 7 | 4944 { |
| 180 | 4945 regstack.ga_len += sizeof(regbehind_T); |
| 270 | 4946 rp = regstack_push(RS_BEHIND1, scan); |
| 180 | 4947 if (rp == NULL) |
| 4948 status = RA_FAIL; | |
| 4949 else | |
| 7 | 4950 { |
| 1579 | 4951 /* Need to save the subexpr to be able to restore them |
| 4952 * when there is a match but we don't use it. */ | |
| 4953 save_subexpr(((regbehind_T *)rp) - 1); | |
| 4954 | |
| 180 | 4955 rp->rs_no = op; |
| 233 | 4956 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 4957 /* First try if what follows matches. If it does then we |
| 4958 * check the behind match by looping. */ | |
| 7 | 4959 } |
| 4960 } | |
| 180 | 4961 break; |
| 7 | 4962 |
| 4963 case BHPOS: | |
| 4964 if (REG_MULTI) | |
| 4965 { | |
| 4966 if (behind_pos.rs_u.pos.col != (colnr_T)(reginput - regline) | |
| 4967 || behind_pos.rs_u.pos.lnum != reglnum) | |
| 180 | 4968 status = RA_NOMATCH; |
| 7 | 4969 } |
| 4970 else if (behind_pos.rs_u.ptr != reginput) | |
| 180 | 4971 status = RA_NOMATCH; |
| 7 | 4972 break; |
| 4973 | |
| 4974 case NEWL: | |
| 1018 | 4975 if ((c != NUL || !REG_MULTI || reglnum > reg_maxline |
| 4976 || reg_line_lbr) && (c != '\n' || !reg_line_lbr)) | |
| 180 | 4977 status = RA_NOMATCH; |
| 4978 else if (reg_line_lbr) | |
| 7 | 4979 ADVANCE_REGINPUT(); |
| 4980 else | |
| 4981 reg_nextline(); | |
| 4982 break; | |
| 4983 | |
| 4984 case END: | |
| 180 | 4985 status = RA_MATCH; /* Success! */ |
| 4986 break; | |
| 7 | 4987 |
| 4988 default: | |
| 4989 EMSG(_(e_re_corr)); | |
| 4990 #ifdef DEBUG | |
| 4991 printf("Illegal op code %d\n", op); | |
| 4992 #endif | |
| 180 | 4993 status = RA_FAIL; |
| 4994 break; | |
| 7 | 4995 } |
| 4996 } | |
| 4997 | |
| 180 | 4998 /* If we can't continue sequentially, break the inner loop. */ |
| 4999 if (status != RA_CONT) | |
| 5000 break; | |
| 5001 | |
| 5002 /* Continue in inner loop, advance to next item. */ | |
| 7 | 5003 scan = next; |
| 180 | 5004 |
| 5005 } /* end of inner loop */ | |
| 7 | 5006 |
| 5007 /* | |
| 180 | 5008 * If there is something on the regstack execute the code for the state. |
| 233 | 5009 * If the state is popped then loop and use the older state. |
| 7 | 5010 */ |
| 180 | 5011 while (regstack.ga_len > 0 && status != RA_FAIL) |
| 5012 { | |
| 5013 rp = (regitem_T *)((char *)regstack.ga_data + regstack.ga_len) - 1; | |
| 5014 switch (rp->rs_state) | |
| 5015 { | |
| 5016 case RS_NOPEN: | |
| 5017 /* Result is passed on as-is, simply pop the state. */ | |
| 270 | 5018 regstack_pop(&scan); |
| 180 | 5019 break; |
| 5020 | |
| 5021 case RS_MOPEN: | |
| 5022 /* Pop the state. Restore pointers when there is no match. */ | |
| 5023 if (status == RA_NOMATCH) | |
| 5024 restore_se(&rp->rs_un.sesave, ®_startpos[rp->rs_no], | |
| 5025 ®_startp[rp->rs_no]); | |
| 270 | 5026 regstack_pop(&scan); |
| 180 | 5027 break; |
| 5028 | |
| 5029 #ifdef FEAT_SYN_HL | |
| 5030 case RS_ZOPEN: | |
| 5031 /* Pop the state. Restore pointers when there is no match. */ | |
| 5032 if (status == RA_NOMATCH) | |
| 5033 restore_se(&rp->rs_un.sesave, ®_startzpos[rp->rs_no], | |
| 5034 ®_startzp[rp->rs_no]); | |
| 270 | 5035 regstack_pop(&scan); |
| 180 | 5036 break; |
| 5037 #endif | |
| 5038 | |
| 5039 case RS_MCLOSE: | |
| 5040 /* Pop the state. Restore pointers when there is no match. */ | |
| 5041 if (status == RA_NOMATCH) | |
| 5042 restore_se(&rp->rs_un.sesave, ®_endpos[rp->rs_no], | |
| 5043 ®_endp[rp->rs_no]); | |
| 270 | 5044 regstack_pop(&scan); |
| 180 | 5045 break; |
| 5046 | |
| 5047 #ifdef FEAT_SYN_HL | |
| 5048 case RS_ZCLOSE: | |
| 5049 /* Pop the state. Restore pointers when there is no match. */ | |
| 5050 if (status == RA_NOMATCH) | |
| 5051 restore_se(&rp->rs_un.sesave, ®_endzpos[rp->rs_no], | |
| 5052 ®_endzp[rp->rs_no]); | |
| 270 | 5053 regstack_pop(&scan); |
| 180 | 5054 break; |
| 5055 #endif | |
| 5056 | |
| 5057 case RS_BRANCH: | |
| 5058 if (status == RA_MATCH) | |
| 5059 /* this branch matched, use it */ | |
| 270 | 5060 regstack_pop(&scan); |
| 180 | 5061 else |
| 5062 { | |
| 5063 if (status != RA_BREAK) | |
| 5064 { | |
| 5065 /* After a non-matching branch: try next one. */ | |
| 233 | 5066 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5067 scan = rp->rs_scan; |
| 5068 } | |
| 5069 if (scan == NULL || OP(scan) != BRANCH) | |
| 5070 { | |
| 5071 /* no more branches, didn't find a match */ | |
| 5072 status = RA_NOMATCH; | |
| 270 | 5073 regstack_pop(&scan); |
| 180 | 5074 } |
| 5075 else | |
| 5076 { | |
| 5077 /* Prepare to try a branch. */ | |
| 5078 rp->rs_scan = regnext(scan); | |
| 233 | 5079 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 5080 scan = OPERAND(scan); |
| 5081 } | |
| 5082 } | |
| 5083 break; | |
| 5084 | |
| 5085 case RS_BRCPLX_MORE: | |
| 5086 /* Pop the state. Restore pointers when there is no match. */ | |
| 5087 if (status == RA_NOMATCH) | |
| 5088 { | |
| 233 | 5089 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5090 --brace_count[rp->rs_no]; /* decrement match count */ |
| 5091 } | |
| 270 | 5092 regstack_pop(&scan); |
| 180 | 5093 break; |
| 5094 | |
| 5095 case RS_BRCPLX_LONG: | |
| 5096 /* Pop the state. Restore pointers when there is no match. */ | |
| 5097 if (status == RA_NOMATCH) | |
| 5098 { | |
| 5099 /* There was no match, but we did find enough matches. */ | |
| 233 | 5100 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5101 --brace_count[rp->rs_no]; |
| 5102 /* continue with the items after "\{}" */ | |
| 5103 status = RA_CONT; | |
| 5104 } | |
| 270 | 5105 regstack_pop(&scan); |
| 180 | 5106 if (status == RA_CONT) |
| 5107 scan = regnext(scan); | |
| 5108 break; | |
| 5109 | |
| 5110 case RS_BRCPLX_SHORT: | |
| 5111 /* Pop the state. Restore pointers when there is no match. */ | |
| 5112 if (status == RA_NOMATCH) | |
| 5113 /* There was no match, try to match one more item. */ | |
| 233 | 5114 reg_restore(&rp->rs_un.regsave, &backpos); |
| 270 | 5115 regstack_pop(&scan); |
| 180 | 5116 if (status == RA_NOMATCH) |
| 5117 { | |
| 5118 scan = OPERAND(scan); | |
| 5119 status = RA_CONT; | |
| 5120 } | |
| 5121 break; | |
| 5122 | |
| 5123 case RS_NOMATCH: | |
| 5124 /* Pop the state. If the operand matches for NOMATCH or | |
| 5125 * doesn't match for MATCH/SUBPAT, we fail. Otherwise backup, | |
| 5126 * except for SUBPAT, and continue with the next item. */ | |
| 5127 if (status == (rp->rs_no == NOMATCH ? RA_MATCH : RA_NOMATCH)) | |
| 5128 status = RA_NOMATCH; | |
| 5129 else | |
| 5130 { | |
| 5131 status = RA_CONT; | |
| 233 | 5132 if (rp->rs_no != SUBPAT) /* zero-width */ |
| 5133 reg_restore(&rp->rs_un.regsave, &backpos); | |
| 180 | 5134 } |
| 270 | 5135 regstack_pop(&scan); |
| 180 | 5136 if (status == RA_CONT) |
| 5137 scan = regnext(scan); | |
| 5138 break; | |
| 5139 | |
| 5140 case RS_BEHIND1: | |
| 5141 if (status == RA_NOMATCH) | |
| 5142 { | |
| 270 | 5143 regstack_pop(&scan); |
| 180 | 5144 regstack.ga_len -= sizeof(regbehind_T); |
| 5145 } | |
| 5146 else | |
| 5147 { | |
| 5148 /* The stuff after BEHIND/NOBEHIND matches. Now try if | |
| 5149 * the behind part does (not) match before the current | |
| 5150 * position in the input. This must be done at every | |
| 5151 * position in the input and checking if the match ends at | |
| 5152 * the current position. */ | |
| 5153 | |
| 5154 /* save the position after the found match for next */ | |
| 233 | 5155 reg_save(&(((regbehind_T *)rp) - 1)->save_after, &backpos); |
| 180 | 5156 |
| 5157 /* start looking for a match with operand at the current | |
| 1209 | 5158 * position. Go back one character until we find the |
| 180 | 5159 * result, hitting the start of the line or the previous |
| 5160 * line (for multi-line matching). | |
| 5161 * Set behind_pos to where the match should end, BHPOS | |
| 5162 * will match it. Save the current value. */ | |
| 5163 (((regbehind_T *)rp) - 1)->save_behind = behind_pos; | |
| 5164 behind_pos = rp->rs_un.regsave; | |
| 5165 | |
| 5166 rp->rs_state = RS_BEHIND2; | |
| 5167 | |
| 233 | 5168 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5169 scan = OPERAND(rp->rs_scan); |
| 5170 } | |
| 5171 break; | |
| 5172 | |
| 5173 case RS_BEHIND2: | |
| 5174 /* | |
| 5175 * Looping for BEHIND / NOBEHIND match. | |
| 5176 */ | |
| 5177 if (status == RA_MATCH && reg_save_equal(&behind_pos)) | |
| 5178 { | |
| 5179 /* found a match that ends where "next" started */ | |
| 5180 behind_pos = (((regbehind_T *)rp) - 1)->save_behind; | |
| 5181 if (rp->rs_no == BEHIND) | |
| 233 | 5182 reg_restore(&(((regbehind_T *)rp) - 1)->save_after, |
| 5183 &backpos); | |
| 180 | 5184 else |
| 1579 | 5185 { |
| 5186 /* But we didn't want a match. Need to restore the | |
| 5187 * subexpr, because what follows matched, so they have | |
| 5188 * been set. */ | |
| 180 | 5189 status = RA_NOMATCH; |
| 1579 | 5190 restore_subexpr(((regbehind_T *)rp) - 1); |
| 5191 } | |
| 270 | 5192 regstack_pop(&scan); |
| 180 | 5193 regstack.ga_len -= sizeof(regbehind_T); |
| 5194 } | |
| 5195 else | |
| 5196 { | |
| 1579 | 5197 /* No match or a match that doesn't end where we want it: Go |
| 5198 * back one character. May go to previous line once. */ | |
| 180 | 5199 no = OK; |
| 5200 if (REG_MULTI) | |
| 5201 { | |
| 5202 if (rp->rs_un.regsave.rs_u.pos.col == 0) | |
| 5203 { | |
| 5204 if (rp->rs_un.regsave.rs_u.pos.lnum | |
| 5205 < behind_pos.rs_u.pos.lnum | |
| 5206 || reg_getline( | |
| 5207 --rp->rs_un.regsave.rs_u.pos.lnum) | |
| 5208 == NULL) | |
| 5209 no = FAIL; | |
| 5210 else | |
| 5211 { | |
| 233 | 5212 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5213 rp->rs_un.regsave.rs_u.pos.col = |
| 5214 (colnr_T)STRLEN(regline); | |
| 5215 } | |
| 5216 } | |
| 5217 else | |
| 5218 --rp->rs_un.regsave.rs_u.pos.col; | |
| 5219 } | |
| 5220 else | |
| 5221 { | |
| 5222 if (rp->rs_un.regsave.rs_u.ptr == regline) | |
| 5223 no = FAIL; | |
| 5224 else | |
| 5225 --rp->rs_un.regsave.rs_u.ptr; | |
| 5226 } | |
| 5227 if (no == OK) | |
| 5228 { | |
| 5229 /* Advanced, prepare for finding match again. */ | |
| 233 | 5230 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5231 scan = OPERAND(rp->rs_scan); |
| 1579 | 5232 if (status == RA_MATCH) |
| 5233 { | |
| 5234 /* We did match, so subexpr may have been changed, | |
| 5235 * need to restore them for the next try. */ | |
| 5236 status = RA_NOMATCH; | |
| 5237 restore_subexpr(((regbehind_T *)rp) - 1); | |
| 5238 } | |
| 180 | 5239 } |
| 5240 else | |
| 5241 { | |
| 5242 /* Can't advance. For NOBEHIND that's a match. */ | |
| 5243 behind_pos = (((regbehind_T *)rp) - 1)->save_behind; | |
| 5244 if (rp->rs_no == NOBEHIND) | |
| 5245 { | |
| 233 | 5246 reg_restore(&(((regbehind_T *)rp) - 1)->save_after, |
| 5247 &backpos); | |
| 180 | 5248 status = RA_MATCH; |
| 5249 } | |
| 5250 else | |
| 1579 | 5251 { |
| 5252 /* We do want a proper match. Need to restore the | |
| 5253 * subexpr if we had a match, because they may have | |
| 5254 * been set. */ | |
| 5255 if (status == RA_MATCH) | |
| 5256 { | |
| 5257 status = RA_NOMATCH; | |
| 5258 restore_subexpr(((regbehind_T *)rp) - 1); | |
| 5259 } | |
| 5260 } | |
| 270 | 5261 regstack_pop(&scan); |
| 180 | 5262 regstack.ga_len -= sizeof(regbehind_T); |
| 5263 } | |
| 5264 } | |
| 5265 break; | |
| 5266 | |
| 5267 case RS_STAR_LONG: | |
| 5268 case RS_STAR_SHORT: | |
| 5269 { | |
| 5270 regstar_T *rst = ((regstar_T *)rp) - 1; | |
| 5271 | |
| 5272 if (status == RA_MATCH) | |
| 5273 { | |
| 270 | 5274 regstack_pop(&scan); |
| 180 | 5275 regstack.ga_len -= sizeof(regstar_T); |
| 5276 break; | |
| 5277 } | |
| 5278 | |
| 5279 /* Tried once already, restore input pointers. */ | |
| 5280 if (status != RA_BREAK) | |
| 233 | 5281 reg_restore(&rp->rs_un.regsave, &backpos); |
| 180 | 5282 |
| 5283 /* Repeat until we found a position where it could match. */ | |
| 5284 for (;;) | |
| 5285 { | |
| 5286 if (status != RA_BREAK) | |
| 5287 { | |
| 5288 /* Tried first position already, advance. */ | |
| 5289 if (rp->rs_state == RS_STAR_LONG) | |
| 5290 { | |
| 685 | 5291 /* Trying for longest match, but couldn't or |
| 5292 * didn't match -- back up one char. */ | |
| 180 | 5293 if (--rst->count < rst->minval) |
| 5294 break; | |
| 5295 if (reginput == regline) | |
| 5296 { | |
| 5297 /* backup to last char of previous line */ | |
| 5298 --reglnum; | |
| 5299 regline = reg_getline(reglnum); | |
| 5300 /* Just in case regrepeat() didn't count | |
| 5301 * right. */ | |
| 5302 if (regline == NULL) | |
| 5303 break; | |
| 5304 reginput = regline + STRLEN(regline); | |
| 5305 fast_breakcheck(); | |
| 5306 } | |
| 5307 else | |
| 5308 mb_ptr_back(regline, reginput); | |
| 5309 } | |
| 5310 else | |
| 5311 { | |
| 5312 /* Range is backwards, use shortest match first. | |
| 5313 * Careful: maxval and minval are exchanged! | |
| 5314 * Couldn't or didn't match: try advancing one | |
| 5315 * char. */ | |
| 5316 if (rst->count == rst->minval | |
| 5317 || regrepeat(OPERAND(rp->rs_scan), 1L) == 0) | |
| 5318 break; | |
| 5319 ++rst->count; | |
| 5320 } | |
| 5321 if (got_int) | |
| 5322 break; | |
| 5323 } | |
| 5324 else | |
| 5325 status = RA_NOMATCH; | |
| 5326 | |
| 5327 /* If it could match, try it. */ | |
| 5328 if (rst->nextb == NUL || *reginput == rst->nextb | |
| 5329 || *reginput == rst->nextb_ic) | |
| 5330 { | |
| 233 | 5331 reg_save(&rp->rs_un.regsave, &backpos); |
| 180 | 5332 scan = regnext(rp->rs_scan); |
| 5333 status = RA_CONT; | |
| 5334 break; | |
| 5335 } | |
| 5336 } | |
| 5337 if (status != RA_CONT) | |
| 5338 { | |
| 5339 /* Failed. */ | |
| 270 | 5340 regstack_pop(&scan); |
| 180 | 5341 regstack.ga_len -= sizeof(regstar_T); |
| 5342 status = RA_NOMATCH; | |
| 5343 } | |
| 5344 } | |
| 5345 break; | |
| 5346 } | |
| 5347 | |
| 685 | 5348 /* If we want to continue the inner loop or didn't pop a state |
| 5349 * continue matching loop */ | |
| 180 | 5350 if (status == RA_CONT || rp == (regitem_T *) |
| 5351 ((char *)regstack.ga_data + regstack.ga_len) - 1) | |
| 5352 break; | |
| 5353 } | |
| 5354 | |
| 189 | 5355 /* May need to continue with the inner loop, starting at "scan". */ |
| 180 | 5356 if (status == RA_CONT) |
| 5357 continue; | |
| 5358 | |
| 5359 /* | |
| 5360 * If the regstack is empty or something failed we are done. | |
| 5361 */ | |
| 5362 if (regstack.ga_len == 0 || status == RA_FAIL) | |
| 5363 { | |
| 5364 if (scan == NULL) | |
| 5365 { | |
| 5366 /* | |
| 5367 * We get here only if there's trouble -- normally "case END" is | |
| 5368 * the terminating point. | |
| 5369 */ | |
| 5370 EMSG(_(e_re_corr)); | |
| 7 | 5371 #ifdef DEBUG |
| 180 | 5372 printf("Premature EOL\n"); |
| 7 | 5373 #endif |
| 180 | 5374 } |
| 189 | 5375 if (status == RA_FAIL) |
| 5376 got_int = TRUE; | |
| 180 | 5377 return (status == RA_MATCH); |
| 5378 } | |
| 5379 | |
| 5380 } /* End of loop until the regstack is empty. */ | |
| 5381 | |
| 5382 /* NOTREACHED */ | |
| 5383 } | |
| 5384 | |
| 5385 /* | |
| 5386 * Push an item onto the regstack. | |
| 5387 * Returns pointer to new item. Returns NULL when out of memory. | |
| 5388 */ | |
| 5389 static regitem_T * | |
| 270 | 5390 regstack_push(state, scan) |
| 180 | 5391 regstate_T state; |
| 5392 char_u *scan; | |
| 5393 { | |
| 5394 regitem_T *rp; | |
| 5395 | |
| 270 | 5396 if ((long)((unsigned)regstack.ga_len >> 10) >= p_mmp) |
| 189 | 5397 { |
| 5398 EMSG(_(e_maxmempat)); | |
| 5399 return NULL; | |
| 5400 } | |
| 270 | 5401 if (ga_grow(®stack, sizeof(regitem_T)) == FAIL) |
| 180 | 5402 return NULL; |
| 5403 | |
| 270 | 5404 rp = (regitem_T *)((char *)regstack.ga_data + regstack.ga_len); |
| 180 | 5405 rp->rs_state = state; |
| 5406 rp->rs_scan = scan; | |
| 5407 | |
| 270 | 5408 regstack.ga_len += sizeof(regitem_T); |
| 180 | 5409 return rp; |
| 5410 } | |
| 5411 | |
| 5412 /* | |
| 5413 * Pop an item from the regstack. | |
| 5414 */ | |
| 5415 static void | |
| 270 | 5416 regstack_pop(scan) |
| 180 | 5417 char_u **scan; |
| 5418 { | |
| 5419 regitem_T *rp; | |
| 5420 | |
| 270 | 5421 rp = (regitem_T *)((char *)regstack.ga_data + regstack.ga_len) - 1; |
| 180 | 5422 *scan = rp->rs_scan; |
| 5423 | |
| 270 | 5424 regstack.ga_len -= sizeof(regitem_T); |
| 7 | 5425 } |
| 5426 | |
| 5427 /* | |
| 5428 * regrepeat - repeatedly match something simple, return how many. | |
| 5429 * Advances reginput (and reglnum) to just after the matched chars. | |
| 5430 */ | |
| 5431 static int | |
| 5432 regrepeat(p, maxcount) | |
| 5433 char_u *p; | |
| 5434 long maxcount; /* maximum number of matches allowed */ | |
| 5435 { | |
| 5436 long count = 0; | |
| 5437 char_u *scan; | |
| 5438 char_u *opnd; | |
| 5439 int mask; | |
| 5440 int testval = 0; | |
| 5441 | |
| 5442 scan = reginput; /* Make local copy of reginput for speed. */ | |
| 5443 opnd = OPERAND(p); | |
| 5444 switch (OP(p)) | |
| 5445 { | |
| 5446 case ANY: | |
| 5447 case ANY + ADD_NL: | |
| 5448 while (count < maxcount) | |
| 5449 { | |
| 5450 /* Matching anything means we continue until end-of-line (or | |
| 5451 * end-of-file for ANY + ADD_NL), only limited by maxcount. */ | |
| 5452 while (*scan != NUL && count < maxcount) | |
| 5453 { | |
| 5454 ++count; | |
| 39 | 5455 mb_ptr_adv(scan); |
| 7 | 5456 } |
| 1018 | 5457 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5458 || reg_line_lbr || count == maxcount) | |
| 7 | 5459 break; |
| 5460 ++count; /* count the line-break */ | |
| 5461 reg_nextline(); | |
| 5462 scan = reginput; | |
| 5463 if (got_int) | |
| 5464 break; | |
| 5465 } | |
| 5466 break; | |
| 5467 | |
| 5468 case IDENT: | |
| 5469 case IDENT + ADD_NL: | |
| 5470 testval = TRUE; | |
| 5471 /*FALLTHROUGH*/ | |
| 5472 case SIDENT: | |
| 5473 case SIDENT + ADD_NL: | |
| 5474 while (count < maxcount) | |
| 5475 { | |
| 5476 if (vim_isIDc(*scan) && (testval || !VIM_ISDIGIT(*scan))) | |
| 5477 { | |
| 39 | 5478 mb_ptr_adv(scan); |
| 7 | 5479 } |
| 5480 else if (*scan == NUL) | |
| 5481 { | |
| 1018 | 5482 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5483 || reg_line_lbr) | |
| 7 | 5484 break; |
| 5485 reg_nextline(); | |
| 5486 scan = reginput; | |
| 5487 if (got_int) | |
| 5488 break; | |
| 5489 } | |
| 5490 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5491 ++scan; | |
| 5492 else | |
| 5493 break; | |
| 5494 ++count; | |
| 5495 } | |
| 5496 break; | |
| 5497 | |
| 5498 case KWORD: | |
| 5499 case KWORD + ADD_NL: | |
| 5500 testval = TRUE; | |
| 5501 /*FALLTHROUGH*/ | |
| 5502 case SKWORD: | |
| 5503 case SKWORD + ADD_NL: | |
| 5504 while (count < maxcount) | |
| 5505 { | |
| 5506 if (vim_iswordp(scan) && (testval || !VIM_ISDIGIT(*scan))) | |
| 5507 { | |
| 39 | 5508 mb_ptr_adv(scan); |
| 7 | 5509 } |
| 5510 else if (*scan == NUL) | |
| 5511 { | |
| 1018 | 5512 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5513 || reg_line_lbr) | |
| 7 | 5514 break; |
| 5515 reg_nextline(); | |
| 5516 scan = reginput; | |
| 5517 if (got_int) | |
| 5518 break; | |
| 5519 } | |
| 5520 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5521 ++scan; | |
| 5522 else | |
| 5523 break; | |
| 5524 ++count; | |
| 5525 } | |
| 5526 break; | |
| 5527 | |
| 5528 case FNAME: | |
| 5529 case FNAME + ADD_NL: | |
| 5530 testval = TRUE; | |
| 5531 /*FALLTHROUGH*/ | |
| 5532 case SFNAME: | |
| 5533 case SFNAME + ADD_NL: | |
| 5534 while (count < maxcount) | |
| 5535 { | |
| 5536 if (vim_isfilec(*scan) && (testval || !VIM_ISDIGIT(*scan))) | |
| 5537 { | |
| 39 | 5538 mb_ptr_adv(scan); |
| 7 | 5539 } |
| 5540 else if (*scan == NUL) | |
| 5541 { | |
| 1018 | 5542 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5543 || reg_line_lbr) | |
| 7 | 5544 break; |
| 5545 reg_nextline(); | |
| 5546 scan = reginput; | |
| 5547 if (got_int) | |
| 5548 break; | |
| 5549 } | |
| 5550 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5551 ++scan; | |
| 5552 else | |
| 5553 break; | |
| 5554 ++count; | |
| 5555 } | |
| 5556 break; | |
| 5557 | |
| 5558 case PRINT: | |
| 5559 case PRINT + ADD_NL: | |
| 5560 testval = TRUE; | |
| 5561 /*FALLTHROUGH*/ | |
| 5562 case SPRINT: | |
| 5563 case SPRINT + ADD_NL: | |
| 5564 while (count < maxcount) | |
| 5565 { | |
| 5566 if (*scan == NUL) | |
| 5567 { | |
| 1018 | 5568 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5569 || reg_line_lbr) | |
| 7 | 5570 break; |
| 5571 reg_nextline(); | |
| 5572 scan = reginput; | |
| 5573 if (got_int) | |
| 5574 break; | |
| 5575 } | |
| 5576 else if (ptr2cells(scan) == 1 && (testval || !VIM_ISDIGIT(*scan))) | |
| 5577 { | |
| 39 | 5578 mb_ptr_adv(scan); |
| 7 | 5579 } |
| 5580 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5581 ++scan; | |
| 5582 else | |
| 5583 break; | |
| 5584 ++count; | |
| 5585 } | |
| 5586 break; | |
| 5587 | |
| 5588 case WHITE: | |
| 5589 case WHITE + ADD_NL: | |
| 5590 testval = mask = RI_WHITE; | |
| 5591 do_class: | |
| 5592 while (count < maxcount) | |
| 5593 { | |
| 5594 #ifdef FEAT_MBYTE | |
| 5595 int l; | |
| 5596 #endif | |
| 5597 if (*scan == NUL) | |
| 5598 { | |
| 1018 | 5599 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5600 || reg_line_lbr) | |
| 7 | 5601 break; |
| 5602 reg_nextline(); | |
| 5603 scan = reginput; | |
| 5604 if (got_int) | |
| 5605 break; | |
| 5606 } | |
| 5607 #ifdef FEAT_MBYTE | |
| 474 | 5608 else if (has_mbyte && (l = (*mb_ptr2len)(scan)) > 1) |
| 7 | 5609 { |
| 5610 if (testval != 0) | |
| 5611 break; | |
| 5612 scan += l; | |
| 5613 } | |
| 5614 #endif | |
| 5615 else if ((class_tab[*scan] & mask) == testval) | |
| 5616 ++scan; | |
| 5617 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5618 ++scan; | |
| 5619 else | |
| 5620 break; | |
| 5621 ++count; | |
| 5622 } | |
| 5623 break; | |
| 5624 | |
| 5625 case NWHITE: | |
| 5626 case NWHITE + ADD_NL: | |
| 5627 mask = RI_WHITE; | |
| 5628 goto do_class; | |
| 5629 case DIGIT: | |
| 5630 case DIGIT + ADD_NL: | |
| 5631 testval = mask = RI_DIGIT; | |
| 5632 goto do_class; | |
| 5633 case NDIGIT: | |
| 5634 case NDIGIT + ADD_NL: | |
| 5635 mask = RI_DIGIT; | |
| 5636 goto do_class; | |
| 5637 case HEX: | |
| 5638 case HEX + ADD_NL: | |
| 5639 testval = mask = RI_HEX; | |
| 5640 goto do_class; | |
| 5641 case NHEX: | |
| 5642 case NHEX + ADD_NL: | |
| 5643 mask = RI_HEX; | |
| 5644 goto do_class; | |
| 5645 case OCTAL: | |
| 5646 case OCTAL + ADD_NL: | |
| 5647 testval = mask = RI_OCTAL; | |
| 5648 goto do_class; | |
| 5649 case NOCTAL: | |
| 5650 case NOCTAL + ADD_NL: | |
| 5651 mask = RI_OCTAL; | |
| 5652 goto do_class; | |
| 5653 case WORD: | |
| 5654 case WORD + ADD_NL: | |
| 5655 testval = mask = RI_WORD; | |
| 5656 goto do_class; | |
| 5657 case NWORD: | |
| 5658 case NWORD + ADD_NL: | |
| 5659 mask = RI_WORD; | |
| 5660 goto do_class; | |
| 5661 case HEAD: | |
| 5662 case HEAD + ADD_NL: | |
| 5663 testval = mask = RI_HEAD; | |
| 5664 goto do_class; | |
| 5665 case NHEAD: | |
| 5666 case NHEAD + ADD_NL: | |
| 5667 mask = RI_HEAD; | |
| 5668 goto do_class; | |
| 5669 case ALPHA: | |
| 5670 case ALPHA + ADD_NL: | |
| 5671 testval = mask = RI_ALPHA; | |
| 5672 goto do_class; | |
| 5673 case NALPHA: | |
| 5674 case NALPHA + ADD_NL: | |
| 5675 mask = RI_ALPHA; | |
| 5676 goto do_class; | |
| 5677 case LOWER: | |
| 5678 case LOWER + ADD_NL: | |
| 5679 testval = mask = RI_LOWER; | |
| 5680 goto do_class; | |
| 5681 case NLOWER: | |
| 5682 case NLOWER + ADD_NL: | |
| 5683 mask = RI_LOWER; | |
| 5684 goto do_class; | |
| 5685 case UPPER: | |
| 5686 case UPPER + ADD_NL: | |
| 5687 testval = mask = RI_UPPER; | |
| 5688 goto do_class; | |
| 5689 case NUPPER: | |
| 5690 case NUPPER + ADD_NL: | |
| 5691 mask = RI_UPPER; | |
| 5692 goto do_class; | |
| 5693 | |
| 5694 case EXACTLY: | |
| 5695 { | |
| 5696 int cu, cl; | |
| 5697 | |
| 5698 /* This doesn't do a multi-byte character, because a MULTIBYTECODE | |
| 1347 | 5699 * would have been used for it. It does handle single-byte |
| 5700 * characters, such as latin1. */ | |
| 7 | 5701 if (ireg_ic) |
| 5702 { | |
| 1347 | 5703 cu = MB_TOUPPER(*opnd); |
| 5704 cl = MB_TOLOWER(*opnd); | |
| 7 | 5705 while (count < maxcount && (*scan == cu || *scan == cl)) |
| 5706 { | |
| 5707 count++; | |
| 5708 scan++; | |
| 5709 } | |
| 5710 } | |
| 5711 else | |
| 5712 { | |
| 5713 cu = *opnd; | |
| 5714 while (count < maxcount && *scan == cu) | |
| 5715 { | |
| 5716 count++; | |
| 5717 scan++; | |
| 5718 } | |
| 5719 } | |
| 5720 break; | |
| 5721 } | |
| 5722 | |
| 5723 #ifdef FEAT_MBYTE | |
| 5724 case MULTIBYTECODE: | |
| 5725 { | |
| 5726 int i, len, cf = 0; | |
| 5727 | |
| 5728 /* Safety check (just in case 'encoding' was changed since | |
| 5729 * compiling the program). */ | |
| 474 | 5730 if ((len = (*mb_ptr2len)(opnd)) > 1) |
| 7 | 5731 { |
| 5732 if (ireg_ic && enc_utf8) | |
| 5733 cf = utf_fold(utf_ptr2char(opnd)); | |
| 5734 while (count < maxcount) | |
| 5735 { | |
| 5736 for (i = 0; i < len; ++i) | |
| 5737 if (opnd[i] != scan[i]) | |
| 5738 break; | |
| 5739 if (i < len && (!ireg_ic || !enc_utf8 | |
| 5740 || utf_fold(utf_ptr2char(scan)) != cf)) | |
| 5741 break; | |
| 5742 scan += len; | |
| 5743 ++count; | |
| 5744 } | |
| 5745 } | |
| 5746 } | |
| 5747 break; | |
| 5748 #endif | |
| 5749 | |
| 5750 case ANYOF: | |
| 5751 case ANYOF + ADD_NL: | |
| 5752 testval = TRUE; | |
| 5753 /*FALLTHROUGH*/ | |
| 5754 | |
| 5755 case ANYBUT: | |
| 5756 case ANYBUT + ADD_NL: | |
| 5757 while (count < maxcount) | |
| 5758 { | |
| 5759 #ifdef FEAT_MBYTE | |
| 5760 int len; | |
| 5761 #endif | |
| 5762 if (*scan == NUL) | |
| 5763 { | |
| 1018 | 5764 if (!REG_MULTI || !WITH_NL(OP(p)) || reglnum > reg_maxline |
| 5765 || reg_line_lbr) | |
| 7 | 5766 break; |
| 5767 reg_nextline(); | |
| 5768 scan = reginput; | |
| 5769 if (got_int) | |
| 5770 break; | |
| 5771 } | |
| 5772 else if (reg_line_lbr && *scan == '\n' && WITH_NL(OP(p))) | |
| 5773 ++scan; | |
| 5774 #ifdef FEAT_MBYTE | |
| 474 | 5775 else if (has_mbyte && (len = (*mb_ptr2len)(scan)) > 1) |
| 7 | 5776 { |
| 5777 if ((cstrchr(opnd, (*mb_ptr2char)(scan)) == NULL) == testval) | |
| 5778 break; | |
| 5779 scan += len; | |
| 5780 } | |
| 5781 #endif | |
| 5782 else | |
| 5783 { | |
| 5784 if ((cstrchr(opnd, *scan) == NULL) == testval) | |
| 5785 break; | |
| 5786 ++scan; | |
| 5787 } | |
| 5788 ++count; | |
| 5789 } | |
| 5790 break; | |
| 5791 | |
| 5792 case NEWL: | |
| 5793 while (count < maxcount | |
| 1018 | 5794 && ((*scan == NUL && reglnum <= reg_maxline && !reg_line_lbr |
| 5795 && REG_MULTI) || (*scan == '\n' && reg_line_lbr))) | |
| 7 | 5796 { |
| 5797 count++; | |
| 5798 if (reg_line_lbr) | |
| 5799 ADVANCE_REGINPUT(); | |
| 5800 else | |
| 5801 reg_nextline(); | |
| 5802 scan = reginput; | |
| 5803 if (got_int) | |
| 5804 break; | |
| 5805 } | |
| 5806 break; | |
| 5807 | |
| 5808 default: /* Oh dear. Called inappropriately. */ | |
| 5809 EMSG(_(e_re_corr)); | |
| 5810 #ifdef DEBUG | |
| 5811 printf("Called regrepeat with op code %d\n", OP(p)); | |
| 5812 #endif | |
| 5813 break; | |
| 5814 } | |
| 5815 | |
| 5816 reginput = scan; | |
| 5817 | |
| 5818 return (int)count; | |
| 5819 } | |
| 5820 | |
| 5821 /* | |
| 5822 * regnext - dig the "next" pointer out of a node | |
| 2010 | 5823 * Returns NULL when calculating size, when there is no next item and when |
| 5824 * there is an error. | |
| 7 | 5825 */ |
| 5826 static char_u * | |
| 5827 regnext(p) | |
| 5828 char_u *p; | |
| 5829 { | |
| 5830 int offset; | |
| 5831 | |
| 2010 | 5832 if (p == JUST_CALC_SIZE || reg_toolong) |
| 7 | 5833 return NULL; |
| 5834 | |
| 5835 offset = NEXT(p); | |
| 5836 if (offset == 0) | |
| 5837 return NULL; | |
| 5838 | |
| 233 | 5839 if (OP(p) == BACK) |
| 7 | 5840 return p - offset; |
| 5841 else | |
| 5842 return p + offset; | |
| 5843 } | |
| 5844 | |
| 5845 /* | |
| 5846 * Check the regexp program for its magic number. | |
| 5847 * Return TRUE if it's wrong. | |
| 5848 */ | |
| 5849 static int | |
| 5850 prog_magic_wrong() | |
| 5851 { | |
| 5852 if (UCHARAT(REG_MULTI | |
| 5853 ? reg_mmatch->regprog->program | |
| 5854 : reg_match->regprog->program) != REGMAGIC) | |
| 5855 { | |
| 5856 EMSG(_(e_re_corr)); | |
| 5857 return TRUE; | |
| 5858 } | |
| 5859 return FALSE; | |
| 5860 } | |
| 5861 | |
| 5862 /* | |
| 5863 * Cleanup the subexpressions, if this wasn't done yet. | |
| 5864 * This construction is used to clear the subexpressions only when they are | |
| 5865 * used (to increase speed). | |
| 5866 */ | |
| 5867 static void | |
| 5868 cleanup_subexpr() | |
| 5869 { | |
| 5870 if (need_clear_subexpr) | |
| 5871 { | |
| 5872 if (REG_MULTI) | |
| 5873 { | |
| 5874 /* Use 0xff to set lnum to -1 */ | |
| 5875 vim_memset(reg_startpos, 0xff, sizeof(lpos_T) * NSUBEXP); | |
| 5876 vim_memset(reg_endpos, 0xff, sizeof(lpos_T) * NSUBEXP); | |
| 5877 } | |
| 5878 else | |
| 5879 { | |
| 5880 vim_memset(reg_startp, 0, sizeof(char_u *) * NSUBEXP); | |
| 5881 vim_memset(reg_endp, 0, sizeof(char_u *) * NSUBEXP); | |
| 5882 } | |
| 5883 need_clear_subexpr = FALSE; | |
| 5884 } | |
| 5885 } | |
| 5886 | |
| 5887 #ifdef FEAT_SYN_HL | |
| 5888 static void | |
| 5889 cleanup_zsubexpr() | |
| 5890 { | |
| 5891 if (need_clear_zsubexpr) | |
| 5892 { | |
| 5893 if (REG_MULTI) | |
| 5894 { | |
| 5895 /* Use 0xff to set lnum to -1 */ | |
| 5896 vim_memset(reg_startzpos, 0xff, sizeof(lpos_T) * NSUBEXP); | |
| 5897 vim_memset(reg_endzpos, 0xff, sizeof(lpos_T) * NSUBEXP); | |
| 5898 } | |
| 5899 else | |
| 5900 { | |
| 5901 vim_memset(reg_startzp, 0, sizeof(char_u *) * NSUBEXP); | |
| 5902 vim_memset(reg_endzp, 0, sizeof(char_u *) * NSUBEXP); | |
| 5903 } | |
| 5904 need_clear_zsubexpr = FALSE; | |
| 5905 } | |
| 5906 } | |
| 5907 #endif | |
| 5908 | |
| 5909 /* | |
| 1579 | 5910 * Save the current subexpr to "bp", so that they can be restored |
| 5911 * later by restore_subexpr(). | |
| 5912 */ | |
| 5913 static void | |
| 5914 save_subexpr(bp) | |
| 5915 regbehind_T *bp; | |
| 5916 { | |
| 5917 int i; | |
| 5918 | |
| 1602 | 5919 /* When "need_clear_subexpr" is set we don't need to save the values, only |
| 5920 * remember that this flag needs to be set again when restoring. */ | |
| 5921 bp->save_need_clear_subexpr = need_clear_subexpr; | |
| 5922 if (!need_clear_subexpr) | |
| 1579 | 5923 { |
| 1602 | 5924 for (i = 0; i < NSUBEXP; ++i) |
| 1579 | 5925 { |
| 1602 | 5926 if (REG_MULTI) |
| 5927 { | |
| 5928 bp->save_start[i].se_u.pos = reg_startpos[i]; | |
| 5929 bp->save_end[i].se_u.pos = reg_endpos[i]; | |
| 5930 } | |
| 5931 else | |
| 5932 { | |
| 5933 bp->save_start[i].se_u.ptr = reg_startp[i]; | |
| 5934 bp->save_end[i].se_u.ptr = reg_endp[i]; | |
| 5935 } | |
| 1579 | 5936 } |
| 5937 } | |
| 5938 } | |
| 5939 | |
| 5940 /* | |
| 5941 * Restore the subexpr from "bp". | |
| 5942 */ | |
| 5943 static void | |
| 5944 restore_subexpr(bp) | |
| 5945 regbehind_T *bp; | |
| 5946 { | |
| 5947 int i; | |
| 5948 | |
| 1602 | 5949 /* Only need to restore saved values when they are not to be cleared. */ |
| 5950 need_clear_subexpr = bp->save_need_clear_subexpr; | |
| 5951 if (!need_clear_subexpr) | |
| 1579 | 5952 { |
| 1602 | 5953 for (i = 0; i < NSUBEXP; ++i) |
| 1579 | 5954 { |
| 1602 | 5955 if (REG_MULTI) |
| 5956 { | |
| 5957 reg_startpos[i] = bp->save_start[i].se_u.pos; | |
| 5958 reg_endpos[i] = bp->save_end[i].se_u.pos; | |
| 5959 } | |
| 5960 else | |
| 5961 { | |
| 5962 reg_startp[i] = bp->save_start[i].se_u.ptr; | |
| 5963 reg_endp[i] = bp->save_end[i].se_u.ptr; | |
| 5964 } | |
| 1579 | 5965 } |
| 5966 } | |
| 5967 } | |
| 5968 | |
| 5969 /* | |
| 7 | 5970 * Advance reglnum, regline and reginput to the next line. |
| 5971 */ | |
| 5972 static void | |
| 5973 reg_nextline() | |
| 5974 { | |
| 5975 regline = reg_getline(++reglnum); | |
| 5976 reginput = regline; | |
| 5977 fast_breakcheck(); | |
| 5978 } | |
| 5979 | |
| 5980 /* | |
| 5981 * Save the input line and position in a regsave_T. | |
| 5982 */ | |
| 5983 static void | |
| 233 | 5984 reg_save(save, gap) |
| 7 | 5985 regsave_T *save; |
| 233 | 5986 garray_T *gap; |
| 7 | 5987 { |
| 5988 if (REG_MULTI) | |
| 5989 { | |
| 5990 save->rs_u.pos.col = (colnr_T)(reginput - regline); | |
| 5991 save->rs_u.pos.lnum = reglnum; | |
| 5992 } | |
| 5993 else | |
| 5994 save->rs_u.ptr = reginput; | |
| 233 | 5995 save->rs_len = gap->ga_len; |
| 7 | 5996 } |
| 5997 | |
| 5998 /* | |
| 5999 * Restore the input line and position from a regsave_T. | |
| 6000 */ | |
| 6001 static void | |
| 233 | 6002 reg_restore(save, gap) |
| 7 | 6003 regsave_T *save; |
| 233 | 6004 garray_T *gap; |
| 7 | 6005 { |
| 6006 if (REG_MULTI) | |
| 6007 { | |
| 6008 if (reglnum != save->rs_u.pos.lnum) | |
| 6009 { | |
| 6010 /* only call reg_getline() when the line number changed to save | |
| 6011 * a bit of time */ | |
| 6012 reglnum = save->rs_u.pos.lnum; | |
| 6013 regline = reg_getline(reglnum); | |
| 6014 } | |
| 6015 reginput = regline + save->rs_u.pos.col; | |
| 6016 } | |
| 6017 else | |
| 6018 reginput = save->rs_u.ptr; | |
| 233 | 6019 gap->ga_len = save->rs_len; |
| 7 | 6020 } |
| 6021 | |
| 6022 /* | |
| 6023 * Return TRUE if current position is equal to saved position. | |
| 6024 */ | |
| 6025 static int | |
| 6026 reg_save_equal(save) | |
| 6027 regsave_T *save; | |
| 6028 { | |
| 6029 if (REG_MULTI) | |
| 6030 return reglnum == save->rs_u.pos.lnum | |
| 6031 && reginput == regline + save->rs_u.pos.col; | |
| 6032 return reginput == save->rs_u.ptr; | |
| 6033 } | |
| 6034 | |
| 6035 /* | |
| 6036 * Tentatively set the sub-expression start to the current position (after | |
| 6037 * calling regmatch() they will have changed). Need to save the existing | |
| 6038 * values for when there is no match. | |
| 6039 * Use se_save() to use pointer (save_se_multi()) or position (save_se_one()), | |
| 6040 * depending on REG_MULTI. | |
| 6041 */ | |
| 6042 static void | |
| 6043 save_se_multi(savep, posp) | |
| 6044 save_se_T *savep; | |
| 6045 lpos_T *posp; | |
| 6046 { | |
| 6047 savep->se_u.pos = *posp; | |
| 6048 posp->lnum = reglnum; | |
| 6049 posp->col = (colnr_T)(reginput - regline); | |
| 6050 } | |
| 6051 | |
| 6052 static void | |
| 6053 save_se_one(savep, pp) | |
| 6054 save_se_T *savep; | |
| 6055 char_u **pp; | |
| 6056 { | |
| 6057 savep->se_u.ptr = *pp; | |
| 6058 *pp = reginput; | |
| 6059 } | |
| 6060 | |
| 6061 /* | |
| 6062 * Compare a number with the operand of RE_LNUM, RE_COL or RE_VCOL. | |
| 6063 */ | |
| 6064 static int | |
| 6065 re_num_cmp(val, scan) | |
| 6066 long_u val; | |
| 6067 char_u *scan; | |
| 6068 { | |
| 6069 long_u n = OPERAND_MIN(scan); | |
| 6070 | |
| 6071 if (OPERAND_CMP(scan) == '>') | |
| 6072 return val > n; | |
| 6073 if (OPERAND_CMP(scan) == '<') | |
| 6074 return val < n; | |
| 6075 return val == n; | |
| 6076 } | |
| 6077 | |
| 6078 | |
| 6079 #ifdef DEBUG | |
| 6080 | |
| 6081 /* | |
| 6082 * regdump - dump a regexp onto stdout in vaguely comprehensible form | |
| 6083 */ | |
| 6084 static void | |
| 6085 regdump(pattern, r) | |
| 6086 char_u *pattern; | |
| 6087 regprog_T *r; | |
| 6088 { | |
| 6089 char_u *s; | |
| 6090 int op = EXACTLY; /* Arbitrary non-END op. */ | |
| 6091 char_u *next; | |
| 6092 char_u *end = NULL; | |
| 6093 | |
| 6094 printf("\r\nregcomp(%s):\r\n", pattern); | |
| 6095 | |
| 6096 s = r->program + 1; | |
| 6097 /* | |
| 6098 * Loop until we find the END that isn't before a referred next (an END | |
| 6099 * can also appear in a NOMATCH operand). | |
| 6100 */ | |
| 6101 while (op != END || s <= end) | |
| 6102 { | |
| 6103 op = OP(s); | |
| 6104 printf("%2d%s", (int)(s - r->program), regprop(s)); /* Where, what. */ | |
| 6105 next = regnext(s); | |
| 6106 if (next == NULL) /* Next ptr. */ | |
| 6107 printf("(0)"); | |
| 6108 else | |
| 6109 printf("(%d)", (int)((s - r->program) + (next - s))); | |
| 6110 if (end < next) | |
| 6111 end = next; | |
| 6112 if (op == BRACE_LIMITS) | |
| 6113 { | |
| 6114 /* Two short ints */ | |
| 6115 printf(" minval %ld, maxval %ld", OPERAND_MIN(s), OPERAND_MAX(s)); | |
| 6116 s += 8; | |
| 6117 } | |
| 6118 s += 3; | |
| 6119 if (op == ANYOF || op == ANYOF + ADD_NL | |
| 6120 || op == ANYBUT || op == ANYBUT + ADD_NL | |
| 6121 || op == EXACTLY) | |
| 6122 { | |
| 6123 /* Literal string, where present. */ | |
| 6124 while (*s != NUL) | |
| 6125 printf("%c", *s++); | |
| 6126 s++; | |
| 6127 } | |
| 6128 printf("\r\n"); | |
| 6129 } | |
| 6130 | |
| 6131 /* Header fields of interest. */ | |
| 6132 if (r->regstart != NUL) | |
| 6133 printf("start `%s' 0x%x; ", r->regstart < 256 | |
| 6134 ? (char *)transchar(r->regstart) | |
| 6135 : "multibyte", r->regstart); | |
| 6136 if (r->reganch) | |
| 6137 printf("anchored; "); | |
| 6138 if (r->regmust != NULL) | |
| 6139 printf("must have \"%s\"", r->regmust); | |
| 6140 printf("\r\n"); | |
| 6141 } | |
| 6142 | |
| 6143 /* | |
| 6144 * regprop - printable representation of opcode | |
| 6145 */ | |
| 6146 static char_u * | |
| 6147 regprop(op) | |
| 6148 char_u *op; | |
| 6149 { | |
| 6150 char_u *p; | |
| 6151 static char_u buf[50]; | |
| 6152 | |
| 6153 (void) strcpy(buf, ":"); | |
| 6154 | |
| 6155 switch (OP(op)) | |
| 6156 { | |
| 6157 case BOL: | |
| 6158 p = "BOL"; | |
| 6159 break; | |
| 6160 case EOL: | |
| 6161 p = "EOL"; | |
| 6162 break; | |
| 6163 case RE_BOF: | |
| 6164 p = "BOF"; | |
| 6165 break; | |
| 6166 case RE_EOF: | |
| 6167 p = "EOF"; | |
| 6168 break; | |
| 6169 case CURSOR: | |
| 6170 p = "CURSOR"; | |
| 6171 break; | |
| 639 | 6172 case RE_VISUAL: |
| 6173 p = "RE_VISUAL"; | |
| 6174 break; | |
| 7 | 6175 case RE_LNUM: |
| 6176 p = "RE_LNUM"; | |
| 6177 break; | |
| 639 | 6178 case RE_MARK: |
| 6179 p = "RE_MARK"; | |
| 6180 break; | |
| 7 | 6181 case RE_COL: |
| 6182 p = "RE_COL"; | |
| 6183 break; | |
| 6184 case RE_VCOL: | |
| 6185 p = "RE_VCOL"; | |
| 6186 break; | |
| 6187 case BOW: | |
| 6188 p = "BOW"; | |
| 6189 break; | |
| 6190 case EOW: | |
| 6191 p = "EOW"; | |
| 6192 break; | |
| 6193 case ANY: | |
| 6194 p = "ANY"; | |
| 6195 break; | |
| 6196 case ANY + ADD_NL: | |
| 6197 p = "ANY+NL"; | |
| 6198 break; | |
| 6199 case ANYOF: | |
| 6200 p = "ANYOF"; | |
| 6201 break; | |
| 6202 case ANYOF + ADD_NL: | |
| 6203 p = "ANYOF+NL"; | |
| 6204 break; | |
| 6205 case ANYBUT: | |
| 6206 p = "ANYBUT"; | |
| 6207 break; | |
| 6208 case ANYBUT + ADD_NL: | |
| 6209 p = "ANYBUT+NL"; | |
| 6210 break; | |
| 6211 case IDENT: | |
| 6212 p = "IDENT"; | |
| 6213 break; | |
| 6214 case IDENT + ADD_NL: | |
| 6215 p = "IDENT+NL"; | |
| 6216 break; | |
| 6217 case SIDENT: | |
| 6218 p = "SIDENT"; | |
| 6219 break; | |
| 6220 case SIDENT + ADD_NL: | |
| 6221 p = "SIDENT+NL"; | |
| 6222 break; | |
| 6223 case KWORD: | |
| 6224 p = "KWORD"; | |
| 6225 break; | |
| 6226 case KWORD + ADD_NL: | |
| 6227 p = "KWORD+NL"; | |
| 6228 break; | |
| 6229 case SKWORD: | |
| 6230 p = "SKWORD"; | |
| 6231 break; | |
| 6232 case SKWORD + ADD_NL: | |
| 6233 p = "SKWORD+NL"; | |
| 6234 break; | |
| 6235 case FNAME: | |
| 6236 p = "FNAME"; | |
| 6237 break; | |
| 6238 case FNAME + ADD_NL: | |
| 6239 p = "FNAME+NL"; | |
| 6240 break; | |
| 6241 case SFNAME: | |
| 6242 p = "SFNAME"; | |
| 6243 break; | |
| 6244 case SFNAME + ADD_NL: | |
| 6245 p = "SFNAME+NL"; | |
| 6246 break; | |
| 6247 case PRINT: | |
| 6248 p = "PRINT"; | |
| 6249 break; | |
| 6250 case PRINT + ADD_NL: | |
| 6251 p = "PRINT+NL"; | |
| 6252 break; | |
| 6253 case SPRINT: | |
| 6254 p = "SPRINT"; | |
| 6255 break; | |
| 6256 case SPRINT + ADD_NL: | |
| 6257 p = "SPRINT+NL"; | |
| 6258 break; | |
| 6259 case WHITE: | |
| 6260 p = "WHITE"; | |
| 6261 break; | |
| 6262 case WHITE + ADD_NL: | |
| 6263 p = "WHITE+NL"; | |
| 6264 break; | |
| 6265 case NWHITE: | |
| 6266 p = "NWHITE"; | |
| 6267 break; | |
| 6268 case NWHITE + ADD_NL: | |
| 6269 p = "NWHITE+NL"; | |
| 6270 break; | |
| 6271 case DIGIT: | |
| 6272 p = "DIGIT"; | |
| 6273 break; | |
| 6274 case DIGIT + ADD_NL: | |
| 6275 p = "DIGIT+NL"; | |
| 6276 break; | |
| 6277 case NDIGIT: | |
| 6278 p = "NDIGIT"; | |
| 6279 break; | |
| 6280 case NDIGIT + ADD_NL: | |
| 6281 p = "NDIGIT+NL"; | |
| 6282 break; | |
| 6283 case HEX: | |
| 6284 p = "HEX"; | |
| 6285 break; | |
| 6286 case HEX + ADD_NL: | |
| 6287 p = "HEX+NL"; | |
| 6288 break; | |
| 6289 case NHEX: | |
| 6290 p = "NHEX"; | |
| 6291 break; | |
| 6292 case NHEX + ADD_NL: | |
| 6293 p = "NHEX+NL"; | |
| 6294 break; | |
| 6295 case OCTAL: | |
| 6296 p = "OCTAL"; | |
| 6297 break; | |
| 6298 case OCTAL + ADD_NL: | |
| 6299 p = "OCTAL+NL"; | |
| 6300 break; | |
| 6301 case NOCTAL: | |
| 6302 p = "NOCTAL"; | |
| 6303 break; | |
| 6304 case NOCTAL + ADD_NL: | |
| 6305 p = "NOCTAL+NL"; | |
| 6306 break; | |
| 6307 case WORD: | |
| 6308 p = "WORD"; | |
| 6309 break; | |
| 6310 case WORD + ADD_NL: | |
| 6311 p = "WORD+NL"; | |
| 6312 break; | |
| 6313 case NWORD: | |
| 6314 p = "NWORD"; | |
| 6315 break; | |
| 6316 case NWORD + ADD_NL: | |
| 6317 p = "NWORD+NL"; | |
| 6318 break; | |
| 6319 case HEAD: | |
| 6320 p = "HEAD"; | |
| 6321 break; | |
| 6322 case HEAD + ADD_NL: | |
| 6323 p = "HEAD+NL"; | |
| 6324 break; | |
| 6325 case NHEAD: | |
| 6326 p = "NHEAD"; | |
| 6327 break; | |
| 6328 case NHEAD + ADD_NL: | |
| 6329 p = "NHEAD+NL"; | |
| 6330 break; | |
| 6331 case ALPHA: | |
| 6332 p = "ALPHA"; | |
| 6333 break; | |
| 6334 case ALPHA + ADD_NL: | |
| 6335 p = "ALPHA+NL"; | |
| 6336 break; | |
| 6337 case NALPHA: | |
| 6338 p = "NALPHA"; | |
| 6339 break; | |
| 6340 case NALPHA + ADD_NL: | |
| 6341 p = "NALPHA+NL"; | |
| 6342 break; | |
| 6343 case LOWER: | |
| 6344 p = "LOWER"; | |
| 6345 break; | |
| 6346 case LOWER + ADD_NL: | |
| 6347 p = "LOWER+NL"; | |
| 6348 break; | |
| 6349 case NLOWER: | |
| 6350 p = "NLOWER"; | |
| 6351 break; | |
| 6352 case NLOWER + ADD_NL: | |
| 6353 p = "NLOWER+NL"; | |
| 6354 break; | |
| 6355 case UPPER: | |
| 6356 p = "UPPER"; | |
| 6357 break; | |
| 6358 case UPPER + ADD_NL: | |
| 6359 p = "UPPER+NL"; | |
| 6360 break; | |
| 6361 case NUPPER: | |
| 6362 p = "NUPPER"; | |
| 6363 break; | |
| 6364 case NUPPER + ADD_NL: | |
| 6365 p = "NUPPER+NL"; | |
| 6366 break; | |
| 6367 case BRANCH: | |
| 6368 p = "BRANCH"; | |
| 6369 break; | |
| 6370 case EXACTLY: | |
| 6371 p = "EXACTLY"; | |
| 6372 break; | |
| 6373 case NOTHING: | |
| 6374 p = "NOTHING"; | |
| 6375 break; | |
| 6376 case BACK: | |
| 6377 p = "BACK"; | |
| 6378 break; | |
| 6379 case END: | |
| 6380 p = "END"; | |
| 6381 break; | |
| 6382 case MOPEN + 0: | |
| 6383 p = "MATCH START"; | |
| 6384 break; | |
| 6385 case MOPEN + 1: | |
| 6386 case MOPEN + 2: | |
| 6387 case MOPEN + 3: | |
| 6388 case MOPEN + 4: | |
| 6389 case MOPEN + 5: | |
| 6390 case MOPEN + 6: | |
| 6391 case MOPEN + 7: | |
| 6392 case MOPEN + 8: | |
| 6393 case MOPEN + 9: | |
| 6394 sprintf(buf + STRLEN(buf), "MOPEN%d", OP(op) - MOPEN); | |
| 6395 p = NULL; | |
| 6396 break; | |
| 6397 case MCLOSE + 0: | |
| 6398 p = "MATCH END"; | |
| 6399 break; | |
| 6400 case MCLOSE + 1: | |
| 6401 case MCLOSE + 2: | |
| 6402 case MCLOSE + 3: | |
| 6403 case MCLOSE + 4: | |
| 6404 case MCLOSE + 5: | |
| 6405 case MCLOSE + 6: | |
| 6406 case MCLOSE + 7: | |
| 6407 case MCLOSE + 8: | |
| 6408 case MCLOSE + 9: | |
| 6409 sprintf(buf + STRLEN(buf), "MCLOSE%d", OP(op) - MCLOSE); | |
| 6410 p = NULL; | |
| 6411 break; | |
| 6412 case BACKREF + 1: | |
| 6413 case BACKREF + 2: | |
| 6414 case BACKREF + 3: | |
| 6415 case BACKREF + 4: | |
| 6416 case BACKREF + 5: | |
| 6417 case BACKREF + 6: | |
| 6418 case BACKREF + 7: | |
| 6419 case BACKREF + 8: | |
| 6420 case BACKREF + 9: | |
| 6421 sprintf(buf + STRLEN(buf), "BACKREF%d", OP(op) - BACKREF); | |
| 6422 p = NULL; | |
| 6423 break; | |
| 6424 case NOPEN: | |
| 6425 p = "NOPEN"; | |
| 6426 break; | |
| 6427 case NCLOSE: | |
| 6428 p = "NCLOSE"; | |
| 6429 break; | |
| 6430 #ifdef FEAT_SYN_HL | |
| 6431 case ZOPEN + 1: | |
| 6432 case ZOPEN + 2: | |
| 6433 case ZOPEN + 3: | |
| 6434 case ZOPEN + 4: | |
| 6435 case ZOPEN + 5: | |
| 6436 case ZOPEN + 6: | |
| 6437 case ZOPEN + 7: | |
| 6438 case ZOPEN + 8: | |
| 6439 case ZOPEN + 9: | |
| 6440 sprintf(buf + STRLEN(buf), "ZOPEN%d", OP(op) - ZOPEN); | |
| 6441 p = NULL; | |
| 6442 break; | |
| 6443 case ZCLOSE + 1: | |
| 6444 case ZCLOSE + 2: | |
| 6445 case ZCLOSE + 3: | |
| 6446 case ZCLOSE + 4: | |
| 6447 case ZCLOSE + 5: | |
| 6448 case ZCLOSE + 6: | |
| 6449 case ZCLOSE + 7: | |
| 6450 case ZCLOSE + 8: | |
| 6451 case ZCLOSE + 9: | |
| 6452 sprintf(buf + STRLEN(buf), "ZCLOSE%d", OP(op) - ZCLOSE); | |
| 6453 p = NULL; | |
| 6454 break; | |
| 6455 case ZREF + 1: | |
| 6456 case ZREF + 2: | |
| 6457 case ZREF + 3: | |
| 6458 case ZREF + 4: | |
| 6459 case ZREF + 5: | |
| 6460 case ZREF + 6: | |
| 6461 case ZREF + 7: | |
| 6462 case ZREF + 8: | |
| 6463 case ZREF + 9: | |
| 6464 sprintf(buf + STRLEN(buf), "ZREF%d", OP(op) - ZREF); | |
| 6465 p = NULL; | |
| 6466 break; | |
| 6467 #endif | |
| 6468 case STAR: | |
| 6469 p = "STAR"; | |
| 6470 break; | |
| 6471 case PLUS: | |
| 6472 p = "PLUS"; | |
| 6473 break; | |
| 6474 case NOMATCH: | |
| 6475 p = "NOMATCH"; | |
| 6476 break; | |
| 6477 case MATCH: | |
| 6478 p = "MATCH"; | |
| 6479 break; | |
| 6480 case BEHIND: | |
| 6481 p = "BEHIND"; | |
| 6482 break; | |
| 6483 case NOBEHIND: | |
| 6484 p = "NOBEHIND"; | |
| 6485 break; | |
| 6486 case SUBPAT: | |
| 6487 p = "SUBPAT"; | |
| 6488 break; | |
| 6489 case BRACE_LIMITS: | |
| 6490 p = "BRACE_LIMITS"; | |
| 6491 break; | |
| 6492 case BRACE_SIMPLE: | |
| 6493 p = "BRACE_SIMPLE"; | |
| 6494 break; | |
| 6495 case BRACE_COMPLEX + 0: | |
| 6496 case BRACE_COMPLEX + 1: | |
| 6497 case BRACE_COMPLEX + 2: | |
| 6498 case BRACE_COMPLEX + 3: | |
| 6499 case BRACE_COMPLEX + 4: | |
| 6500 case BRACE_COMPLEX + 5: | |
| 6501 case BRACE_COMPLEX + 6: | |
| 6502 case BRACE_COMPLEX + 7: | |
| 6503 case BRACE_COMPLEX + 8: | |
| 6504 case BRACE_COMPLEX + 9: | |
| 6505 sprintf(buf + STRLEN(buf), "BRACE_COMPLEX%d", OP(op) - BRACE_COMPLEX); | |
| 6506 p = NULL; | |
| 6507 break; | |
| 6508 #ifdef FEAT_MBYTE | |
| 6509 case MULTIBYTECODE: | |
| 6510 p = "MULTIBYTECODE"; | |
| 6511 break; | |
| 6512 #endif | |
| 6513 case NEWL: | |
| 6514 p = "NEWL"; | |
| 6515 break; | |
| 6516 default: | |
| 6517 sprintf(buf + STRLEN(buf), "corrupt %d", OP(op)); | |
| 6518 p = NULL; | |
| 6519 break; | |
| 6520 } | |
| 6521 if (p != NULL) | |
| 6522 (void) strcat(buf, p); | |
| 6523 return buf; | |
| 6524 } | |
| 6525 #endif | |
| 6526 | |
| 6527 #ifdef FEAT_MBYTE | |
| 6528 static void mb_decompose __ARGS((int c, int *c1, int *c2, int *c3)); | |
| 6529 | |
| 6530 typedef struct | |
| 6531 { | |
| 6532 int a, b, c; | |
| 6533 } decomp_T; | |
| 6534 | |
| 6535 | |
| 6536 /* 0xfb20 - 0xfb4f */ | |
| 297 | 6537 static decomp_T decomp_table[0xfb4f-0xfb20+1] = |
| 7 | 6538 { |
| 6539 {0x5e2,0,0}, /* 0xfb20 alt ayin */ | |
| 6540 {0x5d0,0,0}, /* 0xfb21 alt alef */ | |
| 6541 {0x5d3,0,0}, /* 0xfb22 alt dalet */ | |
| 6542 {0x5d4,0,0}, /* 0xfb23 alt he */ | |
| 6543 {0x5db,0,0}, /* 0xfb24 alt kaf */ | |
| 6544 {0x5dc,0,0}, /* 0xfb25 alt lamed */ | |
| 6545 {0x5dd,0,0}, /* 0xfb26 alt mem-sofit */ | |
| 6546 {0x5e8,0,0}, /* 0xfb27 alt resh */ | |
| 6547 {0x5ea,0,0}, /* 0xfb28 alt tav */ | |
| 6548 {'+', 0, 0}, /* 0xfb29 alt plus */ | |
| 6549 {0x5e9, 0x5c1, 0}, /* 0xfb2a shin+shin-dot */ | |
| 6550 {0x5e9, 0x5c2, 0}, /* 0xfb2b shin+sin-dot */ | |
| 6551 {0x5e9, 0x5c1, 0x5bc}, /* 0xfb2c shin+shin-dot+dagesh */ | |
| 6552 {0x5e9, 0x5c2, 0x5bc}, /* 0xfb2d shin+sin-dot+dagesh */ | |
| 6553 {0x5d0, 0x5b7, 0}, /* 0xfb2e alef+patah */ | |
| 6554 {0x5d0, 0x5b8, 0}, /* 0xfb2f alef+qamats */ | |
| 6555 {0x5d0, 0x5b4, 0}, /* 0xfb30 alef+hiriq */ | |
| 6556 {0x5d1, 0x5bc, 0}, /* 0xfb31 bet+dagesh */ | |
| 6557 {0x5d2, 0x5bc, 0}, /* 0xfb32 gimel+dagesh */ | |
| 6558 {0x5d3, 0x5bc, 0}, /* 0xfb33 dalet+dagesh */ | |
| 6559 {0x5d4, 0x5bc, 0}, /* 0xfb34 he+dagesh */ | |
| 6560 {0x5d5, 0x5bc, 0}, /* 0xfb35 vav+dagesh */ | |
| 6561 {0x5d6, 0x5bc, 0}, /* 0xfb36 zayin+dagesh */ | |
| 6562 {0xfb37, 0, 0}, /* 0xfb37 -- UNUSED */ | |
| 6563 {0x5d8, 0x5bc, 0}, /* 0xfb38 tet+dagesh */ | |
| 6564 {0x5d9, 0x5bc, 0}, /* 0xfb39 yud+dagesh */ | |
| 6565 {0x5da, 0x5bc, 0}, /* 0xfb3a kaf sofit+dagesh */ | |
| 6566 {0x5db, 0x5bc, 0}, /* 0xfb3b kaf+dagesh */ | |
| 6567 {0x5dc, 0x5bc, 0}, /* 0xfb3c lamed+dagesh */ | |
| 6568 {0xfb3d, 0, 0}, /* 0xfb3d -- UNUSED */ | |
| 6569 {0x5de, 0x5bc, 0}, /* 0xfb3e mem+dagesh */ | |
| 6570 {0xfb3f, 0, 0}, /* 0xfb3f -- UNUSED */ | |
| 6571 {0x5e0, 0x5bc, 0}, /* 0xfb40 nun+dagesh */ | |
| 6572 {0x5e1, 0x5bc, 0}, /* 0xfb41 samech+dagesh */ | |
| 6573 {0xfb42, 0, 0}, /* 0xfb42 -- UNUSED */ | |
| 6574 {0x5e3, 0x5bc, 0}, /* 0xfb43 pe sofit+dagesh */ | |
| 6575 {0x5e4, 0x5bc,0}, /* 0xfb44 pe+dagesh */ | |
| 6576 {0xfb45, 0, 0}, /* 0xfb45 -- UNUSED */ | |
| 6577 {0x5e6, 0x5bc, 0}, /* 0xfb46 tsadi+dagesh */ | |
| 6578 {0x5e7, 0x5bc, 0}, /* 0xfb47 qof+dagesh */ | |
| 6579 {0x5e8, 0x5bc, 0}, /* 0xfb48 resh+dagesh */ | |
| 6580 {0x5e9, 0x5bc, 0}, /* 0xfb49 shin+dagesh */ | |
| 6581 {0x5ea, 0x5bc, 0}, /* 0xfb4a tav+dagesh */ | |
| 6582 {0x5d5, 0x5b9, 0}, /* 0xfb4b vav+holam */ | |
| 6583 {0x5d1, 0x5bf, 0}, /* 0xfb4c bet+rafe */ | |
| 6584 {0x5db, 0x5bf, 0}, /* 0xfb4d kaf+rafe */ | |
| 6585 {0x5e4, 0x5bf, 0}, /* 0xfb4e pe+rafe */ | |
| 6586 {0x5d0, 0x5dc, 0} /* 0xfb4f alef-lamed */ | |
| 6587 }; | |
| 6588 | |
| 6589 static void | |
| 6590 mb_decompose(c, c1, c2, c3) | |
| 6591 int c, *c1, *c2, *c3; | |
| 6592 { | |
| 6593 decomp_T d; | |
| 6594 | |
| 6595 if (c >= 0x4b20 && c <= 0xfb4f) | |
| 6596 { | |
| 6597 d = decomp_table[c - 0xfb20]; | |
| 6598 *c1 = d.a; | |
| 6599 *c2 = d.b; | |
| 6600 *c3 = d.c; | |
| 6601 } | |
| 6602 else | |
| 6603 { | |
| 6604 *c1 = c; | |
| 6605 *c2 = *c3 = 0; | |
| 6606 } | |
| 6607 } | |
| 6608 #endif | |
| 6609 | |
| 6610 /* | |
| 6611 * Compare two strings, ignore case if ireg_ic set. | |
| 6612 * Return 0 if strings match, non-zero otherwise. | |
| 6613 * Correct the length "*n" when composing characters are ignored. | |
| 6614 */ | |
| 6615 static int | |
| 6616 cstrncmp(s1, s2, n) | |
| 6617 char_u *s1, *s2; | |
| 6618 int *n; | |
| 6619 { | |
| 6620 int result; | |
| 6621 | |
| 6622 if (!ireg_ic) | |
| 6623 result = STRNCMP(s1, s2, *n); | |
| 6624 else | |
| 6625 result = MB_STRNICMP(s1, s2, *n); | |
| 6626 | |
| 6627 #ifdef FEAT_MBYTE | |
| 6628 /* if it failed and it's utf8 and we want to combineignore: */ | |
| 6629 if (result != 0 && enc_utf8 && ireg_icombine) | |
| 6630 { | |
| 6631 char_u *str1, *str2; | |
| 6632 int c1, c2, c11, c12; | |
| 6633 int junk; | |
| 6634 | |
| 6635 /* we have to handle the strcmp ourselves, since it is necessary to | |
| 6636 * deal with the composing characters by ignoring them: */ | |
| 6637 str1 = s1; | |
| 6638 str2 = s2; | |
| 6639 c1 = c2 = 0; | |
| 507 | 6640 while ((int)(str1 - s1) < *n) |
| 7 | 6641 { |
| 6642 c1 = mb_ptr2char_adv(&str1); | |
| 6643 c2 = mb_ptr2char_adv(&str2); | |
| 6644 | |
| 6645 /* decompose the character if necessary, into 'base' characters | |
| 6646 * because I don't care about Arabic, I will hard-code the Hebrew | |
| 6647 * which I *do* care about! So sue me... */ | |
| 6648 if (c1 != c2 && (!ireg_ic || utf_fold(c1) != utf_fold(c2))) | |
| 6649 { | |
| 6650 /* decomposition necessary? */ | |
| 6651 mb_decompose(c1, &c11, &junk, &junk); | |
| 6652 mb_decompose(c2, &c12, &junk, &junk); | |
| 6653 c1 = c11; | |
| 6654 c2 = c12; | |
| 6655 if (c11 != c12 && (!ireg_ic || utf_fold(c11) != utf_fold(c12))) | |
| 6656 break; | |
| 6657 } | |
| 6658 } | |
| 6659 result = c2 - c1; | |
| 6660 if (result == 0) | |
| 6661 *n = (int)(str2 - s2); | |
| 6662 } | |
| 6663 #endif | |
| 6664 | |
| 6665 return result; | |
| 6666 } | |
| 6667 | |
| 6668 /* | |
| 6669 * cstrchr: This function is used a lot for simple searches, keep it fast! | |
| 6670 */ | |
| 6671 static char_u * | |
| 6672 cstrchr(s, c) | |
| 6673 char_u *s; | |
| 6674 int c; | |
| 6675 { | |
| 6676 char_u *p; | |
| 6677 int cc; | |
| 6678 | |
| 6679 if (!ireg_ic | |
| 6680 #ifdef FEAT_MBYTE | |
| 6681 || (!enc_utf8 && mb_char2len(c) > 1) | |
| 6682 #endif | |
| 6683 ) | |
| 6684 return vim_strchr(s, c); | |
| 6685 | |
| 6686 /* tolower() and toupper() can be slow, comparing twice should be a lot | |
| 6687 * faster (esp. when using MS Visual C++!). | |
| 6688 * For UTF-8 need to use folded case. */ | |
| 6689 #ifdef FEAT_MBYTE | |
| 6690 if (enc_utf8 && c > 0x80) | |
| 6691 cc = utf_fold(c); | |
| 6692 else | |
| 6693 #endif | |
| 1347 | 6694 if (MB_ISUPPER(c)) |
| 6695 cc = MB_TOLOWER(c); | |
| 6696 else if (MB_ISLOWER(c)) | |
| 6697 cc = MB_TOUPPER(c); | |
| 7 | 6698 else |
| 6699 return vim_strchr(s, c); | |
| 6700 | |
| 6701 #ifdef FEAT_MBYTE | |
| 6702 if (has_mbyte) | |
| 6703 { | |
| 474 | 6704 for (p = s; *p != NUL; p += (*mb_ptr2len)(p)) |
| 7 | 6705 { |
| 6706 if (enc_utf8 && c > 0x80) | |
| 6707 { | |
| 6708 if (utf_fold(utf_ptr2char(p)) == cc) | |
| 6709 return p; | |
| 6710 } | |
| 6711 else if (*p == c || *p == cc) | |
| 6712 return p; | |
| 6713 } | |
| 6714 } | |
| 6715 else | |
| 6716 #endif | |
| 6717 /* Faster version for when there are no multi-byte characters. */ | |
| 6718 for (p = s; *p != NUL; ++p) | |
| 6719 if (*p == c || *p == cc) | |
| 6720 return p; | |
| 6721 | |
| 6722 return NULL; | |
| 6723 } | |
| 6724 | |
| 6725 /*************************************************************** | |
| 6726 * regsub stuff * | |
| 6727 ***************************************************************/ | |
| 6728 | |
| 6729 /* This stuff below really confuses cc on an SGI -- webb */ | |
| 6730 #ifdef __sgi | |
| 6731 # undef __ARGS | |
| 6732 # define __ARGS(x) () | |
| 6733 #endif | |
| 6734 | |
| 6735 /* | |
| 6736 * We should define ftpr as a pointer to a function returning a pointer to | |
| 6737 * a function returning a pointer to a function ... | |
| 6738 * This is impossible, so we declare a pointer to a function returning a | |
| 6739 * pointer to a function returning void. This should work for all compilers. | |
| 6740 */ | |
| 772 | 6741 typedef void (*(*fptr_T) __ARGS((int *, int)))(); |
| 6742 | |
| 6743 static fptr_T do_upper __ARGS((int *, int)); | |
| 6744 static fptr_T do_Upper __ARGS((int *, int)); | |
| 6745 static fptr_T do_lower __ARGS((int *, int)); | |
| 6746 static fptr_T do_Lower __ARGS((int *, int)); | |
| 7 | 6747 |
| 6748 static int vim_regsub_both __ARGS((char_u *source, char_u *dest, int copy, int magic, int backslash)); | |
| 6749 | |
| 772 | 6750 static fptr_T |
| 7 | 6751 do_upper(d, c) |
| 772 | 6752 int *d; |
| 6753 int c; | |
| 7 | 6754 { |
| 772 | 6755 *d = MB_TOUPPER(c); |
| 6756 | |
| 6757 return (fptr_T)NULL; | |
| 7 | 6758 } |
| 6759 | |
| 772 | 6760 static fptr_T |
| 6761 do_Upper(d, c) | |
| 6762 int *d; | |
| 7 | 6763 int c; |
| 6764 { | |
| 772 | 6765 *d = MB_TOUPPER(c); |
| 6766 | |
| 6767 return (fptr_T)do_Upper; | |
| 6768 } | |
| 6769 | |
| 6770 static fptr_T | |
| 6771 do_lower(d, c) | |
| 6772 int *d; | |
| 6773 int c; | |
| 6774 { | |
| 6775 *d = MB_TOLOWER(c); | |
| 6776 | |
| 6777 return (fptr_T)NULL; | |
| 6778 } | |
| 6779 | |
| 6780 static fptr_T | |
| 6781 do_Lower(d, c) | |
| 6782 int *d; | |
| 6783 int c; | |
| 6784 { | |
| 6785 *d = MB_TOLOWER(c); | |
| 6786 | |
| 6787 return (fptr_T)do_Lower; | |
| 7 | 6788 } |
| 6789 | |
| 6790 /* | |
| 6791 * regtilde(): Replace tildes in the pattern by the old pattern. | |
| 6792 * | |
| 6793 * Short explanation of the tilde: It stands for the previous replacement | |
| 6794 * pattern. If that previous pattern also contains a ~ we should go back a | |
| 6795 * step further... But we insert the previous pattern into the current one | |
| 6796 * and remember that. | |
| 772 | 6797 * This still does not handle the case where "magic" changes. So require the |
| 6798 * user to keep his hands off of "magic". | |
| 7 | 6799 * |
| 6800 * The tildes are parsed once before the first call to vim_regsub(). | |
| 6801 */ | |
| 6802 char_u * | |
| 6803 regtilde(source, magic) | |
| 6804 char_u *source; | |
| 6805 int magic; | |
| 6806 { | |
| 6807 char_u *newsub = source; | |
| 6808 char_u *tmpsub; | |
| 6809 char_u *p; | |
| 6810 int len; | |
| 6811 int prevlen; | |
| 6812 | |
| 6813 for (p = newsub; *p; ++p) | |
| 6814 { | |
| 6815 if ((*p == '~' && magic) || (*p == '\\' && *(p + 1) == '~' && !magic)) | |
| 6816 { | |
| 6817 if (reg_prev_sub != NULL) | |
| 6818 { | |
| 6819 /* length = len(newsub) - 1 + len(prev_sub) + 1 */ | |
| 6820 prevlen = (int)STRLEN(reg_prev_sub); | |
| 6821 tmpsub = alloc((unsigned)(STRLEN(newsub) + prevlen)); | |
| 6822 if (tmpsub != NULL) | |
| 6823 { | |
| 6824 /* copy prefix */ | |
| 6825 len = (int)(p - newsub); /* not including ~ */ | |
| 6826 mch_memmove(tmpsub, newsub, (size_t)len); | |
| 1209 | 6827 /* interpret tilde */ |
| 7 | 6828 mch_memmove(tmpsub + len, reg_prev_sub, (size_t)prevlen); |
| 6829 /* copy postfix */ | |
| 6830 if (!magic) | |
| 6831 ++p; /* back off \ */ | |
| 6832 STRCPY(tmpsub + len + prevlen, p + 1); | |
| 6833 | |
| 6834 if (newsub != source) /* already allocated newsub */ | |
| 6835 vim_free(newsub); | |
| 6836 newsub = tmpsub; | |
| 6837 p = newsub + len + prevlen; | |
| 6838 } | |
| 6839 } | |
| 6840 else if (magic) | |
| 1621 | 6841 STRMOVE(p, p + 1); /* remove '~' */ |
| 7 | 6842 else |
| 1621 | 6843 STRMOVE(p, p + 2); /* remove '\~' */ |
| 7 | 6844 --p; |
| 6845 } | |
| 6846 else | |
| 6847 { | |
| 6848 if (*p == '\\' && p[1]) /* skip escaped characters */ | |
| 6849 ++p; | |
| 6850 #ifdef FEAT_MBYTE | |
| 6851 if (has_mbyte) | |
| 474 | 6852 p += (*mb_ptr2len)(p) - 1; |
| 7 | 6853 #endif |
| 6854 } | |
| 6855 } | |
| 6856 | |
| 6857 vim_free(reg_prev_sub); | |
| 6858 if (newsub != source) /* newsub was allocated, just keep it */ | |
| 6859 reg_prev_sub = newsub; | |
| 6860 else /* no ~ found, need to save newsub */ | |
| 6861 reg_prev_sub = vim_strsave(newsub); | |
| 6862 return newsub; | |
| 6863 } | |
| 6864 | |
| 6865 #ifdef FEAT_EVAL | |
| 6866 static int can_f_submatch = FALSE; /* TRUE when submatch() can be used */ | |
| 6867 | |
| 6868 /* These pointers are used instead of reg_match and reg_mmatch for | |
| 6869 * reg_submatch(). Needed for when the substitution string is an expression | |
| 6870 * that contains a call to substitute() and submatch(). */ | |
| 6871 static regmatch_T *submatch_match; | |
| 6872 static regmmatch_T *submatch_mmatch; | |
| 2011 | 6873 static linenr_T submatch_firstlnum; |
| 6874 static linenr_T submatch_maxline; | |
| 7 | 6875 #endif |
| 6876 | |
| 6877 #if defined(FEAT_MODIFY_FNAME) || defined(FEAT_EVAL) || defined(PROTO) | |
| 6878 /* | |
| 6879 * vim_regsub() - perform substitutions after a vim_regexec() or | |
| 6880 * vim_regexec_multi() match. | |
| 6881 * | |
| 6882 * If "copy" is TRUE really copy into "dest". | |
| 6883 * If "copy" is FALSE nothing is copied, this is just to find out the length | |
| 6884 * of the result. | |
| 6885 * | |
| 6886 * If "backslash" is TRUE, a backslash will be removed later, need to double | |
| 6887 * them to keep them, and insert a backslash before a CR to avoid it being | |
| 6888 * replaced with a line break later. | |
| 6889 * | |
| 6890 * Note: The matched text must not change between the call of | |
| 6891 * vim_regexec()/vim_regexec_multi() and vim_regsub()! It would make the back | |
| 6892 * references invalid! | |
| 6893 * | |
| 6894 * Returns the size of the replacement, including terminating NUL. | |
| 6895 */ | |
| 6896 int | |
| 6897 vim_regsub(rmp, source, dest, copy, magic, backslash) | |
| 6898 regmatch_T *rmp; | |
| 6899 char_u *source; | |
| 6900 char_u *dest; | |
| 6901 int copy; | |
| 6902 int magic; | |
| 6903 int backslash; | |
| 6904 { | |
| 6905 reg_match = rmp; | |
| 6906 reg_mmatch = NULL; | |
| 6907 reg_maxline = 0; | |
| 6908 return vim_regsub_both(source, dest, copy, magic, backslash); | |
| 6909 } | |
| 6910 #endif | |
| 6911 | |
| 6912 int | |
| 6913 vim_regsub_multi(rmp, lnum, source, dest, copy, magic, backslash) | |
| 6914 regmmatch_T *rmp; | |
| 6915 linenr_T lnum; | |
| 6916 char_u *source; | |
| 6917 char_u *dest; | |
| 6918 int copy; | |
| 6919 int magic; | |
| 6920 int backslash; | |
| 6921 { | |
| 6922 reg_match = NULL; | |
| 6923 reg_mmatch = rmp; | |
| 6924 reg_buf = curbuf; /* always works on the current buffer! */ | |
| 6925 reg_firstlnum = lnum; | |
| 6926 reg_maxline = curbuf->b_ml.ml_line_count - lnum; | |
| 6927 return vim_regsub_both(source, dest, copy, magic, backslash); | |
| 6928 } | |
| 6929 | |
| 6930 static int | |
| 6931 vim_regsub_both(source, dest, copy, magic, backslash) | |
| 6932 char_u *source; | |
| 6933 char_u *dest; | |
| 6934 int copy; | |
| 6935 int magic; | |
| 6936 int backslash; | |
| 6937 { | |
| 6938 char_u *src; | |
| 6939 char_u *dst; | |
| 6940 char_u *s; | |
| 6941 int c; | |
| 772 | 6942 int cc; |
| 7 | 6943 int no = -1; |
| 772 | 6944 fptr_T func = (fptr_T)NULL; |
| 7 | 6945 linenr_T clnum = 0; /* init for GCC */ |
| 6946 int len = 0; /* init for GCC */ | |
| 6947 #ifdef FEAT_EVAL | |
| 6948 static char_u *eval_result = NULL; | |
| 6949 #endif | |
| 6950 | |
| 6951 /* Be paranoid... */ | |
| 6952 if (source == NULL || dest == NULL) | |
| 6953 { | |
| 6954 EMSG(_(e_null)); | |
| 6955 return 0; | |
| 6956 } | |
| 6957 if (prog_magic_wrong()) | |
| 6958 return 0; | |
| 6959 src = source; | |
| 6960 dst = dest; | |
| 6961 | |
| 6962 /* | |
| 6963 * When the substitute part starts with "\=" evaluate it as an expression. | |
| 6964 */ | |
| 6965 if (source[0] == '\\' && source[1] == '=' | |
| 6966 #ifdef FEAT_EVAL | |
| 6967 && !can_f_submatch /* can't do this recursively */ | |
| 6968 #endif | |
| 6969 ) | |
| 6970 { | |
| 6971 #ifdef FEAT_EVAL | |
| 6972 /* To make sure that the length doesn't change between checking the | |
| 6973 * length and copying the string, and to speed up things, the | |
| 6974 * resulting string is saved from the call with "copy" == FALSE to the | |
| 6975 * call with "copy" == TRUE. */ | |
| 6976 if (copy) | |
| 6977 { | |
| 6978 if (eval_result != NULL) | |
| 6979 { | |
| 6980 STRCPY(dest, eval_result); | |
| 6981 dst += STRLEN(eval_result); | |
| 6982 vim_free(eval_result); | |
| 6983 eval_result = NULL; | |
| 6984 } | |
| 6985 } | |
| 6986 else | |
| 6987 { | |
| 6988 win_T *save_reg_win; | |
| 6989 int save_ireg_ic; | |
| 6990 | |
| 6991 vim_free(eval_result); | |
| 6992 | |
| 6993 /* The expression may contain substitute(), which calls us | |
| 6994 * recursively. Make sure submatch() gets the text from the first | |
| 6995 * level. Don't need to save "reg_buf", because | |
| 6996 * vim_regexec_multi() can't be called recursively. */ | |
| 6997 submatch_match = reg_match; | |
| 6998 submatch_mmatch = reg_mmatch; | |
| 2011 | 6999 submatch_firstlnum = reg_firstlnum; |
| 7000 submatch_maxline = reg_maxline; | |
| 7 | 7001 save_reg_win = reg_win; |
| 7002 save_ireg_ic = ireg_ic; | |
| 7003 can_f_submatch = TRUE; | |
| 7004 | |
| 714 | 7005 eval_result = eval_to_string(source + 2, NULL, TRUE); |
| 7 | 7006 if (eval_result != NULL) |
| 7007 { | |
|
2125
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7008 int had_backslash = FALSE; |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7009 |
| 39 | 7010 for (s = eval_result; *s != NUL; mb_ptr_adv(s)) |
| 7 | 7011 { |
| 7012 /* Change NL to CR, so that it becomes a line break. | |
| 7013 * Skip over a backslashed character. */ | |
| 7014 if (*s == NL) | |
| 7015 *s = CAR; | |
| 7016 else if (*s == '\\' && s[1] != NUL) | |
|
2125
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7017 { |
| 7 | 7018 ++s; |
| 2173 | 7019 /* Change NL to CR here too, so that this works: |
| 7020 * :s/abc\\\ndef/\="aaa\\\nbbb"/ on text: | |
| 7021 * abc\ | |
| 7022 * def | |
| 7023 */ | |
| 7024 if (*s == NL) | |
| 7025 *s = CAR; | |
|
2125
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7026 had_backslash = TRUE; |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7027 } |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7028 } |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7029 if (had_backslash && backslash) |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7030 { |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7031 /* Backslashes will be consumed, need to double them. */ |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7032 s = vim_strsave_escaped(eval_result, (char_u *)"\\"); |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7033 if (s != NULL) |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7034 { |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7035 vim_free(eval_result); |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7036 eval_result = s; |
|
b8744d1982d1
updated for version 7.2.407
Bram Moolenaar <bram@zimbu.org>
parents:
2012
diff
changeset
|
7037 } |
| 7 | 7038 } |
| 7039 | |
| 7040 dst += STRLEN(eval_result); | |
| 7041 } | |
| 7042 | |
| 7043 reg_match = submatch_match; | |
| 7044 reg_mmatch = submatch_mmatch; | |
| 2011 | 7045 reg_firstlnum = submatch_firstlnum; |
| 7046 reg_maxline = submatch_maxline; | |
| 7 | 7047 reg_win = save_reg_win; |
| 7048 ireg_ic = save_ireg_ic; | |
| 7049 can_f_submatch = FALSE; | |
| 7050 } | |
| 7051 #endif | |
| 7052 } | |
| 7053 else | |
| 7054 while ((c = *src++) != NUL) | |
| 7055 { | |
| 7056 if (c == '&' && magic) | |
| 7057 no = 0; | |
| 7058 else if (c == '\\' && *src != NUL) | |
| 7059 { | |
| 7060 if (*src == '&' && !magic) | |
| 7061 { | |
| 7062 ++src; | |
| 7063 no = 0; | |
| 7064 } | |
| 7065 else if ('0' <= *src && *src <= '9') | |
| 7066 { | |
| 7067 no = *src++ - '0'; | |
| 7068 } | |
| 7069 else if (vim_strchr((char_u *)"uUlLeE", *src)) | |
| 7070 { | |
| 7071 switch (*src++) | |
| 7072 { | |
| 772 | 7073 case 'u': func = (fptr_T)do_upper; |
| 7 | 7074 continue; |
| 772 | 7075 case 'U': func = (fptr_T)do_Upper; |
| 7 | 7076 continue; |
| 772 | 7077 case 'l': func = (fptr_T)do_lower; |
| 7 | 7078 continue; |
| 772 | 7079 case 'L': func = (fptr_T)do_Lower; |
| 7 | 7080 continue; |
| 7081 case 'e': | |
| 772 | 7082 case 'E': func = (fptr_T)NULL; |
| 7 | 7083 continue; |
| 7084 } | |
| 7085 } | |
| 7086 } | |
| 7087 if (no < 0) /* Ordinary character. */ | |
| 7088 { | |
| 798 | 7089 if (c == K_SPECIAL && src[0] != NUL && src[1] != NUL) |
| 7090 { | |
| 1209 | 7091 /* Copy a special key as-is. */ |
| 798 | 7092 if (copy) |
| 7093 { | |
| 7094 *dst++ = c; | |
| 7095 *dst++ = *src++; | |
| 7096 *dst++ = *src++; | |
| 7097 } | |
| 7098 else | |
| 7099 { | |
| 7100 dst += 3; | |
| 7101 src += 2; | |
| 7102 } | |
| 7103 continue; | |
| 7104 } | |
| 7105 | |
| 7 | 7106 if (c == '\\' && *src != NUL) |
| 7107 { | |
| 7108 /* Check for abbreviations -- webb */ | |
| 7109 switch (*src) | |
| 7110 { | |
| 7111 case 'r': c = CAR; ++src; break; | |
| 7112 case 'n': c = NL; ++src; break; | |
| 7113 case 't': c = TAB; ++src; break; | |
| 7114 /* Oh no! \e already has meaning in subst pat :-( */ | |
| 7115 /* case 'e': c = ESC; ++src; break; */ | |
| 7116 case 'b': c = Ctrl_H; ++src; break; | |
| 7117 | |
| 7118 /* If "backslash" is TRUE the backslash will be removed | |
| 7119 * later. Used to insert a literal CR. */ | |
| 7120 default: if (backslash) | |
| 7121 { | |
| 7122 if (copy) | |
| 7123 *dst = '\\'; | |
| 7124 ++dst; | |
| 7125 } | |
| 7126 c = *src++; | |
| 7127 } | |
| 7128 } | |
| 798 | 7129 #ifdef FEAT_MBYTE |
| 7130 else if (has_mbyte) | |
| 7131 c = mb_ptr2char(src - 1); | |
| 7132 #endif | |
| 7 | 7133 |
| 7134 /* Write to buffer, if copy is set. */ | |
| 772 | 7135 if (func == (fptr_T)NULL) /* just copy */ |
| 7136 cc = c; | |
| 7137 else | |
| 7138 /* Turbo C complains without the typecast */ | |
| 7139 func = (fptr_T)(func(&cc, c)); | |
| 7140 | |
| 7141 #ifdef FEAT_MBYTE | |
| 7142 if (has_mbyte) | |
| 7 | 7143 { |
|
2307
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7144 int totlen = mb_ptr2len(src - 1); |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7145 |
| 7 | 7146 if (copy) |
| 772 | 7147 mb_char2bytes(cc, dst); |
| 7148 dst += mb_char2len(cc) - 1; | |
|
2307
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7149 if (enc_utf8) |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7150 { |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7151 int clen = utf_ptr2len(src - 1); |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7152 |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7153 /* If the character length is shorter than "totlen", there |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7154 * are composing characters; copy them as-is. */ |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7155 if (clen < totlen) |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7156 { |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7157 if (copy) |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7158 mch_memmove(dst + 1, src - 1 + clen, |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7159 (size_t)(totlen - clen)); |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7160 dst += totlen - clen; |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7161 } |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7162 } |
|
81527f127fb1
Fix: Composing characters in :s substitute text were dropped.
Bram Moolenaar <bram@vim.org>
parents:
2247
diff
changeset
|
7163 src += totlen - 1; |
| 7 | 7164 } |
| 7165 else | |
| 7166 #endif | |
| 7167 if (copy) | |
| 772 | 7168 *dst = cc; |
| 7 | 7169 dst++; |
| 7170 } | |
| 7171 else | |
| 7172 { | |
| 7173 if (REG_MULTI) | |
| 7174 { | |
| 7175 clnum = reg_mmatch->startpos[no].lnum; | |
| 7176 if (clnum < 0 || reg_mmatch->endpos[no].lnum < 0) | |
| 7177 s = NULL; | |
| 7178 else | |
| 7179 { | |
| 7180 s = reg_getline(clnum) + reg_mmatch->startpos[no].col; | |
| 7181 if (reg_mmatch->endpos[no].lnum == clnum) | |
| 7182 len = reg_mmatch->endpos[no].col | |
| 7183 - reg_mmatch->startpos[no].col; | |
| 7184 else | |
| 7185 len = (int)STRLEN(s); | |
| 7186 } | |
| 7187 } | |
| 7188 else | |
| 7189 { | |
| 7190 s = reg_match->startp[no]; | |
| 7191 if (reg_match->endp[no] == NULL) | |
| 7192 s = NULL; | |
| 7193 else | |
| 7194 len = (int)(reg_match->endp[no] - s); | |
| 7195 } | |
| 7196 if (s != NULL) | |
| 7197 { | |
| 7198 for (;;) | |
| 7199 { | |
| 7200 if (len == 0) | |
| 7201 { | |
| 7202 if (REG_MULTI) | |
| 7203 { | |
| 7204 if (reg_mmatch->endpos[no].lnum == clnum) | |
| 7205 break; | |
| 7206 if (copy) | |
| 7207 *dst = CAR; | |
| 7208 ++dst; | |
| 7209 s = reg_getline(++clnum); | |
| 7210 if (reg_mmatch->endpos[no].lnum == clnum) | |
| 7211 len = reg_mmatch->endpos[no].col; | |
| 7212 else | |
| 7213 len = (int)STRLEN(s); | |
| 7214 } | |
| 7215 else | |
| 7216 break; | |
| 7217 } | |
| 7218 else if (*s == NUL) /* we hit NUL. */ | |
| 7219 { | |
| 7220 if (copy) | |
| 7221 EMSG(_(e_re_damg)); | |
| 7222 goto exit; | |
| 7223 } | |
| 7224 else | |
| 7225 { | |
| 7226 if (backslash && (*s == CAR || *s == '\\')) | |
| 7227 { | |
| 7228 /* | |
| 7229 * Insert a backslash in front of a CR, otherwise | |
| 7230 * it will be replaced by a line break. | |
| 7231 * Number of backslashes will be halved later, | |
| 7232 * double them here. | |
| 7233 */ | |
| 7234 if (copy) | |
| 7235 { | |
| 7236 dst[0] = '\\'; | |
| 7237 dst[1] = *s; | |
| 7238 } | |
| 7239 dst += 2; | |
| 7240 } | |
| 7241 else | |
| 7242 { | |
| 772 | 7243 #ifdef FEAT_MBYTE |
| 7244 if (has_mbyte) | |
| 7245 c = mb_ptr2char(s); | |
| 7246 else | |
| 7247 #endif | |
| 7248 c = *s; | |
| 7249 | |
| 7250 if (func == (fptr_T)NULL) /* just copy */ | |
| 7251 cc = c; | |
| 7252 else | |
| 7253 /* Turbo C complains without the typecast */ | |
| 7254 func = (fptr_T)(func(&cc, c)); | |
| 7255 | |
| 7256 #ifdef FEAT_MBYTE | |
| 7257 if (has_mbyte) | |
| 7 | 7258 { |
| 1332 | 7259 int l; |
| 7260 | |
| 7261 /* Copy composing characters separately, one | |
| 7262 * at a time. */ | |
| 7263 if (enc_utf8) | |
| 7264 l = utf_ptr2len(s) - 1; | |
| 7265 else | |
| 7266 l = mb_ptr2len(s) - 1; | |
| 772 | 7267 |
| 7268 s += l; | |
| 7269 len -= l; | |
| 7270 if (copy) | |
| 7271 mb_char2bytes(cc, dst); | |
| 7272 dst += mb_char2len(cc) - 1; | |
| 7 | 7273 } |
| 772 | 7274 else |
| 7275 #endif | |
| 7276 if (copy) | |
| 7277 *dst = cc; | |
| 7278 dst++; | |
| 7 | 7279 } |
| 772 | 7280 |
| 7 | 7281 ++s; |
| 7282 --len; | |
| 7283 } | |
| 7284 } | |
| 7285 } | |
| 7286 no = -1; | |
| 7287 } | |
| 7288 } | |
| 7289 if (copy) | |
| 7290 *dst = NUL; | |
| 7291 | |
| 7292 exit: | |
| 7293 return (int)((dst - dest) + 1); | |
| 7294 } | |
| 7295 | |
| 7296 #ifdef FEAT_EVAL | |
| 2012 | 7297 static char_u *reg_getline_submatch __ARGS((linenr_T lnum)); |
| 7298 | |
| 7 | 7299 /* |
| 2011 | 7300 * Call reg_getline() with the line numbers from the submatch. If a |
| 7301 * substitute() was used the reg_maxline and other values have been | |
| 7302 * overwritten. | |
| 7303 */ | |
| 7304 static char_u * | |
| 7305 reg_getline_submatch(lnum) | |
| 7306 linenr_T lnum; | |
| 7307 { | |
| 7308 char_u *s; | |
| 7309 linenr_T save_first = reg_firstlnum; | |
| 7310 linenr_T save_max = reg_maxline; | |
| 7311 | |
| 7312 reg_firstlnum = submatch_firstlnum; | |
| 7313 reg_maxline = submatch_maxline; | |
| 7314 | |
| 7315 s = reg_getline(lnum); | |
| 7316 | |
| 7317 reg_firstlnum = save_first; | |
| 7318 reg_maxline = save_max; | |
| 7319 return s; | |
| 7320 } | |
| 7321 | |
| 7322 /* | |
| 1209 | 7323 * Used for the submatch() function: get the string from the n'th submatch in |
| 7 | 7324 * allocated memory. |
| 7325 * Returns NULL when not in a ":s" command and for a non-existing submatch. | |
| 7326 */ | |
| 7327 char_u * | |
| 7328 reg_submatch(no) | |
| 7329 int no; | |
| 7330 { | |
| 7331 char_u *retval = NULL; | |
| 7332 char_u *s; | |
| 7333 int len; | |
| 7334 int round; | |
| 7335 linenr_T lnum; | |
| 7336 | |
| 840 | 7337 if (!can_f_submatch || no < 0) |
| 7 | 7338 return NULL; |
| 7339 | |
| 7340 if (submatch_match == NULL) | |
| 7341 { | |
| 7342 /* | |
| 7343 * First round: compute the length and allocate memory. | |
| 7344 * Second round: copy the text. | |
| 7345 */ | |
| 7346 for (round = 1; round <= 2; ++round) | |
| 7347 { | |
| 7348 lnum = submatch_mmatch->startpos[no].lnum; | |
| 7349 if (lnum < 0 || submatch_mmatch->endpos[no].lnum < 0) | |
| 7350 return NULL; | |
| 7351 | |
| 2011 | 7352 s = reg_getline_submatch(lnum) + submatch_mmatch->startpos[no].col; |
| 7 | 7353 if (s == NULL) /* anti-crash check, cannot happen? */ |
| 7354 break; | |
| 7355 if (submatch_mmatch->endpos[no].lnum == lnum) | |
| 7356 { | |
| 7357 /* Within one line: take form start to end col. */ | |
| 7358 len = submatch_mmatch->endpos[no].col | |
| 7359 - submatch_mmatch->startpos[no].col; | |
| 7360 if (round == 2) | |
| 418 | 7361 vim_strncpy(retval, s, len); |
| 7 | 7362 ++len; |
| 7363 } | |
| 7364 else | |
| 7365 { | |
| 7366 /* Multiple lines: take start line from start col, middle | |
| 7367 * lines completely and end line up to end col. */ | |
| 7368 len = (int)STRLEN(s); | |
| 7369 if (round == 2) | |
| 7370 { | |
| 7371 STRCPY(retval, s); | |
| 7372 retval[len] = '\n'; | |
| 7373 } | |
| 7374 ++len; | |
| 7375 ++lnum; | |
| 7376 while (lnum < submatch_mmatch->endpos[no].lnum) | |
| 7377 { | |
| 2011 | 7378 s = reg_getline_submatch(lnum++); |
| 7 | 7379 if (round == 2) |
| 7380 STRCPY(retval + len, s); | |
| 7381 len += (int)STRLEN(s); | |
| 7382 if (round == 2) | |
| 7383 retval[len] = '\n'; | |
| 7384 ++len; | |
| 7385 } | |
| 7386 if (round == 2) | |
| 2011 | 7387 STRNCPY(retval + len, reg_getline_submatch(lnum), |
| 7 | 7388 submatch_mmatch->endpos[no].col); |
| 7389 len += submatch_mmatch->endpos[no].col; | |
| 7390 if (round == 2) | |
| 7391 retval[len] = NUL; | |
| 7392 ++len; | |
| 7393 } | |
| 7394 | |
| 840 | 7395 if (retval == NULL) |
| 7 | 7396 { |
| 7397 retval = lalloc((long_u)len, TRUE); | |
| 840 | 7398 if (retval == NULL) |
| 7 | 7399 return NULL; |
| 7400 } | |
| 7401 } | |
| 7402 } | |
| 7403 else | |
| 7404 { | |
| 1815 | 7405 s = submatch_match->startp[no]; |
| 7406 if (s == NULL || submatch_match->endp[no] == NULL) | |
| 7 | 7407 retval = NULL; |
| 7408 else | |
| 7409 retval = vim_strnsave(s, (int)(submatch_match->endp[no] - s)); | |
| 7410 } | |
| 7411 | |
| 7412 return retval; | |
| 7413 } | |
| 7414 #endif |