?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
feat/tagfunc: if 'tfu' is called during completion, it gets 'i' flag.
[vim_extended.git] / src / tag.c
blob75c228d19111134d2fbf03f23781abd94e7d090a
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 * flags - used to compose a string containing flags passed to the function.
1257 */
1258 static int
1259 find_tfu_tags(pat, ga, match_count, flags)
1260 char_u *pat;
1261 garray_T *ga;
1262 int *match_count;
1263 int flags;
1264 {
1265 pos_T pos;
1266 list_T *taglist;
1267 listitem_T *item;
1268 int ntags = 0;
1269 int result = FAIL;
1270 char_u *args[2];
1271 char_u flagString[3];
1272
1273 if (*curbuf->b_p_tfu == NUL)
1274 goto done;
1275
1276 args[0] = pat;
1277 args[1] = flagString;
1278
1279 vim_snprintf((char *)flagString, sizeof(flagString),
1280 "%s%s",
1281 g_tag_at_cursor ? "c": "",
1282 flags & TAG_INS_COMP ? "i": "");
1283
1284 pos = curwin->w_cursor;
1285 taglist = call_func_retlist(curbuf->b_p_tfu, 2, args, FALSE);
1286 curwin->w_cursor = pos; /* restore the cursor position */
1287
1288 if (taglist == NULL)
1289 goto done;
1290
1291 for (item = taglist->lv_first; item != NULL; item = item->li_next)
1292 {
1293 struct match_found *mfp;
1294 char_u *res_name, *res_fname, *res_cmd, *res_kind;
1295 int len;
1296 struct dict_iterator_S iter;
1297 char_u *dict_key;
1298 typval_T *tv;
1299 int has_extra = 0;
1300
1301 if (item->li_tv.v_type != VAR_DICT)
1302 continue;
1303
1304 #ifdef FEAT_EMACS_TAGS
1305 len = 3;
1306 #else
1307 len = 2;
1308 #endif
1309
1310 res_name = NULL;
1311 res_fname = NULL;
1312 res_cmd = NULL;
1313 res_kind = NULL;
1314
1315 dict_iterate_start(&item->li_tv, &iter);
1316 while (NULL != (dict_key = dict_iterate_next(&iter, &tv)))
1317 {
1318 if (tv->v_type != VAR_STRING)
1319 continue;
1320
1321 len += STRLEN(tv->vval.v_string) + 1; /* Space for "\tVALUE". */
1322 if (!STRCMP(dict_key, "name"))
1323 {
1324 res_name = tv->vval.v_string;
1325 continue;
1326 }
1327 if (!STRCMP(dict_key, "filename"))
1328 {
1329 res_fname = tv->vval.v_string;
1330 continue;
1331 }
1332 if (!STRCMP(dict_key, "cmd"))
1333 {
1334 res_cmd = tv->vval.v_string;
1335 continue;
1336 }
1337 has_extra = 1;
1338 if (!STRCMP(dict_key, "kind"))
1339 {
1340 res_kind = tv->vval.v_string;
1341 continue;
1342 }
1343 len += STRLEN(dict_key) + 1; /* Other elements will be stored as "\tKEY:VALUE".
1344 * Allocate space for the key and the colon. */
1345 }
1346
1347 if (has_extra)
1348 len += 2; /* need space for ;" */
1349
1350 if (!res_name || !res_fname || !res_cmd)
1351 continue;
1352
1353 mfp = (struct match_found *)alloc(
1354 (int)sizeof(struct match_found) + len);
1355 if (mfp != NULL)
1356 {
1357 char_u *p;
1358 mfp->len = len;
1359 p = mfp->match;
1360 p[0] = 0; /* mtt */
1361 p[1] = NUL; /* no tag file name */
1362 p = p + 2;
1363 #ifdef FEAT_EMACS_TAGS
1364 *p = NUL;
1365 ++p;
1366 #endif
1367
1368 STRCPY(p, res_name);
1369 p += STRLEN(p);
1370
1371 *p++ = TAB;
1372 STRCPY(p, res_fname);
1373 p += STRLEN(p);
1374
1375 *p++ = TAB;
1376 STRCPY(p, res_cmd);
1377 p += STRLEN(p);
1378
1379 if (has_extra)
1380 {
1381 STRCPY(p, ";\"");
1382 p += STRLEN(p);
1383
1384 if (res_kind)
1385 {
1386 *p++ = TAB;
1387 STRCPY(p, res_kind);
1388 p += STRLEN(p);
1389 }
1390
1391 dict_iterate_start(&item->li_tv, &iter);
1392 while (NULL != (dict_key = dict_iterate_next(&iter, &tv)))
1393 {
1394 if (tv->v_type != VAR_STRING)
1395 continue;
1396
1397 if (!STRCMP(dict_key, "name"))
1398 continue;
1399 if (!STRCMP(dict_key, "filename"))
1400 continue;
1401 if (!STRCMP(dict_key, "cmd"))
1402 continue;
1403 if (!STRCMP(dict_key, "kind"))
1404 continue;
1405
1406 *p++ = TAB;
1407 STRCPY(p, dict_key);
1408 p += STRLEN(p);
1409 STRCPY(p, ":");
1410 p += STRLEN(p);
1411 STRCPY(p, tv->vval.v_string);
1412 p += STRLEN(p);
1413 }
1414 }
1415
1416 /* FIXME:2010-04-24:llorens: Don't add identical matches. */
1417 if (ga_grow(ga, 1) == OK)
1418 {
1419 ((struct match_found **)(ga->ga_data)) [ga->ga_len++] = mfp;
1420 ++ntags;
1421 result = OK;
1422 }
1423 else
1424 vim_free(mfp);
1425 }
1426 }
1427
1428 list_free(taglist, TRUE);
1429 done:
1430 *match_count = ntags;
1431 return result;
1432 }
1433
1434 /*
1435 * find_tags() - search for tags in tags files
1436 *
1437 * Return FAIL if search completely failed (*num_matches will be 0, *matchesp
1438 * will be NULL), OK otherwise.
1439 *
1440 * There is a priority in which type of tag is recognized.
1441 *
1442 * 6. A static or global tag with a full matching tag for the current file.
1443 * 5. A global tag with a full matching tag for another file.
1444 * 4. A static tag with a full matching tag for another file.
1445 * 3. A static or global tag with an ignore-case matching tag for the
1446 * current file.
1447 * 2. A global tag with an ignore-case matching tag for another file.
1448 * 1. A static tag with an ignore-case matching tag for another file.
1449 *
1450 * Tags in an emacs-style tags file are always global.
1451 *
1452 * flags:
1453 * TAG_HELP only search for help tags
1454 * TAG_NAMES only return name of tag
1455 * TAG_REGEXP use "pat" as a regexp
1456 * TAG_NOIC don't always ignore case
1457 * TAG_KEEP_LANG keep language
1458 * TAG_DONT_USE_TFU do not invoke the 'tagfunc' command
1459 */
1460 int
1461 find_tags(pat, num_matches, matchesp, flags, mincount, buf_ffname)
1462 char_u *pat; /* pattern to search for */
1463 int *num_matches; /* return: number of matches found */
1464 char_u ***matchesp; /* return: array of matches found */
1465 int flags;
1466 int mincount; /* MAXCOL: find all matches
1467 other: minimal number of matches */
1468 char_u *buf_ffname; /* name of buffer for priority */
1469 {
1470 FILE *fp;
1471 char_u *lbuf; /* line buffer */
1472 char_u *tag_fname; /* name of tag file */
1473 tagname_T tn; /* info for get_tagfname() */
1474 int first_file; /* trying first tag file */
1475 tagptrs_T tagp;
1476 int did_open = FALSE; /* did open a tag file */
1477 int stop_searching = FALSE; /* stop when match found or error */
1478 int retval = FAIL; /* return value */
1479 int is_static; /* current tag line is static */
1480 int is_current; /* file name matches */
1481 int eof = FALSE; /* found end-of-file */
1482 char_u *p;
1483 char_u *s;
1484 int i;
1485 #ifdef FEAT_TAG_BINS
1486 struct tag_search_info /* Binary search file offsets */
1487 {
1488 off_t low_offset; /* offset for first char of first line that
1489 could match */
1490 off_t high_offset; /* offset of char after last line that could
1491 match */
1492 off_t curr_offset; /* Current file offset in search range */
1493 off_t curr_offset_used; /* curr_offset used when skipping back */
1494 off_t match_offset; /* Where the binary search found a tag */
1495 int low_char; /* first char at low_offset */
1496 int high_char; /* first char at high_offset */
1497 } search_info;
1498 off_t filesize;
1499 int tagcmp;
1500 off_t offset;
1501 int round;
1502 #endif
1503 enum
1504 {
1505 TS_START, /* at start of file */
1506 TS_LINEAR /* linear searching forward, till EOF */
1507 #ifdef FEAT_TAG_BINS
1508 , TS_BINARY, /* binary searching */
1509 TS_SKIP_BACK, /* skipping backwards */
1510 TS_STEP_FORWARD /* stepping forwards */
1511 #endif
1512 } state; /* Current search state */
1513
1514 int cmplen;
1515 int match; /* matches */
1516 int match_no_ic = 0;/* matches with rm_ic == FALSE */
1517 int match_re; /* match with regexp */
1518 int matchoff = 0;
1519
1520 #ifdef FEAT_EMACS_TAGS
1521 /*
1522 * Stack for included emacs-tags file.
1523 * It has a fixed size, to truncate cyclic includes. jw
1524 */
1525 # define INCSTACK_SIZE 42
1526 struct
1527 {
1528 FILE *fp;
1529 char_u *etag_fname;
1530 } incstack[INCSTACK_SIZE];
1531
1532 int incstack_idx = 0; /* index in incstack */
1533 char_u *ebuf; /* additional buffer for etag fname */
1534 int is_etag; /* current file is emaces style */
1535 #endif
1536
1537 struct match_found *mfp, *mfp2;
1538 garray_T ga_match[MT_COUNT];
1539 int match_count = 0; /* number of matches found */
1540 char_u **matches;
1541 int mtt;
1542 int len;
1543 int help_save;
1544 #ifdef FEAT_MULTI_LANG
1545 int help_pri = 0;
1546 char_u *help_lang_find = NULL; /* lang to be found */
1547 char_u help_lang[3]; /* lang of current tags file */
1548 char_u *saved_pat = NULL; /* copy of pat[] */
1549 #endif
1550
1551 /* Use two sets of variables for the pattern: "orgpat" holds the values
1552 * for the original pattern and "convpat" converted from 'encoding' to
1553 * encoding of the tags file. "pats" point to either one of these. */
1554 pat_T *pats;
1555 pat_T orgpat; /* holds unconverted pattern info */
1556 #ifdef FEAT_MBYTE
1557 pat_T convpat; /* holds converted pattern info */
1558 vimconv_T vimconv;
1559 #endif
1560
1561 #ifdef FEAT_TAG_BINS
1562 int findall = (mincount == MAXCOL || mincount == TAG_MANY);
1563 /* find all matching tags */
1564 int sort_error = FALSE; /* tags file not sorted */
1565 int linear; /* do a linear search */
1566 int sortic = FALSE; /* tag file sorted in nocase */
1567 #endif
1568 int line_error = FALSE; /* syntax error */
1569 int has_re = (flags & TAG_REGEXP); /* regexp used */
1570 int help_only = (flags & TAG_HELP);
1571 int name_only = (flags & TAG_NAMES);
1572 int noic = (flags & TAG_NOIC);
1573 int get_it_again = FALSE;
1574 #ifdef FEAT_CSCOPE
1575 int use_cscope = (flags & TAG_CSCOPE);
1576 #endif
1577 int verbose = (flags & TAG_VERBOSE);
1578 int use_tfu = ((flags & TAG_DONT_USE_TFU) == 0);
1579 static int tfu_call_level = 0;
1580
1581 help_save = curbuf->b_help;
1582 orgpat.pat = pat;
1583 pats = &orgpat;
1584 #ifdef FEAT_MBYTE
1585 vimconv.vc_type = CONV_NONE;
1586 #endif
1587
1588 /*
1589 * Allocate memory for the buffers that are used
1590 */
1591 lbuf = alloc(LSIZE);
1592 tag_fname = alloc(MAXPATHL + 1);
1593 #ifdef FEAT_EMACS_TAGS
1594 ebuf = alloc(LSIZE);
1595 #endif
1596 for (mtt = 0; mtt < MT_COUNT; ++mtt)
1597 ga_init2(&ga_match[mtt], (int)sizeof(struct match_found *), 100);
1598
1599 /* check for out of memory situation */
1600 if (lbuf == NULL || tag_fname == NULL
1601 #ifdef FEAT_EMACS_TAGS
1602 || ebuf == NULL
1603 #endif
1604 )
1605 goto findtag_end;
1606
1607 #ifdef FEAT_CSCOPE
1608 STRCPY(tag_fname, "from cscope"); /* for error messages */
1609 #endif
1610
1611 /*
1612 * Initialize a few variables
1613 */
1614 if (help_only) /* want tags from help file */
1615 curbuf->b_help = TRUE; /* will be restored later */
1616
1617 pats->len = (int)STRLEN(pat);
1618 #ifdef FEAT_MULTI_LANG
1619 if (curbuf->b_help)
1620 {
1621 /* When "@ab" is specified use only the "ab" language, otherwise
1622 * search all languages. */
1623 if (pats->len > 3 && pat[pats->len - 3] == '@'
1624 && ASCII_ISALPHA(pat[pats->len - 2])
1625 && ASCII_ISALPHA(pat[pats->len - 1]))
1626 {
1627 saved_pat = vim_strnsave(pat, pats->len - 3);
1628 if (saved_pat != NULL)
1629 {
1630 help_lang_find = &pat[pats->len - 2];
1631 pats->pat = saved_pat;
1632 pats->len -= 3;
1633 }
1634 }
1635 }
1636 #endif
1637 if (p_tl != 0 && pats->len > p_tl) /* adjust for 'taglength' */
1638 pats->len = p_tl;
1639
1640 prepare_pats(pats, has_re);
1641
1642 #ifdef FEAT_TAG_BINS
1643 /* This is only to avoid a compiler warning for using search_info
1644 * uninitialised. */
1645 vim_memset(&search_info, 0, (size_t)1);
1646 #endif
1647
1648 if (*curbuf->b_p_tfu != NUL && use_tfu && tfu_call_level == 0)
1649 {
1650 ++tfu_call_level;
1651 retval = find_tfu_tags(pat, &ga_match[0], &match_count, flags);
1652 --tfu_call_level;
1653 goto findtag_end;
1654 }
1655
1656 /*
1657 * When finding a specified number of matches, first try with matching
1658 * case, so binary search can be used, and try ignore-case matches in a
1659 * second loop.
1660 * When finding all matches, 'tagbsearch' is off, or there is no fixed
1661 * string to look for, ignore case right away to avoid going though the
1662 * tags files twice.
1663 * When the tag file is case-fold sorted, it is either one or the other.
1664 * Only ignore case when TAG_NOIC not used or 'ignorecase' set.
1665 */
1666 #ifdef FEAT_TAG_BINS
1667 pats->regmatch.rm_ic = ((p_ic || !noic)
1668 && (findall || pats->headlen == 0 || !p_tbs));
1669 for (round = 1; round <= 2; ++round)
1670 {
1671 linear = (pats->headlen == 0 || !p_tbs || round == 2);
1672 #else
1673 pats->regmatch.rm_ic = (p_ic || !noic);
1674 #endif
1675
1676 /*
1677 * Try tag file names from tags option one by one.
1678 */
1679 for (first_file = TRUE;
1680 #ifdef FEAT_CSCOPE
1681 use_cscope ||
1682 #endif
1683 get_tagfname(&tn, first_file, tag_fname) == OK;
1684 first_file = FALSE)
1685 {
1686 /*
1687 * A file that doesn't exist is silently ignored. Only when not a
1688 * single file is found, an error message is given (further on).
1689 */
1690 #ifdef FEAT_CSCOPE
1691 if (use_cscope)
1692 fp = NULL; /* avoid GCC warning */
1693 else
1694 #endif
1695 {
1696 #ifdef FEAT_MULTI_LANG
1697 if (curbuf->b_help)
1698 {
1699 /* Prefer help tags according to 'helplang'. Put the
1700 * two-letter language name in help_lang[]. */
1701 i = (int)STRLEN(tag_fname);
1702 if (i > 3 && tag_fname[i - 3] == '-')
1703 STRCPY(help_lang, tag_fname + i - 2);
1704 else
1705 STRCPY(help_lang, "en");
1706
1707 /* When searching for a specific language skip tags files
1708 * for other languages. */
1709 if (help_lang_find != NULL
1710 && STRICMP(help_lang, help_lang_find) != 0)
1711 continue;
1712
1713 /* For CTRL-] in a help file prefer a match with the same
1714 * language. */
1715 if ((flags & TAG_KEEP_LANG)
1716 && help_lang_find == NULL
1717 && curbuf->b_fname != NULL
1718 && (i = (int)STRLEN(curbuf->b_fname)) > 4
1719 && curbuf->b_fname[i - 1] == 'x'
1720 && curbuf->b_fname[i - 4] == '.'
1721 && STRNICMP(curbuf->b_fname + i - 3, help_lang, 2) == 0)
1722 help_pri = 0;
1723 else
1724 {
1725 help_pri = 1;
1726 for (s = p_hlg; *s != NUL; ++s)
1727 {
1728 if (STRNICMP(s, help_lang, 2) == 0)
1729 break;
1730 ++help_pri;
1731 if ((s = vim_strchr(s, ',')) == NULL)
1732 break;
1733 }
1734 if (s == NULL || *s == NUL)
1735 {
1736 /* Language not in 'helplang': use last, prefer English,
1737 * unless found already. */
1738 ++help_pri;
1739 if (STRICMP(help_lang, "en") != 0)
1740 ++help_pri;
1741 }
1742 }
1743 }
1744 #endif
1745
1746 if ((fp = mch_fopen((char *)tag_fname, "r")) == NULL)
1747 continue;
1748
1749 if (p_verbose >= 5)
1750 {
1751 verbose_enter();
1752 smsg((char_u *)_("Searching tags file %s"), tag_fname);
1753 verbose_leave();
1754 }
1755 }
1756 did_open = TRUE; /* remember that we found at least one file */
1757
1758 state = TS_START; /* we're at the start of the file */
1759 #ifdef FEAT_EMACS_TAGS
1760 is_etag = 0; /* default is: not emacs style */
1761 #endif
1762
1763 /*
1764 * Read and parse the lines in the file one by one
1765 */
1766 for (;;)
1767 {
1768 line_breakcheck(); /* check for CTRL-C typed */
1769 #ifdef FEAT_INS_EXPAND
1770 if ((flags & TAG_INS_COMP)) /* Double brackets for gcc */
1771 ins_compl_check_keys(30);
1772 if (got_int || compl_interrupted)
1773 #else
1774 if (got_int)
1775 #endif
1776 {
1777 stop_searching = TRUE;
1778 break;
1779 }
1780 /* When mincount is TAG_MANY, stop when enough matches have been
1781 * found (for completion). */
1782 if (mincount == TAG_MANY && match_count >= TAG_MANY)
1783 {
1784 stop_searching = TRUE;
1785 retval = OK;
1786 break;
1787 }
1788 if (get_it_again)
1789 goto line_read_in;
1790 #ifdef FEAT_TAG_BINS
1791 /*
1792 * For binary search: compute the next offset to use.
1793 */
1794 if (state == TS_BINARY)
1795 {
1796 offset = search_info.low_offset + ((search_info.high_offset
1797 - search_info.low_offset) / 2);
1798 if (offset == search_info.curr_offset)
1799 break; /* End the binary search without a match. */
1800 else
1801 search_info.curr_offset = offset;
1802 }
1803
1804 /*
1805 * Skipping back (after a match during binary search).
1806 */
1807 else if (state == TS_SKIP_BACK)
1808 {
1809 search_info.curr_offset -= LSIZE * 2;
1810 if (search_info.curr_offset < 0)
1811 {
1812 search_info.curr_offset = 0;
1813 rewind(fp);
1814 state = TS_STEP_FORWARD;
1815 }
1816 }
1817
1818 /*
1819 * When jumping around in the file, first read a line to find the
1820 * start of the next line.
1821 */
1822 if (state == TS_BINARY || state == TS_SKIP_BACK)
1823 {
1824 /* Adjust the search file offset to the correct position */
1825 search_info.curr_offset_used = search_info.curr_offset;
1826 #ifdef HAVE_FSEEKO
1827 fseeko(fp, search_info.curr_offset, SEEK_SET);
1828 #else
1829 fseek(fp, (long)search_info.curr_offset, SEEK_SET);
1830 #endif
1831 eof = tag_fgets(lbuf, LSIZE, fp);
1832 if (!eof && search_info.curr_offset != 0)
1833 {
1834 /* The explicit cast is to work around a bug in gcc 3.4.2
1835 * (repeated below). */
1836 search_info.curr_offset = ftell(fp);
1837 if (search_info.curr_offset == search_info.high_offset)
1838 {
1839 /* oops, gone a bit too far; try from low offset */
1840 #ifdef HAVE_FSEEKO
1841 fseeko(fp, search_info.low_offset, SEEK_SET);
1842 #else
1843 fseek(fp, (long)search_info.low_offset, SEEK_SET);
1844 #endif
1845 search_info.curr_offset = search_info.low_offset;
1846 }
1847 eof = tag_fgets(lbuf, LSIZE, fp);
1848 }
1849 /* skip empty and blank lines */
1850 while (!eof && vim_isblankline(lbuf))
1851 {
1852 search_info.curr_offset = ftell(fp);
1853 eof = tag_fgets(lbuf, LSIZE, fp);
1854 }
1855 if (eof)
1856 {
1857 /* Hit end of file. Skip backwards. */
1858 state = TS_SKIP_BACK;
1859 search_info.match_offset = ftell(fp);
1860 search_info.curr_offset = search_info.curr_offset_used;
1861 continue;
1862 }
1863 }
1864
1865 /*
1866 * Not jumping around in the file: Read the next line.
1867 */
1868 else
1869 #endif
1870 {
1871 /* skip empty and blank lines */
1872 do
1873 {
1874 #ifdef FEAT_CSCOPE
1875 if (use_cscope)
1876 eof = cs_fgets(lbuf, LSIZE);
1877 else
1878 #endif
1879 eof = tag_fgets(lbuf, LSIZE, fp);
1880 } while (!eof && vim_isblankline(lbuf));
1881
1882 if (eof)
1883 {
1884 #ifdef FEAT_EMACS_TAGS
1885 if (incstack_idx) /* this was an included file */
1886 {
1887 --incstack_idx;
1888 fclose(fp); /* end of this file ... */
1889 fp = incstack[incstack_idx].fp;
1890 STRCPY(tag_fname, incstack[incstack_idx].etag_fname);
1891 vim_free(incstack[incstack_idx].etag_fname);
1892 is_etag = 1; /* (only etags can include) */
1893 continue; /* ... continue with parent file */
1894 }
1895 else
1896 #endif
1897 break; /* end of file */
1898 }
1899 }
1900 line_read_in:
1901
1902 #ifdef FEAT_EMACS_TAGS
1903 /*
1904 * Emacs tags line with CTRL-L: New file name on next line.
1905 * The file name is followed by a ','.
1906 */
1907 if (*lbuf == Ctrl_L) /* remember etag file name in ebuf */
1908 {
1909 is_etag = 1; /* in case at the start */
1910 state = TS_LINEAR;
1911 if (!tag_fgets(ebuf, LSIZE, fp))
1912 {
1913 for (p = ebuf; *p && *p != ','; p++)
1914 ;
1915 *p = NUL;
1916
1917 /*
1918 * atoi(p+1) is the number of bytes before the next ^L
1919 * unless it is an include statement.
1920 */
1921 if (STRNCMP(p + 1, "include", 7) == 0
1922 && incstack_idx < INCSTACK_SIZE)
1923 {
1924 /* Save current "fp" and "tag_fname" in the stack. */
1925 if ((incstack[incstack_idx].etag_fname =
1926 vim_strsave(tag_fname)) != NULL)
1927 {
1928 char_u *fullpath_ebuf;
1929
1930 incstack[incstack_idx].fp = fp;
1931 fp = NULL;
1932
1933 /* Figure out "tag_fname" and "fp" to use for
1934 * included file. */
1935 fullpath_ebuf = expand_tag_fname(ebuf,
1936 tag_fname, FALSE);
1937 if (fullpath_ebuf != NULL)
1938 {
1939 fp = mch_fopen((char *)fullpath_ebuf, "r");
1940 if (fp != NULL)
1941 {
1942 if (STRLEN(fullpath_ebuf) > LSIZE)
1943 EMSG2(_("E430: Tag file path truncated for %s\n"), ebuf);
1944 vim_strncpy(tag_fname, fullpath_ebuf,
1945 MAXPATHL);
1946 ++incstack_idx;
1947 is_etag = 0; /* we can include anything */
1948 }
1949 vim_free(fullpath_ebuf);
1950 }
1951 if (fp == NULL)
1952 {
1953 /* Can't open the included file, skip it and
1954 * restore old value of "fp". */
1955 fp = incstack[incstack_idx].fp;
1956 vim_free(incstack[incstack_idx].etag_fname);
1957 }
1958 }
1959 }
1960 }
1961 continue;
1962 }
1963 #endif
1964
1965 /*
1966 * When still at the start of the file, check for Emacs tags file
1967 * format, and for "not sorted" flag.
1968 */
1969 if (state == TS_START)
1970 {
1971 #ifdef FEAT_TAG_BINS
1972 /*
1973 * When there is no tag head, or ignoring case, need to do a
1974 * linear search.
1975 * When no "!_TAG_" is found, default to binary search. If
1976 * the tag file isn't sorted, the second loop will find it.
1977 * When "!_TAG_FILE_SORTED" found: start binary search if
1978 * flag set.
1979 * For cscope, it's always linear.
1980 */
1981 # ifdef FEAT_CSCOPE
1982 if (linear || use_cscope)
1983 # else
1984 if (linear)
1985 # endif
1986 state = TS_LINEAR;
1987 else if (STRNCMP(lbuf, "!_TAG_", 6) > 0)
1988 state = TS_BINARY;
1989 else if (STRNCMP(lbuf, "!_TAG_FILE_SORTED\t", 18) == 0)
1990 {
1991 /* Check sorted flag */
1992 if (lbuf[18] == '1')
1993 state = TS_BINARY;
1994 else if (lbuf[18] == '2')
1995 {
1996 state = TS_BINARY;
1997 sortic = TRUE;
1998 pats->regmatch.rm_ic = (p_ic || !noic);
1999 }
2000 else
2001 state = TS_LINEAR;
2002 }
2003
2004 if (state == TS_BINARY && pats->regmatch.rm_ic && !sortic)
2005 {
2006 /* binary search won't work for ignoring case, use linear
2007 * search. */
2008 linear = TRUE;
2009 state = TS_LINEAR;
2010 }
2011 #else
2012 state = TS_LINEAR;
2013 #endif
2014
2015 #ifdef FEAT_TAG_BINS
2016 /*
2017 * When starting a binary search, get the size of the file and
2018 * compute the first offset.
2019 */
2020 if (state == TS_BINARY)
2021 {
2022 /* Get the tag file size (don't use mch_fstat(), it's not
2023 * portable). */
2024 if ((filesize = lseek(fileno(fp),
2025 (off_t)0L, SEEK_END)) <= 0)
2026 state = TS_LINEAR;
2027 else
2028 {
2029 lseek(fileno(fp), (off_t)0L, SEEK_SET);
2030
2031 /* Calculate the first read offset in the file. Start
2032 * the search in the middle of the file. */
2033 search_info.low_offset = 0;
2034 search_info.low_char = 0;
2035 search_info.high_offset = filesize;
2036 search_info.curr_offset = 0;
2037 search_info.high_char = 0xff;
2038 }
2039 continue;
2040 }
2041 #endif
2042 }
2043
2044 #ifdef FEAT_MBYTE
2045 if (lbuf[0] == '!' && pats == &orgpat
2046 && STRNCMP(lbuf, "!_TAG_FILE_ENCODING\t", 20) == 0)
2047 {
2048 /* Convert the search pattern from 'encoding' to the
2049 * specified encoding. */
2050 for (p = lbuf + 20; *p > ' ' && *p < 127; ++p)
2051 ;
2052 *p = NUL;
2053 convert_setup(&vimconv, p_enc, lbuf + 20);
2054 if (vimconv.vc_type != CONV_NONE)
2055 {
2056 convpat.pat = string_convert(&vimconv, pats->pat, NULL);
2057 if (convpat.pat != NULL)
2058 {
2059 pats = &convpat;
2060 pats->len = (int)STRLEN(pats->pat);
2061 prepare_pats(pats, has_re);
2062 pats->regmatch.rm_ic = orgpat.regmatch.rm_ic;
2063 }
2064 }
2065
2066 /* Prepare for converting a match the other way around. */
2067 convert_setup(&vimconv, lbuf + 20, p_enc);
2068 continue;
2069 }
2070 #endif
2071
2072 /*
2073 * Figure out where the different strings are in this line.
2074 * For "normal" tags: Do a quick check if the tag matches.
2075 * This speeds up tag searching a lot!
2076 */
2077 if (pats->headlen
2078 #ifdef FEAT_EMACS_TAGS
2079 && !is_etag
2080 #endif
2081 )
2082 {
2083 tagp.tagname = lbuf;
2084 #ifdef FEAT_TAG_ANYWHITE
2085 tagp.tagname_end = skiptowhite(lbuf);
2086 if (*tagp.tagname_end == NUL) /* corrupted tag line */
2087 #else
2088 tagp.tagname_end = vim_strchr(lbuf, TAB);
2089 if (tagp.tagname_end == NULL) /* corrupted tag line */
2090 #endif
2091 {
2092 line_error = TRUE;
2093 break;
2094 }
2095
2096 #ifdef FEAT_TAG_OLDSTATIC
2097 /*
2098 * Check for old style static tag: "file:tag file .."
2099 */
2100 tagp.fname = NULL;
2101 for (p = lbuf; p < tagp.tagname_end; ++p)
2102 {
2103 if (*p == ':')
2104 {
2105 if (tagp.fname == NULL)
2106 #ifdef FEAT_TAG_ANYWHITE
2107 tagp.fname = skipwhite(tagp.tagname_end);
2108 #else
2109 tagp.fname = tagp.tagname_end + 1;
2110 #endif
2111 if ( fnamencmp(lbuf, tagp.fname, p - lbuf) == 0
2112 #ifdef FEAT_TAG_ANYWHITE
2113 && vim_iswhite(tagp.fname[p - lbuf])
2114 #else
2115 && tagp.fname[p - lbuf] == TAB
2116 #endif
2117 )
2118 {
2119 /* found one */
2120 tagp.tagname = p + 1;
2121 break;
2122 }
2123 }
2124 }
2125 #endif
2126
2127 /*
2128 * Skip this line if the length of the tag is different and
2129 * there is no regexp, or the tag is too short.
2130 */
2131 cmplen = (int)(tagp.tagname_end - tagp.tagname);
2132 if (p_tl != 0 && cmplen > p_tl) /* adjust for 'taglength' */
2133 cmplen = p_tl;
2134 if (has_re && pats->headlen < cmplen)
2135 cmplen = pats->headlen;
2136 else if (state == TS_LINEAR && pats->headlen != cmplen)
2137 continue;
2138
2139 #ifdef FEAT_TAG_BINS
2140 if (state == TS_BINARY)
2141 {
2142 /*
2143 * Simplistic check for unsorted tags file.
2144 */
2145 i = (int)tagp.tagname[0];
2146 if (sortic)
2147 i = (int)TOUPPER_ASC(tagp.tagname[0]);
2148 if (i < search_info.low_char || i > search_info.high_char)
2149 sort_error = TRUE;
2150
2151 /*
2152 * Compare the current tag with the searched tag.
2153 */
2154 if (sortic)
2155 tagcmp = tag_strnicmp(tagp.tagname, pats->head,
2156 (size_t)cmplen);
2157 else
2158 tagcmp = STRNCMP(tagp.tagname, pats->head, cmplen);
2159
2160 /*
2161 * A match with a shorter tag means to search forward.
2162 * A match with a longer tag means to search backward.
2163 */
2164 if (tagcmp == 0)
2165 {
2166 if (cmplen < pats->headlen)
2167 tagcmp = -1;
2168 else if (cmplen > pats->headlen)
2169 tagcmp = 1;
2170 }
2171
2172 if (tagcmp == 0)
2173 {
2174 /* We've located the tag, now skip back and search
2175 * forward until the first matching tag is found.
2176 */
2177 state = TS_SKIP_BACK;
2178 search_info.match_offset = search_info.curr_offset;
2179 continue;
2180 }
2181 if (tagcmp < 0)
2182 {
2183 search_info.curr_offset = ftell(fp);
2184 if (search_info.curr_offset < search_info.high_offset)
2185 {
2186 search_info.low_offset = search_info.curr_offset;
2187 if (sortic)
2188 search_info.low_char =
2189 TOUPPER_ASC(tagp.tagname[0]);
2190 else
2191 search_info.low_char = tagp.tagname[0];
2192 continue;
2193 }
2194 }
2195 if (tagcmp > 0
2196 && search_info.curr_offset != search_info.high_offset)
2197 {
2198 search_info.high_offset = search_info.curr_offset;
2199 if (sortic)
2200 search_info.high_char =
2201 TOUPPER_ASC(tagp.tagname[0]);
2202 else
2203 search_info.high_char = tagp.tagname[0];
2204 continue;
2205 }
2206
2207 /* No match yet and are at the end of the binary search. */
2208 break;
2209 }
2210 else if (state == TS_SKIP_BACK)
2211 {
2212 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
2213 state = TS_STEP_FORWARD;
2214 else
2215 /* Have to skip back more. Restore the curr_offset
2216 * used, otherwise we get stuck at a long line. */
2217 search_info.curr_offset = search_info.curr_offset_used;
2218 continue;
2219 }
2220 else if (state == TS_STEP_FORWARD)
2221 {
2222 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
2223 {
2224 if ((off_t)ftell(fp) > search_info.match_offset)
2225 break; /* past last match */
2226 else
2227 continue; /* before first match */
2228 }
2229 }
2230 else
2231 #endif
2232 /* skip this match if it can't match */
2233 if (MB_STRNICMP(tagp.tagname, pats->head, cmplen) != 0)
2234 continue;
2235
2236 /*
2237 * Can be a matching tag, isolate the file name and command.
2238 */
2239 #ifdef FEAT_TAG_OLDSTATIC
2240 if (tagp.fname == NULL)
2241 #endif
2242 #ifdef FEAT_TAG_ANYWHITE
2243 tagp.fname = skipwhite(tagp.tagname_end);
2244 #else
2245 tagp.fname = tagp.tagname_end + 1;
2246 #endif
2247 #ifdef FEAT_TAG_ANYWHITE
2248 tagp.fname_end = skiptowhite(tagp.fname);
2249 tagp.command = skipwhite(tagp.fname_end);
2250 if (*tagp.command == NUL)
2251 #else
2252 tagp.fname_end = vim_strchr(tagp.fname, TAB);
2253 tagp.command = tagp.fname_end + 1;
2254 if (tagp.fname_end == NULL)
2255 #endif
2256 i = FAIL;
2257 else
2258 i = OK;
2259 }
2260 else
2261 i = parse_tag_line(lbuf,
2262 #ifdef FEAT_EMACS_TAGS
2263 is_etag,
2264 #endif
2265 &tagp);
2266 if (i == FAIL)
2267 {
2268 line_error = TRUE;
2269 break;
2270 }
2271
2272 #ifdef FEAT_EMACS_TAGS
2273 if (is_etag)
2274 tagp.fname = ebuf;
2275 #endif
2276 /*
2277 * First try matching with the pattern literally (also when it is
2278 * a regexp).
2279 */
2280 cmplen = (int)(tagp.tagname_end - tagp.tagname);
2281 if (p_tl != 0 && cmplen > p_tl) /* adjust for 'taglength' */
2282 cmplen = p_tl;
2283 /* if tag length does not match, don't try comparing */
2284 if (pats->len != cmplen)
2285 match = FALSE;
2286 else
2287 {
2288 if (pats->regmatch.rm_ic)
2289 {
2290 match = (MB_STRNICMP(tagp.tagname, pats->pat, cmplen) == 0);
2291 if (match)
2292 match_no_ic = (STRNCMP(tagp.tagname, pats->pat,
2293 cmplen) == 0);
2294 }
2295 else
2296 match = (STRNCMP(tagp.tagname, pats->pat, cmplen) == 0);
2297 }
2298
2299 /*
2300 * Has a regexp: Also find tags matching regexp.
2301 */
2302 match_re = FALSE;
2303 if (!match && pats->regmatch.regprog != NULL)
2304 {
2305 int cc;
2306
2307 cc = *tagp.tagname_end;
2308 *tagp.tagname_end = NUL;
2309 match = vim_regexec(&pats->regmatch, tagp.tagname, (colnr_T)0);
2310 if (match)
2311 {
2312 matchoff = (int)(pats->regmatch.startp[0] - tagp.tagname);
2313 if (pats->regmatch.rm_ic)
2314 {
2315 pats->regmatch.rm_ic = FALSE;
2316 match_no_ic = vim_regexec(&pats->regmatch, tagp.tagname,
2317 (colnr_T)0);
2318 pats->regmatch.rm_ic = TRUE;
2319 }
2320 }
2321 *tagp.tagname_end = cc;
2322 match_re = TRUE;
2323 }
2324
2325 /*
2326 * If a match is found, add it to ga_match[].
2327 */
2328 if (match)
2329 {
2330 #ifdef FEAT_CSCOPE
2331 if (use_cscope)
2332 {
2333 /* Don't change the ordering, always use the same table. */
2334 mtt = MT_GL_OTH;
2335 }
2336 else
2337 #endif
2338 {
2339 /* Decide in which array to store this match. */
2340 is_current = test_for_current(
2341 #ifdef FEAT_EMACS_TAGS
2342 is_etag,
2343 #endif
2344 tagp.fname, tagp.fname_end, tag_fname,
2345 buf_ffname);
2346 #ifdef FEAT_EMACS_TAGS
2347 is_static = FALSE;
2348 if (!is_etag) /* emacs tags are never static */
2349 #endif
2350 {
2351 #ifdef FEAT_TAG_OLDSTATIC
2352 if (tagp.tagname != lbuf)
2353 is_static = TRUE; /* detected static tag before */
2354 else
2355 #endif
2356 is_static = test_for_static(&tagp);
2357 }
2358
2359 /* decide in which of the sixteen tables to store this
2360 * match */
2361 if (is_static)
2362 {
2363 if (is_current)
2364 mtt = MT_ST_CUR;
2365 else
2366 mtt = MT_ST_OTH;
2367 }
2368 else
2369 {
2370 if (is_current)
2371 mtt = MT_GL_CUR;
2372 else
2373 mtt = MT_GL_OTH;
2374 }
2375 if (pats->regmatch.rm_ic && !match_no_ic)
2376 mtt += MT_IC_OFF;
2377 if (match_re)
2378 mtt += MT_RE_OFF;
2379 }
2380
2381 /*
2382 * Add the found match in ga_match[mtt], avoiding duplicates.
2383 * Store the info we need later, which depends on the kind of
2384 * tags we are dealing with.
2385 */
2386 if (ga_grow(&ga_match[mtt], 1) == OK)
2387 {
2388 #ifdef FEAT_MBYTE
2389 char_u *conv_line = NULL;
2390 char_u *lbuf_line = lbuf;
2391
2392 if (vimconv.vc_type != CONV_NONE)
2393 {
2394 /* Convert the tag line from the encoding of the tags
2395 * file to 'encoding'. Then parse the line again. */
2396 conv_line = string_convert(&vimconv, lbuf, NULL);
2397 if (conv_line != NULL)
2398 {
2399 if (parse_tag_line(conv_line,
2400 #ifdef FEAT_EMACS_TAGS
2401 is_etag,
2402 #endif
2403 &tagp) == OK)
2404 lbuf_line = conv_line;
2405 else
2406 /* doesn't work, go back to unconverted line. */
2407 (void)parse_tag_line(lbuf,
2408 #ifdef FEAT_EMACS_TAGS
2409 is_etag,
2410 #endif
2411 &tagp);
2412 }
2413 }
2414 #else
2415 # define lbuf_line lbuf
2416 #endif
2417 if (help_only)
2418 {
2419 #ifdef FEAT_MULTI_LANG
2420 # define ML_EXTRA 3
2421 #else
2422 # define ML_EXTRA 0
2423 #endif
2424 /*
2425 * Append the help-heuristic number after the
2426 * tagname, for sorting it later.
2427 */
2428 *tagp.tagname_end = NUL;
2429 len = (int)(tagp.tagname_end - tagp.tagname);
2430 mfp = (struct match_found *)
2431 alloc((int)sizeof(struct match_found) + len
2432 + 10 + ML_EXTRA);
2433 if (mfp != NULL)
2434 {
2435 /* "len" includes the language and the NUL, but
2436 * not the priority. */
2437 mfp->len = len + ML_EXTRA + 1;
2438 #define ML_HELP_LEN 6
2439 p = mfp->match;
2440 STRCPY(p, tagp.tagname);
2441 #ifdef FEAT_MULTI_LANG
2442 p[len] = '@';
2443 STRCPY(p + len + 1, help_lang);
2444 #endif
2445 sprintf((char *)p + len + 1 + ML_EXTRA, "%06d",
2446 help_heuristic(tagp.tagname,
2447 match_re ? matchoff : 0, !match_no_ic)
2448 #ifdef FEAT_MULTI_LANG
2449 + help_pri
2450 #endif
2451 );
2452 }
2453 *tagp.tagname_end = TAB;
2454 }
2455 else if (name_only)
2456 {
2457 if (get_it_again)
2458 {
2459 char_u *temp_end = tagp.command;
2460
2461 if (*temp_end == '/')
2462 while (*temp_end && *temp_end != '\r'
2463 && *temp_end != '\n'
2464 && *temp_end != '$')
2465 temp_end++;
2466
2467 if (tagp.command + 2 < temp_end)
2468 {
2469 len = (int)(temp_end - tagp.command - 2);
2470 mfp = (struct match_found *)alloc(
2471 (int)sizeof(struct match_found) + len);
2472 if (mfp != NULL)
2473 {
2474 mfp->len = len + 1; /* include the NUL */
2475 p = mfp->match;
2476 vim_strncpy(p, tagp.command + 2, len);
2477 }
2478 }
2479 else
2480 mfp = NULL;
2481 get_it_again = FALSE;
2482 }
2483 else
2484 {
2485 len = (int)(tagp.tagname_end - tagp.tagname);
2486 mfp = (struct match_found *)alloc(
2487 (int)sizeof(struct match_found) + len);
2488 if (mfp != NULL)
2489 {
2490 mfp->len = len + 1; /* include the NUL */
2491 p = mfp->match;
2492 vim_strncpy(p, tagp.tagname, len);
2493 }
2494
2495 /* if wanted, re-read line to get long form too */
2496 if (State & INSERT)
2497 get_it_again = p_sft;
2498 }
2499 }
2500 else
2501 {
2502 /* Save the tag in a buffer.
2503 * Emacs tag: <mtt><tag_fname><NUL><ebuf><NUL><lbuf>
2504 * other tag: <mtt><tag_fname><NUL><NUL><lbuf>
2505 * without Emacs tags: <mtt><tag_fname><NUL><lbuf>
2506 */
2507 len = (int)STRLEN(tag_fname)
2508 + (int)STRLEN(lbuf_line) + 3;
2509 #ifdef FEAT_EMACS_TAGS
2510 if (is_etag)
2511 len += (int)STRLEN(ebuf) + 1;
2512 else
2513 ++len;
2514 #endif
2515 mfp = (struct match_found *)alloc(
2516 (int)sizeof(struct match_found) + len);
2517 if (mfp != NULL)
2518 {
2519 mfp->len = len;
2520 p = mfp->match;
2521 p[0] = mtt;
2522 STRCPY(p + 1, tag_fname);
2523 #ifdef BACKSLASH_IN_FILENAME
2524 /* Ignore differences in slashes, avoid adding
2525 * both path/file and path\file. */
2526 slash_adjust(p + 1);
2527 #endif
2528 s = p + 1 + STRLEN(tag_fname) + 1;
2529 #ifdef FEAT_EMACS_TAGS
2530 if (is_etag)
2531 {
2532 STRCPY(s, ebuf);
2533 s += STRLEN(ebuf) + 1;
2534 }
2535 else
2536 *s++ = NUL;
2537 #endif
2538 STRCPY(s, lbuf_line);
2539 }
2540 }
2541
2542 if (mfp != NULL)
2543 {
2544 /*
2545 * Don't add identical matches.
2546 * This can take a lot of time when finding many
2547 * matches, check for CTRL-C now and then.
2548 * Add all cscope tags, because they are all listed.
2549 */
2550 #ifdef FEAT_CSCOPE
2551 if (use_cscope)
2552 i = -1;
2553 else
2554 #endif
2555 for (i = ga_match[mtt].ga_len; --i >= 0 && !got_int; )
2556 {
2557 mfp2 = ((struct match_found **)
2558 (ga_match[mtt].ga_data))[i];
2559 if (mfp2->len == mfp->len
2560 && vim_memcmp(mfp2->match, mfp->match,
2561 (size_t)mfp->len) == 0)
2562 break;
2563 line_breakcheck();
2564 }
2565 if (i < 0)
2566 {
2567 ((struct match_found **)(ga_match[mtt].ga_data))
2568 [ga_match[mtt].ga_len++] = mfp;
2569 ++match_count;
2570 }
2571 else
2572 vim_free(mfp);
2573 }
2574 #ifdef FEAT_MBYTE
2575 /* Note: this makes the values in "tagp" invalid! */
2576 vim_free(conv_line);
2577 #endif
2578 }
2579 else /* Out of memory! Just forget about the rest. */
2580 {
2581 retval = OK;
2582 stop_searching = TRUE;
2583 break;
2584 }
2585 }
2586 #ifdef FEAT_CSCOPE
2587 if (use_cscope && eof)
2588 break;
2589 #endif
2590 } /* forever */
2591
2592 if (line_error)
2593 {
2594 EMSG2(_("E431: Format error in tags file \"%s\""), tag_fname);
2595 #ifdef FEAT_CSCOPE
2596 if (!use_cscope)
2597 #endif
2598 EMSGN(_("Before byte %ld"), (long)ftell(fp));
2599 stop_searching = TRUE;
2600 line_error = FALSE;
2601 }
2602
2603 #ifdef FEAT_CSCOPE
2604 if (!use_cscope)
2605 #endif
2606 fclose(fp);
2607 #ifdef FEAT_EMACS_TAGS
2608 while (incstack_idx)
2609 {
2610 --incstack_idx;
2611 fclose(incstack[incstack_idx].fp);
2612 vim_free(incstack[incstack_idx].etag_fname);
2613 }
2614 #endif
2615 #ifdef FEAT_MBYTE
2616 if (pats == &convpat)
2617 {
2618 /* Go back from converted pattern to original pattern. */
2619 vim_free(pats->pat);
2620 vim_free(pats->regmatch.regprog);
2621 orgpat.regmatch.rm_ic = pats->regmatch.rm_ic;
2622 pats = &orgpat;
2623 }
2624 if (vimconv.vc_type != CONV_NONE)
2625 convert_setup(&vimconv, NULL, NULL);
2626 #endif
2627
2628 #ifdef FEAT_TAG_BINS
2629 if (sort_error)
2630 {
2631 EMSG2(_("E432: Tags file not sorted: %s"), tag_fname);
2632 sort_error = FALSE;
2633 }
2634 #endif
2635
2636 /*
2637 * Stop searching if sufficient tags have been found.
2638 */
2639 if (match_count >= mincount)
2640 {
2641 retval = OK;
2642 stop_searching = TRUE;
2643 }
2644
2645 #ifdef FEAT_CSCOPE
2646 if (stop_searching || use_cscope)
2647 #else
2648 if (stop_searching)
2649 #endif
2650 break;
2651
2652 } /* end of for-each-file loop */
2653
2654 #ifdef FEAT_CSCOPE
2655 if (!use_cscope)
2656 #endif
2657 tagname_free(&tn);
2658
2659 #ifdef FEAT_TAG_BINS
2660 /* stop searching when already did a linear search, or when TAG_NOIC
2661 * used, and 'ignorecase' not set or already did case-ignore search */
2662 if (stop_searching || linear || (!p_ic && noic) || pats->regmatch.rm_ic)
2663 break;
2664 # ifdef FEAT_CSCOPE
2665 if (use_cscope)
2666 break;
2667 # endif
2668 pats->regmatch.rm_ic = TRUE; /* try another time while ignoring case */
2669 }
2670 #endif
2671
2672 if (!stop_searching)
2673 {
2674 if (!did_open && verbose) /* never opened any tags file */
2675 EMSG(_("E433: No tags file"));
2676 retval = OK; /* It's OK even when no tag found */
2677 }
2678
2679 findtag_end:
2680 vim_free(lbuf);
2681 vim_free(pats->regmatch.regprog);
2682 vim_free(tag_fname);
2683 #ifdef FEAT_EMACS_TAGS
2684 vim_free(ebuf);
2685 #endif
2686
2687 /*
2688 * Move the matches from the ga_match[] arrays into one list of
2689 * matches. When retval == FAIL, free the matches.
2690 */
2691 if (retval == FAIL)
2692 match_count = 0;
2693
2694 if (match_count > 0)
2695 matches = (char_u **)lalloc((long_u)(match_count * sizeof(char_u *)),
2696 TRUE);
2697 else
2698 matches = NULL;
2699 match_count = 0;
2700 for (mtt = 0; mtt < MT_COUNT; ++mtt)
2701 {
2702 for (i = 0; i < ga_match[mtt].ga_len; ++i)
2703 {
2704 mfp = ((struct match_found **)(ga_match[mtt].ga_data))[i];
2705 if (matches == NULL)
2706 vim_free(mfp);
2707 else
2708 {
2709 /* To avoid allocating memory again we turn the struct
2710 * match_found into a string. For help the priority was not
2711 * included in the length. */
2712 mch_memmove(mfp, mfp->match,
2713 (size_t)(mfp->len + (help_only ? ML_HELP_LEN : 0)));
2714 matches[match_count++] = (char_u *)mfp;
2715 }
2716 }
2717 ga_clear(&ga_match[mtt]);
2718 }
2719
2720 *matchesp = matches;
2721 *num_matches = match_count;
2722
2723 curbuf->b_help = help_save;
2724 #ifdef FEAT_MULTI_LANG
2725 vim_free(saved_pat);
2726 #endif
2727
2728 return retval;
2729 }
2730
2731 static garray_T tag_fnames = GA_EMPTY;
2732 static void found_tagfile_cb __ARGS((char_u *fname, void *cookie));
2733
2734 /*
2735 * Callback function for finding all "tags" and "tags-??" files in
2736 * 'runtimepath' doc directories.
2737 */
2738 static void
2739 found_tagfile_cb(fname, cookie)
2740 char_u *fname;
2741 void *cookie UNUSED;
2742 {
2743 if (ga_grow(&tag_fnames, 1) == OK)
2744 ((char_u **)(tag_fnames.ga_data))[tag_fnames.ga_len++] =
2745 vim_strsave(fname);
2746 }
2747
2748 #if defined(EXITFREE) || defined(PROTO)
2749 void
2750 free_tag_stuff()
2751 {
2752 ga_clear_strings(&tag_fnames);
2753 do_tag(NULL, DT_FREE, 0, 0, 0);
2754 tag_freematch();
2755
2756 # if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
2757 if (ptag_entry.tagname)
2758 {
2759 vim_free(ptag_entry.tagname);
2760 ptag_entry.tagname = NULL;
2761 }
2762 # endif
2763 }
2764 #endif
2765
2766 /*
2767 * Get the next name of a tag file from the tag file list.
2768 * For help files, use "tags" file only.
2769 *
2770 * Return FAIL if no more tag file names, OK otherwise.
2771 */
2772 int
2773 get_tagfname(tnp, first, buf)
2774 tagname_T *tnp; /* holds status info */
2775 int first; /* TRUE when first file name is wanted */
2776 char_u *buf; /* pointer to buffer of MAXPATHL chars */
2777 {
2778 char_u *fname = NULL;
2779 char_u *r_ptr;
2780
2781 if (first)
2782 vim_memset(tnp, 0, sizeof(tagname_T));
2783
2784 if (curbuf->b_help)
2785 {
2786 /*
2787 * For help files it's done in a completely different way:
2788 * Find "doc/tags" and "doc/tags-??" in all directories in
2789 * 'runtimepath'.
2790 */
2791 if (first)
2792 {
2793 ga_clear_strings(&tag_fnames);
2794 ga_init2(&tag_fnames, (int)sizeof(char_u *), 10);
2795 do_in_runtimepath((char_u *)
2796 #ifdef FEAT_MULTI_LANG
2797 # ifdef VMS
2798 /* Functions decc$to_vms() and decc$translate_vms() crash
2799 * on some VMS systems with wildcards "??". Seems ECO
2800 * patches do fix the problem in C RTL, but we can't use
2801 * an #ifdef for that. */
2802 "doc/tags doc/tags-*"
2803 # else
2804 "doc/tags doc/tags-??"
2805 # endif
2806 #else
2807 "doc/tags"
2808 #endif
2809 , TRUE, found_tagfile_cb, NULL);
2810 }
2811
2812 if (tnp->tn_hf_idx >= tag_fnames.ga_len)
2813 {
2814 /* Not found in 'runtimepath', use 'helpfile', if it exists and
2815 * wasn't used yet, replacing "help.txt" with "tags". */
2816 if (tnp->tn_hf_idx > tag_fnames.ga_len || *p_hf == NUL)
2817 return FAIL;
2818 ++tnp->tn_hf_idx;
2819 STRCPY(buf, p_hf);
2820 STRCPY(gettail(buf), "tags");
2821 }
2822 else
2823 vim_strncpy(buf, ((char_u **)(tag_fnames.ga_data))[
2824 tnp->tn_hf_idx++], MAXPATHL - 1);
2825 return OK;
2826 }
2827
2828 if (first)
2829 {
2830 /* Init. We make a copy of 'tags', because autocommands may change
2831 * the value without notifying us. */
2832 tnp->tn_tags = vim_strsave((*curbuf->b_p_tags != NUL)
2833 ? curbuf->b_p_tags : p_tags);
2834 if (tnp->tn_tags == NULL)
2835 return FAIL;
2836 tnp->tn_np = tnp->tn_tags;
2837 }
2838
2839 /*
2840 * Loop until we have found a file name that can be used.
2841 * There are two states:
2842 * tnp->tn_did_filefind_init == FALSE: setup for next part in 'tags'.
2843 * tnp->tn_did_filefind_init == TRUE: find next file in this part.
2844 */
2845 for (;;)
2846 {
2847 if (tnp->tn_did_filefind_init)
2848 {
2849 fname = vim_findfile(tnp->tn_search_ctx);
2850 if (fname != NULL)
2851 break;
2852
2853 tnp->tn_did_filefind_init = FALSE;
2854 }
2855 else
2856 {
2857 char_u *filename = NULL;
2858
2859 /* Stop when used all parts of 'tags'. */
2860 if (*tnp->tn_np == NUL)
2861 {
2862 vim_findfile_cleanup(tnp->tn_search_ctx);
2863 tnp->tn_search_ctx = NULL;
2864 return FAIL;
2865 }
2866
2867 /*
2868 * Copy next file name into buf.
2869 */
2870 buf[0] = NUL;
2871 (void)copy_option_part(&tnp->tn_np, buf, MAXPATHL - 1, " ,");
2872
2873 #ifdef FEAT_PATH_EXTRA
2874 r_ptr = vim_findfile_stopdir(buf);
2875 #else
2876 r_ptr = NULL;
2877 #endif
2878 /* move the filename one char forward and truncate the
2879 * filepath with a NUL */
2880 filename = gettail(buf);
2881 STRMOVE(filename + 1, filename);
2882 *filename++ = NUL;
2883
2884 tnp->tn_search_ctx = vim_findfile_init(buf, filename,
2885 r_ptr, 100,
2886 FALSE, /* don't free visited list */
2887 FINDFILE_FILE, /* we search for a file */
2888 tnp->tn_search_ctx, TRUE, curbuf->b_ffname);
2889 if (tnp->tn_search_ctx != NULL)
2890 tnp->tn_did_filefind_init = TRUE;
2891 }
2892 }
2893
2894 STRCPY(buf, fname);
2895 vim_free(fname);
2896 return OK;
2897 }
2898
2899 /*
2900 * Free the contents of a tagname_T that was filled by get_tagfname().
2901 */
2902 void
2903 tagname_free(tnp)
2904 tagname_T *tnp;
2905 {
2906 vim_free(tnp->tn_tags);
2907 vim_findfile_cleanup(tnp->tn_search_ctx);
2908 tnp->tn_search_ctx = NULL;
2909 ga_clear_strings(&tag_fnames);
2910 }
2911
2912 /*
2913 * Parse one line from the tags file. Find start/end of tag name, start/end of
2914 * file name and start of search pattern.
2915 *
2916 * If is_etag is TRUE, tagp->fname and tagp->fname_end are not set.
2917 *
2918 * Return FAIL if there is a format error in this line, OK otherwise.
2919 */
2920 static int
2921 parse_tag_line(lbuf,
2922 #ifdef FEAT_EMACS_TAGS
2923 is_etag,
2924 #endif
2925 tagp)
2926 char_u *lbuf; /* line to be parsed */
2927 #ifdef FEAT_EMACS_TAGS
2928 int is_etag;
2929 #endif
2930 tagptrs_T *tagp;
2931 {
2932 char_u *p;
2933
2934 #ifdef FEAT_EMACS_TAGS
2935 char_u *p_7f;
2936
2937 if (is_etag)
2938 {
2939 /*
2940 * There are two formats for an emacs tag line:
2941 * 1: struct EnvBase ^?EnvBase^A139,4627
2942 * 2: #define ARPB_WILD_WORLD ^?153,5194
2943 */
2944 p_7f = vim_strchr(lbuf, 0x7f);
2945 if (p_7f == NULL)
2946 {
2947 etag_fail:
2948 if (vim_strchr(lbuf, '\n') == NULL)
2949 {
2950 /* Truncated line. Ignore it. */
2951 if (p_verbose >= 5)
2952 {
2953 verbose_enter();
2954 MSG(_("Ignoring long line in tags file"));
2955 verbose_leave();
2956 }
2957 tagp->command = lbuf;
2958 tagp->tagname = lbuf;
2959 tagp->tagname_end = lbuf;
2960 return OK;
2961 }
2962 return FAIL;
2963 }
2964
2965 /* Find ^A. If not found the line number is after the 0x7f */
2966 p = vim_strchr(p_7f, Ctrl_A);
2967 if (p == NULL)
2968 p = p_7f + 1;
2969 else
2970 ++p;
2971
2972 if (!VIM_ISDIGIT(*p)) /* check for start of line number */
2973 goto etag_fail;
2974 tagp->command = p;
2975
2976
2977 if (p[-1] == Ctrl_A) /* first format: explicit tagname given */
2978 {
2979 tagp->tagname = p_7f + 1;
2980 tagp->tagname_end = p - 1;
2981 }
2982 else /* second format: isolate tagname */
2983 {
2984 /* find end of tagname */
2985 for (p = p_7f - 1; !vim_iswordc(*p); --p)
2986 if (p == lbuf)
2987 goto etag_fail;
2988 tagp->tagname_end = p + 1;
2989 while (p >= lbuf && vim_iswordc(*p))
2990 --p;
2991 tagp->tagname = p + 1;
2992 }
2993 }
2994 else /* not an Emacs tag */
2995 {
2996 #endif
2997 /* Isolate the tagname, from lbuf up to the first white */
2998 tagp->tagname = lbuf;
2999 #ifdef FEAT_TAG_ANYWHITE
3000 p = skiptowhite(lbuf);
3001 #else
3002 p = vim_strchr(lbuf, TAB);
3003 if (p == NULL)
3004 return FAIL;
3005 #endif
3006 tagp->tagname_end = p;
3007
3008 /* Isolate file name, from first to second white space */
3009 #ifdef FEAT_TAG_ANYWHITE
3010 p = skipwhite(p);
3011 #else
3012 if (*p != NUL)
3013 ++p;
3014 #endif
3015 tagp->fname = p;
3016 #ifdef FEAT_TAG_ANYWHITE
3017 p = skiptowhite(p);
3018 #else
3019 p = vim_strchr(p, TAB);
3020 if (p == NULL)
3021 return FAIL;
3022 #endif
3023 tagp->fname_end = p;
3024
3025 /* find start of search command, after second white space */
3026 #ifdef FEAT_TAG_ANYWHITE
3027 p = skipwhite(p);
3028 #else
3029 if (*p != NUL)
3030 ++p;
3031 #endif
3032 if (*p == NUL)
3033 return FAIL;
3034 tagp->command = p;
3035 #ifdef FEAT_EMACS_TAGS
3036 }
3037 #endif
3038
3039 return OK;
3040 }
3041
3042 /*
3043 * Check if tagname is a static tag
3044 *
3045 * Static tags produced by the older ctags program have the format:
3046 * 'file:tag file /pattern'.
3047 * This is only recognized when both occurrence of 'file' are the same, to
3048 * avoid recognizing "string::string" or ":exit".
3049 *
3050 * Static tags produced by the new ctags program have the format:
3051 * 'tag file /pattern/;"<Tab>file:' "
3052 *
3053 * Return TRUE if it is a static tag and adjust *tagname to the real tag.
3054 * Return FALSE if it is not a static tag.
3055 */
3056 static int
3057 test_for_static(tagp)
3058 tagptrs_T *tagp;
3059 {
3060 char_u *p;
3061
3062 #ifdef FEAT_TAG_OLDSTATIC
3063 int len;
3064
3065 /*
3066 * Check for old style static tag: "file:tag file .."
3067 */
3068 len = (int)(tagp->fname_end - tagp->fname);
3069 p = tagp->tagname + len;
3070 if ( p < tagp->tagname_end
3071 && *p == ':'
3072 && fnamencmp(tagp->tagname, tagp->fname, len) == 0)
3073 {
3074 tagp->tagname = p + 1;
3075 return TRUE;
3076 }
3077 #endif
3078
3079 /*
3080 * Check for new style static tag ":...<Tab>file:[<Tab>...]"
3081 */
3082 p = tagp->command;
3083 while ((p = vim_strchr(p, '\t')) != NULL)
3084 {
3085 ++p;
3086 if (STRNCMP(p, "file:", 5) == 0)
3087 return TRUE;
3088 }
3089
3090 return FALSE;
3091 }
3092
3093 /*
3094 * Parse a line from a matching tag. Does not change the line itself.
3095 *
3096 * The line that we get looks like this:
3097 * Emacs tag: <mtt><tag_fname><NUL><ebuf><NUL><lbuf>
3098 * other tag: <mtt><tag_fname><NUL><NUL><lbuf>
3099 * without Emacs tags: <mtt><tag_fname><NUL><lbuf>
3100 *
3101 * Return OK or FAIL.
3102 */
3103 static int
3104 parse_match(lbuf, tagp)
3105 char_u *lbuf; /* input: matching line */
3106 tagptrs_T *tagp; /* output: pointers into the line */
3107 {
3108 int retval;
3109 char_u *p;
3110 char_u *pc, *pt;
3111
3112 tagp->tag_fname = lbuf + 1;
3113 lbuf += STRLEN(tagp->tag_fname) + 2;
3114 #ifdef FEAT_EMACS_TAGS
3115 if (*lbuf)
3116 {
3117 tagp->is_etag = TRUE;
3118 tagp->fname = lbuf;
3119 lbuf += STRLEN(lbuf);
3120 tagp->fname_end = lbuf++;
3121 }
3122 else
3123 {
3124 tagp->is_etag = FALSE;
3125 ++lbuf;
3126 }
3127 #endif
3128
3129 /* Find search pattern and the file name for non-etags. */
3130 retval = parse_tag_line(lbuf,
3131 #ifdef FEAT_EMACS_TAGS
3132 tagp->is_etag,
3133 #endif
3134 tagp);
3135
3136 tagp->tagkind = NULL;
3137 tagp->command_end = NULL;
3138
3139 if (retval == OK)
3140 {
3141 /* Try to find a kind field: "kind:<kind>" or just "<kind>"*/
3142 p = tagp->command;
3143 if (find_extra(&p) == OK)
3144 {
3145 tagp->command_end = p;
3146 p += 2; /* skip ";\"" */
3147 if (*p++ == TAB)
3148 while (ASCII_ISALPHA(*p))
3149 {
3150 if (STRNCMP(p, "kind:", 5) == 0)
3151 {
3152 tagp->tagkind = p + 5;
3153 break;
3154 }
3155 pc = vim_strchr(p, ':');
3156 pt = vim_strchr(p, '\t');
3157 if (pc == NULL || (pt != NULL && pc > pt))
3158 {
3159 tagp->tagkind = p;
3160 break;
3161 }
3162 if (pt == NULL)
3163 break;
3164 p = pt + 1;
3165 }
3166 }
3167 if (tagp->tagkind != NULL)
3168 {
3169 for (p = tagp->tagkind;
3170 *p && *p != '\t' && *p != '\r' && *p != '\n'; ++p)
3171 ;
3172 tagp->tagkind_end = p;
3173 }
3174 }
3175 return retval;
3176 }
3177
3178 /*
3179 * Find out the actual file name of a tag. Concatenate the tags file name
3180 * with the matching tag file name.
3181 * Returns an allocated string or NULL (out of memory).
3182 */
3183 static char_u *
3184 tag_full_fname(tagp)
3185 tagptrs_T *tagp;
3186 {
3187 char_u *fullname;
3188 int c;
3189
3190 #ifdef FEAT_EMACS_TAGS
3191 if (tagp->is_etag)
3192 c = 0; /* to shut up GCC */
3193 else
3194 #endif
3195 {
3196 c = *tagp->fname_end;
3197 *tagp->fname_end = NUL;
3198 }
3199 fullname = expand_tag_fname(tagp->fname, tagp->tag_fname, FALSE);
3200
3201 #ifdef FEAT_EMACS_TAGS
3202 if (!tagp->is_etag)
3203 #endif
3204 *tagp->fname_end = c;
3205
3206 return fullname;
3207 }
3208
3209 /*
3210 * Jump to a tag that has been found in one of the tag files
3211 *
3212 * returns OK for success, NOTAGFILE when file not found, FAIL otherwise.
3213 */
3214 static int
3215 jumpto_tag(lbuf, forceit, keep_help)
3216 char_u *lbuf; /* line from the tags file for this tag */
3217 int forceit; /* :ta with ! */
3218 int keep_help; /* keep help flag (FALSE for cscope) */
3219 {
3220 int save_secure;
3221 int save_magic;
3222 int save_p_ws, save_p_scs, save_p_ic;
3223 linenr_T save_lnum;
3224 int csave = 0;
3225 char_u *str;
3226 char_u *pbuf; /* search pattern buffer */
3227 char_u *pbuf_end;
3228 char_u *tofree_fname = NULL;
3229 char_u *fname;
3230 tagptrs_T tagp;
3231 int retval = FAIL;
3232 int getfile_result;
3233 int search_options;
3234 #ifdef FEAT_SEARCH_EXTRA
3235 int save_no_hlsearch;
3236 #endif
3237 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
3238 win_T *curwin_save = NULL;
3239 #endif
3240 char_u *full_fname = NULL;
3241 #ifdef FEAT_FOLDING
3242 int old_KeyTyped = KeyTyped; /* getting the file may reset it */
3243 #endif
3244
3245 pbuf = alloc(LSIZE);
3246
3247 /* parse the match line into the tagp structure */
3248 if (pbuf == NULL || parse_match(lbuf, &tagp) == FAIL)
3249 {
3250 tagp.fname_end = NULL;
3251 goto erret;
3252 }
3253
3254 /* truncate the file name, so it can be used as a string */
3255 csave = *tagp.fname_end;
3256 *tagp.fname_end = NUL;
3257 fname = tagp.fname;
3258
3259 /* copy the command to pbuf[], remove trailing CR/NL */
3260 str = tagp.command;
3261 for (pbuf_end = pbuf; *str && *str != '\n' && *str != '\r'; )
3262 {
3263 #ifdef FEAT_EMACS_TAGS
3264 if (tagp.is_etag && *str == ',')/* stop at ',' after line number */
3265 break;
3266 #endif
3267 *pbuf_end++ = *str++;
3268 }
3269 *pbuf_end = NUL;
3270
3271 #ifdef FEAT_EMACS_TAGS
3272 if (!tagp.is_etag)
3273 #endif
3274 {
3275 /*
3276 * Remove the "<Tab>fieldname:value" stuff; we don't need it here.
3277 */
3278 str = pbuf;
3279 if (find_extra(&str) == OK)
3280 {
3281 pbuf_end = str;
3282 *pbuf_end = NUL;
3283 }
3284 }
3285
3286 /*
3287 * Expand file name, when needed (for environment variables).
3288 * If 'tagrelative' option set, may change file name.
3289 */
3290 fname = expand_tag_fname(fname, tagp.tag_fname, TRUE);
3291 if (fname == NULL)
3292 goto erret;
3293 tofree_fname = fname; /* free() it later */
3294
3295 /*
3296 * Check if the file with the tag exists before abandoning the current
3297 * file. Also accept a file name for which there is a matching BufReadCmd
3298 * autocommand event (e.g., http://sys/file).
3299 */
3300 if (mch_getperm(fname) < 0
3301 #ifdef FEAT_AUTOCMD
3302 && !has_autocmd(EVENT_BUFREADCMD, fname, NULL)
3303 #endif
3304 )
3305 {
3306 retval = NOTAGFILE;
3307 vim_free(nofile_fname);
3308 nofile_fname = vim_strsave(fname);
3309 if (nofile_fname == NULL)
3310 nofile_fname = empty_option;
3311 goto erret;
3312 }
3313
3314 ++RedrawingDisabled;
3315
3316 #ifdef FEAT_GUI
3317 need_mouse_correct = TRUE;
3318 #endif
3319
3320 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
3321 if (g_do_tagpreview)
3322 {
3323 postponed_split = 0; /* don't split again below */
3324 curwin_save = curwin; /* Save current window */
3325
3326 /*
3327 * If we are reusing a window, we may change dir when
3328 * entering it (autocommands) so turn the tag filename
3329 * into a fullpath
3330 */
3331 if (!curwin->w_p_pvw)
3332 {
3333 full_fname = FullName_save(fname, FALSE);
3334 fname = full_fname;
3335
3336 /*
3337 * Make the preview window the current window.
3338 * Open a preview window when needed.
3339 */
3340 prepare_tagpreview(TRUE);
3341 }
3342 }
3343
3344 /* If it was a CTRL-W CTRL-] command split window now. For ":tab tag"
3345 * open a new tab page. */
3346 if (postponed_split || cmdmod.tab != 0)
3347 {
3348 win_split(postponed_split > 0 ? postponed_split : 0,
3349 postponed_split_flags);
3350 # ifdef FEAT_SCROLLBIND
3351 curwin->w_p_scb = FALSE;
3352 # endif
3353 }
3354 #endif
3355
3356 if (keep_help)
3357 {
3358 /* A :ta from a help file will keep the b_help flag set. For ":ptag"
3359 * we need to use the flag from the window where we came from. */
3360 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
3361 if (g_do_tagpreview)
3362 keep_help_flag = curwin_save->w_buffer->b_help;
3363 else
3364 #endif
3365 keep_help_flag = curbuf->b_help;
3366 }
3367 getfile_result = getfile(0, fname, NULL, TRUE, (linenr_T)0, forceit);
3368 keep_help_flag = FALSE;
3369
3370 if (getfile_result <= 0) /* got to the right file */
3371 {
3372 curwin->w_set_curswant = TRUE;
3373 #ifdef FEAT_WINDOWS
3374 postponed_split = 0;
3375 #endif
3376
3377 save_secure = secure;
3378 secure = 1;
3379 #ifdef HAVE_SANDBOX
3380 ++sandbox;
3381 #endif
3382 save_magic = p_magic;
3383 p_magic = FALSE; /* always execute with 'nomagic' */
3384 #ifdef FEAT_SEARCH_EXTRA
3385 /* Save value of no_hlsearch, jumping to a tag is not a real search */
3386 save_no_hlsearch = no_hlsearch;
3387 #endif
3388
3389 /*
3390 * If 'cpoptions' contains 't', store the search pattern for the "n"
3391 * command. If 'cpoptions' does not contain 't', the search pattern
3392 * is not stored.
3393 */
3394 if (vim_strchr(p_cpo, CPO_TAGPAT) != NULL)
3395 search_options = 0;
3396 else
3397 search_options = SEARCH_KEEP;
3398
3399 /*
3400 * If the command is a search, try here.
3401 *
3402 * Reset 'smartcase' for the search, since the search pattern was not
3403 * typed by the user.
3404 * Only use do_search() when there is a full search command, without
3405 * anything following.
3406 */
3407 str = pbuf;
3408 if (pbuf[0] == '/' || pbuf[0] == '?')
3409 str = skip_regexp(pbuf + 1, pbuf[0], FALSE, NULL) + 1;
3410 if (str > pbuf_end - 1) /* search command with nothing following */
3411 {
3412 save_p_ws = p_ws;
3413 save_p_ic = p_ic;
3414 save_p_scs = p_scs;
3415 p_ws = TRUE; /* need 'wrapscan' for backward searches */
3416 p_ic = FALSE; /* don't ignore case now */
3417 p_scs = FALSE;
3418 #if 0 /* disabled for now */
3419 #ifdef FEAT_CMDHIST
3420 /* put pattern in search history */
3421 add_to_history(HIST_SEARCH, pbuf + 1, TRUE, pbuf[0]);
3422 #endif
3423 #endif
3424 save_lnum = curwin->w_cursor.lnum;
3425 curwin->w_cursor.lnum = 0; /* start search before first line */
3426 if (do_search(NULL, pbuf[0], pbuf + 1, (long)1,
3427 search_options, NULL))
3428 retval = OK;
3429 else
3430 {
3431 int found = 1;
3432 int cc;
3433
3434 /*
3435 * try again, ignore case now
3436 */
3437 p_ic = TRUE;
3438 if (!do_search(NULL, pbuf[0], pbuf + 1, (long)1,
3439 search_options, NULL))
3440 {
3441 /*
3442 * Failed to find pattern, take a guess: "^func ("
3443 */
3444 found = 2;
3445 (void)test_for_static(&tagp);
3446 cc = *tagp.tagname_end;
3447 *tagp.tagname_end = NUL;
3448 sprintf((char *)pbuf, "^%s\\s\\*(", tagp.tagname);
3449 if (!do_search(NULL, '/', pbuf, (long)1,
3450 search_options, NULL))
3451 {
3452 /* Guess again: "^char * \<func (" */
3453 sprintf((char *)pbuf, "^\\[#a-zA-Z_]\\.\\*\\<%s\\s\\*(",
3454 tagp.tagname);
3455 if (!do_search(NULL, '/', pbuf, (long)1,
3456 search_options, NULL))
3457 found = 0;
3458 }
3459 *tagp.tagname_end = cc;
3460 }
3461 if (found == 0)
3462 {
3463 EMSG(_("E434: Can't find tag pattern"));
3464 curwin->w_cursor.lnum = save_lnum;
3465 }
3466 else
3467 {
3468 /*
3469 * Only give a message when really guessed, not when 'ic'
3470 * is set and match found while ignoring case.
3471 */
3472 if (found == 2 || !save_p_ic)
3473 {
3474 MSG(_("E435: Couldn't find tag, just guessing!"));
3475 if (!msg_scrolled && msg_silent == 0)
3476 {
3477 out_flush();
3478 ui_delay(1000L, TRUE);
3479 }
3480 }
3481 retval = OK;
3482 }
3483 }
3484 p_ws = save_p_ws;
3485 p_ic = save_p_ic;
3486 p_scs = save_p_scs;
3487
3488 /* A search command may have positioned the cursor beyond the end
3489 * of the line. May need to correct that here. */
3490 check_cursor();
3491 }
3492 else
3493 {
3494 curwin->w_cursor.lnum = 1; /* start command in line 1 */
3495 do_cmdline_cmd(pbuf);
3496 retval = OK;
3497 }
3498
3499 /*
3500 * When the command has done something that is not allowed make sure
3501 * the error message can be seen.
3502 */
3503 if (secure == 2)
3504 wait_return(TRUE);
3505 secure = save_secure;
3506 p_magic = save_magic;
3507 #ifdef HAVE_SANDBOX
3508 --sandbox;
3509 #endif
3510 #ifdef FEAT_SEARCH_EXTRA
3511 /* restore no_hlsearch when keeping the old search pattern */
3512 if (search_options)
3513 no_hlsearch = save_no_hlsearch;
3514 #endif
3515
3516 /* Return OK if jumped to another file (at least we found the file!). */
3517 if (getfile_result == -1)
3518 retval = OK;
3519
3520 if (retval == OK)
3521 {
3522 /*
3523 * For a help buffer: Put the cursor line at the top of the window,
3524 * the help subject will be below it.
3525 */
3526 if (curbuf->b_help)
3527 set_topline(curwin, curwin->w_cursor.lnum);
3528 #ifdef FEAT_FOLDING
3529 if ((fdo_flags & FDO_TAG) && old_KeyTyped)
3530 foldOpenCursor();
3531 #endif
3532 }
3533
3534 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
3535 if (g_do_tagpreview && curwin != curwin_save && win_valid(curwin_save))
3536 {
3537 /* Return cursor to where we were */
3538 validate_cursor();
3539 redraw_later(VALID);
3540 win_enter(curwin_save, TRUE);
3541 }
3542 #endif
3543
3544 --RedrawingDisabled;
3545 }
3546 else
3547 {
3548 --RedrawingDisabled;
3549 #ifdef FEAT_WINDOWS
3550 if (postponed_split) /* close the window */
3551 {
3552 win_close(curwin, FALSE);
3553 postponed_split = 0;
3554 }
3555 #endif
3556 }
3557
3558 erret:
3559 #if defined(FEAT_WINDOWS) && defined(FEAT_QUICKFIX)
3560 g_do_tagpreview = 0; /* For next time */
3561 #endif
3562 if (tagp.fname_end != NULL)
3563 *tagp.fname_end = csave;
3564 vim_free(pbuf);
3565 vim_free(tofree_fname);
3566 vim_free(full_fname);
3567
3568 return retval;
3569 }
3570
3571 /*
3572 * If "expand" is TRUE, expand wildcards in fname.
3573 * If 'tagrelative' option set, change fname (name of file containing tag)
3574 * according to tag_fname (name of tag file containing fname).
3575 * Returns a pointer to allocated memory (or NULL when out of memory).
3576 */
3577 static char_u *
3578 expand_tag_fname(fname, tag_fname, expand)
3579 char_u *fname;
3580 char_u *tag_fname;
3581 int expand;
3582 {
3583 char_u *p;
3584 char_u *retval;
3585 char_u *expanded_fname = NULL;
3586 expand_T xpc;
3587
3588 /*
3589 * Expand file name (for environment variables) when needed.
3590 */
3591 if (expand && mch_has_wildcard(fname))
3592 {
3593 ExpandInit(&xpc);
3594 xpc.xp_context = EXPAND_FILES;
3595 expanded_fname = ExpandOne(&xpc, (char_u *)fname, NULL,
3596 WILD_LIST_NOTFOUND|WILD_SILENT, WILD_EXPAND_FREE);
3597 if (expanded_fname != NULL)
3598 fname = expanded_fname;
3599 }
3600
3601 if ((p_tr || curbuf->b_help)
3602 && !vim_isAbsName(fname)
3603 && (p = gettail(tag_fname)) != tag_fname)
3604 {
3605 retval = alloc(MAXPATHL);
3606 if (retval != NULL)
3607 {
3608 STRCPY(retval, tag_fname);
3609 vim_strncpy(retval + (p - tag_fname), fname,
3610 MAXPATHL - (p - tag_fname) - 1);
3611 /*
3612 * Translate names like "src/a/../b/file.c" into "src/b/file.c".
3613 */
3614 simplify_filename(retval);
3615 }
3616 }
3617 else
3618 retval = vim_strsave(fname);
3619
3620 vim_free(expanded_fname);
3621
3622 return retval;
3623 }
3624
3625 /*
3626 * Converts a file name into a canonical form. It simplifies a file name into
3627 * its simplest form by stripping out unneeded components, if any. The
3628 * resulting file name is simplified in place and will either be the same
3629 * length as that supplied, or shorter.
3630 */
3631 void
3632 simplify_filename(filename)
3633 char_u *filename;
3634 {
3635 #ifndef AMIGA /* Amiga doesn't have "..", it uses "/" */
3636 int components = 0;
3637 char_u *p, *tail, *start;
3638 int stripping_disabled = FALSE;
3639 int relative = TRUE;
3640
3641 p = filename;
3642 #ifdef BACKSLASH_IN_FILENAME
3643 if (p[1] == ':') /* skip "x:" */
3644 p += 2;
3645 #endif
3646
3647 if (vim_ispathsep(*p))
3648 {
3649 relative = FALSE;
3650 do
3651 ++p;
3652 while (vim_ispathsep(*p));
3653 }
3654 start = p; /* remember start after "c:/" or "/" or "///" */
3655
3656 do
3657 {
3658 /* At this point "p" is pointing to the char following a single "/"
3659 * or "p" is at the "start" of the (absolute or relative) path name. */
3660 #ifdef VMS
3661 /* VMS allows device:[path] - don't strip the [ in directory */
3662 if ((*p == '[' || *p == '<') && p > filename && p[-1] == ':')
3663 {
3664 /* :[ or :< composition: vms directory component */
3665 ++components;
3666 p = getnextcomp(p + 1);
3667 }
3668 /* allow remote calls as host"user passwd"::device:[path] */
3669 else if (p[0] == ':' && p[1] == ':' && p > filename && p[-1] == '"' )
3670 {
3671 /* ":: composition: vms host/passwd component */
3672 ++components;
3673 p = getnextcomp(p + 2);
3674 }
3675 else
3676 #endif
3677 if (vim_ispathsep(*p))
3678 STRMOVE(p, p + 1); /* remove duplicate "/" */
3679 else if (p[0] == '.' && (vim_ispathsep(p[1]) || p[1] == NUL))
3680 {
3681 if (p == start && relative)
3682 p += 1 + (p[1] != NUL); /* keep single "." or leading "./" */
3683 else
3684 {
3685 /* Strip "./" or ".///". If we are at the end of the file name
3686 * and there is no trailing path separator, either strip "/." if
3687 * we are after "start", or strip "." if we are at the beginning
3688 * of an absolute path name . */
3689 tail = p + 1;
3690 if (p[1] != NUL)
3691 while (vim_ispathsep(*tail))
3692 mb_ptr_adv(tail);
3693 else if (p > start)
3694 --p; /* strip preceding path separator */
3695 STRMOVE(p, tail);
3696 }
3697 }
3698 else if (p[0] == '.' && p[1] == '.' &&
3699 (vim_ispathsep(p[2]) || p[2] == NUL))
3700 {
3701 /* Skip to after ".." or "../" or "..///". */
3702 tail = p + 2;
3703 while (vim_ispathsep(*tail))
3704 mb_ptr_adv(tail);
3705
3706 if (components > 0) /* strip one preceding component */
3707 {
3708 int do_strip = FALSE;
3709 char_u saved_char;
3710 struct stat st;
3711
3712 /* Don't strip for an erroneous file name. */
3713 if (!stripping_disabled)
3714 {
3715 /* If the preceding component does not exist in the file
3716 * system, we strip it. On Unix, we don't accept a symbolic
3717 * link that refers to a non-existent file. */
3718 saved_char = p[-1];
3719 p[-1] = NUL;
3720 #ifdef UNIX
3721 if (mch_lstat((char *)filename, &st) < 0)
3722 #else
3723 if (mch_stat((char *)filename, &st) < 0)
3724 #endif
3725 do_strip = TRUE;
3726 p[-1] = saved_char;
3727
3728 --p;
3729 /* Skip back to after previous '/'. */
3730 while (p > start && !after_pathsep(start, p))
3731 mb_ptr_back(start, p);
3732
3733 if (!do_strip)
3734 {
3735 /* If the component exists in the file system, check
3736 * that stripping it won't change the meaning of the
3737 * file name. First get information about the
3738 * unstripped file name. This may fail if the component
3739 * to strip is not a searchable directory (but a regular
3740 * file, for instance), since the trailing "/.." cannot
3741 * be applied then. We don't strip it then since we
3742 * don't want to replace an erroneous file name by
3743 * a valid one, and we disable stripping of later
3744 * components. */
3745 saved_char = *tail;
3746 *tail = NUL;
3747 if (mch_stat((char *)filename, &st) >= 0)
3748 do_strip = TRUE;
3749 else
3750 stripping_disabled = TRUE;
3751 *tail = saved_char;
3752 #ifdef UNIX
3753 if (do_strip)
3754 {
3755 struct stat new_st;
3756
3757 /* On Unix, the check for the unstripped file name
3758 * above works also for a symbolic link pointing to
3759 * a searchable directory. But then the parent of
3760 * the directory pointed to by the link must be the
3761 * same as the stripped file name. (The latter
3762 * exists in the file system since it is the
3763 * component's parent directory.) */
3764 if (p == start && relative)
3765 (void)mch_stat(".", &new_st);
3766 else
3767 {
3768 saved_char = *p;
3769 *p = NUL;
3770 (void)mch_stat((char *)filename, &new_st);
3771 *p = saved_char;
3772 }
3773
3774 if (new_st.st_ino != st.st_ino ||
3775 new_st.st_dev != st.st_dev)
3776 {
3777 do_strip = FALSE;
3778 /* We don't disable stripping of later
3779 * components since the unstripped path name is
3780 * still valid. */
3781 }
3782 }
3783 #endif
3784 }
3785 }
3786
3787 if (!do_strip)
3788 {
3789 /* Skip the ".." or "../" and reset the counter for the
3790 * components that might be stripped later on. */
3791 p = tail;
3792 components = 0;
3793 }
3794 else
3795 {
3796 /* Strip previous component. If the result would get empty
3797 * and there is no trailing path separator, leave a single
3798 * "." instead. If we are at the end of the file name and
3799 * there is no trailing path separator and a preceding
3800 * component is left after stripping, strip its trailing
3801 * path separator as well. */
3802 if (p == start && relative && tail[-1] == '.')
3803 {
3804 *p++ = '.';
3805 *p = NUL;
3806 }
3807 else
3808 {
3809 if (p > start && tail[-1] == '.')
3810 --p;
3811 STRMOVE(p, tail); /* strip previous component */
3812 }
3813
3814 --components;
3815 }
3816 }
3817 else if (p == start && !relative) /* leading "/.." or "/../" */
3818 STRMOVE(p, tail); /* strip ".." or "../" */
3819 else
3820 {
3821 if (p == start + 2 && p[-2] == '.') /* leading "./../" */
3822 {
3823 STRMOVE(p - 2, p); /* strip leading "./" */
3824 tail -= 2;
3825 }
3826 p = tail; /* skip to char after ".." or "../" */
3827 }
3828 }
3829 else
3830 {
3831 ++components; /* simple path component */
3832 p = getnextcomp(p);
3833 }
3834 } while (*p != NUL);
3835 #endif /* !AMIGA */
3836 }
3837
3838 /*
3839 * Check if we have a tag for the buffer with name "buf_ffname".
3840 * This is a bit slow, because of the full path compare in fullpathcmp().
3841 * Return TRUE if tag for file "fname" if tag file "tag_fname" is for current
3842 * file.
3843 */
3844 static int
3845 #ifdef FEAT_EMACS_TAGS
3846 test_for_current(is_etag, fname, fname_end, tag_fname, buf_ffname)
3847 int is_etag;
3848 #else
3849 test_for_current(fname, fname_end, tag_fname, buf_ffname)
3850 #endif
3851 char_u *fname;
3852 char_u *fname_end;
3853 char_u *tag_fname;
3854 char_u *buf_ffname;
3855 {
3856 int c;
3857 int retval = FALSE;
3858 char_u *fullname;
3859
3860 if (buf_ffname != NULL) /* if the buffer has a name */
3861 {
3862 #ifdef FEAT_EMACS_TAGS
3863 if (is_etag)
3864 c = 0; /* to shut up GCC */
3865 else
3866 #endif
3867 {
3868 c = *fname_end;
3869 *fname_end = NUL;
3870 }
3871 fullname = expand_tag_fname(fname, tag_fname, TRUE);
3872 if (fullname != NULL)
3873 {
3874 retval = (fullpathcmp(fullname, buf_ffname, TRUE) & FPC_SAME);
3875 vim_free(fullname);
3876 }
3877 #ifdef FEAT_EMACS_TAGS
3878 if (!is_etag)
3879 #endif
3880 *fname_end = c;
3881 }
3882
3883 return retval;
3884 }
3885
3886 /*
3887 * Find the end of the tagaddress.
3888 * Return OK if ";\"" is following, FAIL otherwise.
3889 */
3890 static int
3891 find_extra(pp)
3892 char_u **pp;
3893 {
3894 char_u *str = *pp;
3895
3896 /* Repeat for addresses separated with ';' */
3897 for (;;)
3898 {
3899 if (VIM_ISDIGIT(*str))
3900 str = skipdigits(str);
3901 else if (*str == '/' || *str == '?')
3902 {
3903 str = skip_regexp(str + 1, *str, FALSE, NULL);
3904 if (*str != **pp)
3905 str = NULL;
3906 else
3907 ++str;
3908 }
3909 else
3910 str = NULL;
3911 if (str == NULL || *str != ';'
3912 || !(VIM_ISDIGIT(str[1]) || str[1] == '/' || str[1] == '?'))
3913 break;
3914 ++str; /* skip ';' */
3915 }
3916
3917 if (str != NULL && STRNCMP(str, ";\"", 2) == 0)
3918 {
3919 *pp = str;
3920 return OK;
3921 }
3922 return FAIL;
3923 }
3924
3925 #if defined(FEAT_CMDL_COMPL) || defined(PROTO)
3926 int
3927 expand_tags(tagnames, pat, num_file, file)
3928 int tagnames; /* expand tag names */
3929 char_u *pat;
3930 int *num_file;
3931 char_u ***file;
3932 {
3933 int i;
3934 int c;
3935 int tagnmflag;
3936 char_u tagnm[100];
3937 tagptrs_T t_p;
3938 int ret;
3939
3940 if (tagnames)
3941 tagnmflag = TAG_NAMES;
3942 else
3943 tagnmflag = 0;
3944 if (pat[0] == '/')
3945 ret = find_tags(pat + 1, num_file, file,
3946 TAG_REGEXP | tagnmflag | TAG_VERBOSE | TAG_DONT_USE_TFU,
3947 TAG_MANY, curbuf->b_ffname);
3948 else
3949 ret = find_tags(pat, num_file, file,
3950 TAG_REGEXP | tagnmflag | TAG_VERBOSE | TAG_DONT_USE_TFU | TAG_NOIC,
3951 TAG_MANY, curbuf->b_ffname);
3952 if (ret == OK && !tagnames)
3953 {
3954 /* Reorganize the tags for display and matching as strings of:
3955 * "<tagname>\0<kind>\0<filename>\0"
3956 */
3957 for (i = 0; i < *num_file; i++)
3958 {
3959 parse_match((*file)[i], &t_p);
3960 c = (int)(t_p.tagname_end - t_p.tagname);
3961 mch_memmove(tagnm, t_p.tagname, (size_t)c);
3962 tagnm[c++] = 0;
3963 tagnm[c++] = (t_p.tagkind != NULL && *t_p.tagkind)
3964 ? *t_p.tagkind : 'f';
3965 tagnm[c++] = 0;
3966 mch_memmove((*file)[i] + c, t_p.fname, t_p.fname_end - t_p.fname);
3967 (*file)[i][c + (t_p.fname_end - t_p.fname)] = 0;
3968 mch_memmove((*file)[i], tagnm, (size_t)c);
3969 }
3970 }
3971 return ret;
3972 }
3973 #endif
3974
3975 #if defined(FEAT_EVAL) || defined(PROTO)
3976 static int add_tag_field __ARGS((dict_T *dict, char *field_name, char_u *start, char_u *end));
3977
3978 /*
3979 * Add a tag field to the dictionary "dict".
3980 * Return OK or FAIL.
3981 */
3982 static int
3983 add_tag_field(dict, field_name, start, end)
3984 dict_T *dict;
3985 char *field_name;
3986 char_u *start; /* start of the value */
3987 char_u *end; /* after the value; can be NULL */
3988 {
3989 char_u buf[MAXPATHL];
3990 int len = 0;
3991
3992 /* check that the field name doesn't exist yet */
3993 if (dict_find(dict, (char_u *)field_name, -1) != NULL)
3994 {
3995 if (p_verbose > 0)
3996 {
3997 verbose_enter();
3998 smsg((char_u *)_("Duplicate field name: %s"), field_name);
3999 verbose_leave();
4000 }
4001 return FAIL;
4002 }
4003 if (start != NULL)
4004 {
4005 if (end == NULL)
4006 {
4007 end = start + STRLEN(start);
4008 while (end > start && (end[-1] == '\r' || end[-1] == '\n'))
4009 --end;
4010 }
4011 len = (int)(end - start);
4012 if (len > (int)sizeof(buf) - 1)
4013 len = sizeof(buf) - 1;
4014 vim_strncpy(buf, start, len);
4015 }
4016 buf[len] = NUL;
4017 return dict_add_nr_str(dict, field_name, 0L, buf);
4018 }
4019
4020 /*
4021 * Add the tags matching the specified pattern to the list "list"
4022 * as a dictionary
4023 */
4024 int
4025 get_tags(list, pat)
4026 list_T *list;
4027 char_u *pat;
4028 {
4029 int num_matches, i, ret;
4030 char_u **matches, *p;
4031 char_u *full_fname;
4032 dict_T *dict;
4033 tagptrs_T tp;
4034 long is_static;
4035
4036 ret = find_tags(pat, &num_matches, &matches,
4037 TAG_REGEXP | TAG_NOIC, (int)MAXCOL, NULL);
4038 if (ret == OK && num_matches > 0)
4039 {
4040 for (i = 0; i < num_matches; ++i)
4041 {
4042 parse_match(matches[i], &tp);
4043 is_static = test_for_static(&tp);
4044
4045 /* Skip pseudo-tag lines. */
4046 if (STRNCMP(tp.tagname, "!_TAG_", 6) == 0)
4047 continue;
4048
4049 if ((dict = dict_alloc()) == NULL)
4050 ret = FAIL;
4051 if (list_append_dict(list, dict) == FAIL)
4052 ret = FAIL;
4053
4054 full_fname = tag_full_fname(&tp);
4055 if (add_tag_field(dict, "name", tp.tagname, tp.tagname_end) == FAIL
4056 || add_tag_field(dict, "filename", full_fname,
4057 NULL) == FAIL
4058 || add_tag_field(dict, "cmd", tp.command,
4059 tp.command_end) == FAIL
4060 || add_tag_field(dict, "kind", tp.tagkind,
4061 tp.tagkind_end) == FAIL
4062 || dict_add_nr_str(dict, "static", is_static, NULL) == FAIL)
4063 ret = FAIL;
4064
4065 vim_free(full_fname);
4066
4067 if (tp.command_end != NULL)
4068 {
4069 for (p = tp.command_end + 3;
4070 *p != NUL && *p != '\n' && *p != '\r'; ++p)
4071 {
4072 if (p == tp.tagkind || (p + 5 == tp.tagkind
4073 && STRNCMP(p, "kind:", 5) == 0))
4074 /* skip "kind:<kind>" and "<kind>" */
4075 p = tp.tagkind_end - 1;
4076 else if (STRNCMP(p, "file:", 5) == 0)
4077 /* skip "file:" (static tag) */
4078 p += 4;
4079 else if (!vim_iswhite(*p))
4080 {
4081 char_u *s, *n;
4082 int len;
4083
4084 /* Add extra field as a dict entry. Fields are
4085 * separated by Tabs. */
4086 n = p;
4087 while (*p != NUL && *p >= ' ' && *p < 127 && *p != ':')
4088 ++p;
4089 len = (int)(p - n);
4090 if (*p == ':' && len > 0)
4091 {
4092 s = ++p;
4093 while (*p != NUL && *p >= ' ')
4094 ++p;
4095 n[len] = NUL;
4096 if (add_tag_field(dict, (char *)n, s, p) == FAIL)
4097 ret = FAIL;
4098 n[len] = ':';
4099 }
4100 else
4101 /* Skip field without colon. */
4102 while (*p != NUL && *p >= ' ')
4103 ++p;
4104 if (*p == NUL)
4105 break;
4106 }
4107 }
4108 }
4109
4110 vim_free(matches[i]);
4111 }
4112 vim_free(matches);
4113 }
4114 return ret;
4115 }
4116 #endif
Vim with various extensions