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