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