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