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