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