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