Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 1 | /* vi:set ts=8 sts=4 sw=4: |
| 2 | * |
| 3 | * NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE |
| 4 | * |
| 5 | * This is NOT the original regular expression code as written by Henry |
| 6 | * Spencer. This code has been modified specifically for use with Vim, and |
| 7 | * should not be used apart from compiling Vim. If you want a good regular |
| 8 | * expression library, get the original code. |
| 9 | * |
| 10 | * NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE NOTICE |
| 11 | */ |
| 12 | |
| 13 | #ifndef _REGEXP_H |
| 14 | #define _REGEXP_H |
| 15 | |
| 16 | /* |
| 17 | * The number of sub-matches is limited to 10. |
| 18 | * The first one (index 0) is the whole match, referenced with "\0". |
| 19 | * The second one (index 1) is the first sub-match, referenced with "\1". |
| 20 | * This goes up to the tenth (index 9), referenced with "\9". |
| 21 | */ |
| 22 | #define NSUBEXP 10 |
| 23 | |
| 24 | /* |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 25 | * In the NFA engine: how many braces are allowed. |
| 26 | * TODO(RE): Use dynamic memory allocation instead of static, like here |
| 27 | */ |
| 28 | #define NFA_MAX_BRACES 20 |
| 29 | |
| 30 | typedef struct regengine regengine_T; |
| 31 | |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 32 | /* |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 33 | * Structure returned by vim_regcomp() to pass on to vim_regexec(). |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 34 | * This is the general structure. For the actual matcher, two specific |
| 35 | * structures are used. See code below. |
| 36 | */ |
| 37 | typedef struct regprog |
| 38 | { |
| 39 | regengine_T *engine; |
| 40 | unsigned regflags; |
| 41 | } regprog_T; |
| 42 | |
| 43 | /* |
| 44 | * Structure used by the back track matcher. |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 45 | * These fields are only to be used in regexp.c! |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 46 | * See regexp.c for an explanation. |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 47 | */ |
| 48 | typedef struct |
| 49 | { |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 50 | /* These two members implement regprog_T */ |
| 51 | regengine_T *engine; |
| 52 | unsigned regflags; |
| 53 | |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 54 | int regstart; |
| 55 | char_u reganch; |
| 56 | char_u *regmust; |
| 57 | int regmlen; |
Bram Moolenaar | efb23f2 | 2013-06-01 23:02:54 +0200 | [diff] [blame] | 58 | #ifdef FEAT_SYN_HL |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 59 | char_u reghasz; |
Bram Moolenaar | efb23f2 | 2013-06-01 23:02:54 +0200 | [diff] [blame] | 60 | #endif |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 61 | char_u program[1]; /* actually longer.. */ |
| 62 | } bt_regprog_T; |
| 63 | |
| 64 | /* |
| 65 | * Structure representing a NFA state. |
| 66 | * A NFA state may have no outgoing edge, when it is a NFA_MATCH state. |
| 67 | */ |
| 68 | typedef struct nfa_state nfa_state_T; |
| 69 | struct nfa_state |
| 70 | { |
| 71 | int c; |
| 72 | nfa_state_T *out; |
| 73 | nfa_state_T *out1; |
| 74 | int id; |
Bram Moolenaar | dd2ccdf | 2013-06-03 12:17:04 +0200 | [diff] [blame] | 75 | int lastlist[2]; /* 0: normal, 1: recursive */ |
Bram Moolenaar | 423532e | 2013-05-29 21:14:42 +0200 | [diff] [blame] | 76 | int val; |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 77 | }; |
| 78 | |
| 79 | /* |
| 80 | * Structure used by the NFA matcher. |
| 81 | */ |
| 82 | typedef struct |
| 83 | { |
| 84 | /* These two members implement regprog_T */ |
| 85 | regengine_T *engine; |
| 86 | unsigned regflags; |
| 87 | |
Bram Moolenaar | 69afb7b | 2013-06-02 15:55:55 +0200 | [diff] [blame] | 88 | nfa_state_T *start; /* points into state[] */ |
Bram Moolenaar | d89616e | 2013-06-06 18:46:06 +0200 | [diff] [blame] | 89 | |
| 90 | int reganch; /* pattern starts with ^ */ |
| 91 | int regstart; /* char at start of pattern */ |
Bram Moolenaar | 473de61 | 2013-06-08 18:19:48 +0200 | [diff] [blame] | 92 | char_u *match_text; /* plain text to match with */ |
Bram Moolenaar | d89616e | 2013-06-06 18:46:06 +0200 | [diff] [blame] | 93 | |
Bram Moolenaar | 57a285b | 2013-05-26 16:57:28 +0200 | [diff] [blame] | 94 | int has_zend; /* pattern contains \ze */ |
Bram Moolenaar | 428e987 | 2013-05-30 17:05:39 +0200 | [diff] [blame] | 95 | int has_backref; /* pattern contains \1 .. \9 */ |
Bram Moolenaar | efb23f2 | 2013-06-01 23:02:54 +0200 | [diff] [blame] | 96 | #ifdef FEAT_SYN_HL |
| 97 | int reghasz; |
| 98 | #endif |
Bram Moolenaar | 69afb7b | 2013-06-02 15:55:55 +0200 | [diff] [blame] | 99 | #ifdef DEBUG |
| 100 | char_u *pattern; |
| 101 | #endif |
Bram Moolenaar | 963fee2 | 2013-05-26 21:47:28 +0200 | [diff] [blame] | 102 | int nsubexp; /* number of () */ |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 103 | int nstate; |
Bram Moolenaar | 16619a2 | 2013-06-11 18:42:36 +0200 | [diff] [blame] | 104 | nfa_state_T state[1]; /* actually longer.. */ |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 105 | } nfa_regprog_T; |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 106 | |
| 107 | /* |
| 108 | * Structure to be used for single-line matching. |
| 109 | * Sub-match "no" starts at "startp[no]" and ends just before "endp[no]". |
| 110 | * When there is no match, the pointer is NULL. |
| 111 | */ |
| 112 | typedef struct |
| 113 | { |
| 114 | regprog_T *regprog; |
| 115 | char_u *startp[NSUBEXP]; |
| 116 | char_u *endp[NSUBEXP]; |
| 117 | int rm_ic; |
| 118 | } regmatch_T; |
| 119 | |
| 120 | /* |
| 121 | * Structure to be used for multi-line matching. |
| 122 | * Sub-match "no" starts in line "startpos[no].lnum" column "startpos[no].col" |
| 123 | * and ends in line "endpos[no].lnum" just before column "endpos[no].col". |
| 124 | * The line numbers are relative to the first line, thus startpos[0].lnum is |
| 125 | * always 0. |
| 126 | * When there is no match, the line number is -1. |
| 127 | */ |
| 128 | typedef struct |
| 129 | { |
| 130 | regprog_T *regprog; |
| 131 | lpos_T startpos[NSUBEXP]; |
| 132 | lpos_T endpos[NSUBEXP]; |
| 133 | int rmm_ic; |
Bram Moolenaar | bbebc85 | 2005-07-18 21:47:53 +0000 | [diff] [blame] | 134 | colnr_T rmm_maxcol; /* when not zero: maximum column */ |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 135 | } regmmatch_T; |
| 136 | |
| 137 | /* |
| 138 | * Structure used to store external references: "\z\(\)" to "\z\1". |
| 139 | * Use a reference count to avoid the need to copy this around. When it goes |
| 140 | * from 1 to zero the matches need to be freed. |
| 141 | */ |
| 142 | typedef struct |
| 143 | { |
| 144 | short refcnt; |
| 145 | char_u *matches[NSUBEXP]; |
| 146 | } reg_extmatch_T; |
| 147 | |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 148 | struct regengine |
| 149 | { |
| 150 | regprog_T *(*regcomp)(char_u*, int); |
Bram Moolenaar | 473de61 | 2013-06-08 18:19:48 +0200 | [diff] [blame] | 151 | void (*regfree)(regprog_T *); |
Bram Moolenaar | fbc0d2e | 2013-05-19 19:40:29 +0200 | [diff] [blame] | 152 | int (*regexec)(regmatch_T*, char_u*, colnr_T); |
| 153 | #if defined(FEAT_MODIFY_FNAME) || defined(FEAT_EVAL) \ |
| 154 | || defined(FIND_REPLACE_DIALOG) || defined(PROTO) |
| 155 | int (*regexec_nl)(regmatch_T*, char_u*, colnr_T); |
| 156 | #endif |
| 157 | long (*regexec_multi)(regmmatch_T*, win_T*, buf_T*, linenr_T, colnr_T, proftime_T*); |
| 158 | #ifdef DEBUG |
| 159 | char_u *expr; |
| 160 | #endif |
| 161 | }; |
| 162 | |
Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 163 | #endif /* _REGEXP_H */ |