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