comparison src/tag.c @ 7:3fc0f57ecb91 v7.0001

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