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