Mercurial > vim
annotate src/search.c @ 4494:6d517f6e5f0b v7.3.995
updated for version 7.3.995
Problem: Python: Module initialization is duplicated.
Solution: Move to shared file. (ZyX)
| author | Bram Moolenaar <bram@vim.org> |
|---|---|
| date | Tue, 21 May 2013 19:11:01 +0200 |
| parents | 04736b4030ec |
| children | 66803af09906 |
| rev | line source |
|---|---|
| 7 | 1 /* vi:set ts=8 sts=4 sw=4: |
| 2 * | |
| 3 * VIM - Vi IMproved by Bram Moolenaar | |
| 4 * | |
| 5 * Do ":help uganda" in Vim to read copying and usage conditions. | |
| 6 * Do ":help credits" in Vim to see a list of people who contributed. | |
| 7 * See README.txt for an overview of the Vim source code. | |
| 8 */ | |
| 9 /* | |
| 10 * search.c: code for normal mode searching commands | |
| 11 */ | |
| 12 | |
| 13 #include "vim.h" | |
| 14 | |
| 15 static void save_re_pat __ARGS((int idx, char_u *pat, int magic)); | |
| 16 #ifdef FEAT_EVAL | |
| 1624 | 17 static void set_vv_searchforward __ARGS((void)); |
| 7 | 18 static int first_submatch __ARGS((regmmatch_T *rp)); |
| 19 #endif | |
| 20 static int check_prevcol __ARGS((char_u *linep, int col, int ch, int *prevcol)); | |
| 21 static int inmacro __ARGS((char_u *, char_u *)); | |
| 22 static int check_linecomment __ARGS((char_u *line)); | |
| 23 static int cls __ARGS((void)); | |
| 24 static int skip_chars __ARGS((int, int)); | |
| 25 #ifdef FEAT_TEXTOBJ | |
| 26 static void back_in_line __ARGS((void)); | |
| 27 static void find_first_blank __ARGS((pos_T *)); | |
| 28 static void findsent_forward __ARGS((long count, int at_start_sent)); | |
| 29 #endif | |
| 30 #ifdef FEAT_FIND_ID | |
| 31 static void show_pat_in_path __ARGS((char_u *, int, | |
| 32 int, int, FILE *, linenr_T *, long)); | |
| 33 #endif | |
| 34 #ifdef FEAT_VIMINFO | |
| 35 static void wvsp_one __ARGS((FILE *fp, int idx, char *s, int sc)); | |
| 36 #endif | |
| 37 | |
| 38 /* | |
| 39 * This file contains various searching-related routines. These fall into | |
| 40 * three groups: | |
| 41 * 1. string searches (for /, ?, n, and N) | |
| 42 * 2. character searches within a single line (for f, F, t, T, etc) | |
| 43 * 3. "other" kinds of searches like the '%' command, and 'word' searches. | |
| 44 */ | |
| 45 | |
| 46 /* | |
| 47 * String searches | |
| 48 * | |
| 49 * The string search functions are divided into two levels: | |
| 50 * lowest: searchit(); uses an pos_T for starting position and found match. | |
| 51 * Highest: do_search(); uses curwin->w_cursor; calls searchit(). | |
| 52 * | |
| 53 * The last search pattern is remembered for repeating the same search. | |
| 54 * This pattern is shared between the :g, :s, ? and / commands. | |
| 55 * This is in search_regcomp(). | |
| 56 * | |
| 57 * The actual string matching is done using a heavily modified version of | |
| 58 * Henry Spencer's regular expression library. See regexp.c. | |
| 59 */ | |
| 60 | |
| 61 /* The offset for a search command is store in a soff struct */ | |
| 62 /* Note: only spats[0].off is really used */ | |
| 63 struct soffset | |
| 64 { | |
| 1624 | 65 int dir; /* search direction, '/' or '?' */ |
| 7 | 66 int line; /* search has line offset */ |
| 67 int end; /* search set cursor at end */ | |
| 68 long off; /* line or char offset */ | |
| 69 }; | |
| 70 | |
| 71 /* A search pattern and its attributes are stored in a spat struct */ | |
| 72 struct spat | |
| 73 { | |
| 74 char_u *pat; /* the pattern (in allocated memory) or NULL */ | |
| 75 int magic; /* magicness of the pattern */ | |
| 4352 | 76 int no_scs; /* no smartcase for this pattern */ |
| 7 | 77 struct soffset off; |
| 78 }; | |
| 79 | |
| 80 /* | |
| 81 * Two search patterns are remembered: One for the :substitute command and | |
| 82 * one for other searches. last_idx points to the one that was used the last | |
| 83 * time. | |
| 84 */ | |
| 85 static struct spat spats[2] = | |
| 86 { | |
| 87 {NULL, TRUE, FALSE, {'/', 0, 0, 0L}}, /* last used search pat */ | |
| 88 {NULL, TRUE, FALSE, {'/', 0, 0, 0L}} /* last used substitute pat */ | |
| 89 }; | |
| 90 | |
| 91 static int last_idx = 0; /* index in spats[] for RE_LAST */ | |
| 92 | |
| 93 #if defined(FEAT_AUTOCMD) || defined(FEAT_EVAL) || defined(PROTO) | |
| 94 /* copy of spats[], for keeping the search patterns while executing autocmds */ | |
| 95 static struct spat saved_spats[2]; | |
| 96 static int saved_last_idx = 0; | |
| 97 # ifdef FEAT_SEARCH_EXTRA | |
| 98 static int saved_no_hlsearch = 0; | |
| 99 # endif | |
| 100 #endif | |
| 101 | |
| 102 static char_u *mr_pattern = NULL; /* pattern used by search_regcomp() */ | |
| 103 #ifdef FEAT_RIGHTLEFT | |
| 104 static int mr_pattern_alloced = FALSE; /* mr_pattern was allocated */ | |
| 105 #endif | |
| 106 | |
| 107 #ifdef FEAT_FIND_ID | |
| 108 /* | |
| 109 * Type used by find_pattern_in_path() to remember which included files have | |
| 110 * been searched already. | |
| 111 */ | |
| 112 typedef struct SearchedFile | |
| 113 { | |
| 114 FILE *fp; /* File pointer */ | |
| 115 char_u *name; /* Full name of file */ | |
| 116 linenr_T lnum; /* Line we were up to in file */ | |
| 117 int matched; /* Found a match in this file */ | |
| 118 } SearchedFile; | |
| 119 #endif | |
| 120 | |
| 121 /* | |
| 122 * translate search pattern for vim_regcomp() | |
| 123 * | |
| 124 * pat_save == RE_SEARCH: save pat in spats[RE_SEARCH].pat (normal search cmd) | |
| 125 * pat_save == RE_SUBST: save pat in spats[RE_SUBST].pat (:substitute command) | |
| 126 * pat_save == RE_BOTH: save pat in both patterns (:global command) | |
| 127 * pat_use == RE_SEARCH: use previous search pattern if "pat" is NULL | |
| 1222 | 128 * pat_use == RE_SUBST: use previous substitute pattern if "pat" is NULL |
| 7 | 129 * pat_use == RE_LAST: use last used pattern if "pat" is NULL |
| 130 * options & SEARCH_HIS: put search string in history | |
| 131 * options & SEARCH_KEEP: keep previous search pattern | |
| 132 * | |
| 133 * returns FAIL if failed, OK otherwise. | |
| 134 */ | |
| 135 int | |
| 136 search_regcomp(pat, pat_save, pat_use, options, regmatch) | |
| 137 char_u *pat; | |
| 138 int pat_save; | |
| 139 int pat_use; | |
| 140 int options; | |
| 141 regmmatch_T *regmatch; /* return: pattern and ignore-case flag */ | |
| 142 { | |
| 143 int magic; | |
| 144 int i; | |
| 145 | |
| 146 rc_did_emsg = FALSE; | |
| 147 magic = p_magic; | |
| 148 | |
| 149 /* | |
| 150 * If no pattern given, use a previously defined pattern. | |
| 151 */ | |
| 152 if (pat == NULL || *pat == NUL) | |
| 153 { | |
| 154 if (pat_use == RE_LAST) | |
| 155 i = last_idx; | |
| 156 else | |
| 157 i = pat_use; | |
| 158 if (spats[i].pat == NULL) /* pattern was never defined */ | |
| 159 { | |
| 160 if (pat_use == RE_SUBST) | |
| 161 EMSG(_(e_nopresub)); | |
| 162 else | |
| 163 EMSG(_(e_noprevre)); | |
| 164 rc_did_emsg = TRUE; | |
| 165 return FAIL; | |
| 166 } | |
| 167 pat = spats[i].pat; | |
| 168 magic = spats[i].magic; | |
| 169 no_smartcase = spats[i].no_scs; | |
| 170 } | |
| 171 #ifdef FEAT_CMDHIST | |
| 172 else if (options & SEARCH_HIS) /* put new pattern in history */ | |
| 173 add_to_history(HIST_SEARCH, pat, TRUE, NUL); | |
| 174 #endif | |
| 175 | |
| 176 #ifdef FEAT_RIGHTLEFT | |
| 177 if (mr_pattern_alloced) | |
| 178 { | |
| 179 vim_free(mr_pattern); | |
| 180 mr_pattern_alloced = FALSE; | |
| 181 } | |
| 182 | |
| 183 if (curwin->w_p_rl && *curwin->w_p_rlc == 's') | |
| 184 { | |
| 185 char_u *rev_pattern; | |
| 186 | |
| 187 rev_pattern = reverse_text(pat); | |
| 188 if (rev_pattern == NULL) | |
| 189 mr_pattern = pat; /* out of memory, keep normal pattern. */ | |
| 190 else | |
| 191 { | |
| 192 mr_pattern = rev_pattern; | |
| 193 mr_pattern_alloced = TRUE; | |
| 194 } | |
| 195 } | |
| 196 else | |
| 197 #endif | |
| 198 mr_pattern = pat; | |
| 199 | |
| 200 /* | |
| 201 * Save the currently used pattern in the appropriate place, | |
| 202 * unless the pattern should not be remembered. | |
| 203 */ | |
| 204 if (!(options & SEARCH_KEEP)) | |
| 205 { | |
| 206 /* search or global command */ | |
| 207 if (pat_save == RE_SEARCH || pat_save == RE_BOTH) | |
| 208 save_re_pat(RE_SEARCH, pat, magic); | |
| 209 /* substitute or global command */ | |
| 210 if (pat_save == RE_SUBST || pat_save == RE_BOTH) | |
| 211 save_re_pat(RE_SUBST, pat, magic); | |
| 212 } | |
| 213 | |
| 214 regmatch->rmm_ic = ignorecase(pat); | |
| 410 | 215 regmatch->rmm_maxcol = 0; |
| 7 | 216 regmatch->regprog = vim_regcomp(pat, magic ? RE_MAGIC : 0); |
| 217 if (regmatch->regprog == NULL) | |
| 218 return FAIL; | |
| 219 return OK; | |
| 220 } | |
| 221 | |
| 222 /* | |
| 223 * Get search pattern used by search_regcomp(). | |
| 224 */ | |
| 225 char_u * | |
| 226 get_search_pat() | |
| 227 { | |
| 228 return mr_pattern; | |
| 229 } | |
| 230 | |
| 1344 | 231 #if defined(FEAT_RIGHTLEFT) || defined(PROTO) |
| 7 | 232 /* |
| 233 * Reverse text into allocated memory. | |
| 234 * Returns the allocated string, NULL when out of memory. | |
| 235 */ | |
| 1344 | 236 char_u * |
| 7 | 237 reverse_text(s) |
| 238 char_u *s; | |
| 239 { | |
| 240 unsigned len; | |
| 241 unsigned s_i, rev_i; | |
| 242 char_u *rev; | |
| 243 | |
| 244 /* | |
| 245 * Reverse the pattern. | |
| 246 */ | |
| 247 len = (unsigned)STRLEN(s); | |
| 248 rev = alloc(len + 1); | |
| 249 if (rev != NULL) | |
| 250 { | |
| 251 rev_i = len; | |
| 252 for (s_i = 0; s_i < len; ++s_i) | |
| 253 { | |
| 254 # ifdef FEAT_MBYTE | |
| 255 if (has_mbyte) | |
| 256 { | |
| 257 int mb_len; | |
| 258 | |
| 474 | 259 mb_len = (*mb_ptr2len)(s + s_i); |
| 7 | 260 rev_i -= mb_len; |
| 261 mch_memmove(rev + rev_i, s + s_i, mb_len); | |
| 262 s_i += mb_len - 1; | |
| 263 } | |
| 264 else | |
| 265 # endif | |
| 266 rev[--rev_i] = s[s_i]; | |
| 267 | |
| 268 } | |
| 269 rev[len] = NUL; | |
| 270 } | |
| 271 return rev; | |
| 272 } | |
| 273 #endif | |
| 274 | |
| 275 static void | |
| 276 save_re_pat(idx, pat, magic) | |
| 277 int idx; | |
| 278 char_u *pat; | |
| 279 int magic; | |
| 280 { | |
| 281 if (spats[idx].pat != pat) | |
| 282 { | |
| 283 vim_free(spats[idx].pat); | |
| 284 spats[idx].pat = vim_strsave(pat); | |
| 285 spats[idx].magic = magic; | |
| 286 spats[idx].no_scs = no_smartcase; | |
| 287 last_idx = idx; | |
| 288 #ifdef FEAT_SEARCH_EXTRA | |
| 289 /* If 'hlsearch' set and search pat changed: need redraw. */ | |
| 290 if (p_hls) | |
| 745 | 291 redraw_all_later(SOME_VALID); |
| 7 | 292 no_hlsearch = FALSE; |
| 293 #endif | |
| 294 } | |
| 295 } | |
| 296 | |
| 297 #if defined(FEAT_AUTOCMD) || defined(FEAT_EVAL) || defined(PROTO) | |
| 298 /* | |
| 299 * Save the search patterns, so they can be restored later. | |
| 300 * Used before/after executing autocommands and user functions. | |
| 301 */ | |
| 302 static int save_level = 0; | |
| 303 | |
| 304 void | |
| 305 save_search_patterns() | |
| 306 { | |
| 307 if (save_level++ == 0) | |
| 308 { | |
| 309 saved_spats[0] = spats[0]; | |
| 310 if (spats[0].pat != NULL) | |
| 311 saved_spats[0].pat = vim_strsave(spats[0].pat); | |
| 312 saved_spats[1] = spats[1]; | |
| 313 if (spats[1].pat != NULL) | |
| 314 saved_spats[1].pat = vim_strsave(spats[1].pat); | |
| 315 saved_last_idx = last_idx; | |
| 316 # ifdef FEAT_SEARCH_EXTRA | |
| 317 saved_no_hlsearch = no_hlsearch; | |
| 318 # endif | |
| 319 } | |
| 320 } | |
| 321 | |
| 322 void | |
| 323 restore_search_patterns() | |
| 324 { | |
| 325 if (--save_level == 0) | |
| 326 { | |
| 327 vim_free(spats[0].pat); | |
| 328 spats[0] = saved_spats[0]; | |
| 1624 | 329 #if defined(FEAT_EVAL) |
| 330 set_vv_searchforward(); | |
| 331 #endif | |
| 7 | 332 vim_free(spats[1].pat); |
| 333 spats[1] = saved_spats[1]; | |
| 334 last_idx = saved_last_idx; | |
| 335 # ifdef FEAT_SEARCH_EXTRA | |
| 336 no_hlsearch = saved_no_hlsearch; | |
| 337 # endif | |
| 338 } | |
| 339 } | |
| 340 #endif | |
| 341 | |
| 359 | 342 #if defined(EXITFREE) || defined(PROTO) |
| 343 void | |
| 344 free_search_patterns() | |
| 345 { | |
| 346 vim_free(spats[0].pat); | |
| 347 vim_free(spats[1].pat); | |
| 1862 | 348 |
| 349 # ifdef FEAT_RIGHTLEFT | |
| 350 if (mr_pattern_alloced) | |
| 351 { | |
|
2311
ccda151dde4e
Support completion for ":find". (Nazri Ramliy)
Bram Moolenaar <bram@vim.org>
parents:
2302
diff
changeset
|
352 vim_free(mr_pattern); |
|
ccda151dde4e
Support completion for ":find". (Nazri Ramliy)
Bram Moolenaar <bram@vim.org>
parents:
2302
diff
changeset
|
353 mr_pattern_alloced = FALSE; |
|
ccda151dde4e
Support completion for ":find". (Nazri Ramliy)
Bram Moolenaar <bram@vim.org>
parents:
2302
diff
changeset
|
354 mr_pattern = NULL; |
| 1862 | 355 } |
| 356 # endif | |
| 359 | 357 } |
| 358 #endif | |
| 359 | |
| 7 | 360 /* |
| 361 * Return TRUE when case should be ignored for search pattern "pat". | |
| 362 * Uses the 'ignorecase' and 'smartcase' options. | |
| 363 */ | |
| 364 int | |
| 365 ignorecase(pat) | |
| 366 char_u *pat; | |
| 367 { | |
|
2302
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
368 int ic = p_ic; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
369 |
| 7 | 370 if (ic && !no_smartcase && p_scs |
| 371 #ifdef FEAT_INS_EXPAND | |
| 372 && !(ctrl_x_mode && curbuf->b_p_inf) | |
| 373 #endif | |
| 374 ) | |
|
2302
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
375 ic = !pat_has_uppercase(pat); |
| 7 | 376 no_smartcase = FALSE; |
| 377 | |
| 378 return ic; | |
| 379 } | |
| 380 | |
|
2302
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
381 /* |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
382 * Return TRUE if patter "pat" has an uppercase character. |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
383 */ |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
384 int |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
385 pat_has_uppercase(pat) |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
386 char_u *pat; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
387 { |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
388 char_u *p = pat; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
389 |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
390 while (*p != NUL) |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
391 { |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
392 #ifdef FEAT_MBYTE |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
393 int l; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
394 |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
395 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
396 { |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
397 if (enc_utf8 && utf_isupper(utf_ptr2char(p))) |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
398 return TRUE; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
399 p += l; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
400 } |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
401 else |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
402 #endif |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
403 if (*p == '\\') |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
404 { |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
405 if (p[1] == '_' && p[2] != NUL) /* skip "\_X" */ |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
406 p += 3; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
407 else if (p[1] == '%' && p[2] != NUL) /* skip "\%X" */ |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
408 p += 3; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
409 else if (p[1] != NUL) /* skip "\X" */ |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
410 p += 2; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
411 else |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
412 p += 1; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
413 } |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
414 else if (MB_ISUPPER(*p)) |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
415 return TRUE; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
416 else |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
417 ++p; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
418 } |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
419 return FALSE; |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
420 } |
|
488be8cbe19c
Make CTRL-L in command line mode respect 'ignorecase' and 'smartcase'. (Martin
Bram Moolenaar <bram@vim.org>
parents:
2282
diff
changeset
|
421 |
| 7 | 422 char_u * |
| 423 last_search_pat() | |
| 424 { | |
| 425 return spats[last_idx].pat; | |
| 426 } | |
| 427 | |
| 428 /* | |
| 429 * Reset search direction to forward. For "gd" and "gD" commands. | |
| 430 */ | |
| 431 void | |
| 432 reset_search_dir() | |
| 433 { | |
| 434 spats[0].off.dir = '/'; | |
| 1624 | 435 #if defined(FEAT_EVAL) |
| 436 set_vv_searchforward(); | |
| 437 #endif | |
| 7 | 438 } |
| 439 | |
| 440 #if defined(FEAT_EVAL) || defined(FEAT_VIMINFO) | |
| 441 /* | |
| 442 * Set the last search pattern. For ":let @/ =" and viminfo. | |
| 443 * Also set the saved search pattern, so that this works in an autocommand. | |
| 444 */ | |
| 445 void | |
| 446 set_last_search_pat(s, idx, magic, setlast) | |
| 447 char_u *s; | |
| 448 int idx; | |
| 449 int magic; | |
| 450 int setlast; | |
| 451 { | |
| 452 vim_free(spats[idx].pat); | |
| 453 /* An empty string means that nothing should be matched. */ | |
| 454 if (*s == NUL) | |
| 455 spats[idx].pat = NULL; | |
| 456 else | |
| 457 spats[idx].pat = vim_strsave(s); | |
| 458 spats[idx].magic = magic; | |
| 459 spats[idx].no_scs = FALSE; | |
| 460 spats[idx].off.dir = '/'; | |
| 1624 | 461 #if defined(FEAT_EVAL) |
| 462 set_vv_searchforward(); | |
| 463 #endif | |
| 7 | 464 spats[idx].off.line = FALSE; |
| 465 spats[idx].off.end = FALSE; | |
| 466 spats[idx].off.off = 0; | |
| 467 if (setlast) | |
| 468 last_idx = idx; | |
| 469 if (save_level) | |
| 470 { | |
| 471 vim_free(saved_spats[idx].pat); | |
| 472 saved_spats[idx] = spats[0]; | |
| 473 if (spats[idx].pat == NULL) | |
| 474 saved_spats[idx].pat = NULL; | |
| 475 else | |
| 476 saved_spats[idx].pat = vim_strsave(spats[idx].pat); | |
| 477 saved_last_idx = last_idx; | |
| 478 } | |
| 479 # ifdef FEAT_SEARCH_EXTRA | |
| 480 /* If 'hlsearch' set and search pat changed: need redraw. */ | |
| 481 if (p_hls && idx == last_idx && !no_hlsearch) | |
| 745 | 482 redraw_all_later(SOME_VALID); |
| 7 | 483 # endif |
| 484 } | |
| 485 #endif | |
| 486 | |
| 487 #ifdef FEAT_SEARCH_EXTRA | |
| 488 /* | |
| 489 * Get a regexp program for the last used search pattern. | |
| 490 * This is used for highlighting all matches in a window. | |
| 491 * Values returned in regmatch->regprog and regmatch->rmm_ic. | |
| 492 */ | |
| 493 void | |
| 494 last_pat_prog(regmatch) | |
| 495 regmmatch_T *regmatch; | |
| 496 { | |
| 497 if (spats[last_idx].pat == NULL) | |
| 498 { | |
| 499 regmatch->regprog = NULL; | |
| 500 return; | |
| 501 } | |
| 502 ++emsg_off; /* So it doesn't beep if bad expr */ | |
| 503 (void)search_regcomp((char_u *)"", 0, last_idx, SEARCH_KEEP, regmatch); | |
| 504 --emsg_off; | |
| 505 } | |
| 506 #endif | |
| 507 | |
| 508 /* | |
| 509 * lowest level search function. | |
| 510 * Search for 'count'th occurrence of pattern 'pat' in direction 'dir'. | |
| 511 * Start at position 'pos' and return the found position in 'pos'. | |
| 512 * | |
| 513 * if (options & SEARCH_MSG) == 0 don't give any messages | |
| 514 * if (options & SEARCH_MSG) == SEARCH_NFMSG don't give 'notfound' messages | |
| 515 * if (options & SEARCH_MSG) == SEARCH_MSG give all messages | |
| 516 * if (options & SEARCH_HIS) put search pattern in history | |
| 517 * if (options & SEARCH_END) return position at end of match | |
| 518 * if (options & SEARCH_START) accept match at pos itself | |
| 519 * if (options & SEARCH_KEEP) keep previous search pattern | |
| 520 * if (options & SEARCH_FOLD) match only once in a closed fold | |
| 521 * if (options & SEARCH_PEEK) check for typed char, cancel search | |
| 522 * | |
| 523 * Return FAIL (zero) for failure, non-zero for success. | |
| 524 * When FEAT_EVAL is defined, returns the index of the first matching | |
| 525 * subpattern plus one; one if there was none. | |
| 526 */ | |
| 527 int | |
| 1496 | 528 searchit(win, buf, pos, dir, pat, count, options, pat_use, stop_lnum, tm) |
| 7 | 529 win_T *win; /* window to search in; can be NULL for a |
| 530 buffer without a window! */ | |
| 531 buf_T *buf; | |
| 532 pos_T *pos; | |
| 533 int dir; | |
| 534 char_u *pat; | |
| 535 long count; | |
| 536 int options; | |
| 692 | 537 int pat_use; /* which pattern to use when "pat" is empty */ |
| 538 linenr_T stop_lnum; /* stop after this line number when != 0 */ | |
| 1877 | 539 proftime_T *tm UNUSED; /* timeout limit or NULL */ |
| 7 | 540 { |
| 541 int found; | |
| 542 linenr_T lnum; /* no init to shut up Apollo cc */ | |
| 543 regmmatch_T regmatch; | |
| 544 char_u *ptr; | |
| 545 colnr_T matchcol; | |
| 546 lpos_T endpos; | |
| 140 | 547 lpos_T matchpos; |
| 7 | 548 int loop; |
| 549 pos_T start_pos; | |
| 550 int at_first_line; | |
| 551 int extra_col; | |
| 552 int match_ok; | |
| 553 long nmatched; | |
| 554 int submatch = 0; | |
| 648 | 555 int save_called_emsg = called_emsg; |
| 7 | 556 #ifdef FEAT_SEARCH_EXTRA |
| 557 int break_loop = FALSE; | |
| 558 #endif | |
| 559 | |
| 560 if (search_regcomp(pat, RE_SEARCH, pat_use, | |
| 561 (options & (SEARCH_HIS + SEARCH_KEEP)), ®match) == FAIL) | |
| 562 { | |
| 563 if ((options & SEARCH_MSG) && !rc_did_emsg) | |
| 564 EMSG2(_("E383: Invalid search string: %s"), mr_pattern); | |
| 565 return FAIL; | |
| 566 } | |
| 567 | |
| 1557 | 568 /* When not accepting a match at the start position set "extra_col" to a |
| 569 * non-zero value. Don't do that when starting at MAXCOL, since MAXCOL + | |
| 570 * 1 is zero. */ | |
| 571 if ((options & SEARCH_START) || pos->col == MAXCOL) | |
| 7 | 572 extra_col = 0; |
| 573 #ifdef FEAT_MBYTE | |
| 574 /* Watch out for the "col" being MAXCOL - 2, used in a closed fold. */ | |
| 4049 | 575 else if (dir != BACKWARD && has_mbyte |
| 576 && pos->lnum >= 1 && pos->lnum <= buf->b_ml.ml_line_count | |
| 7 | 577 && pos->col < MAXCOL - 2) |
| 481 | 578 { |
| 579 ptr = ml_get_buf(buf, pos->lnum, FALSE) + pos->col; | |
| 580 if (*ptr == NUL) | |
| 581 extra_col = 1; | |
| 582 else | |
| 583 extra_col = (*mb_ptr2len)(ptr); | |
| 584 } | |
| 7 | 585 #endif |
| 586 else | |
| 587 extra_col = 1; | |
| 588 | |
| 648 | 589 /* |
| 590 * find the string | |
| 591 */ | |
| 7 | 592 called_emsg = FALSE; |
| 593 do /* loop for count */ | |
| 594 { | |
| 595 start_pos = *pos; /* remember start pos for detecting no match */ | |
| 596 found = 0; /* default: not found */ | |
| 597 at_first_line = TRUE; /* default: start in first line */ | |
| 598 if (pos->lnum == 0) /* correct lnum for when starting in line 0 */ | |
| 599 { | |
| 600 pos->lnum = 1; | |
| 601 pos->col = 0; | |
| 602 at_first_line = FALSE; /* not in first line now */ | |
| 603 } | |
| 604 | |
| 605 /* | |
| 606 * Start searching in current line, unless searching backwards and | |
| 607 * we're in column 0. | |
| 1311 | 608 * If we are searching backwards, in column 0, and not including the |
| 609 * current position, gain some efficiency by skipping back a line. | |
| 610 * Otherwise begin the search in the current line. | |
| 7 | 611 */ |
| 1311 | 612 if (dir == BACKWARD && start_pos.col == 0 |
| 613 && (options & SEARCH_START) == 0) | |
| 7 | 614 { |
| 615 lnum = pos->lnum - 1; | |
| 616 at_first_line = FALSE; | |
| 617 } | |
| 618 else | |
| 619 lnum = pos->lnum; | |
| 620 | |
| 621 for (loop = 0; loop <= 1; ++loop) /* loop twice if 'wrapscan' set */ | |
| 622 { | |
| 623 for ( ; lnum > 0 && lnum <= buf->b_ml.ml_line_count; | |
| 624 lnum += dir, at_first_line = FALSE) | |
| 625 { | |
| 692 | 626 /* Stop after checking "stop_lnum", if it's set. */ |
| 627 if (stop_lnum != 0 && (dir == FORWARD | |
| 628 ? lnum > stop_lnum : lnum < stop_lnum)) | |
| 629 break; | |
| 1496 | 630 #ifdef FEAT_RELTIME |
| 631 /* Stop after passing the "tm" time limit. */ | |
| 632 if (tm != NULL && profile_passed_limit(tm)) | |
| 633 break; | |
| 634 #endif | |
| 692 | 635 |
| 7 | 636 /* |
| 140 | 637 * Look for a match somewhere in line "lnum". |
| 7 | 638 */ |
| 639 nmatched = vim_regexec_multi(®match, win, buf, | |
| 1521 | 640 lnum, (colnr_T)0, |
| 641 #ifdef FEAT_RELTIME | |
| 642 tm | |
| 643 #else | |
| 644 NULL | |
| 645 #endif | |
| 646 ); | |
| 7 | 647 /* Abort searching on an error (e.g., out of stack). */ |
| 648 if (called_emsg) | |
| 649 break; | |
| 650 if (nmatched > 0) | |
| 651 { | |
| 652 /* match may actually be in another line when using \zs */ | |
| 140 | 653 matchpos = regmatch.startpos[0]; |
| 7 | 654 endpos = regmatch.endpos[0]; |
| 1521 | 655 #ifdef FEAT_EVAL |
| 7 | 656 submatch = first_submatch(®match); |
| 1521 | 657 #endif |
| 1544 | 658 /* "lnum" may be past end of buffer for "\n\zs". */ |
| 685 | 659 if (lnum + matchpos.lnum > buf->b_ml.ml_line_count) |
| 660 ptr = (char_u *)""; | |
| 661 else | |
| 662 ptr = ml_get_buf(buf, lnum + matchpos.lnum, FALSE); | |
| 7 | 663 |
| 664 /* | |
| 665 * Forward search in the first line: match should be after | |
| 666 * the start position. If not, continue at the end of the | |
| 667 * match (this is vi compatible) or on the next char. | |
| 668 */ | |
| 669 if (dir == FORWARD && at_first_line) | |
| 670 { | |
| 671 match_ok = TRUE; | |
| 672 /* | |
| 140 | 673 * When the match starts in a next line it's certainly |
| 674 * past the start position. | |
| 7 | 675 * When match lands on a NUL the cursor will be put |
| 676 * one back afterwards, compare with that position, | |
| 677 * otherwise "/$" will get stuck on end of line. | |
| 678 */ | |
| 140 | 679 while (matchpos.lnum == 0 |
| 680 && ((options & SEARCH_END) | |
| 681 ? (nmatched == 1 | |
| 682 && (int)endpos.col - 1 | |
| 7 | 683 < (int)start_pos.col + extra_col) |
| 140 | 684 : ((int)matchpos.col |
| 685 - (ptr[matchpos.col] == NUL) | |
| 686 < (int)start_pos.col + extra_col))) | |
| 7 | 687 { |
| 688 /* | |
| 689 * If vi-compatible searching, continue at the end | |
| 690 * of the match, otherwise continue one position | |
| 691 * forward. | |
| 692 */ | |
| 693 if (vim_strchr(p_cpo, CPO_SEARCH) != NULL) | |
| 694 { | |
| 695 if (nmatched > 1) | |
| 696 { | |
| 697 /* end is in next line, thus no match in | |
| 698 * this line */ | |
| 699 match_ok = FALSE; | |
| 700 break; | |
| 701 } | |
| 702 matchcol = endpos.col; | |
| 703 /* for empty match: advance one char */ | |
| 140 | 704 if (matchcol == matchpos.col |
| 7 | 705 && ptr[matchcol] != NUL) |
| 706 { | |
| 707 #ifdef FEAT_MBYTE | |
| 708 if (has_mbyte) | |
| 709 matchcol += | |
| 474 | 710 (*mb_ptr2len)(ptr + matchcol); |
| 7 | 711 else |
| 712 #endif | |
| 713 ++matchcol; | |
| 714 } | |
| 715 } | |
| 716 else | |
| 717 { | |
| 140 | 718 matchcol = matchpos.col; |
| 7 | 719 if (ptr[matchcol] != NUL) |
| 720 { | |
| 721 #ifdef FEAT_MBYTE | |
| 722 if (has_mbyte) | |
| 474 | 723 matchcol += (*mb_ptr2len)(ptr |
| 7 | 724 + matchcol); |
| 725 else | |
| 726 #endif | |
| 727 ++matchcol; | |
| 728 } | |
| 729 } | |
| 4252 | 730 if (matchcol == 0 && (options & SEARCH_START)) |
| 4240 | 731 break; |
| 7 | 732 if (ptr[matchcol] == NUL |
| 733 || (nmatched = vim_regexec_multi(®match, | |
| 140 | 734 win, buf, lnum + matchpos.lnum, |
| 1521 | 735 matchcol, |
| 736 #ifdef FEAT_RELTIME | |
| 737 tm | |
| 738 #else | |
| 739 NULL | |
| 740 #endif | |
| 741 )) == 0) | |
| 7 | 742 { |
| 743 match_ok = FALSE; | |
| 744 break; | |
| 745 } | |
| 140 | 746 matchpos = regmatch.startpos[0]; |
| 7 | 747 endpos = regmatch.endpos[0]; |
| 748 # ifdef FEAT_EVAL | |
| 749 submatch = first_submatch(®match); | |
| 750 # endif | |
| 751 | |
| 752 /* Need to get the line pointer again, a | |
| 753 * multi-line search may have made it invalid. */ | |
| 140 | 754 ptr = ml_get_buf(buf, lnum + matchpos.lnum, FALSE); |
| 7 | 755 } |
| 756 if (!match_ok) | |
| 757 continue; | |
| 758 } | |
| 759 if (dir == BACKWARD) | |
| 760 { | |
| 761 /* | |
| 762 * Now, if there are multiple matches on this line, | |
| 763 * we have to get the last one. Or the last one before | |
| 764 * the cursor, if we're on that line. | |
| 765 * When putting the new cursor at the end, compare | |
| 766 * relative to the end of the match. | |
| 767 */ | |
| 768 match_ok = FALSE; | |
| 769 for (;;) | |
| 770 { | |
| 140 | 771 /* Remember a position that is before the start |
| 772 * position, we use it if it's the last match in | |
| 773 * the line. Always accept a position after | |
| 774 * wrapping around. */ | |
| 775 if (loop | |
| 776 || ((options & SEARCH_END) | |
| 777 ? (lnum + regmatch.endpos[0].lnum | |
| 778 < start_pos.lnum | |
| 779 || (lnum + regmatch.endpos[0].lnum | |
| 780 == start_pos.lnum | |
| 781 && (int)regmatch.endpos[0].col - 1 | |
| 7 | 782 + extra_col |
| 140 | 783 <= (int)start_pos.col)) |
| 784 : (lnum + regmatch.startpos[0].lnum | |
| 785 < start_pos.lnum | |
| 786 || (lnum + regmatch.startpos[0].lnum | |
| 787 == start_pos.lnum | |
| 788 && (int)regmatch.startpos[0].col | |
| 7 | 789 + extra_col |
| 140 | 790 <= (int)start_pos.col)))) |
| 7 | 791 { |
| 792 match_ok = TRUE; | |
| 140 | 793 matchpos = regmatch.startpos[0]; |
| 7 | 794 endpos = regmatch.endpos[0]; |
| 795 # ifdef FEAT_EVAL | |
| 796 submatch = first_submatch(®match); | |
| 797 # endif | |
| 798 } | |
| 799 else | |
| 800 break; | |
| 801 | |
| 802 /* | |
| 803 * We found a valid match, now check if there is | |
| 804 * another one after it. | |
| 805 * If vi-compatible searching, continue at the end | |
| 806 * of the match, otherwise continue one position | |
| 807 * forward. | |
| 808 */ | |
| 809 if (vim_strchr(p_cpo, CPO_SEARCH) != NULL) | |
| 810 { | |
| 811 if (nmatched > 1) | |
| 812 break; | |
| 813 matchcol = endpos.col; | |
| 814 /* for empty match: advance one char */ | |
| 140 | 815 if (matchcol == matchpos.col |
| 7 | 816 && ptr[matchcol] != NUL) |
| 817 { | |
| 818 #ifdef FEAT_MBYTE | |
| 819 if (has_mbyte) | |
| 820 matchcol += | |
| 474 | 821 (*mb_ptr2len)(ptr + matchcol); |
| 7 | 822 else |
| 823 #endif | |
| 824 ++matchcol; | |
| 825 } | |
| 826 } | |
| 827 else | |
| 828 { | |
| 140 | 829 /* Stop when the match is in a next line. */ |
| 830 if (matchpos.lnum > 0) | |
| 831 break; | |
| 832 matchcol = matchpos.col; | |
| 7 | 833 if (ptr[matchcol] != NUL) |
| 834 { | |
| 835 #ifdef FEAT_MBYTE | |
| 836 if (has_mbyte) | |
| 837 matchcol += | |
| 474 | 838 (*mb_ptr2len)(ptr + matchcol); |
| 7 | 839 else |
| 840 #endif | |
| 841 ++matchcol; | |
| 842 } | |
| 843 } | |
| 844 if (ptr[matchcol] == NUL | |
| 845 || (nmatched = vim_regexec_multi(®match, | |
| 140 | 846 win, buf, lnum + matchpos.lnum, |
| 1521 | 847 matchcol, |
| 848 #ifdef FEAT_RELTIME | |
| 849 tm | |
| 850 #else | |
| 851 NULL | |
| 852 #endif | |
| 853 )) == 0) | |
| 7 | 854 break; |
| 855 | |
| 856 /* Need to get the line pointer again, a | |
| 857 * multi-line search may have made it invalid. */ | |
| 140 | 858 ptr = ml_get_buf(buf, lnum + matchpos.lnum, FALSE); |
| 7 | 859 } |
| 860 | |
| 861 /* | |
| 862 * If there is only a match after the cursor, skip | |
| 863 * this match. | |
| 864 */ | |
| 865 if (!match_ok) | |
| 866 continue; | |
| 867 } | |
| 868 | |
| 1544 | 869 /* With the SEARCH_END option move to the last character |
| 870 * of the match. Don't do it for an empty match, end | |
| 871 * should be same as start then. */ | |
| 4252 | 872 if ((options & SEARCH_END) && !(options & SEARCH_NOOF) |
| 1544 | 873 && !(matchpos.lnum == endpos.lnum |
| 874 && matchpos.col == endpos.col)) | |
| 7 | 875 { |
| 1544 | 876 /* For a match in the first column, set the position |
| 877 * on the NUL in the previous line. */ | |
| 140 | 878 pos->lnum = lnum + endpos.lnum; |
| 1544 | 879 pos->col = endpos.col; |
| 880 if (endpos.col == 0) | |
| 819 | 881 { |
| 1544 | 882 if (pos->lnum > 1) /* just in case */ |
| 883 { | |
| 884 --pos->lnum; | |
| 885 pos->col = (colnr_T)STRLEN(ml_get_buf(buf, | |
| 886 pos->lnum, FALSE)); | |
| 887 } | |
| 888 } | |
| 889 else | |
| 890 { | |
| 891 --pos->col; | |
| 892 #ifdef FEAT_MBYTE | |
| 893 if (has_mbyte | |
| 894 && pos->lnum <= buf->b_ml.ml_line_count) | |
| 895 { | |
| 1060 | 896 ptr = ml_get_buf(buf, pos->lnum, FALSE); |
| 1544 | 897 pos->col -= (*mb_head_off)(ptr, ptr + pos->col); |
| 898 } | |
| 899 #endif | |
| 819 | 900 } |
| 7 | 901 } |
| 902 else | |
| 903 { | |
| 140 | 904 pos->lnum = lnum + matchpos.lnum; |
| 905 pos->col = matchpos.col; | |
| 7 | 906 } |
| 907 #ifdef FEAT_VIRTUALEDIT | |
| 908 pos->coladd = 0; | |
| 909 #endif | |
| 910 found = 1; | |
| 911 | |
| 912 /* Set variables used for 'incsearch' highlighting. */ | |
| 140 | 913 search_match_lines = endpos.lnum - matchpos.lnum; |
| 7 | 914 search_match_endcol = endpos.col; |
| 915 break; | |
| 916 } | |
| 917 line_breakcheck(); /* stop if ctrl-C typed */ | |
| 918 if (got_int) | |
| 919 break; | |
| 920 | |
| 921 #ifdef FEAT_SEARCH_EXTRA | |
| 922 /* Cancel searching if a character was typed. Used for | |
| 923 * 'incsearch'. Don't check too often, that would slowdown | |
| 924 * searching too much. */ | |
| 925 if ((options & SEARCH_PEEK) | |
| 926 && ((lnum - pos->lnum) & 0x3f) == 0 | |
| 927 && char_avail()) | |
| 928 { | |
| 929 break_loop = TRUE; | |
| 930 break; | |
| 931 } | |
| 932 #endif | |
| 933 | |
| 934 if (loop && lnum == start_pos.lnum) | |
| 935 break; /* if second loop, stop where started */ | |
| 936 } | |
| 937 at_first_line = FALSE; | |
| 938 | |
| 939 /* | |
| 692 | 940 * Stop the search if wrapscan isn't set, "stop_lnum" is |
| 941 * specified, after an interrupt, after a match and after looping | |
| 942 * twice. | |
| 7 | 943 */ |
| 692 | 944 if (!p_ws || stop_lnum != 0 || got_int || called_emsg |
| 1877 | 945 #ifdef FEAT_SEARCH_EXTRA |
| 946 || break_loop | |
| 947 #endif | |
| 948 || found || loop) | |
| 7 | 949 break; |
| 950 | |
| 951 /* | |
| 952 * If 'wrapscan' is set we continue at the other end of the file. | |
| 953 * If 'shortmess' does not contain 's', we give a message. | |
| 954 * This message is also remembered in keep_msg for when the screen | |
| 955 * is redrawn. The keep_msg is cleared whenever another message is | |
| 956 * written. | |
| 957 */ | |
| 958 if (dir == BACKWARD) /* start second loop at the other end */ | |
| 959 lnum = buf->b_ml.ml_line_count; | |
| 960 else | |
| 961 lnum = 1; | |
| 504 | 962 if (!shortmess(SHM_SEARCH) && (options & SEARCH_MSG)) |
| 963 give_warning((char_u *)_(dir == BACKWARD | |
| 964 ? top_bot_msg : bot_top_msg), TRUE); | |
| 7 | 965 } |
| 1877 | 966 if (got_int || called_emsg |
| 967 #ifdef FEAT_SEARCH_EXTRA | |
| 968 || break_loop | |
| 969 #endif | |
| 970 ) | |
| 7 | 971 break; |
| 972 } | |
| 973 while (--count > 0 && found); /* stop after count matches or no match */ | |
| 974 | |
| 975 vim_free(regmatch.regprog); | |
| 976 | |
| 648 | 977 called_emsg |= save_called_emsg; |
| 978 | |
| 7 | 979 if (!found) /* did not find it */ |
| 980 { | |
| 981 if (got_int) | |
| 982 EMSG(_(e_interr)); | |
| 983 else if ((options & SEARCH_MSG) == SEARCH_MSG) | |
| 984 { | |
| 985 if (p_ws) | |
| 986 EMSG2(_(e_patnotf2), mr_pattern); | |
| 987 else if (lnum == 0) | |
| 988 EMSG2(_("E384: search hit TOP without match for: %s"), | |
| 989 mr_pattern); | |
| 990 else | |
| 991 EMSG2(_("E385: search hit BOTTOM without match for: %s"), | |
| 992 mr_pattern); | |
| 993 } | |
| 994 return FAIL; | |
| 995 } | |
| 996 | |
| 685 | 997 /* A pattern like "\n\zs" may go past the last line. */ |
| 998 if (pos->lnum > buf->b_ml.ml_line_count) | |
| 999 { | |
| 1000 pos->lnum = buf->b_ml.ml_line_count; | |
| 835 | 1001 pos->col = (int)STRLEN(ml_get_buf(buf, pos->lnum, FALSE)); |
| 685 | 1002 if (pos->col > 0) |
| 1003 --pos->col; | |
| 1004 } | |
| 1005 | |
| 7 | 1006 return submatch + 1; |
| 1007 } | |
| 1008 | |
| 1009 #ifdef FEAT_EVAL | |
| 1624 | 1010 void |
| 1011 set_search_direction(cdir) | |
| 1012 int cdir; | |
| 1013 { | |
| 1014 spats[0].off.dir = cdir; | |
| 1015 } | |
| 1016 | |
| 1017 static void | |
| 1018 set_vv_searchforward() | |
| 1019 { | |
| 1020 set_vim_var_nr(VV_SEARCHFORWARD, (long)(spats[0].off.dir == '/')); | |
| 1021 } | |
| 1022 | |
| 7 | 1023 /* |
| 1024 * Return the number of the first subpat that matched. | |
| 1025 */ | |
| 1026 static int | |
| 1027 first_submatch(rp) | |
| 1028 regmmatch_T *rp; | |
| 1029 { | |
| 1030 int submatch; | |
| 1031 | |
| 1032 for (submatch = 1; ; ++submatch) | |
| 1033 { | |
| 1034 if (rp->startpos[submatch].lnum >= 0) | |
| 1035 break; | |
| 1036 if (submatch == 9) | |
| 1037 { | |
| 1038 submatch = 0; | |
| 1039 break; | |
| 1040 } | |
| 1041 } | |
| 1042 return submatch; | |
| 1043 } | |
| 1044 #endif | |
| 1045 | |
| 1046 /* | |
| 1047 * Highest level string search function. | |
| 1222 | 1048 * Search for the 'count'th occurrence of pattern 'pat' in direction 'dirc' |
| 7 | 1049 * If 'dirc' is 0: use previous dir. |
| 1050 * If 'pat' is NULL or empty : use previous string. | |
| 1051 * If 'options & SEARCH_REV' : go in reverse of previous dir. | |
| 1052 * If 'options & SEARCH_ECHO': echo the search command and handle options | |
| 1053 * If 'options & SEARCH_MSG' : may give error message | |
| 1054 * If 'options & SEARCH_OPT' : interpret optional flags | |
| 1055 * If 'options & SEARCH_HIS' : put search pattern in history | |
| 1056 * If 'options & SEARCH_NOOF': don't add offset to position | |
| 1057 * If 'options & SEARCH_MARK': set previous context mark | |
| 1058 * If 'options & SEARCH_KEEP': keep previous search pattern | |
| 1059 * If 'options & SEARCH_START': accept match at curpos itself | |
| 1060 * If 'options & SEARCH_PEEK': check for typed char, cancel search | |
| 1061 * | |
| 1062 * Careful: If spats[0].off.line == TRUE and spats[0].off.off == 0 this | |
| 1063 * makes the movement linewise without moving the match position. | |
| 1064 * | |
| 1065 * return 0 for failure, 1 for found, 2 for found and line offset added | |
| 1066 */ | |
| 1067 int | |
| 1521 | 1068 do_search(oap, dirc, pat, count, options, tm) |
| 7 | 1069 oparg_T *oap; /* can be NULL */ |
| 1070 int dirc; /* '/' or '?' */ | |
| 1624 | 1071 char_u *pat; |
| 7 | 1072 long count; |
| 1073 int options; | |
| 1521 | 1074 proftime_T *tm; /* timeout limit or NULL */ |
| 7 | 1075 { |
| 1076 pos_T pos; /* position of the last match */ | |
| 1077 char_u *searchstr; | |
| 1078 struct soffset old_off; | |
| 1079 int retval; /* Return value */ | |
| 1080 char_u *p; | |
| 1081 long c; | |
| 1082 char_u *dircp; | |
| 1083 char_u *strcopy = NULL; | |
| 1084 char_u *ps; | |
| 1085 | |
| 1086 /* | |
| 1087 * A line offset is not remembered, this is vi compatible. | |
| 1088 */ | |
| 1089 if (spats[0].off.line && vim_strchr(p_cpo, CPO_LINEOFF) != NULL) | |
| 1090 { | |
| 1091 spats[0].off.line = FALSE; | |
| 1092 spats[0].off.off = 0; | |
| 1093 } | |
| 1094 | |
| 1095 /* | |
| 1096 * Save the values for when (options & SEARCH_KEEP) is used. | |
| 1097 * (there is no "if ()" around this because gcc wants them initialized) | |
| 1098 */ | |
| 1099 old_off = spats[0].off; | |
| 1100 | |
| 1101 pos = curwin->w_cursor; /* start searching at the cursor position */ | |
| 1102 | |
| 1103 /* | |
| 1104 * Find out the direction of the search. | |
| 1105 */ | |
| 1106 if (dirc == 0) | |
| 1107 dirc = spats[0].off.dir; | |
| 1108 else | |
| 1624 | 1109 { |
| 7 | 1110 spats[0].off.dir = dirc; |
| 1624 | 1111 #if defined(FEAT_EVAL) |
| 1112 set_vv_searchforward(); | |
| 1113 #endif | |
| 1114 } | |
| 7 | 1115 if (options & SEARCH_REV) |
| 1116 { | |
| 1117 #ifdef WIN32 | |
| 1118 /* There is a bug in the Visual C++ 2.2 compiler which means that | |
| 1119 * dirc always ends up being '/' */ | |
| 1120 dirc = (dirc == '/') ? '?' : '/'; | |
| 1121 #else | |
| 1122 if (dirc == '/') | |
| 1123 dirc = '?'; | |
| 1124 else | |
| 1125 dirc = '/'; | |
| 1126 #endif | |
| 1127 } | |
| 1128 | |
| 1129 #ifdef FEAT_FOLDING | |
| 1130 /* If the cursor is in a closed fold, don't find another match in the same | |
| 1131 * fold. */ | |
| 1132 if (dirc == '/') | |
| 1133 { | |
| 1134 if (hasFolding(pos.lnum, NULL, &pos.lnum)) | |
| 1135 pos.col = MAXCOL - 2; /* avoid overflow when adding 1 */ | |
| 1136 } | |
| 1137 else | |
| 1138 { | |
| 1139 if (hasFolding(pos.lnum, &pos.lnum, NULL)) | |
| 1140 pos.col = 0; | |
| 1141 } | |
| 1142 #endif | |
| 1143 | |
| 1144 #ifdef FEAT_SEARCH_EXTRA | |
| 1145 /* | |
| 1146 * Turn 'hlsearch' highlighting back on. | |
| 1147 */ | |
| 1148 if (no_hlsearch && !(options & SEARCH_KEEP)) | |
| 1149 { | |
| 745 | 1150 redraw_all_later(SOME_VALID); |
| 7 | 1151 no_hlsearch = FALSE; |
| 1152 } | |
| 1153 #endif | |
| 1154 | |
| 1155 /* | |
| 1156 * Repeat the search when pattern followed by ';', e.g. "/foo/;?bar". | |
| 1157 */ | |
| 1158 for (;;) | |
| 1159 { | |
| 1160 searchstr = pat; | |
| 1161 dircp = NULL; | |
| 1162 /* use previous pattern */ | |
| 1163 if (pat == NULL || *pat == NUL || *pat == dirc) | |
| 1164 { | |
| 1165 if (spats[RE_SEARCH].pat == NULL) /* no previous pattern */ | |
| 1166 { | |
| 2719 | 1167 pat = spats[RE_SUBST].pat; |
| 1168 if (pat == NULL) | |
| 1169 { | |
| 1170 EMSG(_(e_noprevre)); | |
| 1171 retval = 0; | |
| 1172 goto end_do_search; | |
| 1173 } | |
| 1174 searchstr = pat; | |
| 7 | 1175 } |
| 2719 | 1176 else |
| 1177 { | |
| 1178 /* make search_regcomp() use spats[RE_SEARCH].pat */ | |
| 1179 searchstr = (char_u *)""; | |
| 1180 } | |
| 7 | 1181 } |
| 1182 | |
| 1183 if (pat != NULL && *pat != NUL) /* look for (new) offset */ | |
| 1184 { | |
| 1185 /* | |
| 1186 * Find end of regular expression. | |
| 1187 * If there is a matching '/' or '?', toss it. | |
| 1188 */ | |
| 1189 ps = strcopy; | |
| 1190 p = skip_regexp(pat, dirc, (int)p_magic, &strcopy); | |
| 1191 if (strcopy != ps) | |
| 1192 { | |
| 1193 /* made a copy of "pat" to change "\?" to "?" */ | |
| 835 | 1194 searchcmdlen += (int)(STRLEN(pat) - STRLEN(strcopy)); |
| 7 | 1195 pat = strcopy; |
| 1196 searchstr = strcopy; | |
| 1197 } | |
| 1198 if (*p == dirc) | |
| 1199 { | |
| 1200 dircp = p; /* remember where we put the NUL */ | |
| 1201 *p++ = NUL; | |
| 1202 } | |
| 1203 spats[0].off.line = FALSE; | |
| 1204 spats[0].off.end = FALSE; | |
| 1205 spats[0].off.off = 0; | |
| 1206 /* | |
| 1207 * Check for a line offset or a character offset. | |
| 1208 * For get_address (echo off) we don't check for a character | |
| 1209 * offset, because it is meaningless and the 's' could be a | |
| 1210 * substitute command. | |
| 1211 */ | |
| 1212 if (*p == '+' || *p == '-' || VIM_ISDIGIT(*p)) | |
| 1213 spats[0].off.line = TRUE; | |
| 1214 else if ((options & SEARCH_OPT) && | |
| 1215 (*p == 'e' || *p == 's' || *p == 'b')) | |
| 1216 { | |
| 1217 if (*p == 'e') /* end */ | |
| 1218 spats[0].off.end = SEARCH_END; | |
| 1219 ++p; | |
| 1220 } | |
| 1221 if (VIM_ISDIGIT(*p) || *p == '+' || *p == '-') /* got an offset */ | |
| 1222 { | |
| 1223 /* 'nr' or '+nr' or '-nr' */ | |
| 1224 if (VIM_ISDIGIT(*p) || VIM_ISDIGIT(*(p + 1))) | |
| 1225 spats[0].off.off = atol((char *)p); | |
| 1226 else if (*p == '-') /* single '-' */ | |
| 1227 spats[0].off.off = -1; | |
| 1228 else /* single '+' */ | |
| 1229 spats[0].off.off = 1; | |
| 1230 ++p; | |
| 1231 while (VIM_ISDIGIT(*p)) /* skip number */ | |
| 1232 ++p; | |
| 1233 } | |
| 1234 | |
| 1235 /* compute length of search command for get_address() */ | |
| 1236 searchcmdlen += (int)(p - pat); | |
| 1237 | |
| 1238 pat = p; /* put pat after search command */ | |
| 1239 } | |
| 1240 | |
| 1241 if ((options & SEARCH_ECHO) && messaging() | |
| 1242 && !cmd_silent && msg_silent == 0) | |
| 1243 { | |
| 1244 char_u *msgbuf; | |
| 1245 char_u *trunc; | |
| 1246 | |
| 1247 if (*searchstr == NUL) | |
| 1248 p = spats[last_idx].pat; | |
| 1249 else | |
| 1250 p = searchstr; | |
| 1251 msgbuf = alloc((unsigned)(STRLEN(p) + 40)); | |
| 1252 if (msgbuf != NULL) | |
| 1253 { | |
| 1254 msgbuf[0] = dirc; | |
| 507 | 1255 #ifdef FEAT_MBYTE |
| 1256 if (enc_utf8 && utf_iscomposing(utf_ptr2char(p))) | |
| 1257 { | |
| 1258 /* Use a space to draw the composing char on. */ | |
| 1259 msgbuf[1] = ' '; | |
| 1260 STRCPY(msgbuf + 2, p); | |
| 1261 } | |
| 1262 else | |
| 1263 #endif | |
| 1264 STRCPY(msgbuf + 1, p); | |
| 7 | 1265 if (spats[0].off.line || spats[0].off.end || spats[0].off.off) |
| 1266 { | |
| 1267 p = msgbuf + STRLEN(msgbuf); | |
| 1268 *p++ = dirc; | |
| 1269 if (spats[0].off.end) | |
| 1270 *p++ = 'e'; | |
| 1271 else if (!spats[0].off.line) | |
| 1272 *p++ = 's'; | |
| 1273 if (spats[0].off.off > 0 || spats[0].off.line) | |
| 1274 *p++ = '+'; | |
| 1275 if (spats[0].off.off != 0 || spats[0].off.line) | |
| 1276 sprintf((char *)p, "%ld", spats[0].off.off); | |
| 1277 else | |
| 1278 *p = NUL; | |
| 1279 } | |
| 1280 | |
| 1281 msg_start(); | |
| 516 | 1282 trunc = msg_strtrunc(msgbuf, FALSE); |
| 7 | 1283 |
| 1284 #ifdef FEAT_RIGHTLEFT | |
| 1285 /* The search pattern could be shown on the right in rightleft | |
| 1286 * mode, but the 'ruler' and 'showcmd' area use it too, thus | |
| 1287 * it would be blanked out again very soon. Show it on the | |
| 1288 * left, but do reverse the text. */ | |
| 1289 if (curwin->w_p_rl && *curwin->w_p_rlc == 's') | |
| 1290 { | |
| 1291 char_u *r; | |
| 1292 | |
| 1293 r = reverse_text(trunc != NULL ? trunc : msgbuf); | |
| 1294 if (r != NULL) | |
| 1295 { | |
| 1296 vim_free(trunc); | |
| 1297 trunc = r; | |
| 1298 } | |
| 1299 } | |
| 1300 #endif | |
| 1301 if (trunc != NULL) | |
| 1302 { | |
| 1303 msg_outtrans(trunc); | |
| 1304 vim_free(trunc); | |
| 1305 } | |
| 1306 else | |
| 1307 msg_outtrans(msgbuf); | |
| 1308 msg_clr_eos(); | |
| 1309 msg_check(); | |
| 1310 vim_free(msgbuf); | |
| 1311 | |
| 1312 gotocmdline(FALSE); | |
| 1313 out_flush(); | |
| 1314 msg_nowait = TRUE; /* don't wait for this message */ | |
| 1315 } | |
| 1316 } | |
| 1317 | |
| 1318 /* | |
| 1319 * If there is a character offset, subtract it from the current | |
| 1320 * position, so we don't get stuck at "?pat?e+2" or "/pat/s-2". | |
| 8 | 1321 * Skip this if pos.col is near MAXCOL (closed fold). |
| 7 | 1322 * This is not done for a line offset, because then we would not be vi |
| 1323 * compatible. | |
| 1324 */ | |
| 8 | 1325 if (!spats[0].off.line && spats[0].off.off && pos.col < MAXCOL - 2) |
| 7 | 1326 { |
| 1327 if (spats[0].off.off > 0) | |
| 1328 { | |
| 1329 for (c = spats[0].off.off; c; --c) | |
| 1330 if (decl(&pos) == -1) | |
| 1331 break; | |
| 1332 if (c) /* at start of buffer */ | |
| 1333 { | |
| 1334 pos.lnum = 0; /* allow lnum == 0 here */ | |
| 1335 pos.col = MAXCOL; | |
| 1336 } | |
| 1337 } | |
| 1338 else | |
| 1339 { | |
| 1340 for (c = spats[0].off.off; c; ++c) | |
| 1341 if (incl(&pos) == -1) | |
| 1342 break; | |
| 1343 if (c) /* at end of buffer */ | |
| 1344 { | |
| 1345 pos.lnum = curbuf->b_ml.ml_line_count + 1; | |
| 1346 pos.col = 0; | |
| 1347 } | |
| 1348 } | |
| 1349 } | |
| 1350 | |
| 1351 #ifdef FEAT_FKMAP /* when in Farsi mode, reverse the character flow */ | |
| 1352 if (p_altkeymap && curwin->w_p_rl) | |
| 1353 lrFswap(searchstr,0); | |
| 1354 #endif | |
| 1355 | |
| 1356 c = searchit(curwin, curbuf, &pos, dirc == '/' ? FORWARD : BACKWARD, | |
| 1357 searchstr, count, spats[0].off.end + (options & | |
| 1358 (SEARCH_KEEP + SEARCH_PEEK + SEARCH_HIS | |
| 1359 + SEARCH_MSG + SEARCH_START | |
| 1360 + ((pat != NULL && *pat == ';') ? 0 : SEARCH_NOOF))), | |
| 1521 | 1361 RE_LAST, (linenr_T)0, tm); |
| 7 | 1362 |
| 1363 if (dircp != NULL) | |
| 1364 *dircp = dirc; /* restore second '/' or '?' for normal_cmd() */ | |
| 1365 if (c == FAIL) | |
| 1366 { | |
| 1367 retval = 0; | |
| 1368 goto end_do_search; | |
| 1369 } | |
| 1370 if (spats[0].off.end && oap != NULL) | |
| 1371 oap->inclusive = TRUE; /* 'e' includes last character */ | |
| 1372 | |
| 1373 retval = 1; /* pattern found */ | |
| 1374 | |
| 1375 /* | |
| 1376 * Add character and/or line offset | |
| 1377 */ | |
| 945 | 1378 if (!(options & SEARCH_NOOF) || (pat != NULL && *pat == ';')) |
| 7 | 1379 { |
| 1380 if (spats[0].off.line) /* Add the offset to the line number. */ | |
| 1381 { | |
| 1382 c = pos.lnum + spats[0].off.off; | |
| 1383 if (c < 1) | |
| 1384 pos.lnum = 1; | |
| 1385 else if (c > curbuf->b_ml.ml_line_count) | |
| 1386 pos.lnum = curbuf->b_ml.ml_line_count; | |
| 1387 else | |
| 1388 pos.lnum = c; | |
| 1389 pos.col = 0; | |
| 1390 | |
| 1391 retval = 2; /* pattern found, line offset added */ | |
| 1392 } | |
| 8 | 1393 else if (pos.col < MAXCOL - 2) /* just in case */ |
| 7 | 1394 { |
| 1395 /* to the right, check for end of file */ | |
| 1624 | 1396 c = spats[0].off.off; |
| 1397 if (c > 0) | |
| 7 | 1398 { |
| 1624 | 1399 while (c-- > 0) |
| 7 | 1400 if (incl(&pos) == -1) |
| 1401 break; | |
| 1402 } | |
| 1403 /* to the left, check for start of file */ | |
| 1404 else | |
| 1405 { | |
| 1624 | 1406 while (c++ < 0) |
| 1407 if (decl(&pos) == -1) | |
| 1408 break; | |
| 7 | 1409 } |
| 1410 } | |
| 1411 } | |
| 1412 | |
| 1413 /* | |
| 1414 * The search command can be followed by a ';' to do another search. | |
| 1415 * For example: "/pat/;/foo/+3;?bar" | |
| 1416 * This is like doing another search command, except: | |
| 1417 * - The remembered direction '/' or '?' is from the first search. | |
| 1418 * - When an error happens the cursor isn't moved at all. | |
| 1419 * Don't do this when called by get_address() (it handles ';' itself). | |
| 1420 */ | |
| 1421 if (!(options & SEARCH_OPT) || pat == NULL || *pat != ';') | |
| 1422 break; | |
| 1423 | |
| 1424 dirc = *++pat; | |
| 1425 if (dirc != '?' && dirc != '/') | |
| 1426 { | |
| 1427 retval = 0; | |
| 1428 EMSG(_("E386: Expected '?' or '/' after ';'")); | |
| 1429 goto end_do_search; | |
| 1430 } | |
| 1431 ++pat; | |
| 1432 } | |
| 1433 | |
| 1434 if (options & SEARCH_MARK) | |
| 1435 setpcmark(); | |
| 1436 curwin->w_cursor = pos; | |
| 1437 curwin->w_set_curswant = TRUE; | |
| 1438 | |
| 1439 end_do_search: | |
| 1440 if (options & SEARCH_KEEP) | |
| 1441 spats[0].off = old_off; | |
| 1442 vim_free(strcopy); | |
| 1443 | |
| 1444 return retval; | |
| 1445 } | |
| 1446 | |
| 1447 #if defined(FEAT_INS_EXPAND) || defined(PROTO) | |
| 1448 /* | |
| 1449 * search_for_exact_line(buf, pos, dir, pat) | |
| 1450 * | |
| 1451 * Search for a line starting with the given pattern (ignoring leading | |
| 1452 * white-space), starting from pos and going in direction dir. pos will | |
| 1453 * contain the position of the match found. Blank lines match only if | |
| 1454 * ADDING is set. if p_ic is set then the pattern must be in lowercase. | |
| 1455 * Return OK for success, or FAIL if no line found. | |
| 1456 */ | |
| 1457 int | |
| 1458 search_for_exact_line(buf, pos, dir, pat) | |
| 1459 buf_T *buf; | |
| 1460 pos_T *pos; | |
| 1461 int dir; | |
| 1462 char_u *pat; | |
| 1463 { | |
| 1464 linenr_T start = 0; | |
| 1465 char_u *ptr; | |
| 1466 char_u *p; | |
| 1467 | |
| 1468 if (buf->b_ml.ml_line_count == 0) | |
| 1469 return FAIL; | |
| 1470 for (;;) | |
| 1471 { | |
| 1472 pos->lnum += dir; | |
| 1473 if (pos->lnum < 1) | |
| 1474 { | |
| 1475 if (p_ws) | |
| 1476 { | |
| 1477 pos->lnum = buf->b_ml.ml_line_count; | |
| 1478 if (!shortmess(SHM_SEARCH)) | |
| 1479 give_warning((char_u *)_(top_bot_msg), TRUE); | |
| 1480 } | |
| 1481 else | |
| 1482 { | |
| 1483 pos->lnum = 1; | |
| 1484 break; | |
| 1485 } | |
| 1486 } | |
| 1487 else if (pos->lnum > buf->b_ml.ml_line_count) | |
| 1488 { | |
| 1489 if (p_ws) | |
| 1490 { | |
| 1491 pos->lnum = 1; | |
| 1492 if (!shortmess(SHM_SEARCH)) | |
| 1493 give_warning((char_u *)_(bot_top_msg), TRUE); | |
| 1494 } | |
| 1495 else | |
| 1496 { | |
| 1497 pos->lnum = 1; | |
| 1498 break; | |
| 1499 } | |
| 1500 } | |
| 1501 if (pos->lnum == start) | |
| 1502 break; | |
| 1503 if (start == 0) | |
| 1504 start = pos->lnum; | |
| 1505 ptr = ml_get_buf(buf, pos->lnum, FALSE); | |
| 1506 p = skipwhite(ptr); | |
| 1507 pos->col = (colnr_T) (p - ptr); | |
| 1508 | |
| 1509 /* when adding lines the matching line may be empty but it is not | |
| 1510 * ignored because we are interested in the next line -- Acevedo */ | |
| 449 | 1511 if ((compl_cont_status & CONT_ADDING) |
| 1512 && !(compl_cont_status & CONT_SOL)) | |
| 7 | 1513 { |
| 1514 if ((p_ic ? MB_STRICMP(p, pat) : STRCMP(p, pat)) == 0) | |
| 1515 return OK; | |
| 1516 } | |
| 1517 else if (*p != NUL) /* ignore empty lines */ | |
| 1518 { /* expanding lines or words */ | |
| 449 | 1519 if ((p_ic ? MB_STRNICMP(p, pat, compl_length) |
| 1520 : STRNCMP(p, pat, compl_length)) == 0) | |
| 7 | 1521 return OK; |
| 1522 } | |
| 1523 } | |
| 1524 return FAIL; | |
| 1525 } | |
| 1526 #endif /* FEAT_INS_EXPAND */ | |
| 1527 | |
| 1528 /* | |
| 1529 * Character Searches | |
| 1530 */ | |
| 1531 | |
| 1532 /* | |
| 1533 * Search for a character in a line. If "t_cmd" is FALSE, move to the | |
| 1534 * position of the character, otherwise move to just before the char. | |
| 1535 * Do this "cap->count1" times. | |
| 1536 * Return FAIL or OK. | |
| 1537 */ | |
| 1538 int | |
| 1539 searchc(cap, t_cmd) | |
| 1540 cmdarg_T *cap; | |
| 1541 int t_cmd; | |
| 1542 { | |
| 1543 int c = cap->nchar; /* char to search for */ | |
| 1544 int dir = cap->arg; /* TRUE for searching forward */ | |
| 1545 long count = cap->count1; /* repeat count */ | |
| 1546 static int lastc = NUL; /* last character searched for */ | |
| 1547 static int lastcdir; /* last direction of character search */ | |
| 1548 static int last_t_cmd; /* last search t_cmd */ | |
| 1549 int col; | |
| 1550 char_u *p; | |
| 1551 int len; | |
| 2925 | 1552 int stop = TRUE; |
| 7 | 1553 #ifdef FEAT_MBYTE |
| 3562 | 1554 static char_u bytes[MB_MAXBYTES + 1]; |
| 7 | 1555 static int bytelen = 1; /* >1 for multi-byte char */ |
| 1556 #endif | |
| 1557 | |
| 1558 if (c != NUL) /* normal search: remember args for repeat */ | |
| 1559 { | |
| 1560 if (!KeyStuffed) /* don't remember when redoing */ | |
| 1561 { | |
| 1562 lastc = c; | |
| 1563 lastcdir = dir; | |
| 1564 last_t_cmd = t_cmd; | |
| 1565 #ifdef FEAT_MBYTE | |
| 1566 bytelen = (*mb_char2bytes)(c, bytes); | |
| 1567 if (cap->ncharC1 != 0) | |
| 1568 { | |
| 1569 bytelen += (*mb_char2bytes)(cap->ncharC1, bytes + bytelen); | |
| 1570 if (cap->ncharC2 != 0) | |
| 1571 bytelen += (*mb_char2bytes)(cap->ncharC2, bytes + bytelen); | |
| 1572 } | |
| 1573 #endif | |
| 1574 } | |
| 1575 } | |
| 1576 else /* repeat previous search */ | |
| 1577 { | |
| 1578 if (lastc == NUL) | |
| 1579 return FAIL; | |
| 1580 if (dir) /* repeat in opposite direction */ | |
| 1581 dir = -lastcdir; | |
| 1582 else | |
| 1583 dir = lastcdir; | |
| 1584 t_cmd = last_t_cmd; | |
| 1585 c = lastc; | |
| 1586 /* For multi-byte re-use last bytes[] and bytelen. */ | |
| 2925 | 1587 |
| 1588 /* Force a move of at least one char, so ";" and "," will move the | |
| 1589 * cursor, even if the cursor is right in front of char we are looking | |
| 1590 * at. */ | |
| 2947 | 1591 if (vim_strchr(p_cpo, CPO_SCOLON) == NULL && count == 1 && t_cmd) |
| 2925 | 1592 stop = FALSE; |
| 7 | 1593 } |
| 1594 | |
| 530 | 1595 if (dir == BACKWARD) |
| 1596 cap->oap->inclusive = FALSE; | |
| 1597 else | |
| 1598 cap->oap->inclusive = TRUE; | |
| 1599 | |
| 7 | 1600 p = ml_get_curline(); |
| 1601 col = curwin->w_cursor.col; | |
| 1602 len = (int)STRLEN(p); | |
| 1603 | |
| 1604 while (count--) | |
| 1605 { | |
| 1606 #ifdef FEAT_MBYTE | |
| 1607 if (has_mbyte) | |
| 1608 { | |
| 1609 for (;;) | |
| 1610 { | |
| 1611 if (dir > 0) | |
| 1612 { | |
| 474 | 1613 col += (*mb_ptr2len)(p + col); |
| 7 | 1614 if (col >= len) |
| 1615 return FAIL; | |
| 1616 } | |
| 1617 else | |
| 1618 { | |
| 1619 if (col == 0) | |
| 1620 return FAIL; | |
| 1621 col -= (*mb_head_off)(p, p + col - 1) + 1; | |
| 1622 } | |
| 1623 if (bytelen == 1) | |
| 1624 { | |
| 2925 | 1625 if (p[col] == c && stop) |
| 7 | 1626 break; |
| 1627 } | |
| 1628 else | |
| 1629 { | |
| 2925 | 1630 if (vim_memcmp(p + col, bytes, bytelen) == 0 && stop) |
| 7 | 1631 break; |
| 1632 } | |
| 2925 | 1633 stop = TRUE; |
| 7 | 1634 } |
| 1635 } | |
| 1636 else | |
| 1637 #endif | |
| 1638 { | |
| 1639 for (;;) | |
| 1640 { | |
| 1641 if ((col += dir) < 0 || col >= len) | |
| 1642 return FAIL; | |
| 2925 | 1643 if (p[col] == c && stop) |
| 7 | 1644 break; |
| 2925 | 1645 stop = TRUE; |
| 7 | 1646 } |
| 1647 } | |
| 1648 } | |
| 1649 | |
| 1650 if (t_cmd) | |
| 1651 { | |
| 1652 /* backup to before the character (possibly double-byte) */ | |
| 1653 col -= dir; | |
| 1654 #ifdef FEAT_MBYTE | |
| 1655 if (has_mbyte) | |
| 1656 { | |
| 1657 if (dir < 0) | |
| 1658 /* Landed on the search char which is bytelen long */ | |
| 1659 col += bytelen - 1; | |
| 1660 else | |
| 1661 /* To previous char, which may be multi-byte. */ | |
| 1662 col -= (*mb_head_off)(p, p + col); | |
| 1663 } | |
| 1664 #endif | |
| 1665 } | |
| 1666 curwin->w_cursor.col = col; | |
| 1667 | |
| 1668 return OK; | |
| 1669 } | |
| 1670 | |
| 1671 /* | |
| 1672 * "Other" Searches | |
| 1673 */ | |
| 1674 | |
| 1675 /* | |
| 1676 * findmatch - find the matching paren or brace | |
| 1677 * | |
| 1678 * Improvement over vi: Braces inside quotes are ignored. | |
| 1679 */ | |
| 1680 pos_T * | |
| 1681 findmatch(oap, initc) | |
| 1682 oparg_T *oap; | |
| 1683 int initc; | |
| 1684 { | |
| 1685 return findmatchlimit(oap, initc, 0, 0); | |
| 1686 } | |
| 1687 | |
| 1688 /* | |
| 1689 * Return TRUE if the character before "linep[col]" equals "ch". | |
| 1690 * Return FALSE if "col" is zero. | |
| 1691 * Update "*prevcol" to the column of the previous character, unless "prevcol" | |
| 1692 * is NULL. | |
| 1693 * Handles multibyte string correctly. | |
| 1694 */ | |
| 1695 static int | |
| 1696 check_prevcol(linep, col, ch, prevcol) | |
| 1697 char_u *linep; | |
| 1698 int col; | |
| 1699 int ch; | |
| 1700 int *prevcol; | |
| 1701 { | |
| 1702 --col; | |
| 1703 #ifdef FEAT_MBYTE | |
| 1704 if (col > 0 && has_mbyte) | |
| 1705 col -= (*mb_head_off)(linep, linep + col); | |
| 1706 #endif | |
| 1707 if (prevcol) | |
| 1708 *prevcol = col; | |
| 1709 return (col >= 0 && linep[col] == ch) ? TRUE : FALSE; | |
| 1710 } | |
| 1711 | |
| 1712 /* | |
| 1713 * findmatchlimit -- find the matching paren or brace, if it exists within | |
| 1714 * maxtravel lines of here. A maxtravel of 0 means search until falling off | |
| 1715 * the edge of the file. | |
| 1716 * | |
| 1717 * "initc" is the character to find a match for. NUL means to find the | |
| 1718 * character at or after the cursor. | |
| 1719 * | |
| 1720 * flags: FM_BACKWARD search backwards (when initc is '/', '*' or '#') | |
| 1721 * FM_FORWARD search forwards (when initc is '/', '*' or '#') | |
| 1722 * FM_BLOCKSTOP stop at start/end of block ({ or } in column 0) | |
| 1723 * FM_SKIPCOMM skip comments (not implemented yet!) | |
| 523 | 1724 * |
| 1725 * "oap" is only used to set oap->motion_type for a linewise motion, it be | |
| 1726 * NULL | |
| 7 | 1727 */ |
| 1728 | |
| 1729 pos_T * | |
| 1730 findmatchlimit(oap, initc, flags, maxtravel) | |
| 1731 oparg_T *oap; | |
| 1732 int initc; | |
| 1733 int flags; | |
| 1734 int maxtravel; | |
| 1735 { | |
| 1736 static pos_T pos; /* current search position */ | |
| 1737 int findc = 0; /* matching brace */ | |
| 1738 int c; | |
| 1739 int count = 0; /* cumulative number of braces */ | |
| 1740 int backwards = FALSE; /* init for gcc */ | |
| 1741 int inquote = FALSE; /* TRUE when inside quotes */ | |
| 1742 char_u *linep; /* pointer to current line */ | |
| 1743 char_u *ptr; | |
| 1744 int do_quotes; /* check for quotes in current line */ | |
| 1745 int at_start; /* do_quotes value at start position */ | |
| 1746 int hash_dir = 0; /* Direction searched for # things */ | |
| 1747 int comment_dir = 0; /* Direction searched for comments */ | |
| 1748 pos_T match_pos; /* Where last slash-star was found */ | |
| 1749 int start_in_quotes; /* start position is in quotes */ | |
| 1750 int traveled = 0; /* how far we've searched so far */ | |
| 1751 int ignore_cend = FALSE; /* ignore comment end */ | |
| 1752 int cpo_match; /* vi compatible matching */ | |
| 1753 int cpo_bsl; /* don't recognize backslashes */ | |
| 1754 int match_escaped = 0; /* search for escaped match */ | |
| 1755 int dir; /* Direction to search */ | |
| 1756 int comment_col = MAXCOL; /* start of / / comment */ | |
| 14 | 1757 #ifdef FEAT_LISP |
| 1758 int lispcomm = FALSE; /* inside of Lisp-style comment */ | |
| 1759 int lisp = curbuf->b_p_lisp; /* engage Lisp-specific hacks ;) */ | |
| 1760 #endif | |
| 7 | 1761 |
| 1762 pos = curwin->w_cursor; | |
| 1763 linep = ml_get(pos.lnum); | |
| 1764 | |
| 1765 cpo_match = (vim_strchr(p_cpo, CPO_MATCH) != NULL); | |
| 1766 cpo_bsl = (vim_strchr(p_cpo, CPO_MATCHBSL) != NULL); | |
| 1767 | |
| 1768 /* Direction to search when initc is '/', '*' or '#' */ | |
| 1769 if (flags & FM_BACKWARD) | |
| 1770 dir = BACKWARD; | |
| 1771 else if (flags & FM_FORWARD) | |
| 1772 dir = FORWARD; | |
| 1773 else | |
| 1774 dir = 0; | |
| 1775 | |
| 1776 /* | |
| 1777 * if initc given, look in the table for the matching character | |
| 1778 * '/' and '*' are special cases: look for start or end of comment. | |
| 1779 * When '/' is used, we ignore running backwards into an star-slash, for | |
| 1780 * "[*" command, we just want to find any comment. | |
| 1781 */ | |
| 1782 if (initc == '/' || initc == '*') | |
| 1783 { | |
| 1784 comment_dir = dir; | |
| 1785 if (initc == '/') | |
| 1786 ignore_cend = TRUE; | |
| 1787 backwards = (dir == FORWARD) ? FALSE : TRUE; | |
| 1788 initc = NUL; | |
| 1789 } | |
| 1790 else if (initc != '#' && initc != NUL) | |
| 1791 { | |
| 4029 | 1792 find_mps_values(&initc, &findc, &backwards, TRUE); |
| 1793 if (findc == NUL) | |
| 7 | 1794 return NULL; |
| 1795 } | |
| 1796 /* | |
| 1797 * Either initc is '#', or no initc was given and we need to look under the | |
| 1798 * cursor. | |
| 1799 */ | |
| 1800 else | |
| 1801 { | |
| 1802 if (initc == '#') | |
| 1803 { | |
| 1804 hash_dir = dir; | |
| 1805 } | |
| 1806 else | |
| 1807 { | |
| 1808 /* | |
| 1809 * initc was not given, must look for something to match under | |
| 1810 * or near the cursor. | |
| 1811 * Only check for special things when 'cpo' doesn't have '%'. | |
| 1812 */ | |
| 1813 if (!cpo_match) | |
| 1814 { | |
| 1815 /* Are we before or at #if, #else etc.? */ | |
| 1816 ptr = skipwhite(linep); | |
| 1817 if (*ptr == '#' && pos.col <= (colnr_T)(ptr - linep)) | |
| 1818 { | |
| 1819 ptr = skipwhite(ptr + 1); | |
| 1820 if ( STRNCMP(ptr, "if", 2) == 0 | |
| 1821 || STRNCMP(ptr, "endif", 5) == 0 | |
| 1822 || STRNCMP(ptr, "el", 2) == 0) | |
| 1823 hash_dir = 1; | |
| 1824 } | |
| 1825 | |
| 1826 /* Are we on a comment? */ | |
| 1827 else if (linep[pos.col] == '/') | |
| 1828 { | |
| 1829 if (linep[pos.col + 1] == '*') | |
| 1830 { | |
| 1831 comment_dir = FORWARD; | |
| 1832 backwards = FALSE; | |
| 1833 pos.col++; | |
| 1834 } | |
| 1835 else if (pos.col > 0 && linep[pos.col - 1] == '*') | |
| 1836 { | |
| 1837 comment_dir = BACKWARD; | |
| 1838 backwards = TRUE; | |
| 1839 pos.col--; | |
| 1840 } | |
| 1841 } | |
| 1842 else if (linep[pos.col] == '*') | |
| 1843 { | |
| 1844 if (linep[pos.col + 1] == '/') | |
| 1845 { | |
| 1846 comment_dir = BACKWARD; | |
| 1847 backwards = TRUE; | |
| 1848 } | |
| 1849 else if (pos.col > 0 && linep[pos.col - 1] == '/') | |
| 1850 { | |
| 1851 comment_dir = FORWARD; | |
| 1852 backwards = FALSE; | |
| 1853 } | |
| 1854 } | |
| 1855 } | |
| 1856 | |
| 1857 /* | |
| 1858 * If we are not on a comment or the # at the start of a line, then | |
| 1859 * look for brace anywhere on this line after the cursor. | |
| 1860 */ | |
| 1861 if (!hash_dir && !comment_dir) | |
| 1862 { | |
| 1863 /* | |
| 1864 * Find the brace under or after the cursor. | |
| 1865 * If beyond the end of the line, use the last character in | |
| 1866 * the line. | |
| 1867 */ | |
| 1868 if (linep[pos.col] == NUL && pos.col) | |
| 1869 --pos.col; | |
| 1870 for (;;) | |
| 1871 { | |
| 4029 | 1872 initc = PTR2CHAR(linep + pos.col); |
| 7 | 1873 if (initc == NUL) |
| 1874 break; | |
| 1875 | |
| 4029 | 1876 find_mps_values(&initc, &findc, &backwards, FALSE); |
| 7 | 1877 if (findc) |
| 1878 break; | |
| 4029 | 1879 pos.col += MB_PTR2LEN(linep + pos.col); |
| 7 | 1880 } |
| 1881 if (!findc) | |
| 1882 { | |
| 1883 /* no brace in the line, maybe use " #if" then */ | |
| 1884 if (!cpo_match && *skipwhite(linep) == '#') | |
| 1885 hash_dir = 1; | |
| 1886 else | |
| 1887 return NULL; | |
| 1888 } | |
| 1889 else if (!cpo_bsl) | |
| 1890 { | |
| 1891 int col, bslcnt = 0; | |
| 1892 | |
| 1893 /* Set "match_escaped" if there are an odd number of | |
| 1894 * backslashes. */ | |
| 1895 for (col = pos.col; check_prevcol(linep, col, '\\', &col);) | |
| 1896 bslcnt++; | |
| 1897 match_escaped = (bslcnt & 1); | |
| 1898 } | |
| 1899 } | |
| 1900 } | |
| 1901 if (hash_dir) | |
| 1902 { | |
| 1903 /* | |
| 1904 * Look for matching #if, #else, #elif, or #endif | |
| 1905 */ | |
| 1906 if (oap != NULL) | |
| 1907 oap->motion_type = MLINE; /* Linewise for this case only */ | |
| 1908 if (initc != '#') | |
| 1909 { | |
| 1910 ptr = skipwhite(skipwhite(linep) + 1); | |
| 1911 if (STRNCMP(ptr, "if", 2) == 0 || STRNCMP(ptr, "el", 2) == 0) | |
| 1912 hash_dir = 1; | |
| 1913 else if (STRNCMP(ptr, "endif", 5) == 0) | |
| 1914 hash_dir = -1; | |
| 1915 else | |
| 1916 return NULL; | |
| 1917 } | |
| 1918 pos.col = 0; | |
| 1919 while (!got_int) | |
| 1920 { | |
| 1921 if (hash_dir > 0) | |
| 1922 { | |
| 1923 if (pos.lnum == curbuf->b_ml.ml_line_count) | |
| 1924 break; | |
| 1925 } | |
| 1926 else if (pos.lnum == 1) | |
| 1927 break; | |
| 1928 pos.lnum += hash_dir; | |
| 1929 linep = ml_get(pos.lnum); | |
| 1930 line_breakcheck(); /* check for CTRL-C typed */ | |
| 1931 ptr = skipwhite(linep); | |
| 1932 if (*ptr != '#') | |
| 1933 continue; | |
| 1934 pos.col = (colnr_T) (ptr - linep); | |
| 1935 ptr = skipwhite(ptr + 1); | |
| 1936 if (hash_dir > 0) | |
| 1937 { | |
| 1938 if (STRNCMP(ptr, "if", 2) == 0) | |
| 1939 count++; | |
| 1940 else if (STRNCMP(ptr, "el", 2) == 0) | |
| 1941 { | |
| 1942 if (count == 0) | |
| 1943 return &pos; | |
| 1944 } | |
| 1945 else if (STRNCMP(ptr, "endif", 5) == 0) | |
| 1946 { | |
| 1947 if (count == 0) | |
| 1948 return &pos; | |
| 1949 count--; | |
| 1950 } | |
| 1951 } | |
| 1952 else | |
| 1953 { | |
| 1954 if (STRNCMP(ptr, "if", 2) == 0) | |
| 1955 { | |
| 1956 if (count == 0) | |
| 1957 return &pos; | |
| 1958 count--; | |
| 1959 } | |
| 1960 else if (initc == '#' && STRNCMP(ptr, "el", 2) == 0) | |
| 1961 { | |
| 1962 if (count == 0) | |
| 1963 return &pos; | |
| 1964 } | |
| 1965 else if (STRNCMP(ptr, "endif", 5) == 0) | |
| 1966 count++; | |
| 1967 } | |
| 1968 } | |
| 1969 return NULL; | |
| 1970 } | |
| 1971 } | |
| 1972 | |
| 1973 #ifdef FEAT_RIGHTLEFT | |
| 1344 | 1974 /* This is just guessing: when 'rightleft' is set, search for a matching |
| 7 | 1975 * paren/brace in the other direction. */ |
| 1976 if (curwin->w_p_rl && vim_strchr((char_u *)"()[]{}<>", initc) != NULL) | |
| 1977 backwards = !backwards; | |
| 1978 #endif | |
| 1979 | |
| 1980 do_quotes = -1; | |
| 1981 start_in_quotes = MAYBE; | |
| 699 | 1982 clearpos(&match_pos); |
| 1983 | |
| 7 | 1984 /* backward search: Check if this line contains a single-line comment */ |
| 14 | 1985 if ((backwards && comment_dir) |
| 1986 #ifdef FEAT_LISP | |
| 1987 || lisp | |
| 1988 #endif | |
| 1989 ) | |
| 7 | 1990 comment_col = check_linecomment(linep); |
| 14 | 1991 #ifdef FEAT_LISP |
| 1992 if (lisp && comment_col != MAXCOL && pos.col > (colnr_T)comment_col) | |
| 1993 lispcomm = TRUE; /* find match inside this comment */ | |
| 1994 #endif | |
| 7 | 1995 while (!got_int) |
| 1996 { | |
| 1997 /* | |
| 1998 * Go to the next position, forward or backward. We could use | |
| 1999 * inc() and dec() here, but that is much slower | |
| 2000 */ | |
| 2001 if (backwards) | |
| 2002 { | |
| 14 | 2003 #ifdef FEAT_LISP |
| 2004 /* char to match is inside of comment, don't search outside */ | |
| 2005 if (lispcomm && pos.col < (colnr_T)comment_col) | |
| 2006 break; | |
| 2007 #endif | |
| 7 | 2008 if (pos.col == 0) /* at start of line, go to prev. one */ |
| 2009 { | |
| 2010 if (pos.lnum == 1) /* start of file */ | |
| 2011 break; | |
| 2012 --pos.lnum; | |
| 2013 | |
| 829 | 2014 if (maxtravel > 0 && ++traveled > maxtravel) |
| 7 | 2015 break; |
| 2016 | |
| 2017 linep = ml_get(pos.lnum); | |
| 2018 pos.col = (colnr_T)STRLEN(linep); /* pos.col on trailing NUL */ | |
| 2019 do_quotes = -1; | |
| 2020 line_breakcheck(); | |
| 2021 | |
| 2022 /* Check if this line contains a single-line comment */ | |
| 14 | 2023 if (comment_dir |
| 2024 #ifdef FEAT_LISP | |
| 2025 || lisp | |
| 2026 #endif | |
| 2027 ) | |
| 7 | 2028 comment_col = check_linecomment(linep); |
| 14 | 2029 #ifdef FEAT_LISP |
| 2030 /* skip comment */ | |
| 2031 if (lisp && comment_col != MAXCOL) | |
| 2032 pos.col = comment_col; | |
| 2033 #endif | |
| 7 | 2034 } |
| 2035 else | |
| 2036 { | |
| 2037 --pos.col; | |
| 2038 #ifdef FEAT_MBYTE | |
| 2039 if (has_mbyte) | |
| 2040 pos.col -= (*mb_head_off)(linep, linep + pos.col); | |
| 2041 #endif | |
| 2042 } | |
| 2043 } | |
| 2044 else /* forward search */ | |
| 2045 { | |
| 14 | 2046 if (linep[pos.col] == NUL |
| 2047 /* at end of line, go to next one */ | |
| 2048 #ifdef FEAT_LISP | |
| 2049 /* don't search for match in comment */ | |
| 2050 || (lisp && comment_col != MAXCOL | |
| 2051 && pos.col == (colnr_T)comment_col) | |
| 2052 #endif | |
| 2053 ) | |
| 7 | 2054 { |
| 14 | 2055 if (pos.lnum == curbuf->b_ml.ml_line_count /* end of file */ |
| 2056 #ifdef FEAT_LISP | |
| 2057 /* line is exhausted and comment with it, | |
| 2058 * don't search for match in code */ | |
| 2059 || lispcomm | |
| 2060 #endif | |
| 2061 ) | |
| 7 | 2062 break; |
| 2063 ++pos.lnum; | |
| 2064 | |
| 2065 if (maxtravel && traveled++ > maxtravel) | |
| 2066 break; | |
| 2067 | |
| 2068 linep = ml_get(pos.lnum); | |
| 2069 pos.col = 0; | |
| 2070 do_quotes = -1; | |
| 2071 line_breakcheck(); | |
| 14 | 2072 #ifdef FEAT_LISP |
| 2073 if (lisp) /* find comment pos in new line */ | |
| 2074 comment_col = check_linecomment(linep); | |
| 2075 #endif | |
| 7 | 2076 } |
| 2077 else | |
| 2078 { | |
| 2079 #ifdef FEAT_MBYTE | |
| 2080 if (has_mbyte) | |
| 474 | 2081 pos.col += (*mb_ptr2len)(linep + pos.col); |
| 7 | 2082 else |
| 2083 #endif | |
| 2084 ++pos.col; | |
| 2085 } | |
| 2086 } | |
| 2087 | |
| 2088 /* | |
| 2089 * If FM_BLOCKSTOP given, stop at a '{' or '}' in column 0. | |
| 2090 */ | |
| 2091 if (pos.col == 0 && (flags & FM_BLOCKSTOP) && | |
| 2092 (linep[0] == '{' || linep[0] == '}')) | |
| 2093 { | |
| 2094 if (linep[0] == findc && count == 0) /* match! */ | |
| 2095 return &pos; | |
| 2096 break; /* out of scope */ | |
| 2097 } | |
| 2098 | |
| 2099 if (comment_dir) | |
| 2100 { | |
| 2101 /* Note: comments do not nest, and we ignore quotes in them */ | |
| 2102 /* TODO: ignore comment brackets inside strings */ | |
| 2103 if (comment_dir == FORWARD) | |
| 2104 { | |
| 2105 if (linep[pos.col] == '*' && linep[pos.col + 1] == '/') | |
| 2106 { | |
| 2107 pos.col++; | |
| 2108 return &pos; | |
| 2109 } | |
| 2110 } | |
| 2111 else /* Searching backwards */ | |
| 2112 { | |
| 2113 /* | |
| 2114 * A comment may contain / * or / /, it may also start or end | |
| 2115 * with / * /. Ignore a / * after / /. | |
| 2116 */ | |
| 2117 if (pos.col == 0) | |
| 2118 continue; | |
| 2119 else if ( linep[pos.col - 1] == '/' | |
| 2120 && linep[pos.col] == '*' | |
| 2121 && (int)pos.col < comment_col) | |
| 2122 { | |
| 2123 count++; | |
| 2124 match_pos = pos; | |
| 2125 match_pos.col--; | |
| 2126 } | |
| 2127 else if (linep[pos.col - 1] == '*' && linep[pos.col] == '/') | |
| 2128 { | |
| 2129 if (count > 0) | |
| 2130 pos = match_pos; | |
| 2131 else if (pos.col > 1 && linep[pos.col - 2] == '/' | |
| 2132 && (int)pos.col <= comment_col) | |
| 2133 pos.col -= 2; | |
| 2134 else if (ignore_cend) | |
| 2135 continue; | |
| 2136 else | |
| 2137 return NULL; | |
| 2138 return &pos; | |
| 2139 } | |
| 2140 } | |
| 2141 continue; | |
| 2142 } | |
| 2143 | |
| 2144 /* | |
| 2145 * If smart matching ('cpoptions' does not contain '%'), braces inside | |
| 2146 * of quotes are ignored, but only if there is an even number of | |
| 2147 * quotes in the line. | |
| 2148 */ | |
| 2149 if (cpo_match) | |
| 2150 do_quotes = 0; | |
| 2151 else if (do_quotes == -1) | |
| 2152 { | |
| 2153 /* | |
| 2154 * Count the number of quotes in the line, skipping \" and '"'. | |
| 2155 * Watch out for "\\". | |
| 2156 */ | |
| 2157 at_start = do_quotes; | |
| 2158 for (ptr = linep; *ptr; ++ptr) | |
| 2159 { | |
| 2160 if (ptr == linep + pos.col + backwards) | |
| 2161 at_start = (do_quotes & 1); | |
| 2162 if (*ptr == '"' | |
| 2163 && (ptr == linep || ptr[-1] != '\'' || ptr[1] != '\'')) | |
| 2164 ++do_quotes; | |
| 2165 if (*ptr == '\\' && ptr[1] != NUL) | |
| 2166 ++ptr; | |
| 2167 } | |
| 2168 do_quotes &= 1; /* result is 1 with even number of quotes */ | |
| 2169 | |
| 2170 /* | |
| 2171 * If we find an uneven count, check current line and previous | |
| 2172 * one for a '\' at the end. | |
| 2173 */ | |
| 2174 if (!do_quotes) | |
| 2175 { | |
| 2176 inquote = FALSE; | |
| 2177 if (ptr[-1] == '\\') | |
| 2178 { | |
| 2179 do_quotes = 1; | |
| 2180 if (start_in_quotes == MAYBE) | |
| 2181 { | |
| 2182 /* Do we need to use at_start here? */ | |
| 2183 inquote = TRUE; | |
| 2184 start_in_quotes = TRUE; | |
| 2185 } | |
| 2186 else if (backwards) | |
| 2187 inquote = TRUE; | |
| 2188 } | |
| 2189 if (pos.lnum > 1) | |
| 2190 { | |
| 2191 ptr = ml_get(pos.lnum - 1); | |
| 2192 if (*ptr && *(ptr + STRLEN(ptr) - 1) == '\\') | |
| 2193 { | |
| 2194 do_quotes = 1; | |
| 2195 if (start_in_quotes == MAYBE) | |
| 2196 { | |
| 2197 inquote = at_start; | |
| 2198 if (inquote) | |
| 2199 start_in_quotes = TRUE; | |
| 2200 } | |
| 2201 else if (!backwards) | |
| 2202 inquote = TRUE; | |
| 2203 } | |
| 1310 | 2204 |
| 2205 /* ml_get() only keeps one line, need to get linep again */ | |
| 2206 linep = ml_get(pos.lnum); | |
| 7 | 2207 } |
| 2208 } | |
| 2209 } | |
| 2210 if (start_in_quotes == MAYBE) | |
| 2211 start_in_quotes = FALSE; | |
| 2212 | |
| 2213 /* | |
| 2214 * If 'smartmatch' is set: | |
| 2215 * Things inside quotes are ignored by setting 'inquote'. If we | |
| 2216 * find a quote without a preceding '\' invert 'inquote'. At the | |
| 2217 * end of a line not ending in '\' we reset 'inquote'. | |
| 2218 * | |
| 2219 * In lines with an uneven number of quotes (without preceding '\') | |
| 2220 * we do not know which part to ignore. Therefore we only set | |
| 2221 * inquote if the number of quotes in a line is even, unless this | |
| 2222 * line or the previous one ends in a '\'. Complicated, isn't it? | |
| 2223 */ | |
| 4029 | 2224 c = PTR2CHAR(linep + pos.col); |
| 2225 switch (c) | |
| 7 | 2226 { |
| 2227 case NUL: | |
| 2228 /* at end of line without trailing backslash, reset inquote */ | |
| 2229 if (pos.col == 0 || linep[pos.col - 1] != '\\') | |
| 2230 { | |
| 2231 inquote = FALSE; | |
| 2232 start_in_quotes = FALSE; | |
| 2233 } | |
| 2234 break; | |
| 2235 | |
| 2236 case '"': | |
| 2237 /* a quote that is preceded with an odd number of backslashes is | |
| 2238 * ignored */ | |
| 2239 if (do_quotes) | |
| 2240 { | |
| 2241 int col; | |
| 2242 | |
| 2243 for (col = pos.col - 1; col >= 0; --col) | |
| 2244 if (linep[col] != '\\') | |
| 2245 break; | |
| 2246 if ((((int)pos.col - 1 - col) & 1) == 0) | |
| 2247 { | |
| 2248 inquote = !inquote; | |
| 2249 start_in_quotes = FALSE; | |
| 2250 } | |
| 2251 } | |
| 2252 break; | |
| 2253 | |
| 2254 /* | |
| 2255 * If smart matching ('cpoptions' does not contain '%'): | |
| 2256 * Skip things in single quotes: 'x' or '\x'. Be careful for single | |
| 2257 * single quotes, eg jon's. Things like '\233' or '\x3f' are not | |
| 2258 * skipped, there is never a brace in them. | |
| 2259 * Ignore this when finding matches for `'. | |
| 2260 */ | |
| 2261 case '\'': | |
| 2262 if (!cpo_match && initc != '\'' && findc != '\'') | |
| 2263 { | |
| 2264 if (backwards) | |
| 2265 { | |
| 2266 if (pos.col > 1) | |
| 2267 { | |
| 2268 if (linep[pos.col - 2] == '\'') | |
| 2269 { | |
| 2270 pos.col -= 2; | |
| 2271 break; | |
| 2272 } | |
| 2273 else if (linep[pos.col - 2] == '\\' && | |
| 2274 pos.col > 2 && linep[pos.col - 3] == '\'') | |
| 2275 { | |
| 2276 pos.col -= 3; | |
| 2277 break; | |
| 2278 } | |
| 2279 } | |
| 2280 } | |
| 2281 else if (linep[pos.col + 1]) /* forward search */ | |
| 2282 { | |
| 2283 if (linep[pos.col + 1] == '\\' && | |
| 2284 linep[pos.col + 2] && linep[pos.col + 3] == '\'') | |
| 2285 { | |
| 2286 pos.col += 3; | |
| 2287 break; | |
| 2288 } | |
| 2289 else if (linep[pos.col + 2] == '\'') | |
| 2290 { | |
| 2291 pos.col += 2; | |
| 2292 break; | |
| 2293 } | |
| 2294 } | |
| 2295 } | |
| 2296 /* FALLTHROUGH */ | |
| 2297 | |
| 2298 default: | |
| 2299 #ifdef FEAT_LISP | |
| 14 | 2300 /* |
| 2301 * For Lisp skip over backslashed (), {} and []. | |
| 2302 * (actually, we skip #\( et al) | |
| 2303 */ | |
| 7 | 2304 if (curbuf->b_p_lisp |
| 2305 && vim_strchr((char_u *)"(){}[]", c) != NULL | |
| 14 | 2306 && pos.col > 1 |
| 2307 && check_prevcol(linep, pos.col, '\\', NULL) | |
| 2308 && check_prevcol(linep, pos.col - 1, '#', NULL)) | |
| 7 | 2309 break; |
| 2310 #endif | |
| 2311 | |
| 2312 /* Check for match outside of quotes, and inside of | |
| 2313 * quotes when the start is also inside of quotes. */ | |
| 2314 if ((!inquote || start_in_quotes == TRUE) | |
| 2315 && (c == initc || c == findc)) | |
| 2316 { | |
| 2317 int col, bslcnt = 0; | |
| 2318 | |
| 2319 if (!cpo_bsl) | |
| 2320 { | |
| 2321 for (col = pos.col; check_prevcol(linep, col, '\\', &col);) | |
| 2322 bslcnt++; | |
| 2323 } | |
| 1859 | 2324 /* Only accept a match when 'M' is in 'cpo' or when escaping |
| 2325 * is what we expect. */ | |
| 7 | 2326 if (cpo_bsl || (bslcnt & 1) == match_escaped) |
| 2327 { | |
| 2328 if (c == initc) | |
| 2329 count++; | |
| 2330 else | |
| 2331 { | |
| 2332 if (count == 0) | |
| 2333 return &pos; | |
| 2334 count--; | |
| 2335 } | |
| 2336 } | |
| 2337 } | |
| 2338 } | |
| 2339 } | |
| 2340 | |
| 2341 if (comment_dir == BACKWARD && count > 0) | |
| 2342 { | |
| 2343 pos = match_pos; | |
| 2344 return &pos; | |
| 2345 } | |
| 2346 return (pos_T *)NULL; /* never found it */ | |
| 2347 } | |
| 2348 | |
| 2349 /* | |
| 2350 * Check if line[] contains a / / comment. | |
| 2351 * Return MAXCOL if not, otherwise return the column. | |
| 2352 * TODO: skip strings. | |
| 2353 */ | |
| 2354 static int | |
| 2355 check_linecomment(line) | |
| 2356 char_u *line; | |
| 2357 { | |
| 2358 char_u *p; | |
| 2359 | |
| 2360 p = line; | |
| 14 | 2361 #ifdef FEAT_LISP |
| 2362 /* skip Lispish one-line comments */ | |
| 2363 if (curbuf->b_p_lisp) | |
| 2364 { | |
| 2365 if (vim_strchr(p, ';') != NULL) /* there may be comments */ | |
| 2366 { | |
| 3263 | 2367 int in_str = FALSE; /* inside of string */ |
| 14 | 2368 |
| 2369 p = line; /* scan from start */ | |
| 333 | 2370 while ((p = vim_strpbrk(p, (char_u *)"\";")) != NULL) |
| 14 | 2371 { |
| 2372 if (*p == '"') | |
| 2373 { | |
| 3263 | 2374 if (in_str) |
| 14 | 2375 { |
| 2376 if (*(p - 1) != '\\') /* skip escaped quote */ | |
| 3263 | 2377 in_str = FALSE; |
| 14 | 2378 } |
| 2379 else if (p == line || ((p - line) >= 2 | |
| 2380 /* skip #\" form */ | |
| 2381 && *(p - 1) != '\\' && *(p - 2) != '#')) | |
| 3263 | 2382 in_str = TRUE; |
| 14 | 2383 } |
| 3263 | 2384 else if (!in_str && ((p - line) < 2 |
| 14 | 2385 || (*(p - 1) != '\\' && *(p - 2) != '#'))) |
| 2386 break; /* found! */ | |
| 2387 ++p; | |
| 2388 } | |
| 2389 } | |
| 2390 else | |
| 2391 p = NULL; | |
| 2392 } | |
| 2393 else | |
| 2394 #endif | |
| 7 | 2395 while ((p = vim_strchr(p, '/')) != NULL) |
| 2396 { | |
| 1463 | 2397 /* accept a double /, unless it's preceded with * and followed by *, |
| 2398 * because * / / * is an end and start of a C comment */ | |
| 2399 if (p[1] == '/' && (p == line || p[-1] != '*' || p[2] != '*')) | |
| 7 | 2400 break; |
| 2401 ++p; | |
| 2402 } | |
| 2403 | |
| 2404 if (p == NULL) | |
| 2405 return MAXCOL; | |
| 2406 return (int)(p - line); | |
| 2407 } | |
| 2408 | |
| 2409 /* | |
| 2410 * Move cursor briefly to character matching the one under the cursor. | |
| 2411 * Used for Insert mode and "r" command. | |
| 2412 * Show the match only if it is visible on the screen. | |
| 2413 * If there isn't a match, then beep. | |
| 2414 */ | |
| 2415 void | |
| 2416 showmatch(c) | |
| 2417 int c; /* char to show match for */ | |
| 2418 { | |
| 2419 pos_T *lpos, save_cursor; | |
| 2420 pos_T mpos; | |
| 2421 colnr_T vcol; | |
| 2422 long save_so; | |
| 2423 long save_siso; | |
| 2424 #ifdef CURSOR_SHAPE | |
| 2425 int save_state; | |
| 2426 #endif | |
| 2427 colnr_T save_dollar_vcol; | |
| 2428 char_u *p; | |
| 2429 | |
| 2430 /* | |
| 2431 * Only show match for chars in the 'matchpairs' option. | |
| 2432 */ | |
| 2433 /* 'matchpairs' is "x:y,x:y" */ | |
| 4029 | 2434 for (p = curbuf->b_p_mps; *p != NUL; ++p) |
| 7 | 2435 { |
| 2436 #ifdef FEAT_RIGHTLEFT | |
| 4153 | 2437 if (PTR2CHAR(p) == c && (curwin->w_p_rl ^ p_ri)) |
| 2438 break; | |
| 7 | 2439 #endif |
| 4029 | 2440 p += MB_PTR2LEN(p) + 1; |
| 2441 if (PTR2CHAR(p) == c | |
| 7 | 2442 #ifdef FEAT_RIGHTLEFT |
| 2443 && !(curwin->w_p_rl ^ p_ri) | |
| 2444 #endif | |
| 2445 ) | |
| 2446 break; | |
| 4029 | 2447 p += MB_PTR2LEN(p); |
| 2448 if (*p == NUL) | |
| 7 | 2449 return; |
| 2450 } | |
| 2451 | |
| 2452 if ((lpos = findmatch(NULL, NUL)) == NULL) /* no match, so beep */ | |
| 2453 vim_beep(); | |
| 4153 | 2454 else if (lpos->lnum >= curwin->w_topline && lpos->lnum < curwin->w_botline) |
| 7 | 2455 { |
| 2456 if (!curwin->w_p_wrap) | |
| 2457 getvcol(curwin, lpos, NULL, &vcol, NULL); | |
| 2458 if (curwin->w_p_wrap || (vcol >= curwin->w_leftcol | |
| 2459 && vcol < curwin->w_leftcol + W_WIDTH(curwin))) | |
| 2460 { | |
| 2461 mpos = *lpos; /* save the pos, update_screen() may change it */ | |
| 2462 save_cursor = curwin->w_cursor; | |
| 2463 save_so = p_so; | |
| 2464 save_siso = p_siso; | |
| 2465 /* Handle "$" in 'cpo': If the ')' is typed on top of the "$", | |
| 2466 * stop displaying the "$". */ | |
| 3318 | 2467 if (dollar_vcol >= 0 && dollar_vcol == curwin->w_virtcol) |
| 2468 dollar_vcol = -1; | |
| 7 | 2469 ++curwin->w_virtcol; /* do display ')' just before "$" */ |
| 2470 update_screen(VALID); /* show the new char first */ | |
| 2471 | |
| 2472 save_dollar_vcol = dollar_vcol; | |
| 2473 #ifdef CURSOR_SHAPE | |
| 2474 save_state = State; | |
| 2475 State = SHOWMATCH; | |
| 2476 ui_cursor_shape(); /* may show different cursor shape */ | |
| 2477 #endif | |
| 2478 curwin->w_cursor = mpos; /* move to matching char */ | |
| 2479 p_so = 0; /* don't use 'scrolloff' here */ | |
| 2480 p_siso = 0; /* don't use 'sidescrolloff' here */ | |
| 2481 showruler(FALSE); | |
| 2482 setcursor(); | |
| 2483 cursor_on(); /* make sure that the cursor is shown */ | |
| 2484 out_flush(); | |
| 2485 #ifdef FEAT_GUI | |
| 2486 if (gui.in_use) | |
| 2487 { | |
| 2488 gui_update_cursor(TRUE, FALSE); | |
| 2489 gui_mch_flush(); | |
| 2490 } | |
| 2491 #endif | |
| 2492 /* Restore dollar_vcol(), because setcursor() may call curs_rows() | |
| 2493 * which resets it if the matching position is in a previous line | |
| 2494 * and has a higher column number. */ | |
| 2495 dollar_vcol = save_dollar_vcol; | |
| 2496 | |
| 2497 /* | |
| 2498 * brief pause, unless 'm' is present in 'cpo' and a character is | |
| 2499 * available. | |
| 2500 */ | |
| 2501 if (vim_strchr(p_cpo, CPO_SHOWMATCH) != NULL) | |
| 2502 ui_delay(p_mat * 100L, TRUE); | |
| 2503 else if (!char_avail()) | |
| 2504 ui_delay(p_mat * 100L, FALSE); | |
| 2505 curwin->w_cursor = save_cursor; /* restore cursor position */ | |
| 2506 p_so = save_so; | |
| 2507 p_siso = save_siso; | |
| 2508 #ifdef CURSOR_SHAPE | |
| 2509 State = save_state; | |
| 2510 ui_cursor_shape(); /* may show different cursor shape */ | |
| 2511 #endif | |
| 2512 } | |
| 2513 } | |
| 2514 } | |
| 2515 | |
| 2516 /* | |
| 2517 * findsent(dir, count) - Find the start of the next sentence in direction | |
| 620 | 2518 * "dir" Sentences are supposed to end in ".", "!" or "?" followed by white |
| 7 | 2519 * space or a line break. Also stop at an empty line. |
| 2520 * Return OK if the next sentence was found. | |
| 2521 */ | |
| 2522 int | |
| 2523 findsent(dir, count) | |
| 2524 int dir; | |
| 2525 long count; | |
| 2526 { | |
| 2527 pos_T pos, tpos; | |
| 2528 int c; | |
| 2529 int (*func) __ARGS((pos_T *)); | |
| 2530 int startlnum; | |
| 2531 int noskip = FALSE; /* do not skip blanks */ | |
| 2532 int cpo_J; | |
| 45 | 2533 int found_dot; |
| 7 | 2534 |
| 2535 pos = curwin->w_cursor; | |
| 2536 if (dir == FORWARD) | |
| 2537 func = incl; | |
| 2538 else | |
| 2539 func = decl; | |
| 2540 | |
| 2541 while (count--) | |
| 2542 { | |
| 2543 /* | |
| 2544 * if on an empty line, skip upto a non-empty line | |
| 2545 */ | |
| 2546 if (gchar_pos(&pos) == NUL) | |
| 2547 { | |
| 2548 do | |
| 2549 if ((*func)(&pos) == -1) | |
| 2550 break; | |
| 2551 while (gchar_pos(&pos) == NUL); | |
| 2552 if (dir == FORWARD) | |
| 2553 goto found; | |
| 2554 } | |
| 2555 /* | |
| 2556 * if on the start of a paragraph or a section and searching forward, | |
| 2557 * go to the next line | |
| 2558 */ | |
| 2559 else if (dir == FORWARD && pos.col == 0 && | |
| 2560 startPS(pos.lnum, NUL, FALSE)) | |
| 2561 { | |
| 2562 if (pos.lnum == curbuf->b_ml.ml_line_count) | |
| 2563 return FAIL; | |
| 2564 ++pos.lnum; | |
| 2565 goto found; | |
| 2566 } | |
| 2567 else if (dir == BACKWARD) | |
| 2568 decl(&pos); | |
| 2569 | |
| 2570 /* go back to the previous non-blank char */ | |
| 45 | 2571 found_dot = FALSE; |
| 7 | 2572 while ((c = gchar_pos(&pos)) == ' ' || c == '\t' || |
| 2573 (dir == BACKWARD && vim_strchr((char_u *)".!?)]\"'", c) != NULL)) | |
| 2574 { | |
| 45 | 2575 if (vim_strchr((char_u *)".!?", c) != NULL) |
| 2576 { | |
| 2577 /* Only skip over a '.', '!' and '?' once. */ | |
| 2578 if (found_dot) | |
| 2579 break; | |
| 2580 found_dot = TRUE; | |
| 2581 } | |
| 7 | 2582 if (decl(&pos) == -1) |
| 2583 break; | |
| 2584 /* when going forward: Stop in front of empty line */ | |
| 2585 if (lineempty(pos.lnum) && dir == FORWARD) | |
| 2586 { | |
| 2587 incl(&pos); | |
| 2588 goto found; | |
| 2589 } | |
| 2590 } | |
| 2591 | |
| 2592 /* remember the line where the search started */ | |
| 2593 startlnum = pos.lnum; | |
| 2594 cpo_J = vim_strchr(p_cpo, CPO_ENDOFSENT) != NULL; | |
| 2595 | |
| 2596 for (;;) /* find end of sentence */ | |
| 2597 { | |
| 2598 c = gchar_pos(&pos); | |
| 2599 if (c == NUL || (pos.col == 0 && startPS(pos.lnum, NUL, FALSE))) | |
| 2600 { | |
| 2601 if (dir == BACKWARD && pos.lnum != startlnum) | |
| 2602 ++pos.lnum; | |
| 2603 break; | |
| 2604 } | |
| 2605 if (c == '.' || c == '!' || c == '?') | |
| 2606 { | |
| 2607 tpos = pos; | |
| 2608 do | |
| 2609 if ((c = inc(&tpos)) == -1) | |
| 2610 break; | |
| 2611 while (vim_strchr((char_u *)")]\"'", c = gchar_pos(&tpos)) | |
| 2612 != NULL); | |
| 2613 if (c == -1 || (!cpo_J && (c == ' ' || c == '\t')) || c == NUL | |
| 2614 || (cpo_J && (c == ' ' && inc(&tpos) >= 0 | |
| 2615 && gchar_pos(&tpos) == ' '))) | |
| 2616 { | |
| 2617 pos = tpos; | |
| 2618 if (gchar_pos(&pos) == NUL) /* skip NUL at EOL */ | |
| 2619 inc(&pos); | |
| 2620 break; | |
| 2621 } | |
| 2622 } | |
| 2623 if ((*func)(&pos) == -1) | |
| 2624 { | |
| 2625 if (count) | |
| 2626 return FAIL; | |
| 2627 noskip = TRUE; | |
| 2628 break; | |
| 2629 } | |
| 2630 } | |
| 2631 found: | |
| 2632 /* skip white space */ | |
| 2633 while (!noskip && ((c = gchar_pos(&pos)) == ' ' || c == '\t')) | |
| 2634 if (incl(&pos) == -1) | |
| 2635 break; | |
| 2636 } | |
| 2637 | |
| 2638 setpcmark(); | |
| 2639 curwin->w_cursor = pos; | |
| 2640 return OK; | |
| 2641 } | |
| 2642 | |
| 2643 /* | |
| 164 | 2644 * Find the next paragraph or section in direction 'dir'. |
| 7 | 2645 * Paragraphs are currently supposed to be separated by empty lines. |
| 164 | 2646 * If 'what' is NUL we go to the next paragraph. |
| 7 | 2647 * If 'what' is '{' or '}' we go to the next section. |
| 2648 * If 'both' is TRUE also stop at '}'. | |
| 164 | 2649 * Return TRUE if the next paragraph or section was found. |
| 7 | 2650 */ |
| 2651 int | |
| 504 | 2652 findpar(pincl, dir, count, what, both) |
| 2653 int *pincl; /* Return: TRUE if last char is to be included */ | |
| 2654 int dir; | |
| 2655 long count; | |
| 2656 int what; | |
| 2657 int both; | |
| 7 | 2658 { |
| 2659 linenr_T curr; | |
| 2660 int did_skip; /* TRUE after separating lines have been skipped */ | |
| 2661 int first; /* TRUE on first line */ | |
| 164 | 2662 int posix = (vim_strchr(p_cpo, CPO_PARA) != NULL); |
| 7 | 2663 #ifdef FEAT_FOLDING |
| 2664 linenr_T fold_first; /* first line of a closed fold */ | |
| 2665 linenr_T fold_last; /* last line of a closed fold */ | |
| 2666 int fold_skipped; /* TRUE if a closed fold was skipped this | |
| 2667 iteration */ | |
| 2668 #endif | |
| 2669 | |
| 2670 curr = curwin->w_cursor.lnum; | |
| 2671 | |
| 2672 while (count--) | |
| 2673 { | |
| 2674 did_skip = FALSE; | |
| 2675 for (first = TRUE; ; first = FALSE) | |
| 2676 { | |
| 2677 if (*ml_get(curr) != NUL) | |
| 2678 did_skip = TRUE; | |
| 2679 | |
| 2680 #ifdef FEAT_FOLDING | |
| 2681 /* skip folded lines */ | |
| 2682 fold_skipped = FALSE; | |
| 2683 if (first && hasFolding(curr, &fold_first, &fold_last)) | |
| 2684 { | |
| 2685 curr = ((dir > 0) ? fold_last : fold_first) + dir; | |
| 2686 fold_skipped = TRUE; | |
| 2687 } | |
| 2688 #endif | |
| 2689 | |
| 164 | 2690 /* POSIX has it's own ideas of what a paragraph boundary is and it |
| 2691 * doesn't match historical Vi: It also stops at a "{" in the | |
| 2692 * first column and at an empty line. */ | |
| 2693 if (!first && did_skip && (startPS(curr, what, both) | |
| 2694 || (posix && what == NUL && *ml_get(curr) == '{'))) | |
| 7 | 2695 break; |
| 2696 | |
| 2697 #ifdef FEAT_FOLDING | |
| 2698 if (fold_skipped) | |
| 2699 curr -= dir; | |
| 2700 #endif | |
| 2701 if ((curr += dir) < 1 || curr > curbuf->b_ml.ml_line_count) | |
| 2702 { | |
| 2703 if (count) | |
| 2704 return FALSE; | |
| 2705 curr -= dir; | |
| 2706 break; | |
| 2707 } | |
| 2708 } | |
| 2709 } | |
| 2710 setpcmark(); | |
| 2711 if (both && *ml_get(curr) == '}') /* include line with '}' */ | |
| 2712 ++curr; | |
| 2713 curwin->w_cursor.lnum = curr; | |
| 2714 if (curr == curbuf->b_ml.ml_line_count && what != '}') | |
| 2715 { | |
| 2716 if ((curwin->w_cursor.col = (colnr_T)STRLEN(ml_get(curr))) != 0) | |
| 2717 { | |
| 2718 --curwin->w_cursor.col; | |
| 504 | 2719 *pincl = TRUE; |
| 7 | 2720 } |
| 2721 } | |
| 2722 else | |
| 2723 curwin->w_cursor.col = 0; | |
| 2724 return TRUE; | |
| 2725 } | |
| 2726 | |
| 2727 /* | |
| 2728 * check if the string 's' is a nroff macro that is in option 'opt' | |
| 2729 */ | |
| 2730 static int | |
| 2731 inmacro(opt, s) | |
| 2732 char_u *opt; | |
| 2733 char_u *s; | |
| 2734 { | |
| 2735 char_u *macro; | |
| 2736 | |
| 2737 for (macro = opt; macro[0]; ++macro) | |
| 2738 { | |
| 2739 /* Accept two characters in the option being equal to two characters | |
| 2740 * in the line. A space in the option matches with a space in the | |
| 2741 * line or the line having ended. */ | |
| 2742 if ( (macro[0] == s[0] | |
| 2743 || (macro[0] == ' ' | |
| 2744 && (s[0] == NUL || s[0] == ' '))) | |
| 2745 && (macro[1] == s[1] | |
| 2746 || ((macro[1] == NUL || macro[1] == ' ') | |
| 2747 && (s[0] == NUL || s[1] == NUL || s[1] == ' ')))) | |
| 2748 break; | |
| 2749 ++macro; | |
| 2750 if (macro[0] == NUL) | |
| 2751 break; | |
| 2752 } | |
| 2753 return (macro[0] != NUL); | |
| 2754 } | |
| 2755 | |
| 2756 /* | |
| 2757 * startPS: return TRUE if line 'lnum' is the start of a section or paragraph. | |
| 2758 * If 'para' is '{' or '}' only check for sections. | |
| 2759 * If 'both' is TRUE also stop at '}' | |
| 2760 */ | |
| 2761 int | |
| 2762 startPS(lnum, para, both) | |
| 2763 linenr_T lnum; | |
| 2764 int para; | |
| 2765 int both; | |
| 2766 { | |
| 2767 char_u *s; | |
| 2768 | |
| 2769 s = ml_get(lnum); | |
| 2770 if (*s == para || *s == '\f' || (both && *s == '}')) | |
| 2771 return TRUE; | |
| 2772 if (*s == '.' && (inmacro(p_sections, s + 1) || | |
| 2773 (!para && inmacro(p_para, s + 1)))) | |
| 2774 return TRUE; | |
| 2775 return FALSE; | |
| 2776 } | |
| 2777 | |
| 2778 /* | |
| 2779 * The following routines do the word searches performed by the 'w', 'W', | |
| 2780 * 'b', 'B', 'e', and 'E' commands. | |
| 2781 */ | |
| 2782 | |
| 2783 /* | |
| 2784 * To perform these searches, characters are placed into one of three | |
| 2785 * classes, and transitions between classes determine word boundaries. | |
| 2786 * | |
| 2787 * The classes are: | |
| 2788 * | |
| 2789 * 0 - white space | |
| 2790 * 1 - punctuation | |
| 2791 * 2 or higher - keyword characters (letters, digits and underscore) | |
| 2792 */ | |
| 2793 | |
| 2794 static int cls_bigword; /* TRUE for "W", "B" or "E" */ | |
| 2795 | |
| 2796 /* | |
| 2797 * cls() - returns the class of character at curwin->w_cursor | |
| 2798 * | |
| 2799 * If a 'W', 'B', or 'E' motion is being done (cls_bigword == TRUE), chars | |
| 2800 * from class 2 and higher are reported as class 1 since only white space | |
| 2801 * boundaries are of interest. | |
| 2802 */ | |
| 2803 static int | |
| 2804 cls() | |
| 2805 { | |
| 2806 int c; | |
| 2807 | |
| 2808 c = gchar_cursor(); | |
| 2809 #ifdef FEAT_FKMAP /* when 'akm' (Farsi mode), take care of Farsi blank */ | |
| 2810 if (p_altkeymap && c == F_BLANK) | |
| 2811 return 0; | |
| 2812 #endif | |
| 2813 if (c == ' ' || c == '\t' || c == NUL) | |
| 2814 return 0; | |
| 2815 #ifdef FEAT_MBYTE | |
| 2816 if (enc_dbcs != 0 && c > 0xFF) | |
| 2817 { | |
| 2818 /* If cls_bigword, report multi-byte chars as class 1. */ | |
| 2819 if (enc_dbcs == DBCS_KOR && cls_bigword) | |
| 2820 return 1; | |
| 2821 | |
| 2822 /* process code leading/trailing bytes */ | |
| 2823 return dbcs_class(((unsigned)c >> 8), (c & 0xFF)); | |
| 2824 } | |
| 2825 if (enc_utf8) | |
| 2826 { | |
| 2827 c = utf_class(c); | |
| 2828 if (c != 0 && cls_bigword) | |
| 2829 return 1; | |
| 2830 return c; | |
| 2831 } | |
| 2832 #endif | |
| 2833 | |
| 2834 /* If cls_bigword is TRUE, report all non-blanks as class 1. */ | |
| 2835 if (cls_bigword) | |
| 2836 return 1; | |
| 2837 | |
| 2838 if (vim_iswordc(c)) | |
| 2839 return 2; | |
| 2840 return 1; | |
| 2841 } | |
| 2842 | |
| 2843 | |
| 2844 /* | |
| 2845 * fwd_word(count, type, eol) - move forward one word | |
| 2846 * | |
| 2847 * Returns FAIL if the cursor was already at the end of the file. | |
| 2848 * If eol is TRUE, last word stops at end of line (for operators). | |
| 2849 */ | |
| 2850 int | |
| 2851 fwd_word(count, bigword, eol) | |
| 2852 long count; | |
| 2853 int bigword; /* "W", "E" or "B" */ | |
| 2854 int eol; | |
| 2855 { | |
| 2856 int sclass; /* starting class */ | |
| 2857 int i; | |
| 2858 int last_line; | |
| 2859 | |
| 2860 #ifdef FEAT_VIRTUALEDIT | |
| 2861 curwin->w_cursor.coladd = 0; | |
| 2862 #endif | |
| 2863 cls_bigword = bigword; | |
| 2864 while (--count >= 0) | |
| 2865 { | |
| 2866 #ifdef FEAT_FOLDING | |
| 2867 /* When inside a range of folded lines, move to the last char of the | |
| 2868 * last line. */ | |
| 2869 if (hasFolding(curwin->w_cursor.lnum, NULL, &curwin->w_cursor.lnum)) | |
| 2870 coladvance((colnr_T)MAXCOL); | |
| 2871 #endif | |
| 2872 sclass = cls(); | |
| 2873 | |
| 2874 /* | |
| 2875 * We always move at least one character, unless on the last | |
| 2876 * character in the buffer. | |
| 2877 */ | |
| 2878 last_line = (curwin->w_cursor.lnum == curbuf->b_ml.ml_line_count); | |
| 2879 i = inc_cursor(); | |
| 2880 if (i == -1 || (i >= 1 && last_line)) /* started at last char in file */ | |
| 2881 return FAIL; | |
| 1309 | 2882 if (i >= 1 && eol && count == 0) /* started at last char in line */ |
| 7 | 2883 return OK; |
| 2884 | |
| 2885 /* | |
| 2886 * Go one char past end of current word (if any) | |
| 2887 */ | |
| 2888 if (sclass != 0) | |
| 2889 while (cls() == sclass) | |
| 2890 { | |
| 2891 i = inc_cursor(); | |
| 2892 if (i == -1 || (i >= 1 && eol && count == 0)) | |
| 2893 return OK; | |
| 2894 } | |
| 2895 | |
| 2896 /* | |
| 2897 * go to next non-white | |
| 2898 */ | |
| 2899 while (cls() == 0) | |
| 2900 { | |
| 2901 /* | |
| 2902 * We'll stop if we land on a blank line | |
| 2903 */ | |
| 2904 if (curwin->w_cursor.col == 0 && *ml_get_curline() == NUL) | |
| 2905 break; | |
| 2906 | |
| 2907 i = inc_cursor(); | |
| 2908 if (i == -1 || (i >= 1 && eol && count == 0)) | |
| 2909 return OK; | |
| 2910 } | |
| 2911 } | |
| 2912 return OK; | |
| 2913 } | |
| 2914 | |
| 2915 /* | |
| 2916 * bck_word() - move backward 'count' words | |
| 2917 * | |
| 2918 * If stop is TRUE and we are already on the start of a word, move one less. | |
| 2919 * | |
| 2920 * Returns FAIL if top of the file was reached. | |
| 2921 */ | |
| 2922 int | |
| 2923 bck_word(count, bigword, stop) | |
| 2924 long count; | |
| 2925 int bigword; | |
| 2926 int stop; | |
| 2927 { | |
| 2928 int sclass; /* starting class */ | |
| 2929 | |
| 2930 #ifdef FEAT_VIRTUALEDIT | |
| 2931 curwin->w_cursor.coladd = 0; | |
| 2932 #endif | |
| 2933 cls_bigword = bigword; | |
| 2934 while (--count >= 0) | |
| 2935 { | |
| 2936 #ifdef FEAT_FOLDING | |
| 2937 /* When inside a range of folded lines, move to the first char of the | |
| 2938 * first line. */ | |
| 2939 if (hasFolding(curwin->w_cursor.lnum, &curwin->w_cursor.lnum, NULL)) | |
| 2940 curwin->w_cursor.col = 0; | |
| 2941 #endif | |
| 2942 sclass = cls(); | |
| 2943 if (dec_cursor() == -1) /* started at start of file */ | |
| 2944 return FAIL; | |
| 2945 | |
| 2946 if (!stop || sclass == cls() || sclass == 0) | |
| 2947 { | |
| 2948 /* | |
| 2949 * Skip white space before the word. | |
| 2950 * Stop on an empty line. | |
| 2951 */ | |
| 2952 while (cls() == 0) | |
| 2953 { | |
| 2954 if (curwin->w_cursor.col == 0 | |
| 2955 && lineempty(curwin->w_cursor.lnum)) | |
| 2956 goto finished; | |
| 2957 if (dec_cursor() == -1) /* hit start of file, stop here */ | |
| 2958 return OK; | |
| 2959 } | |
| 2960 | |
| 2961 /* | |
| 2962 * Move backward to start of this word. | |
| 2963 */ | |
| 2964 if (skip_chars(cls(), BACKWARD)) | |
| 2965 return OK; | |
| 2966 } | |
| 2967 | |
| 2968 inc_cursor(); /* overshot - forward one */ | |
| 2969 finished: | |
| 2970 stop = FALSE; | |
| 2971 } | |
| 2972 return OK; | |
| 2973 } | |
| 2974 | |
| 2975 /* | |
| 2976 * end_word() - move to the end of the word | |
| 2977 * | |
| 2978 * There is an apparent bug in the 'e' motion of the real vi. At least on the | |
| 2979 * System V Release 3 version for the 80386. Unlike 'b' and 'w', the 'e' | |
| 2980 * motion crosses blank lines. When the real vi crosses a blank line in an | |
| 2981 * 'e' motion, the cursor is placed on the FIRST character of the next | |
| 2982 * non-blank line. The 'E' command, however, works correctly. Since this | |
| 2983 * appears to be a bug, I have not duplicated it here. | |
| 2984 * | |
| 2985 * Returns FAIL if end of the file was reached. | |
| 2986 * | |
| 2987 * If stop is TRUE and we are already on the end of a word, move one less. | |
| 2988 * If empty is TRUE stop on an empty line. | |
| 2989 */ | |
| 2990 int | |
| 2991 end_word(count, bigword, stop, empty) | |
| 2992 long count; | |
| 2993 int bigword; | |
| 2994 int stop; | |
| 2995 int empty; | |
| 2996 { | |
| 2997 int sclass; /* starting class */ | |
| 2998 | |
| 2999 #ifdef FEAT_VIRTUALEDIT | |
| 3000 curwin->w_cursor.coladd = 0; | |
| 3001 #endif | |
| 3002 cls_bigword = bigword; | |
| 3003 while (--count >= 0) | |
| 3004 { | |
| 3005 #ifdef FEAT_FOLDING | |
| 3006 /* When inside a range of folded lines, move to the last char of the | |
| 3007 * last line. */ | |
| 3008 if (hasFolding(curwin->w_cursor.lnum, NULL, &curwin->w_cursor.lnum)) | |
| 3009 coladvance((colnr_T)MAXCOL); | |
| 3010 #endif | |
| 3011 sclass = cls(); | |
| 3012 if (inc_cursor() == -1) | |
| 3013 return FAIL; | |
| 3014 | |
| 3015 /* | |
| 3016 * If we're in the middle of a word, we just have to move to the end | |
| 3017 * of it. | |
| 3018 */ | |
| 3019 if (cls() == sclass && sclass != 0) | |
| 3020 { | |
| 3021 /* | |
| 3022 * Move forward to end of the current word | |
| 3023 */ | |
| 3024 if (skip_chars(sclass, FORWARD)) | |
| 3025 return FAIL; | |
| 3026 } | |
| 3027 else if (!stop || sclass == 0) | |
| 3028 { | |
| 3029 /* | |
| 3030 * We were at the end of a word. Go to the end of the next word. | |
| 3031 * First skip white space, if 'empty' is TRUE, stop at empty line. | |
| 3032 */ | |
| 3033 while (cls() == 0) | |
| 3034 { | |
| 3035 if (empty && curwin->w_cursor.col == 0 | |
| 3036 && lineempty(curwin->w_cursor.lnum)) | |
| 3037 goto finished; | |
| 3038 if (inc_cursor() == -1) /* hit end of file, stop here */ | |
| 3039 return FAIL; | |
| 3040 } | |
| 3041 | |
| 3042 /* | |
| 3043 * Move forward to the end of this word. | |
| 3044 */ | |
| 3045 if (skip_chars(cls(), FORWARD)) | |
| 3046 return FAIL; | |
| 3047 } | |
| 3048 dec_cursor(); /* overshot - one char backward */ | |
| 3049 finished: | |
| 3050 stop = FALSE; /* we move only one word less */ | |
| 3051 } | |
| 3052 return OK; | |
| 3053 } | |
| 3054 | |
| 3055 /* | |
| 3056 * Move back to the end of the word. | |
| 3057 * | |
| 3058 * Returns FAIL if start of the file was reached. | |
| 3059 */ | |
| 3060 int | |
| 3061 bckend_word(count, bigword, eol) | |
| 3062 long count; | |
| 3063 int bigword; /* TRUE for "B" */ | |
| 3064 int eol; /* TRUE: stop at end of line. */ | |
| 3065 { | |
| 3066 int sclass; /* starting class */ | |
| 3067 int i; | |
| 3068 | |
| 3069 #ifdef FEAT_VIRTUALEDIT | |
| 3070 curwin->w_cursor.coladd = 0; | |
| 3071 #endif | |
| 3072 cls_bigword = bigword; | |
| 3073 while (--count >= 0) | |
| 3074 { | |
| 3075 sclass = cls(); | |
| 3076 if ((i = dec_cursor()) == -1) | |
| 3077 return FAIL; | |
| 3078 if (eol && i == 1) | |
| 3079 return OK; | |
| 3080 | |
| 3081 /* | |
| 3082 * Move backward to before the start of this word. | |
| 3083 */ | |
| 3084 if (sclass != 0) | |
| 3085 { | |
| 3086 while (cls() == sclass) | |
| 3087 if ((i = dec_cursor()) == -1 || (eol && i == 1)) | |
| 3088 return OK; | |
| 3089 } | |
| 3090 | |
| 3091 /* | |
| 3092 * Move backward to end of the previous word | |
| 3093 */ | |
| 3094 while (cls() == 0) | |
| 3095 { | |
| 3096 if (curwin->w_cursor.col == 0 && lineempty(curwin->w_cursor.lnum)) | |
| 3097 break; | |
| 3098 if ((i = dec_cursor()) == -1 || (eol && i == 1)) | |
| 3099 return OK; | |
| 3100 } | |
| 3101 } | |
| 3102 return OK; | |
| 3103 } | |
| 3104 | |
| 3105 /* | |
| 3106 * Skip a row of characters of the same class. | |
| 3107 * Return TRUE when end-of-file reached, FALSE otherwise. | |
| 3108 */ | |
| 3109 static int | |
| 3110 skip_chars(cclass, dir) | |
| 3111 int cclass; | |
| 3112 int dir; | |
| 3113 { | |
| 3114 while (cls() == cclass) | |
| 3115 if ((dir == FORWARD ? inc_cursor() : dec_cursor()) == -1) | |
| 3116 return TRUE; | |
| 3117 return FALSE; | |
| 3118 } | |
| 3119 | |
| 3120 #ifdef FEAT_TEXTOBJ | |
| 3121 /* | |
| 3122 * Go back to the start of the word or the start of white space | |
| 3123 */ | |
| 3124 static void | |
| 3125 back_in_line() | |
| 3126 { | |
| 3127 int sclass; /* starting class */ | |
| 3128 | |
| 3129 sclass = cls(); | |
| 3130 for (;;) | |
| 3131 { | |
| 3132 if (curwin->w_cursor.col == 0) /* stop at start of line */ | |
| 3133 break; | |
| 3134 dec_cursor(); | |
| 3135 if (cls() != sclass) /* stop at start of word */ | |
| 3136 { | |
| 3137 inc_cursor(); | |
| 3138 break; | |
| 3139 } | |
| 3140 } | |
| 3141 } | |
| 3142 | |
| 3143 static void | |
| 3144 find_first_blank(posp) | |
| 3145 pos_T *posp; | |
| 3146 { | |
| 3147 int c; | |
| 3148 | |
| 3149 while (decl(posp) != -1) | |
| 3150 { | |
| 3151 c = gchar_pos(posp); | |
| 3152 if (!vim_iswhite(c)) | |
| 3153 { | |
| 3154 incl(posp); | |
| 3155 break; | |
| 3156 } | |
| 3157 } | |
| 3158 } | |
| 3159 | |
| 3160 /* | |
| 3161 * Skip count/2 sentences and count/2 separating white spaces. | |
| 3162 */ | |
| 3163 static void | |
| 3164 findsent_forward(count, at_start_sent) | |
| 3165 long count; | |
| 3166 int at_start_sent; /* cursor is at start of sentence */ | |
| 3167 { | |
| 3168 while (count--) | |
| 3169 { | |
| 3170 findsent(FORWARD, 1L); | |
| 3171 if (at_start_sent) | |
| 3172 find_first_blank(&curwin->w_cursor); | |
| 3173 if (count == 0 || at_start_sent) | |
| 3174 decl(&curwin->w_cursor); | |
| 3175 at_start_sent = !at_start_sent; | |
| 3176 } | |
| 3177 } | |
| 3178 | |
| 3179 /* | |
| 3180 * Find word under cursor, cursor at end. | |
| 3181 * Used while an operator is pending, and in Visual mode. | |
| 3182 */ | |
| 3183 int | |
| 3184 current_word(oap, count, include, bigword) | |
| 3185 oparg_T *oap; | |
| 3186 long count; | |
| 3187 int include; /* TRUE: include word and white space */ | |
| 3188 int bigword; /* FALSE == word, TRUE == WORD */ | |
| 3189 { | |
| 3190 pos_T start_pos; | |
| 3191 pos_T pos; | |
| 3192 int inclusive = TRUE; | |
| 3193 int include_white = FALSE; | |
| 3194 | |
| 3195 cls_bigword = bigword; | |
| 699 | 3196 clearpos(&start_pos); |
| 7 | 3197 |
| 3198 #ifdef FEAT_VISUAL | |
| 3199 /* Correct cursor when 'selection' is exclusive */ | |
| 3200 if (VIsual_active && *p_sel == 'e' && lt(VIsual, curwin->w_cursor)) | |
| 3201 dec_cursor(); | |
| 3202 | |
| 3203 /* | |
| 3204 * When Visual mode is not active, or when the VIsual area is only one | |
| 3205 * character, select the word and/or white space under the cursor. | |
| 3206 */ | |
| 3207 if (!VIsual_active || equalpos(curwin->w_cursor, VIsual)) | |
| 3208 #endif | |
| 3209 { | |
| 3210 /* | |
| 3211 * Go to start of current word or white space. | |
| 3212 */ | |
| 3213 back_in_line(); | |
| 3214 start_pos = curwin->w_cursor; | |
| 3215 | |
| 3216 /* | |
| 3217 * If the start is on white space, and white space should be included | |
| 3218 * (" word"), or start is not on white space, and white space should | |
| 3219 * not be included ("word"), find end of word. | |
| 3220 */ | |
| 3221 if ((cls() == 0) == include) | |
| 3222 { | |
| 3223 if (end_word(1L, bigword, TRUE, TRUE) == FAIL) | |
| 3224 return FAIL; | |
| 3225 } | |
| 3226 else | |
| 3227 { | |
| 3228 /* | |
| 3229 * If the start is not on white space, and white space should be | |
| 3230 * included ("word "), or start is on white space and white | |
| 3231 * space should not be included (" "), find start of word. | |
| 3232 * If we end up in the first column of the next line (single char | |
| 3233 * word) back up to end of the line. | |
| 3234 */ | |
| 3235 fwd_word(1L, bigword, TRUE); | |
| 3236 if (curwin->w_cursor.col == 0) | |
| 3237 decl(&curwin->w_cursor); | |
| 3238 else | |
| 3239 oneleft(); | |
| 3240 | |
| 3241 if (include) | |
| 3242 include_white = TRUE; | |
| 3243 } | |
| 3244 | |
| 3245 #ifdef FEAT_VISUAL | |
| 3246 if (VIsual_active) | |
| 3247 { | |
| 3248 /* should do something when inclusive == FALSE ! */ | |
| 3249 VIsual = start_pos; | |
| 3250 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 3251 } | |
| 3252 else | |
| 3253 #endif | |
| 3254 { | |
| 3255 oap->start = start_pos; | |
| 3256 oap->motion_type = MCHAR; | |
| 3257 } | |
| 3258 --count; | |
| 3259 } | |
| 3260 | |
| 3261 /* | |
| 3262 * When count is still > 0, extend with more objects. | |
| 3263 */ | |
| 3264 while (count > 0) | |
| 3265 { | |
| 3266 inclusive = TRUE; | |
| 3267 #ifdef FEAT_VISUAL | |
| 3268 if (VIsual_active && lt(curwin->w_cursor, VIsual)) | |
| 3269 { | |
| 3270 /* | |
| 3271 * In Visual mode, with cursor at start: move cursor back. | |
| 3272 */ | |
| 3273 if (decl(&curwin->w_cursor) == -1) | |
| 3274 return FAIL; | |
| 3275 if (include != (cls() != 0)) | |
| 3276 { | |
| 3277 if (bck_word(1L, bigword, TRUE) == FAIL) | |
| 3278 return FAIL; | |
| 3279 } | |
| 3280 else | |
| 3281 { | |
| 3282 if (bckend_word(1L, bigword, TRUE) == FAIL) | |
| 3283 return FAIL; | |
| 3284 (void)incl(&curwin->w_cursor); | |
| 3285 } | |
| 3286 } | |
| 3287 else | |
| 3288 #endif | |
| 3289 { | |
| 3290 /* | |
| 3291 * Move cursor forward one word and/or white area. | |
| 3292 */ | |
| 3293 if (incl(&curwin->w_cursor) == -1) | |
| 3294 return FAIL; | |
| 3295 if (include != (cls() == 0)) | |
| 3296 { | |
| 96 | 3297 if (fwd_word(1L, bigword, TRUE) == FAIL && count > 1) |
| 7 | 3298 return FAIL; |
| 3299 /* | |
| 3300 * If end is just past a new-line, we don't want to include | |
| 96 | 3301 * the first character on the line. |
| 3302 * Put cursor on last char of white. | |
| 7 | 3303 */ |
| 96 | 3304 if (oneleft() == FAIL) |
| 7 | 3305 inclusive = FALSE; |
| 3306 } | |
| 3307 else | |
| 3308 { | |
| 3309 if (end_word(1L, bigword, TRUE, TRUE) == FAIL) | |
| 3310 return FAIL; | |
| 3311 } | |
| 3312 } | |
| 3313 --count; | |
| 3314 } | |
| 3315 | |
| 9 | 3316 if (include_white && (cls() != 0 |
| 3317 || (curwin->w_cursor.col == 0 && !inclusive))) | |
| 7 | 3318 { |
| 3319 /* | |
| 3320 * If we don't include white space at the end, move the start | |
| 3321 * to include some white space there. This makes "daw" work | |
| 3322 * better on the last word in a sentence (and "2daw" on last-but-one | |
| 9 | 3323 * word). Also when "2daw" deletes "word." at the end of the line |
| 3324 * (cursor is at start of next line). | |
| 3325 * But don't delete white space at start of line (indent). | |
| 7 | 3326 */ |
| 3327 pos = curwin->w_cursor; /* save cursor position */ | |
| 3328 curwin->w_cursor = start_pos; | |
| 3329 if (oneleft() == OK) | |
| 3330 { | |
| 3331 back_in_line(); | |
| 3332 if (cls() == 0 && curwin->w_cursor.col > 0) | |
| 3333 { | |
| 3334 #ifdef FEAT_VISUAL | |
| 3335 if (VIsual_active) | |
| 3336 VIsual = curwin->w_cursor; | |
| 3337 else | |
| 3338 #endif | |
| 3339 oap->start = curwin->w_cursor; | |
| 3340 } | |
| 3341 } | |
| 3342 curwin->w_cursor = pos; /* put cursor back at end */ | |
| 3343 } | |
| 3344 | |
| 3345 #ifdef FEAT_VISUAL | |
| 3346 if (VIsual_active) | |
| 3347 { | |
| 3348 if (*p_sel == 'e' && inclusive && ltoreq(VIsual, curwin->w_cursor)) | |
| 3349 inc_cursor(); | |
| 3350 if (VIsual_mode == 'V') | |
| 3351 { | |
| 3352 VIsual_mode = 'v'; | |
| 3353 redraw_cmdline = TRUE; /* show mode later */ | |
| 3354 } | |
| 3355 } | |
| 3356 else | |
| 3357 #endif | |
| 3358 oap->inclusive = inclusive; | |
| 3359 | |
| 3360 return OK; | |
| 3361 } | |
| 3362 | |
| 3363 /* | |
| 3364 * Find sentence(s) under the cursor, cursor at end. | |
| 3365 * When Visual active, extend it by one or more sentences. | |
| 3366 */ | |
| 3367 int | |
| 3368 current_sent(oap, count, include) | |
| 3369 oparg_T *oap; | |
| 3370 long count; | |
| 3371 int include; | |
| 3372 { | |
| 3373 pos_T start_pos; | |
| 3374 pos_T pos; | |
| 3375 int start_blank; | |
| 3376 int c; | |
| 3377 int at_start_sent; | |
| 3378 long ncount; | |
| 3379 | |
| 3380 start_pos = curwin->w_cursor; | |
| 3381 pos = start_pos; | |
| 3382 findsent(FORWARD, 1L); /* Find start of next sentence. */ | |
| 3383 | |
| 3384 #ifdef FEAT_VISUAL | |
| 3385 /* | |
| 3701 | 3386 * When the Visual area is bigger than one character: Extend it. |
| 7 | 3387 */ |
| 3388 if (VIsual_active && !equalpos(start_pos, VIsual)) | |
| 3389 { | |
| 3390 extend: | |
| 3391 if (lt(start_pos, VIsual)) | |
| 3392 { | |
| 3393 /* | |
| 3394 * Cursor at start of Visual area. | |
| 3395 * Find out where we are: | |
| 3396 * - in the white space before a sentence | |
| 3397 * - in a sentence or just after it | |
| 3398 * - at the start of a sentence | |
| 3399 */ | |
| 3400 at_start_sent = TRUE; | |
| 3401 decl(&pos); | |
| 3402 while (lt(pos, curwin->w_cursor)) | |
| 3403 { | |
| 3404 c = gchar_pos(&pos); | |
| 3405 if (!vim_iswhite(c)) | |
| 3406 { | |
| 3407 at_start_sent = FALSE; | |
| 3408 break; | |
| 3409 } | |
| 3410 incl(&pos); | |
| 3411 } | |
| 3412 if (!at_start_sent) | |
| 3413 { | |
| 3414 findsent(BACKWARD, 1L); | |
| 3415 if (equalpos(curwin->w_cursor, start_pos)) | |
| 3416 at_start_sent = TRUE; /* exactly at start of sentence */ | |
| 3417 else | |
| 3418 /* inside a sentence, go to its end (start of next) */ | |
| 3419 findsent(FORWARD, 1L); | |
| 3420 } | |
| 3421 if (include) /* "as" gets twice as much as "is" */ | |
| 3422 count *= 2; | |
| 3423 while (count--) | |
| 3424 { | |
| 3425 if (at_start_sent) | |
| 3426 find_first_blank(&curwin->w_cursor); | |
| 3427 c = gchar_cursor(); | |
| 3428 if (!at_start_sent || (!include && !vim_iswhite(c))) | |
| 3429 findsent(BACKWARD, 1L); | |
| 3430 at_start_sent = !at_start_sent; | |
| 3431 } | |
| 3432 } | |
| 3433 else | |
| 3434 { | |
| 3435 /* | |
| 3436 * Cursor at end of Visual area. | |
| 3437 * Find out where we are: | |
| 3438 * - just before a sentence | |
| 3439 * - just before or in the white space before a sentence | |
| 3440 * - in a sentence | |
| 3441 */ | |
| 3442 incl(&pos); | |
| 3443 at_start_sent = TRUE; | |
| 3444 if (!equalpos(pos, curwin->w_cursor)) /* not just before a sentence */ | |
| 3445 { | |
| 3446 at_start_sent = FALSE; | |
| 3447 while (lt(pos, curwin->w_cursor)) | |
| 3448 { | |
| 3449 c = gchar_pos(&pos); | |
| 3450 if (!vim_iswhite(c)) | |
| 3451 { | |
| 3452 at_start_sent = TRUE; | |
| 3453 break; | |
| 3454 } | |
| 3455 incl(&pos); | |
| 3456 } | |
| 3457 if (at_start_sent) /* in the sentence */ | |
| 3458 findsent(BACKWARD, 1L); | |
| 3459 else /* in/before white before a sentence */ | |
| 3460 curwin->w_cursor = start_pos; | |
| 3461 } | |
| 3462 | |
| 3463 if (include) /* "as" gets twice as much as "is" */ | |
| 3464 count *= 2; | |
| 3465 findsent_forward(count, at_start_sent); | |
| 3466 if (*p_sel == 'e') | |
| 3467 ++curwin->w_cursor.col; | |
| 3468 } | |
| 3469 return OK; | |
| 3470 } | |
| 3471 #endif | |
| 3472 | |
| 3473 /* | |
| 3701 | 3474 * If the cursor started on a blank, check if it is just before the start |
| 3475 * of the next sentence. | |
| 7 | 3476 */ |
| 3477 while (c = gchar_pos(&pos), vim_iswhite(c)) /* vim_iswhite() is a macro */ | |
| 3478 incl(&pos); | |
| 3479 if (equalpos(pos, curwin->w_cursor)) | |
| 3480 { | |
| 3481 start_blank = TRUE; | |
| 3482 find_first_blank(&start_pos); /* go back to first blank */ | |
| 3483 } | |
| 3484 else | |
| 3485 { | |
| 3486 start_blank = FALSE; | |
| 3487 findsent(BACKWARD, 1L); | |
| 3488 start_pos = curwin->w_cursor; | |
| 3489 } | |
| 3490 if (include) | |
| 3491 ncount = count * 2; | |
| 3492 else | |
| 3493 { | |
| 3494 ncount = count; | |
| 3495 if (start_blank) | |
| 3496 --ncount; | |
| 3497 } | |
| 45 | 3498 if (ncount > 0) |
| 7 | 3499 findsent_forward(ncount, TRUE); |
| 3500 else | |
| 3501 decl(&curwin->w_cursor); | |
| 3502 | |
| 3503 if (include) | |
| 3504 { | |
| 3505 /* | |
| 3506 * If the blank in front of the sentence is included, exclude the | |
| 3507 * blanks at the end of the sentence, go back to the first blank. | |
| 3508 * If there are no trailing blanks, try to include leading blanks. | |
| 3509 */ | |
| 3510 if (start_blank) | |
| 3511 { | |
| 3512 find_first_blank(&curwin->w_cursor); | |
| 3513 c = gchar_pos(&curwin->w_cursor); /* vim_iswhite() is a macro */ | |
| 3514 if (vim_iswhite(c)) | |
| 3515 decl(&curwin->w_cursor); | |
| 3516 } | |
| 3517 else if (c = gchar_cursor(), !vim_iswhite(c)) | |
| 3518 find_first_blank(&start_pos); | |
| 3519 } | |
| 3520 | |
| 3521 #ifdef FEAT_VISUAL | |
| 3522 if (VIsual_active) | |
| 3523 { | |
| 3701 | 3524 /* Avoid getting stuck with "is" on a single space before a sentence. */ |
| 7 | 3525 if (equalpos(start_pos, curwin->w_cursor)) |
| 3526 goto extend; | |
| 3527 if (*p_sel == 'e') | |
| 3528 ++curwin->w_cursor.col; | |
| 3529 VIsual = start_pos; | |
| 3530 VIsual_mode = 'v'; | |
| 3531 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 3532 } | |
| 3533 else | |
| 3534 #endif | |
| 3535 { | |
| 3536 /* include a newline after the sentence, if there is one */ | |
| 3537 if (incl(&curwin->w_cursor) == -1) | |
| 3538 oap->inclusive = TRUE; | |
| 3539 else | |
| 3540 oap->inclusive = FALSE; | |
| 3541 oap->start = start_pos; | |
| 3542 oap->motion_type = MCHAR; | |
| 3543 } | |
| 3544 return OK; | |
| 3545 } | |
| 3546 | |
| 423 | 3547 /* |
| 3548 * Find block under the cursor, cursor at end. | |
| 4352 | 3549 * "what" and "other" are two matching parenthesis/brace/etc. |
| 423 | 3550 */ |
| 7 | 3551 int |
| 3552 current_block(oap, count, include, what, other) | |
| 3553 oparg_T *oap; | |
| 3554 long count; | |
| 3555 int include; /* TRUE == include white space */ | |
| 3556 int what; /* '(', '{', etc. */ | |
| 3557 int other; /* ')', '}', etc. */ | |
| 3558 { | |
| 3559 pos_T old_pos; | |
| 3560 pos_T *pos = NULL; | |
| 3561 pos_T start_pos; | |
| 3562 pos_T *end_pos; | |
| 3563 pos_T old_start, old_end; | |
| 3564 char_u *save_cpo; | |
| 423 | 3565 int sol = FALSE; /* '{' at start of line */ |
| 7 | 3566 |
| 3567 old_pos = curwin->w_cursor; | |
| 423 | 3568 old_end = curwin->w_cursor; /* remember where we started */ |
| 7 | 3569 old_start = old_end; |
| 3570 | |
| 3571 /* | |
| 3572 * If we start on '(', '{', ')', '}', etc., use the whole block inclusive. | |
| 3573 */ | |
| 3574 #ifdef FEAT_VISUAL | |
| 3575 if (!VIsual_active || equalpos(VIsual, curwin->w_cursor)) | |
| 3576 #endif | |
| 3577 { | |
| 3578 setpcmark(); | |
| 423 | 3579 if (what == '{') /* ignore indent */ |
| 7 | 3580 while (inindent(1)) |
| 3581 if (inc_cursor() != 0) | |
| 3582 break; | |
| 423 | 3583 if (gchar_cursor() == what) |
| 3584 /* cursor on '(' or '{', move cursor just after it */ | |
| 7 | 3585 ++curwin->w_cursor.col; |
| 3586 } | |
| 3587 #ifdef FEAT_VISUAL | |
| 3588 else if (lt(VIsual, curwin->w_cursor)) | |
| 3589 { | |
| 3590 old_start = VIsual; | |
| 3591 curwin->w_cursor = VIsual; /* cursor at low end of Visual */ | |
| 3592 } | |
| 3593 else | |
| 3594 old_end = VIsual; | |
| 3595 #endif | |
| 3596 | |
| 3597 /* | |
| 3598 * Search backwards for unclosed '(', '{', etc.. | |
| 3599 * Put this position in start_pos. | |
| 423 | 3600 * Ignore quotes here. |
| 7 | 3601 */ |
| 3602 save_cpo = p_cpo; | |
| 3603 p_cpo = (char_u *)"%"; | |
| 3604 while (count-- > 0) | |
| 3605 { | |
| 3606 if ((pos = findmatch(NULL, what)) == NULL) | |
| 3607 break; | |
| 3608 curwin->w_cursor = *pos; | |
| 3609 start_pos = *pos; /* the findmatch for end_pos will overwrite *pos */ | |
| 3610 } | |
| 3611 p_cpo = save_cpo; | |
| 3612 | |
| 3613 /* | |
| 3614 * Search for matching ')', '}', etc. | |
| 3615 * Put this position in curwin->w_cursor. | |
| 3616 */ | |
| 3617 if (pos == NULL || (end_pos = findmatch(NULL, other)) == NULL) | |
| 3618 { | |
| 3619 curwin->w_cursor = old_pos; | |
| 3620 return FAIL; | |
| 3621 } | |
| 3622 curwin->w_cursor = *end_pos; | |
| 3623 | |
| 3624 /* | |
| 3625 * Try to exclude the '(', '{', ')', '}', etc. when "include" is FALSE. | |
| 3626 * If the ending '}' is only preceded by indent, skip that indent. | |
| 3627 * But only if the resulting area is not smaller than what we started with. | |
| 3628 */ | |
| 3629 while (!include) | |
| 3630 { | |
| 3631 incl(&start_pos); | |
| 3632 sol = (curwin->w_cursor.col == 0); | |
| 3633 decl(&curwin->w_cursor); | |
| 3634 if (what == '{') | |
| 3635 while (inindent(1)) | |
| 3636 { | |
| 3637 sol = TRUE; | |
| 3638 if (decl(&curwin->w_cursor) != 0) | |
| 3639 break; | |
| 3640 } | |
| 3641 #ifdef FEAT_VISUAL | |
| 3642 /* | |
| 3643 * In Visual mode, when the resulting area is not bigger than what we | |
| 3644 * started with, extend it to the next block, and then exclude again. | |
| 3645 */ | |
| 3646 if (!lt(start_pos, old_start) && !lt(old_end, curwin->w_cursor) | |
| 3647 && VIsual_active) | |
| 3648 { | |
| 3649 curwin->w_cursor = old_start; | |
| 3650 decl(&curwin->w_cursor); | |
| 3651 if ((pos = findmatch(NULL, what)) == NULL) | |
| 3652 { | |
| 3653 curwin->w_cursor = old_pos; | |
| 3654 return FAIL; | |
| 3655 } | |
| 3656 start_pos = *pos; | |
| 3657 curwin->w_cursor = *pos; | |
| 3658 if ((end_pos = findmatch(NULL, other)) == NULL) | |
| 3659 { | |
| 3660 curwin->w_cursor = old_pos; | |
| 3661 return FAIL; | |
| 3662 } | |
| 3663 curwin->w_cursor = *end_pos; | |
| 3664 } | |
| 3665 else | |
| 3666 #endif | |
| 3667 break; | |
| 3668 } | |
| 3669 | |
| 3670 #ifdef FEAT_VISUAL | |
| 3671 if (VIsual_active) | |
| 3672 { | |
| 3673 if (*p_sel == 'e') | |
| 3674 ++curwin->w_cursor.col; | |
| 557 | 3675 if (sol && gchar_cursor() != NUL) |
| 7 | 3676 inc(&curwin->w_cursor); /* include the line break */ |
| 3677 VIsual = start_pos; | |
| 3678 VIsual_mode = 'v'; | |
| 3679 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 3680 showmode(); | |
| 3681 } | |
| 3682 else | |
| 3683 #endif | |
| 3684 { | |
| 3685 oap->start = start_pos; | |
| 3686 oap->motion_type = MCHAR; | |
| 1290 | 3687 oap->inclusive = FALSE; |
| 7 | 3688 if (sol) |
| 3689 incl(&curwin->w_cursor); | |
| 1527 | 3690 else if (ltoreq(start_pos, curwin->w_cursor)) |
| 1290 | 3691 /* Include the character under the cursor. */ |
| 3692 oap->inclusive = TRUE; | |
| 7 | 3693 else |
| 1290 | 3694 /* End is before the start (no text in between <>, [], etc.): don't |
| 3695 * operate on any text. */ | |
| 3696 curwin->w_cursor = start_pos; | |
| 7 | 3697 } |
| 3698 | |
| 3699 return OK; | |
| 3700 } | |
| 3701 | |
| 423 | 3702 static int in_html_tag __ARGS((int)); |
| 3703 | |
| 3704 /* | |
| 3705 * Return TRUE if the cursor is on a "<aaa>" tag. Ignore "<aaa/>". | |
| 3706 * When "end_tag" is TRUE return TRUE if the cursor is on "</aaa>". | |
| 3707 */ | |
| 3708 static int | |
| 3709 in_html_tag(end_tag) | |
| 3710 int end_tag; | |
| 3711 { | |
| 3712 char_u *line = ml_get_curline(); | |
| 3713 char_u *p; | |
| 3714 int c; | |
| 3715 int lc = NUL; | |
| 3716 pos_T pos; | |
| 3717 | |
| 3718 #ifdef FEAT_MBYTE | |
| 3719 if (enc_dbcs) | |
| 3720 { | |
| 3721 char_u *lp = NULL; | |
| 3722 | |
| 3723 /* We search forward until the cursor, because searching backwards is | |
| 3724 * very slow for DBCS encodings. */ | |
| 3725 for (p = line; p < line + curwin->w_cursor.col; mb_ptr_adv(p)) | |
| 3726 if (*p == '>' || *p == '<') | |
| 3727 { | |
| 3728 lc = *p; | |
| 3729 lp = p; | |
| 3730 } | |
| 3731 if (*p != '<') /* check for '<' under cursor */ | |
| 3732 { | |
| 3733 if (lc != '<') | |
| 3734 return FALSE; | |
| 3735 p = lp; | |
| 3736 } | |
| 3737 } | |
| 3738 else | |
| 3739 #endif | |
| 3740 { | |
| 3741 for (p = line + curwin->w_cursor.col; p > line; ) | |
| 3742 { | |
| 3743 if (*p == '<') /* find '<' under/before cursor */ | |
| 3744 break; | |
| 3745 mb_ptr_back(line, p); | |
| 3746 if (*p == '>') /* find '>' before cursor */ | |
| 3747 break; | |
| 3748 } | |
| 3749 if (*p != '<') | |
| 3750 return FALSE; | |
| 3751 } | |
| 3752 | |
| 3753 pos.lnum = curwin->w_cursor.lnum; | |
| 835 | 3754 pos.col = (colnr_T)(p - line); |
| 423 | 3755 |
| 3756 mb_ptr_adv(p); | |
| 3757 if (end_tag) | |
| 3758 /* check that there is a '/' after the '<' */ | |
| 3759 return *p == '/'; | |
| 3760 | |
| 3761 /* check that there is no '/' after the '<' */ | |
| 3762 if (*p == '/') | |
| 3763 return FALSE; | |
| 3764 | |
| 3765 /* check that the matching '>' is not preceded by '/' */ | |
| 3766 for (;;) | |
| 3767 { | |
| 3768 if (inc(&pos) < 0) | |
| 3769 return FALSE; | |
| 3770 c = *ml_get_pos(&pos); | |
| 3771 if (c == '>') | |
| 3772 break; | |
| 3773 lc = c; | |
| 3774 } | |
| 3775 return lc != '/'; | |
| 3776 } | |
| 3777 | |
| 3778 /* | |
| 3779 * Find tag block under the cursor, cursor at end. | |
| 3780 */ | |
| 3781 int | |
| 3782 current_tagblock(oap, count_arg, include) | |
| 3783 oparg_T *oap; | |
| 3784 long count_arg; | |
| 3785 int include; /* TRUE == include white space */ | |
| 3786 { | |
| 3787 long count = count_arg; | |
| 3788 long n; | |
| 3789 pos_T old_pos; | |
| 3790 pos_T start_pos; | |
| 3791 pos_T end_pos; | |
| 3792 pos_T old_start, old_end; | |
| 3793 char_u *spat, *epat; | |
| 3794 char_u *p; | |
| 3795 char_u *cp; | |
| 3796 int len; | |
| 3797 int r; | |
| 3798 int do_include = include; | |
| 3799 int save_p_ws = p_ws; | |
| 3800 int retval = FAIL; | |
| 3801 | |
| 3802 p_ws = FALSE; | |
| 3803 | |
| 3804 old_pos = curwin->w_cursor; | |
| 3805 old_end = curwin->w_cursor; /* remember where we started */ | |
| 3806 old_start = old_end; | |
| 1527 | 3807 #ifdef FEAT_VISUAL |
| 3808 if (!VIsual_active || *p_sel == 'e') | |
| 3809 #endif | |
| 3810 decl(&old_end); /* old_end is inclusive */ | |
| 423 | 3811 |
| 3812 /* | |
| 435 | 3813 * If we start on "<aaa>" select that block. |
| 423 | 3814 */ |
| 3815 #ifdef FEAT_VISUAL | |
| 3816 if (!VIsual_active || equalpos(VIsual, curwin->w_cursor)) | |
| 3817 #endif | |
| 3818 { | |
| 3819 setpcmark(); | |
| 3820 | |
| 3821 /* ignore indent */ | |
| 3822 while (inindent(1)) | |
| 3823 if (inc_cursor() != 0) | |
| 3824 break; | |
| 3825 | |
| 3826 if (in_html_tag(FALSE)) | |
| 3827 { | |
| 1290 | 3828 /* cursor on start tag, move to its '>' */ |
| 423 | 3829 while (*ml_get_cursor() != '>') |
| 3830 if (inc_cursor() < 0) | |
| 3831 break; | |
| 3832 } | |
| 3833 else if (in_html_tag(TRUE)) | |
| 3834 { | |
| 3835 /* cursor on end tag, move to just before it */ | |
| 3836 while (*ml_get_cursor() != '<') | |
| 3837 if (dec_cursor() < 0) | |
| 3838 break; | |
| 3839 dec_cursor(); | |
| 3840 old_end = curwin->w_cursor; | |
| 3841 } | |
| 3842 } | |
| 3843 #ifdef FEAT_VISUAL | |
| 3844 else if (lt(VIsual, curwin->w_cursor)) | |
| 3845 { | |
| 3846 old_start = VIsual; | |
| 3847 curwin->w_cursor = VIsual; /* cursor at low end of Visual */ | |
| 3848 } | |
| 3849 else | |
| 3850 old_end = VIsual; | |
| 3851 #endif | |
| 3852 | |
| 3853 again: | |
| 3854 /* | |
| 3855 * Search backwards for unclosed "<aaa>". | |
| 3856 * Put this position in start_pos. | |
| 3857 */ | |
| 3858 for (n = 0; n < count; ++n) | |
| 3859 { | |
| 435 | 3860 if (do_searchpair((char_u *)"<[^ \t>/!]\\+\\%(\\_s\\_[^>]\\{-}[^/]>\\|$\\|\\_s\\=>\\)", |
| 423 | 3861 (char_u *)"", |
| 692 | 3862 (char_u *)"</[^>]*>", BACKWARD, (char_u *)"", 0, |
| 1496 | 3863 NULL, (linenr_T)0, 0L) <= 0) |
| 423 | 3864 { |
| 3865 curwin->w_cursor = old_pos; | |
| 3866 goto theend; | |
| 3867 } | |
| 3868 } | |
| 3869 start_pos = curwin->w_cursor; | |
| 3870 | |
| 3871 /* | |
| 3872 * Search for matching "</aaa>". First isolate the "aaa". | |
| 3873 */ | |
| 3874 inc_cursor(); | |
| 3875 p = ml_get_cursor(); | |
| 3876 for (cp = p; *cp != NUL && *cp != '>' && !vim_iswhite(*cp); mb_ptr_adv(cp)) | |
| 3877 ; | |
| 835 | 3878 len = (int)(cp - p); |
| 423 | 3879 if (len == 0) |
| 3880 { | |
| 3881 curwin->w_cursor = old_pos; | |
| 3882 goto theend; | |
| 3883 } | |
| 3306 | 3884 spat = alloc(len + 31); |
| 423 | 3885 epat = alloc(len + 9); |
| 3886 if (spat == NULL || epat == NULL) | |
| 3887 { | |
| 3888 vim_free(spat); | |
| 3889 vim_free(epat); | |
| 3890 curwin->w_cursor = old_pos; | |
| 3891 goto theend; | |
| 3892 } | |
| 3306 | 3893 sprintf((char *)spat, "<%.*s\\>\\%%(\\s\\_[^>]\\{-}[^/]>\\|>\\)\\c", len, p); |
| 423 | 3894 sprintf((char *)epat, "</%.*s>\\c", len, p); |
| 3895 | |
| 692 | 3896 r = do_searchpair(spat, (char_u *)"", epat, FORWARD, (char_u *)"", |
| 1496 | 3897 0, NULL, (linenr_T)0, 0L); |
| 423 | 3898 |
| 3899 vim_free(spat); | |
| 3900 vim_free(epat); | |
| 3901 | |
| 3902 if (r < 1 || lt(curwin->w_cursor, old_end)) | |
| 3903 { | |
| 3904 /* Can't find other end or it's before the previous end. Could be a | |
| 3905 * HTML tag that doesn't have a matching end. Search backwards for | |
| 3906 * another starting tag. */ | |
| 3907 count = 1; | |
| 3908 curwin->w_cursor = start_pos; | |
| 3909 goto again; | |
| 3910 } | |
| 3911 | |
| 3912 if (do_include || r < 1) | |
| 3913 { | |
| 3914 /* Include up to the '>'. */ | |
| 3915 while (*ml_get_cursor() != '>') | |
| 3916 if (inc_cursor() < 0) | |
| 3917 break; | |
| 3918 } | |
| 3919 else | |
| 3920 { | |
| 3921 /* Exclude the '<' of the end tag. */ | |
| 3922 if (*ml_get_cursor() == '<') | |
| 3923 dec_cursor(); | |
| 3924 } | |
| 3925 end_pos = curwin->w_cursor; | |
| 3926 | |
| 3927 if (!do_include) | |
| 3928 { | |
| 3929 /* Exclude the start tag. */ | |
| 3930 curwin->w_cursor = start_pos; | |
| 3931 while (inc_cursor() >= 0) | |
| 1290 | 3932 if (*ml_get_cursor() == '>') |
| 423 | 3933 { |
| 3934 inc_cursor(); | |
| 3935 start_pos = curwin->w_cursor; | |
| 3936 break; | |
| 3937 } | |
| 3938 curwin->w_cursor = end_pos; | |
| 3939 | |
| 435 | 3940 /* If we now have the same text as before reset "do_include" and try |
| 423 | 3941 * again. */ |
| 435 | 3942 if (equalpos(start_pos, old_start) && equalpos(end_pos, old_end)) |
| 423 | 3943 { |
| 3944 do_include = TRUE; | |
| 3945 curwin->w_cursor = old_start; | |
| 3946 count = count_arg; | |
| 3947 goto again; | |
| 3948 } | |
| 3949 } | |
| 3950 | |
| 3951 #ifdef FEAT_VISUAL | |
| 3952 if (VIsual_active) | |
| 3953 { | |
| 1290 | 3954 /* If the end is before the start there is no text between tags, select |
| 3955 * the char under the cursor. */ | |
| 3956 if (lt(end_pos, start_pos)) | |
| 3957 curwin->w_cursor = start_pos; | |
| 3958 else if (*p_sel == 'e') | |
| 423 | 3959 ++curwin->w_cursor.col; |
| 3960 VIsual = start_pos; | |
| 3961 VIsual_mode = 'v'; | |
| 3962 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 3963 showmode(); | |
| 3964 } | |
| 3965 else | |
| 3966 #endif | |
| 3967 { | |
| 3968 oap->start = start_pos; | |
| 3969 oap->motion_type = MCHAR; | |
| 1290 | 3970 if (lt(end_pos, start_pos)) |
| 3971 { | |
| 3972 /* End is before the start: there is no text between tags; operate | |
| 3973 * on an empty area. */ | |
| 3974 curwin->w_cursor = start_pos; | |
| 3975 oap->inclusive = FALSE; | |
| 3976 } | |
| 3977 else | |
| 3978 oap->inclusive = TRUE; | |
| 423 | 3979 } |
| 3980 retval = OK; | |
| 3981 | |
| 3982 theend: | |
| 3983 p_ws = save_p_ws; | |
| 3984 return retval; | |
| 3985 } | |
| 3986 | |
| 7 | 3987 int |
| 3988 current_par(oap, count, include, type) | |
| 3989 oparg_T *oap; | |
| 3990 long count; | |
| 3991 int include; /* TRUE == include white space */ | |
| 3992 int type; /* 'p' for paragraph, 'S' for section */ | |
| 3993 { | |
| 3994 linenr_T start_lnum; | |
| 3995 linenr_T end_lnum; | |
| 3996 int white_in_front; | |
| 3997 int dir; | |
| 3998 int start_is_white; | |
| 3999 int prev_start_is_white; | |
| 4000 int retval = OK; | |
| 4001 int do_white = FALSE; | |
| 4002 int t; | |
| 4003 int i; | |
| 4004 | |
| 4005 if (type == 'S') /* not implemented yet */ | |
| 4006 return FAIL; | |
| 4007 | |
| 4008 start_lnum = curwin->w_cursor.lnum; | |
| 4009 | |
| 4010 #ifdef FEAT_VISUAL | |
| 4011 /* | |
| 4012 * When visual area is more than one line: extend it. | |
| 4013 */ | |
| 4014 if (VIsual_active && start_lnum != VIsual.lnum) | |
| 4015 { | |
| 4016 extend: | |
| 4017 if (start_lnum < VIsual.lnum) | |
| 4018 dir = BACKWARD; | |
| 4019 else | |
| 4020 dir = FORWARD; | |
| 4021 for (i = count; --i >= 0; ) | |
| 4022 { | |
| 4023 if (start_lnum == | |
| 4024 (dir == BACKWARD ? 1 : curbuf->b_ml.ml_line_count)) | |
| 4025 { | |
| 4026 retval = FAIL; | |
| 4027 break; | |
| 4028 } | |
| 4029 | |
| 4030 prev_start_is_white = -1; | |
| 4031 for (t = 0; t < 2; ++t) | |
| 4032 { | |
| 4033 start_lnum += dir; | |
| 4034 start_is_white = linewhite(start_lnum); | |
| 4035 if (prev_start_is_white == start_is_white) | |
| 4036 { | |
| 4037 start_lnum -= dir; | |
| 4038 break; | |
| 4039 } | |
| 4040 for (;;) | |
| 4041 { | |
| 4042 if (start_lnum == (dir == BACKWARD | |
| 4043 ? 1 : curbuf->b_ml.ml_line_count)) | |
| 4044 break; | |
| 4045 if (start_is_white != linewhite(start_lnum + dir) | |
| 4046 || (!start_is_white | |
| 4047 && startPS(start_lnum + (dir > 0 | |
| 4048 ? 1 : 0), 0, 0))) | |
| 4049 break; | |
| 4050 start_lnum += dir; | |
| 4051 } | |
| 4052 if (!include) | |
| 4053 break; | |
| 4054 if (start_lnum == (dir == BACKWARD | |
| 4055 ? 1 : curbuf->b_ml.ml_line_count)) | |
| 4056 break; | |
| 4057 prev_start_is_white = start_is_white; | |
| 4058 } | |
| 4059 } | |
| 4060 curwin->w_cursor.lnum = start_lnum; | |
| 4061 curwin->w_cursor.col = 0; | |
| 4062 return retval; | |
| 4063 } | |
| 4064 #endif | |
| 4065 | |
| 4066 /* | |
| 4067 * First move back to the start_lnum of the paragraph or white lines | |
| 4068 */ | |
| 4069 white_in_front = linewhite(start_lnum); | |
| 4070 while (start_lnum > 1) | |
| 4071 { | |
| 4072 if (white_in_front) /* stop at first white line */ | |
| 4073 { | |
| 4074 if (!linewhite(start_lnum - 1)) | |
| 4075 break; | |
| 4076 } | |
| 4077 else /* stop at first non-white line of start of paragraph */ | |
| 4078 { | |
| 4079 if (linewhite(start_lnum - 1) || startPS(start_lnum, 0, 0)) | |
| 4080 break; | |
| 4081 } | |
| 4082 --start_lnum; | |
| 4083 } | |
| 4084 | |
| 4085 /* | |
| 4086 * Move past the end of any white lines. | |
| 4087 */ | |
| 4088 end_lnum = start_lnum; | |
| 692 | 4089 while (end_lnum <= curbuf->b_ml.ml_line_count && linewhite(end_lnum)) |
| 4090 ++end_lnum; | |
| 7 | 4091 |
| 4092 --end_lnum; | |
| 4093 i = count; | |
| 4094 if (!include && white_in_front) | |
| 4095 --i; | |
| 4096 while (i--) | |
| 4097 { | |
| 4098 if (end_lnum == curbuf->b_ml.ml_line_count) | |
| 4099 return FAIL; | |
| 4100 | |
| 4101 if (!include) | |
| 4102 do_white = linewhite(end_lnum + 1); | |
| 4103 | |
| 4104 if (include || !do_white) | |
| 4105 { | |
| 4106 ++end_lnum; | |
| 4107 /* | |
| 4108 * skip to end of paragraph | |
| 4109 */ | |
| 4110 while (end_lnum < curbuf->b_ml.ml_line_count | |
| 4111 && !linewhite(end_lnum + 1) | |
| 4112 && !startPS(end_lnum + 1, 0, 0)) | |
| 4113 ++end_lnum; | |
| 4114 } | |
| 4115 | |
| 4116 if (i == 0 && white_in_front && include) | |
| 4117 break; | |
| 4118 | |
| 4119 /* | |
| 4120 * skip to end of white lines after paragraph | |
| 4121 */ | |
| 4122 if (include || do_white) | |
| 4123 while (end_lnum < curbuf->b_ml.ml_line_count | |
| 4124 && linewhite(end_lnum + 1)) | |
| 4125 ++end_lnum; | |
| 4126 } | |
| 4127 | |
| 4128 /* | |
| 4129 * If there are no empty lines at the end, try to find some empty lines at | |
| 4130 * the start (unless that has been done already). | |
| 4131 */ | |
| 4132 if (!white_in_front && !linewhite(end_lnum) && include) | |
| 4133 while (start_lnum > 1 && linewhite(start_lnum - 1)) | |
| 4134 --start_lnum; | |
| 4135 | |
| 4136 #ifdef FEAT_VISUAL | |
| 4137 if (VIsual_active) | |
| 4138 { | |
| 4139 /* Problem: when doing "Vipipip" nothing happens in a single white | |
| 4140 * line, we get stuck there. Trap this here. */ | |
| 4141 if (VIsual_mode == 'V' && start_lnum == curwin->w_cursor.lnum) | |
| 4142 goto extend; | |
| 4143 VIsual.lnum = start_lnum; | |
| 4144 VIsual_mode = 'V'; | |
| 4145 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 4146 showmode(); | |
| 4147 } | |
| 4148 else | |
| 4149 #endif | |
| 4150 { | |
| 4151 oap->start.lnum = start_lnum; | |
| 4152 oap->start.col = 0; | |
| 4153 oap->motion_type = MLINE; | |
| 4154 } | |
| 4155 curwin->w_cursor.lnum = end_lnum; | |
| 4156 curwin->w_cursor.col = 0; | |
| 4157 | |
| 4158 return OK; | |
| 4159 } | |
| 12 | 4160 |
| 4161 static int find_next_quote __ARGS((char_u *top_ptr, int col, int quotechar, char_u *escape)); | |
| 4162 static int find_prev_quote __ARGS((char_u *line, int col_start, int quotechar, char_u *escape)); | |
| 4163 | |
| 4164 /* | |
| 4165 * Search quote char from string line[col]. | |
| 4166 * Quote character escaped by one of the characters in "escape" is not counted | |
| 4167 * as a quote. | |
| 4168 * Returns column number of "quotechar" or -1 when not found. | |
| 4169 */ | |
| 4170 static int | |
| 4171 find_next_quote(line, col, quotechar, escape) | |
| 4172 char_u *line; | |
| 4173 int col; | |
| 4174 int quotechar; | |
| 4175 char_u *escape; /* escape characters, can be NULL */ | |
| 4176 { | |
| 4177 int c; | |
| 4178 | |
| 408 | 4179 for (;;) |
| 12 | 4180 { |
| 4181 c = line[col]; | |
| 4182 if (c == NUL) | |
| 4183 return -1; | |
| 4184 else if (escape != NULL && vim_strchr(escape, c)) | |
| 4185 ++col; | |
| 4186 else if (c == quotechar) | |
| 4187 break; | |
| 4188 #ifdef FEAT_MBYTE | |
| 4189 if (has_mbyte) | |
| 474 | 4190 col += (*mb_ptr2len)(line + col); |
| 12 | 4191 else |
| 7 | 4192 #endif |
| 12 | 4193 ++col; |
| 4194 } | |
| 4195 return col; | |
| 4196 } | |
| 4197 | |
| 4198 /* | |
| 4199 * Search backwards in "line" from column "col_start" to find "quotechar". | |
| 4200 * Quote character escaped by one of the characters in "escape" is not counted | |
| 4201 * as a quote. | |
| 4202 * Return the found column or zero. | |
| 4203 */ | |
| 4204 static int | |
| 4205 find_prev_quote(line, col_start, quotechar, escape) | |
| 4206 char_u *line; | |
| 4207 int col_start; | |
| 4208 int quotechar; | |
| 4209 char_u *escape; /* escape characters, can be NULL */ | |
| 4210 { | |
| 4211 int n; | |
| 4212 | |
| 4213 while (col_start > 0) | |
| 4214 { | |
| 4215 --col_start; | |
| 4216 #ifdef FEAT_MBYTE | |
| 4217 col_start -= (*mb_head_off)(line, line + col_start); | |
| 4218 #endif | |
| 4219 n = 0; | |
| 4220 if (escape != NULL) | |
| 4221 while (col_start - n > 0 && vim_strchr(escape, | |
| 4222 line[col_start - n - 1]) != NULL) | |
| 4223 ++n; | |
| 4224 if (n & 1) | |
| 4225 col_start -= n; /* uneven number of escape chars, skip it */ | |
| 4226 else if (line[col_start] == quotechar) | |
| 4227 break; | |
| 4228 } | |
| 4229 return col_start; | |
| 4230 } | |
| 4231 | |
| 4232 /* | |
| 4233 * Find quote under the cursor, cursor at end. | |
| 4234 * Returns TRUE if found, else FALSE. | |
| 4235 */ | |
| 4236 int | |
| 4237 current_quote(oap, count, include, quotechar) | |
| 4238 oparg_T *oap; | |
| 527 | 4239 long count; |
| 12 | 4240 int include; /* TRUE == include quote char */ |
| 4241 int quotechar; /* Quote character */ | |
| 4242 { | |
| 4243 char_u *line = ml_get_curline(); | |
| 4244 int col_end; | |
| 4245 int col_start = curwin->w_cursor.col; | |
| 4246 int inclusive = FALSE; | |
| 4247 #ifdef FEAT_VISUAL | |
| 4248 int vis_empty = TRUE; /* Visual selection <= 1 char */ | |
| 4249 int vis_bef_curs = FALSE; /* Visual starts before cursor */ | |
| 527 | 4250 int inside_quotes = FALSE; /* Looks like "i'" done before */ |
| 4251 int selected_quote = FALSE; /* Has quote inside selection */ | |
| 4252 int i; | |
| 12 | 4253 |
| 4254 /* Correct cursor when 'selection' is exclusive */ | |
| 4255 if (VIsual_active) | |
| 4256 { | |
| 527 | 4257 vis_bef_curs = lt(VIsual, curwin->w_cursor); |
| 12 | 4258 if (*p_sel == 'e' && vis_bef_curs) |
| 4259 dec_cursor(); | |
| 4260 vis_empty = equalpos(VIsual, curwin->w_cursor); | |
| 4261 } | |
| 527 | 4262 |
| 4263 if (!vis_empty) | |
| 4264 { | |
| 4265 /* Check if the existing selection exactly spans the text inside | |
| 4266 * quotes. */ | |
| 4267 if (vis_bef_curs) | |
| 4268 { | |
| 4269 inside_quotes = VIsual.col > 0 | |
| 4270 && line[VIsual.col - 1] == quotechar | |
| 4271 && line[curwin->w_cursor.col] != NUL | |
| 4272 && line[curwin->w_cursor.col + 1] == quotechar; | |
| 4273 i = VIsual.col; | |
| 4274 col_end = curwin->w_cursor.col; | |
| 4275 } | |
| 4276 else | |
| 4277 { | |
| 4278 inside_quotes = curwin->w_cursor.col > 0 | |
| 4279 && line[curwin->w_cursor.col - 1] == quotechar | |
| 4280 && line[VIsual.col] != NUL | |
| 4281 && line[VIsual.col + 1] == quotechar; | |
| 4282 i = curwin->w_cursor.col; | |
| 4283 col_end = VIsual.col; | |
| 4284 } | |
| 4285 | |
| 4286 /* Find out if we have a quote in the selection. */ | |
| 4287 while (i <= col_end) | |
| 4288 if (line[i++] == quotechar) | |
| 4289 { | |
| 4290 selected_quote = TRUE; | |
| 4291 break; | |
| 4292 } | |
| 4293 } | |
| 4294 | |
| 12 | 4295 if (!vis_empty && line[col_start] == quotechar) |
| 4296 { | |
| 4297 /* Already selecting something and on a quote character. Find the | |
| 4298 * next quoted string. */ | |
| 4299 if (vis_bef_curs) | |
| 4300 { | |
| 4301 /* Assume we are on a closing quote: move to after the next | |
| 4302 * opening quote. */ | |
| 4303 col_start = find_next_quote(line, col_start + 1, quotechar, NULL); | |
| 4304 if (col_start < 0) | |
| 4305 return FALSE; | |
| 4306 col_end = find_next_quote(line, col_start + 1, quotechar, | |
| 4307 curbuf->b_p_qe); | |
| 4308 if (col_end < 0) | |
| 4309 { | |
| 4310 /* We were on a starting quote perhaps? */ | |
| 4311 col_end = col_start; | |
| 4312 col_start = curwin->w_cursor.col; | |
| 4313 } | |
| 4314 } | |
| 4315 else | |
| 4316 { | |
| 4317 col_end = find_prev_quote(line, col_start, quotechar, NULL); | |
| 4318 if (line[col_end] != quotechar) | |
| 4319 return FALSE; | |
| 4320 col_start = find_prev_quote(line, col_end, quotechar, | |
| 4321 curbuf->b_p_qe); | |
| 4322 if (line[col_start] != quotechar) | |
| 4323 { | |
| 4324 /* We were on an ending quote perhaps? */ | |
| 4325 col_start = col_end; | |
| 4326 col_end = curwin->w_cursor.col; | |
| 4327 } | |
| 4328 } | |
| 4329 } | |
| 4330 else | |
| 4331 #endif | |
| 4332 | |
| 4333 if (line[col_start] == quotechar | |
| 4334 #ifdef FEAT_VISUAL | |
| 4335 || !vis_empty | |
| 4336 #endif | |
| 4337 ) | |
| 4338 { | |
| 4339 int first_col = col_start; | |
| 4340 | |
| 4341 #ifdef FEAT_VISUAL | |
| 4342 if (!vis_empty) | |
| 4343 { | |
| 4344 if (vis_bef_curs) | |
| 4345 first_col = find_next_quote(line, col_start, quotechar, NULL); | |
| 4346 else | |
| 4347 first_col = find_prev_quote(line, col_start, quotechar, NULL); | |
| 4348 } | |
| 4349 #endif | |
| 4350 /* The cursor is on a quote, we don't know if it's the opening or | |
| 4351 * closing quote. Search from the start of the line to find out. | |
| 4352 * Also do this when there is a Visual area, a' may leave the cursor | |
| 4353 * in between two strings. */ | |
| 4354 col_start = 0; | |
| 408 | 4355 for (;;) |
| 12 | 4356 { |
| 4357 /* Find open quote character. */ | |
| 4358 col_start = find_next_quote(line, col_start, quotechar, NULL); | |
| 4359 if (col_start < 0 || col_start > first_col) | |
| 4360 return FALSE; | |
| 4361 /* Find close quote character. */ | |
| 4362 col_end = find_next_quote(line, col_start + 1, quotechar, | |
| 4363 curbuf->b_p_qe); | |
| 4364 if (col_end < 0) | |
| 4365 return FALSE; | |
| 4366 /* If is cursor between start and end quote character, it is | |
| 4367 * target text object. */ | |
| 4368 if (col_start <= first_col && first_col <= col_end) | |
| 4369 break; | |
| 4370 col_start = col_end + 1; | |
| 4371 } | |
| 4372 } | |
| 4373 else | |
| 4374 { | |
| 4375 /* Search backward for a starting quote. */ | |
| 4376 col_start = find_prev_quote(line, col_start, quotechar, curbuf->b_p_qe); | |
| 4377 if (line[col_start] != quotechar) | |
| 4378 { | |
| 4379 /* No quote before the cursor, look after the cursor. */ | |
| 4380 col_start = find_next_quote(line, col_start, quotechar, NULL); | |
| 4381 if (col_start < 0) | |
| 4382 return FALSE; | |
| 4383 } | |
| 4384 | |
| 4385 /* Find close quote character. */ | |
| 4386 col_end = find_next_quote(line, col_start + 1, quotechar, | |
| 4387 curbuf->b_p_qe); | |
| 4388 if (col_end < 0) | |
| 4389 return FALSE; | |
| 4390 } | |
| 4391 | |
| 4392 /* When "include" is TRUE, include spaces after closing quote or before | |
| 4393 * the starting quote. */ | |
| 4394 if (include) | |
| 4395 { | |
| 4396 if (vim_iswhite(line[col_end + 1])) | |
| 4397 while (vim_iswhite(line[col_end + 1])) | |
| 4398 ++col_end; | |
| 4399 else | |
| 4400 while (col_start > 0 && vim_iswhite(line[col_start - 1])) | |
| 4401 --col_start; | |
| 4402 } | |
| 4403 | |
| 527 | 4404 /* Set start position. After vi" another i" must include the ". |
| 4405 * For v2i" include the quotes. */ | |
| 4406 if (!include && count < 2 | |
| 4407 #ifdef FEAT_VISUAL | |
| 4408 && (vis_empty || !inside_quotes) | |
| 4409 #endif | |
| 4410 ) | |
| 12 | 4411 ++col_start; |
| 4412 curwin->w_cursor.col = col_start; | |
| 4413 #ifdef FEAT_VISUAL | |
| 4414 if (VIsual_active) | |
| 4415 { | |
| 527 | 4416 /* Set the start of the Visual area when the Visual area was empty, we |
| 4417 * were just inside quotes or the Visual area didn't start at a quote | |
| 4418 * and didn't include a quote. | |
| 4419 */ | |
| 4420 if (vis_empty | |
| 4421 || (vis_bef_curs | |
| 4422 && !selected_quote | |
| 4423 && (inside_quotes | |
| 4424 || (line[VIsual.col] != quotechar | |
| 4425 && (VIsual.col == 0 | |
| 4426 || line[VIsual.col - 1] != quotechar))))) | |
| 12 | 4427 { |
| 4428 VIsual = curwin->w_cursor; | |
| 4429 redraw_curbuf_later(INVERTED); | |
| 4430 } | |
| 4431 } | |
| 4432 else | |
| 4433 #endif | |
| 4434 { | |
| 4435 oap->start = curwin->w_cursor; | |
| 4436 oap->motion_type = MCHAR; | |
| 4437 } | |
| 4438 | |
| 4439 /* Set end position. */ | |
| 4440 curwin->w_cursor.col = col_end; | |
| 527 | 4441 if ((include || count > 1 |
| 4442 #ifdef FEAT_VISUAL | |
| 4443 /* After vi" another i" must include the ". */ | |
| 4444 || (!vis_empty && inside_quotes) | |
| 4445 #endif | |
| 4446 ) && inc_cursor() == 2) | |
| 12 | 4447 inclusive = TRUE; |
| 4448 #ifdef FEAT_VISUAL | |
| 4449 if (VIsual_active) | |
| 4450 { | |
| 4451 if (vis_empty || vis_bef_curs) | |
| 4452 { | |
| 4453 /* decrement cursor when 'selection' is not exclusive */ | |
| 4454 if (*p_sel != 'e') | |
| 4455 dec_cursor(); | |
| 4456 } | |
| 4457 else | |
| 4458 { | |
| 527 | 4459 /* Cursor is at start of Visual area. Set the end of the Visual |
| 4460 * area when it was just inside quotes or it didn't end at a | |
| 4461 * quote. */ | |
| 4462 if (inside_quotes | |
| 4463 || (!selected_quote | |
| 4464 && line[VIsual.col] != quotechar | |
| 4465 && (line[VIsual.col] == NUL | |
| 4466 || line[VIsual.col + 1] != quotechar))) | |
| 4467 { | |
| 4468 dec_cursor(); | |
| 4469 VIsual = curwin->w_cursor; | |
| 4470 } | |
| 12 | 4471 curwin->w_cursor.col = col_start; |
| 4472 } | |
| 4473 if (VIsual_mode == 'V') | |
| 4474 { | |
| 4475 VIsual_mode = 'v'; | |
| 4476 redraw_cmdline = TRUE; /* show mode later */ | |
| 4477 } | |
| 4478 } | |
| 4479 else | |
| 4480 #endif | |
| 4481 { | |
| 4482 /* Set inclusive and other oap's flags. */ | |
| 4483 oap->inclusive = inclusive; | |
| 4484 } | |
| 4485 | |
| 4486 return OK; | |
| 4487 } | |
| 4488 | |
| 4489 #endif /* FEAT_TEXTOBJ */ | |
| 7 | 4490 |
| 3718 | 4491 #if defined(FEAT_VISUAL) || defined(PROTO) |
| 3755 | 4492 static int is_zerowidth __ARGS((char_u *pattern)); |
| 4493 | |
| 3718 | 4494 /* |
| 4495 * Find next search match under cursor, cursor at end. | |
| 4496 * Used while an operator is pending, and in Visual mode. | |
| 4497 * TODO: redo only works when used in operator pending mode | |
| 4498 */ | |
| 4499 int | |
| 4500 current_search(count, forward) | |
| 4501 long count; | |
| 4502 int forward; /* move forward or backwards */ | |
| 4503 { | |
| 4504 pos_T start_pos; /* position before the pattern */ | |
| 4505 pos_T orig_pos; /* position of the cursor at beginning */ | |
| 4506 pos_T pos; /* position after the pattern */ | |
| 4507 int i; | |
| 4508 int dir; | |
| 4509 int result; /* result of various function calls */ | |
| 4510 char_u old_p_ws = p_ws; | |
| 4511 int flags = 0; | |
| 4512 pos_T save_VIsual; | |
| 3732 | 4513 int zerowidth = FALSE; |
| 3718 | 4514 |
| 4515 /* wrapping should not occur */ | |
| 4516 p_ws = FALSE; | |
| 4517 | |
| 4518 /* Correct cursor when 'selection' is exclusive */ | |
| 4519 if (VIsual_active && *p_sel == 'e' && lt(VIsual, curwin->w_cursor)) | |
| 4520 dec_cursor(); | |
| 4521 | |
| 4522 if (VIsual_active) | |
| 4523 { | |
| 4524 orig_pos = curwin->w_cursor; | |
| 4525 save_VIsual = VIsual; | |
| 4526 | |
| 4527 pos = curwin->w_cursor; | |
| 4528 start_pos = VIsual; | |
| 4529 | |
| 4530 /* make sure, searching further will extend the match */ | |
| 4531 if (VIsual_active) | |
| 4532 { | |
| 4533 if (forward) | |
| 4534 incl(&pos); | |
| 4535 else | |
| 4536 decl(&pos); | |
| 4537 } | |
| 4538 } | |
| 4539 else | |
| 4540 orig_pos = pos = start_pos = curwin->w_cursor; | |
| 4541 | |
| 3755 | 4542 /* Is the pattern is zero-width? */ |
| 4543 zerowidth = is_zerowidth(spats[last_idx].pat); | |
| 4544 if (zerowidth == -1) | |
| 3732 | 4545 return FAIL; |
| 4546 | |
| 4547 /* | |
| 3718 | 4548 * The trick is to first search backwards and then search forward again, |
| 4549 * so that a match at the current cursor position will be correctly | |
| 4550 * captured. | |
| 4551 */ | |
| 4552 for (i = 0; i < 2; i++) | |
| 4553 { | |
| 4554 if (forward) | |
| 4555 dir = i; | |
| 4556 else | |
| 4557 dir = !i; | |
| 3732 | 4558 |
| 4559 flags = 0; | |
| 4560 if (!dir && !zerowidth) | |
| 4561 flags = SEARCH_END; | |
| 4562 | |
| 3718 | 4563 result = searchit(curwin, curbuf, &pos, (dir ? FORWARD : BACKWARD), |
| 4564 spats[last_idx].pat, (long) (i ? count : 1), | |
| 3732 | 4565 SEARCH_KEEP | flags, RE_SEARCH, 0, NULL); |
| 3718 | 4566 |
| 4567 /* First search may fail, but then start searching from the | |
| 4568 * beginning of the file (cursor might be on the search match) | |
| 4569 * except when Visual mode is active, so that extending the visual | |
| 4570 * selection works. */ | |
| 4571 if (!result && i) /* not found, abort */ | |
| 4572 { | |
| 4573 curwin->w_cursor = orig_pos; | |
| 4574 if (VIsual_active) | |
| 4575 VIsual = save_VIsual; | |
| 4576 p_ws = old_p_ws; | |
| 4577 return FAIL; | |
| 4578 } | |
| 3778 | 4579 else if (!i && !result) |
| 3718 | 4580 { |
| 4581 if (forward) /* try again from start of buffer */ | |
| 4582 { | |
| 4583 clearpos(&pos); | |
| 4584 } | |
| 4585 else /* try again from end of buffer */ | |
| 4586 { | |
| 4587 /* searching backwards, so set pos to last line and col */ | |
| 4588 pos.lnum = curwin->w_buffer->b_ml.ml_line_count; | |
| 3724 | 4589 pos.col = (colnr_T)STRLEN( |
| 4590 ml_get(curwin->w_buffer->b_ml.ml_line_count)); | |
| 3718 | 4591 } |
| 4592 } | |
| 4593 | |
| 4594 } | |
| 4595 | |
| 4596 start_pos = pos; | |
| 3732 | 4597 flags = forward ? SEARCH_END : 0; |
| 4598 | |
| 4599 /* move to match, except for zero-width matches, in which case, we are | |
| 4600 * already on the next match */ | |
| 4601 if (!zerowidth) | |
| 4602 result = searchit(curwin, curbuf, &pos, (forward ? FORWARD : BACKWARD), | |
| 3718 | 4603 spats[last_idx].pat, 0L, flags | SEARCH_KEEP, RE_SEARCH, 0, NULL); |
| 4604 | |
| 4605 if (!VIsual_active) | |
| 4606 VIsual = start_pos; | |
| 4607 | |
| 4608 p_ws = old_p_ws; | |
| 4609 curwin->w_cursor = pos; | |
| 4610 VIsual_active = TRUE; | |
| 4611 VIsual_mode = 'v'; | |
| 4612 | |
| 4613 if (VIsual_active) | |
| 4614 { | |
| 4615 redraw_curbuf_later(INVERTED); /* update the inversion */ | |
| 3831 | 4616 if (*p_sel == 'e') |
| 4617 { | |
| 4618 /* Correction for exclusive selection depends on the direction. */ | |
| 4619 if (forward && ltoreq(VIsual, curwin->w_cursor)) | |
| 4620 inc_cursor(); | |
| 4621 else if (!forward && ltoreq(curwin->w_cursor, VIsual)) | |
| 4622 inc(&VIsual); | |
| 4623 } | |
| 4624 | |
| 3718 | 4625 } |
| 4626 | |
| 4627 #ifdef FEAT_FOLDING | |
| 4628 if (fdo_flags & FDO_SEARCH && KeyTyped) | |
| 4629 foldOpenCursor(); | |
| 4630 #endif | |
| 4631 | |
| 4632 may_start_select('c'); | |
| 4633 #ifdef FEAT_MOUSE | |
| 4634 setmouse(); | |
| 4635 #endif | |
| 4636 #ifdef FEAT_CLIPBOARD | |
| 4637 /* Make sure the clipboard gets updated. Needed because start and | |
| 4638 * end are still the same, and the selection needs to be owned */ | |
| 4639 clip_star.vmode = NUL; | |
| 4640 #endif | |
| 4641 redraw_curbuf_later(INVERTED); | |
| 4642 showmode(); | |
| 4643 | |
| 4644 return OK; | |
| 4645 } | |
| 3755 | 4646 |
| 4647 /* | |
| 4648 * Check if the pattern is zero-width. | |
| 4649 * Returns TRUE, FALSE or -1 for failure. | |
| 4650 */ | |
| 4651 static int | |
| 4652 is_zerowidth(pattern) | |
| 4653 char_u *pattern; | |
| 4654 { | |
| 4655 regmmatch_T regmatch; | |
| 4656 int nmatched = 0; | |
| 4657 int result = -1; | |
| 3778 | 4658 pos_T pos; |
| 4659 int save_called_emsg = called_emsg; | |
| 3755 | 4660 |
| 4661 if (search_regcomp(pattern, RE_SEARCH, RE_SEARCH, | |
| 4662 SEARCH_KEEP, ®match) == FAIL) | |
| 4663 return -1; | |
| 4664 | |
| 4665 /* move to match */ | |
| 4666 clearpos(&pos); | |
| 4667 if (searchit(curwin, curbuf, &pos, FORWARD, spats[last_idx].pat, 1, | |
| 4668 SEARCH_KEEP, RE_SEARCH, 0, NULL) != FAIL) | |
| 4669 { | |
| 4670 /* Zero-width pattern should match somewhere, then we can check if | |
| 4671 * start and end are in the same position. */ | |
| 3778 | 4672 called_emsg = FALSE; |
| 3755 | 4673 nmatched = vim_regexec_multi(®match, curwin, curbuf, |
| 4674 pos.lnum, (colnr_T)0, NULL); | |
| 4675 | |
| 4676 if (!called_emsg) | |
| 4677 result = (nmatched != 0 | |
| 3778 | 4678 && regmatch.startpos[0].lnum == regmatch.endpos[0].lnum |
| 4679 && regmatch.startpos[0].col == regmatch.endpos[0].col); | |
| 3755 | 4680 } |
| 4681 | |
| 3778 | 4682 called_emsg |= save_called_emsg; |
| 3755 | 4683 vim_free(regmatch.regprog); |
| 4684 return result; | |
| 4685 } | |
| 3718 | 4686 #endif /* FEAT_VISUAL */ |
| 4687 | |
| 7 | 4688 #if defined(FEAT_LISP) || defined(FEAT_CINDENT) || defined(FEAT_TEXTOBJ) \ |
| 4689 || defined(PROTO) | |
| 4690 /* | |
| 4691 * return TRUE if line 'lnum' is empty or has white chars only. | |
| 4692 */ | |
| 4693 int | |
| 4694 linewhite(lnum) | |
| 4695 linenr_T lnum; | |
| 4696 { | |
| 4697 char_u *p; | |
| 4698 | |
| 4699 p = skipwhite(ml_get(lnum)); | |
| 4700 return (*p == NUL); | |
| 4701 } | |
| 4702 #endif | |
| 4703 | |
| 4704 #if defined(FEAT_FIND_ID) || defined(PROTO) | |
| 4705 /* | |
| 4706 * Find identifiers or defines in included files. | |
| 2719 | 4707 * If p_ic && (compl_cont_status & CONT_SOL) then ptr must be in lowercase. |
| 7 | 4708 */ |
| 4709 void | |
| 4710 find_pattern_in_path(ptr, dir, len, whole, skip_comments, | |
| 4711 type, count, action, start_lnum, end_lnum) | |
| 4712 char_u *ptr; /* pointer to search pattern */ | |
| 1883 | 4713 int dir UNUSED; /* direction of expansion */ |
| 7 | 4714 int len; /* length of search pattern */ |
| 4715 int whole; /* match whole words only */ | |
| 4716 int skip_comments; /* don't match inside comments */ | |
| 4717 int type; /* Type of search; are we looking for a type? | |
| 4718 a macro? */ | |
| 4719 long count; | |
| 4720 int action; /* What to do when we find it */ | |
| 4721 linenr_T start_lnum; /* first line to start searching */ | |
| 4722 linenr_T end_lnum; /* last line for searching */ | |
| 4723 { | |
| 4724 SearchedFile *files; /* Stack of included files */ | |
| 4725 SearchedFile *bigger; /* When we need more space */ | |
| 4726 int max_path_depth = 50; | |
| 4727 long match_count = 1; | |
| 4728 | |
| 4729 char_u *pat; | |
| 4730 char_u *new_fname; | |
| 4731 char_u *curr_fname = curbuf->b_fname; | |
| 4732 char_u *prev_fname = NULL; | |
| 4733 linenr_T lnum; | |
| 4734 int depth; | |
| 4735 int depth_displayed; /* For type==CHECK_PATH */ | |
| 4736 int old_files; | |
| 4737 int already_searched; | |
| 4738 char_u *file_line; | |
| 4739 char_u *line; | |
| 4740 char_u *p; | |
| 4741 char_u save_char; | |
| 4742 int define_matched; | |
| 4743 regmatch_T regmatch; | |
| 4744 regmatch_T incl_regmatch; | |
| 4745 regmatch_T def_regmatch; | |
| 4746 int matched = FALSE; | |
| 4747 int did_show = FALSE; | |
| 4748 int found = FALSE; | |
| 4749 int i; | |
| 4750 char_u *already = NULL; | |
| 4751 char_u *startp = NULL; | |
| 534 | 4752 char_u *inc_opt = NULL; |
| 7 | 4753 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX) |
| 4754 win_T *curwin_save = NULL; | |
| 4755 #endif | |
| 4756 | |
| 4757 regmatch.regprog = NULL; | |
| 4758 incl_regmatch.regprog = NULL; | |
| 4759 def_regmatch.regprog = NULL; | |
| 4760 | |
| 4761 file_line = alloc(LSIZE); | |
| 4762 if (file_line == NULL) | |
| 4763 return; | |
| 4764 | |
| 4765 if (type != CHECK_PATH && type != FIND_DEFINE | |
| 4766 #ifdef FEAT_INS_EXPAND | |
| 4767 /* when CONT_SOL is set compare "ptr" with the beginning of the line | |
| 4768 * is faster than quote_meta/regcomp/regexec "ptr" -- Acevedo */ | |
| 449 | 4769 && !(compl_cont_status & CONT_SOL) |
| 7 | 4770 #endif |
| 4771 ) | |
| 4772 { | |
| 4773 pat = alloc(len + 5); | |
| 4774 if (pat == NULL) | |
| 4775 goto fpip_end; | |
| 4776 sprintf((char *)pat, whole ? "\\<%.*s\\>" : "%.*s", len, ptr); | |
| 4777 /* ignore case according to p_ic, p_scs and pat */ | |
| 4778 regmatch.rm_ic = ignorecase(pat); | |
| 4779 regmatch.regprog = vim_regcomp(pat, p_magic ? RE_MAGIC : 0); | |
| 4780 vim_free(pat); | |
| 4781 if (regmatch.regprog == NULL) | |
| 4782 goto fpip_end; | |
| 4783 } | |
| 534 | 4784 inc_opt = (*curbuf->b_p_inc == NUL) ? p_inc : curbuf->b_p_inc; |
| 4785 if (*inc_opt != NUL) | |
| 7 | 4786 { |
| 534 | 4787 incl_regmatch.regprog = vim_regcomp(inc_opt, p_magic ? RE_MAGIC : 0); |
| 7 | 4788 if (incl_regmatch.regprog == NULL) |
| 4789 goto fpip_end; | |
| 4790 incl_regmatch.rm_ic = FALSE; /* don't ignore case in incl. pat. */ | |
| 4791 } | |
| 4792 if (type == FIND_DEFINE && (*curbuf->b_p_def != NUL || *p_def != NUL)) | |
| 4793 { | |
| 4794 def_regmatch.regprog = vim_regcomp(*curbuf->b_p_def == NUL | |
| 4795 ? p_def : curbuf->b_p_def, p_magic ? RE_MAGIC : 0); | |
| 4796 if (def_regmatch.regprog == NULL) | |
| 4797 goto fpip_end; | |
| 4798 def_regmatch.rm_ic = FALSE; /* don't ignore case in define pat. */ | |
| 4799 } | |
| 4800 files = (SearchedFile *)lalloc_clear((long_u) | |
| 4801 (max_path_depth * sizeof(SearchedFile)), TRUE); | |
| 4802 if (files == NULL) | |
| 4803 goto fpip_end; | |
| 4804 old_files = max_path_depth; | |
| 4805 depth = depth_displayed = -1; | |
| 4806 | |
| 4807 lnum = start_lnum; | |
| 4808 if (end_lnum > curbuf->b_ml.ml_line_count) | |
| 4809 end_lnum = curbuf->b_ml.ml_line_count; | |
| 4810 if (lnum > end_lnum) /* do at least one line */ | |
| 4811 lnum = end_lnum; | |
| 4812 line = ml_get(lnum); | |
| 4813 | |
| 4814 for (;;) | |
| 4815 { | |
| 4816 if (incl_regmatch.regprog != NULL | |
| 4817 && vim_regexec(&incl_regmatch, line, (colnr_T)0)) | |
| 4818 { | |
| 534 | 4819 char_u *p_fname = (curr_fname == curbuf->b_fname) |
| 4820 ? curbuf->b_ffname : curr_fname; | |
| 4821 | |
| 4822 if (inc_opt != NULL && strstr((char *)inc_opt, "\\zs") != NULL) | |
| 4823 /* Use text from '\zs' to '\ze' (or end) of 'include'. */ | |
| 4824 new_fname = find_file_name_in_path(incl_regmatch.startp[0], | |
| 835 | 4825 (int)(incl_regmatch.endp[0] - incl_regmatch.startp[0]), |
| 534 | 4826 FNAME_EXP|FNAME_INCL|FNAME_REL, 1L, p_fname); |
| 4827 else | |
| 4828 /* Use text after match with 'include'. */ | |
| 4829 new_fname = file_name_in_line(incl_regmatch.endp[0], 0, | |
| 681 | 4830 FNAME_EXP|FNAME_INCL|FNAME_REL, 1L, p_fname, NULL); |
| 7 | 4831 already_searched = FALSE; |
| 4832 if (new_fname != NULL) | |
| 4833 { | |
| 4834 /* Check whether we have already searched in this file */ | |
| 4835 for (i = 0;; i++) | |
| 4836 { | |
| 4837 if (i == depth + 1) | |
| 4838 i = old_files; | |
| 4839 if (i == max_path_depth) | |
| 4840 break; | |
| 4841 if (fullpathcmp(new_fname, files[i].name, TRUE) & FPC_SAME) | |
| 4842 { | |
| 4843 if (type != CHECK_PATH && | |
| 4844 action == ACTION_SHOW_ALL && files[i].matched) | |
| 4845 { | |
| 4846 msg_putchar('\n'); /* cursor below last one */ | |
| 4847 if (!got_int) /* don't display if 'q' | |
| 4848 typed at "--more--" | |
| 1859 | 4849 message */ |
| 7 | 4850 { |
| 4851 msg_home_replace_hl(new_fname); | |
| 4852 MSG_PUTS(_(" (includes previously listed match)")); | |
| 4853 prev_fname = NULL; | |
| 4854 } | |
| 4855 } | |
| 4856 vim_free(new_fname); | |
| 4857 new_fname = NULL; | |
| 4858 already_searched = TRUE; | |
| 4859 break; | |
| 4860 } | |
| 4861 } | |
| 4862 } | |
| 4863 | |
| 4864 if (type == CHECK_PATH && (action == ACTION_SHOW_ALL | |
| 4865 || (new_fname == NULL && !already_searched))) | |
| 4866 { | |
| 4867 if (did_show) | |
| 4868 msg_putchar('\n'); /* cursor below last one */ | |
| 4869 else | |
| 4870 { | |
| 4871 gotocmdline(TRUE); /* cursor at status line */ | |
| 4872 MSG_PUTS_TITLE(_("--- Included files ")); | |
| 4873 if (action != ACTION_SHOW_ALL) | |
| 4874 MSG_PUTS_TITLE(_("not found ")); | |
| 4875 MSG_PUTS_TITLE(_("in path ---\n")); | |
| 4876 } | |
| 4877 did_show = TRUE; | |
| 4878 while (depth_displayed < depth && !got_int) | |
| 4879 { | |
| 4880 ++depth_displayed; | |
| 4881 for (i = 0; i < depth_displayed; i++) | |
| 4882 MSG_PUTS(" "); | |
| 4883 msg_home_replace(files[depth_displayed].name); | |
| 4884 MSG_PUTS(" -->\n"); | |
| 4885 } | |
| 4886 if (!got_int) /* don't display if 'q' typed | |
| 4887 for "--more--" message */ | |
| 4888 { | |
| 4889 for (i = 0; i <= depth_displayed; i++) | |
| 4890 MSG_PUTS(" "); | |
| 4891 if (new_fname != NULL) | |
| 4892 { | |
| 4893 /* using "new_fname" is more reliable, e.g., when | |
| 4894 * 'includeexpr' is set. */ | |
| 4895 msg_outtrans_attr(new_fname, hl_attr(HLF_D)); | |
| 4896 } | |
| 4897 else | |
| 4898 { | |
| 4899 /* | |
| 4900 * Isolate the file name. | |
| 4901 * Include the surrounding "" or <> if present. | |
| 4902 */ | |
| 3699 | 4903 if (inc_opt != NULL |
| 4904 && strstr((char *)inc_opt, "\\zs") != NULL) | |
| 4905 { | |
| 4906 /* pattern contains \zs, use the match */ | |
| 4907 p = incl_regmatch.startp[0]; | |
| 4908 i = (int)(incl_regmatch.endp[0] | |
| 4909 - incl_regmatch.startp[0]); | |
| 4910 } | |
| 4911 else | |
| 4912 { | |
| 4913 /* find the file name after the end of the match */ | |
| 4914 for (p = incl_regmatch.endp[0]; | |
| 4915 *p && !vim_isfilec(*p); p++) | |
| 4916 ; | |
| 4917 for (i = 0; vim_isfilec(p[i]); i++) | |
| 4918 ; | |
| 4919 } | |
| 4920 | |
| 7 | 4921 if (i == 0) |
| 4922 { | |
| 4923 /* Nothing found, use the rest of the line. */ | |
| 4924 p = incl_regmatch.endp[0]; | |
| 835 | 4925 i = (int)STRLEN(p); |
| 7 | 4926 } |
| 3699 | 4927 /* Avoid checking before the start of the line, can |
| 4928 * happen if \zs appears in the regexp. */ | |
| 4929 else if (p > line) | |
| 7 | 4930 { |
| 4931 if (p[-1] == '"' || p[-1] == '<') | |
| 4932 { | |
| 4933 --p; | |
| 4934 ++i; | |
| 4935 } | |
| 4936 if (p[i] == '"' || p[i] == '>') | |
| 4937 ++i; | |
| 4938 } | |
| 4939 save_char = p[i]; | |
| 4940 p[i] = NUL; | |
| 4941 msg_outtrans_attr(p, hl_attr(HLF_D)); | |
| 4942 p[i] = save_char; | |
| 4943 } | |
| 4944 | |
| 4945 if (new_fname == NULL && action == ACTION_SHOW_ALL) | |
| 4946 { | |
| 4947 if (already_searched) | |
| 4948 MSG_PUTS(_(" (Already listed)")); | |
| 4949 else | |
| 4950 MSG_PUTS(_(" NOT FOUND")); | |
| 4951 } | |
| 4952 } | |
| 4953 out_flush(); /* output each line directly */ | |
| 4954 } | |
| 4955 | |
| 4956 if (new_fname != NULL) | |
| 4957 { | |
| 4958 /* Push the new file onto the file stack */ | |
| 4959 if (depth + 1 == old_files) | |
| 4960 { | |
| 4961 bigger = (SearchedFile *)lalloc((long_u)( | |
| 4962 max_path_depth * 2 * sizeof(SearchedFile)), TRUE); | |
| 4963 if (bigger != NULL) | |
| 4964 { | |
| 4965 for (i = 0; i <= depth; i++) | |
| 4966 bigger[i] = files[i]; | |
| 4967 for (i = depth + 1; i < old_files + max_path_depth; i++) | |
| 4968 { | |
| 4969 bigger[i].fp = NULL; | |
| 4970 bigger[i].name = NULL; | |
| 4971 bigger[i].lnum = 0; | |
| 4972 bigger[i].matched = FALSE; | |
| 4973 } | |
| 4974 for (i = old_files; i < max_path_depth; i++) | |
| 4975 bigger[i + max_path_depth] = files[i]; | |
| 4976 old_files += max_path_depth; | |
| 4977 max_path_depth *= 2; | |
| 4978 vim_free(files); | |
| 4979 files = bigger; | |
| 4980 } | |
| 4981 } | |
| 4982 if ((files[depth + 1].fp = mch_fopen((char *)new_fname, "r")) | |
| 4983 == NULL) | |
| 4984 vim_free(new_fname); | |
| 4985 else | |
| 4986 { | |
| 4987 if (++depth == old_files) | |
| 4988 { | |
| 4989 /* | |
| 4990 * lalloc() for 'bigger' must have failed above. We | |
| 4991 * will forget one of our already visited files now. | |
| 4992 */ | |
| 4993 vim_free(files[old_files].name); | |
| 4994 ++old_files; | |
| 4995 } | |
| 4996 files[depth].name = curr_fname = new_fname; | |
| 4997 files[depth].lnum = 0; | |
| 4998 files[depth].matched = FALSE; | |
| 4999 #ifdef FEAT_INS_EXPAND | |
| 5000 if (action == ACTION_EXPAND) | |
| 5001 { | |
| 1007 | 5002 msg_hist_off = TRUE; /* reset in msg_trunc_attr() */ |
| 274 | 5003 vim_snprintf((char*)IObuff, IOSIZE, |
| 5004 _("Scanning included file: %s"), | |
| 5005 (char *)new_fname); | |
| 7 | 5006 msg_trunc_attr(IObuff, TRUE, hl_attr(HLF_R)); |
| 5007 } | |
| 712 | 5008 else |
| 7 | 5009 #endif |
| 712 | 5010 if (p_verbose >= 5) |
| 5011 { | |
| 5012 verbose_enter(); | |
| 5013 smsg((char_u *)_("Searching included file %s"), | |
| 5014 (char *)new_fname); | |
| 5015 verbose_leave(); | |
| 5016 } | |
| 5017 | |
| 7 | 5018 } |
| 5019 } | |
| 5020 } | |
| 5021 else | |
| 5022 { | |
| 5023 /* | |
| 5024 * Check if the line is a define (type == FIND_DEFINE) | |
| 5025 */ | |
| 5026 p = line; | |
| 5027 search_line: | |
| 5028 define_matched = FALSE; | |
| 5029 if (def_regmatch.regprog != NULL | |
| 5030 && vim_regexec(&def_regmatch, line, (colnr_T)0)) | |
| 5031 { | |
| 5032 /* | |
| 5033 * Pattern must be first identifier after 'define', so skip | |
| 5034 * to that position before checking for match of pattern. Also | |
| 5035 * don't let it match beyond the end of this identifier. | |
| 5036 */ | |
| 5037 p = def_regmatch.endp[0]; | |
| 5038 while (*p && !vim_iswordc(*p)) | |
| 5039 p++; | |
| 5040 define_matched = TRUE; | |
| 5041 } | |
| 5042 | |
| 5043 /* | |
| 5044 * Look for a match. Don't do this if we are looking for a | |
| 5045 * define and this line didn't match define_prog above. | |
| 5046 */ | |
| 5047 if (def_regmatch.regprog == NULL || define_matched) | |
| 5048 { | |
| 5049 if (define_matched | |
| 5050 #ifdef FEAT_INS_EXPAND | |
| 449 | 5051 || (compl_cont_status & CONT_SOL) |
| 7 | 5052 #endif |
| 5053 ) | |
| 5054 { | |
| 5055 /* compare the first "len" chars from "ptr" */ | |
| 5056 startp = skipwhite(p); | |
| 5057 if (p_ic) | |
| 5058 matched = !MB_STRNICMP(startp, ptr, len); | |
| 5059 else | |
| 5060 matched = !STRNCMP(startp, ptr, len); | |
| 5061 if (matched && define_matched && whole | |
| 5062 && vim_iswordc(startp[len])) | |
| 5063 matched = FALSE; | |
| 5064 } | |
| 5065 else if (regmatch.regprog != NULL | |
| 5066 && vim_regexec(®match, line, (colnr_T)(p - line))) | |
| 5067 { | |
| 5068 matched = TRUE; | |
| 5069 startp = regmatch.startp[0]; | |
| 5070 /* | |
| 5071 * Check if the line is not a comment line (unless we are | |
| 5072 * looking for a define). A line starting with "# define" | |
| 5073 * is not considered to be a comment line. | |
| 5074 */ | |
| 5075 if (!define_matched && skip_comments) | |
| 5076 { | |
| 5077 #ifdef FEAT_COMMENTS | |
| 5078 if ((*line != '#' || | |
| 5079 STRNCMP(skipwhite(line + 1), "define", 6) != 0) | |
| 3562 | 5080 && get_leader_len(line, NULL, FALSE, TRUE)) |
| 7 | 5081 matched = FALSE; |
| 5082 | |
| 5083 /* | |
| 5084 * Also check for a "/ *" or "/ /" before the match. | |
| 5085 * Skips lines like "int backwards; / * normal index | |
| 5086 * * /" when looking for "normal". | |
| 5087 * Note: Doesn't skip "/ *" in comments. | |
| 5088 */ | |
| 5089 p = skipwhite(line); | |
| 5090 if (matched | |
| 5091 || (p[0] == '/' && p[1] == '*') || p[0] == '*') | |
| 5092 #endif | |
| 5093 for (p = line; *p && p < startp; ++p) | |
| 5094 { | |
| 5095 if (matched | |
| 5096 && p[0] == '/' | |
| 5097 && (p[1] == '*' || p[1] == '/')) | |
| 5098 { | |
| 5099 matched = FALSE; | |
| 5100 /* After "//" all text is comment */ | |
| 5101 if (p[1] == '/') | |
| 5102 break; | |
| 5103 ++p; | |
| 5104 } | |
| 5105 else if (!matched && p[0] == '*' && p[1] == '/') | |
| 5106 { | |
| 5107 /* Can find match after "* /". */ | |
| 5108 matched = TRUE; | |
| 5109 ++p; | |
| 5110 } | |
| 5111 } | |
| 5112 } | |
| 5113 } | |
| 5114 } | |
| 5115 } | |
| 5116 if (matched) | |
| 5117 { | |
| 5118 #ifdef FEAT_INS_EXPAND | |
| 5119 if (action == ACTION_EXPAND) | |
| 5120 { | |
| 5121 int reuse = 0; | |
| 5122 int add_r; | |
| 5123 char_u *aux; | |
| 5124 | |
| 5125 if (depth == -1 && lnum == curwin->w_cursor.lnum) | |
| 5126 break; | |
| 5127 found = TRUE; | |
| 5128 aux = p = startp; | |
| 449 | 5129 if (compl_cont_status & CONT_ADDING) |
| 7 | 5130 { |
| 449 | 5131 p += compl_length; |
| 7 | 5132 if (vim_iswordp(p)) |
| 5133 goto exit_matched; | |
| 5134 p = find_word_start(p); | |
| 5135 } | |
| 5136 p = find_word_end(p); | |
| 5137 i = (int)(p - aux); | |
| 5138 | |
| 449 | 5139 if ((compl_cont_status & CONT_ADDING) && i == compl_length) |
| 7 | 5140 { |
| 449 | 5141 /* IOSIZE > compl_length, so the STRNCPY works */ |
| 7 | 5142 STRNCPY(IObuff, aux, i); |
| 944 | 5143 |
| 5144 /* Get the next line: when "depth" < 0 from the current | |
| 5145 * buffer, otherwise from the included file. Jump to | |
| 5146 * exit_matched when past the last line. */ | |
| 5147 if (depth < 0) | |
| 5148 { | |
| 5149 if (lnum >= end_lnum) | |
| 5150 goto exit_matched; | |
| 5151 line = ml_get(++lnum); | |
| 5152 } | |
| 5153 else if (vim_fgets(line = file_line, | |
| 5154 LSIZE, files[depth].fp)) | |
| 7 | 5155 goto exit_matched; |
| 5156 | |
| 5157 /* we read a line, set "already" to check this "line" later | |
| 5158 * if depth >= 0 we'll increase files[depth].lnum far | |
| 5159 * bellow -- Acevedo */ | |
| 5160 already = aux = p = skipwhite(line); | |
| 5161 p = find_word_start(p); | |
| 5162 p = find_word_end(p); | |
| 5163 if (p > aux) | |
| 5164 { | |
| 5165 if (*aux != ')' && IObuff[i-1] != TAB) | |
| 5166 { | |
| 5167 if (IObuff[i-1] != ' ') | |
| 5168 IObuff[i++] = ' '; | |
| 5169 /* IObuf =~ "\(\k\|\i\).* ", thus i >= 2*/ | |
| 5170 if (p_js | |
| 5171 && (IObuff[i-2] == '.' | |
| 5172 || (vim_strchr(p_cpo, CPO_JOINSP) == NULL | |
| 5173 && (IObuff[i-2] == '?' | |
| 5174 || IObuff[i-2] == '!')))) | |
| 5175 IObuff[i++] = ' '; | |
| 5176 } | |
| 1859 | 5177 /* copy as much as possible of the new word */ |
| 7 | 5178 if (p - aux >= IOSIZE - i) |
| 5179 p = aux + IOSIZE - i - 1; | |
| 5180 STRNCPY(IObuff + i, aux, p - aux); | |
| 5181 i += (int)(p - aux); | |
| 5182 reuse |= CONT_S_IPOS; | |
| 5183 } | |
| 5184 IObuff[i] = NUL; | |
| 5185 aux = IObuff; | |
| 5186 | |
| 449 | 5187 if (i == compl_length) |
| 7 | 5188 goto exit_matched; |
| 5189 } | |
| 5190 | |
| 942 | 5191 add_r = ins_compl_add_infercase(aux, i, p_ic, |
| 7 | 5192 curr_fname == curbuf->b_fname ? NULL : curr_fname, |
| 5193 dir, reuse); | |
| 5194 if (add_r == OK) | |
| 5195 /* if dir was BACKWARD then honor it just once */ | |
| 5196 dir = FORWARD; | |
| 464 | 5197 else if (add_r == FAIL) |
| 7 | 5198 break; |
| 5199 } | |
| 5200 else | |
| 5201 #endif | |
| 5202 if (action == ACTION_SHOW_ALL) | |
| 5203 { | |
| 5204 found = TRUE; | |
| 5205 if (!did_show) | |
| 5206 gotocmdline(TRUE); /* cursor at status line */ | |
| 5207 if (curr_fname != prev_fname) | |
| 5208 { | |
| 5209 if (did_show) | |
| 5210 msg_putchar('\n'); /* cursor below last one */ | |
| 5211 if (!got_int) /* don't display if 'q' typed | |
| 1859 | 5212 at "--more--" message */ |
| 7 | 5213 msg_home_replace_hl(curr_fname); |
| 5214 prev_fname = curr_fname; | |
| 5215 } | |
| 5216 did_show = TRUE; | |
| 5217 if (!got_int) | |
| 5218 show_pat_in_path(line, type, TRUE, action, | |
| 5219 (depth == -1) ? NULL : files[depth].fp, | |
| 5220 (depth == -1) ? &lnum : &files[depth].lnum, | |
| 5221 match_count++); | |
| 5222 | |
| 5223 /* Set matched flag for this file and all the ones that | |
| 5224 * include it */ | |
| 5225 for (i = 0; i <= depth; ++i) | |
| 5226 files[i].matched = TRUE; | |
| 5227 } | |
| 5228 else if (--count <= 0) | |
| 5229 { | |
| 5230 found = TRUE; | |
| 5231 if (depth == -1 && lnum == curwin->w_cursor.lnum | |
| 5232 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX) | |
| 5233 && g_do_tagpreview == 0 | |
| 5234 #endif | |
| 5235 ) | |
| 5236 EMSG(_("E387: Match is on current line")); | |
| 5237 else if (action == ACTION_SHOW) | |
| 5238 { | |
| 5239 show_pat_in_path(line, type, did_show, action, | |
| 5240 (depth == -1) ? NULL : files[depth].fp, | |
| 5241 (depth == -1) ? &lnum : &files[depth].lnum, 1L); | |
| 5242 did_show = TRUE; | |
| 5243 } | |
| 5244 else | |
| 5245 { | |
| 5246 #ifdef FEAT_GUI | |
| 5247 need_mouse_correct = TRUE; | |
| 5248 #endif | |
| 5249 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX) | |
| 5250 /* ":psearch" uses the preview window */ | |
| 5251 if (g_do_tagpreview != 0) | |
| 5252 { | |
| 5253 curwin_save = curwin; | |
| 816 | 5254 prepare_tagpreview(TRUE); |
| 7 | 5255 } |
| 5256 #endif | |
| 5257 if (action == ACTION_SPLIT) | |
| 5258 { | |
| 5259 #ifdef FEAT_WINDOWS | |
| 5260 if (win_split(0, 0) == FAIL) | |
| 5261 #endif | |
| 5262 break; | |
| 2583 | 5263 RESET_BINDING(curwin); |
| 7 | 5264 } |
| 5265 if (depth == -1) | |
| 5266 { | |
| 5267 /* match in current file */ | |
| 5268 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX) | |
| 5269 if (g_do_tagpreview != 0) | |
| 5270 { | |
| 5271 if (getfile(0, curwin_save->w_buffer->b_fname, | |
| 5272 NULL, TRUE, lnum, FALSE) > 0) | |
| 5273 break; /* failed to jump to file */ | |
| 5274 } | |
| 5275 else | |
| 5276 #endif | |
| 5277 setpcmark(); | |
| 5278 curwin->w_cursor.lnum = lnum; | |
| 5279 } | |
| 5280 else | |
| 5281 { | |
| 5282 if (getfile(0, files[depth].name, NULL, TRUE, | |
| 5283 files[depth].lnum, FALSE) > 0) | |
| 5284 break; /* failed to jump to file */ | |
| 5285 /* autocommands may have changed the lnum, we don't | |
| 5286 * want that here */ | |
| 5287 curwin->w_cursor.lnum = files[depth].lnum; | |
| 5288 } | |
| 5289 } | |
| 5290 if (action != ACTION_SHOW) | |
| 5291 { | |
| 1859 | 5292 curwin->w_cursor.col = (colnr_T)(startp - line); |
| 7 | 5293 curwin->w_set_curswant = TRUE; |
| 5294 } | |
| 5295 | |
| 5296 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX) | |
| 5297 if (g_do_tagpreview != 0 | |
| 673 | 5298 && curwin != curwin_save && win_valid(curwin_save)) |
| 7 | 5299 { |
| 5300 /* Return cursor to where we were */ | |
| 5301 validate_cursor(); | |
| 5302 redraw_later(VALID); | |
| 5303 win_enter(curwin_save, TRUE); | |
| 5304 } | |
| 5305 #endif | |
| 5306 break; | |
| 5307 } | |
| 5308 #ifdef FEAT_INS_EXPAND | |
| 5309 exit_matched: | |
| 5310 #endif | |
| 5311 matched = FALSE; | |
| 5312 /* look for other matches in the rest of the line if we | |
| 5313 * are not at the end of it already */ | |
| 5314 if (def_regmatch.regprog == NULL | |
| 5315 #ifdef FEAT_INS_EXPAND | |
| 5316 && action == ACTION_EXPAND | |
| 449 | 5317 && !(compl_cont_status & CONT_SOL) |
| 7 | 5318 #endif |
| 1859 | 5319 && *startp != NUL |
| 3693 | 5320 && *(p = startp + MB_PTR2LEN(startp)) != NUL) |
| 7 | 5321 goto search_line; |
| 5322 } | |
| 5323 line_breakcheck(); | |
| 5324 #ifdef FEAT_INS_EXPAND | |
| 5325 if (action == ACTION_EXPAND) | |
| 464 | 5326 ins_compl_check_keys(30); |
| 449 | 5327 if (got_int || compl_interrupted) |
| 7 | 5328 #else |
| 5329 if (got_int) | |
| 5330 #endif | |
| 5331 break; | |
| 5332 | |
| 5333 /* | |
| 5334 * Read the next line. When reading an included file and encountering | |
| 5335 * end-of-file, close the file and continue in the file that included | |
| 5336 * it. | |
| 5337 */ | |
| 5338 while (depth >= 0 && !already | |
| 5339 && vim_fgets(line = file_line, LSIZE, files[depth].fp)) | |
| 5340 { | |
| 5341 fclose(files[depth].fp); | |
| 5342 --old_files; | |
| 5343 files[old_files].name = files[depth].name; | |
| 5344 files[old_files].matched = files[depth].matched; | |
| 5345 --depth; | |
| 5346 curr_fname = (depth == -1) ? curbuf->b_fname | |
| 5347 : files[depth].name; | |
| 5348 if (depth < depth_displayed) | |
| 5349 depth_displayed = depth; | |
| 5350 } | |
| 5351 if (depth >= 0) /* we could read the line */ | |
| 5352 files[depth].lnum++; | |
| 5353 else if (!already) | |
| 5354 { | |
| 5355 if (++lnum > end_lnum) | |
| 5356 break; | |
| 5357 line = ml_get(lnum); | |
| 5358 } | |
| 5359 already = NULL; | |
| 5360 } | |
| 5361 /* End of big for (;;) loop. */ | |
| 5362 | |
| 5363 /* Close any files that are still open. */ | |
| 5364 for (i = 0; i <= depth; i++) | |
| 5365 { | |
| 5366 fclose(files[i].fp); | |
| 5367 vim_free(files[i].name); | |
| 5368 } | |
| 5369 for (i = old_files; i < max_path_depth; i++) | |
| 5370 vim_free(files[i].name); | |
| 5371 vim_free(files); | |
| 5372 | |
| 5373 if (type == CHECK_PATH) | |
| 5374 { | |
| 5375 if (!did_show) | |
| 5376 { | |
| 5377 if (action != ACTION_SHOW_ALL) | |
| 5378 MSG(_("All included files were found")); | |
| 5379 else | |
| 5380 MSG(_("No included files")); | |
| 5381 } | |
| 5382 } | |
| 5383 else if (!found | |
| 5384 #ifdef FEAT_INS_EXPAND | |
| 5385 && action != ACTION_EXPAND | |
| 5386 #endif | |
| 5387 ) | |
| 5388 { | |
| 5389 #ifdef FEAT_INS_EXPAND | |
| 449 | 5390 if (got_int || compl_interrupted) |
| 7 | 5391 #else |
| 5392 if (got_int) | |
| 5393 #endif | |
| 5394 EMSG(_(e_interr)); | |
| 5395 else if (type == FIND_DEFINE) | |
| 5396 EMSG(_("E388: Couldn't find definition")); | |
| 5397 else | |
| 5398 EMSG(_("E389: Couldn't find pattern")); | |
| 5399 } | |
| 5400 if (action == ACTION_SHOW || action == ACTION_SHOW_ALL) | |
| 5401 msg_end(); | |
| 5402 | |
| 5403 fpip_end: | |
| 5404 vim_free(file_line); | |
| 5405 vim_free(regmatch.regprog); | |
| 5406 vim_free(incl_regmatch.regprog); | |
| 5407 vim_free(def_regmatch.regprog); | |
| 5408 } | |
| 5409 | |
| 5410 static void | |
| 5411 show_pat_in_path(line, type, did_show, action, fp, lnum, count) | |
| 5412 char_u *line; | |
| 5413 int type; | |
| 5414 int did_show; | |
| 5415 int action; | |
| 5416 FILE *fp; | |
| 5417 linenr_T *lnum; | |
| 5418 long count; | |
| 5419 { | |
| 5420 char_u *p; | |
| 5421 | |
| 5422 if (did_show) | |
| 5423 msg_putchar('\n'); /* cursor below last one */ | |
| 867 | 5424 else if (!msg_silent) |
| 7 | 5425 gotocmdline(TRUE); /* cursor at status line */ |
| 5426 if (got_int) /* 'q' typed at "--more--" message */ | |
| 5427 return; | |
| 5428 for (;;) | |
| 5429 { | |
| 5430 p = line + STRLEN(line) - 1; | |
| 5431 if (fp != NULL) | |
| 5432 { | |
| 5433 /* We used fgets(), so get rid of newline at end */ | |
| 5434 if (p >= line && *p == '\n') | |
| 5435 --p; | |
| 5436 if (p >= line && *p == '\r') | |
| 5437 --p; | |
| 5438 *(p + 1) = NUL; | |
| 5439 } | |
| 5440 if (action == ACTION_SHOW_ALL) | |
| 5441 { | |
| 5442 sprintf((char *)IObuff, "%3ld: ", count); /* show match nr */ | |
| 5443 msg_puts(IObuff); | |
| 5444 sprintf((char *)IObuff, "%4ld", *lnum); /* show line nr */ | |
| 5445 /* Highlight line numbers */ | |
| 5446 msg_puts_attr(IObuff, hl_attr(HLF_N)); | |
| 5447 MSG_PUTS(" "); | |
| 5448 } | |
| 168 | 5449 msg_prt_line(line, FALSE); |
| 7 | 5450 out_flush(); /* show one line at a time */ |
| 5451 | |
| 5452 /* Definition continues until line that doesn't end with '\' */ | |
| 5453 if (got_int || type != FIND_DEFINE || p < line || *p != '\\') | |
| 5454 break; | |
| 5455 | |
| 5456 if (fp != NULL) | |
| 5457 { | |
| 5458 if (vim_fgets(line, LSIZE, fp)) /* end of file */ | |
| 5459 break; | |
| 5460 ++*lnum; | |
| 5461 } | |
| 5462 else | |
| 5463 { | |
| 5464 if (++*lnum > curbuf->b_ml.ml_line_count) | |
| 5465 break; | |
| 5466 line = ml_get(*lnum); | |
| 5467 } | |
| 5468 msg_putchar('\n'); | |
| 5469 } | |
| 5470 } | |
| 5471 #endif | |
| 5472 | |
| 5473 #ifdef FEAT_VIMINFO | |
| 5474 int | |
| 5475 read_viminfo_search_pattern(virp, force) | |
| 5476 vir_T *virp; | |
| 5477 int force; | |
| 5478 { | |
| 5479 char_u *lp; | |
| 5480 int idx = -1; | |
| 5481 int magic = FALSE; | |
| 5482 int no_scs = FALSE; | |
| 5483 int off_line = FALSE; | |
| 572 | 5484 int off_end = 0; |
| 7 | 5485 long off = 0; |
| 5486 int setlast = FALSE; | |
| 5487 #ifdef FEAT_SEARCH_EXTRA | |
| 5488 static int hlsearch_on = FALSE; | |
| 5489 #endif | |
| 5490 char_u *val; | |
| 5491 | |
| 5492 /* | |
| 5493 * Old line types: | |
| 5494 * "/pat", "&pat": search/subst. pat | |
| 5495 * "~/pat", "~&pat": last used search/subst. pat | |
| 5496 * New line types: | |
| 5497 * "~h", "~H": hlsearch highlighting off/on | |
| 5498 * "~<magic><smartcase><line><end><off><last><which>pat" | |
| 5499 * <magic>: 'm' off, 'M' on | |
| 5500 * <smartcase>: 's' off, 'S' on | |
| 5501 * <line>: 'L' line offset, 'l' char offset | |
| 5502 * <end>: 'E' from end, 'e' from start | |
| 5503 * <off>: decimal, offset | |
| 5504 * <last>: '~' last used pattern | |
| 5505 * <which>: '/' search pat, '&' subst. pat | |
| 5506 */ | |
| 5507 lp = virp->vir_line; | |
| 5508 if (lp[0] == '~' && (lp[1] == 'm' || lp[1] == 'M')) /* new line type */ | |
| 5509 { | |
| 5510 if (lp[1] == 'M') /* magic on */ | |
| 5511 magic = TRUE; | |
| 5512 if (lp[2] == 's') | |
| 5513 no_scs = TRUE; | |
| 5514 if (lp[3] == 'L') | |
| 5515 off_line = TRUE; | |
| 5516 if (lp[4] == 'E') | |
| 8 | 5517 off_end = SEARCH_END; |
| 7 | 5518 lp += 5; |
| 5519 off = getdigits(&lp); | |
| 5520 } | |
| 5521 if (lp[0] == '~') /* use this pattern for last-used pattern */ | |
| 5522 { | |
| 5523 setlast = TRUE; | |
| 5524 lp++; | |
| 5525 } | |
| 5526 if (lp[0] == '/') | |
| 5527 idx = RE_SEARCH; | |
| 5528 else if (lp[0] == '&') | |
| 5529 idx = RE_SUBST; | |
| 5530 #ifdef FEAT_SEARCH_EXTRA | |
| 5531 else if (lp[0] == 'h') /* ~h: 'hlsearch' highlighting off */ | |
| 5532 hlsearch_on = FALSE; | |
| 5533 else if (lp[0] == 'H') /* ~H: 'hlsearch' highlighting on */ | |
| 5534 hlsearch_on = TRUE; | |
| 5535 #endif | |
| 5536 if (idx >= 0) | |
| 5537 { | |
| 5538 if (force || spats[idx].pat == NULL) | |
| 5539 { | |
| 5540 val = viminfo_readstring(virp, (int)(lp - virp->vir_line + 1), | |
| 5541 TRUE); | |
| 5542 if (val != NULL) | |
| 5543 { | |
| 5544 set_last_search_pat(val, idx, magic, setlast); | |
| 5545 vim_free(val); | |
| 5546 spats[idx].no_scs = no_scs; | |
| 5547 spats[idx].off.line = off_line; | |
| 5548 spats[idx].off.end = off_end; | |
| 5549 spats[idx].off.off = off; | |
| 5550 #ifdef FEAT_SEARCH_EXTRA | |
| 5551 if (setlast) | |
| 5552 no_hlsearch = !hlsearch_on; | |
| 5553 #endif | |
| 5554 } | |
| 5555 } | |
| 5556 } | |
| 5557 return viminfo_readline(virp); | |
| 5558 } | |
| 5559 | |
| 5560 void | |
| 5561 write_viminfo_search_pattern(fp) | |
| 5562 FILE *fp; | |
| 5563 { | |
| 5564 if (get_viminfo_parameter('/') != 0) | |
| 5565 { | |
| 5566 #ifdef FEAT_SEARCH_EXTRA | |
| 5567 fprintf(fp, "\n# hlsearch on (H) or off (h):\n~%c", | |
| 5568 (no_hlsearch || find_viminfo_parameter('h') != NULL) ? 'h' : 'H'); | |
| 5569 #endif | |
| 5570 wvsp_one(fp, RE_SEARCH, "", '/'); | |
| 1675 | 5571 wvsp_one(fp, RE_SUBST, _("Substitute "), '&'); |
| 7 | 5572 } |
| 5573 } | |
| 5574 | |
| 5575 static void | |
| 5576 wvsp_one(fp, idx, s, sc) | |
| 5577 FILE *fp; /* file to write to */ | |
| 5578 int idx; /* spats[] index */ | |
| 5579 char *s; /* search pat */ | |
| 5580 int sc; /* dir char */ | |
| 5581 { | |
| 5582 if (spats[idx].pat != NULL) | |
| 5583 { | |
| 835 | 5584 fprintf(fp, _("\n# Last %sSearch Pattern:\n~"), s); |
| 7 | 5585 /* off.dir is not stored, it's reset to forward */ |
| 5586 fprintf(fp, "%c%c%c%c%ld%s%c", | |
| 5587 spats[idx].magic ? 'M' : 'm', /* magic */ | |
| 5588 spats[idx].no_scs ? 's' : 'S', /* smartcase */ | |
| 5589 spats[idx].off.line ? 'L' : 'l', /* line offset */ | |
| 5590 spats[idx].off.end ? 'E' : 'e', /* offset from end */ | |
| 5591 spats[idx].off.off, /* offset */ | |
| 5592 last_idx == idx ? "~" : "", /* last used pat */ | |
| 5593 sc); | |
| 5594 viminfo_writestring(fp, spats[idx].pat); | |
| 5595 } | |
| 5596 } | |
| 5597 #endif /* FEAT_VIMINFO */ |