|
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 /*
|
|
|
11 * Code to handle tags and the tag stack
|
|
|
12 */
|
|
|
13
|
|
|
14 #if defined MSDOS || defined WIN32 || defined(_WIN64)
|
|
|
15 # include <io.h> /* for lseek(), must be before vim.h */
|
|
|
16 #endif
|
|
|
17
|
|
|
18 #include "vim.h"
|
|
|
19
|
|
|
20 #ifdef HAVE_FCNTL_H
|
|
|
21 # include <fcntl.h> /* for lseek() */
|
|
|
22 #endif
|
|
|
23
|
|
|
24 /*
|
|
|
25 * Structure to hold pointers to various items in a tag line.
|
|
|
26 */
|
|
|
27 typedef struct tag_pointers
|
|
|
28 {
|
|
|
29 /* filled in by parse_tag_line(): */
|
|
|
30 char_u *tagname; /* start of tag name (skip "file:") */
|
|
|
31 char_u *tagname_end; /* char after tag name */
|
|
|
32 char_u *fname; /* first char of file name */
|
|
|
33 char_u *fname_end; /* char after file name */
|
|
|
34 char_u *command; /* first char of command */
|
|
|
35 /* filled in by parse_match(): */
|
|
|
36 char_u *command_end; /* first char after command */
|
|
|
37 char_u *tag_fname; /* file name of the tags file */
|
|
|
38 #ifdef FEAT_EMACS_TAGS
|
|
|
39 int is_etag; /* TRUE for emacs tag */
|
|
|
40 #endif
|
|
|
41 char_u *tagkind; /* "kind:" value */
|
|
|
42 char_u *tagkind_end; /* end of tagkind */
|
|
|
43 } tagptrs_T;
|
|
|
44
|
|
|
45 /*
|
|
|
46 * The matching tags are first stored in ga_match[]. In which one depends on
|
|
|
47 * the priority of the match.
|
|
|
48 * At the end, the matches from ga_match[] are concatenated, to make a list
|
|
|
49 * sorted on priority.
|
|
|
50 */
|
|
|
51 #define MT_ST_CUR 0 /* static match in current file */
|
|
|
52 #define MT_GL_CUR 1 /* global match in current file */
|
|
|
53 #define MT_GL_OTH 2 /* global match in other file */
|
|
|
54 #define MT_ST_OTH 3 /* static match in other file */
|
|
|
55 #define MT_IC_ST_CUR 4 /* icase static match in current file */
|
|
|
56 #define MT_IC_GL_CUR 5 /* icase global match in current file */
|
|
|
57 #define MT_IC_GL_OTH 6 /* icase global match in other file */
|
|
|
58 #define MT_IC_ST_OTH 7 /* icase static match in other file */
|
|
|
59 #define MT_IC_OFF 4 /* add for icase match */
|
|
|
60 #define MT_RE_OFF 8 /* add for regexp match */
|
|
|
61 #define MT_MASK 7 /* mask for printing priority */
|
|
|
62 #define MT_COUNT 16
|
|
|
63
|
|
|
64 static char *mt_names[MT_COUNT/2] =
|
|
|
65 {"FSC", "F C", "F ", "FS ", " SC", " C", " ", " S "};
|
|
|
66
|
|
|
67 #define NOTAGFILE 99 /* return value for jumpto_tag */
|
|
|
68 static char_u *nofile_fname = NULL; /* fname for NOTAGFILE error */
|
|
|
69
|
|
|
70 static void taglen_advance __ARGS((int l));
|
|
|
71
|
|
|
72 static int jumpto_tag __ARGS((char_u *lbuf, int forceit, int keep_help));
|
|
|
73 #ifdef FEAT_EMACS_TAGS
|
|
|
74 static int parse_tag_line __ARGS((char_u *lbuf, int is_etag, tagptrs_T *tagp));
|
|
|
75 #else
|
|
|
76 static int parse_tag_line __ARGS((char_u *lbuf, tagptrs_T *tagp));
|
|
|
77 #endif
|
|
|
78 static int test_for_static __ARGS((tagptrs_T *));
|
|
|
79 static int parse_match __ARGS((char_u *lbuf, tagptrs_T *tagp));
|
|
|
80 static char_u *tag_full_fname __ARGS((tagptrs_T *tagp));
|
|
|
81 static char_u *expand_tag_fname __ARGS((char_u *fname, char_u *tag_fname, int expand));
|
|
|
82 #ifdef FEAT_EMACS_TAGS
|
|
|
83 static int test_for_current __ARGS((int, char_u *, char_u *, char_u *, char_u *));
|
|
|
84 #else
|
|
|
85 static int test_for_current __ARGS((char_u *, char_u *, char_u *, char_u *));
|
|
|
86 #endif
|
|
|
87 static int find_extra __ARGS((char_u **pp));
|
|
|
88
|
|
|
89 static char_u *bottommsg = (char_u *)N_("E555: at bottom of tag stack");
|
|
|
90 static char_u *topmsg = (char_u *)N_("E556: at top of tag stack");
|
|
|
91
|
|
|
92 static char_u *tagmatchname = NULL; /* name of last used tag */
|
|
|
93
|
|
|
94 /*
|
|
|
95 * We use ftello() here, if available. It returns off_t instead of long,
|
|
|
96 * which helps if long is 32 bit and off_t is 64 bit.
|
|
|
97 */
|
|
|
98 #ifdef HAVE_FTELLO
|
|
|
99 # define ftell ftello
|
|
|
100 #endif
|
|
|
101
|
|
|
102 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
103 /*
|
|
|
104 * Tag for preview window is remembered separately, to avoid messing up the
|
|
|
105 * normal tagstack.
|
|
|
106 */
|
|
|
107 static taggy_T ptag_entry = {NULL};
|
|
|
108 #endif
|
|
|
109
|
|
|
110 /*
|
|
|
111 * Jump to tag; handling of tag commands and tag stack
|
|
|
112 *
|
|
|
113 * *tag != NUL: ":tag {tag}", jump to new tag, add to tag stack
|
|
|
114 *
|
|
|
115 * type == DT_TAG: ":tag [tag]", jump to newer position or same tag again
|
|
|
116 * type == DT_HELP: like DT_TAG, but don't use regexp.
|
|
|
117 * type == DT_POP: ":pop" or CTRL-T, jump to old position
|
|
|
118 * type == DT_NEXT: jump to next match of same tag
|
|
|
119 * type == DT_PREV: jump to previous match of same tag
|
|
|
120 * type == DT_FIRST: jump to first match of same tag
|
|
|
121 * type == DT_LAST: jump to last match of same tag
|
|
|
122 * type == DT_SELECT: ":tselect [tag]", select tag from a list of all matches
|
|
|
123 * type == DT_JUMP: ":tjump [tag]", jump to tag or select tag from a list
|
|
359
|
124 * type == DT_CSCOPE: use cscope to find the tag
|
|
|
125 * type == DT_FREE: free cached matches
|
|
7
|
126 *
|
|
|
127 * for cscope, returns TRUE if we jumped to tag or aborted, FALSE otherwise
|
|
|
128 */
|
|
|
129 int
|
|
|
130 do_tag(tag, type, count, forceit, verbose)
|
|
|
131 char_u *tag; /* tag (pattern) to jump to */
|
|
|
132 int type;
|
|
|
133 int count;
|
|
|
134 int forceit; /* :ta with ! */
|
|
|
135 int verbose; /* print "tag not found" message */
|
|
|
136 {
|
|
|
137 taggy_T *tagstack = curwin->w_tagstack;
|
|
|
138 int tagstackidx = curwin->w_tagstackidx;
|
|
|
139 int tagstacklen = curwin->w_tagstacklen;
|
|
|
140 int cur_match = 0;
|
|
|
141 int cur_fnum = curbuf->b_fnum;
|
|
|
142 int oldtagstackidx = tagstackidx;
|
|
|
143 int prevtagstackidx = tagstackidx;
|
|
|
144 int prev_num_matches;
|
|
|
145 int new_tag = FALSE;
|
|
|
146 int other_name;
|
|
|
147 int i, j, k;
|
|
|
148 int idx;
|
|
|
149 int ic;
|
|
|
150 char_u *p;
|
|
|
151 char_u *name;
|
|
|
152 int no_regexp = FALSE;
|
|
|
153 int error_cur_match = 0;
|
|
|
154 char_u *command_end;
|
|
|
155 int save_pos = FALSE;
|
|
|
156 fmark_T saved_fmark;
|
|
|
157 int taglen;
|
|
|
158 #ifdef FEAT_CSCOPE
|
|
|
159 int jumped_to_tag = FALSE;
|
|
|
160 #endif
|
|
|
161 tagptrs_T tagp, tagp2;
|
|
|
162 int new_num_matches;
|
|
|
163 char_u **new_matches;
|
|
|
164 int attr;
|
|
|
165 int use_tagstack;
|
|
|
166 int skip_msg = FALSE;
|
|
|
167 char_u *buf_ffname = curbuf->b_ffname; /* name to use for
|
|
|
168 priority computation */
|
|
|
169
|
|
|
170 /* remember the matches for the last used tag */
|
|
|
171 static int num_matches = 0;
|
|
|
172 static int max_num_matches = 0; /* limit used for match search */
|
|
|
173 static char_u **matches = NULL;
|
|
|
174 static int flags;
|
|
|
175
|
|
359
|
176 #ifdef EXITFREE
|
|
|
177 if (type == DT_FREE)
|
|
|
178 {
|
|
|
179 /* remove the list of matches */
|
|
|
180 FreeWild(num_matches, matches);
|
|
|
181 # ifdef FEAT_CSCOPE
|
|
|
182 cs_free_tags();
|
|
|
183 # endif
|
|
|
184 num_matches = 0;
|
|
|
185 return FALSE;
|
|
|
186 }
|
|
|
187 #endif
|
|
|
188
|
|
7
|
189 if (type == DT_HELP)
|
|
|
190 {
|
|
|
191 type = DT_TAG;
|
|
|
192 no_regexp = TRUE;
|
|
|
193 }
|
|
|
194
|
|
|
195 prev_num_matches = num_matches;
|
|
|
196 free_string_option(nofile_fname);
|
|
|
197 nofile_fname = NULL;
|
|
|
198
|
|
|
199 /*
|
|
|
200 * Don't add a tag to the tagstack if 'tagstack' has been reset.
|
|
|
201 */
|
|
|
202 if ((!p_tgst && *tag != NUL))
|
|
|
203 {
|
|
|
204 use_tagstack = FALSE;
|
|
|
205 new_tag = TRUE;
|
|
|
206 }
|
|
|
207 else
|
|
|
208 {
|
|
|
209 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
210 if (g_do_tagpreview)
|
|
|
211 use_tagstack = FALSE;
|
|
|
212 else
|
|
|
213 #endif
|
|
|
214 use_tagstack = TRUE;
|
|
|
215
|
|
|
216 /* new pattern, add to the tag stack */
|
|
|
217 if (*tag && (type == DT_TAG || type == DT_SELECT || type == DT_JUMP
|
|
|
218 #ifdef FEAT_CSCOPE
|
|
|
219 || type == DT_CSCOPE
|
|
|
220 #endif
|
|
|
221 ))
|
|
|
222 {
|
|
|
223 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
224 if (g_do_tagpreview)
|
|
|
225 {
|
|
|
226 if (ptag_entry.tagname != NULL
|
|
|
227 && STRCMP(ptag_entry.tagname, tag) == 0)
|
|
|
228 {
|
|
|
229 /* Jumping to same tag: keep the current match, so that
|
|
|
230 * the CursorHold autocommand example works. */
|
|
|
231 cur_match = ptag_entry.cur_match;
|
|
|
232 cur_fnum = ptag_entry.cur_fnum;
|
|
|
233 }
|
|
|
234 else
|
|
|
235 {
|
|
|
236 vim_free(ptag_entry.tagname);
|
|
|
237 if ((ptag_entry.tagname = vim_strsave(tag)) == NULL)
|
|
|
238 goto end_do_tag;
|
|
|
239 }
|
|
|
240 }
|
|
|
241 else
|
|
|
242 #endif
|
|
|
243 {
|
|
|
244 /*
|
|
|
245 * If the last used entry is not at the top, delete all tag
|
|
|
246 * stack entries above it.
|
|
|
247 */
|
|
|
248 while (tagstackidx < tagstacklen)
|
|
|
249 vim_free(tagstack[--tagstacklen].tagname);
|
|
|
250
|
|
|
251 /* if the tagstack is full: remove oldest entry */
|
|
|
252 if (++tagstacklen > TAGSTACKSIZE)
|
|
|
253 {
|
|
|
254 tagstacklen = TAGSTACKSIZE;
|
|
|
255 vim_free(tagstack[0].tagname);
|
|
|
256 for (i = 1; i < tagstacklen; ++i)
|
|
|
257 tagstack[i - 1] = tagstack[i];
|
|
|
258 --tagstackidx;
|
|
|
259 }
|
|
|
260
|
|
|
261 /*
|
|
|
262 * put the tag name in the tag stack
|
|
|
263 */
|
|
|
264 if ((tagstack[tagstackidx].tagname = vim_strsave(tag)) == NULL)
|
|
|
265 {
|
|
|
266 curwin->w_tagstacklen = tagstacklen - 1;
|
|
|
267 goto end_do_tag;
|
|
|
268 }
|
|
|
269 curwin->w_tagstacklen = tagstacklen;
|
|
|
270
|
|
|
271 save_pos = TRUE; /* save the cursor position below */
|
|
|
272 }
|
|
|
273
|
|
|
274 new_tag = TRUE;
|
|
|
275 }
|
|
|
276 else
|
|
|
277 {
|
|
|
278 if (
|
|
|
279 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
280 g_do_tagpreview ? ptag_entry.tagname == NULL :
|
|
|
281 #endif
|
|
|
282 tagstacklen == 0)
|
|
|
283 {
|
|
|
284 /* empty stack */
|
|
|
285 EMSG(_(e_tagstack));
|
|
|
286 goto end_do_tag;
|
|
|
287 }
|
|
|
288
|
|
|
289 if (type == DT_POP) /* go to older position */
|
|
|
290 {
|
|
|
291 #ifdef FEAT_FOLDING
|
|
|
292 int old_KeyTyped = KeyTyped;
|
|
|
293 #endif
|
|
|
294 if ((tagstackidx -= count) < 0)
|
|
|
295 {
|
|
|
296 EMSG(_(bottommsg));
|
|
|
297 if (tagstackidx + count == 0)
|
|
|
298 {
|
|
|
299 /* We did [num]^T from the bottom of the stack */
|
|
|
300 tagstackidx = 0;
|
|
|
301 goto end_do_tag;
|
|
|
302 }
|
|
|
303 /* We weren't at the bottom of the stack, so jump all the
|
|
|
304 * way to the bottom now.
|
|
|
305 */
|
|
|
306 tagstackidx = 0;
|
|
|
307 }
|
|
|
308 else if (tagstackidx >= tagstacklen) /* count == 0? */
|
|
|
309 {
|
|
|
310 EMSG(_(topmsg));
|
|
|
311 goto end_do_tag;
|
|
|
312 }
|
|
|
313
|
|
|
314 /* Make a copy of the fmark, autocommands may invalidate the
|
|
|
315 * tagstack before it's used. */
|
|
|
316 saved_fmark = tagstack[tagstackidx].fmark;
|
|
|
317 if (saved_fmark.fnum != curbuf->b_fnum)
|
|
|
318 {
|
|
|
319 /*
|
|
|
320 * Jump to other file. If this fails (e.g. because the
|
|
|
321 * file was changed) keep original position in tag stack.
|
|
|
322 */
|
|
|
323 if (buflist_getfile(saved_fmark.fnum, saved_fmark.mark.lnum,
|
|
|
324 GETF_SETMARK, forceit) == FAIL)
|
|
|
325 {
|
|
|
326 tagstackidx = oldtagstackidx; /* back to old posn */
|
|
|
327 goto end_do_tag;
|
|
|
328 }
|
|
|
329 /* An BufReadPost autocommand may jump to the '" mark, but
|
|
|
330 * we don't what that here. */
|
|
|
331 curwin->w_cursor.lnum = saved_fmark.mark.lnum;
|
|
|
332 }
|
|
|
333 else
|
|
|
334 {
|
|
|
335 setpcmark();
|
|
|
336 curwin->w_cursor.lnum = saved_fmark.mark.lnum;
|
|
|
337 }
|
|
|
338 curwin->w_cursor.col = saved_fmark.mark.col;
|
|
|
339 curwin->w_set_curswant = TRUE;
|
|
|
340 check_cursor();
|
|
|
341 #ifdef FEAT_FOLDING
|
|
|
342 if ((fdo_flags & FDO_TAG) && old_KeyTyped)
|
|
|
343 foldOpenCursor();
|
|
|
344 #endif
|
|
|
345
|
|
|
346 /* remove the old list of matches */
|
|
|
347 FreeWild(num_matches, matches);
|
|
|
348 #ifdef FEAT_CSCOPE
|
|
|
349 cs_free_tags();
|
|
|
350 #endif
|
|
|
351 num_matches = 0;
|
|
|
352 goto end_do_tag;
|
|
|
353 }
|
|
|
354
|
|
|
355 if (type == DT_TAG)
|
|
|
356 {
|
|
|
357 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
358 if (g_do_tagpreview)
|
|
|
359 {
|
|
|
360 cur_match = ptag_entry.cur_match;
|
|
|
361 cur_fnum = ptag_entry.cur_fnum;
|
|
|
362 }
|
|
|
363 else
|
|
|
364 #endif
|
|
|
365 {
|
|
|
366 /* ":tag" (no argument): go to newer pattern */
|
|
|
367 save_pos = TRUE; /* save the cursor position below */
|
|
|
368 if ((tagstackidx += count - 1) >= tagstacklen)
|
|
|
369 {
|
|
|
370 /*
|
|
|
371 * Beyond the last one, just give an error message and
|
|
|
372 * go to the last one. Don't store the cursor
|
|
|
373 * postition.
|
|
|
374 */
|
|
|
375 tagstackidx = tagstacklen - 1;
|
|
|
376 EMSG(_(topmsg));
|
|
|
377 save_pos = FALSE;
|
|
|
378 }
|
|
|
379 else if (tagstackidx < 0) /* must have been count == 0 */
|
|
|
380 {
|
|
|
381 EMSG(_(bottommsg));
|
|
|
382 tagstackidx = 0;
|
|
|
383 goto end_do_tag;
|
|
|
384 }
|
|
|
385 cur_match = tagstack[tagstackidx].cur_match;
|
|
|
386 cur_fnum = tagstack[tagstackidx].cur_fnum;
|
|
|
387 }
|
|
|
388 new_tag = TRUE;
|
|
|
389 }
|
|
|
390 else /* go to other matching tag */
|
|
|
391 {
|
|
|
392 /* Save index for when selection is cancelled. */
|
|
|
393 prevtagstackidx = tagstackidx;
|
|
|
394
|
|
|
395 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
396 if (g_do_tagpreview)
|
|
|
397 {
|
|
|
398 cur_match = ptag_entry.cur_match;
|
|
|
399 cur_fnum = ptag_entry.cur_fnum;
|
|
|
400 }
|
|
|
401 else
|
|
|
402 #endif
|
|
|
403 {
|
|
|
404 if (--tagstackidx < 0)
|
|
|
405 tagstackidx = 0;
|
|
|
406 cur_match = tagstack[tagstackidx].cur_match;
|
|
|
407 cur_fnum = tagstack[tagstackidx].cur_fnum;
|
|
|
408 }
|
|
|
409 switch (type)
|
|
|
410 {
|
|
|
411 case DT_FIRST: cur_match = count - 1; break;
|
|
|
412 case DT_SELECT:
|
|
|
413 case DT_JUMP:
|
|
|
414 #ifdef FEAT_CSCOPE
|
|
|
415 case DT_CSCOPE:
|
|
|
416 #endif
|
|
|
417 case DT_LAST: cur_match = MAXCOL - 1; break;
|
|
|
418 case DT_NEXT: cur_match += count; break;
|
|
|
419 case DT_PREV: cur_match -= count; break;
|
|
|
420 }
|
|
|
421 if (cur_match >= MAXCOL)
|
|
|
422 cur_match = MAXCOL - 1;
|
|
|
423 else if (cur_match < 0)
|
|
|
424 {
|
|
|
425 EMSG(_("E425: Cannot go before first matching tag"));
|
|
|
426 skip_msg = TRUE;
|
|
|
427 cur_match = 0;
|
|
|
428 cur_fnum = curbuf->b_fnum;
|
|
|
429 }
|
|
|
430 }
|
|
|
431 }
|
|
|
432
|
|
|
433 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
434 if (g_do_tagpreview)
|
|
|
435 {
|
|
|
436 if (type != DT_SELECT && type != DT_JUMP)
|
|
|
437 {
|
|
|
438 ptag_entry.cur_match = cur_match;
|
|
|
439 ptag_entry.cur_fnum = cur_fnum;
|
|
|
440 }
|
|
|
441 }
|
|
|
442 else
|
|
|
443 #endif
|
|
|
444 {
|
|
|
445 /*
|
|
|
446 * For ":tag [arg]" or ":tselect" remember position before the jump.
|
|
|
447 */
|
|
|
448 saved_fmark = tagstack[tagstackidx].fmark;
|
|
|
449 if (save_pos)
|
|
|
450 {
|
|
|
451 tagstack[tagstackidx].fmark.mark = curwin->w_cursor;
|
|
|
452 tagstack[tagstackidx].fmark.fnum = curbuf->b_fnum;
|
|
|
453 }
|
|
|
454
|
|
|
455 /* Curwin will change in the call to jumpto_tag() if ":stag" was
|
|
|
456 * used or an autocommand jumps to another window; store value of
|
|
|
457 * tagstackidx now. */
|
|
|
458 curwin->w_tagstackidx = tagstackidx;
|
|
|
459 if (type != DT_SELECT && type != DT_JUMP)
|
|
|
460 {
|
|
|
461 curwin->w_tagstack[tagstackidx].cur_match = cur_match;
|
|
|
462 curwin->w_tagstack[tagstackidx].cur_fnum = cur_fnum;
|
|
|
463 }
|
|
|
464 }
|
|
|
465 }
|
|
|
466
|
|
|
467 /* When not using the current buffer get the name of buffer "cur_fnum".
|
|
|
468 * Makes sure that the tag order doesn't change when using a remembered
|
|
|
469 * position for "cur_match". */
|
|
|
470 if (cur_fnum != curbuf->b_fnum)
|
|
|
471 {
|
|
|
472 buf_T *buf = buflist_findnr(cur_fnum);
|
|
|
473
|
|
|
474 if (buf != NULL)
|
|
|
475 buf_ffname = buf->b_ffname;
|
|
|
476 }
|
|
|
477
|
|
|
478 /*
|
|
|
479 * Repeat searching for tags, when a file has not been found.
|
|
|
480 */
|
|
|
481 for (;;)
|
|
|
482 {
|
|
|
483 /*
|
|
|
484 * When desired match not found yet, try to find it (and others).
|
|
|
485 */
|
|
|
486 if (use_tagstack)
|
|
|
487 name = tagstack[tagstackidx].tagname;
|
|
|
488 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
489 else if (g_do_tagpreview)
|
|
|
490 name = ptag_entry.tagname;
|
|
|
491 #endif
|
|
|
492 else
|
|
|
493 name = tag;
|
|
|
494 other_name = (tagmatchname == NULL || STRCMP(tagmatchname, name) != 0);
|
|
|
495 if (new_tag
|
|
|
496 || (cur_match >= num_matches && max_num_matches != MAXCOL)
|
|
|
497 || other_name)
|
|
|
498 {
|
|
|
499 if (other_name)
|
|
|
500 {
|
|
|
501 vim_free(tagmatchname);
|
|
|
502 tagmatchname = vim_strsave(name);
|
|
|
503 }
|
|
|
504
|
|
|
505 if (type == DT_SELECT || type == DT_JUMP)
|
|
|
506 cur_match = MAXCOL - 1;
|
|
|
507 max_num_matches = cur_match + 1;
|
|
|
508
|
|
|
509 /* when the argument starts with '/', use it as a regexp */
|
|
|
510 if (!no_regexp && *name == '/')
|
|
|
511 {
|
|
|
512 flags = TAG_REGEXP;
|
|
|
513 ++name;
|
|
|
514 }
|
|
|
515 else
|
|
|
516 flags = TAG_NOIC;
|
|
|
517
|
|
|
518 #ifdef FEAT_CSCOPE
|
|
|
519 if (type == DT_CSCOPE)
|
|
|
520 flags = TAG_CSCOPE;
|
|
|
521 #endif
|
|
|
522 if (verbose)
|
|
|
523 flags |= TAG_VERBOSE;
|
|
|
524 if (find_tags(name, &new_num_matches, &new_matches, flags,
|
|
|
525 max_num_matches, buf_ffname) == OK
|
|
|
526 && new_num_matches < max_num_matches)
|
|
|
527 max_num_matches = MAXCOL; /* If less than max_num_matches
|
|
|
528 found: all matches found. */
|
|
|
529
|
|
|
530 /* If there already were some matches for the same name, move them
|
|
|
531 * to the start. Avoids that the order changes when using
|
|
|
532 * ":tnext" and jumping to another file. */
|
|
|
533 if (!new_tag && !other_name)
|
|
|
534 {
|
|
|
535 /* Find the position of each old match in the new list. Need
|
|
|
536 * to use parse_match() to find the tag line. */
|
|
|
537 idx = 0;
|
|
|
538 for (j = 0; j < num_matches; ++j)
|
|
|
539 {
|
|
|
540 parse_match(matches[j], &tagp);
|
|
|
541 for (i = idx; i < new_num_matches; ++i)
|
|
|
542 {
|
|
|
543 parse_match(new_matches[i], &tagp2);
|
|
|
544 if (STRCMP(tagp.tagname, tagp2.tagname) == 0)
|
|
|
545 {
|
|
|
546 p = new_matches[i];
|
|
|
547 for (k = i; k > idx; --k)
|
|
|
548 new_matches[k] = new_matches[k - 1];
|
|
|
549 new_matches[idx++] = p;
|
|
|
550 break;
|
|
|
551 }
|
|
|
552 }
|
|
|
553 }
|
|
|
554 }
|
|
|
555 FreeWild(num_matches, matches);
|
|
|
556 num_matches = new_num_matches;
|
|
|
557 matches = new_matches;
|
|
|
558 }
|
|
|
559
|
|
|
560 if (num_matches <= 0)
|
|
|
561 {
|
|
|
562 if (verbose)
|
|
|
563 EMSG2(_("E426: tag not found: %s"), name);
|
|
|
564 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
565 g_do_tagpreview = 0;
|
|
|
566 #endif
|
|
|
567 }
|
|
|
568 else
|
|
|
569 {
|
|
|
570 int ask_for_selection = FALSE;
|
|
|
571
|
|
|
572 #ifdef FEAT_CSCOPE
|
|
|
573 if (type == DT_CSCOPE && num_matches > 1)
|
|
|
574 {
|
|
|
575 cs_print_tags();
|
|
|
576 ask_for_selection = TRUE;
|
|
|
577 }
|
|
|
578 else
|
|
|
579 #endif
|
|
|
580 if (type == DT_SELECT || (type == DT_JUMP && num_matches > 1))
|
|
|
581 {
|
|
|
582 /*
|
|
|
583 * List all the matching tags.
|
|
|
584 * Assume that the first match indicates how long the tags can
|
|
|
585 * be, and align the file names to that.
|
|
|
586 */
|
|
|
587 parse_match(matches[0], &tagp);
|
|
|
588 taglen = (int)(tagp.tagname_end - tagp.tagname + 2);
|
|
|
589 if (taglen < 18)
|
|
|
590 taglen = 18;
|
|
|
591 if (taglen > Columns - 25)
|
|
|
592 taglen = MAXCOL;
|
|
|
593 if (msg_col == 0)
|
|
|
594 msg_didout = FALSE; /* overwrite previous message */
|
|
|
595 msg_start();
|
|
|
596 MSG_PUTS_ATTR(_(" # pri kind tag"), hl_attr(HLF_T));
|
|
|
597 msg_clr_eos();
|
|
|
598 taglen_advance(taglen);
|
|
|
599 MSG_PUTS_ATTR(_("file\n"), hl_attr(HLF_T));
|
|
|
600
|
|
|
601 for (i = 0; i < num_matches; ++i)
|
|
|
602 {
|
|
|
603 parse_match(matches[i], &tagp);
|
|
|
604 if (!new_tag && (
|
|
|
605 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
606 (g_do_tagpreview
|
|
|
607 && i == ptag_entry.cur_match) ||
|
|
|
608 #endif
|
|
|
609 (use_tagstack
|
|
|
610 && i == tagstack[tagstackidx].cur_match)))
|
|
|
611 *IObuff = '>';
|
|
|
612 else
|
|
|
613 *IObuff = ' ';
|
|
273
|
614 vim_snprintf((char *)IObuff + 1, IOSIZE - 1,
|
|
|
615 "%2d %s ", i + 1,
|
|
7
|
616 mt_names[matches[i][0] & MT_MASK]);
|
|
|
617 msg_puts(IObuff);
|
|
|
618 if (tagp.tagkind != NULL)
|
|
|
619 msg_outtrans_len(tagp.tagkind,
|
|
|
620 (int)(tagp.tagkind_end - tagp.tagkind));
|
|
|
621 msg_advance(13);
|
|
|
622 msg_outtrans_len_attr(tagp.tagname,
|
|
|
623 (int)(tagp.tagname_end - tagp.tagname),
|
|
|
624 hl_attr(HLF_T));
|
|
|
625 msg_putchar(' ');
|
|
|
626 taglen_advance(taglen);
|
|
|
627
|
|
|
628 /* Find out the actual file name. If it is long, truncate
|
|
|
629 * it and put "..." in the middle */
|
|
|
630 p = tag_full_fname(&tagp);
|
|
|
631 if (p != NULL)
|
|
|
632 {
|
|
|
633 msg_puts_long_attr(p, hl_attr(HLF_D));
|
|
|
634 vim_free(p);
|
|
|
635 }
|
|
|
636 if (msg_col > 0)
|
|
|
637 msg_putchar('\n');
|
|
|
638 msg_advance(15);
|
|
|
639
|
|
|
640 /* print any extra fields */
|
|
|
641 command_end = tagp.command_end;
|
|
|
642 if (command_end != NULL)
|
|
|
643 {
|
|
|
644 p = command_end + 3;
|
|
|
645 while (*p && *p != '\r' && *p != '\n')
|
|
|
646 {
|
|
|
647 while (*p == TAB)
|
|
|
648 ++p;
|
|
|
649
|
|
|
650 /* skip "file:" without a value (static tag) */
|
|
|
651 if (STRNCMP(p, "file:", 5) == 0
|
|
|
652 && vim_isspace(p[5]))
|
|
|
653 {
|
|
|
654 p += 5;
|
|
|
655 continue;
|
|
|
656 }
|
|
|
657 /* skip "kind:<kind>" and "<kind>" */
|
|
|
658 if (p == tagp.tagkind
|
|
|
659 || (p + 5 == tagp.tagkind
|
|
|
660 && STRNCMP(p, "kind:", 5) == 0))
|
|
|
661 {
|
|
|
662 p = tagp.tagkind_end;
|
|
|
663 continue;
|
|
|
664 }
|
|
|
665 /* print all other extra fields */
|
|
|
666 attr = hl_attr(HLF_CM);
|
|
|
667 while (*p && *p != '\r' && *p != '\n')
|
|
|
668 {
|
|
|
669 if (msg_col + ptr2cells(p) >= Columns)
|
|
|
670 {
|
|
|
671 msg_putchar('\n');
|
|
|
672 msg_advance(15);
|
|
|
673 }
|
|
|
674 p = msg_outtrans_one(p, attr);
|
|
|
675 if (*p == TAB)
|
|
|
676 {
|
|
|
677 msg_puts_attr((char_u *)" ", attr);
|
|
|
678 break;
|
|
|
679 }
|
|
|
680 if (*p == ':')
|
|
|
681 attr = 0;
|
|
|
682 }
|
|
|
683 }
|
|
|
684 if (msg_col > 15)
|
|
|
685 {
|
|
|
686 msg_putchar('\n');
|
|
|
687 msg_advance(15);
|
|
|
688 }
|
|
|
689 }
|
|
|
690 else
|
|
|
691 {
|
|
|
692 for (p = tagp.command;
|
|
|
693 *p && *p != '\r' && *p != '\n'; ++p)
|
|
|
694 ;
|
|
|
695 command_end = p;
|
|
|
696 }
|
|
|
697
|
|
|
698 /*
|
|
|
699 * Put the info (in several lines) at column 15.
|
|
|
700 * Don't display "/^" and "?^".
|
|
|
701 */
|
|
|
702 p = tagp.command;
|
|
|
703 if (*p == '/' || *p == '?')
|
|
|
704 {
|
|
|
705 ++p;
|
|
|
706 if (*p == '^')
|
|
|
707 ++p;
|
|
|
708 }
|
|
|
709 /* Remove leading whitespace from pattern */
|
|
|
710 while (p != command_end && vim_isspace(*p))
|
|
|
711 ++p;
|
|
|
712
|
|
|
713 while (p != command_end)
|
|
|
714 {
|
|
|
715 if (msg_col + (*p == TAB ? 1 : ptr2cells(p)) > Columns)
|
|
|
716 msg_putchar('\n');
|
|
|
717 msg_advance(15);
|
|
|
718
|
|
|
719 /* skip backslash used for escaping command char */
|
|
|
720 if (*p == '\\' && *(p + 1) == *tagp.command)
|
|
|
721 ++p;
|
|
|
722
|
|
|
723 if (*p == TAB)
|
|
|
724 {
|
|
|
725 msg_putchar(' ');
|
|
|
726 ++p;
|
|
|
727 }
|
|
|
728 else
|
|
|
729 p = msg_outtrans_one(p, 0);
|
|
|
730
|
|
|
731 /* don't display the "$/;\"" and "$?;\"" */
|
|
|
732 if (p == command_end - 2 && *p == '$'
|
|
|
733 && *(p + 1) == *tagp.command)
|
|
|
734 break;
|
|
|
735 /* don't display matching '/' or '?' */
|
|
|
736 if (p == command_end - 1 && *p == *tagp.command
|
|
|
737 && (*p == '/' || *p == '?'))
|
|
|
738 break;
|
|
|
739 }
|
|
|
740 if (msg_col)
|
|
|
741 msg_putchar('\n');
|
|
|
742 ui_breakcheck();
|
|
|
743 if (got_int)
|
|
|
744 {
|
|
|
745 got_int = FALSE; /* only stop the listing */
|
|
|
746 break;
|
|
|
747 }
|
|
|
748 }
|
|
|
749 ask_for_selection = TRUE;
|
|
|
750 }
|
|
|
751
|
|
|
752 if (ask_for_selection == TRUE)
|
|
|
753 {
|
|
|
754 /*
|
|
|
755 * Ask to select a tag from the list.
|
|
|
756 */
|
|
373
|
757 i = prompt_for_number(NULL);
|
|
7
|
758 if (i <= 0 || i > num_matches || got_int)
|
|
|
759 {
|
|
|
760 /* no valid choice: don't change anything */
|
|
|
761 if (use_tagstack)
|
|
|
762 {
|
|
|
763 tagstack[tagstackidx].fmark = saved_fmark;
|
|
|
764 tagstackidx = prevtagstackidx;
|
|
|
765 }
|
|
|
766 #ifdef FEAT_CSCOPE
|
|
|
767 cs_free_tags();
|
|
|
768 jumped_to_tag = TRUE;
|
|
|
769 #endif
|
|
|
770 break;
|
|
|
771 }
|
|
|
772 cur_match = i - 1;
|
|
|
773 }
|
|
|
774
|
|
|
775 if (cur_match >= num_matches)
|
|
|
776 {
|
|
|
777 /* Avoid giving this error when a file wasn't found and we're
|
|
|
778 * looking for a match in another file, which wasn't found.
|
|
|
779 * There will be an EMSG("file doesn't exist") below then. */
|
|
|
780 if ((type == DT_NEXT || type == DT_FIRST)
|
|
|
781 && nofile_fname == NULL)
|
|
|
782 {
|
|
|
783 if (num_matches == 1)
|
|
|
784 EMSG(_("E427: There is only one matching tag"));
|
|
|
785 else
|
|
|
786 EMSG(_("E428: Cannot go beyond last matching tag"));
|
|
|
787 skip_msg = TRUE;
|
|
|
788 }
|
|
|
789 cur_match = num_matches - 1;
|
|
|
790 }
|
|
|
791 if (use_tagstack)
|
|
|
792 {
|
|
|
793 tagstack[tagstackidx].cur_match = cur_match;
|
|
|
794 tagstack[tagstackidx].cur_fnum = cur_fnum;
|
|
|
795 ++tagstackidx;
|
|
|
796 }
|
|
|
797 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
798 else if (g_do_tagpreview)
|
|
|
799 {
|
|
|
800 ptag_entry.cur_match = cur_match;
|
|
|
801 ptag_entry.cur_fnum = cur_fnum;
|
|
|
802 }
|
|
|
803 #endif
|
|
|
804
|
|
|
805 /*
|
|
|
806 * Only when going to try the next match, report that the previous
|
|
|
807 * file didn't exist. Otherwise an EMSG() is given below.
|
|
|
808 */
|
|
|
809 if (nofile_fname != NULL && error_cur_match != cur_match)
|
|
273
|
810 smsg((char_u *)_("File \"%s\" does not exist"), nofile_fname);
|
|
7
|
811
|
|
|
812
|
|
|
813 ic = (matches[cur_match][0] & MT_IC_OFF);
|
|
|
814 if (type != DT_SELECT && type != DT_JUMP
|
|
|
815 #ifdef FEAT_CSCOPE
|
|
|
816 && type != DT_CSCOPE
|
|
|
817 #endif
|
|
|
818 && (num_matches > 1 || ic)
|
|
|
819 && !skip_msg)
|
|
|
820 {
|
|
|
821 /* Give an indication of the number of matching tags */
|
|
|
822 sprintf((char *)IObuff, _("tag %d of %d%s"),
|
|
|
823 cur_match + 1,
|
|
|
824 num_matches,
|
|
|
825 max_num_matches != MAXCOL ? _(" or more") : "");
|
|
|
826 if (ic)
|
|
|
827 STRCAT(IObuff, _(" Using tag with different case!"));
|
|
|
828 if ((num_matches > prev_num_matches || new_tag)
|
|
|
829 && num_matches > 1)
|
|
|
830 {
|
|
|
831 if (ic)
|
|
|
832 msg_attr(IObuff, hl_attr(HLF_W));
|
|
|
833 else
|
|
|
834 msg(IObuff);
|
|
|
835 msg_scroll = TRUE; /* don't overwrite this message */
|
|
|
836 }
|
|
|
837 else
|
|
|
838 give_warning(IObuff, ic);
|
|
|
839 if (ic && !msg_scrolled && msg_silent == 0)
|
|
|
840 {
|
|
|
841 out_flush();
|
|
|
842 ui_delay(1000L, TRUE);
|
|
|
843 }
|
|
|
844 }
|
|
|
845
|
|
589
|
846 #ifdef FEAT_AUTOCMD
|
|
|
847 /* Let the SwapExists event know what tag we are jumping to. */
|
|
|
848 vim_snprintf((char *)IObuff, IOSIZE, ":ta %s\r", name);
|
|
|
849 set_vim_var_string(VV_SWAPCOMMAND, IObuff, -1);
|
|
|
850 #endif
|
|
|
851
|
|
7
|
852 /*
|
|
|
853 * Jump to the desired match.
|
|
|
854 */
|
|
589
|
855 i = jumpto_tag(matches[cur_match], forceit, type != DT_CSCOPE);
|
|
|
856
|
|
|
857 #ifdef FEAT_AUTOCMD
|
|
|
858 set_vim_var_string(VV_SWAPCOMMAND, NULL, -1);
|
|
|
859 #endif
|
|
|
860
|
|
|
861 if (i == NOTAGFILE)
|
|
7
|
862 {
|
|
|
863 /* File not found: try again with another matching tag */
|
|
|
864 if ((type == DT_PREV && cur_match > 0)
|
|
|
865 || ((type == DT_TAG || type == DT_NEXT
|
|
|
866 || type == DT_FIRST)
|
|
|
867 && (max_num_matches != MAXCOL
|
|
|
868 || cur_match < num_matches - 1)))
|
|
|
869 {
|
|
|
870 error_cur_match = cur_match;
|
|
|
871 if (use_tagstack)
|
|
|
872 --tagstackidx;
|
|
|
873 if (type == DT_PREV)
|
|
|
874 --cur_match;
|
|
|
875 else
|
|
|
876 {
|
|
|
877 type = DT_NEXT;
|
|
|
878 ++cur_match;
|
|
|
879 }
|
|
|
880 continue;
|
|
|
881 }
|
|
|
882 EMSG2(_("E429: File \"%s\" does not exist"), nofile_fname);
|
|
|
883 }
|
|
|
884 else
|
|
|
885 {
|
|
|
886 /* We may have jumped to another window, check that
|
|
|
887 * tagstackidx is still valid. */
|
|
|
888 if (use_tagstack && tagstackidx > curwin->w_tagstacklen)
|
|
|
889 tagstackidx = curwin->w_tagstackidx;
|
|
|
890 #ifdef FEAT_CSCOPE
|
|
|
891 jumped_to_tag = TRUE;
|
|
|
892 #endif
|
|
|
893 }
|
|
|
894 }
|
|
|
895 break;
|
|
|
896 }
|
|
|
897
|
|
|
898 end_do_tag:
|
|
|
899 /* Only store the new index when using the tagstack and it's valid. */
|
|
|
900 if (use_tagstack && tagstackidx <= curwin->w_tagstacklen)
|
|
|
901 curwin->w_tagstackidx = tagstackidx;
|
|
|
902 #ifdef FEAT_WINDOWS
|
|
|
903 postponed_split = 0; /* don't split next time */
|
|
|
904 #endif
|
|
|
905
|
|
|
906 #ifdef FEAT_CSCOPE
|
|
|
907 return jumped_to_tag;
|
|
|
908 #else
|
|
|
909 return FALSE;
|
|
|
910 #endif
|
|
|
911 }
|
|
|
912
|
|
|
913 /*
|
|
|
914 * Free cached tags.
|
|
|
915 */
|
|
|
916 void
|
|
|
917 tag_freematch()
|
|
|
918 {
|
|
|
919 vim_free(tagmatchname);
|
|
|
920 tagmatchname = NULL;
|
|
|
921 }
|
|
|
922
|
|
|
923 static void
|
|
|
924 taglen_advance(l)
|
|
|
925 int l;
|
|
|
926 {
|
|
|
927 if (l == MAXCOL)
|
|
|
928 {
|
|
|
929 msg_putchar('\n');
|
|
|
930 msg_advance(24);
|
|
|
931 }
|
|
|
932 else
|
|
|
933 msg_advance(13 + l);
|
|
|
934 }
|
|
|
935
|
|
|
936 /*
|
|
|
937 * Print the tag stack
|
|
|
938 */
|
|
|
939 /*ARGSUSED*/
|
|
|
940 void
|
|
|
941 do_tags(eap)
|
|
|
942 exarg_T *eap;
|
|
|
943 {
|
|
|
944 int i;
|
|
|
945 char_u *name;
|
|
|
946 taggy_T *tagstack = curwin->w_tagstack;
|
|
|
947 int tagstackidx = curwin->w_tagstackidx;
|
|
|
948 int tagstacklen = curwin->w_tagstacklen;
|
|
|
949
|
|
|
950 /* Highlight title */
|
|
|
951 MSG_PUTS_TITLE(_("\n # TO tag FROM line in file/text"));
|
|
|
952 for (i = 0; i < tagstacklen; ++i)
|
|
|
953 {
|
|
|
954 if (tagstack[i].tagname != NULL)
|
|
|
955 {
|
|
|
956 name = fm_getname(&(tagstack[i].fmark), 30);
|
|
|
957 if (name == NULL) /* file name not available */
|
|
|
958 continue;
|
|
|
959
|
|
|
960 msg_putchar('\n');
|
|
|
961 sprintf((char *)IObuff, "%c%2d %2d %-15s %5ld ",
|
|
|
962 i == tagstackidx ? '>' : ' ',
|
|
|
963 i + 1,
|
|
|
964 tagstack[i].cur_match + 1,
|
|
|
965 tagstack[i].tagname,
|
|
|
966 tagstack[i].fmark.mark.lnum);
|
|
|
967 msg_outtrans(IObuff);
|
|
|
968 msg_outtrans_attr(name, tagstack[i].fmark.fnum == curbuf->b_fnum
|
|
|
969 ? hl_attr(HLF_D) : 0);
|
|
|
970 vim_free(name);
|
|
|
971 }
|
|
|
972 out_flush(); /* show one line at a time */
|
|
|
973 }
|
|
|
974 if (tagstackidx == tagstacklen) /* idx at top of stack */
|
|
|
975 MSG_PUTS("\n>");
|
|
|
976 }
|
|
|
977
|
|
|
978 /* When not using a CR for line separator, use vim_fgets() to read tag lines.
|
|
|
979 * For the Mac use tag_fgets(). It can handle any line separator, but is much
|
|
|
980 * slower than vim_fgets().
|
|
|
981 */
|
|
|
982 #ifndef USE_CR
|
|
|
983 # define tag_fgets vim_fgets
|
|
|
984 #endif
|
|
|
985
|
|
|
986 #ifdef FEAT_TAG_BINS
|
|
|
987 static int tag_strnicmp __ARGS((char_u *s1, char_u *s2, size_t len));
|
|
|
988
|
|
|
989 /*
|
|
|
990 * Compare two strings, for length "len", ignoring case the ASCII way.
|
|
|
991 * return 0 for match, < 0 for smaller, > 0 for bigger
|
|
|
992 * Make sure case is folded to uppercase in comparison (like for 'sort -f')
|
|
|
993 */
|
|
|
994 static int
|
|
|
995 tag_strnicmp(s1, s2, len)
|
|
|
996 char_u *s1;
|
|
|
997 char_u *s2;
|
|
|
998 size_t len;
|
|
|
999 {
|
|
|
1000 int i;
|
|
|
1001
|
|
|
1002 while (len > 0)
|
|
|
1003 {
|
|
|
1004 i = (int)TOUPPER_ASC(*s1) - (int)TOUPPER_ASC(*s2);
|
|
|
1005 if (i != 0)
|
|
|
1006 return i; /* this character different */
|
|
|
1007 if (*s1 == NUL)
|
|
|
1008 break; /* strings match until NUL */
|
|
|
1009 ++s1;
|
|
|
1010 ++s2;
|
|
|
1011 --len;
|
|
|
1012 }
|
|
|
1013 return 0; /* strings match */
|
|
|
1014 }
|
|
|
1015 #endif
|
|
|
1016
|
|
|
1017 /*
|
|
|
1018 * Structure to hold info about the tag pattern being used.
|
|
|
1019 */
|
|
|
1020 typedef struct
|
|
|
1021 {
|
|
|
1022 char_u *pat; /* the pattern */
|
|
|
1023 int len; /* length of pat[] */
|
|
|
1024 char_u *head; /* start of pattern head */
|
|
|
1025 int headlen; /* length of head[] */
|
|
|
1026 regmatch_T regmatch; /* regexp program, may be NULL */
|
|
|
1027 } pat_T;
|
|
|
1028
|
|
|
1029 static void prepare_pats __ARGS((pat_T *pats, int has_re));
|
|
|
1030
|
|
|
1031 /*
|
|
|
1032 * Extract info from the tag search pattern "pats->pat".
|
|
|
1033 */
|
|
|
1034 static void
|
|
|
1035 prepare_pats(pats, has_re)
|
|
|
1036 pat_T *pats;
|
|
|
1037 int has_re;
|
|
|
1038 {
|
|
|
1039 pats->head = pats->pat;
|
|
|
1040 pats->headlen = pats->len;
|
|
|
1041 if (has_re)
|
|
|
1042 {
|
|
|
1043 /* When the pattern starts with '^' or "\\<", binary searching can be
|
|
|
1044 * used (much faster). */
|
|
|
1045 if (pats->pat[0] == '^')
|
|
|
1046 pats->head = pats->pat + 1;
|
|
|
1047 else if (pats->pat[0] == '\\' && pats->pat[1] == '<')
|
|
|
1048 pats->head = pats->pat + 2;
|
|
|
1049 if (pats->head == pats->pat)
|
|
|
1050 pats->headlen = 0;
|
|
|
1051 else
|
|
|
1052 for (pats->headlen = 0; pats->head[pats->headlen] != NUL;
|
|
|
1053 ++pats->headlen)
|
|
|
1054 if (vim_strchr((char_u *)(p_magic ? ".[~*\\$" : "\\$"),
|
|
|
1055 pats->head[pats->headlen]) != NULL)
|
|
|
1056 break;
|
|
|
1057 if (p_tl != 0 && pats->headlen > p_tl) /* adjust for 'taglength' */
|
|
|
1058 pats->headlen = p_tl;
|
|
|
1059 }
|
|
|
1060
|
|
|
1061 if (has_re)
|
|
|
1062 pats->regmatch.regprog = vim_regcomp(pats->pat, p_magic ? RE_MAGIC : 0);
|
|
|
1063 else
|
|
|
1064 pats->regmatch.regprog = NULL;
|
|
|
1065 }
|
|
|
1066
|
|
|
1067 /*
|
|
|
1068 * find_tags() - search for tags in tags files
|
|
|
1069 *
|
|
|
1070 * Return FAIL if search completely failed (*num_matches will be 0, *matchesp
|
|
|
1071 * will be NULL), OK otherwise.
|
|
|
1072 *
|
|
|
1073 * There is a priority in which type of tag is recognized.
|
|
|
1074 *
|
|
|
1075 * 6. A static or global tag with a full matching tag for the current file.
|
|
|
1076 * 5. A global tag with a full matching tag for another file.
|
|
|
1077 * 4. A static tag with a full matching tag for another file.
|
|
|
1078 * 3. A static or global tag with an ignore-case matching tag for the
|
|
|
1079 * current file.
|
|
|
1080 * 2. A global tag with an ignore-case matching tag for another file.
|
|
|
1081 * 1. A static tag with an ignore-case matching tag for another file.
|
|
|
1082 *
|
|
|
1083 * Tags in an emacs-style tags file are always global.
|
|
|
1084 *
|
|
|
1085 * flags:
|
|
|
1086 * TAG_HELP only search for help tags
|
|
|
1087 * TAG_NAMES only return name of tag
|
|
|
1088 * TAG_REGEXP use "pat" as a regexp
|
|
|
1089 * TAG_NOIC don't always ignore case
|
|
|
1090 * TAG_KEEP_LANG keep language
|
|
|
1091 */
|
|
|
1092 int
|
|
|
1093 find_tags(pat, num_matches, matchesp, flags, mincount, buf_ffname)
|
|
|
1094 char_u *pat; /* pattern to search for */
|
|
|
1095 int *num_matches; /* return: number of matches found */
|
|
|
1096 char_u ***matchesp; /* return: array of matches found */
|
|
|
1097 int flags;
|
|
|
1098 int mincount; /* MAXCOL: find all matches
|
|
|
1099 other: minimal number of matches */
|
|
|
1100 char_u *buf_ffname; /* name of buffer for priority */
|
|
|
1101 {
|
|
|
1102 FILE *fp;
|
|
|
1103 char_u *lbuf; /* line buffer */
|
|
|
1104 char_u *tag_fname; /* name of tag file */
|
|
|
1105 int first_file; /* trying first tag file */
|
|
|
1106 tagptrs_T tagp;
|
|
|
1107 int did_open = FALSE; /* did open a tag file */
|
|
|
1108 int stop_searching = FALSE; /* stop when match found or error */
|
|
|
1109 int retval = FAIL; /* return value */
|
|
|
1110 int is_static; /* current tag line is static */
|
|
|
1111 int is_current; /* file name matches */
|
|
|
1112 int eof = FALSE; /* found end-of-file */
|
|
|
1113 char_u *p;
|
|
|
1114 char_u *s;
|
|
|
1115 int i;
|
|
|
1116 #ifdef FEAT_TAG_BINS
|
|
|
1117 struct tag_search_info /* Binary search file offsets */
|
|
|
1118 {
|
|
|
1119 off_t low_offset; /* offset for first char of first line that
|
|
|
1120 could match */
|
|
|
1121 off_t high_offset; /* offset of char after last line that could
|
|
|
1122 match */
|
|
|
1123 off_t curr_offset; /* Current file offset in search range */
|
|
|
1124 off_t curr_offset_used; /* curr_offset used when skipping back */
|
|
|
1125 off_t match_offset; /* Where the binary search found a tag */
|
|
|
1126 int low_char; /* first char at low_offset */
|
|
|
1127 int high_char; /* first char at high_offset */
|
|
|
1128 } search_info;
|
|
|
1129 off_t filesize;
|
|
|
1130 int tagcmp;
|
|
|
1131 off_t offset;
|
|
|
1132 int round;
|
|
|
1133 #endif
|
|
|
1134 enum
|
|
|
1135 {
|
|
|
1136 TS_START, /* at start of file */
|
|
|
1137 TS_LINEAR /* linear searching forward, till EOF */
|
|
|
1138 #ifdef FEAT_TAG_BINS
|
|
|
1139 , TS_BINARY, /* binary searching */
|
|
|
1140 TS_SKIP_BACK, /* skipping backwards */
|
|
|
1141 TS_STEP_FORWARD /* stepping forwards */
|
|
|
1142 #endif
|
|
|
1143 } state; /* Current search state */
|
|
|
1144
|
|
|
1145 int cmplen;
|
|
|
1146 int match; /* matches */
|
|
|
1147 int match_no_ic = 0;/* matches with rm_ic == FALSE */
|
|
|
1148 int match_re; /* match with regexp */
|
|
|
1149 int matchoff = 0;
|
|
|
1150
|
|
|
1151 #ifdef FEAT_EMACS_TAGS
|
|
|
1152 /*
|
|
|
1153 * Stack for included emacs-tags file.
|
|
|
1154 * It has a fixed size, to truncate cyclic includes. jw
|
|
|
1155 */
|
|
|
1156 # define INCSTACK_SIZE 42
|
|
|
1157 struct
|
|
|
1158 {
|
|
|
1159 FILE *fp;
|
|
|
1160 char_u *etag_fname;
|
|
|
1161 } incstack[INCSTACK_SIZE];
|
|
|
1162
|
|
|
1163 int incstack_idx = 0; /* index in incstack */
|
|
|
1164 char_u *ebuf; /* aditional buffer for etag fname */
|
|
|
1165 int is_etag; /* current file is emaces style */
|
|
|
1166 #endif
|
|
|
1167
|
|
|
1168 struct match_found
|
|
|
1169 {
|
|
|
1170 int len; /* nr of chars of match[] to be compared */
|
|
|
1171 char_u match[1]; /* actually longer */
|
|
|
1172 } *mfp, *mfp2;
|
|
|
1173 garray_T ga_match[MT_COUNT];
|
|
|
1174 int match_count = 0; /* number of matches found */
|
|
|
1175 char_u **matches;
|
|
|
1176 int mtt;
|
|
|
1177 int len;
|
|
|
1178 int help_save;
|
|
|
1179 #ifdef FEAT_MULTI_LANG
|
|
|
1180 int help_pri = 0;
|
|
|
1181 char_u *help_lang_find = NULL; /* lang to be found */
|
|
|
1182 char_u help_lang[3]; /* lang of current tags file */
|
|
|
1183 char_u *saved_pat = NULL; /* copy of pat[] */
|
|
|
1184 #endif
|
|
|
1185
|
|
|
1186 /* Use two sets of variables for the pattern: "orgpat" holds the values
|
|
|
1187 * for the original pattern and "convpat" converted from 'encoding' to
|
|
|
1188 * encoding of the tags file. "pats" point to either one of these. */
|
|
|
1189 pat_T *pats;
|
|
|
1190 pat_T orgpat; /* holds unconverted pattern info */
|
|
|
1191 #ifdef FEAT_MBYTE
|
|
|
1192 pat_T convpat; /* holds converted pattern info */
|
|
|
1193 vimconv_T vimconv;
|
|
|
1194 #endif
|
|
|
1195
|
|
|
1196 #ifdef FEAT_TAG_BINS
|
|
|
1197 int findall = (mincount == MAXCOL || mincount == TAG_MANY);
|
|
|
1198 /* find all matching tags */
|
|
|
1199 int sort_error = FALSE; /* tags file not sorted */
|
|
|
1200 int linear; /* do a linear search */
|
|
|
1201 int sortic = FALSE; /* tag file sorted in nocase */
|
|
|
1202 #endif
|
|
|
1203 int line_error = FALSE; /* syntax error */
|
|
|
1204 int has_re = (flags & TAG_REGEXP); /* regexp used */
|
|
|
1205 int help_only = (flags & TAG_HELP);
|
|
|
1206 int name_only = (flags & TAG_NAMES);
|
|
|
1207 int noic = (flags & TAG_NOIC);
|
|
|
1208 int get_it_again = FALSE;
|
|
|
1209 #ifdef FEAT_CSCOPE
|
|
|
1210 int use_cscope = (flags & TAG_CSCOPE);
|
|
|
1211 #endif
|
|
|
1212 int verbose = (flags & TAG_VERBOSE);
|
|
|
1213
|
|
|
1214 help_save = curbuf->b_help;
|
|
|
1215 orgpat.pat = pat;
|
|
|
1216 pats = &orgpat;
|
|
|
1217 #ifdef FEAT_MBYTE
|
|
|
1218 vimconv.vc_type = CONV_NONE;
|
|
|
1219 #endif
|
|
|
1220
|
|
|
1221 /*
|
|
|
1222 * Allocate memory for the buffers that are used
|
|
|
1223 */
|
|
|
1224 lbuf = alloc(LSIZE);
|
|
|
1225 tag_fname = alloc(MAXPATHL + 1);
|
|
|
1226 #ifdef FEAT_EMACS_TAGS
|
|
|
1227 ebuf = alloc(LSIZE);
|
|
|
1228 #endif
|
|
|
1229 for (mtt = 0; mtt < MT_COUNT; ++mtt)
|
|
|
1230 ga_init2(&ga_match[mtt], (int)sizeof(struct match_found *), 100);
|
|
|
1231
|
|
|
1232 /* check for out of memory situation */
|
|
|
1233 if (lbuf == NULL || tag_fname == NULL
|
|
|
1234 #ifdef FEAT_EMACS_TAGS
|
|
|
1235 || ebuf == NULL
|
|
|
1236 #endif
|
|
|
1237 )
|
|
|
1238 goto findtag_end;
|
|
|
1239
|
|
|
1240 #ifdef FEAT_CSCOPE
|
|
|
1241 STRCPY(tag_fname, "from cscope"); /* for error messages */
|
|
|
1242 #endif
|
|
|
1243
|
|
|
1244 /*
|
|
|
1245 * Initialize a few variables
|
|
|
1246 */
|
|
|
1247 if (help_only) /* want tags from help file */
|
|
|
1248 curbuf->b_help = TRUE; /* will be restored later */
|
|
|
1249
|
|
|
1250 pats->len = (int)STRLEN(pat);
|
|
|
1251 #ifdef FEAT_MULTI_LANG
|
|
|
1252 if (curbuf->b_help)
|
|
|
1253 {
|
|
|
1254 /* When "@ab" is specified use only the "ab" language, otherwise
|
|
|
1255 * search all languages. */
|
|
|
1256 if (pats->len > 3 && pat[pats->len - 3] == '@'
|
|
|
1257 && ASCII_ISALPHA(pat[pats->len - 2])
|
|
|
1258 && ASCII_ISALPHA(pat[pats->len - 1]))
|
|
|
1259 {
|
|
|
1260 saved_pat = vim_strnsave(pat, pats->len - 3);
|
|
|
1261 if (saved_pat != NULL)
|
|
|
1262 {
|
|
|
1263 help_lang_find = &pat[pats->len - 2];
|
|
|
1264 pats->pat = saved_pat;
|
|
|
1265 pats->len -= 3;
|
|
|
1266 }
|
|
|
1267 }
|
|
|
1268 }
|
|
|
1269 #endif
|
|
|
1270 if (p_tl != 0 && pats->len > p_tl) /* adjust for 'taglength' */
|
|
|
1271 pats->len = p_tl;
|
|
|
1272
|
|
|
1273 prepare_pats(pats, has_re);
|
|
|
1274
|
|
|
1275 #ifdef FEAT_TAG_BINS
|
|
|
1276 /* This is only to avoid a compiler warning for using search_info
|
|
|
1277 * uninitialised. */
|
|
|
1278 vim_memset(&search_info, 0, (size_t)1);
|
|
|
1279 #endif
|
|
|
1280
|
|
413
|
1281 /*
|
|
|
1282 * When finding a specified number of matches, first try with matching
|
|
|
1283 * case, so binary search can be used, and try ignore-case matches in a
|
|
|
1284 * second loop.
|
|
|
1285 * When finding all matches, 'tagbsearch' is off, or there is no fixed
|
|
|
1286 * string to look for, ignore case right away to avoid going though the
|
|
|
1287 * tags files twice.
|
|
|
1288 * When the tag file is case-fold sorted, it is either one or the other.
|
|
|
1289 * Only ignore case when TAG_NOIC not used or 'ignorecase' set.
|
|
|
1290 */
|
|
7
|
1291 #ifdef FEAT_TAG_BINS
|
|
|
1292 pats->regmatch.rm_ic = ((p_ic || !noic)
|
|
413
|
1293 && (findall || pats->headlen == 0 || !p_tbs));
|
|
7
|
1294 for (round = 1; round <= 2; ++round)
|
|
|
1295 {
|
|
|
1296 linear = (pats->headlen == 0 || !p_tbs || round == 2);
|
|
|
1297 #else
|
|
|
1298 pats->regmatch.rm_ic = (p_ic || !noic);
|
|
|
1299 #endif
|
|
|
1300
|
|
|
1301 /*
|
|
|
1302 * Try tag file names from tags option one by one.
|
|
|
1303 */
|
|
|
1304 for (first_file = TRUE;
|
|
|
1305 #ifdef FEAT_CSCOPE
|
|
|
1306 use_cscope ||
|
|
|
1307 #endif
|
|
|
1308 get_tagfname(first_file, tag_fname) == OK; first_file = FALSE)
|
|
|
1309 {
|
|
|
1310 /*
|
|
|
1311 * A file that doesn't exist is silently ignored. Only when not a
|
|
|
1312 * single file is found, an error message is given (further on).
|
|
|
1313 */
|
|
|
1314 #ifdef FEAT_CSCOPE
|
|
|
1315 if (use_cscope)
|
|
|
1316 fp = NULL; /* avoid GCC warning */
|
|
|
1317 else
|
|
|
1318 #endif
|
|
|
1319 {
|
|
|
1320 #ifdef FEAT_MULTI_LANG
|
|
|
1321 if (curbuf->b_help)
|
|
|
1322 {
|
|
|
1323 /* Prefer help tags according to 'helplang'. Put the
|
|
|
1324 * two-letter language name in help_lang[]. */
|
|
|
1325 i = STRLEN(tag_fname);
|
|
|
1326 if (i > 3 && tag_fname[i - 3] == '-')
|
|
|
1327 STRCPY(help_lang, tag_fname + i - 2);
|
|
|
1328 else
|
|
|
1329 STRCPY(help_lang, "en");
|
|
|
1330
|
|
|
1331 /* When searching for a specific language skip tags files
|
|
|
1332 * for other languages. */
|
|
|
1333 if (help_lang_find != NULL
|
|
|
1334 && STRICMP(help_lang, help_lang_find) != 0)
|
|
|
1335 continue;
|
|
|
1336
|
|
|
1337 /* For CTRL-] in a help file prefer a match with the same
|
|
|
1338 * language. */
|
|
|
1339 if ((flags & TAG_KEEP_LANG)
|
|
|
1340 && help_lang_find == NULL
|
|
|
1341 && curbuf->b_fname != NULL
|
|
|
1342 && (i = STRLEN(curbuf->b_fname)) > 4
|
|
|
1343 && curbuf->b_fname[i - 1] == 'x'
|
|
|
1344 && curbuf->b_fname[i - 4] == '.'
|
|
|
1345 && STRNICMP(curbuf->b_fname + i - 3, help_lang, 2) == 0)
|
|
|
1346 help_pri = 0;
|
|
|
1347 else
|
|
|
1348 {
|
|
|
1349 help_pri = 1;
|
|
|
1350 for (s = p_hlg; *s != NUL; ++s)
|
|
|
1351 {
|
|
|
1352 if (STRNICMP(s, help_lang, 2) == 0)
|
|
|
1353 break;
|
|
|
1354 ++help_pri;
|
|
|
1355 if ((s = vim_strchr(s, ',')) == NULL)
|
|
|
1356 break;
|
|
|
1357 }
|
|
|
1358 if (s == NULL || *s == NUL)
|
|
|
1359 {
|
|
|
1360 /* Language not in 'helplang': use last, prefer English,
|
|
|
1361 * unless found already. */
|
|
|
1362 ++help_pri;
|
|
|
1363 if (STRICMP(help_lang, "en") != 0)
|
|
|
1364 ++help_pri;
|
|
|
1365 }
|
|
|
1366 }
|
|
|
1367 }
|
|
|
1368 #endif
|
|
|
1369
|
|
|
1370 if ((fp = mch_fopen((char *)tag_fname, "r")) == NULL)
|
|
|
1371 continue;
|
|
|
1372
|
|
|
1373 if (p_verbose >= 5)
|
|
292
|
1374 {
|
|
|
1375 verbose_enter();
|
|
273
|
1376 smsg((char_u *)_("Searching tags file %s"), tag_fname);
|
|
292
|
1377 verbose_leave();
|
|
|
1378 }
|
|
7
|
1379 }
|
|
|
1380 did_open = TRUE; /* remember that we found at least one file */
|
|
|
1381
|
|
|
1382 state = TS_START; /* we're at the start of the file */
|
|
|
1383 #ifdef FEAT_EMACS_TAGS
|
|
|
1384 is_etag = 0; /* default is: not emacs style */
|
|
|
1385 #endif
|
|
|
1386
|
|
|
1387 /*
|
|
|
1388 * Read and parse the lines in the file one by one
|
|
|
1389 */
|
|
|
1390 for (;;)
|
|
|
1391 {
|
|
|
1392 line_breakcheck(); /* check for CTRL-C typed */
|
|
|
1393 #ifdef FEAT_INS_EXPAND
|
|
|
1394 if ((flags & TAG_INS_COMP)) /* Double brackets for gcc */
|
|
464
|
1395 ins_compl_check_keys(30);
|
|
449
|
1396 if (got_int || compl_interrupted)
|
|
7
|
1397 #else
|
|
|
1398 if (got_int)
|
|
|
1399 #endif
|
|
|
1400 {
|
|
|
1401 stop_searching = TRUE;
|
|
|
1402 break;
|
|
|
1403 }
|
|
|
1404 /* When mincount is TAG_MANY, stop when enough matches have been
|
|
|
1405 * found (for completion). */
|
|
|
1406 if (mincount == TAG_MANY && match_count >= TAG_MANY)
|
|
|
1407 {
|
|
|
1408 stop_searching = TRUE;
|
|
|
1409 retval = OK;
|
|
|
1410 break;
|
|
|
1411 }
|
|
|
1412 if (get_it_again)
|
|
|
1413 goto line_read_in;
|
|
|
1414 #ifdef FEAT_TAG_BINS
|
|
|
1415 /*
|
|
|
1416 * For binary search: compute the next offset to use.
|
|
|
1417 */
|
|
|
1418 if (state == TS_BINARY)
|
|
|
1419 {
|
|
|
1420 offset = search_info.low_offset + ((search_info.high_offset
|
|
|
1421 - search_info.low_offset) / 2);
|
|
|
1422 if (offset == search_info.curr_offset)
|
|
|
1423 break; /* End the binary search without a match. */
|
|
|
1424 else
|
|
|
1425 search_info.curr_offset = offset;
|
|
|
1426 }
|
|
|
1427
|
|
|
1428 /*
|
|
|
1429 * Skipping back (after a match during binary search).
|
|
|
1430 */
|
|
|
1431 else if (state == TS_SKIP_BACK)
|
|
|
1432 {
|
|
|
1433 search_info.curr_offset -= LSIZE * 2;
|
|
|
1434 if (search_info.curr_offset < 0)
|
|
|
1435 {
|
|
|
1436 search_info.curr_offset = 0;
|
|
|
1437 rewind(fp);
|
|
|
1438 state = TS_STEP_FORWARD;
|
|
|
1439 }
|
|
|
1440 }
|
|
|
1441
|
|
|
1442 /*
|
|
|
1443 * When jumping around in the file, first read a line to find the
|
|
|
1444 * start of the next line.
|
|
|
1445 */
|
|
|
1446 if (state == TS_BINARY || state == TS_SKIP_BACK)
|
|
|
1447 {
|
|
|
1448 /* Adjust the search file offset to the correct position */
|
|
|
1449 search_info.curr_offset_used = search_info.curr_offset;
|
|
|
1450 #ifdef HAVE_FSEEKO
|
|
|
1451 fseeko(fp, search_info.curr_offset, SEEK_SET);
|
|
|
1452 #else
|
|
|
1453 fseek(fp, (long)search_info.curr_offset, SEEK_SET);
|
|
|
1454 #endif
|
|
|
1455 eof = tag_fgets(lbuf, LSIZE, fp);
|
|
|
1456 if (!eof && search_info.curr_offset != 0)
|
|
|
1457 {
|
|
|
1458 search_info.curr_offset = ftell(fp);
|
|
|
1459 if (search_info.curr_offset == search_info.high_offset)
|
|
|
1460 {
|
|
|
1461 /* oops, gone a bit too far; try from low offset */
|
|
|
1462 #ifdef HAVE_FSEEKO
|
|
|
1463 fseeko(fp, search_info.low_offset, SEEK_SET);
|
|
|
1464 #else
|
|
|
1465 fseek(fp, (long)search_info.low_offset, SEEK_SET);
|
|
|
1466 #endif
|
|
|
1467 search_info.curr_offset = search_info.low_offset;
|
|
|
1468 }
|
|
|
1469 eof = tag_fgets(lbuf, LSIZE, fp);
|
|
|
1470 }
|
|
|
1471 /* skip empty and blank lines */
|
|
|
1472 while (!eof && vim_isblankline(lbuf))
|
|
|
1473 {
|
|
|
1474 search_info.curr_offset = ftell(fp);
|
|
|
1475 eof = tag_fgets(lbuf, LSIZE, fp);
|
|
|
1476 }
|
|
|
1477 if (eof)
|
|
|
1478 {
|
|
|
1479 /* Hit end of file. Skip backwards. */
|
|
|
1480 state = TS_SKIP_BACK;
|
|
|
1481 search_info.match_offset = ftell(fp);
|
|
|
1482 search_info.curr_offset = search_info.curr_offset_used;
|
|
|
1483 continue;
|
|
|
1484 }
|
|
|
1485 }
|
|
|
1486
|
|
|
1487 /*
|
|
|
1488 * Not jumping around in the file: Read the next line.
|
|
|
1489 */
|
|
|
1490 else
|
|
|
1491 #endif
|
|
|
1492 {
|
|
|
1493 /* skip empty and blank lines */
|
|
|
1494 do
|
|
|
1495 {
|
|
|
1496 #ifdef FEAT_CSCOPE
|
|
|
1497 if (use_cscope)
|
|
|
1498 eof = cs_fgets(lbuf, LSIZE);
|
|
|
1499 else
|
|
|
1500 #endif
|
|
|
1501 eof = tag_fgets(lbuf, LSIZE, fp);
|
|
|
1502 } while (!eof && vim_isblankline(lbuf));
|
|
|
1503
|
|
|
1504 if (eof)
|
|
|
1505 {
|
|
|
1506 #ifdef FEAT_EMACS_TAGS
|
|
|
1507 if (incstack_idx) /* this was an included file */
|
|
|
1508 {
|
|
|
1509 --incstack_idx;
|
|
|
1510 fclose(fp); /* end of this file ... */
|
|
|
1511 fp = incstack[incstack_idx].fp;
|
|
|
1512 STRCPY(tag_fname, incstack[incstack_idx].etag_fname);
|
|
|
1513 vim_free(incstack[incstack_idx].etag_fname);
|
|
|
1514 is_etag = 1; /* (only etags can include) */
|
|
|
1515 continue; /* ... continue with parent file */
|
|
|
1516 }
|
|
|
1517 else
|
|
|
1518 #endif
|
|
|
1519 break; /* end of file */
|
|
|
1520 }
|
|
|
1521 }
|
|
|
1522 line_read_in:
|
|
|
1523
|
|
|
1524 #ifdef FEAT_EMACS_TAGS
|
|
|
1525 /*
|
|
|
1526 * Emacs tags line with CTRL-L: New file name on next line.
|
|
|
1527 * The file name is followed by a ','.
|
|
|
1528 */
|
|
|
1529 if (*lbuf == Ctrl_L) /* remember etag file name in ebuf */
|
|
|
1530 {
|
|
|
1531 is_etag = 1; /* in case at the start */
|
|
|
1532 state = TS_LINEAR;
|
|
|
1533 if (!tag_fgets(ebuf, LSIZE, fp))
|
|
|
1534 {
|
|
|
1535 for (p = ebuf; *p && *p != ','; p++)
|
|
|
1536 ;
|
|
|
1537 *p = NUL;
|
|
|
1538
|
|
|
1539 /*
|
|
|
1540 * atoi(p+1) is the number of bytes before the next ^L
|
|
|
1541 * unless it is an include statement.
|
|
|
1542 */
|
|
|
1543 if (STRNCMP(p + 1, "include", 7) == 0
|
|
|
1544 && incstack_idx < INCSTACK_SIZE)
|
|
|
1545 {
|
|
|
1546 /* Save current "fp" and "tag_fname" in the stack. */
|
|
|
1547 if ((incstack[incstack_idx].etag_fname =
|
|
|
1548 vim_strsave(tag_fname)) != NULL)
|
|
|
1549 {
|
|
|
1550 char_u *fullpath_ebuf;
|
|
|
1551
|
|
|
1552 incstack[incstack_idx].fp = fp;
|
|
|
1553 fp = NULL;
|
|
|
1554
|
|
|
1555 /* Figure out "tag_fname" and "fp" to use for
|
|
|
1556 * included file. */
|
|
|
1557 fullpath_ebuf = expand_tag_fname(ebuf,
|
|
|
1558 tag_fname, FALSE);
|
|
|
1559 if (fullpath_ebuf != NULL)
|
|
|
1560 {
|
|
|
1561 fp = mch_fopen((char *)fullpath_ebuf, "r");
|
|
|
1562 if (fp != NULL)
|
|
|
1563 {
|
|
|
1564 if (STRLEN(fullpath_ebuf) > LSIZE)
|
|
|
1565 EMSG2(_("E430: Tag file path truncated for %s\n"), ebuf);
|
|
418
|
1566 vim_strncpy(tag_fname, fullpath_ebuf,
|
|
|
1567 MAXPATHL);
|
|
7
|
1568 ++incstack_idx;
|
|
|
1569 is_etag = 0; /* we can include anything */
|
|
|
1570 }
|
|
|
1571 vim_free(fullpath_ebuf);
|
|
|
1572 }
|
|
|
1573 if (fp == NULL)
|
|
|
1574 {
|
|
|
1575 /* Can't open the included file, skip it and
|
|
|
1576 * restore old value of "fp". */
|
|
|
1577 fp = incstack[incstack_idx].fp;
|
|
|
1578 vim_free(incstack[incstack_idx].etag_fname);
|
|
|
1579 }
|
|
|
1580 }
|
|
|
1581 }
|
|
|
1582 }
|
|
|
1583 continue;
|
|
|
1584 }
|
|
|
1585 #endif
|
|
|
1586
|
|
|
1587 /*
|
|
|
1588 * When still at the start of the file, check for Emacs tags file
|
|
|
1589 * format, and for "not sorted" flag.
|
|
|
1590 */
|
|
|
1591 if (state == TS_START)
|
|
|
1592 {
|
|
|
1593 #ifdef FEAT_TAG_BINS
|
|
|
1594 /*
|
|
|
1595 * When there is no tag head, or ignoring case, need to do a
|
|
|
1596 * linear search.
|
|
|
1597 * When no "!_TAG_" is found, default to binary search. If
|
|
|
1598 * the tag file isn't sorted, the second loop will find it.
|
|
|
1599 * When "!_TAG_FILE_SORTED" found: start binary search if
|
|
|
1600 * flag set.
|
|
|
1601 * For cscope, it's always linear.
|
|
|
1602 */
|
|
|
1603 # ifdef FEAT_CSCOPE
|
|
|
1604 if (linear || use_cscope)
|
|
|
1605 # else
|
|
|
1606 if (linear)
|
|
|
1607 # endif
|
|
|
1608 state = TS_LINEAR;
|
|
|
1609 else if (STRNCMP(lbuf, "!_TAG_", 6) > 0)
|
|
|
1610 state = TS_BINARY;
|
|
|
1611 else if (STRNCMP(lbuf, "!_TAG_FILE_SORTED\t", 18) == 0)
|
|
|
1612 {
|
|
|
1613 /* Check sorted flag */
|
|
|
1614 if (lbuf[18] == '1')
|
|
|
1615 state = TS_BINARY;
|
|
|
1616 else if (lbuf[18] == '2')
|
|
|
1617 {
|
|
|
1618 state = TS_BINARY;
|
|
|
1619 sortic = TRUE;
|
|
|
1620 pats->regmatch.rm_ic = (p_ic || !noic);
|
|
|
1621 }
|
|
|
1622 else
|
|
|
1623 state = TS_LINEAR;
|
|
|
1624 }
|
|
|
1625
|
|
|
1626 if (state == TS_BINARY && pats->regmatch.rm_ic && !sortic)
|
|
|
1627 {
|
|
|
1628 /* binary search won't work for ignoring case, use linear
|
|
|
1629 * search. */
|
|
|
1630 linear = TRUE;
|
|
|
1631 state = TS_LINEAR;
|
|
|
1632 }
|
|
|
1633 #else
|
|
|
1634 state = TS_LINEAR;
|
|
|
1635 #endif
|
|
|
1636
|
|
|
1637 #ifdef FEAT_TAG_BINS
|
|
|
1638 /*
|
|
|
1639 * When starting a binary search, get the size of the file and
|
|
|
1640 * compute the first offset.
|
|
|
1641 */
|
|
|
1642 if (state == TS_BINARY)
|
|
|
1643 {
|
|
|
1644 /* Get the tag file size (don't use mch_fstat(), it's not
|
|
|
1645 * portable). */
|
|
|
1646 if ((filesize = lseek(fileno(fp),
|
|
|
1647 (off_t)0L, SEEK_END)) <= 0)
|
|
|
1648 state = TS_LINEAR;
|
|
|
1649 else
|
|
|
1650 {
|
|
|
1651 lseek(fileno(fp), (off_t)0L, SEEK_SET);
|
|
|
1652
|
|
|
1653 /* Calculate the first read offset in the file. Start
|
|
|
1654 * the search in the middle of the file. */
|
|
|
1655 search_info.low_offset = 0;
|
|
|
1656 search_info.low_char = 0;
|
|
|
1657 search_info.high_offset = filesize;
|
|
|
1658 search_info.curr_offset = 0;
|
|
|
1659 search_info.high_char = 0xff;
|
|
|
1660 }
|
|
|
1661 continue;
|
|
|
1662 }
|
|
|
1663 #endif
|
|
|
1664 }
|
|
|
1665
|
|
|
1666 #ifdef FEAT_MBYTE
|
|
|
1667 if (lbuf[0] == '!' && pats == &orgpat
|
|
|
1668 && STRNCMP(lbuf, "!_TAG_FILE_ENCODING\t", 20) == 0)
|
|
|
1669 {
|
|
|
1670 /* Convert the search pattern from 'encoding' to the
|
|
|
1671 * specified encoding. */
|
|
|
1672 for (p = lbuf + 20; *p > ' ' && *p < 127; ++p)
|
|
|
1673 ;
|
|
|
1674 *p = NUL;
|
|
|
1675 convert_setup(&vimconv, p_enc, lbuf + 20);
|
|
|
1676 if (vimconv.vc_type != CONV_NONE)
|
|
|
1677 {
|
|
|
1678 convpat.pat = string_convert(&vimconv, pats->pat, NULL);
|
|
|
1679 if (convpat.pat != NULL)
|
|
|
1680 {
|
|
|
1681 pats = &convpat;
|
|
|
1682 pats->len = (int)STRLEN(pats->pat);
|
|
|
1683 prepare_pats(pats, has_re);
|
|
|
1684 pats->regmatch.rm_ic = orgpat.regmatch.rm_ic;
|
|
|
1685 }
|
|
|
1686 }
|
|
|
1687
|
|
|
1688 /* Prepare for converting a match the other way around. */
|
|
|
1689 convert_setup(&vimconv, lbuf + 20, p_enc);
|
|
|
1690 continue;
|
|
|
1691 }
|
|
|
1692 #endif
|
|
|
1693
|
|
|
1694 /*
|
|
|
1695 * Figure out where the different strings are in this line.
|
|
|
1696 * For "normal" tags: Do a quick check if the tag matches.
|
|
|
1697 * This speeds up tag searching a lot!
|
|
|
1698 */
|
|
|
1699 if (pats->headlen
|
|
|
1700 #ifdef FEAT_EMACS_TAGS
|
|
|
1701 && !is_etag
|
|
|
1702 #endif
|
|
|
1703 )
|
|
|
1704 {
|
|
|
1705 tagp.tagname = lbuf;
|
|
|
1706 #ifdef FEAT_TAG_ANYWHITE
|
|
|
1707 tagp.tagname_end = skiptowhite(lbuf);
|
|
|
1708 if (*tagp.tagname_end == NUL) /* corrupted tag line */
|
|
|
1709 #else
|
|
|
1710 tagp.tagname_end = vim_strchr(lbuf, TAB);
|
|
|
1711 if (tagp.tagname_end == NULL) /* corrupted tag line */
|
|
|
1712 #endif
|
|
|
1713 {
|
|
|
1714 line_error = TRUE;
|
|
|
1715 break;
|
|
|
1716 }
|
|
|
1717
|
|
|
1718 #ifdef FEAT_TAG_OLDSTATIC
|
|
|
1719 /*
|
|
|
1720 * Check for old style static tag: "file:tag file .."
|
|
|
1721 */
|
|
|
1722 tagp.fname = NULL;
|
|
|
1723 for (p = lbuf; p < tagp.tagname_end; ++p)
|
|
|
1724 {
|
|
|
1725 if (*p == ':')
|
|
|
1726 {
|
|
|
1727 if (tagp.fname == NULL)
|
|
|
1728 #ifdef FEAT_TAG_ANYWHITE
|
|
|
1729 tagp.fname = skipwhite(tagp.tagname_end);
|
|
|
1730 #else
|
|
|
1731 tagp.fname = tagp.tagname_end + 1;
|
|
|
1732 #endif
|
|
|
1733 if ( fnamencmp(lbuf, tagp.fname, p - lbuf) == 0
|
|
|
1734 #ifdef FEAT_TAG_ANYWHITE
|
|
|
1735 && vim_iswhite(tagp.fname[p - lbuf])
|
|
|
1736 #else
|
|
|
1737 && tagp.fname[p - lbuf] == TAB
|
|
|
1738 #endif
|
|
|
1739 )
|
|
|
1740 {
|
|
|
1741 /* found one */
|
|
|
1742 tagp.tagname = p + 1;
|
|
|
1743 break;
|
|
|
1744 }
|
|
|
1745 }
|
|
|
1746 }
|
|
|
1747 #endif
|
|
|
1748
|
|
|
1749 /*
|
|
|
1750 * Skip this line if the length of the tag is different and
|
|
|
1751 * there is no regexp, or the tag is too short.
|
|
|
1752 */
|
|
|
1753 cmplen = (int)(tagp.tagname_end - tagp.tagname);
|
|
|
1754 if (p_tl != 0 && cmplen > p_tl) /* adjust for 'taglength' */
|
|
|
1755 cmplen = p_tl;
|
|
|
1756 if (has_re && pats->headlen < cmplen)
|
|
|
1757 cmplen = pats->headlen;
|
|
|
1758 else if (state == TS_LINEAR && pats->headlen != cmplen)
|
|
|
1759 continue;
|
|
|
1760
|
|
|
1761 #ifdef FEAT_TAG_BINS
|
|
|
1762 if (state == TS_BINARY)
|
|
|
1763 {
|
|
|
1764 /*
|
|
|
1765 * Simplistic check for unsorted tags file.
|
|
|
1766 */
|
|
|
1767 i = (int)tagp.tagname[0];
|
|
|
1768 if (sortic)
|
|
|
1769 i = (int)TOUPPER_ASC(tagp.tagname[0]);
|
|
|
1770 if (i < search_info.low_char || i > search_info.high_char)
|
|
|
1771 sort_error = TRUE;
|
|
|
1772
|
|
|
1773 /*
|
|
|
1774 * Compare the current tag with the searched tag.
|
|
|
1775 */
|
|
|
1776 if (sortic)
|
|
|
1777 tagcmp = tag_strnicmp(tagp.tagname, pats->head,
|
|
|
1778 (size_t)cmplen);
|
|
|
1779 else
|
|
|
1780 tagcmp = STRNCMP(tagp.tagname, pats->head, cmplen);
|
|
|
1781
|
|
|
1782 /*
|
|
|
1783 * A match with a shorter tag means to search forward.
|
|
|
1784 * A match with a longer tag means to search backward.
|
|
|
1785 */
|
|
|
1786 if (tagcmp == 0)
|
|
|
1787 {
|
|
|
1788 if (cmplen < pats->headlen)
|
|
|
1789 tagcmp = -1;
|
|
|
1790 else if (cmplen > pats->headlen)
|
|
|
1791 tagcmp = 1;
|
|
|
1792 }
|
|
|
1793
|
|
|
1794 if (tagcmp == 0)
|
|
|
1795 {
|
|
|
1796 /* We've located the tag, now skip back and search
|
|
|
1797 * forward until the first matching tag is found.
|
|
|
1798 */
|
|
|
1799 state = TS_SKIP_BACK;
|
|
|
1800 search_info.match_offset = search_info.curr_offset;
|
|
|
1801 continue;
|
|
|
1802 }
|
|
|
1803 if (tagcmp < 0)
|
|
|
1804 {
|
|
|
1805 search_info.curr_offset = ftell(fp);
|
|
|
1806 if (search_info.curr_offset < search_info.high_offset)
|
|
|
1807 {
|
|
|
1808 search_info.low_offset = search_info.curr_offset;
|
|
|
1809 if (sortic)
|
|
|
1810 search_info.low_char =
|
|
|
1811 TOUPPER_ASC(tagp.tagname[0]);
|
|
|
1812 else
|
|
|
1813 search_info.low_char = tagp.tagname[0];
|
|
|
1814 continue;
|
|
|
1815 }
|
|
|
1816 }
|
|
|
1817 if (tagcmp > 0
|
|
|
1818 && search_info.curr_offset != search_info.high_offset)
|
|
|
1819 {
|
|
|
1820 search_info.high_offset = search_info.curr_offset;
|
|
|
1821 if (sortic)
|
|
|
1822 search_info.high_char =
|
|
|
1823 TOUPPER_ASC(tagp.tagname[0]);
|
|
|
1824 else
|
|
|
1825 search_info.high_char = tagp.tagname[0];
|
|
|
1826 continue;
|
|
|
1827 }
|
|
|
1828
|
|
|
1829 /* No match yet and are at the end of the binary search. */
|
|
|
1830 break;
|
|
|
1831 }
|
|
|
1832 else if (state == TS_SKIP_BACK)
|
|
|
1833 {
|
|
|
1834 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
|
|
|
1835 state = TS_STEP_FORWARD;
|
|
|
1836 else
|
|
|
1837 /* Have to skip back more. Restore the curr_offset
|
|
|
1838 * used, otherwise we get stuck at a long line. */
|
|
|
1839 search_info.curr_offset = search_info.curr_offset_used;
|
|
|
1840 continue;
|
|
|
1841 }
|
|
|
1842 else if (state == TS_STEP_FORWARD)
|
|
|
1843 {
|
|
|
1844 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
|
|
|
1845 {
|
|
|
1846 if ((off_t)ftell(fp) > search_info.match_offset)
|
|
|
1847 break; /* past last match */
|
|
|
1848 else
|
|
|
1849 continue; /* before first match */
|
|
|
1850 }
|
|
|
1851 }
|
|
|
1852 else
|
|
|
1853 #endif
|
|
|
1854 /* skip this match if it can't match */
|
|
|
1855 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
|
|
|
1856 continue;
|
|
|
1857
|
|
|
1858 /*
|
|
|
1859 * Can be a matching tag, isolate the file name and command.
|
|
|
1860 */
|
|
|
1861 #ifdef FEAT_TAG_OLDSTATIC
|
|
|
1862 if (tagp.fname == NULL)
|
|
|
1863 #endif
|
|
|
1864 #ifdef FEAT_TAG_ANYWHITE
|
|
|
1865 tagp.fname = skipwhite(tagp.tagname_end);
|
|
|
1866 #else
|
|
|
1867 tagp.fname = tagp.tagname_end + 1;
|
|
|
1868 #endif
|
|
|
1869 #ifdef FEAT_TAG_ANYWHITE
|
|
|
1870 tagp.fname_end = skiptowhite(tagp.fname);
|
|
|
1871 tagp.command = skipwhite(tagp.fname_end);
|
|
|
1872 if (*tagp.command == NUL)
|
|
|
1873 #else
|
|
|
1874 tagp.fname_end = vim_strchr(tagp.fname, TAB);
|
|
|
1875 tagp.command = tagp.fname_end + 1;
|
|
|
1876 if (tagp.fname_end == NULL)
|
|
|
1877 #endif
|
|
|
1878 i = FAIL;
|
|
|
1879 else
|
|
|
1880 i = OK;
|
|
|
1881 }
|
|
|
1882 else
|
|
|
1883 i = parse_tag_line(lbuf,
|
|
|
1884 #ifdef FEAT_EMACS_TAGS
|
|
|
1885 is_etag,
|
|
|
1886 #endif
|
|
|
1887 &tagp);
|
|
|
1888 if (i == FAIL)
|
|
|
1889 {
|
|
|
1890 line_error = TRUE;
|
|
|
1891 break;
|
|
|
1892 }
|
|
|
1893
|
|
|
1894 #ifdef FEAT_EMACS_TAGS
|
|
|
1895 if (is_etag)
|
|
|
1896 tagp.fname = ebuf;
|
|
|
1897 #endif
|
|
|
1898 /*
|
|
|
1899 * First try matching with the pattern literally (also when it is
|
|
|
1900 * a regexp).
|
|
|
1901 */
|
|
|
1902 cmplen = (int)(tagp.tagname_end - tagp.tagname);
|
|
|
1903 if (p_tl != 0 && cmplen > p_tl) /* adjust for 'taglength' */
|
|
|
1904 cmplen = p_tl;
|
|
|
1905 /* if tag length does not match, don't try comparing */
|
|
|
1906 if (pats->len != cmplen)
|
|
|
1907 match = FALSE;
|
|
|
1908 else
|
|
|
1909 {
|
|
|
1910 if (pats->regmatch.rm_ic)
|
|
|
1911 {
|
|
|
1912 match = (MB_STRNICMP(tagp.tagname, pats->pat, cmplen) == 0);
|
|
|
1913 if (match)
|
|
|
1914 match_no_ic = (STRNCMP(tagp.tagname, pats->pat,
|
|
|
1915 cmplen) == 0);
|
|
|
1916 }
|
|
|
1917 else
|
|
|
1918 match = (STRNCMP(tagp.tagname, pats->pat, cmplen) == 0);
|
|
|
1919 }
|
|
|
1920
|
|
|
1921 /*
|
|
|
1922 * Has a regexp: Also find tags matching regexp.
|
|
|
1923 */
|
|
|
1924 match_re = FALSE;
|
|
|
1925 if (!match && pats->regmatch.regprog != NULL)
|
|
|
1926 {
|
|
|
1927 int cc;
|
|
|
1928
|
|
|
1929 cc = *tagp.tagname_end;
|
|
|
1930 *tagp.tagname_end = NUL;
|
|
|
1931 match = vim_regexec(&pats->regmatch, tagp.tagname, (colnr_T)0);
|
|
|
1932 if (match)
|
|
|
1933 {
|
|
|
1934 matchoff = (int)(pats->regmatch.startp[0] - tagp.tagname);
|
|
|
1935 if (pats->regmatch.rm_ic)
|
|
|
1936 {
|
|
|
1937 pats->regmatch.rm_ic = FALSE;
|
|
|
1938 match_no_ic = vim_regexec(&pats->regmatch, tagp.tagname,
|
|
|
1939 (colnr_T)0);
|
|
|
1940 pats->regmatch.rm_ic = TRUE;
|
|
|
1941 }
|
|
|
1942 }
|
|
|
1943 *tagp.tagname_end = cc;
|
|
|
1944 match_re = TRUE;
|
|
|
1945 }
|
|
|
1946
|
|
|
1947 /*
|
|
|
1948 * If a match is found, add it to ga_match[].
|
|
|
1949 */
|
|
|
1950 if (match)
|
|
|
1951 {
|
|
|
1952 #ifdef FEAT_CSCOPE
|
|
|
1953 if (use_cscope)
|
|
|
1954 {
|
|
|
1955 /* Don't change the ordering, always use the same table. */
|
|
|
1956 mtt = MT_GL_OTH;
|
|
|
1957 }
|
|
|
1958 else
|
|
|
1959 #endif
|
|
|
1960 {
|
|
|
1961 /* Decide in which array to store this match. */
|
|
|
1962 is_current = test_for_current(
|
|
|
1963 #ifdef FEAT_EMACS_TAGS
|
|
|
1964 is_etag,
|
|
|
1965 #endif
|
|
|
1966 tagp.fname, tagp.fname_end, tag_fname,
|
|
|
1967 buf_ffname);
|
|
|
1968 #ifdef FEAT_EMACS_TAGS
|
|
|
1969 is_static = FALSE;
|
|
|
1970 if (!is_etag) /* emacs tags are never static */
|
|
|
1971 #endif
|
|
|
1972 {
|
|
|
1973 #ifdef FEAT_TAG_OLDSTATIC
|
|
|
1974 if (tagp.tagname != lbuf)
|
|
|
1975 is_static = TRUE; /* detected static tag before */
|
|
|
1976 else
|
|
|
1977 #endif
|
|
|
1978 is_static = test_for_static(&tagp);
|
|
|
1979 }
|
|
|
1980
|
|
|
1981 /* decide in which of the sixteen tables to store this
|
|
|
1982 * match */
|
|
|
1983 if (is_static)
|
|
|
1984 {
|
|
|
1985 if (is_current)
|
|
|
1986 mtt = MT_ST_CUR;
|
|
|
1987 else
|
|
|
1988 mtt = MT_ST_OTH;
|
|
|
1989 }
|
|
|
1990 else
|
|
|
1991 {
|
|
|
1992 if (is_current)
|
|
|
1993 mtt = MT_GL_CUR;
|
|
|
1994 else
|
|
|
1995 mtt = MT_GL_OTH;
|
|
|
1996 }
|
|
|
1997 if (pats->regmatch.rm_ic && !match_no_ic)
|
|
|
1998 mtt += MT_IC_OFF;
|
|
|
1999 if (match_re)
|
|
|
2000 mtt += MT_RE_OFF;
|
|
|
2001 }
|
|
|
2002
|
|
|
2003 /*
|
|
|
2004 * Add the found match in ga_match[mtt], avoiding duplicates.
|
|
|
2005 * Store the info we need later, which depends on the kind of
|
|
|
2006 * tags we are dealing with.
|
|
|
2007 */
|
|
|
2008 if (ga_grow(&ga_match[mtt], 1) == OK)
|
|
|
2009 {
|
|
|
2010 #ifdef FEAT_MBYTE
|
|
|
2011 char_u *conv_line = NULL;
|
|
|
2012 char_u *lbuf_line = lbuf;
|
|
|
2013
|
|
|
2014 if (vimconv.vc_type != CONV_NONE)
|
|
|
2015 {
|
|
|
2016 /* Convert the tag line from the encoding of the tags
|
|
|
2017 * file to 'encoding'. Then parse the line again. */
|
|
|
2018 conv_line = string_convert(&vimconv, lbuf, NULL);
|
|
|
2019 if (conv_line != NULL)
|
|
|
2020 {
|
|
|
2021 if (parse_tag_line(conv_line,
|
|
|
2022 #ifdef FEAT_EMACS_TAGS
|
|
|
2023 is_etag,
|
|
|
2024 #endif
|
|
|
2025 &tagp) == OK)
|
|
|
2026 lbuf_line = conv_line;
|
|
|
2027 else
|
|
|
2028 /* doesn't work, go back to unconverted line. */
|
|
|
2029 (void)parse_tag_line(lbuf,
|
|
|
2030 #ifdef FEAT_EMACS_TAGS
|
|
|
2031 is_etag,
|
|
|
2032 #endif
|
|
|
2033 &tagp);
|
|
|
2034 }
|
|
|
2035 }
|
|
|
2036 #else
|
|
|
2037 # define lbuf_line lbuf
|
|
|
2038 #endif
|
|
|
2039 if (help_only)
|
|
|
2040 {
|
|
|
2041 #ifdef FEAT_MULTI_LANG
|
|
|
2042 # define ML_EXTRA 3
|
|
|
2043 #else
|
|
|
2044 # define ML_EXTRA 0
|
|
|
2045 #endif
|
|
|
2046 /*
|
|
|
2047 * Append the help-heuristic number after the
|
|
|
2048 * tagname, for sorting it later.
|
|
|
2049 */
|
|
|
2050 *tagp.tagname_end = NUL;
|
|
|
2051 len = (int)(tagp.tagname_end - tagp.tagname);
|
|
|
2052 mfp = (struct match_found *)
|
|
|
2053 alloc((int)sizeof(struct match_found) + len
|
|
|
2054 + 10 + ML_EXTRA);
|
|
|
2055 if (mfp != NULL)
|
|
|
2056 {
|
|
|
2057 /* "len" includes the language and the NUL, but
|
|
|
2058 * not the priority. */
|
|
|
2059 mfp->len = len + ML_EXTRA + 1;
|
|
|
2060 #define ML_HELP_LEN 6
|
|
|
2061 p = mfp->match;
|
|
|
2062 STRCPY(p, tagp.tagname);
|
|
|
2063 #ifdef FEAT_MULTI_LANG
|
|
|
2064 p[len] = '@';
|
|
|
2065 STRCPY(p + len + 1, help_lang);
|
|
|
2066 #endif
|
|
|
2067 sprintf((char *)p + len + 1 + ML_EXTRA, "%06d",
|
|
|
2068 help_heuristic(tagp.tagname,
|
|
|
2069 match_re ? matchoff : 0, !match_no_ic)
|
|
|
2070 #ifdef FEAT_MULTI_LANG
|
|
|
2071 + help_pri
|
|
|
2072 #endif
|
|
|
2073 );
|
|
|
2074 }
|
|
|
2075 *tagp.tagname_end = TAB;
|
|
|
2076 }
|
|
|
2077 else if (name_only)
|
|
|
2078 {
|
|
|
2079 if (get_it_again)
|
|
|
2080 {
|
|
|
2081 char_u *temp_end = tagp.command;
|
|
|
2082
|
|
|
2083 if (*temp_end == '/')
|
|
|
2084 while (*temp_end && *temp_end != '\r'
|
|
|
2085 && *temp_end != '\n'
|
|
|
2086 && *temp_end != '$')
|
|
|
2087 temp_end++;
|
|
|
2088
|
|
|
2089 if (tagp.command + 2 < temp_end)
|
|
|
2090 {
|
|
|
2091 len = (int)(temp_end - tagp.command - 2);
|
|
|
2092 mfp = (struct match_found *)alloc(
|
|
|
2093 (int)sizeof(struct match_found) + len);
|
|
|
2094 if (mfp != NULL)
|
|
|
2095 {
|
|
|
2096 mfp->len = len + 1; /* include the NUL */
|
|
|
2097 p = mfp->match;
|
|
418
|
2098 vim_strncpy(p, tagp.command + 2, len);
|
|
7
|
2099 }
|
|
|
2100 }
|
|
|
2101 else
|
|
|
2102 mfp = NULL;
|
|
|
2103 get_it_again = FALSE;
|
|
|
2104 }
|
|
|
2105 else
|
|
|
2106 {
|
|
|
2107 len = (int)(tagp.tagname_end - tagp.tagname);
|
|
|
2108 mfp = (struct match_found *)alloc(
|
|
|
2109 (int)sizeof(struct match_found) + len);
|
|
|
2110 if (mfp != NULL)
|
|
|
2111 {
|
|
|
2112 mfp->len = len + 1; /* include the NUL */
|
|
|
2113 p = mfp->match;
|
|
418
|
2114 vim_strncpy(p, tagp.tagname, len);
|
|
7
|
2115 }
|
|
|
2116
|
|
|
2117 /* if wanted, re-read line to get long form too */
|
|
|
2118 if (State & INSERT)
|
|
|
2119 get_it_again = p_sft;
|
|
|
2120 }
|
|
|
2121 }
|
|
|
2122 else
|
|
|
2123 {
|
|
|
2124 /* Save the tag in a buffer.
|
|
|
2125 * Emacs tag: <mtt><tag_fname><NUL><ebuf><NUL><lbuf>
|
|
|
2126 * other tag: <mtt><tag_fname><NUL><NUL><lbuf>
|
|
|
2127 * without Emacs tags: <mtt><tag_fname><NUL><lbuf>
|
|
|
2128 */
|
|
359
|
2129 len = (int)STRLEN(tag_fname)
|
|
|
2130 + (int)STRLEN(lbuf_line) + 3;
|
|
7
|
2131 #ifdef FEAT_EMACS_TAGS
|
|
|
2132 if (is_etag)
|
|
|
2133 len += (int)STRLEN(ebuf) + 1;
|
|
|
2134 else
|
|
|
2135 ++len;
|
|
|
2136 #endif
|
|
|
2137 mfp = (struct match_found *)alloc(
|
|
|
2138 (int)sizeof(struct match_found) + len);
|
|
|
2139 if (mfp != NULL)
|
|
|
2140 {
|
|
|
2141 mfp->len = len;
|
|
|
2142 p = mfp->match;
|
|
|
2143 p[0] = mtt;
|
|
|
2144 STRCPY(p + 1, tag_fname);
|
|
|
2145 #ifdef BACKSLASH_IN_FILENAME
|
|
|
2146 /* Ignore differences in slashes, avoid adding
|
|
|
2147 * both path/file and path\file. */
|
|
|
2148 slash_adjust(p + 1);
|
|
|
2149 #endif
|
|
|
2150 s = p + 1 + STRLEN(tag_fname) + 1;
|
|
|
2151 #ifdef FEAT_EMACS_TAGS
|
|
|
2152 if (is_etag)
|
|
|
2153 {
|
|
|
2154 STRCPY(s, ebuf);
|
|
|
2155 s += STRLEN(ebuf) + 1;
|
|
|
2156 }
|
|
|
2157 else
|
|
|
2158 *s++ = NUL;
|
|
|
2159 #endif
|
|
|
2160 STRCPY(s, lbuf_line);
|
|
|
2161 }
|
|
|
2162 }
|
|
|
2163
|
|
|
2164 if (mfp != NULL)
|
|
|
2165 {
|
|
|
2166 /*
|
|
|
2167 * Don't add identical matches.
|
|
|
2168 * This can take a lot of time when finding many
|
|
|
2169 * matches, check for CTRL-C now and then.
|
|
|
2170 * Add all cscope tags, because they are all listed.
|
|
|
2171 */
|
|
|
2172 #ifdef FEAT_CSCOPE
|
|
|
2173 if (use_cscope)
|
|
|
2174 i = -1;
|
|
|
2175 else
|
|
|
2176 #endif
|
|
|
2177 for (i = ga_match[mtt].ga_len; --i >= 0 && !got_int; )
|
|
|
2178 {
|
|
|
2179 mfp2 = ((struct match_found **)
|
|
|
2180 (ga_match[mtt].ga_data))[i];
|
|
|
2181 if (mfp2->len == mfp->len
|
|
|
2182 && vim_memcmp(mfp2->match, mfp->match,
|
|
|
2183 (size_t)mfp->len) == 0)
|
|
|
2184 break;
|
|
|
2185 line_breakcheck();
|
|
|
2186 }
|
|
|
2187 if (i < 0)
|
|
|
2188 {
|
|
|
2189 ((struct match_found **)(ga_match[mtt].ga_data))
|
|
|
2190 [ga_match[mtt].ga_len++] = mfp;
|
|
|
2191 ++match_count;
|
|
|
2192 }
|
|
|
2193 else
|
|
|
2194 vim_free(mfp);
|
|
|
2195 }
|
|
|
2196 #ifdef FEAT_MBYTE
|
|
|
2197 /* Note: this makes the values in "tagp" invalid! */
|
|
|
2198 vim_free(conv_line);
|
|
|
2199 #endif
|
|
|
2200 }
|
|
|
2201 else /* Out of memory! Just forget about the rest. */
|
|
|
2202 {
|
|
|
2203 retval = OK;
|
|
|
2204 stop_searching = TRUE;
|
|
|
2205 break;
|
|
|
2206 }
|
|
|
2207 }
|
|
|
2208 #ifdef FEAT_CSCOPE
|
|
|
2209 if (use_cscope && eof)
|
|
|
2210 break;
|
|
|
2211 #endif
|
|
|
2212 } /* forever */
|
|
|
2213
|
|
|
2214 if (line_error)
|
|
|
2215 {
|
|
|
2216 EMSG2(_("E431: Format error in tags file \"%s\""), tag_fname);
|
|
|
2217 #ifdef FEAT_CSCOPE
|
|
|
2218 if (!use_cscope)
|
|
|
2219 #endif
|
|
|
2220 EMSGN(_("Before byte %ld"), (long)ftell(fp));
|
|
|
2221 stop_searching = TRUE;
|
|
|
2222 line_error = FALSE;
|
|
|
2223 }
|
|
|
2224
|
|
|
2225 #ifdef FEAT_CSCOPE
|
|
|
2226 if (!use_cscope)
|
|
|
2227 #endif
|
|
|
2228 fclose(fp);
|
|
|
2229 #ifdef FEAT_EMACS_TAGS
|
|
|
2230 while (incstack_idx)
|
|
|
2231 {
|
|
|
2232 --incstack_idx;
|
|
|
2233 fclose(incstack[incstack_idx].fp);
|
|
|
2234 vim_free(incstack[incstack_idx].etag_fname);
|
|
|
2235 }
|
|
|
2236 #endif
|
|
|
2237 #ifdef FEAT_MBYTE
|
|
|
2238 if (pats == &convpat)
|
|
|
2239 {
|
|
|
2240 /* Go back from converted pattern to original pattern. */
|
|
|
2241 vim_free(pats->pat);
|
|
|
2242 vim_free(pats->regmatch.regprog);
|
|
|
2243 orgpat.regmatch.rm_ic = pats->regmatch.rm_ic;
|
|
|
2244 pats = &orgpat;
|
|
|
2245 }
|
|
|
2246 if (vimconv.vc_type != CONV_NONE)
|
|
|
2247 convert_setup(&vimconv, NULL, NULL);
|
|
|
2248 #endif
|
|
|
2249
|
|
|
2250 #ifdef FEAT_TAG_BINS
|
|
|
2251 if (sort_error)
|
|
|
2252 {
|
|
|
2253 EMSG2(_("E432: Tags file not sorted: %s"), tag_fname);
|
|
|
2254 sort_error = FALSE;
|
|
|
2255 }
|
|
|
2256 #endif
|
|
|
2257
|
|
|
2258 /*
|
|
|
2259 * Stop searching if sufficient tags have been found.
|
|
|
2260 */
|
|
|
2261 if (match_count >= mincount)
|
|
|
2262 {
|
|
|
2263 retval = OK;
|
|
|
2264 stop_searching = TRUE;
|
|
|
2265 }
|
|
|
2266
|
|
|
2267 #ifdef FEAT_CSCOPE
|
|
|
2268 if (stop_searching || use_cscope)
|
|
|
2269 #else
|
|
|
2270 if (stop_searching)
|
|
|
2271 #endif
|
|
|
2272 break;
|
|
|
2273
|
|
|
2274 } /* end of for-each-file loop */
|
|
|
2275
|
|
|
2276 #ifdef FEAT_TAG_BINS
|
|
413
|
2277 /* stop searching when already did a linear search, or when TAG_NOIC
|
|
|
2278 * used, and 'ignorecase' not set or already did case-ignore search */
|
|
7
|
2279 if (stop_searching || linear || (!p_ic && noic) || pats->regmatch.rm_ic)
|
|
|
2280 break;
|
|
|
2281 # ifdef FEAT_CSCOPE
|
|
|
2282 if (use_cscope)
|
|
|
2283 break;
|
|
|
2284 # endif
|
|
|
2285 pats->regmatch.rm_ic = TRUE; /* try another time while ignoring case */
|
|
|
2286 }
|
|
|
2287 #endif
|
|
|
2288
|
|
|
2289 if (!stop_searching)
|
|
|
2290 {
|
|
|
2291 if (!did_open && verbose) /* never opened any tags file */
|
|
|
2292 EMSG(_("E433: No tags file"));
|
|
|
2293 retval = OK; /* It's OK even when no tag found */
|
|
|
2294 }
|
|
|
2295
|
|
|
2296 findtag_end:
|
|
|
2297 vim_free(lbuf);
|
|
|
2298 vim_free(pats->regmatch.regprog);
|
|
|
2299 vim_free(tag_fname);
|
|
|
2300 #ifdef FEAT_EMACS_TAGS
|
|
|
2301 vim_free(ebuf);
|
|
|
2302 #endif
|
|
|
2303
|
|
|
2304 /*
|
|
|
2305 * Move the matches from the ga_match[] arrays into one list of
|
|
|
2306 * matches. When retval == FAIL, free the matches.
|
|
|
2307 */
|
|
|
2308 if (retval == FAIL)
|
|
|
2309 match_count = 0;
|
|
|
2310
|
|
|
2311 if (match_count > 0)
|
|
|
2312 matches = (char_u **)lalloc((long_u)(match_count * sizeof(char_u *)),
|
|
|
2313 TRUE);
|
|
|
2314 else
|
|
|
2315 matches = NULL;
|
|
|
2316 match_count = 0;
|
|
|
2317 for (mtt = 0; mtt < MT_COUNT; ++mtt)
|
|
|
2318 {
|
|
|
2319 for (i = 0; i < ga_match[mtt].ga_len; ++i)
|
|
|
2320 {
|
|
|
2321 mfp = ((struct match_found **)(ga_match[mtt].ga_data))[i];
|
|
|
2322 if (matches == NULL)
|
|
|
2323 vim_free(mfp);
|
|
|
2324 else
|
|
|
2325 {
|
|
|
2326 /* To avoid allocating memory again we turn the struct
|
|
|
2327 * match_found into a string. For help the priority was not
|
|
|
2328 * included in the length. */
|
|
|
2329 mch_memmove(mfp, mfp->match,
|
|
|
2330 (size_t)(mfp->len + (help_only ? ML_HELP_LEN : 0)));
|
|
|
2331 matches[match_count++] = (char_u *)mfp;
|
|
|
2332 }
|
|
|
2333 }
|
|
|
2334 ga_clear(&ga_match[mtt]);
|
|
|
2335 }
|
|
|
2336
|
|
|
2337 *matchesp = matches;
|
|
|
2338 *num_matches = match_count;
|
|
|
2339
|
|
|
2340 curbuf->b_help = help_save;
|
|
|
2341 #ifdef FEAT_MULTI_LANG
|
|
|
2342 vim_free(saved_pat);
|
|
|
2343 #endif
|
|
|
2344
|
|
|
2345 return retval;
|
|
|
2346 }
|
|
|
2347
|
|
|
2348 static garray_T tag_fnames = GA_EMPTY;
|
|
236
|
2349 static void found_tagfile_cb __ARGS((char_u *fname, void *cookie));
|
|
7
|
2350
|
|
|
2351 /*
|
|
|
2352 * Callback function for finding all "tags" and "tags-??" files in
|
|
|
2353 * 'runtimepath' doc directories.
|
|
|
2354 */
|
|
236
|
2355 /*ARGSUSED*/
|
|
7
|
2356 static void
|
|
236
|
2357 found_tagfile_cb(fname, cookie)
|
|
7
|
2358 char_u *fname;
|
|
236
|
2359 void *cookie;
|
|
7
|
2360 {
|
|
|
2361 if (ga_grow(&tag_fnames, 1) == OK)
|
|
|
2362 ((char_u **)(tag_fnames.ga_data))[tag_fnames.ga_len++] =
|
|
|
2363 vim_strsave(fname);
|
|
|
2364 }
|
|
|
2365
|
|
359
|
2366 static void *search_ctx = NULL;
|
|
|
2367
|
|
|
2368 #if defined(EXITFREE) || defined(PROTO)
|
|
|
2369 void
|
|
|
2370 free_tag_stuff()
|
|
|
2371 {
|
|
|
2372 vim_findfile_cleanup(search_ctx);
|
|
|
2373 do_tag(NULL, DT_FREE, 0, 0, 0);
|
|
|
2374 }
|
|
|
2375 #endif
|
|
|
2376
|
|
7
|
2377 /*
|
|
|
2378 * Get the next name of a tag file from the tag file list.
|
|
|
2379 * For help files, use "tags" file only.
|
|
|
2380 *
|
|
|
2381 * Return FAIL if no more tag file names, OK otherwise.
|
|
|
2382 */
|
|
514
|
2383 int
|
|
7
|
2384 get_tagfname(first, buf)
|
|
|
2385 int first; /* TRUE when first file name is wanted */
|
|
|
2386 char_u *buf; /* pointer to buffer of MAXPATHL chars */
|
|
|
2387 {
|
|
|
2388 static char_u *np = NULL;
|
|
|
2389 static int did_filefind_init;
|
|
|
2390 static int hf_idx = 0;
|
|
|
2391 char_u *fname = NULL;
|
|
|
2392 char_u *r_ptr;
|
|
|
2393
|
|
514
|
2394 if (curbuf->b_help)
|
|
7
|
2395 {
|
|
514
|
2396 /*
|
|
|
2397 * For help files it's done in a completely different way:
|
|
|
2398 * Find "doc/tags" and "doc/tags-??" in all directories in
|
|
|
2399 * 'runtimepath'.
|
|
|
2400 */
|
|
|
2401 if (first)
|
|
7
|
2402 {
|
|
|
2403 ga_clear_strings(&tag_fnames);
|
|
|
2404 ga_init2(&tag_fnames, (int)sizeof(char_u *), 10);
|
|
|
2405 do_in_runtimepath((char_u *)
|
|
|
2406 #ifdef FEAT_MULTI_LANG
|
|
36
|
2407 # ifdef VMS
|
|
|
2408 /* Functions decc$to_vms() and decc$translate_vms() crash
|
|
|
2409 * on some VMS systems with wildcards "??". Seems ECO
|
|
|
2410 * patches do fix the problem in C RTL, but we can't use
|
|
|
2411 * an #ifdef for that. */
|
|
|
2412 "doc/tags doc/tags-*"
|
|
|
2413 # else
|
|
7
|
2414 "doc/tags doc/tags-??"
|
|
36
|
2415 # endif
|
|
7
|
2416 #else
|
|
|
2417 "doc/tags"
|
|
|
2418 #endif
|
|
236
|
2419 , TRUE, found_tagfile_cb, NULL);
|
|
7
|
2420 hf_idx = 0;
|
|
|
2421 }
|
|
514
|
2422 else if (hf_idx >= tag_fnames.ga_len)
|
|
7
|
2423 {
|
|
|
2424 /* Not found in 'runtimepath', use 'helpfile', if it exists and
|
|
|
2425 * wasn't used yet, replacing "help.txt" with "tags". */
|
|
|
2426 if (hf_idx > tag_fnames.ga_len || *p_hf == NUL)
|
|
|
2427 return FAIL;
|
|
|
2428 ++hf_idx;
|
|
|
2429 STRCPY(buf, p_hf);
|
|
|
2430 STRCPY(gettail(buf), "tags");
|
|
|
2431 }
|
|
|
2432 else
|
|
418
|
2433 vim_strncpy(buf, ((char_u **)(tag_fnames.ga_data))[hf_idx++],
|
|
|
2434 MAXPATHL - 1);
|
|
514
|
2435 return OK;
|
|
|
2436 }
|
|
|
2437
|
|
|
2438 if (first)
|
|
|
2439 {
|
|
|
2440 /* Init. */
|
|
|
2441 if (*curbuf->b_p_tags != NUL)
|
|
|
2442 np = curbuf->b_p_tags;
|
|
|
2443 else
|
|
|
2444 np = p_tags;
|
|
|
2445 vim_findfile_free_visited(search_ctx);
|
|
|
2446 did_filefind_init = FALSE;
|
|
7
|
2447 }
|
|
|
2448 else
|
|
|
2449 {
|
|
|
2450 if (np == NULL)
|
|
514
|
2451 return FAIL; /* tried already (or bogus call) */
|
|
7
|
2452
|
|
|
2453 /*
|
|
|
2454 * Loop until we have found a file name that can be used.
|
|
|
2455 * There are two states:
|
|
|
2456 * did_filefind_init == FALSE: setup for next part in 'tags'.
|
|
|
2457 * did_filefind_init == TRUE: find next file in this part.
|
|
|
2458 */
|
|
|
2459 for (;;)
|
|
|
2460 {
|
|
|
2461 if (did_filefind_init)
|
|
|
2462 {
|
|
|
2463 fname = vim_findfile(search_ctx);
|
|
|
2464 if (fname != NULL)
|
|
|
2465 break;
|
|
|
2466
|
|
|
2467 did_filefind_init = FALSE;
|
|
|
2468 }
|
|
|
2469 else
|
|
|
2470 {
|
|
|
2471 char_u *filename = NULL;
|
|
|
2472
|
|
|
2473 /* Stop when used all parts of 'tags'. */
|
|
|
2474 if (*np == NUL)
|
|
|
2475 {
|
|
|
2476 vim_findfile_cleanup(search_ctx);
|
|
|
2477 search_ctx = NULL;
|
|
|
2478 return FAIL;
|
|
|
2479 }
|
|
|
2480
|
|
|
2481 /*
|
|
|
2482 * Copy next file name into buf.
|
|
|
2483 */
|
|
|
2484 buf[0] = NUL;
|
|
|
2485 (void)copy_option_part(&np, buf, MAXPATHL - 1, " ,");
|
|
|
2486
|
|
|
2487 #ifdef FEAT_PATH_EXTRA
|
|
|
2488 r_ptr = vim_findfile_stopdir(buf);
|
|
|
2489 #else
|
|
|
2490 r_ptr = NULL;
|
|
|
2491 #endif
|
|
|
2492 /* move the filename one char forward and truncate the
|
|
|
2493 * filepath with a NUL */
|
|
|
2494 filename = gettail(buf);
|
|
|
2495 mch_memmove(filename + 1, filename, STRLEN(filename) + 1);
|
|
|
2496 *filename++ = NUL;
|
|
|
2497
|
|
|
2498 search_ctx = vim_findfile_init(buf, filename, r_ptr, 100,
|
|
|
2499 FALSE, /* don't free visited list */
|
|
|
2500 FALSE, /* we search for a file */
|
|
|
2501 search_ctx, TRUE, curbuf->b_ffname);
|
|
|
2502 if (search_ctx != NULL)
|
|
|
2503 did_filefind_init = TRUE;
|
|
|
2504 }
|
|
|
2505 }
|
|
|
2506 STRCPY(buf, fname);
|
|
|
2507 vim_free(fname);
|
|
|
2508 }
|
|
|
2509
|
|
|
2510 return OK;
|
|
|
2511 }
|
|
|
2512
|
|
|
2513 /*
|
|
|
2514 * Parse one line from the tags file. Find start/end of tag name, start/end of
|
|
|
2515 * file name and start of search pattern.
|
|
|
2516 *
|
|
|
2517 * If is_etag is TRUE, tagp->fname and tagp->fname_end are not set.
|
|
|
2518 *
|
|
|
2519 * Return FAIL if there is a format error in this line, OK otherwise.
|
|
|
2520 */
|
|
|
2521 static int
|
|
|
2522 parse_tag_line(lbuf,
|
|
|
2523 #ifdef FEAT_EMACS_TAGS
|
|
|
2524 is_etag,
|
|
|
2525 #endif
|
|
|
2526 tagp)
|
|
|
2527 char_u *lbuf; /* line to be parsed */
|
|
|
2528 #ifdef FEAT_EMACS_TAGS
|
|
|
2529 int is_etag;
|
|
|
2530 #endif
|
|
|
2531 tagptrs_T *tagp;
|
|
|
2532 {
|
|
|
2533 char_u *p;
|
|
|
2534
|
|
|
2535 #ifdef FEAT_EMACS_TAGS
|
|
|
2536 char_u *p_7f;
|
|
|
2537
|
|
|
2538 if (is_etag)
|
|
|
2539 {
|
|
|
2540 /*
|
|
|
2541 * There are two formats for an emacs tag line:
|
|
|
2542 * 1: struct EnvBase ^?EnvBase^A139,4627
|
|
|
2543 * 2: #define ARPB_WILD_WORLD ^?153,5194
|
|
|
2544 */
|
|
|
2545 p_7f = vim_strchr(lbuf, 0x7f);
|
|
|
2546 if (p_7f == NULL)
|
|
|
2547 return FAIL;
|
|
|
2548
|
|
|
2549 /* Find ^A. If not found the line number is after the 0x7f */
|
|
|
2550 p = vim_strchr(p_7f, Ctrl_A);
|
|
|
2551 if (p == NULL)
|
|
|
2552 p = p_7f + 1;
|
|
|
2553 else
|
|
|
2554 ++p;
|
|
|
2555
|
|
|
2556 if (!VIM_ISDIGIT(*p)) /* check for start of line number */
|
|
|
2557 return FAIL;
|
|
|
2558 tagp->command = p;
|
|
|
2559
|
|
|
2560
|
|
|
2561 if (p[-1] == Ctrl_A) /* first format: explicit tagname given */
|
|
|
2562 {
|
|
|
2563 tagp->tagname = p_7f + 1;
|
|
|
2564 tagp->tagname_end = p - 1;
|
|
|
2565 }
|
|
|
2566 else /* second format: isolate tagname */
|
|
|
2567 {
|
|
|
2568 /* find end of tagname */
|
|
|
2569 for (p = p_7f - 1; !vim_iswordc(*p); --p)
|
|
|
2570 if (p == lbuf)
|
|
|
2571 return FAIL;
|
|
|
2572 tagp->tagname_end = p + 1;
|
|
|
2573 while (p >= lbuf && vim_iswordc(*p))
|
|
|
2574 --p;
|
|
|
2575 tagp->tagname = p + 1;
|
|
|
2576 }
|
|
|
2577 }
|
|
|
2578 else /* not an Emacs tag */
|
|
|
2579 {
|
|
|
2580 #endif
|
|
|
2581 /* Isolate the tagname, from lbuf up to the first white */
|
|
|
2582 tagp->tagname = lbuf;
|
|
|
2583 #ifdef FEAT_TAG_ANYWHITE
|
|
|
2584 p = skiptowhite(lbuf);
|
|
|
2585 #else
|
|
|
2586 p = vim_strchr(lbuf, TAB);
|
|
|
2587 if (p == NULL)
|
|
|
2588 return FAIL;
|
|
|
2589 #endif
|
|
|
2590 tagp->tagname_end = p;
|
|
|
2591
|
|
|
2592 /* Isolate file name, from first to second white space */
|
|
|
2593 #ifdef FEAT_TAG_ANYWHITE
|
|
|
2594 p = skipwhite(p);
|
|
|
2595 #else
|
|
|
2596 if (*p != NUL)
|
|
|
2597 ++p;
|
|
|
2598 #endif
|
|
|
2599 tagp->fname = p;
|
|
|
2600 #ifdef FEAT_TAG_ANYWHITE
|
|
|
2601 p = skiptowhite(p);
|
|
|
2602 #else
|
|
|
2603 p = vim_strchr(p, TAB);
|
|
|
2604 if (p == NULL)
|
|
|
2605 return FAIL;
|
|
|
2606 #endif
|
|
|
2607 tagp->fname_end = p;
|
|
|
2608
|
|
|
2609 /* find start of search command, after second white space */
|
|
|
2610 #ifdef FEAT_TAG_ANYWHITE
|
|
|
2611 p = skipwhite(p);
|
|
|
2612 #else
|
|
|
2613 if (*p != NUL)
|
|
|
2614 ++p;
|
|
|
2615 #endif
|
|
|
2616 if (*p == NUL)
|
|
|
2617 return FAIL;
|
|
|
2618 tagp->command = p;
|
|
|
2619 #ifdef FEAT_EMACS_TAGS
|
|
|
2620 }
|
|
|
2621 #endif
|
|
|
2622
|
|
|
2623 return OK;
|
|
|
2624 }
|
|
|
2625
|
|
|
2626 /*
|
|
|
2627 * Check if tagname is a static tag
|
|
|
2628 *
|
|
|
2629 * Static tags produced by the older ctags program have the format:
|
|
|
2630 * 'file:tag file /pattern'.
|
|
|
2631 * This is only recognized when both occurences of 'file' are the same, to
|
|
|
2632 * avoid recognizing "string::string" or ":exit".
|
|
|
2633 *
|
|
|
2634 * Static tags produced by the new ctags program have the format:
|
|
|
2635 * 'tag file /pattern/;"<Tab>file:' "
|
|
|
2636 *
|
|
|
2637 * Return TRUE if it is a static tag and adjust *tagname to the real tag.
|
|
|
2638 * Return FALSE if it is not a static tag.
|
|
|
2639 */
|
|
|
2640 static int
|
|
|
2641 test_for_static(tagp)
|
|
|
2642 tagptrs_T *tagp;
|
|
|
2643 {
|
|
|
2644 char_u *p;
|
|
|
2645
|
|
|
2646 #ifdef FEAT_TAG_OLDSTATIC
|
|
|
2647 int len;
|
|
|
2648
|
|
|
2649 /*
|
|
|
2650 * Check for old style static tag: "file:tag file .."
|
|
|
2651 */
|
|
|
2652 len = (int)(tagp->fname_end - tagp->fname);
|
|
|
2653 p = tagp->tagname + len;
|
|
|
2654 if ( p < tagp->tagname_end
|
|
|
2655 && *p == ':'
|
|
|
2656 && fnamencmp(tagp->tagname, tagp->fname, len) == 0)
|
|
|
2657 {
|
|
|
2658 tagp->tagname = p + 1;
|
|
|
2659 return TRUE;
|
|
|
2660 }
|
|
|
2661 #endif
|
|
|
2662
|
|
|
2663 /*
|
|
|
2664 * Check for new style static tag ":...<Tab>file:[<Tab>...]"
|
|
|
2665 */
|
|
|
2666 p = tagp->command;
|
|
|
2667 while ((p = vim_strchr(p, '\t')) != NULL)
|
|
|
2668 {
|
|
|
2669 ++p;
|
|
|
2670 if (STRNCMP(p, "file:", 5) == 0)
|
|
|
2671 return TRUE;
|
|
|
2672 }
|
|
|
2673
|
|
|
2674 return FALSE;
|
|
|
2675 }
|
|
|
2676
|
|
|
2677 /*
|
|
|
2678 * Parse a line from a matching tag. Does not change the line itself.
|
|
|
2679 *
|
|
|
2680 * The line that we get looks like this:
|
|
|
2681 * Emacs tag: <mtt><tag_fname><NUL><ebuf><NUL><lbuf>
|
|
|
2682 * other tag: <mtt><tag_fname><NUL><NUL><lbuf>
|
|
|
2683 * without Emacs tags: <mtt><tag_fname><NUL><lbuf>
|
|
|
2684 *
|
|
|
2685 * Return OK or FAIL.
|
|
|
2686 */
|
|
|
2687 static int
|
|
|
2688 parse_match(lbuf, tagp)
|
|
|
2689 char_u *lbuf; /* input: matching line */
|
|
|
2690 tagptrs_T *tagp; /* output: pointers into the line */
|
|
|
2691 {
|
|
|
2692 int retval;
|
|
|
2693 char_u *p;
|
|
|
2694 char_u *pc, *pt;
|
|
|
2695
|
|
|
2696 tagp->tag_fname = lbuf + 1;
|
|
|
2697 lbuf += STRLEN(tagp->tag_fname) + 2;
|
|
|
2698 #ifdef FEAT_EMACS_TAGS
|
|
|
2699 if (*lbuf)
|
|
|
2700 {
|
|
|
2701 tagp->is_etag = TRUE;
|
|
|
2702 tagp->fname = lbuf;
|
|
|
2703 lbuf += STRLEN(lbuf);
|
|
|
2704 tagp->fname_end = lbuf++;
|
|
|
2705 }
|
|
|
2706 else
|
|
|
2707 {
|
|
|
2708 tagp->is_etag = FALSE;
|
|
|
2709 ++lbuf;
|
|
|
2710 }
|
|
|
2711 #endif
|
|
|
2712
|
|
|
2713 /* Find search pattern and the file name for non-etags. */
|
|
|
2714 retval = parse_tag_line(lbuf,
|
|
|
2715 #ifdef FEAT_EMACS_TAGS
|
|
|
2716 tagp->is_etag,
|
|
|
2717 #endif
|
|
|
2718 tagp);
|
|
|
2719
|
|
|
2720 tagp->tagkind = NULL;
|
|
|
2721 tagp->command_end = NULL;
|
|
|
2722
|
|
|
2723 if (retval == OK)
|
|
|
2724 {
|
|
|
2725 /* Try to find a kind field: "kind:<kind>" or just "<kind>"*/
|
|
|
2726 p = tagp->command;
|
|
|
2727 if (find_extra(&p) == OK)
|
|
|
2728 {
|
|
|
2729 tagp->command_end = p;
|
|
|
2730 p += 2; /* skip ";\"" */
|
|
|
2731 if (*p++ == TAB)
|
|
|
2732 while (ASCII_ISALPHA(*p))
|
|
|
2733 {
|
|
|
2734 if (STRNCMP(p, "kind:", 5) == 0)
|
|
|
2735 {
|
|
|
2736 tagp->tagkind = p + 5;
|
|
|
2737 break;
|
|
|
2738 }
|
|
|
2739 pc = vim_strchr(p, ':');
|
|
|
2740 pt = vim_strchr(p, '\t');
|
|
|
2741 if (pc == NULL || (pt != NULL && pc > pt))
|
|
|
2742 {
|
|
|
2743 tagp->tagkind = p;
|
|
|
2744 break;
|
|
|
2745 }
|
|
|
2746 if (pt == NULL)
|
|
|
2747 break;
|
|
|
2748 p = pt + 1;
|
|
|
2749 }
|
|
|
2750 }
|
|
|
2751 if (tagp->tagkind != NULL)
|
|
|
2752 {
|
|
|
2753 for (p = tagp->tagkind;
|
|
|
2754 *p && *p != '\t' && *p != '\r' && *p != '\n'; ++p)
|
|
|
2755 ;
|
|
|
2756 tagp->tagkind_end = p;
|
|
|
2757 }
|
|
|
2758 }
|
|
|
2759 return retval;
|
|
|
2760 }
|
|
|
2761
|
|
|
2762 /*
|
|
|
2763 * Find out the actual file name of a tag. Concatenate the tags file name
|
|
|
2764 * with the matching tag file name.
|
|
|
2765 * Returns an allocated string or NULL (out of memory).
|
|
|
2766 */
|
|
|
2767 static char_u *
|
|
|
2768 tag_full_fname(tagp)
|
|
|
2769 tagptrs_T *tagp;
|
|
|
2770 {
|
|
|
2771 char_u *fullname;
|
|
|
2772 int c;
|
|
|
2773
|
|
|
2774 #ifdef FEAT_EMACS_TAGS
|
|
|
2775 if (tagp->is_etag)
|
|
|
2776 c = 0; /* to shut up GCC */
|
|
|
2777 else
|
|
|
2778 #endif
|
|
|
2779 {
|
|
|
2780 c = *tagp->fname_end;
|
|
|
2781 *tagp->fname_end = NUL;
|
|
|
2782 }
|
|
|
2783 fullname = expand_tag_fname(tagp->fname, tagp->tag_fname, FALSE);
|
|
|
2784
|
|
|
2785 #ifdef FEAT_EMACS_TAGS
|
|
|
2786 if (!tagp->is_etag)
|
|
|
2787 #endif
|
|
|
2788 *tagp->fname_end = c;
|
|
|
2789
|
|
|
2790 return fullname;
|
|
|
2791 }
|
|
|
2792
|
|
|
2793 /*
|
|
|
2794 * Jump to a tag that has been found in one of the tag files
|
|
|
2795 *
|
|
|
2796 * returns OK for success, NOTAGFILE when file not found, FAIL otherwise.
|
|
|
2797 */
|
|
|
2798 static int
|
|
|
2799 jumpto_tag(lbuf, forceit, keep_help)
|
|
|
2800 char_u *lbuf; /* line from the tags file for this tag */
|
|
|
2801 int forceit; /* :ta with ! */
|
|
|
2802 int keep_help; /* keep help flag (FALSE for cscope) */
|
|
|
2803 {
|
|
|
2804 int save_secure;
|
|
|
2805 int save_magic;
|
|
|
2806 int save_p_ws, save_p_scs, save_p_ic;
|
|
|
2807 linenr_T save_lnum;
|
|
|
2808 int csave = 0;
|
|
|
2809 char_u *str;
|
|
|
2810 char_u *pbuf; /* search pattern buffer */
|
|
|
2811 char_u *pbuf_end;
|
|
|
2812 char_u *tofree_fname = NULL;
|
|
|
2813 char_u *fname;
|
|
|
2814 tagptrs_T tagp;
|
|
|
2815 int retval = FAIL;
|
|
|
2816 int getfile_result;
|
|
|
2817 int search_options;
|
|
|
2818 #ifdef FEAT_SEARCH_EXTRA
|
|
|
2819 int save_no_hlsearch;
|
|
|
2820 #endif
|
|
|
2821 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
2822 win_T *curwin_save = NULL;
|
|
|
2823 #endif
|
|
|
2824 char_u *full_fname = NULL;
|
|
|
2825 #ifdef FEAT_FOLDING
|
|
|
2826 int old_KeyTyped = KeyTyped; /* getting the file may reset it */
|
|
|
2827 #endif
|
|
|
2828
|
|
|
2829 pbuf = alloc(LSIZE);
|
|
|
2830
|
|
|
2831 /* parse the match line into the tagp structure */
|
|
|
2832 if (pbuf == NULL || parse_match(lbuf, &tagp) == FAIL)
|
|
|
2833 {
|
|
|
2834 tagp.fname_end = NULL;
|
|
|
2835 goto erret;
|
|
|
2836 }
|
|
|
2837
|
|
|
2838 /* truncate the file name, so it can be used as a string */
|
|
|
2839 csave = *tagp.fname_end;
|
|
|
2840 *tagp.fname_end = NUL;
|
|
|
2841 fname = tagp.fname;
|
|
|
2842
|
|
|
2843 /* copy the command to pbuf[], remove trailing CR/NL */
|
|
|
2844 str = tagp.command;
|
|
|
2845 for (pbuf_end = pbuf; *str && *str != '\n' && *str != '\r'; )
|
|
|
2846 {
|
|
|
2847 #ifdef FEAT_EMACS_TAGS
|
|
|
2848 if (tagp.is_etag && *str == ',')/* stop at ',' after line number */
|
|
|
2849 break;
|
|
|
2850 #endif
|
|
|
2851 *pbuf_end++ = *str++;
|
|
|
2852 }
|
|
|
2853 *pbuf_end = NUL;
|
|
|
2854
|
|
|
2855 #ifdef FEAT_EMACS_TAGS
|
|
|
2856 if (!tagp.is_etag)
|
|
|
2857 #endif
|
|
|
2858 {
|
|
|
2859 /*
|
|
|
2860 * Remove the "<Tab>fieldname:value" stuff; we don't need it here.
|
|
|
2861 */
|
|
|
2862 str = pbuf;
|
|
|
2863 if (find_extra(&str) == OK)
|
|
|
2864 {
|
|
|
2865 pbuf_end = str;
|
|
|
2866 *pbuf_end = NUL;
|
|
|
2867 }
|
|
|
2868 }
|
|
|
2869
|
|
|
2870 /*
|
|
|
2871 * Expand file name, when needed (for environment variables).
|
|
|
2872 * If 'tagrelative' option set, may change file name.
|
|
|
2873 */
|
|
|
2874 fname = expand_tag_fname(fname, tagp.tag_fname, TRUE);
|
|
|
2875 if (fname == NULL)
|
|
|
2876 goto erret;
|
|
|
2877 tofree_fname = fname; /* free() it later */
|
|
|
2878
|
|
|
2879 /*
|
|
|
2880 * Check if the file with the tag exists before abandoning the current
|
|
|
2881 * file. Also accept a file name for which there is a matching BufReadCmd
|
|
|
2882 * autocommand event (e.g., http://sys/file).
|
|
|
2883 */
|
|
|
2884 if (mch_getperm(fname) < 0
|
|
|
2885 #ifdef FEAT_AUTOCMD
|
|
40
|
2886 && !has_autocmd(EVENT_BUFREADCMD, fname, NULL)
|
|
7
|
2887 #endif
|
|
|
2888 )
|
|
|
2889 {
|
|
|
2890 retval = NOTAGFILE;
|
|
|
2891 vim_free(nofile_fname);
|
|
|
2892 nofile_fname = vim_strsave(fname);
|
|
|
2893 if (nofile_fname == NULL)
|
|
|
2894 nofile_fname = empty_option;
|
|
|
2895 goto erret;
|
|
|
2896 }
|
|
|
2897
|
|
|
2898 ++RedrawingDisabled;
|
|
|
2899
|
|
|
2900 #ifdef FEAT_GUI
|
|
|
2901 need_mouse_correct = TRUE;
|
|
|
2902 #endif
|
|
|
2903
|
|
|
2904 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
2905 if (g_do_tagpreview)
|
|
|
2906 {
|
|
|
2907 /* don't split again below */
|
|
|
2908 postponed_split = 0;
|
|
|
2909 /* Save current window */
|
|
|
2910 curwin_save = curwin;
|
|
|
2911 /*
|
|
|
2912 * If we are reusing a window, we may change dir when
|
|
|
2913 * entering it (autocommands) so turn the tag filename
|
|
|
2914 * into a fullpath
|
|
|
2915 */
|
|
|
2916 if (!curwin->w_p_pvw)
|
|
|
2917 {
|
|
|
2918 full_fname = FullName_save(fname, FALSE);
|
|
|
2919 fname = full_fname;
|
|
|
2920
|
|
|
2921 /*
|
|
|
2922 * Make the preview window the current window.
|
|
|
2923 * Open a preview window when needed.
|
|
|
2924 */
|
|
|
2925 prepare_tagpreview();
|
|
|
2926 }
|
|
|
2927 }
|
|
|
2928
|
|
|
2929 /* if it was a CTRL-W CTRL-] command split window now */
|
|
|
2930 if (postponed_split)
|
|
|
2931 {
|
|
|
2932 win_split(postponed_split > 0 ? postponed_split : 0,
|
|
|
2933 postponed_split_flags);
|
|
|
2934 # ifdef FEAT_SCROLLBIND
|
|
|
2935 curwin->w_p_scb = FALSE;
|
|
|
2936 # endif
|
|
|
2937 }
|
|
|
2938 #endif
|
|
|
2939
|
|
|
2940 if (keep_help)
|
|
|
2941 {
|
|
|
2942 /* A :ta from a help file will keep the b_help flag set. For ":ptag"
|
|
|
2943 * we need to use the flag from the window where we came from. */
|
|
|
2944 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
2945 if (g_do_tagpreview)
|
|
|
2946 keep_help_flag = curwin_save->w_buffer->b_help;
|
|
|
2947 else
|
|
|
2948 #endif
|
|
|
2949 keep_help_flag = curbuf->b_help;
|
|
|
2950 }
|
|
|
2951 getfile_result = getfile(0, fname, NULL, TRUE, (linenr_T)0, forceit);
|
|
|
2952 keep_help_flag = FALSE;
|
|
|
2953
|
|
|
2954 if (getfile_result <= 0) /* got to the right file */
|
|
|
2955 {
|
|
|
2956 curwin->w_set_curswant = TRUE;
|
|
|
2957 #ifdef FEAT_WINDOWS
|
|
|
2958 postponed_split = 0;
|
|
|
2959 #endif
|
|
|
2960
|
|
|
2961 save_secure = secure;
|
|
|
2962 secure = 1;
|
|
|
2963 #ifdef HAVE_SANDBOX
|
|
|
2964 ++sandbox;
|
|
|
2965 #endif
|
|
|
2966 save_magic = p_magic;
|
|
|
2967 p_magic = FALSE; /* always execute with 'nomagic' */
|
|
|
2968 #ifdef FEAT_SEARCH_EXTRA
|
|
|
2969 /* Save value of no_hlsearch, jumping to a tag is not a real search */
|
|
|
2970 save_no_hlsearch = no_hlsearch;
|
|
|
2971 #endif
|
|
|
2972
|
|
|
2973 /*
|
|
|
2974 * If 'cpoptions' contains 't', store the search pattern for the "n"
|
|
|
2975 * command. If 'cpoptions' does not contain 't', the search pattern
|
|
|
2976 * is not stored.
|
|
|
2977 */
|
|
|
2978 if (vim_strchr(p_cpo, CPO_TAGPAT) != NULL)
|
|
|
2979 search_options = 0;
|
|
|
2980 else
|
|
|
2981 search_options = SEARCH_KEEP;
|
|
|
2982
|
|
|
2983 /*
|
|
|
2984 * If the command is a search, try here.
|
|
|
2985 *
|
|
|
2986 * Reset 'smartcase' for the search, since the search pattern was not
|
|
|
2987 * typed by the user.
|
|
|
2988 * Only use do_search() when there is a full search command, without
|
|
|
2989 * anything following.
|
|
|
2990 */
|
|
|
2991 str = pbuf;
|
|
|
2992 if (pbuf[0] == '/' || pbuf[0] == '?')
|
|
|
2993 str = skip_regexp(pbuf + 1, pbuf[0], FALSE, NULL) + 1;
|
|
|
2994 if (str > pbuf_end - 1) /* search command with nothing following */
|
|
|
2995 {
|
|
|
2996 save_p_ws = p_ws;
|
|
|
2997 save_p_ic = p_ic;
|
|
|
2998 save_p_scs = p_scs;
|
|
|
2999 p_ws = TRUE; /* need 'wrapscan' for backward searches */
|
|
|
3000 p_ic = FALSE; /* don't ignore case now */
|
|
|
3001 p_scs = FALSE;
|
|
|
3002 #if 0 /* disabled for now */
|
|
|
3003 #ifdef FEAT_CMDHIST
|
|
|
3004 /* put pattern in search history */
|
|
|
3005 add_to_history(HIST_SEARCH, pbuf + 1, TRUE, pbuf[0]);
|
|
|
3006 #endif
|
|
|
3007 #endif
|
|
|
3008 save_lnum = curwin->w_cursor.lnum;
|
|
|
3009 curwin->w_cursor.lnum = 0; /* start search before first line */
|
|
|
3010 if (do_search(NULL, pbuf[0], pbuf + 1, (long)1, search_options))
|
|
|
3011 retval = OK;
|
|
|
3012 else
|
|
|
3013 {
|
|
|
3014 int found = 1;
|
|
|
3015 int cc;
|
|
|
3016
|
|
|
3017 /*
|
|
|
3018 * try again, ignore case now
|
|
|
3019 */
|
|
|
3020 p_ic = TRUE;
|
|
|
3021 if (!do_search(NULL, pbuf[0], pbuf + 1, (long)1,
|
|
|
3022 search_options))
|
|
|
3023 {
|
|
|
3024 /*
|
|
|
3025 * Failed to find pattern, take a guess: "^func ("
|
|
|
3026 */
|
|
|
3027 found = 2;
|
|
|
3028 (void)test_for_static(&tagp);
|
|
|
3029 cc = *tagp.tagname_end;
|
|
|
3030 *tagp.tagname_end = NUL;
|
|
|
3031 sprintf((char *)pbuf, "^%s\\s\\*(", tagp.tagname);
|
|
|
3032 if (!do_search(NULL, '/', pbuf, (long)1, search_options))
|
|
|
3033 {
|
|
|
3034 /* Guess again: "^char * \<func (" */
|
|
|
3035 sprintf((char *)pbuf, "^\\[#a-zA-Z_]\\.\\*\\<%s\\s\\*(",
|
|
|
3036 tagp.tagname);
|
|
|
3037 if (!do_search(NULL, '/', pbuf, (long)1,
|
|
|
3038 search_options))
|
|
|
3039 found = 0;
|
|
|
3040 }
|
|
|
3041 *tagp.tagname_end = cc;
|
|
|
3042 }
|
|
|
3043 if (found == 0)
|
|
|
3044 {
|
|
|
3045 EMSG(_("E434: Can't find tag pattern"));
|
|
|
3046 curwin->w_cursor.lnum = save_lnum;
|
|
|
3047 }
|
|
|
3048 else
|
|
|
3049 {
|
|
|
3050 /*
|
|
|
3051 * Only give a message when really guessed, not when 'ic'
|
|
|
3052 * is set and match found while ignoring case.
|
|
|
3053 */
|
|
|
3054 if (found == 2 || !save_p_ic)
|
|
|
3055 {
|
|
|
3056 MSG(_("E435: Couldn't find tag, just guessing!"));
|
|
|
3057 if (!msg_scrolled && msg_silent == 0)
|
|
|
3058 {
|
|
|
3059 out_flush();
|
|
|
3060 ui_delay(1000L, TRUE);
|
|
|
3061 }
|
|
|
3062 }
|
|
|
3063 retval = OK;
|
|
|
3064 }
|
|
|
3065 }
|
|
|
3066 p_ws = save_p_ws;
|
|
|
3067 p_ic = save_p_ic;
|
|
|
3068 p_scs = save_p_scs;
|
|
|
3069
|
|
|
3070 /* A search command may have positioned the cursor beyond the end
|
|
|
3071 * of the line. May need to correct that here. */
|
|
|
3072 check_cursor();
|
|
|
3073 }
|
|
|
3074 else
|
|
|
3075 {
|
|
|
3076 curwin->w_cursor.lnum = 1; /* start command in line 1 */
|
|
|
3077 do_cmdline_cmd(pbuf);
|
|
|
3078 retval = OK;
|
|
|
3079 }
|
|
|
3080
|
|
|
3081 /*
|
|
|
3082 * When the command has done something that is not allowed make sure
|
|
|
3083 * the error message can be seen.
|
|
|
3084 */
|
|
|
3085 if (secure == 2)
|
|
|
3086 wait_return(TRUE);
|
|
|
3087 secure = save_secure;
|
|
|
3088 p_magic = save_magic;
|
|
|
3089 #ifdef HAVE_SANDBOX
|
|
|
3090 --sandbox;
|
|
|
3091 #endif
|
|
|
3092 #ifdef FEAT_SEARCH_EXTRA
|
|
|
3093 /* restore no_hlsearch when keeping the old search pattern */
|
|
|
3094 if (search_options)
|
|
|
3095 no_hlsearch = save_no_hlsearch;
|
|
|
3096 #endif
|
|
|
3097
|
|
|
3098 /* Return OK if jumped to another file (at least we found the file!). */
|
|
|
3099 if (getfile_result == -1)
|
|
|
3100 retval = OK;
|
|
|
3101
|
|
|
3102 if (retval == OK)
|
|
|
3103 {
|
|
|
3104 /*
|
|
|
3105 * For a help buffer: Put the cursor line at the top of the window,
|
|
|
3106 * the help subject will be below it.
|
|
|
3107 */
|
|
|
3108 if (curbuf->b_help)
|
|
|
3109 set_topline(curwin, curwin->w_cursor.lnum);
|
|
|
3110 #ifdef FEAT_FOLDING
|
|
|
3111 if ((fdo_flags & FDO_TAG) && old_KeyTyped)
|
|
|
3112 foldOpenCursor();
|
|
|
3113 #endif
|
|
|
3114 }
|
|
|
3115
|
|
|
3116 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
3117 if (g_do_tagpreview && curwin != curwin_save && win_valid(curwin_save))
|
|
|
3118 {
|
|
|
3119 /* Return cursor to where we were */
|
|
|
3120 validate_cursor();
|
|
|
3121 redraw_later(VALID);
|
|
|
3122 win_enter(curwin_save, TRUE);
|
|
|
3123 }
|
|
|
3124 #endif
|
|
|
3125
|
|
|
3126 --RedrawingDisabled;
|
|
|
3127 }
|
|
|
3128 else
|
|
|
3129 {
|
|
|
3130 --RedrawingDisabled;
|
|
|
3131 #ifdef FEAT_WINDOWS
|
|
|
3132 if (postponed_split) /* close the window */
|
|
|
3133 {
|
|
|
3134 win_close(curwin, FALSE);
|
|
|
3135 postponed_split = 0;
|
|
|
3136 }
|
|
|
3137 #endif
|
|
|
3138 }
|
|
|
3139
|
|
|
3140 erret:
|
|
|
3141 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
|
|
|
3142 g_do_tagpreview = 0; /* For next time */
|
|
|
3143 #endif
|
|
|
3144 if (tagp.fname_end != NULL)
|
|
|
3145 *tagp.fname_end = csave;
|
|
|
3146 vim_free(pbuf);
|
|
|
3147 vim_free(tofree_fname);
|
|
|
3148 vim_free(full_fname);
|
|
|
3149
|
|
|
3150 return retval;
|
|
|
3151 }
|
|
|
3152
|
|
|
3153 /*
|
|
|
3154 * If "expand" is TRUE, expand wildcards in fname.
|
|
|
3155 * If 'tagrelative' option set, change fname (name of file containing tag)
|
|
|
3156 * according to tag_fname (name of tag file containing fname).
|
|
|
3157 * Returns a pointer to allocated memory (or NULL when out of memory).
|
|
|
3158 */
|
|
|
3159 static char_u *
|
|
|
3160 expand_tag_fname(fname, tag_fname, expand)
|
|
|
3161 char_u *fname;
|
|
|
3162 char_u *tag_fname;
|
|
|
3163 int expand;
|
|
|
3164 {
|
|
|
3165 char_u *p;
|
|
|
3166 char_u *retval;
|
|
|
3167 char_u *expanded_fname = NULL;
|
|
|
3168 expand_T xpc;
|
|
|
3169
|
|
|
3170 /*
|
|
|
3171 * Expand file name (for environment variables) when needed.
|
|
|
3172 */
|
|
|
3173 if (expand && mch_has_wildcard(fname))
|
|
|
3174 {
|
|
|
3175 ExpandInit(&xpc);
|
|
|
3176 xpc.xp_context = EXPAND_FILES;
|
|
|
3177 expanded_fname = ExpandOne(&xpc, (char_u *)fname, NULL,
|
|
|
3178 WILD_LIST_NOTFOUND|WILD_SILENT, WILD_EXPAND_FREE);
|
|
|
3179 ExpandCleanup(&xpc);
|
|
|
3180 if (expanded_fname != NULL)
|
|
|
3181 fname = expanded_fname;
|
|
|
3182 }
|
|
|
3183
|
|
|
3184 if ((p_tr || curbuf->b_help)
|
|
|
3185 && !vim_isAbsName(fname)
|
|
|
3186 && (p = gettail(tag_fname)) != tag_fname)
|
|
|
3187 {
|
|
|
3188 retval = alloc(MAXPATHL);
|
|
|
3189 if (retval != NULL)
|
|
|
3190 {
|
|
|
3191 STRCPY(retval, tag_fname);
|
|
418
|
3192 vim_strncpy(retval + (p - tag_fname), fname,
|
|
|
3193 MAXPATHL - (p - tag_fname) - 1);
|
|
7
|
3194 /*
|
|
|
3195 * Translate names like "src/a/../b/file.c" into "src/b/file.c".
|
|
|
3196 */
|
|
|
3197 simplify_filename(retval);
|
|
|
3198 }
|
|
|
3199 }
|
|
|
3200 else
|
|
|
3201 retval = vim_strsave(fname);
|
|
|
3202
|
|
|
3203 vim_free(expanded_fname);
|
|
|
3204
|
|
|
3205 return retval;
|
|
|
3206 }
|
|
|
3207
|
|
|
3208 /*
|
|
|
3209 * Moves the tail part of the path (including the terminating NUL) pointed to
|
|
|
3210 * by "tail" to the new location pointed to by "here". This should accomodate
|
|
|
3211 * an overlapping move.
|
|
|
3212 */
|
|
|
3213 #define movetail(here, tail) mch_memmove(here, tail, STRLEN(tail) + (size_t)1)
|
|
|
3214
|
|
|
3215 /*
|
|
|
3216 * Converts a file name into a canonical form. It simplifies a file name into
|
|
|
3217 * its simplest form by stripping out unneeded components, if any. The
|
|
|
3218 * resulting file name is simplified in place and will either be the same
|
|
|
3219 * length as that supplied, or shorter.
|
|
|
3220 */
|
|
|
3221 void
|
|
|
3222 simplify_filename(filename)
|
|
|
3223 char_u *filename;
|
|
|
3224 {
|
|
|
3225 #ifndef AMIGA /* Amiga doesn't have "..", it uses "/" */
|
|
|
3226 int components = 0;
|
|
|
3227 char_u *p, *tail, *start;
|
|
|
3228 int stripping_disabled = FALSE;
|
|
|
3229 int relative = TRUE;
|
|
|
3230
|
|
|
3231 p = filename;
|
|
|
3232 #ifdef BACKSLASH_IN_FILENAME
|
|
|
3233 if (p[1] == ':') /* skip "x:" */
|
|
|
3234 p += 2;
|
|
|
3235 #endif
|
|
|
3236
|
|
|
3237 if (vim_ispathsep(*p))
|
|
|
3238 {
|
|
|
3239 relative = FALSE;
|
|
|
3240 do
|
|
|
3241 ++p;
|
|
|
3242 while (vim_ispathsep(*p));
|
|
|
3243 }
|
|
|
3244 start = p; /* remember start after "c:/" or "/" or "///" */
|
|
|
3245
|
|
|
3246 do
|
|
|
3247 {
|
|
|
3248 /* At this point "p" is pointing to the char following a single "/"
|
|
|
3249 * or "p" is at the "start" of the (absolute or relative) path name. */
|
|
|
3250 #ifdef VMS
|
|
|
3251 /* VMS allows device:[path] - don't strip the [ in directory */
|
|
|
3252 if ((*p == '[' || *p == '<') && p > filename && p[-1] == ':')
|
|
|
3253 {
|
|
|
3254 /* :[ or :< composition: vms directory component */
|
|
|
3255 ++components;
|
|
|
3256 p = getnextcomp(p + 1);
|
|
|
3257 }
|
|
|
3258 /* allow remote calls as host"user passwd"::device:[path] */
|
|
|
3259 else if (p[0] == ':' && p[1] == ':' && p > filename && p[-1] == '"' )
|
|
|
3260 {
|
|
|
3261 /* ":: composition: vms host/passwd component */
|
|
|
3262 ++components;
|
|
|
3263 p = getnextcomp(p + 2);
|
|
|
3264 }
|
|
|
3265 else
|
|
|
3266 #endif
|
|
|
3267 if (vim_ispathsep(*p))
|
|
|
3268 movetail(p, p + 1); /* remove duplicate "/" */
|
|
|
3269 else if (p[0] == '.' && (vim_ispathsep(p[1]) || p[1] == NUL))
|
|
|
3270 {
|
|
|
3271 if (p == start && relative)
|
|
|
3272 p += 1 + (p[1] != NUL); /* keep single "." or leading "./" */
|
|
|
3273 else
|
|
|
3274 {
|
|
|
3275 /* Strip "./" or ".///". If we are at the end of the file name
|
|
|
3276 * and there is no trailing path separator, either strip "/." if
|
|
|
3277 * we are after "start", or strip "." if we are at the beginning
|
|
|
3278 * of an absolute path name . */
|
|
|
3279 tail = p + 1;
|
|
|
3280 if (p[1] != NUL)
|
|
|
3281 while (vim_ispathsep(*tail))
|
|
39
|
3282 mb_ptr_adv(tail);
|
|
7
|
3283 else if (p > start)
|
|
|
3284 --p; /* strip preceding path separator */
|
|
|
3285 movetail(p, tail);
|
|
|
3286 }
|
|
|
3287 }
|
|
|
3288 else if (p[0] == '.' && p[1] == '.' &&
|
|
|
3289 (vim_ispathsep(p[2]) || p[2] == NUL))
|
|
|
3290 {
|
|
|
3291 /* Skip to after ".." or "../" or "..///". */
|
|
|
3292 tail = p + 2;
|
|
|
3293 while (vim_ispathsep(*tail))
|
|
39
|
3294 mb_ptr_adv(tail);
|
|
7
|
3295
|
|
|
3296 if (components > 0) /* strip one preceding component */
|
|
|
3297 {
|
|
|
3298 int do_strip = FALSE;
|
|
|
3299 char_u saved_char;
|
|
|
3300 struct stat st;
|
|
|
3301
|
|
|
3302 /* Don't strip for an erroneous file name. */
|
|
|
3303 if (!stripping_disabled)
|
|
|
3304 {
|
|
|
3305 /* If the preceding component does not exist in the file
|
|
|
3306 * system, we strip it. On Unix, we don't accept a symbolic
|
|
|
3307 * link that refers to a non-existent file. */
|
|
|
3308 saved_char = p[-1];
|
|
|
3309 p[-1] = NUL;
|
|
|
3310 #ifdef UNIX
|
|
|
3311 if (mch_lstat((char *)filename, &st) < 0)
|
|
|
3312 #else
|
|
|
3313 if (mch_stat((char *)filename, &st) < 0)
|
|
|
3314 #endif
|
|
|
3315 do_strip = TRUE;
|
|
|
3316 p[-1] = saved_char;
|
|
|
3317
|
|
|
3318 --p;
|
|
|
3319 /* Skip back to after previous '/'. */
|
|
39
|
3320 while (p > start && !after_pathsep(start, p))
|
|
|
3321 mb_ptr_back(start, p);
|
|
7
|
3322
|
|
|
3323 if (!do_strip)
|
|
|
3324 {
|
|
|
3325 /* If the component exists in the file system, check
|
|
|
3326 * that stripping it won't change the meaning of the
|
|
|
3327 * file name. First get information about the
|
|
|
3328 * unstripped file name. This may fail if the component
|
|
|
3329 * to strip is not a searchable directory (but a regular
|
|
|
3330 * file, for instance), since the trailing "/.." cannot
|
|
|
3331 * be applied then. We don't strip it then since we
|
|
|
3332 * don't want to replace an erroneous file name by
|
|
|
3333 * a valid one, and we disable stripping of later
|
|
|
3334 * components. */
|
|
|
3335 saved_char = *tail;
|
|
|
3336 *tail = NUL;
|
|
|
3337 if (mch_stat((char *)filename, &st) >= 0)
|
|
|
3338 do_strip = TRUE;
|
|
|
3339 else
|
|
|
3340 stripping_disabled = TRUE;
|
|
|
3341 *tail = saved_char;
|
|
|
3342 #ifdef UNIX
|
|
|
3343 if (do_strip)
|
|
|
3344 {
|
|
|
3345 struct stat new_st;
|
|
|
3346
|
|
|
3347 /* On Unix, the check for the unstripped file name
|
|
|
3348 * above works also for a symbolic link pointing to
|
|
|
3349 * a searchable directory. But then the parent of
|
|
|
3350 * the directory pointed to by the link must be the
|
|
|
3351 * same as the stripped file name. (The latter
|
|
|
3352 * exists in the file system since it is the
|
|
|
3353 * component's parent directory.) */
|
|
|
3354 if (p == start && relative)
|
|
|
3355 (void)mch_stat(".", &new_st);
|
|
|
3356 else
|
|
|
3357 {
|
|
|
3358 saved_char = *p;
|
|
|
3359 *p = NUL;
|
|
|
3360 (void)mch_stat((char *)filename, &new_st);
|
|
|
3361 *p = saved_char;
|
|
|
3362 }
|
|
|
3363
|
|
|
3364 if (new_st.st_ino != st.st_ino ||
|
|
|
3365 new_st.st_dev != st.st_dev)
|
|
|
3366 {
|
|
|
3367 do_strip = FALSE;
|
|
|
3368 /* We don't disable stripping of later
|
|
|
3369 * components since the unstripped path name is
|
|
|
3370 * still valid. */
|
|
|
3371 }
|
|
|
3372 }
|
|
|
3373 #endif
|
|
|
3374 }
|
|
|
3375 }
|
|
|
3376
|
|
|
3377 if (!do_strip)
|
|
|
3378 {
|
|
|
3379 /* Skip the ".." or "../" and reset the counter for the
|
|
|
3380 * components that might be stripped later on. */
|
|
|
3381 p = tail;
|
|
|
3382 components = 0;
|
|
|
3383 }
|
|
|
3384 else
|
|
|
3385 {
|
|
|
3386 /* Strip previous component. If the result would get empty
|
|
|
3387 * and there is no trailing path separator, leave a single
|
|
|
3388 * "." instead. If we are at the end of the file name and
|
|
|
3389 * there is no trailing path separator and a preceding
|
|
|
3390 * component is left after stripping, strip its trailing
|
|
|
3391 * path separator as well. */
|
|
|
3392 if (p == start && relative && tail[-1] == '.')
|
|
|
3393 {
|
|
|
3394 *p++ = '.';
|
|
|
3395 *p = NUL;
|
|
|
3396 }
|
|
|
3397 else
|
|
|
3398 {
|
|
|
3399 if (p > start && tail[-1] == '.')
|
|
|
3400 --p;
|
|
|
3401 movetail(p, tail); /* strip previous component */
|
|
|
3402 }
|
|
|
3403
|
|
|
3404 --components;
|
|
|
3405 }
|
|
|
3406 }
|
|
|
3407 else if (p == start && !relative) /* leading "/.." or "/../" */
|
|
|
3408 movetail(p, tail); /* strip ".." or "../" */
|
|
|
3409 else
|
|
|
3410 {
|
|
|
3411 if (p == start + 2 && p[-2] == '.') /* leading "./../" */
|
|
|
3412 {
|
|
|
3413 movetail(p - 2, p); /* strip leading "./" */
|
|
|
3414 tail -= 2;
|
|
|
3415 }
|
|
|
3416 p = tail; /* skip to char after ".." or "../" */
|
|
|
3417 }
|
|
|
3418 }
|
|
|
3419 else
|
|
|
3420 {
|
|
|
3421 ++components; /* simple path component */
|
|
|
3422 p = getnextcomp(p);
|
|
|
3423 }
|
|
|
3424 } while (*p != NUL);
|
|
|
3425 #endif /* !AMIGA */
|
|
|
3426 }
|
|
|
3427
|
|
|
3428 /*
|
|
|
3429 * Check if we have a tag for the buffer with name "buf_ffname".
|
|
|
3430 * This is a bit slow, because of the full path compare in fullpathcmp().
|
|
|
3431 * Return TRUE if tag for file "fname" if tag file "tag_fname" is for current
|
|
|
3432 * file.
|
|
|
3433 */
|
|
|
3434 static int
|
|
|
3435 #ifdef FEAT_EMACS_TAGS
|
|
|
3436 test_for_current(is_etag, fname, fname_end, tag_fname, buf_ffname)
|
|
|
3437 int is_etag;
|
|
|
3438 #else
|
|
|
3439 test_for_current(fname, fname_end, tag_fname, buf_ffname)
|
|
|
3440 #endif
|
|
|
3441 char_u *fname;
|
|
|
3442 char_u *fname_end;
|
|
|
3443 char_u *tag_fname;
|
|
|
3444 char_u *buf_ffname;
|
|
|
3445 {
|
|
|
3446 int c;
|
|
|
3447 int retval = FALSE;
|
|
|
3448 char_u *fullname;
|
|
|
3449
|
|
|
3450 if (buf_ffname != NULL) /* if the buffer has a name */
|
|
|
3451 {
|
|
|
3452 #ifdef FEAT_EMACS_TAGS
|
|
|
3453 if (is_etag)
|
|
|
3454 c = 0; /* to shut up GCC */
|
|
|
3455 else
|
|
|
3456 #endif
|
|
|
3457 {
|
|
|
3458 c = *fname_end;
|
|
|
3459 *fname_end = NUL;
|
|
|
3460 }
|
|
|
3461 fullname = expand_tag_fname(fname, tag_fname, TRUE);
|
|
|
3462 if (fullname != NULL)
|
|
|
3463 {
|
|
|
3464 retval = (fullpathcmp(fullname, buf_ffname, TRUE) & FPC_SAME);
|
|
|
3465 vim_free(fullname);
|
|
|
3466 }
|
|
|
3467 #ifdef FEAT_EMACS_TAGS
|
|
|
3468 if (!is_etag)
|
|
|
3469 #endif
|
|
|
3470 *fname_end = c;
|
|
|
3471 }
|
|
|
3472
|
|
|
3473 return retval;
|
|
|
3474 }
|
|
|
3475
|
|
|
3476 /*
|
|
|
3477 * Find the end of the tagaddress.
|
|
|
3478 * Return OK if ";\"" is following, FAIL otherwise.
|
|
|
3479 */
|
|
|
3480 static int
|
|
|
3481 find_extra(pp)
|
|
|
3482 char_u **pp;
|
|
|
3483 {
|
|
|
3484 char_u *str = *pp;
|
|
|
3485
|
|
|
3486 /* Repeat for addresses separated with ';' */
|
|
|
3487 for (;;)
|
|
|
3488 {
|
|
|
3489 if (VIM_ISDIGIT(*str))
|
|
|
3490 str = skipdigits(str);
|
|
|
3491 else if (*str == '/' || *str == '?')
|
|
|
3492 {
|
|
|
3493 str = skip_regexp(str + 1, *str, FALSE, NULL);
|
|
|
3494 if (*str != **pp)
|
|
|
3495 str = NULL;
|
|
|
3496 else
|
|
|
3497 ++str;
|
|
|
3498 }
|
|
|
3499 else
|
|
|
3500 str = NULL;
|
|
|
3501 if (str == NULL || *str != ';'
|
|
|
3502 || !(VIM_ISDIGIT(str[1]) || str[1] == '/' || str[1] == '?'))
|
|
|
3503 break;
|
|
|
3504 ++str; /* skip ';' */
|
|
|
3505 }
|
|
|
3506
|
|
|
3507 if (str != NULL && STRNCMP(str, ";\"", 2) == 0)
|
|
|
3508 {
|
|
|
3509 *pp = str;
|
|
|
3510 return OK;
|
|
|
3511 }
|
|
|
3512 return FAIL;
|
|
|
3513 }
|
|
|
3514
|
|
|
3515 #if defined(FEAT_CMDL_COMPL) || defined(PROTO)
|
|
|
3516 int
|
|
|
3517 expand_tags(tagnames, pat, num_file, file)
|
|
|
3518 int tagnames; /* expand tag names */
|
|
|
3519 char_u *pat;
|
|
|
3520 int *num_file;
|
|
|
3521 char_u ***file;
|
|
|
3522 {
|
|
|
3523 int i;
|
|
|
3524 int c;
|
|
|
3525 int tagnmflag;
|
|
|
3526 char_u tagnm[100];
|
|
|
3527 tagptrs_T t_p;
|
|
|
3528 int ret;
|
|
|
3529
|
|
|
3530 if (tagnames)
|
|
|
3531 tagnmflag = TAG_NAMES;
|
|
|
3532 else
|
|
|
3533 tagnmflag = 0;
|
|
|
3534 if (pat[0] == '/')
|
|
|
3535 ret = find_tags(pat + 1, num_file, file,
|
|
|
3536 TAG_REGEXP | tagnmflag | TAG_VERBOSE,
|
|
|
3537 TAG_MANY, curbuf->b_ffname);
|
|
|
3538 else
|
|
|
3539 ret = find_tags(pat, num_file, file,
|
|
|
3540 TAG_REGEXP | tagnmflag | TAG_VERBOSE | TAG_NOIC,
|
|
|
3541 TAG_MANY, curbuf->b_ffname);
|
|
|
3542 if (ret == OK && !tagnames)
|
|
|
3543 {
|
|
|
3544 /* Reorganize the tags for display and matching as strings of:
|
|
|
3545 * "<tagname>\0<kind>\0<filename>\0"
|
|
|
3546 */
|
|
|
3547 for (i = 0; i < *num_file; i++)
|
|
|
3548 {
|
|
|
3549 parse_match((*file)[i], &t_p);
|
|
|
3550 c = (int)(t_p.tagname_end - t_p.tagname);
|
|
|
3551 mch_memmove(tagnm, t_p.tagname, (size_t)c);
|
|
|
3552 tagnm[c++] = 0;
|
|
|
3553 tagnm[c++] = (t_p.tagkind != NULL && *t_p.tagkind)
|
|
|
3554 ? *t_p.tagkind : 'f';
|
|
|
3555 tagnm[c++] = 0;
|
|
|
3556 mch_memmove((*file)[i] + c, t_p.fname, t_p.fname_end - t_p.fname);
|
|
|
3557 (*file)[i][c + (t_p.fname_end - t_p.fname)] = 0;
|
|
|
3558 mch_memmove((*file)[i], tagnm, (size_t)c);
|
|
|
3559 }
|
|
|
3560 }
|
|
|
3561 return ret;
|
|
|
3562 }
|
|
|
3563 #endif
|
|
179
|
3564
|
|
|
3565 #if defined(FEAT_EVAL) || defined(PROTO)
|
|
|
3566 static int add_tag_field __ARGS((dict_T *dict, char *field_name, char_u *start, char_u *end));
|
|
|
3567
|
|
|
3568 /*
|
|
|
3569 * Add a tag field to the dictionary "dict"
|
|
|
3570 */
|
|
|
3571 static int
|
|
|
3572 add_tag_field(dict, field_name, start, end)
|
|
|
3573 dict_T *dict;
|
|
|
3574 char *field_name;
|
|
211
|
3575 char_u *start; /* start of the value */
|
|
|
3576 char_u *end; /* after the value; can be NULL */
|
|
179
|
3577 {
|
|
|
3578 char_u buf[MAXPATHL];
|
|
188
|
3579 int len = 0;
|
|
179
|
3580
|
|
188
|
3581 if (start != NULL)
|
|
|
3582 {
|
|
211
|
3583 if (end == NULL)
|
|
|
3584 {
|
|
|
3585 end = start + STRLEN(start);
|
|
|
3586 while (end > start && (end[-1] == '\r' || end[-1] == '\n'))
|
|
|
3587 --end;
|
|
|
3588 }
|
|
188
|
3589 len = end - start;
|
|
|
3590 if (len > sizeof(buf) - 1)
|
|
|
3591 len = sizeof(buf) - 1;
|
|
418
|
3592 vim_strncpy(buf, start, len);
|
|
188
|
3593 }
|
|
179
|
3594 buf[len] = NUL;
|
|
|
3595 return dict_add_nr_str(dict, field_name, 0L, buf);
|
|
|
3596 }
|
|
|
3597
|
|
|
3598 /*
|
|
|
3599 * Add the tags matching the specified pattern to the list "list"
|
|
|
3600 * as a dictionary
|
|
|
3601 */
|
|
|
3602 int
|
|
|
3603 get_tags(list, pat)
|
|
|
3604 list_T *list;
|
|
|
3605 char_u *pat;
|
|
|
3606 {
|
|
|
3607 int num_matches, i, ret;
|
|
|
3608 char_u **matches, *p;
|
|
|
3609 dict_T *dict;
|
|
|
3610 tagptrs_T tp;
|
|
|
3611 long is_static;
|
|
|
3612
|
|
|
3613 ret = find_tags(pat, &num_matches, &matches,
|
|
|
3614 TAG_REGEXP | TAG_NOIC, (int)MAXCOL, NULL);
|
|
|
3615 if (ret == OK && num_matches > 0)
|
|
|
3616 {
|
|
|
3617 for (i = 0; i < num_matches; ++i)
|
|
|
3618 {
|
|
188
|
3619 parse_match(matches[i], &tp);
|
|
|
3620 is_static = test_for_static(&tp);
|
|
|
3621
|
|
|
3622 /* Skip pseudo-tag lines. */
|
|
|
3623 if (STRNCMP(tp.tagname, "!_TAG_", 6) == 0)
|
|
|
3624 continue;
|
|
|
3625
|
|
179
|
3626 if ((dict = dict_alloc()) == NULL)
|
|
|
3627 ret = FAIL;
|
|
|
3628 if (list_append_dict(list, dict) == FAIL)
|
|
|
3629 ret = FAIL;
|
|
|
3630
|
|
|
3631 if (add_tag_field(dict, "name", tp.tagname, tp.tagname_end) == FAIL
|
|
|
3632 || add_tag_field(dict, "filename", tp.fname,
|
|
|
3633 tp.fname_end) == FAIL
|
|
|
3634 || add_tag_field(dict, "cmd", tp.command,
|
|
|
3635 tp.command_end) == FAIL
|
|
|
3636 || add_tag_field(dict, "kind", tp.tagkind,
|
|
|
3637 tp.tagkind_end) == FAIL
|
|
|
3638 || dict_add_nr_str(dict, "static", is_static, NULL) == FAIL)
|
|
|
3639 ret = FAIL;
|
|
|
3640
|
|
|
3641 if (tp.command_end != NULL)
|
|
|
3642 {
|
|
|
3643 for (p = tp.command_end + 3;
|
|
|
3644 *p != NUL && *p != '\n' && *p != '\r'; ++p)
|
|
|
3645 {
|
|
|
3646 if (p == tp.tagkind || (p + 5 == tp.tagkind
|
|
|
3647 && STRNCMP(p, "kind:", 5) == 0))
|
|
|
3648 /* skip "kind:<kind>" and "<kind>" */
|
|
|
3649 p = tp.tagkind_end - 1;
|
|
|
3650 else if (STRNCMP(p, "file:", 5) == 0)
|
|
|
3651 /* skip "file:" (static tag) */
|
|
|
3652 p += 4;
|
|
188
|
3653 else if (!vim_iswhite(*p))
|
|
179
|
3654 {
|
|
|
3655 char_u *s, *n;
|
|
188
|
3656 int len;
|
|
179
|
3657
|
|
188
|
3658 /* Add extra field as a dict entry. */
|
|
179
|
3659 n = p;
|
|
188
|
3660 while (*p != NUL && *p > ' ' && *p < 127 && *p != ':')
|
|
179
|
3661 ++p;
|
|
188
|
3662 len = p - n;
|
|
|
3663 if (*p == ':' && len > 0)
|
|
|
3664 {
|
|
|
3665 s = ++p;
|
|
|
3666 while (*p != NUL && *p > ' ' && *p < 127)
|
|
|
3667 ++p;
|
|
|
3668 n[len] = NUL;
|
|
|
3669 if (add_tag_field(dict, (char *)n, s, p) == FAIL)
|
|
|
3670 ret = FAIL;
|
|
|
3671 n[len] = ':';
|
|
|
3672 }
|
|
179
|
3673 --p;
|
|
|
3674 }
|
|
|
3675 }
|
|
|
3676 }
|
|
|
3677
|
|
|
3678 vim_free(matches[i]);
|
|
|
3679 }
|
|
|
3680 vim_free(matches);
|
|
|
3681 }
|
|
|
3682 return ret;
|
|
|
3683 }
|
|
|
3684 #endif
|
