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