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