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