|
458
|
1 /* Tags file maker to go with GNU Emacs -*- coding: latin-1 -*-
|
|
3972
|
2
|
|
|
3 Copyright (C) 1984 The Regents of the University of California
|
|
|
4
|
|
|
5 Redistribution and use in source and binary forms, with or without
|
|
|
6 modification, are permitted provided that the following conditions are
|
|
|
7 met:
|
|
|
8 1. Redistributions of source code must retain the above copyright
|
|
|
9 notice, this list of conditions and the following disclaimer.
|
|
|
10 2. Redistributions in binary form must reproduce the above copyright
|
|
|
11 notice, this list of conditions and the following disclaimer in the
|
|
|
12 documentation and/or other materials provided with the
|
|
|
13 distribution.
|
|
|
14 3. Neither the name of the University nor the names of its
|
|
|
15 contributors may be used to endorse or promote products derived
|
|
|
16 from this software without specific prior written permission.
|
|
|
17
|
|
|
18 THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS''
|
|
|
19 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
|
20 THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
21 PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS
|
|
|
22 BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
23 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
24 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
|
|
|
25 BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
26 WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
|
|
27 OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
|
|
|
28 IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
29
|
|
|
30
|
|
|
31 Copyright (C) 1984, 1987, 1988, 1989, 1993, 1994, 1995, 1998, 1999,
|
|
|
32 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
|
|
33 Free Software Foundation, Inc.
|
|
|
34
|
|
|
35 This file is not considered part of GNU Emacs.
|
|
|
36
|
|
|
37 This program is free software; you can redistribute it and/or modify
|
|
|
38 it under the terms of the GNU General Public License as published by
|
|
|
39 the Free Software Foundation; either version 2 of the License, or
|
|
|
40 (at your option) any later version.
|
|
|
41
|
|
|
42 This program is distributed in the hope that it will be useful,
|
|
|
43 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
44 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
45 GNU General Public License for more details.
|
|
|
46
|
|
|
47 You should have received a copy of the GNU General Public License
|
|
|
48 along with this program; if not, write to the Free Software Foundation,
|
|
|
49 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
|
|
|
50
|
|
|
51
|
|
|
52 /* NB To comply with the above BSD license, copyright information is
|
|
|
53 reproduced in etc/ETAGS.README. That file should be updated when the
|
|
|
54 above notices are.
|
|
|
55
|
|
|
56 To the best of our knowledge, this code was originally based on the
|
|
|
57 ctags.c distributed with BSD4.2, which was copyrighted by the
|
|
|
58 University of California, as described above. */
|
|
|
59
|
|
428
|
60
|
|
|
61 /*
|
|
|
62 * Authors:
|
|
3972
|
63 * 1983 Ctags originally by Ken Arnold.
|
|
|
64 * 1984 Fortran added by Jim Kleckner.
|
|
|
65 * 1984 Ed Pelegri-Llopart added C typedefs.
|
|
|
66 * 1985 Emacs TAGS format by Richard Stallman.
|
|
458
|
67 * 1989 Sam Kendall added C++.
|
|
2225
|
68 * 1992 Joseph B. Wells improved C and C++ parsing.
|
|
|
69 * 1993 Francesco Potort́ reorganised C and C++.
|
|
|
70 * 1994 Line-by-line regexp tags by Tom Tromey.
|
|
|
71 * 2001 Nested classes by Francesco Potort́ (concept by Mykola Dzyuba).
|
|
|
72 * 2002 #line directives by Francesco Potort́.
|
|
428
|
73 *
|
|
2225
|
74 * Francesco Potort́ <pot@gnu.org> has maintained and improved it since 1993.
|
|
428
|
75 */
|
|
|
76
|
|
2325
|
77 /*
|
|
|
78 * If you want to add support for a new language, start by looking at the LUA
|
|
|
79 * language, which is the simplest. Alternatively, consider shipping a
|
|
|
80 * configuration file containing regexp definitions for etags.
|
|
|
81 */
|
|
|
82
|
|
3972
|
83 char pot_etags_version[] = "@(#) pot revision number is 17.32";
|
|
428
|
84
|
|
|
85 #define TRUE 1
|
|
|
86 #define FALSE 0
|
|
|
87
|
|
458
|
88 #ifdef DEBUG
|
|
|
89 # undef DEBUG
|
|
|
90 # define DEBUG TRUE
|
|
|
91 #else
|
|
|
92 # define DEBUG FALSE
|
|
|
93 # define NDEBUG /* disable assert */
|
|
428
|
94 #endif
|
|
|
95
|
|
|
96 #ifdef HAVE_CONFIG_H
|
|
|
97 # include <config.h>
|
|
|
98 /* On some systems, Emacs defines static as nothing for the sake
|
|
|
99 of unexec. We don't want that here since we don't use unexec. */
|
|
|
100 # undef static
|
|
3524
|
101 # ifndef PTR /* for XEmacs */
|
|
2225
|
102 # define PTR void *
|
|
715
|
103 # endif
|
|
3524
|
104 # ifndef __P /* for XEmacs */
|
|
2225
|
105 # define __P(args) args
|
|
709
|
106 # endif
|
|
2325
|
107 #else /* no config.h */
|
|
709
|
108 # if defined(__STDC__) && (__STDC__ || defined(__SUNPRO_C))
|
|
|
109 # define __P(args) args /* use prototypes */
|
|
|
110 # define PTR void * /* for generic pointers */
|
|
2325
|
111 # else /* not standard C */
|
|
709
|
112 # define __P(args) () /* no prototypes */
|
|
|
113 # define const /* remove const for old compilers' sake */
|
|
|
114 # define PTR long * /* don't use void* */
|
|
531
|
115 # endif
|
|
|
116 #endif /* !HAVE_CONFIG_H */
|
|
428
|
117
|
|
432
|
118 #ifndef _GNU_SOURCE
|
|
|
119 # define _GNU_SOURCE 1 /* enables some compiler checks on GNU */
|
|
|
120 #endif
|
|
|
121
|
|
3524
|
122 /* WIN32_NATIVE is for XEmacs.
|
|
458
|
123 MSDOS, WINDOWSNT, DOS_NT are for Emacs. */
|
|
442
|
124 #ifdef WIN32_NATIVE
|
|
458
|
125 # undef MSDOS
|
|
|
126 # undef WINDOWSNT
|
|
|
127 # define WINDOWSNT
|
|
|
128 #endif /* WIN32_NATIVE */
|
|
|
129
|
|
|
130 #ifdef MSDOS
|
|
|
131 # undef MSDOS
|
|
|
132 # define MSDOS TRUE
|
|
|
133 # include <fcntl.h>
|
|
|
134 # include <sys/param.h>
|
|
|
135 # include <io.h>
|
|
|
136 # ifndef HAVE_CONFIG_H
|
|
|
137 # define DOS_NT
|
|
|
138 # include <sys/config.h>
|
|
|
139 # endif
|
|
|
140 #else
|
|
|
141 # define MSDOS FALSE
|
|
|
142 #endif /* MSDOS */
|
|
|
143
|
|
|
144 #ifdef WINDOWSNT
|
|
428
|
145 # include <stdlib.h>
|
|
|
146 # include <fcntl.h>
|
|
|
147 # include <string.h>
|
|
442
|
148 # include <direct.h>
|
|
428
|
149 # include <io.h>
|
|
|
150 # define MAXPATHLEN _MAX_PATH
|
|
458
|
151 # undef HAVE_NTGUI
|
|
|
152 # undef DOS_NT
|
|
|
153 # define DOS_NT
|
|
428
|
154 # ifndef HAVE_GETCWD
|
|
|
155 # define HAVE_GETCWD
|
|
|
156 # endif /* undef HAVE_GETCWD */
|
|
2325
|
157 #else /* not WINDOWSNT */
|
|
442
|
158 # ifdef STDC_HEADERS
|
|
|
159 # include <stdlib.h>
|
|
|
160 # include <string.h>
|
|
2325
|
161 # else /* no standard C headers */
|
|
3972
|
162 extern char *getenv ();
|
|
|
163 extern char *strcpy ();
|
|
|
164 extern char *strncpy ();
|
|
|
165 extern char *strcat ();
|
|
|
166 extern char *strncat ();
|
|
|
167 extern unsigned long strlen ();
|
|
|
168 extern PTR malloc ();
|
|
|
169 extern PTR realloc ();
|
|
2325
|
170 # ifdef VMS
|
|
|
171 # define EXIT_SUCCESS 1
|
|
|
172 # define EXIT_FAILURE 0
|
|
|
173 # else /* no VMS */
|
|
|
174 # define EXIT_SUCCESS 0
|
|
|
175 # define EXIT_FAILURE 1
|
|
|
176 # endif
|
|
442
|
177 # endif
|
|
458
|
178 #endif /* !WINDOWSNT */
|
|
428
|
179
|
|
|
180 #ifdef HAVE_UNISTD_H
|
|
|
181 # include <unistd.h>
|
|
|
182 #else
|
|
458
|
183 # if defined (HAVE_GETCWD) && !defined (WINDOWSNT)
|
|
442
|
184 extern char *getcwd (char *buf, size_t size);
|
|
428
|
185 # endif
|
|
|
186 #endif /* HAVE_UNISTD_H */
|
|
|
187
|
|
|
188 #include <stdio.h>
|
|
|
189 #include <ctype.h>
|
|
|
190 #include <errno.h>
|
|
442
|
191 #ifndef errno
|
|
|
192 extern int errno;
|
|
|
193 #endif
|
|
428
|
194 #include <sys/types.h>
|
|
|
195 #include <sys/stat.h>
|
|
|
196
|
|
458
|
197 #include <assert.h>
|
|
|
198 #ifdef NDEBUG
|
|
|
199 # undef assert /* some systems have a buggy assert.h */
|
|
|
200 # define assert(x) ((void) 0)
|
|
|
201 #endif
|
|
|
202
|
|
428
|
203 #if !defined (S_ISREG) && defined (S_IFREG)
|
|
|
204 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
|
|
|
205 #endif
|
|
|
206
|
|
3517
|
207 #ifdef NO_LONG_OPTIONS /* define this if you don't have GNU getopt */
|
|
|
208 # define NO_LONG_OPTIONS TRUE
|
|
428
|
209 # define getopt_long(argc,argv,optstr,lopts,lind) getopt (argc, argv, optstr)
|
|
|
210 extern char *optarg;
|
|
|
211 extern int optind, opterr;
|
|
3517
|
212 #else
|
|
|
213 # define NO_LONG_OPTIONS FALSE
|
|
|
214 # include <getopt.h>
|
|
|
215 #endif /* NO_LONG_OPTIONS */
|
|
|
216
|
|
|
217 #ifndef HAVE_CONFIG_H /* this is a standalone compilation */
|
|
|
218 # ifdef __CYGWIN__ /* compiling on Cygwin */
|
|
709
|
219 !!! NOTICE !!!
|
|
|
220 the regex.h distributed with Cygwin is not compatible with etags, alas!
|
|
|
221 If you want regular expression support, you should delete this notice and
|
|
|
222 arrange to use the GNU regex.h and regex.c.
|
|
|
223 # endif
|
|
3517
|
224 #endif
|
|
|
225 #include <regex.h>
|
|
428
|
226
|
|
|
227 /* Define CTAGS to make the program "ctags" compatible with the usual one.
|
|
|
228 Leave it undefined to make the program "etags", which makes emacs-style
|
|
|
229 tag tables and tags typedefs, #defines and struct/union/enum by default. */
|
|
|
230 #ifdef CTAGS
|
|
|
231 # undef CTAGS
|
|
|
232 # define CTAGS TRUE
|
|
|
233 #else
|
|
|
234 # define CTAGS FALSE
|
|
|
235 #endif
|
|
|
236
|
|
458
|
237 #define streq(s,t) (assert((s)!=NULL || (t)!=NULL), !strcmp (s, t))
|
|
2225
|
238 #define strcaseeq(s,t) (assert((s)!=NULL && (t)!=NULL), !etags_strcasecmp (s, t))
|
|
458
|
239 #define strneq(s,t,n) (assert((s)!=NULL || (t)!=NULL), !strncmp (s, t, n))
|
|
2225
|
240 #define strncaseeq(s,t,n) (assert((s)!=NULL && (t)!=NULL), !etags_strncasecmp (s, t, n))
|
|
428
|
241
|
|
|
242 #define CHARS 256 /* 2^sizeof(char) */
|
|
458
|
243 #define CHAR(x) ((unsigned int)(x) & (CHARS - 1))
|
|
2225
|
244 #define iswhite(c) (_wht[CHAR(c)]) /* c is white (see white) */
|
|
|
245 #define notinname(c) (_nin[CHAR(c)]) /* c is not in a name (see nonam) */
|
|
|
246 #define begtoken(c) (_btk[CHAR(c)]) /* c can start token (see begtk) */
|
|
|
247 #define intoken(c) (_itk[CHAR(c)]) /* c can be in token (see midtk) */
|
|
|
248 #define endtoken(c) (_etk[CHAR(c)]) /* c ends tokens (see endtk) */
|
|
428
|
249
|
|
458
|
250 #define ISALNUM(c) isalnum (CHAR(c))
|
|
|
251 #define ISALPHA(c) isalpha (CHAR(c))
|
|
|
252 #define ISDIGIT(c) isdigit (CHAR(c))
|
|
|
253 #define ISLOWER(c) islower (CHAR(c))
|
|
|
254
|
|
|
255 #define lowcase(c) tolower (CHAR(c))
|
|
|
256 #define upcase(c) toupper (CHAR(c))
|
|
|
257
|
|
428
|
258
|
|
|
259 /*
|
|
|
260 * xnew, xrnew -- allocate, reallocate storage
|
|
|
261 *
|
|
|
262 * SYNOPSIS: Type *xnew (int n, Type);
|
|
458
|
263 * void xrnew (OldPointer, int n, Type);
|
|
428
|
264 */
|
|
458
|
265 #if DEBUG
|
|
428
|
266 # include "chkmalloc.h"
|
|
|
267 # define xnew(n,Type) ((Type *) trace_malloc (__FILE__, __LINE__, \
|
|
|
268 (n) * sizeof (Type)))
|
|
458
|
269 # define xrnew(op,n,Type) ((op) = (Type *) trace_realloc (__FILE__, __LINE__, \
|
|
|
270 (char *) (op), (n) * sizeof (Type)))
|
|
428
|
271 #else
|
|
|
272 # define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
|
|
458
|
273 # define xrnew(op,n,Type) ((op) = (Type *) xrealloc ( \
|
|
|
274 (char *) (op), (n) * sizeof (Type)))
|
|
428
|
275 #endif
|
|
|
276
|
|
709
|
277 #define bool int
|
|
|
278
|
|
|
279 typedef void Lang_function __P((FILE *));
|
|
428
|
280
|
|
|
281 typedef struct
|
|
|
282 {
|
|
2225
|
283 char *suffix; /* file name suffix for this compressor */
|
|
|
284 char *command; /* takes one arg and decompresses to stdout */
|
|
428
|
285 } compressor;
|
|
|
286
|
|
|
287 typedef struct
|
|
|
288 {
|
|
2225
|
289 char *name; /* language name */
|
|
|
290 char *help; /* detailed help for the language */
|
|
|
291 Lang_function *function; /* parse function */
|
|
|
292 char **suffixes; /* name suffixes of this language's files */
|
|
|
293 char **filenames; /* names of this language's files */
|
|
|
294 char **interpreters; /* interpreters for this language */
|
|
|
295 bool metasource; /* source used to generate other sources */
|
|
428
|
296 } language;
|
|
|
297
|
|
2225
|
298 typedef struct fdesc
|
|
|
299 {
|
|
|
300 struct fdesc *next; /* for the linked list */
|
|
|
301 char *infname; /* uncompressed input file name */
|
|
|
302 char *infabsname; /* absolute uncompressed input file name */
|
|
|
303 char *infabsdir; /* absolute dir of input file */
|
|
|
304 char *taggedfname; /* file name to write in tagfile */
|
|
|
305 language *lang; /* language of file */
|
|
|
306 char *prop; /* file properties to write in tagfile */
|
|
|
307 bool usecharno; /* etags tags shall contain char number */
|
|
|
308 bool written; /* entry written in the tags file */
|
|
|
309 } fdesc;
|
|
|
310
|
|
428
|
311 typedef struct node_st
|
|
2225
|
312 { /* sorting structure */
|
|
|
313 struct node_st *left, *right; /* left and right sons */
|
|
|
314 fdesc *fdp; /* description of file to whom tag belongs */
|
|
|
315 char *name; /* tag name */
|
|
|
316 char *regex; /* search regexp */
|
|
|
317 bool valid; /* write this tag on the tag file */
|
|
|
318 bool is_func; /* function tag: use regexp in CTAGS mode */
|
|
|
319 bool been_warned; /* warning already given for duplicated tag */
|
|
|
320 int lno; /* line number tag is on */
|
|
428
|
321 long cno; /* character number line starts on */
|
|
|
322 } node;
|
|
|
323
|
|
|
324 /*
|
|
|
325 * A `linebuffer' is a structure which holds a line of text.
|
|
|
326 * `readline_internal' reads a line from a stream into a linebuffer
|
|
|
327 * and works regardless of the length of the line.
|
|
|
328 * SIZE is the size of BUFFER, LEN is the length of the string in
|
|
|
329 * BUFFER after readline reads it.
|
|
|
330 */
|
|
|
331 typedef struct
|
|
|
332 {
|
|
|
333 long size;
|
|
|
334 int len;
|
|
|
335 char *buffer;
|
|
|
336 } linebuffer;
|
|
|
337
|
|
2225
|
338 /* Used to support mixing of --lang and file names. */
|
|
|
339 typedef struct
|
|
|
340 {
|
|
|
341 enum {
|
|
|
342 at_language, /* a language specification */
|
|
|
343 at_regexp, /* a regular expression */
|
|
|
344 at_filename, /* a file name */
|
|
|
345 at_stdin, /* read from stdin here */
|
|
|
346 at_end /* stop parsing the list */
|
|
|
347 } arg_type; /* argument type */
|
|
|
348 language *lang; /* language associated with the argument */
|
|
|
349 char *what; /* the argument itself */
|
|
|
350 } argument;
|
|
|
351
|
|
|
352 /* Structure defining a regular expression. */
|
|
|
353 typedef struct regexp
|
|
|
354 {
|
|
|
355 struct regexp *p_next; /* pointer to next in list */
|
|
|
356 language *lang; /* if set, use only for this language */
|
|
|
357 char *pattern; /* the regexp pattern */
|
|
|
358 char *name; /* tag name */
|
|
|
359 struct re_pattern_buffer *pat; /* the compiled pattern */
|
|
|
360 struct re_registers regs; /* re registers */
|
|
|
361 bool error_signaled; /* already signaled for this regexp */
|
|
|
362 bool force_explicit_name; /* do not allow implict tag name */
|
|
|
363 bool ignore_case; /* ignore case when matching */
|
|
|
364 bool multi_line; /* do a multi-line match on the whole file */
|
|
|
365 } regexp;
|
|
|
366
|
|
|
367
|
|
428
|
368 /* Many compilers barf on this:
|
|
|
369 Lang_function Ada_funcs;
|
|
|
370 so let's write it this way */
|
|
709
|
371 static void Ada_funcs __P((FILE *));
|
|
|
372 static void Asm_labels __P((FILE *));
|
|
|
373 static void C_entries __P((int c_ext, FILE *));
|
|
|
374 static void default_C_entries __P((FILE *));
|
|
|
375 static void plain_C_entries __P((FILE *));
|
|
|
376 static void Cjava_entries __P((FILE *));
|
|
|
377 static void Cobol_paragraphs __P((FILE *));
|
|
|
378 static void Cplusplus_entries __P((FILE *));
|
|
|
379 static void Cstar_entries __P((FILE *));
|
|
|
380 static void Erlang_functions __P((FILE *));
|
|
2554
|
381 static void Forth_words __P((FILE *));
|
|
709
|
382 static void Fortran_functions __P((FILE *));
|
|
2225
|
383 static void HTML_labels __P((FILE *));
|
|
709
|
384 static void Lisp_functions __P((FILE *));
|
|
2325
|
385 static void Lua_functions __P((FILE *));
|
|
709
|
386 static void Makefile_targets __P((FILE *));
|
|
|
387 static void Pascal_functions __P((FILE *));
|
|
|
388 static void Perl_functions __P((FILE *));
|
|
|
389 static void PHP_functions __P((FILE *));
|
|
2225
|
390 static void PS_functions __P((FILE *));
|
|
709
|
391 static void Prolog_functions __P((FILE *));
|
|
|
392 static void Python_functions __P((FILE *));
|
|
|
393 static void Scheme_functions __P((FILE *));
|
|
|
394 static void TeX_commands __P((FILE *));
|
|
|
395 static void Texinfo_nodes __P((FILE *));
|
|
2225
|
396 static void Yacc_entries __P((FILE *));
|
|
709
|
397 static void just_read_file __P((FILE *));
|
|
|
398
|
|
|
399 static void print_language_names __P((void));
|
|
|
400 static void print_version __P((void));
|
|
2225
|
401 static void print_help __P((argument *));
|
|
709
|
402 int main __P((int, char **));
|
|
|
403
|
|
|
404 static compressor *get_compressor_from_suffix __P((char *, char **));
|
|
|
405 static language *get_language_from_langname __P((const char *));
|
|
|
406 static language *get_language_from_interpreter __P((char *));
|
|
2225
|
407 static language *get_language_from_filename __P((char *, bool));
|
|
|
408 static void readline __P((linebuffer *, FILE *));
|
|
709
|
409 static long readline_internal __P((linebuffer *, FILE *));
|
|
2225
|
410 static bool nocase_tail __P((char *));
|
|
|
411 static void get_tag __P((char *, char **));
|
|
428
|
412
|
|
2225
|
413 static void analyse_regex __P((char *));
|
|
|
414 static void free_regexps __P((void));
|
|
|
415 static void regex_tag_multiline __P((void));
|
|
709
|
416 static void error __P((const char *, const char *));
|
|
|
417 static void suggest_asking_for_help __P((void));
|
|
|
418 void fatal __P((char *, char *));
|
|
|
419 static void pfatal __P((char *));
|
|
|
420 static void add_node __P((node *, node **));
|
|
|
421
|
|
|
422 static void init __P((void));
|
|
2225
|
423 static void process_file_name __P((char *, language *));
|
|
|
424 static void process_file __P((FILE *, char *, language *));
|
|
|
425 static void find_entries __P((FILE *));
|
|
709
|
426 static void free_tree __P((node *));
|
|
2225
|
427 static void free_fdesc __P((fdesc *));
|
|
709
|
428 static void pfnote __P((char *, bool, char *, int, int, long));
|
|
2225
|
429 static void make_tag __P((char *, int, bool, char *, int, int, long));
|
|
|
430 static void invalidate_nodes __P((fdesc *, node **));
|
|
709
|
431 static void put_entries __P((node *));
|
|
|
432
|
|
|
433 static char *concat __P((char *, char *, char *));
|
|
|
434 static char *skip_spaces __P((char *));
|
|
|
435 static char *skip_non_spaces __P((char *));
|
|
|
436 static char *savenstr __P((char *, int));
|
|
|
437 static char *savestr __P((char *));
|
|
|
438 static char *etags_strchr __P((const char *, int));
|
|
|
439 static char *etags_strrchr __P((const char *, int));
|
|
2225
|
440 static int etags_strcasecmp __P((const char *, const char *));
|
|
|
441 static int etags_strncasecmp __P((const char *, const char *, int));
|
|
709
|
442 static char *etags_getcwd __P((void));
|
|
|
443 static char *relative_filename __P((char *, char *));
|
|
|
444 static char *absolute_filename __P((char *, char *));
|
|
|
445 static char *absolute_dirname __P((char *, char *));
|
|
|
446 static bool filename_is_absolute __P((char *f));
|
|
|
447 static void canonicalize_filename __P((char *));
|
|
2225
|
448 static void linebuffer_init __P((linebuffer *));
|
|
709
|
449 static void linebuffer_setlen __P((linebuffer *, int));
|
|
2225
|
450 static PTR xmalloc __P((unsigned int));
|
|
|
451 static PTR xrealloc __P((char *, unsigned int));
|
|
428
|
452
|
|
|
453
|
|
2225
|
454 static char searchar = '/'; /* use /.../ searches */
|
|
|
455
|
|
|
456 static char *tagfile; /* output file */
|
|
|
457 static char *progname; /* name this program was invoked with */
|
|
|
458 static char *cwd; /* current working directory */
|
|
|
459 static char *tagfiledir; /* directory of tagfile */
|
|
|
460 static FILE *tagf; /* ioptr for tags file */
|
|
|
461
|
|
|
462 static fdesc *fdhead; /* head of file description list */
|
|
|
463 static fdesc *curfdp; /* current file description */
|
|
|
464 static int lineno; /* line number of current line */
|
|
|
465 static long charno; /* current character number */
|
|
|
466 static long linecharno; /* charno of start of current line */
|
|
|
467 static char *dbp; /* pointer to start of current tag */
|
|
|
468
|
|
|
469 static const int invalidcharno = -1;
|
|
|
470
|
|
|
471 static node *nodehead; /* the head of the binary tree of tags */
|
|
|
472 static node *last_node; /* the last node created */
|
|
|
473
|
|
|
474 static linebuffer lb; /* the current line */
|
|
|
475 static linebuffer filebuf; /* a buffer containing the whole file */
|
|
|
476 static linebuffer token_name; /* a buffer containing a tag name */
|
|
428
|
477
|
|
|
478 /* boolean "functions" (see init) */
|
|
2225
|
479 static bool _wht[CHARS], _nin[CHARS], _itk[CHARS], _btk[CHARS], _etk[CHARS];
|
|
|
480 static char
|
|
428
|
481 /* white chars */
|
|
442
|
482 *white = " \f\t\n\r\v",
|
|
428
|
483 /* not in a name */
|
|
2225
|
484 *nonam = " \f\t\n\r()=,;", /* look at make_tag before modifying! */
|
|
428
|
485 /* token ending chars */
|
|
|
486 *endtk = " \t\n\r\"'#()[]{}=-+%*/&|^~!<>;,.:?",
|
|
|
487 /* token starting chars */
|
|
|
488 *begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~@",
|
|
|
489 /* valid in-token chars */
|
|
|
490 *midtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
|
|
|
491
|
|
2225
|
492 static bool append_to_tagfile; /* -a: append to tags */
|
|
3972
|
493 /* The next five default to TRUE for etags, but to FALSE for ctags. */
|
|
2225
|
494 static bool typedefs; /* -t: create tags for C and Ada typedefs */
|
|
|
495 static bool typedefs_or_cplusplus; /* -T: create tags for C typedefs, level */
|
|
428
|
496 /* 0 struct/enum/union decls, and C++ */
|
|
|
497 /* member functions. */
|
|
2225
|
498 static bool constantypedefs; /* -d: create tags for C #define, enum */
|
|
428
|
499 /* constants and variables. */
|
|
|
500 /* -D: opposite of -d. Default under ctags. */
|
|
2225
|
501 static bool globals; /* create tags for global variables */
|
|
3972
|
502 static bool members; /* create tags for C member variables */
|
|
2225
|
503 static bool declarations; /* --declarations: tag them and extern in C&Co*/
|
|
|
504 static bool no_line_directive; /* ignore #line directives (undocumented) */
|
|
3876
|
505 static bool no_duplicates; /* no duplicate tags for ctags (undocumented) */
|
|
2225
|
506 static bool update; /* -u: update tags */
|
|
|
507 static bool vgrind_style; /* -v: create vgrind style index output */
|
|
3876
|
508 static bool no_warnings; /* -w: suppress warnings (undocumented) */
|
|
2225
|
509 static bool cxref_style; /* -x: create cxref style output */
|
|
|
510 static bool cplusplus; /* .[hc] means C++, not C */
|
|
|
511 static bool ignoreindent; /* -I: ignore indentation in C */
|
|
|
512 static bool packages_only; /* --packages-only: in Ada, only tag packages*/
|
|
|
513
|
|
3517
|
514 /* STDIN is defined in LynxOS system headers */
|
|
|
515 #ifdef STDIN
|
|
|
516 # undef STDIN
|
|
|
517 #endif
|
|
|
518
|
|
2225
|
519 #define STDIN 0x1001 /* returned by getopt_long on --parse-stdin */
|
|
|
520 static bool parsing_stdin; /* --parse-stdin used */
|
|
|
521
|
|
|
522 static regexp *p_head; /* list of all regexps */
|
|
|
523 static bool need_filebuf; /* some regexes are multi-line */
|
|
3517
|
524
|
|
2225
|
525 static struct option longopts[] =
|
|
428
|
526 {
|
|
3876
|
527 { "append", no_argument, NULL, 'a' },
|
|
|
528 { "packages-only", no_argument, &packages_only, TRUE },
|
|
|
529 { "c++", no_argument, NULL, 'C' },
|
|
|
530 { "declarations", no_argument, &declarations, TRUE },
|
|
|
531 { "no-line-directive", no_argument, &no_line_directive, TRUE },
|
|
|
532 { "no-duplicates", no_argument, &no_duplicates, TRUE },
|
|
|
533 { "help", no_argument, NULL, 'h' },
|
|
|
534 { "help", no_argument, NULL, 'H' },
|
|
|
535 { "ignore-indentation", no_argument, NULL, 'I' },
|
|
|
536 { "language", required_argument, NULL, 'l' },
|
|
|
537 { "members", no_argument, &members, TRUE },
|
|
|
538 { "no-members", no_argument, &members, FALSE },
|
|
|
539 { "output", required_argument, NULL, 'o' },
|
|
|
540 { "regex", required_argument, NULL, 'r' },
|
|
|
541 { "no-regex", no_argument, NULL, 'R' },
|
|
|
542 { "ignore-case-regex", required_argument, NULL, 'c' },
|
|
2225
|
543 { "parse-stdin", required_argument, NULL, STDIN },
|
|
3876
|
544 { "version", no_argument, NULL, 'V' },
|
|
2225
|
545
|
|
3090
|
546 #if CTAGS /* Ctags options */
|
|
3876
|
547 { "backward-search", no_argument, NULL, 'B' },
|
|
|
548 { "cxref", no_argument, NULL, 'x' },
|
|
|
549 { "defines", no_argument, NULL, 'd' },
|
|
|
550 { "globals", no_argument, &globals, TRUE },
|
|
|
551 { "typedefs", no_argument, NULL, 't' },
|
|
|
552 { "typedefs-and-c++", no_argument, NULL, 'T' },
|
|
|
553 { "update", no_argument, NULL, 'u' },
|
|
|
554 { "vgrind", no_argument, NULL, 'v' },
|
|
|
555 { "no-warn", no_argument, NULL, 'w' },
|
|
2225
|
556
|
|
3090
|
557 #else /* Etags options */
|
|
3876
|
558 { "no-defines", no_argument, NULL, 'D' },
|
|
|
559 { "no-globals", no_argument, &globals, FALSE },
|
|
|
560 { "include", required_argument, NULL, 'i' },
|
|
2225
|
561 #endif
|
|
428
|
562 { NULL }
|
|
|
563 };
|
|
|
564
|
|
2225
|
565 static compressor compressors[] =
|
|
428
|
566 {
|
|
|
567 { "z", "gzip -d -c"},
|
|
|
568 { "Z", "gzip -d -c"},
|
|
|
569 { "gz", "gzip -d -c"},
|
|
|
570 { "GZ", "gzip -d -c"},
|
|
|
571 { "bz2", "bzip2 -d -c" },
|
|
|
572 { NULL }
|
|
|
573 };
|
|
|
574
|
|
|
575 /*
|
|
|
576 * Language stuff.
|
|
|
577 */
|
|
|
578
|
|
|
579 /* Ada code */
|
|
2225
|
580 static char *Ada_suffixes [] =
|
|
428
|
581 { "ads", "adb", "ada", NULL };
|
|
2225
|
582 static char Ada_help [] =
|
|
|
583 "In Ada code, functions, procedures, packages, tasks and types are\n\
|
|
|
584 tags. Use the `--packages-only' option to create tags for\n\
|
|
|
585 packages only.\n\
|
|
|
586 Ada tag names have suffixes indicating the type of entity:\n\
|
|
|
587 Entity type: Qualifier:\n\
|
|
|
588 ------------ ----------\n\
|
|
|
589 function /f\n\
|
|
|
590 procedure /p\n\
|
|
|
591 package spec /s\n\
|
|
|
592 package body /b\n\
|
|
|
593 type /t\n\
|
|
|
594 task /k\n\
|
|
|
595 Thus, `M-x find-tag <RET> bidule/b <RET>' will go directly to the\n\
|
|
|
596 body of the package `bidule', while `M-x find-tag <RET> bidule <RET>'\n\
|
|
|
597 will just search for any tag `bidule'.";
|
|
428
|
598
|
|
|
599 /* Assembly code */
|
|
2225
|
600 static char *Asm_suffixes [] =
|
|
|
601 { "a", /* Unix assembler */
|
|
|
602 "asm", /* Microcontroller assembly */
|
|
|
603 "def", /* BSO/Tasking definition includes */
|
|
|
604 "inc", /* Microcontroller include files */
|
|
|
605 "ins", /* Microcontroller include files */
|
|
|
606 "s", "sa", /* Unix assembler */
|
|
|
607 "S", /* cpp-processed Unix assembler */
|
|
|
608 "src", /* BSO/Tasking C compiler output */
|
|
|
609 NULL
|
|
|
610 };
|
|
|
611 static char Asm_help [] =
|
|
|
612 "In assembler code, labels appearing at the beginning of a line,\n\
|
|
|
613 followed by a colon, are tags.";
|
|
|
614
|
|
428
|
615
|
|
|
616 /* Note that .c and .h can be considered C++, if the --c++ flag was
|
|
2225
|
617 given, or if the `class' or `template' keyowrds are met inside the file.
|
|
458
|
618 That is why default_C_entries is called for these. */
|
|
2225
|
619 static char *default_C_suffixes [] =
|
|
428
|
620 { "c", "h", NULL };
|
|
2225
|
621 static char default_C_help [] =
|
|
|
622 "In C code, any C function or typedef is a tag, and so are\n\
|
|
|
623 definitions of `struct', `union' and `enum'. `#define' macro\n\
|
|
|
624 definitions and `enum' constants are tags unless you specify\n\
|
|
|
625 `--no-defines'. Global variables are tags unless you specify\n\
|
|
3972
|
626 `--no-globals' and so are struct members unless you specify\n\
|
|
|
627 `--no-members'. Use of `--no-globals', `--no-defines' and\n\
|
|
|
628 `--no-members' can make the tags table file much smaller.\n\
|
|
2225
|
629 You can tag function declarations and external variables by\n\
|
|
3972
|
630 using `--declarations'.";
|
|
2225
|
631
|
|
|
632 static char *Cplusplus_suffixes [] =
|
|
458
|
633 { "C", "c++", "cc", "cpp", "cxx", "H", "h++", "hh", "hpp", "hxx",
|
|
428
|
634 "M", /* Objective C++ */
|
|
|
635 "pdb", /* Postscript with C syntax */
|
|
|
636 NULL };
|
|
2225
|
637 static char Cplusplus_help [] =
|
|
|
638 "In C++ code, all the tag constructs of C code are tagged. (Use\n\
|
|
|
639 --help --lang=c --lang=c++ for full help.)\n\
|
|
3972
|
640 In addition to C tags, member functions are also recognized. Member\n\
|
|
|
641 variables are recognized unless you use the `--no-members' option.\n\
|
|
2225
|
642 Tags for variables and functions in classes are named `CLASS::VARIABLE'\n\
|
|
|
643 and `CLASS::FUNCTION'. `operator' definitions have tag names like\n\
|
|
|
644 `operator+'.";
|
|
|
645
|
|
|
646 static char *Cjava_suffixes [] =
|
|
428
|
647 { "java", NULL };
|
|
2225
|
648 static char Cjava_help [] =
|
|
|
649 "In Java code, all the tags constructs of C and C++ code are\n\
|
|
|
650 tagged. (Use --help --lang=c --lang=c++ --lang=java for full help.)";
|
|
|
651
|
|
|
652
|
|
|
653 static char *Cobol_suffixes [] =
|
|
428
|
654 { "COB", "cob", NULL };
|
|
2225
|
655 static char Cobol_help [] =
|
|
|
656 "In Cobol code, tags are paragraph names; that is, any word\n\
|
|
|
657 starting in column 8 and followed by a period.";
|
|
|
658
|
|
|
659 static char *Cstar_suffixes [] =
|
|
428
|
660 { "cs", "hs", NULL };
|
|
|
661
|
|
2225
|
662 static char *Erlang_suffixes [] =
|
|
428
|
663 { "erl", "hrl", NULL };
|
|
2225
|
664 static char Erlang_help [] =
|
|
|
665 "In Erlang code, the tags are the functions, records and macros\n\
|
|
|
666 defined in the file.";
|
|
|
667
|
|
2554
|
668 char *Forth_suffixes [] =
|
|
|
669 { "fth", "tok", NULL };
|
|
|
670 static char Forth_help [] =
|
|
|
671 "In Forth code, tags are words defined by `:',\n\
|
|
|
672 constant, code, create, defer, value, variable, buffer:, field.";
|
|
|
673
|
|
2225
|
674 static char *Fortran_suffixes [] =
|
|
428
|
675 { "F", "f", "f90", "for", NULL };
|
|
2225
|
676 static char Fortran_help [] =
|
|
|
677 "In Fortran code, functions, subroutines and block data are tags.";
|
|
|
678
|
|
|
679 static char *HTML_suffixes [] =
|
|
|
680 { "htm", "html", "shtml", NULL };
|
|
|
681 static char HTML_help [] =
|
|
|
682 "In HTML input files, the tags are the `title' and the `h1', `h2',\n\
|
|
|
683 `h3' headers. Also, tags are `name=' in anchors and all\n\
|
|
|
684 occurrences of `id='.";
|
|
|
685
|
|
|
686 static char *Lisp_suffixes [] =
|
|
458
|
687 { "cl", "clisp", "el", "l", "lisp", "LSP", "lsp", "ml", NULL };
|
|
2225
|
688 static char Lisp_help [] =
|
|
|
689 "In Lisp code, any function defined with `defun', any variable\n\
|
|
|
690 defined with `defvar' or `defconst', and in general the first\n\
|
|
|
691 argument of any expression that starts with `(def' in column zero\n\
|
|
|
692 is a tag.";
|
|
|
693
|
|
2325
|
694 static char *Lua_suffixes [] =
|
|
|
695 { "lua", "LUA", NULL };
|
|
|
696 static char Lua_help [] =
|
|
|
697 "In Lua scripts, all functions are tags.";
|
|
|
698
|
|
2225
|
699 static char *Makefile_filenames [] =
|
|
458
|
700 { "Makefile", "makefile", "GNUMakefile", "Makefile.in", "Makefile.am", NULL};
|
|
2225
|
701 static char Makefile_help [] =
|
|
|
702 "In makefiles, targets are tags; additionally, variables are tags\n\
|
|
|
703 unless you specify `--no-globals'.";
|
|
|
704
|
|
|
705 static char *Objc_suffixes [] =
|
|
458
|
706 { "lm", /* Objective lex file */
|
|
428
|
707 "m", /* Objective C file */
|
|
|
708 NULL };
|
|
2225
|
709 static char Objc_help [] =
|
|
|
710 "In Objective C code, tags include Objective C definitions for classes,\n\
|
|
|
711 class categories, methods and protocols. Tags for variables and\n\
|
|
3517
|
712 functions in classes are named `CLASS::VARIABLE' and `CLASS::FUNCTION'.\n\
|
|
|
713 (Use --help --lang=c --lang=objc --lang=java for full help.)";
|
|
2225
|
714
|
|
|
715 static char *Pascal_suffixes [] =
|
|
|
716 { "p", "pas", NULL };
|
|
|
717 static char Pascal_help [] =
|
|
|
718 "In Pascal code, the tags are the functions and procedures defined\n\
|
|
|
719 in the file.";
|
|
3517
|
720 /* " // this is for working around an Emacs highlighting bug... */
|
|
2225
|
721
|
|
|
722 static char *Perl_suffixes [] =
|
|
|
723 { "pl", "pm", NULL };
|
|
|
724 static char *Perl_interpreters [] =
|
|
|
725 { "perl", "@PERL@", NULL };
|
|
|
726 static char Perl_help [] =
|
|
|
727 "In Perl code, the tags are the packages, subroutines and variables\n\
|
|
|
728 defined by the `package', `sub', `my' and `local' keywords. Use\n\
|
|
|
729 `--globals' if you want to tag global variables. Tags for\n\
|
|
|
730 subroutines are named `PACKAGE::SUB'. The name for subroutines\n\
|
|
|
731 defined in the default package is `main::SUB'.";
|
|
|
732
|
|
|
733 static char *PHP_suffixes [] =
|
|
|
734 { "php", "php3", "php4", NULL };
|
|
|
735 static char PHP_help [] =
|
|
3972
|
736 "In PHP code, tags are functions, classes and defines. Unless you use\n\
|
|
|
737 the `--no-members' option, vars are tags too.";
|
|
2225
|
738
|
|
|
739 static char *plain_C_suffixes [] =
|
|
|
740 { "pc", /* Pro*C file */
|
|
|
741 NULL };
|
|
|
742
|
|
|
743 static char *PS_suffixes [] =
|
|
428
|
744 { "ps", "psw", NULL }; /* .psw is for PSWrap */
|
|
2225
|
745 static char PS_help [] =
|
|
|
746 "In PostScript code, the tags are the functions.";
|
|
|
747
|
|
|
748 static char *Prolog_suffixes [] =
|
|
428
|
749 { "prolog", NULL };
|
|
2225
|
750 static char Prolog_help [] =
|
|
|
751 "In Prolog code, tags are predicates and rules at the beginning of\n\
|
|
|
752 line.";
|
|
|
753
|
|
|
754 static char *Python_suffixes [] =
|
|
428
|
755 { "py", NULL };
|
|
2225
|
756 static char Python_help [] =
|
|
|
757 "In Python code, `def' or `class' at the beginning of a line\n\
|
|
|
758 generate a tag.";
|
|
428
|
759
|
|
|
760 /* Can't do the `SCM' or `scm' prefix with a version number. */
|
|
2225
|
761 static char *Scheme_suffixes [] =
|
|
458
|
762 { "oak", "sch", "scheme", "SCM", "scm", "SM", "sm", "ss", "t", NULL };
|
|
2225
|
763 static char Scheme_help [] =
|
|
|
764 "In Scheme code, tags include anything defined with `def' or with a\n\
|
|
|
765 construct whose name starts with `def'. They also include\n\
|
|
|
766 variables set with `set!' at top level in the file.";
|
|
|
767
|
|
|
768 static char *TeX_suffixes [] =
|
|
458
|
769 { "bib", "clo", "cls", "ltx", "sty", "TeX", "tex", NULL };
|
|
2225
|
770 static char TeX_help [] =
|
|
|
771 "In LaTeX text, the argument of any of the commands `\\chapter',\n\
|
|
|
772 `\\section', `\\subsection', `\\subsubsection', `\\eqno', `\\label',\n\
|
|
|
773 `\\ref', `\\cite', `\\bibitem', `\\part', `\\appendix', `\\entry',\n\
|
|
|
774 `\\index', `\\def', `\\newcommand', `\\renewcommand',\n\
|
|
|
775 `\\newenvironment' or `\\renewenvironment' is a tag.\n\
|
|
|
776 \n\
|
|
|
777 Other commands can be specified by setting the environment variable\n\
|
|
|
778 `TEXTAGS' to a colon-separated list like, for example,\n\
|
|
|
779 TEXTAGS=\"mycommand:myothercommand\".";
|
|
|
780
|
|
|
781
|
|
|
782 static char *Texinfo_suffixes [] =
|
|
458
|
783 { "texi", "texinfo", "txi", NULL };
|
|
2225
|
784 static char Texinfo_help [] =
|
|
|
785 "for texinfo files, lines starting with @node are tagged.";
|
|
|
786
|
|
|
787 static char *Yacc_suffixes [] =
|
|
458
|
788 { "y", "y++", "ym", "yxx", "yy", NULL }; /* .ym is Objective yacc file */
|
|
2225
|
789 static char Yacc_help [] =
|
|
|
790 "In Bison or Yacc input files, each rule defines as a tag the\n\
|
|
|
791 nonterminal it constructs. The portions of the file that contain\n\
|
|
|
792 C code are parsed as C code (use --help --lang=c --lang=yacc\n\
|
|
|
793 for full help).";
|
|
|
794
|
|
|
795 static char auto_help [] =
|
|
|
796 "`auto' is not a real language, it indicates to use\n\
|
|
|
797 a default language for files base on file name suffix and file contents.";
|
|
|
798
|
|
|
799 static char none_help [] =
|
|
|
800 "`none' is not a real language, it indicates to only do\n\
|
|
|
801 regexp processing on files.";
|
|
|
802
|
|
|
803 static char no_lang_help [] =
|
|
|
804 "No detailed help available for this language.";
|
|
|
805
|
|
428
|
806
|
|
|
807 /*
|
|
|
808 * Table of languages.
|
|
|
809 *
|
|
|
810 * It is ok for a given function to be listed under more than one
|
|
|
811 * name. I just didn't.
|
|
|
812 */
|
|
|
813
|
|
2225
|
814 static language lang_names [] =
|
|
428
|
815 {
|
|
2225
|
816 { "ada", Ada_help, Ada_funcs, Ada_suffixes },
|
|
|
817 { "asm", Asm_help, Asm_labels, Asm_suffixes },
|
|
|
818 { "c", default_C_help, default_C_entries, default_C_suffixes },
|
|
|
819 { "c++", Cplusplus_help, Cplusplus_entries, Cplusplus_suffixes },
|
|
|
820 { "c*", no_lang_help, Cstar_entries, Cstar_suffixes },
|
|
|
821 { "cobol", Cobol_help, Cobol_paragraphs, Cobol_suffixes },
|
|
|
822 { "erlang", Erlang_help, Erlang_functions, Erlang_suffixes },
|
|
2554
|
823 { "forth", Forth_help, Forth_words, Forth_suffixes },
|
|
2225
|
824 { "fortran", Fortran_help, Fortran_functions, Fortran_suffixes },
|
|
|
825 { "html", HTML_help, HTML_labels, HTML_suffixes },
|
|
|
826 { "java", Cjava_help, Cjava_entries, Cjava_suffixes },
|
|
|
827 { "lisp", Lisp_help, Lisp_functions, Lisp_suffixes },
|
|
2325
|
828 { "lua", Lua_help, Lua_functions, Lua_suffixes },
|
|
2225
|
829 { "makefile", Makefile_help,Makefile_targets,NULL,Makefile_filenames},
|
|
|
830 { "objc", Objc_help, plain_C_entries, Objc_suffixes },
|
|
|
831 { "pascal", Pascal_help, Pascal_functions, Pascal_suffixes },
|
|
|
832 { "perl",Perl_help,Perl_functions,Perl_suffixes,NULL,Perl_interpreters},
|
|
|
833 { "php", PHP_help, PHP_functions, PHP_suffixes },
|
|
|
834 { "postscript",PS_help, PS_functions, PS_suffixes },
|
|
|
835 { "proc", no_lang_help, plain_C_entries, plain_C_suffixes },
|
|
|
836 { "prolog", Prolog_help, Prolog_functions, Prolog_suffixes },
|
|
|
837 { "python", Python_help, Python_functions, Python_suffixes },
|
|
|
838 { "scheme", Scheme_help, Scheme_functions, Scheme_suffixes },
|
|
|
839 { "tex", TeX_help, TeX_commands, TeX_suffixes },
|
|
|
840 { "texinfo", Texinfo_help, Texinfo_nodes, Texinfo_suffixes },
|
|
|
841 { "yacc", Yacc_help,Yacc_entries,Yacc_suffixes,NULL,NULL,TRUE},
|
|
|
842 { "auto", auto_help }, /* default guessing scheme */
|
|
|
843 { "none", none_help, just_read_file }, /* regexp matching only */
|
|
|
844 { NULL } /* end of list */
|
|
428
|
845 };
|
|
458
|
846
|
|
428
|
847
|
|
|
848 static void
|
|
|
849 print_language_names ()
|
|
|
850 {
|
|
|
851 language *lang;
|
|
458
|
852 char **name, **ext;
|
|
428
|
853
|
|
|
854 puts ("\nThese are the currently supported languages, along with the\n\
|
|
458
|
855 default file names and dot suffixes:");
|
|
428
|
856 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
857 {
|
|
458
|
858 printf (" %-*s", 10, lang->name);
|
|
|
859 if (lang->filenames != NULL)
|
|
|
860 for (name = lang->filenames; *name != NULL; name++)
|
|
|
861 printf (" %s", *name);
|
|
428
|
862 if (lang->suffixes != NULL)
|
|
|
863 for (ext = lang->suffixes; *ext != NULL; ext++)
|
|
|
864 printf (" .%s", *ext);
|
|
|
865 puts ("");
|
|
|
866 }
|
|
2225
|
867 puts ("where `auto' means use default language for files based on file\n\
|
|
428
|
868 name suffix, and `none' means only do regexp processing on files.\n\
|
|
|
869 If no language is specified and no matching suffix is found,\n\
|
|
|
870 the first line of the file is read for a sharp-bang (#!) sequence\n\
|
|
|
871 followed by the name of an interpreter. If no such sequence is found,\n\
|
|
|
872 Fortran is tried first; if no tags are found, C is tried next.\n\
|
|
2225
|
873 When parsing any C file, a \"class\" or \"template\" keyword\n\
|
|
|
874 switches to C++.");
|
|
|
875 puts ("Compressed files are supported using gzip and bzip2.\n\
|
|
|
876 \n\
|
|
|
877 For detailed help on a given language use, for example,\n\
|
|
|
878 etags --help --lang=ada.");
|
|
428
|
879 }
|
|
|
880
|
|
442
|
881 #ifndef EMACS_NAME
|
|
2225
|
882 # define EMACS_NAME "standalone"
|
|
428
|
883 #endif
|
|
3972
|
884 #ifndef VERSION
|
|
|
885 # define VERSION "17.32"
|
|
428
|
886 #endif
|
|
|
887 static void
|
|
|
888 print_version ()
|
|
|
889 {
|
|
3972
|
890 printf ("%s (%s %s)\n", (CTAGS) ? "ctags" : "etags", EMACS_NAME, VERSION);
|
|
|
891 puts ("Copyright (C) 2007 Free Software Foundation, Inc.");
|
|
|
892 puts ("This program is distributed under the terms in ETAGS.README");
|
|
428
|
893
|
|
2225
|
894 exit (EXIT_SUCCESS);
|
|
428
|
895 }
|
|
|
896
|
|
|
897 static void
|
|
2225
|
898 print_help (argbuffer)
|
|
|
899 argument *argbuffer;
|
|
428
|
900 {
|
|
2225
|
901 bool help_for_lang = FALSE;
|
|
|
902
|
|
|
903 for (; argbuffer->arg_type != at_end; argbuffer++)
|
|
|
904 if (argbuffer->arg_type == at_language)
|
|
|
905 {
|
|
|
906 if (help_for_lang)
|
|
|
907 puts ("");
|
|
|
908 puts (argbuffer->lang->help);
|
|
|
909 help_for_lang = TRUE;
|
|
|
910 }
|
|
|
911
|
|
|
912 if (help_for_lang)
|
|
|
913 exit (EXIT_SUCCESS);
|
|
|
914
|
|
428
|
915 printf ("Usage: %s [options] [[regex-option ...] file-name] ...\n\
|
|
|
916 \n\
|
|
|
917 These are the options accepted by %s.\n", progname, progname);
|
|
3517
|
918 if (NO_LONG_OPTIONS)
|
|
|
919 puts ("WARNING: long option names do not work with this executable,\n\
|
|
|
920 as it is not linked with GNU getopt.");
|
|
2325
|
921 else
|
|
3517
|
922 puts ("You may use unambiguous abbreviations for the long option names.");
|
|
2225
|
923 puts (" A - as file name means read names from stdin (one per line).\n\
|
|
|
924 Absolute names are stored in the output file as they are.\n\
|
|
|
925 Relative ones are stored relative to the output file's directory.\n");
|
|
|
926
|
|
3090
|
927 puts ("-a, --append\n\
|
|
428
|
928 Append tag entries to existing tags file.");
|
|
|
929
|
|
|
930 puts ("--packages-only\n\
|
|
2225
|
931 For Ada files, only generate tags for packages.");
|
|
428
|
932
|
|
|
933 if (CTAGS)
|
|
|
934 puts ("-B, --backward-search\n\
|
|
|
935 Write the search commands for the tag entries using '?', the\n\
|
|
|
936 backward-search command instead of '/', the forward-search command.");
|
|
|
937
|
|
458
|
938 /* This option is mostly obsolete, because etags can now automatically
|
|
|
939 detect C++. Retained for backward compatibility and for debugging and
|
|
|
940 experimentation. In principle, we could want to tag as C++ even
|
|
2225
|
941 before any "class" or "template" keyword.
|
|
428
|
942 puts ("-C, --c++\n\
|
|
|
943 Treat files whose name suffix defaults to C language as C++ files.");
|
|
458
|
944 */
|
|
428
|
945
|
|
|
946 puts ("--declarations\n\
|
|
|
947 In C and derived languages, create tags for function declarations,");
|
|
|
948 if (CTAGS)
|
|
|
949 puts ("\tand create tags for extern variables if --globals is used.");
|
|
|
950 else
|
|
|
951 puts
|
|
|
952 ("\tand create tags for extern variables unless --no-globals is used.");
|
|
|
953
|
|
|
954 if (CTAGS)
|
|
|
955 puts ("-d, --defines\n\
|
|
|
956 Create tag entries for C #define constants and enum constants, too.");
|
|
|
957 else
|
|
|
958 puts ("-D, --no-defines\n\
|
|
|
959 Don't create tag entries for C #define constants and enum constants.\n\
|
|
|
960 This makes the tags file smaller.");
|
|
|
961
|
|
|
962 if (!CTAGS)
|
|
2225
|
963 puts ("-i FILE, --include=FILE\n\
|
|
428
|
964 Include a note in tag file indicating that, when searching for\n\
|
|
|
965 a tag, one should also consult the tags file FILE after\n\
|
|
|
966 checking the current file.");
|
|
2225
|
967
|
|
|
968 puts ("-l LANG, --language=LANG\n\
|
|
428
|
969 Force the following files to be considered as written in the\n\
|
|
|
970 named language up to the next --language=LANG option.");
|
|
|
971
|
|
|
972 if (CTAGS)
|
|
|
973 puts ("--globals\n\
|
|
|
974 Create tag entries for global variables in some languages.");
|
|
|
975 else
|
|
|
976 puts ("--no-globals\n\
|
|
|
977 Do not create tag entries for global variables in some\n\
|
|
|
978 languages. This makes the tags file smaller.");
|
|
3972
|
979 if (CTAGS)
|
|
|
980 puts ("--members\n\
|
|
2225
|
981 Create tag entries for members of structures in some languages.");
|
|
3972
|
982 else
|
|
|
983 puts ("--no-members\n\
|
|
|
984 Do not create tag entries for members of structures\n\
|
|
|
985 in some languages.");
|
|
428
|
986
|
|
2225
|
987 puts ("-r REGEXP, --regex=REGEXP or --regex=@regexfile\n\
|
|
|
988 Make a tag for each line matching a regular expression pattern\n\
|
|
|
989 in the following files. {LANGUAGE}REGEXP uses REGEXP for LANGUAGE\n\
|
|
|
990 files only. REGEXFILE is a file containing one REGEXP per line.\n\
|
|
|
991 REGEXP takes the form /TAGREGEXP/TAGNAME/MODS, where TAGNAME/ is\n\
|
|
|
992 optional. The TAGREGEXP pattern is anchored (as if preceded by ^).");
|
|
|
993 puts (" If TAGNAME/ is present, the tags created are named.\n\
|
|
428
|
994 For example Tcl named tags can be created with:\n\
|
|
2225
|
995 --regex=\"/proc[ \\t]+\\([^ \\t]+\\)/\\1/.\".\n\
|
|
|
996 MODS are optional one-letter modifiers: `i' means to ignore case,\n\
|
|
|
997 `m' means to allow multi-line matches, `s' implies `m' and\n\
|
|
|
998 causes dot to match any character, including newline.");
|
|
428
|
999 puts ("-R, --no-regex\n\
|
|
|
1000 Don't create tags from regexps for the following files.");
|
|
2225
|
1001 puts ("-I, --ignore-indentation\n\
|
|
|
1002 In C and C++ do not assume that a closing brace in the first\n\
|
|
|
1003 column is the final brace of a function or structure definition.");
|
|
428
|
1004 puts ("-o FILE, --output=FILE\n\
|
|
|
1005 Write the tags to FILE.");
|
|
2225
|
1006 puts ("--parse-stdin=NAME\n\
|
|
|
1007 Read from standard input and record tags as belonging to file NAME.");
|
|
428
|
1008
|
|
|
1009 if (CTAGS)
|
|
|
1010 {
|
|
|
1011 puts ("-t, --typedefs\n\
|
|
|
1012 Generate tag entries for C and Ada typedefs.");
|
|
|
1013 puts ("-T, --typedefs-and-c++\n\
|
|
|
1014 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
|
|
|
1015 and C++ member functions.");
|
|
2225
|
1016 }
|
|
|
1017
|
|
|
1018 if (CTAGS)
|
|
|
1019 puts ("-u, --update\n\
|
|
428
|
1020 Update the tag entries for the given files, leaving tag\n\
|
|
|
1021 entries for other files in place. Currently, this is\n\
|
|
|
1022 implemented by deleting the existing entries for the given\n\
|
|
|
1023 files and then rewriting the new entries at the end of the\n\
|
|
|
1024 tags file. It is often faster to simply rebuild the entire\n\
|
|
|
1025 tag file than to use this.");
|
|
2225
|
1026
|
|
|
1027 if (CTAGS)
|
|
|
1028 {
|
|
428
|
1029 puts ("-v, --vgrind\n\
|
|
3090
|
1030 Print on the standard output an index of items intended for\n\
|
|
|
1031 human consumption, similar to the output of vgrind. The index\n\
|
|
|
1032 is sorted, and gives the page number of each item.");
|
|
3972
|
1033 # if PRINT_UNDOCUMENTED_OPTIONS_HELP
|
|
3876
|
1034 puts ("-w, --no-duplicates\n\
|
|
|
1035 Do not create duplicate tag entries, for compatibility with\n\
|
|
|
1036 traditional ctags.");
|
|
428
|
1037 puts ("-w, --no-warn\n\
|
|
3876
|
1038 Suppress warning messages about duplicate tag entries.");
|
|
|
1039 # endif /* PRINT_UNDOCUMENTED_OPTIONS_HELP */
|
|
428
|
1040 puts ("-x, --cxref\n\
|
|
|
1041 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
|
|
|
1042 The output uses line numbers instead of page numbers, but\n\
|
|
|
1043 beyond that the differences are cosmetic; try both to see\n\
|
|
|
1044 which you like.");
|
|
|
1045 }
|
|
|
1046
|
|
|
1047 puts ("-V, --version\n\
|
|
|
1048 Print the version of the program.\n\
|
|
|
1049 -h, --help\n\
|
|
2225
|
1050 Print this help message.\n\
|
|
|
1051 Followed by one or more `--language' options prints detailed\n\
|
|
|
1052 help about tag generation for the specified languages.");
|
|
428
|
1053
|
|
|
1054 print_language_names ();
|
|
|
1055
|
|
|
1056 puts ("");
|
|
|
1057 puts ("Report bugs to bug-gnu-emacs@gnu.org");
|
|
|
1058
|
|
2225
|
1059 exit (EXIT_SUCCESS);
|
|
428
|
1060 }
|
|
|
1061
|
|
|
1062
|
|
|
1063 #ifdef VMS /* VMS specific functions */
|
|
|
1064
|
|
|
1065 #define EOS '\0'
|
|
|
1066
|
|
|
1067 /* This is a BUG! ANY arbitrary limit is a BUG!
|
|
|
1068 Won't someone please fix this? */
|
|
|
1069 #define MAX_FILE_SPEC_LEN 255
|
|
|
1070 typedef struct {
|
|
|
1071 short curlen;
|
|
|
1072 char body[MAX_FILE_SPEC_LEN + 1];
|
|
|
1073 } vspec;
|
|
|
1074
|
|
|
1075 /*
|
|
|
1076 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
|
|
|
1077 returning in each successive call the next file name matching the input
|
|
|
1078 spec. The function expects that each in_spec passed
|
|
|
1079 to it will be processed to completion; in particular, up to and
|
|
|
1080 including the call following that in which the last matching name
|
|
|
1081 is returned, the function ignores the value of in_spec, and will
|
|
|
1082 only start processing a new spec with the following call.
|
|
|
1083 If an error occurs, on return out_spec contains the value
|
|
|
1084 of in_spec when the error occurred.
|
|
|
1085
|
|
|
1086 With each successive file name returned in out_spec, the
|
|
|
1087 function's return value is one. When there are no more matching
|
|
|
1088 names the function returns zero. If on the first call no file
|
|
|
1089 matches in_spec, or there is any other error, -1 is returned.
|
|
|
1090 */
|
|
|
1091
|
|
|
1092 #include <rmsdef.h>
|
|
|
1093 #include <descrip.h>
|
|
|
1094 #define OUTSIZE MAX_FILE_SPEC_LEN
|
|
442
|
1095 static short
|
|
428
|
1096 fn_exp (out, in)
|
|
|
1097 vspec *out;
|
|
|
1098 char *in;
|
|
|
1099 {
|
|
|
1100 static long context = 0;
|
|
|
1101 static struct dsc$descriptor_s o;
|
|
|
1102 static struct dsc$descriptor_s i;
|
|
|
1103 static bool pass1 = TRUE;
|
|
|
1104 long status;
|
|
|
1105 short retval;
|
|
|
1106
|
|
|
1107 if (pass1)
|
|
|
1108 {
|
|
|
1109 pass1 = FALSE;
|
|
|
1110 o.dsc$a_pointer = (char *) out;
|
|
|
1111 o.dsc$w_length = (short)OUTSIZE;
|
|
|
1112 i.dsc$a_pointer = in;
|
|
|
1113 i.dsc$w_length = (short)strlen(in);
|
|
|
1114 i.dsc$b_dtype = DSC$K_DTYPE_T;
|
|
|
1115 i.dsc$b_class = DSC$K_CLASS_S;
|
|
|
1116 o.dsc$b_dtype = DSC$K_DTYPE_VT;
|
|
|
1117 o.dsc$b_class = DSC$K_CLASS_VS;
|
|
|
1118 }
|
|
|
1119 if ((status = lib$find_file(&i, &o, &context, 0, 0)) == RMS$_NORMAL)
|
|
|
1120 {
|
|
|
1121 out->body[out->curlen] = EOS;
|
|
|
1122 return 1;
|
|
|
1123 }
|
|
|
1124 else if (status == RMS$_NMF)
|
|
|
1125 retval = 0;
|
|
|
1126 else
|
|
|
1127 {
|
|
|
1128 strcpy(out->body, in);
|
|
|
1129 retval = -1;
|
|
|
1130 }
|
|
|
1131 lib$find_file_end(&context);
|
|
|
1132 pass1 = TRUE;
|
|
|
1133 return retval;
|
|
|
1134 }
|
|
|
1135
|
|
|
1136 /*
|
|
|
1137 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
|
|
|
1138 name of each file specified by the provided arg expanding wildcards.
|
|
|
1139 */
|
|
442
|
1140 static char *
|
|
428
|
1141 gfnames (arg, p_error)
|
|
|
1142 char *arg;
|
|
|
1143 bool *p_error;
|
|
|
1144 {
|
|
|
1145 static vspec filename = {MAX_FILE_SPEC_LEN, "\0"};
|
|
|
1146
|
|
|
1147 switch (fn_exp (&filename, arg))
|
|
|
1148 {
|
|
|
1149 case 1:
|
|
|
1150 *p_error = FALSE;
|
|
|
1151 return filename.body;
|
|
|
1152 case 0:
|
|
|
1153 *p_error = FALSE;
|
|
|
1154 return NULL;
|
|
|
1155 default:
|
|
|
1156 *p_error = TRUE;
|
|
|
1157 return filename.body;
|
|
|
1158 }
|
|
|
1159 }
|
|
|
1160
|
|
|
1161 #ifndef OLD /* Newer versions of VMS do provide `system'. */
|
|
|
1162 system (cmd)
|
|
|
1163 char *cmd;
|
|
|
1164 {
|
|
|
1165 error ("%s", "system() function not implemented under VMS");
|
|
|
1166 }
|
|
|
1167 #endif
|
|
|
1168
|
|
|
1169 #define VERSION_DELIM ';'
|
|
|
1170 char *massage_name (s)
|
|
|
1171 char *s;
|
|
|
1172 {
|
|
|
1173 char *start = s;
|
|
|
1174
|
|
|
1175 for ( ; *s; s++)
|
|
|
1176 if (*s == VERSION_DELIM)
|
|
|
1177 {
|
|
|
1178 *s = EOS;
|
|
|
1179 break;
|
|
|
1180 }
|
|
|
1181 else
|
|
|
1182 *s = lowcase (*s);
|
|
|
1183 return start;
|
|
|
1184 }
|
|
|
1185 #endif /* VMS */
|
|
|
1186
|
|
|
1187
|
|
|
1188 int
|
|
|
1189 main (argc, argv)
|
|
|
1190 int argc;
|
|
|
1191 char *argv[];
|
|
|
1192 {
|
|
|
1193 int i;
|
|
|
1194 unsigned int nincluded_files;
|
|
|
1195 char **included_files;
|
|
|
1196 argument *argbuffer;
|
|
|
1197 int current_arg, file_count;
|
|
|
1198 linebuffer filename_lb;
|
|
2225
|
1199 bool help_asked = FALSE;
|
|
428
|
1200 #ifdef VMS
|
|
|
1201 bool got_err;
|
|
|
1202 #endif
|
|
2225
|
1203 char *optstring;
|
|
|
1204 int opt;
|
|
|
1205
|
|
428
|
1206
|
|
458
|
1207 #ifdef DOS_NT
|
|
428
|
1208 _fmode = O_BINARY; /* all of files are treated as binary files */
|
|
458
|
1209 #endif /* DOS_NT */
|
|
428
|
1210
|
|
|
1211 progname = argv[0];
|
|
|
1212 nincluded_files = 0;
|
|
|
1213 included_files = xnew (argc, char *);
|
|
|
1214 current_arg = 0;
|
|
|
1215 file_count = 0;
|
|
|
1216
|
|
|
1217 /* Allocate enough no matter what happens. Overkill, but each one
|
|
|
1218 is small. */
|
|
|
1219 argbuffer = xnew (argc, argument);
|
|
|
1220
|
|
|
1221 /*
|
|
|
1222 * If etags, always find typedefs and structure tags. Why not?
|
|
3972
|
1223 * Also default to find macro constants, enum constants, struct
|
|
|
1224 * members and global variables.
|
|
428
|
1225 */
|
|
|
1226 if (!CTAGS)
|
|
|
1227 {
|
|
458
|
1228 typedefs = typedefs_or_cplusplus = constantypedefs = TRUE;
|
|
3972
|
1229 globals = members = TRUE;
|
|
428
|
1230 }
|
|
|
1231
|
|
2554
|
1232 /* When the optstring begins with a '-' getopt_long does not rearrange the
|
|
|
1233 non-options arguments to be at the end, but leaves them alone. */
|
|
3517
|
1234 optstring = concat (NO_LONG_OPTIONS ? "" : "-",
|
|
|
1235 "ac:Cf:Il:o:r:RSVhH",
|
|
3090
|
1236 (CTAGS) ? "BxdtTuvw" : "Di:");
|
|
|
1237
|
|
|
1238 while ((opt = getopt_long (argc, argv, optstring, longopts, NULL)) != EOF)
|
|
2225
|
1239 switch (opt)
|
|
|
1240 {
|
|
|
1241 case 0:
|
|
|
1242 /* If getopt returns 0, then it has already processed a
|
|
|
1243 long-named option. We should do nothing. */
|
|
428
|
1244 break;
|
|
|
1245
|
|
2225
|
1246 case 1:
|
|
|
1247 /* This means that a file name has been seen. Record it. */
|
|
|
1248 argbuffer[current_arg].arg_type = at_filename;
|
|
|
1249 argbuffer[current_arg].what = optarg;
|
|
|
1250 ++current_arg;
|
|
|
1251 ++file_count;
|
|
|
1252 break;
|
|
|
1253
|
|
|
1254 case STDIN:
|
|
|
1255 /* Parse standard input. Idea by Vivek <vivek@etla.org>. */
|
|
|
1256 argbuffer[current_arg].arg_type = at_stdin;
|
|
|
1257 argbuffer[current_arg].what = optarg;
|
|
|
1258 ++current_arg;
|
|
|
1259 ++file_count;
|
|
|
1260 if (parsing_stdin)
|
|
|
1261 fatal ("cannot parse standard input more than once", (char *)NULL);
|
|
|
1262 parsing_stdin = TRUE;
|
|
|
1263 break;
|
|
|
1264
|
|
|
1265 /* Common options. */
|
|
3090
|
1266 case 'a': append_to_tagfile = TRUE; break;
|
|
2225
|
1267 case 'C': cplusplus = TRUE; break;
|
|
|
1268 case 'f': /* for compatibility with old makefiles */
|
|
|
1269 case 'o':
|
|
|
1270 if (tagfile)
|
|
428
|
1271 {
|
|
2225
|
1272 error ("-o option may only be given once.", (char *)NULL);
|
|
|
1273 suggest_asking_for_help ();
|
|
|
1274 /* NOTREACHED */
|
|
428
|
1275 }
|
|
2225
|
1276 tagfile = optarg;
|
|
|
1277 break;
|
|
|
1278 case 'I':
|
|
|
1279 case 'S': /* for backward compatibility */
|
|
|
1280 ignoreindent = TRUE;
|
|
|
1281 break;
|
|
|
1282 case 'l':
|
|
|
1283 {
|
|
|
1284 language *lang = get_language_from_langname (optarg);
|
|
|
1285 if (lang != NULL)
|
|
|
1286 {
|
|
|
1287 argbuffer[current_arg].lang = lang;
|
|
|
1288 argbuffer[current_arg].arg_type = at_language;
|
|
|
1289 ++current_arg;
|
|
|
1290 }
|
|
428
|
1291 }
|
|
2225
|
1292 break;
|
|
|
1293 case 'c':
|
|
|
1294 /* Backward compatibility: support obsolete --ignore-case-regexp. */
|
|
|
1295 optarg = concat (optarg, "i", ""); /* memory leak here */
|
|
|
1296 /* FALLTHRU */
|
|
|
1297 case 'r':
|
|
|
1298 argbuffer[current_arg].arg_type = at_regexp;
|
|
|
1299 argbuffer[current_arg].what = optarg;
|
|
|
1300 ++current_arg;
|
|
|
1301 break;
|
|
|
1302 case 'R':
|
|
|
1303 argbuffer[current_arg].arg_type = at_regexp;
|
|
|
1304 argbuffer[current_arg].what = NULL;
|
|
|
1305 ++current_arg;
|
|
|
1306 break;
|
|
|
1307 case 'V':
|
|
|
1308 print_version ();
|
|
|
1309 break;
|
|
|
1310 case 'h':
|
|
|
1311 case 'H':
|
|
|
1312 help_asked = TRUE;
|
|
|
1313 break;
|
|
|
1314
|
|
|
1315 /* Etags options */
|
|
|
1316 case 'D': constantypedefs = FALSE; break;
|
|
|
1317 case 'i': included_files[nincluded_files++] = optarg; break;
|
|
|
1318
|
|
|
1319 /* Ctags options. */
|
|
|
1320 case 'B': searchar = '?'; break;
|
|
|
1321 case 'd': constantypedefs = TRUE; break;
|
|
|
1322 case 't': typedefs = TRUE; break;
|
|
|
1323 case 'T': typedefs = typedefs_or_cplusplus = TRUE; break;
|
|
|
1324 case 'u': update = TRUE; break;
|
|
|
1325 case 'v': vgrind_style = TRUE; /*FALLTHRU*/
|
|
|
1326 case 'x': cxref_style = TRUE; break;
|
|
|
1327 case 'w': no_warnings = TRUE; break;
|
|
|
1328 default:
|
|
|
1329 suggest_asking_for_help ();
|
|
|
1330 /* NOTREACHED */
|
|
|
1331 }
|
|
|
1332
|
|
2554
|
1333 /* No more options. Store the rest of arguments. */
|
|
2225
|
1334 for (; optind < argc; optind++)
|
|
428
|
1335 {
|
|
|
1336 argbuffer[current_arg].arg_type = at_filename;
|
|
|
1337 argbuffer[current_arg].what = argv[optind];
|
|
|
1338 ++current_arg;
|
|
|
1339 ++file_count;
|
|
|
1340 }
|
|
|
1341
|
|
2225
|
1342 argbuffer[current_arg].arg_type = at_end;
|
|
|
1343
|
|
|
1344 if (help_asked)
|
|
|
1345 print_help (argbuffer);
|
|
|
1346 /* NOTREACHED */
|
|
|
1347
|
|
428
|
1348 if (nincluded_files == 0 && file_count == 0)
|
|
|
1349 {
|
|
|
1350 error ("no input files specified.", (char *)NULL);
|
|
|
1351 suggest_asking_for_help ();
|
|
2225
|
1352 /* NOTREACHED */
|
|
428
|
1353 }
|
|
|
1354
|
|
|
1355 if (tagfile == NULL)
|
|
|
1356 tagfile = CTAGS ? "tags" : "TAGS";
|
|
|
1357 cwd = etags_getcwd (); /* the current working directory */
|
|
|
1358 if (cwd[strlen (cwd) - 1] != '/')
|
|
|
1359 {
|
|
|
1360 char *oldcwd = cwd;
|
|
|
1361 cwd = concat (oldcwd, "/", "");
|
|
|
1362 free (oldcwd);
|
|
|
1363 }
|
|
2325
|
1364 /* Relative file names are made relative to the current directory. */
|
|
|
1365 if (streq (tagfile, "-")
|
|
|
1366 || strneq (tagfile, "/dev/", 5))
|
|
428
|
1367 tagfiledir = cwd;
|
|
|
1368 else
|
|
|
1369 tagfiledir = absolute_dirname (tagfile, cwd);
|
|
|
1370
|
|
|
1371 init (); /* set up boolean "functions" */
|
|
|
1372
|
|
2225
|
1373 linebuffer_init (&lb);
|
|
|
1374 linebuffer_init (&filename_lb);
|
|
|
1375 linebuffer_init (&filebuf);
|
|
|
1376 linebuffer_init (&token_name);
|
|
428
|
1377
|
|
|
1378 if (!CTAGS)
|
|
|
1379 {
|
|
|
1380 if (streq (tagfile, "-"))
|
|
|
1381 {
|
|
|
1382 tagf = stdout;
|
|
458
|
1383 #ifdef DOS_NT
|
|
428
|
1384 /* Switch redirected `stdout' to binary mode (setting `_fmode'
|
|
|
1385 doesn't take effect until after `stdout' is already open). */
|
|
|
1386 if (!isatty (fileno (stdout)))
|
|
|
1387 setmode (fileno (stdout), O_BINARY);
|
|
458
|
1388 #endif /* DOS_NT */
|
|
428
|
1389 }
|
|
|
1390 else
|
|
|
1391 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
|
|
|
1392 if (tagf == NULL)
|
|
|
1393 pfatal (tagfile);
|
|
|
1394 }
|
|
|
1395
|
|
|
1396 /*
|
|
|
1397 * Loop through files finding functions.
|
|
|
1398 */
|
|
2225
|
1399 for (i = 0; i < current_arg; i++)
|
|
428
|
1400 {
|
|
2225
|
1401 static language *lang; /* non-NULL if language is forced */
|
|
|
1402 char *this_file;
|
|
|
1403
|
|
428
|
1404 switch (argbuffer[i].arg_type)
|
|
|
1405 {
|
|
|
1406 case at_language:
|
|
2225
|
1407 lang = argbuffer[i].lang;
|
|
428
|
1408 break;
|
|
|
1409 case at_regexp:
|
|
2225
|
1410 analyse_regex (argbuffer[i].what);
|
|
428
|
1411 break;
|
|
|
1412 case at_filename:
|
|
|
1413 #ifdef VMS
|
|
|
1414 while ((this_file = gfnames (argbuffer[i].what, &got_err)) != NULL)
|
|
|
1415 {
|
|
|
1416 if (got_err)
|
|
|
1417 {
|
|
|
1418 error ("can't find file %s\n", this_file);
|
|
|
1419 argc--, argv++;
|
|
|
1420 }
|
|
|
1421 else
|
|
|
1422 {
|
|
|
1423 this_file = massage_name (this_file);
|
|
|
1424 }
|
|
|
1425 #else
|
|
|
1426 this_file = argbuffer[i].what;
|
|
|
1427 #endif
|
|
|
1428 /* Input file named "-" means read file names from stdin
|
|
|
1429 (one per line) and use them. */
|
|
|
1430 if (streq (this_file, "-"))
|
|
2225
|
1431 {
|
|
|
1432 if (parsing_stdin)
|
|
|
1433 fatal ("cannot parse standard input AND read file names from it",
|
|
|
1434 (char *)NULL);
|
|
|
1435 while (readline_internal (&filename_lb, stdin) > 0)
|
|
|
1436 process_file_name (filename_lb.buffer, lang);
|
|
|
1437 }
|
|
428
|
1438 else
|
|
2225
|
1439 process_file_name (this_file, lang);
|
|
428
|
1440 #ifdef VMS
|
|
|
1441 }
|
|
|
1442 #endif
|
|
|
1443 break;
|
|
2225
|
1444 case at_stdin:
|
|
|
1445 this_file = argbuffer[i].what;
|
|
|
1446 process_file (stdin, this_file, lang);
|
|
|
1447 break;
|
|
428
|
1448 }
|
|
|
1449 }
|
|
|
1450
|
|
2225
|
1451 free_regexps ();
|
|
|
1452 free (lb.buffer);
|
|
|
1453 free (filebuf.buffer);
|
|
|
1454 free (token_name.buffer);
|
|
|
1455
|
|
|
1456 if (!CTAGS || cxref_style)
|
|
428
|
1457 {
|
|
3090
|
1458 /* Write the remaining tags to tagf (ETAGS) or stdout (CXREF). */
|
|
|
1459 put_entries (nodehead);
|
|
2225
|
1460 free_tree (nodehead);
|
|
|
1461 nodehead = NULL;
|
|
|
1462 if (!CTAGS)
|
|
|
1463 {
|
|
|
1464 fdesc *fdp;
|
|
|
1465
|
|
|
1466 /* Output file entries that have no tags. */
|
|
|
1467 for (fdp = fdhead; fdp != NULL; fdp = fdp->next)
|
|
|
1468 if (!fdp->written)
|
|
|
1469 fprintf (tagf, "\f\n%s,0\n", fdp->taggedfname);
|
|
|
1470
|
|
|
1471 while (nincluded_files-- > 0)
|
|
|
1472 fprintf (tagf, "\f\n%s,include\n", *included_files++);
|
|
3090
|
1473
|
|
|
1474 if (fclose (tagf) == EOF)
|
|
|
1475 pfatal (tagfile);
|
|
2225
|
1476 }
|
|
|
1477
|
|
|
1478 exit (EXIT_SUCCESS);
|
|
428
|
1479 }
|
|
|
1480
|
|
|
1481 if (update)
|
|
|
1482 {
|
|
|
1483 char cmd[BUFSIZ];
|
|
|
1484 for (i = 0; i < current_arg; ++i)
|
|
|
1485 {
|
|
2225
|
1486 switch (argbuffer[i].arg_type)
|
|
|
1487 {
|
|
|
1488 case at_filename:
|
|
|
1489 case at_stdin:
|
|
|
1490 break;
|
|
|
1491 default:
|
|
|
1492 continue; /* the for loop */
|
|
|
1493 }
|
|
428
|
1494 sprintf (cmd,
|
|
|
1495 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
|
|
|
1496 tagfile, argbuffer[i].what, tagfile);
|
|
2225
|
1497 if (system (cmd) != EXIT_SUCCESS)
|
|
428
|
1498 fatal ("failed to execute shell command", (char *)NULL);
|
|
|
1499 }
|
|
|
1500 append_to_tagfile = TRUE;
|
|
|
1501 }
|
|
|
1502
|
|
|
1503 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
|
|
|
1504 if (tagf == NULL)
|
|
|
1505 pfatal (tagfile);
|
|
2225
|
1506 put_entries (nodehead); /* write all the tags (CTAGS) */
|
|
|
1507 free_tree (nodehead);
|
|
|
1508 nodehead = NULL;
|
|
|
1509 if (fclose (tagf) == EOF)
|
|
|
1510 pfatal (tagfile);
|
|
428
|
1511
|
|
3090
|
1512 if (CTAGS)
|
|
|
1513 if (append_to_tagfile || update)
|
|
|
1514 {
|
|
3876
|
1515 char cmd[2*BUFSIZ+20];
|
|
|
1516 /* Maybe these should be used:
|
|
|
1517 setenv ("LC_COLLATE", "C", 1);
|
|
|
1518 setenv ("LC_ALL", "C", 1); */
|
|
|
1519 sprintf (cmd, "sort -u -o %.*s %.*s", BUFSIZ, tagfile, BUFSIZ, tagfile);
|
|
3090
|
1520 exit (system (cmd));
|
|
|
1521 }
|
|
2225
|
1522 return EXIT_SUCCESS;
|
|
428
|
1523 }
|
|
|
1524
|
|
|
1525
|
|
|
1526 /*
|
|
|
1527 * Return a compressor given the file name. If EXTPTR is non-zero,
|
|
|
1528 * return a pointer into FILE where the compressor-specific
|
|
|
1529 * extension begins. If no compressor is found, NULL is returned
|
|
|
1530 * and EXTPTR is not significant.
|
|
458
|
1531 * Idea by Vladimir Alexiev <vladimir@cs.ualberta.ca> (1998)
|
|
428
|
1532 */
|
|
442
|
1533 static compressor *
|
|
428
|
1534 get_compressor_from_suffix (file, extptr)
|
|
|
1535 char *file;
|
|
|
1536 char **extptr;
|
|
|
1537 {
|
|
|
1538 compressor *compr;
|
|
|
1539 char *slash, *suffix;
|
|
|
1540
|
|
|
1541 /* This relies on FN to be after canonicalize_filename,
|
|
458
|
1542 so we don't need to consider backslashes on DOS_NT. */
|
|
428
|
1543 slash = etags_strrchr (file, '/');
|
|
|
1544 suffix = etags_strrchr (file, '.');
|
|
|
1545 if (suffix == NULL || suffix < slash)
|
|
|
1546 return NULL;
|
|
|
1547 if (extptr != NULL)
|
|
|
1548 *extptr = suffix;
|
|
|
1549 suffix += 1;
|
|
|
1550 /* Let those poor souls who live with DOS 8+3 file name limits get
|
|
|
1551 some solace by treating foo.cgz as if it were foo.c.gz, etc.
|
|
458
|
1552 Only the first do loop is run if not MSDOS */
|
|
428
|
1553 do
|
|
|
1554 {
|
|
|
1555 for (compr = compressors; compr->suffix != NULL; compr++)
|
|
|
1556 if (streq (compr->suffix, suffix))
|
|
|
1557 return compr;
|
|
458
|
1558 if (!MSDOS)
|
|
442
|
1559 break; /* do it only once: not really a loop */
|
|
428
|
1560 if (extptr != NULL)
|
|
|
1561 *extptr = ++suffix;
|
|
|
1562 } while (*suffix != '\0');
|
|
|
1563 return NULL;
|
|
|
1564 }
|
|
|
1565
|
|
|
1566
|
|
|
1567
|
|
|
1568 /*
|
|
|
1569 * Return a language given the name.
|
|
|
1570 */
|
|
442
|
1571 static language *
|
|
458
|
1572 get_language_from_langname (name)
|
|
709
|
1573 const char *name;
|
|
428
|
1574 {
|
|
|
1575 language *lang;
|
|
|
1576
|
|
|
1577 if (name == NULL)
|
|
|
1578 error ("empty language name", (char *)NULL);
|
|
|
1579 else
|
|
|
1580 {
|
|
|
1581 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1582 if (streq (name, lang->name))
|
|
|
1583 return lang;
|
|
|
1584 error ("unknown language \"%s\"", name);
|
|
|
1585 }
|
|
|
1586
|
|
|
1587 return NULL;
|
|
|
1588 }
|
|
|
1589
|
|
|
1590
|
|
|
1591 /*
|
|
|
1592 * Return a language given the interpreter name.
|
|
|
1593 */
|
|
442
|
1594 static language *
|
|
428
|
1595 get_language_from_interpreter (interpreter)
|
|
|
1596 char *interpreter;
|
|
|
1597 {
|
|
|
1598 language *lang;
|
|
|
1599 char **iname;
|
|
|
1600
|
|
|
1601 if (interpreter == NULL)
|
|
|
1602 return NULL;
|
|
|
1603 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1604 if (lang->interpreters != NULL)
|
|
|
1605 for (iname = lang->interpreters; *iname != NULL; iname++)
|
|
|
1606 if (streq (*iname, interpreter))
|
|
|
1607 return lang;
|
|
|
1608
|
|
|
1609 return NULL;
|
|
|
1610 }
|
|
|
1611
|
|
|
1612
|
|
|
1613
|
|
|
1614 /*
|
|
|
1615 * Return a language given the file name.
|
|
|
1616 */
|
|
442
|
1617 static language *
|
|
2225
|
1618 get_language_from_filename (file, case_sensitive)
|
|
428
|
1619 char *file;
|
|
2225
|
1620 bool case_sensitive;
|
|
428
|
1621 {
|
|
|
1622 language *lang;
|
|
458
|
1623 char **name, **ext, *suffix;
|
|
|
1624
|
|
|
1625 /* Try whole file name first. */
|
|
|
1626 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1627 if (lang->filenames != NULL)
|
|
|
1628 for (name = lang->filenames; *name != NULL; name++)
|
|
2225
|
1629 if ((case_sensitive)
|
|
|
1630 ? streq (*name, file)
|
|
|
1631 : strcaseeq (*name, file))
|
|
458
|
1632 return lang;
|
|
|
1633
|
|
|
1634 /* If not found, try suffix after last dot. */
|
|
428
|
1635 suffix = etags_strrchr (file, '.');
|
|
|
1636 if (suffix == NULL)
|
|
|
1637 return NULL;
|
|
|
1638 suffix += 1;
|
|
|
1639 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1640 if (lang->suffixes != NULL)
|
|
|
1641 for (ext = lang->suffixes; *ext != NULL; ext++)
|
|
2225
|
1642 if ((case_sensitive)
|
|
|
1643 ? streq (*ext, suffix)
|
|
|
1644 : strcaseeq (*ext, suffix))
|
|
428
|
1645 return lang;
|
|
|
1646 return NULL;
|
|
|
1647 }
|
|
|
1648
|
|
2225
|
1649
|
|
428
|
1650 /*
|
|
|
1651 * This routine is called on each file argument.
|
|
|
1652 */
|
|
442
|
1653 static void
|
|
2225
|
1654 process_file_name (file, lang)
|
|
428
|
1655 char *file;
|
|
2225
|
1656 language *lang;
|
|
428
|
1657 {
|
|
|
1658 struct stat stat_buf;
|
|
|
1659 FILE *inf;
|
|
2225
|
1660 fdesc *fdp;
|
|
428
|
1661 compressor *compr;
|
|
|
1662 char *compressed_name, *uncompressed_name;
|
|
|
1663 char *ext, *real_name;
|
|
2225
|
1664 int retval;
|
|
428
|
1665
|
|
|
1666 canonicalize_filename (file);
|
|
|
1667 if (streq (file, tagfile) && !streq (tagfile, "-"))
|
|
|
1668 {
|
|
|
1669 error ("skipping inclusion of %s in self.", file);
|
|
|
1670 return;
|
|
|
1671 }
|
|
|
1672 if ((compr = get_compressor_from_suffix (file, &ext)) == NULL)
|
|
|
1673 {
|
|
|
1674 compressed_name = NULL;
|
|
|
1675 real_name = uncompressed_name = savestr (file);
|
|
|
1676 }
|
|
|
1677 else
|
|
|
1678 {
|
|
|
1679 real_name = compressed_name = savestr (file);
|
|
|
1680 uncompressed_name = savenstr (file, ext - file);
|
|
|
1681 }
|
|
|
1682
|
|
2225
|
1683 /* If the canonicalized uncompressed name
|
|
|
1684 has already been dealt with, skip it silently. */
|
|
|
1685 for (fdp = fdhead; fdp != NULL; fdp = fdp->next)
|
|
428
|
1686 {
|
|
2225
|
1687 assert (fdp->infname != NULL);
|
|
|
1688 if (streq (uncompressed_name, fdp->infname))
|
|
|
1689 goto cleanup;
|
|
|
1690 }
|
|
428
|
1691
|
|
|
1692 if (stat (real_name, &stat_buf) != 0)
|
|
|
1693 {
|
|
|
1694 /* Reset real_name and try with a different name. */
|
|
|
1695 real_name = NULL;
|
|
|
1696 if (compressed_name != NULL) /* try with the given suffix */
|
|
|
1697 {
|
|
|
1698 if (stat (uncompressed_name, &stat_buf) == 0)
|
|
|
1699 real_name = uncompressed_name;
|
|
|
1700 }
|
|
|
1701 else /* try all possible suffixes */
|
|
|
1702 {
|
|
|
1703 for (compr = compressors; compr->suffix != NULL; compr++)
|
|
|
1704 {
|
|
|
1705 compressed_name = concat (file, ".", compr->suffix);
|
|
|
1706 if (stat (compressed_name, &stat_buf) != 0)
|
|
|
1707 {
|
|
458
|
1708 if (MSDOS)
|
|
|
1709 {
|
|
|
1710 char *suf = compressed_name + strlen (file);
|
|
|
1711 size_t suflen = strlen (compr->suffix) + 1;
|
|
|
1712 for ( ; suf[1]; suf++, suflen--)
|
|
|
1713 {
|
|
|
1714 memmove (suf, suf + 1, suflen);
|
|
|
1715 if (stat (compressed_name, &stat_buf) == 0)
|
|
|
1716 {
|
|
|
1717 real_name = compressed_name;
|
|
|
1718 break;
|
|
|
1719 }
|
|
|
1720 }
|
|
|
1721 if (real_name != NULL)
|
|
|
1722 break;
|
|
|
1723 } /* MSDOS */
|
|
428
|
1724 free (compressed_name);
|
|
|
1725 compressed_name = NULL;
|
|
|
1726 }
|
|
|
1727 else
|
|
|
1728 {
|
|
|
1729 real_name = compressed_name;
|
|
|
1730 break;
|
|
|
1731 }
|
|
|
1732 }
|
|
|
1733 }
|
|
|
1734 if (real_name == NULL)
|
|
|
1735 {
|
|
|
1736 perror (file);
|
|
2225
|
1737 goto cleanup;
|
|
428
|
1738 }
|
|
|
1739 } /* try with a different name */
|
|
|
1740
|
|
|
1741 if (!S_ISREG (stat_buf.st_mode))
|
|
|
1742 {
|
|
|
1743 error ("skipping %s: it is not a regular file.", real_name);
|
|
2225
|
1744 goto cleanup;
|
|
428
|
1745 }
|
|
|
1746 if (real_name == compressed_name)
|
|
|
1747 {
|
|
|
1748 char *cmd = concat (compr->command, " ", real_name);
|
|
458
|
1749 inf = (FILE *) popen (cmd, "r");
|
|
428
|
1750 free (cmd);
|
|
|
1751 }
|
|
|
1752 else
|
|
|
1753 inf = fopen (real_name, "r");
|
|
|
1754 if (inf == NULL)
|
|
|
1755 {
|
|
|
1756 perror (real_name);
|
|
2225
|
1757 goto cleanup;
|
|
428
|
1758 }
|
|
|
1759
|
|
2225
|
1760 process_file (inf, uncompressed_name, lang);
|
|
428
|
1761
|
|
|
1762 if (real_name == compressed_name)
|
|
2225
|
1763 retval = pclose (inf);
|
|
428
|
1764 else
|
|
2225
|
1765 retval = fclose (inf);
|
|
|
1766 if (retval < 0)
|
|
|
1767 pfatal (file);
|
|
|
1768
|
|
|
1769 cleanup:
|
|
|
1770 if (compressed_name) free (compressed_name);
|
|
|
1771 if (uncompressed_name) free (uncompressed_name);
|
|
|
1772 last_node = NULL;
|
|
|
1773 curfdp = NULL;
|
|
|
1774 return;
|
|
|
1775 }
|
|
|
1776
|
|
|
1777 static void
|
|
|
1778 process_file (fh, fn, lang)
|
|
|
1779 FILE *fh;
|
|
|
1780 char *fn;
|
|
|
1781 language *lang;
|
|
|
1782 {
|
|
|
1783 static const fdesc emptyfdesc;
|
|
|
1784 fdesc *fdp;
|
|
|
1785
|
|
|
1786 /* Create a new input file description entry. */
|
|
|
1787 fdp = xnew (1, fdesc);
|
|
|
1788 *fdp = emptyfdesc;
|
|
|
1789 fdp->next = fdhead;
|
|
|
1790 fdp->infname = savestr (fn);
|
|
|
1791 fdp->lang = lang;
|
|
|
1792 fdp->infabsname = absolute_filename (fn, cwd);
|
|
|
1793 fdp->infabsdir = absolute_dirname (fn, cwd);
|
|
|
1794 if (filename_is_absolute (fn))
|
|
428
|
1795 {
|
|
2225
|
1796 /* An absolute file name. Canonicalize it. */
|
|
|
1797 fdp->taggedfname = absolute_filename (fn, NULL);
|
|
|
1798 }
|
|
|
1799 else
|
|
|
1800 {
|
|
|
1801 /* A file name relative to cwd. Make it relative
|
|
|
1802 to the directory of the tags file. */
|
|
|
1803 fdp->taggedfname = relative_filename (fn, tagfiledir);
|
|
|
1804 }
|
|
|
1805 fdp->usecharno = TRUE; /* use char position when making tags */
|
|
|
1806 fdp->prop = NULL;
|
|
|
1807 fdp->written = FALSE; /* not written on tags file yet */
|
|
|
1808
|
|
|
1809 fdhead = fdp;
|
|
|
1810 curfdp = fdhead; /* the current file description */
|
|
|
1811
|
|
|
1812 find_entries (fh);
|
|
|
1813
|
|
|
1814 /* If not Ctags, and if this is not metasource and if it contained no #line
|
|
|
1815 directives, we can write the tags and free all nodes pointing to
|
|
|
1816 curfdp. */
|
|
|
1817 if (!CTAGS
|
|
|
1818 && curfdp->usecharno /* no #line directives in this file */
|
|
|
1819 && !curfdp->lang->metasource)
|
|
|
1820 {
|
|
|
1821 node *np, *prev;
|
|
|
1822
|
|
|
1823 /* Look for the head of the sublist relative to this file. See add_node
|
|
|
1824 for the structure of the node tree. */
|
|
|
1825 prev = NULL;
|
|
|
1826 for (np = nodehead; np != NULL; prev = np, np = np->left)
|
|
|
1827 if (np->fdp == curfdp)
|
|
|
1828 break;
|
|
|
1829
|
|
|
1830 /* If we generated tags for this file, write and delete them. */
|
|
|
1831 if (np != NULL)
|
|
428
|
1832 {
|
|
2225
|
1833 /* This is the head of the last sublist, if any. The following
|
|
|
1834 instructions depend on this being true. */
|
|
|
1835 assert (np->left == NULL);
|
|
|
1836
|
|
|
1837 assert (fdhead == curfdp);
|
|
|
1838 assert (last_node->fdp == curfdp);
|
|
|
1839 put_entries (np); /* write tags for file curfdp->taggedfname */
|
|
|
1840 free_tree (np); /* remove the written nodes */
|
|
|
1841 if (prev == NULL)
|
|
|
1842 nodehead = NULL; /* no nodes left */
|
|
|
1843 else
|
|
|
1844 prev->left = NULL; /* delete the pointer to the sublist */
|
|
428
|
1845 }
|
|
|
1846 }
|
|
|
1847 }
|
|
|
1848
|
|
|
1849 /*
|
|
|
1850 * This routine sets up the boolean pseudo-functions which work
|
|
|
1851 * by setting boolean flags dependent upon the corresponding character.
|
|
|
1852 * Every char which is NOT in that string is not a white char. Therefore,
|
|
|
1853 * all of the array "_wht" is set to FALSE, and then the elements
|
|
|
1854 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
|
|
|
1855 * of a char is TRUE if it is the string "white", else FALSE.
|
|
|
1856 */
|
|
442
|
1857 static void
|
|
428
|
1858 init ()
|
|
|
1859 {
|
|
|
1860 register char *sp;
|
|
|
1861 register int i;
|
|
|
1862
|
|
|
1863 for (i = 0; i < CHARS; i++)
|
|
|
1864 iswhite(i) = notinname(i) = begtoken(i) = intoken(i) = endtoken(i) = FALSE;
|
|
|
1865 for (sp = white; *sp != '\0'; sp++) iswhite (*sp) = TRUE;
|
|
|
1866 for (sp = nonam; *sp != '\0'; sp++) notinname (*sp) = TRUE;
|
|
442
|
1867 notinname('\0') = notinname('\n');
|
|
428
|
1868 for (sp = begtk; *sp != '\0'; sp++) begtoken (*sp) = TRUE;
|
|
442
|
1869 begtoken('\0') = begtoken('\n');
|
|
428
|
1870 for (sp = midtk; *sp != '\0'; sp++) intoken (*sp) = TRUE;
|
|
442
|
1871 intoken('\0') = intoken('\n');
|
|
428
|
1872 for (sp = endtk; *sp != '\0'; sp++) endtoken (*sp) = TRUE;
|
|
|
1873 endtoken('\0') = endtoken('\n');
|
|
|
1874 }
|
|
|
1875
|
|
|
1876 /*
|
|
|
1877 * This routine opens the specified file and calls the function
|
|
|
1878 * which finds the function and type definitions.
|
|
|
1879 */
|
|
442
|
1880 static void
|
|
2225
|
1881 find_entries (inf)
|
|
428
|
1882 FILE *inf;
|
|
|
1883 {
|
|
|
1884 char *cp;
|
|
2225
|
1885 language *lang = curfdp->lang;
|
|
|
1886 Lang_function *parser = NULL;
|
|
428
|
1887
|
|
|
1888 /* If user specified a language, use it. */
|
|
|
1889 if (lang != NULL && lang->function != NULL)
|
|
|
1890 {
|
|
2225
|
1891 parser = lang->function;
|
|
428
|
1892 }
|
|
|
1893
|
|
2225
|
1894 /* Else try to guess the language given the file name. */
|
|
|
1895 if (parser == NULL)
|
|
428
|
1896 {
|
|
2225
|
1897 lang = get_language_from_filename (curfdp->infname, TRUE);
|
|
|
1898 if (lang != NULL && lang->function != NULL)
|
|
|
1899 {
|
|
|
1900 curfdp->lang = lang;
|
|
|
1901 parser = lang->function;
|
|
|
1902 }
|
|
428
|
1903 }
|
|
|
1904
|
|
2225
|
1905 /* Else look for sharp-bang as the first two characters. */
|
|
|
1906 if (parser == NULL
|
|
|
1907 && readline_internal (&lb, inf) > 0
|
|
428
|
1908 && lb.len >= 2
|
|
|
1909 && lb.buffer[0] == '#'
|
|
|
1910 && lb.buffer[1] == '!')
|
|
|
1911 {
|
|
|
1912 char *lp;
|
|
|
1913
|
|
|
1914 /* Set lp to point at the first char after the last slash in the
|
|
|
1915 line or, if no slashes, at the first nonblank. Then set cp to
|
|
|
1916 the first successive blank and terminate the string. */
|
|
|
1917 lp = etags_strrchr (lb.buffer+2, '/');
|
|
|
1918 if (lp != NULL)
|
|
|
1919 lp += 1;
|
|
|
1920 else
|
|
|
1921 lp = skip_spaces (lb.buffer + 2);
|
|
|
1922 cp = skip_non_spaces (lp);
|
|
|
1923 *cp = '\0';
|
|
|
1924
|
|
|
1925 if (strlen (lp) > 0)
|
|
|
1926 {
|
|
|
1927 lang = get_language_from_interpreter (lp);
|
|
|
1928 if (lang != NULL && lang->function != NULL)
|
|
|
1929 {
|
|
2225
|
1930 curfdp->lang = lang;
|
|
|
1931 parser = lang->function;
|
|
428
|
1932 }
|
|
|
1933 }
|
|
|
1934 }
|
|
2225
|
1935
|
|
428
|
1936 /* We rewind here, even if inf may be a pipe. We fail if the
|
|
|
1937 length of the first line is longer than the pipe block size,
|
|
|
1938 which is unlikely. */
|
|
|
1939 rewind (inf);
|
|
|
1940
|
|
2225
|
1941 /* Else try to guess the language given the case insensitive file name. */
|
|
|
1942 if (parser == NULL)
|
|
|
1943 {
|
|
|
1944 lang = get_language_from_filename (curfdp->infname, FALSE);
|
|
|
1945 if (lang != NULL && lang->function != NULL)
|
|
|
1946 {
|
|
|
1947 curfdp->lang = lang;
|
|
|
1948 parser = lang->function;
|
|
|
1949 }
|
|
|
1950 }
|
|
|
1951
|
|
|
1952 /* Else try Fortran or C. */
|
|
|
1953 if (parser == NULL)
|
|
428
|
1954 {
|
|
2225
|
1955 node *old_last_node = last_node;
|
|
|
1956
|
|
|
1957 curfdp->lang = get_language_from_langname ("fortran");
|
|
|
1958 find_entries (inf);
|
|
|
1959
|
|
|
1960 if (old_last_node == last_node)
|
|
|
1961 /* No Fortran entries found. Try C. */
|
|
|
1962 {
|
|
|
1963 /* We do not tag if rewind fails.
|
|
|
1964 Only the file name will be recorded in the tags file. */
|
|
|
1965 rewind (inf);
|
|
|
1966 curfdp->lang = get_language_from_langname (cplusplus ? "c++" : "c");
|
|
|
1967 find_entries (inf);
|
|
|
1968 }
|
|
|
1969 return;
|
|
428
|
1970 }
|
|
2225
|
1971
|
|
|
1972 if (!no_line_directive
|
|
|
1973 && curfdp->lang != NULL && curfdp->lang->metasource)
|
|
|
1974 /* It may be that this is a bingo.y file, and we already parsed a bingo.c
|
|
|
1975 file, or anyway we parsed a file that is automatically generated from
|
|
|
1976 this one. If this is the case, the bingo.c file contained #line
|
|
|
1977 directives that generated tags pointing to this file. Let's delete
|
|
|
1978 them all before parsing this file, which is the real source. */
|
|
|
1979 {
|
|
|
1980 fdesc **fdpp = &fdhead;
|
|
|
1981 while (*fdpp != NULL)
|
|
|
1982 if (*fdpp != curfdp
|
|
|
1983 && streq ((*fdpp)->taggedfname, curfdp->taggedfname))
|
|
|
1984 /* We found one of those! We must delete both the file description
|
|
|
1985 and all tags referring to it. */
|
|
|
1986 {
|
|
|
1987 fdesc *badfdp = *fdpp;
|
|
|
1988
|
|
|
1989 /* Delete the tags referring to badfdp->taggedfname
|
|
|
1990 that were obtained from badfdp->infname. */
|
|
|
1991 invalidate_nodes (badfdp, &nodehead);
|
|
|
1992
|
|
|
1993 *fdpp = badfdp->next; /* remove the bad description from the list */
|
|
|
1994 free_fdesc (badfdp);
|
|
|
1995 }
|
|
|
1996 else
|
|
|
1997 fdpp = &(*fdpp)->next; /* advance the list pointer */
|
|
|
1998 }
|
|
|
1999
|
|
|
2000 assert (parser != NULL);
|
|
|
2001
|
|
|
2002 /* Generic initialisations before reading from file. */
|
|
|
2003 linebuffer_setlen (&filebuf, 0); /* reset the file buffer */
|
|
|
2004
|
|
|
2005 /* Generic initialisations before parsing file with readline. */
|
|
|
2006 lineno = 0; /* reset global line number */
|
|
|
2007 charno = 0; /* reset global char number */
|
|
|
2008 linecharno = 0; /* reset global char number of line start */
|
|
|
2009
|
|
|
2010 parser (inf);
|
|
|
2011
|
|
|
2012 regex_tag_multiline ();
|
|
428
|
2013 }
|
|
458
|
2014
|
|
428
|
2015
|
|
2225
|
2016 /*
|
|
|
2017 * Check whether an implicitly named tag should be created,
|
|
|
2018 * then call `pfnote'.
|
|
|
2019 * NAME is a string that is internally copied by this function.
|
|
|
2020 *
|
|
|
2021 * TAGS format specification
|
|
|
2022 * Idea by Sam Kendall <kendall@mv.mv.com> (1997)
|
|
|
2023 * The following is explained in some more detail in etc/ETAGS.EBNF.
|
|
|
2024 *
|
|
|
2025 * make_tag creates tags with "implicit tag names" (unnamed tags)
|
|
|
2026 * if the following are all true, assuming NONAM=" \f\t\n\r()=,;":
|
|
|
2027 * 1. NAME does not contain any of the characters in NONAM;
|
|
|
2028 * 2. LINESTART contains name as either a rightmost, or rightmost but
|
|
|
2029 * one character, substring;
|
|
|
2030 * 3. the character, if any, immediately before NAME in LINESTART must
|
|
|
2031 * be a character in NONAM;
|
|
|
2032 * 4. the character, if any, immediately after NAME in LINESTART must
|
|
|
2033 * also be a character in NONAM.
|
|
|
2034 *
|
|
|
2035 * The implementation uses the notinname() macro, which recognises the
|
|
|
2036 * characters stored in the string `nonam'.
|
|
|
2037 * etags.el needs to use the same characters that are in NONAM.
|
|
|
2038 */
|
|
|
2039 static void
|
|
|
2040 make_tag (name, namelen, is_func, linestart, linelen, lno, cno)
|
|
|
2041 char *name; /* tag name, or NULL if unnamed */
|
|
|
2042 int namelen; /* tag length */
|
|
|
2043 bool is_func; /* tag is a function */
|
|
|
2044 char *linestart; /* start of the line where tag is */
|
|
|
2045 int linelen; /* length of the line where tag is */
|
|
|
2046 int lno; /* line number */
|
|
|
2047 long cno; /* character number */
|
|
|
2048 {
|
|
|
2049 bool named = (name != NULL && namelen > 0);
|
|
|
2050
|
|
|
2051 if (!CTAGS && named) /* maybe set named to false */
|
|
|
2052 /* Let's try to make an implicit tag name, that is, create an unnamed tag
|
|
|
2053 such that etags.el can guess a name from it. */
|
|
|
2054 {
|
|
|
2055 int i;
|
|
|
2056 register char *cp = name;
|
|
|
2057
|
|
|
2058 for (i = 0; i < namelen; i++)
|
|
|
2059 if (notinname (*cp++))
|
|
|
2060 break;
|
|
|
2061 if (i == namelen) /* rule #1 */
|
|
|
2062 {
|
|
|
2063 cp = linestart + linelen - namelen;
|
|
|
2064 if (notinname (linestart[linelen-1]))
|
|
|
2065 cp -= 1; /* rule #4 */
|
|
|
2066 if (cp >= linestart /* rule #2 */
|
|
|
2067 && (cp == linestart
|
|
|
2068 || notinname (cp[-1])) /* rule #3 */
|
|
|
2069 && strneq (name, cp, namelen)) /* rule #2 */
|
|
|
2070 named = FALSE; /* use implicit tag name */
|
|
|
2071 }
|
|
|
2072 }
|
|
|
2073
|
|
|
2074 if (named)
|
|
|
2075 name = savenstr (name, namelen);
|
|
|
2076 else
|
|
|
2077 name = NULL;
|
|
|
2078 pfnote (name, is_func, linestart, linelen, lno, cno);
|
|
|
2079 }
|
|
|
2080
|
|
428
|
2081 /* Record a tag. */
|
|
442
|
2082 static void
|
|
428
|
2083 pfnote (name, is_func, linestart, linelen, lno, cno)
|
|
|
2084 char *name; /* tag name, or NULL if unnamed */
|
|
|
2085 bool is_func; /* tag is a function */
|
|
|
2086 char *linestart; /* start of the line where tag is */
|
|
|
2087 int linelen; /* length of the line where tag is */
|
|
|
2088 int lno; /* line number */
|
|
|
2089 long cno; /* character number */
|
|
|
2090 {
|
|
|
2091 register node *np;
|
|
|
2092
|
|
2225
|
2093 assert (name == NULL || name[0] != '\0');
|
|
428
|
2094 if (CTAGS && name == NULL)
|
|
|
2095 return;
|
|
|
2096
|
|
|
2097 np = xnew (1, node);
|
|
|
2098
|
|
|
2099 /* If ctags mode, change name "main" to M<thisfilename>. */
|
|
|
2100 if (CTAGS && !cxref_style && streq (name, "main"))
|
|
|
2101 {
|
|
2225
|
2102 register char *fp = etags_strrchr (curfdp->taggedfname, '/');
|
|
|
2103 np->name = concat ("M", fp == NULL ? curfdp->taggedfname : fp + 1, "");
|
|
428
|
2104 fp = etags_strrchr (np->name, '.');
|
|
|
2105 if (fp != NULL && fp[1] != '\0' && fp[2] == '\0')
|
|
|
2106 fp[0] = '\0';
|
|
|
2107 }
|
|
|
2108 else
|
|
|
2109 np->name = name;
|
|
2225
|
2110 np->valid = TRUE;
|
|
428
|
2111 np->been_warned = FALSE;
|
|
2225
|
2112 np->fdp = curfdp;
|
|
428
|
2113 np->is_func = is_func;
|
|
|
2114 np->lno = lno;
|
|
2225
|
2115 if (np->fdp->usecharno)
|
|
|
2116 /* Our char numbers are 0-base, because of C language tradition?
|
|
|
2117 ctags compatibility? old versions compatibility? I don't know.
|
|
|
2118 Anyway, since emacs's are 1-base we expect etags.el to take care
|
|
|
2119 of the difference. If we wanted to have 1-based numbers, we would
|
|
|
2120 uncomment the +1 below. */
|
|
|
2121 np->cno = cno /* + 1 */ ;
|
|
|
2122 else
|
|
|
2123 np->cno = invalidcharno;
|
|
428
|
2124 np->left = np->right = NULL;
|
|
|
2125 if (CTAGS && !cxref_style)
|
|
|
2126 {
|
|
|
2127 if (strlen (linestart) < 50)
|
|
2225
|
2128 np->regex = concat (linestart, "$", "");
|
|
428
|
2129 else
|
|
2225
|
2130 np->regex = savenstr (linestart, 50);
|
|
428
|
2131 }
|
|
|
2132 else
|
|
2225
|
2133 np->regex = savenstr (linestart, linelen);
|
|
|
2134
|
|
|
2135 add_node (np, &nodehead);
|
|
428
|
2136 }
|
|
|
2137
|
|
|
2138 /*
|
|
|
2139 * free_tree ()
|
|
|
2140 * recurse on left children, iterate on right children.
|
|
|
2141 */
|
|
442
|
2142 static void
|
|
428
|
2143 free_tree (np)
|
|
|
2144 register node *np;
|
|
|
2145 {
|
|
|
2146 while (np)
|
|
|
2147 {
|
|
|
2148 register node *node_right = np->right;
|
|
|
2149 free_tree (np->left);
|
|
|
2150 if (np->name != NULL)
|
|
|
2151 free (np->name);
|
|
2225
|
2152 free (np->regex);
|
|
428
|
2153 free (np);
|
|
|
2154 np = node_right;
|
|
|
2155 }
|
|
|
2156 }
|
|
|
2157
|
|
|
2158 /*
|
|
2225
|
2159 * free_fdesc ()
|
|
|
2160 * delete a file description
|
|
|
2161 */
|
|
|
2162 static void
|
|
|
2163 free_fdesc (fdp)
|
|
|
2164 register fdesc *fdp;
|
|
|
2165 {
|
|
|
2166 if (fdp->infname != NULL) free (fdp->infname);
|
|
|
2167 if (fdp->infabsname != NULL) free (fdp->infabsname);
|
|
|
2168 if (fdp->infabsdir != NULL) free (fdp->infabsdir);
|
|
|
2169 if (fdp->taggedfname != NULL) free (fdp->taggedfname);
|
|
|
2170 if (fdp->prop != NULL) free (fdp->prop);
|
|
|
2171 free (fdp);
|
|
|
2172 }
|
|
|
2173
|
|
|
2174 /*
|
|
428
|
2175 * add_node ()
|
|
2225
|
2176 * Adds a node to the tree of nodes. In etags mode, sort by file
|
|
|
2177 * name. In ctags mode, sort by tag name. Make no attempt at
|
|
|
2178 * balancing.
|
|
428
|
2179 *
|
|
|
2180 * add_node is the only function allowed to add nodes, so it can
|
|
|
2181 * maintain state.
|
|
|
2182 */
|
|
442
|
2183 static void
|
|
428
|
2184 add_node (np, cur_node_p)
|
|
|
2185 node *np, **cur_node_p;
|
|
|
2186 {
|
|
|
2187 register int dif;
|
|
|
2188 register node *cur_node = *cur_node_p;
|
|
|
2189
|
|
|
2190 if (cur_node == NULL)
|
|
|
2191 {
|
|
|
2192 *cur_node_p = np;
|
|
|
2193 last_node = np;
|
|
|
2194 return;
|
|
|
2195 }
|
|
|
2196
|
|
|
2197 if (!CTAGS)
|
|
2225
|
2198 /* Etags Mode */
|
|
428
|
2199 {
|
|
2225
|
2200 /* For each file name, tags are in a linked sublist on the right
|
|
|
2201 pointer. The first tags of different files are a linked list
|
|
|
2202 on the left pointer. last_node points to the end of the last
|
|
|
2203 used sublist. */
|
|
|
2204 if (last_node != NULL && last_node->fdp == np->fdp)
|
|
|
2205 {
|
|
|
2206 /* Let's use the same sublist as the last added node. */
|
|
|
2207 assert (last_node->right == NULL);
|
|
|
2208 last_node->right = np;
|
|
|
2209 last_node = np;
|
|
|
2210 }
|
|
|
2211 else if (cur_node->fdp == np->fdp)
|
|
|
2212 {
|
|
|
2213 /* Scanning the list we found the head of a sublist which is
|
|
|
2214 good for us. Let's scan this sublist. */
|
|
|
2215 add_node (np, &cur_node->right);
|
|
|
2216 }
|
|
|
2217 else
|
|
|
2218 /* The head of this sublist is not good for us. Let's try the
|
|
|
2219 next one. */
|
|
|
2220 add_node (np, &cur_node->left);
|
|
|
2221 } /* if ETAGS mode */
|
|
|
2222
|
|
428
|
2223 else
|
|
|
2224 {
|
|
|
2225 /* Ctags Mode */
|
|
|
2226 dif = strcmp (np->name, cur_node->name);
|
|
|
2227
|
|
|
2228 /*
|
|
|
2229 * If this tag name matches an existing one, then
|
|
|
2230 * do not add the node, but maybe print a warning.
|
|
|
2231 */
|
|
3876
|
2232 if (no_duplicates && !dif)
|
|
428
|
2233 {
|
|
2225
|
2234 if (np->fdp == cur_node->fdp)
|
|
428
|
2235 {
|
|
|
2236 if (!no_warnings)
|
|
|
2237 {
|
|
|
2238 fprintf (stderr, "Duplicate entry in file %s, line %d: %s\n",
|
|
2225
|
2239 np->fdp->infname, lineno, np->name);
|
|
428
|
2240 fprintf (stderr, "Second entry ignored\n");
|
|
|
2241 }
|
|
|
2242 }
|
|
|
2243 else if (!cur_node->been_warned && !no_warnings)
|
|
|
2244 {
|
|
|
2245 fprintf
|
|
|
2246 (stderr,
|
|
|
2247 "Duplicate entry in files %s and %s: %s (Warning only)\n",
|
|
2225
|
2248 np->fdp->infname, cur_node->fdp->infname, np->name);
|
|
428
|
2249 cur_node->been_warned = TRUE;
|
|
|
2250 }
|
|
|
2251 return;
|
|
|
2252 }
|
|
|
2253
|
|
|
2254 /* Actually add the node */
|
|
|
2255 add_node (np, dif < 0 ? &cur_node->left : &cur_node->right);
|
|
2225
|
2256 } /* if CTAGS mode */
|
|
|
2257 }
|
|
|
2258
|
|
|
2259 /*
|
|
|
2260 * invalidate_nodes ()
|
|
|
2261 * Scan the node tree and invalidate all nodes pointing to the
|
|
|
2262 * given file description (CTAGS case) or free them (ETAGS case).
|
|
|
2263 */
|
|
|
2264 static void
|
|
|
2265 invalidate_nodes (badfdp, npp)
|
|
|
2266 fdesc *badfdp;
|
|
|
2267 node **npp;
|
|
|
2268 {
|
|
|
2269 node *np = *npp;
|
|
|
2270
|
|
|
2271 if (np == NULL)
|
|
|
2272 return;
|
|
|
2273
|
|
|
2274 if (CTAGS)
|
|
|
2275 {
|
|
|
2276 if (np->left != NULL)
|
|
|
2277 invalidate_nodes (badfdp, &np->left);
|
|
|
2278 if (np->fdp == badfdp)
|
|
|
2279 np->valid = FALSE;
|
|
|
2280 if (np->right != NULL)
|
|
|
2281 invalidate_nodes (badfdp, &np->right);
|
|
|
2282 }
|
|
|
2283 else
|
|
|
2284 {
|
|
|
2285 assert (np->fdp != NULL);
|
|
|
2286 if (np->fdp == badfdp)
|
|
|
2287 {
|
|
|
2288 *npp = np->left; /* detach the sublist from the list */
|
|
|
2289 np->left = NULL; /* isolate it */
|
|
|
2290 free_tree (np); /* free it */
|
|
|
2291 invalidate_nodes (badfdp, npp);
|
|
|
2292 }
|
|
|
2293 else
|
|
|
2294 invalidate_nodes (badfdp, &np->left);
|
|
428
|
2295 }
|
|
|
2296 }
|
|
458
|
2297
|
|
428
|
2298
|
|
2225
|
2299 static int total_size_of_entries __P((node *));
|
|
|
2300 static int number_len __P((long));
|
|
|
2301
|
|
|
2302 /* Length of a non-negative number's decimal representation. */
|
|
428
|
2303 static int
|
|
|
2304 number_len (num)
|
|
|
2305 long num;
|
|
|
2306 {
|
|
|
2307 int len = 1;
|
|
|
2308 while ((num /= 10) > 0)
|
|
|
2309 len += 1;
|
|
|
2310 return len;
|
|
|
2311 }
|
|
|
2312
|
|
|
2313 /*
|
|
|
2314 * Return total number of characters that put_entries will output for
|
|
2225
|
2315 * the nodes in the linked list at the right of the specified node.
|
|
|
2316 * This count is irrelevant with etags.el since emacs 19.34 at least,
|
|
|
2317 * but is still supplied for backward compatibility.
|
|
428
|
2318 */
|
|
442
|
2319 static int
|
|
428
|
2320 total_size_of_entries (np)
|
|
|
2321 register node *np;
|
|
|
2322 {
|
|
2225
|
2323 register int total = 0;
|
|
|
2324
|
|
|
2325 for (; np != NULL; np = np->right)
|
|
|
2326 if (np->valid)
|
|
|
2327 {
|
|
|
2328 total += strlen (np->regex) + 1; /* pat\177 */
|
|
|
2329 if (np->name != NULL)
|
|
|
2330 total += strlen (np->name) + 1; /* name\001 */
|
|
|
2331 total += number_len ((long) np->lno) + 1; /* lno, */
|
|
|
2332 if (np->cno != invalidcharno) /* cno */
|
|
|
2333 total += number_len (np->cno);
|
|
|
2334 total += 1; /* newline */
|
|
|
2335 }
|
|
|
2336
|
|
|
2337 return total;
|
|
|
2338 }
|
|
|
2339
|
|
|
2340 static void
|
|
|
2341 put_entries (np)
|
|
|
2342 register node *np;
|
|
|
2343 {
|
|
|
2344 register char *sp;
|
|
|
2345 static fdesc *fdp = NULL;
|
|
428
|
2346
|
|
|
2347 if (np == NULL)
|
|
2225
|
2348 return;
|
|
|
2349
|
|
|
2350 /* Output subentries that precede this one */
|
|
|
2351 if (CTAGS)
|
|
|
2352 put_entries (np->left);
|
|
|
2353
|
|
|
2354 /* Output this entry */
|
|
|
2355 if (np->valid)
|
|
428
|
2356 {
|
|
2225
|
2357 if (!CTAGS)
|
|
|
2358 {
|
|
|
2359 /* Etags mode */
|
|
|
2360 if (fdp != np->fdp)
|
|
|
2361 {
|
|
|
2362 fdp = np->fdp;
|
|
|
2363 fprintf (tagf, "\f\n%s,%d\n",
|
|
|
2364 fdp->taggedfname, total_size_of_entries (np));
|
|
|
2365 fdp->written = TRUE;
|
|
|
2366 }
|
|
|
2367 fputs (np->regex, tagf);
|
|
|
2368 fputc ('\177', tagf);
|
|
|
2369 if (np->name != NULL)
|
|
|
2370 {
|
|
|
2371 fputs (np->name, tagf);
|
|
|
2372 fputc ('\001', tagf);
|
|
|
2373 }
|
|
|
2374 fprintf (tagf, "%d,", np->lno);
|
|
|
2375 if (np->cno != invalidcharno)
|
|
|
2376 fprintf (tagf, "%ld", np->cno);
|
|
|
2377 fputs ("\n", tagf);
|
|
|
2378 }
|
|
|
2379 else
|
|
|
2380 {
|
|
|
2381 /* Ctags mode */
|
|
|
2382 if (np->name == NULL)
|
|
|
2383 error ("internal error: NULL name in ctags mode.", (char *)NULL);
|
|
|
2384
|
|
|
2385 if (cxref_style)
|
|
|
2386 {
|
|
|
2387 if (vgrind_style)
|
|
|
2388 fprintf (stdout, "%s %s %d\n",
|
|
|
2389 np->name, np->fdp->taggedfname, (np->lno + 63) / 64);
|
|
|
2390 else
|
|
|
2391 fprintf (stdout, "%-16s %3d %-16s %s\n",
|
|
|
2392 np->name, np->lno, np->fdp->taggedfname, np->regex);
|
|
|
2393 }
|
|
|
2394 else
|
|
|
2395 {
|
|
|
2396 fprintf (tagf, "%s\t%s\t", np->name, np->fdp->taggedfname);
|
|
|
2397
|
|
|
2398 if (np->is_func)
|
|
|
2399 { /* function or #define macro with args */
|
|
|
2400 putc (searchar, tagf);
|
|
|
2401 putc ('^', tagf);
|
|
|
2402
|
|
|
2403 for (sp = np->regex; *sp; sp++)
|
|
|
2404 {
|
|
|
2405 if (*sp == '\\' || *sp == searchar)
|
|
|
2406 putc ('\\', tagf);
|
|
|
2407 putc (*sp, tagf);
|
|
|
2408 }
|
|
|
2409 putc (searchar, tagf);
|
|
|
2410 }
|
|
|
2411 else
|
|
|
2412 { /* anything else; text pattern inadequate */
|
|
|
2413 fprintf (tagf, "%d", np->lno);
|
|
|
2414 }
|
|
|
2415 putc ('\n', tagf);
|
|
|
2416 }
|
|
|
2417 }
|
|
|
2418 } /* if this node contains a valid tag */
|
|
|
2419
|
|
|
2420 /* Output subentries that follow this one */
|
|
|
2421 put_entries (np->right);
|
|
|
2422 if (!CTAGS)
|
|
|
2423 put_entries (np->left);
|
|
428
|
2424 }
|
|
458
|
2425
|
|
428
|
2426
|
|
458
|
2427 /* C extensions. */
|
|
|
2428 #define C_EXT 0x00fff /* C extensions */
|
|
|
2429 #define C_PLAIN 0x00000 /* C */
|
|
|
2430 #define C_PLPL 0x00001 /* C++ */
|
|
|
2431 #define C_STAR 0x00003 /* C* */
|
|
|
2432 #define C_JAVA 0x00005 /* JAVA */
|
|
|
2433 #define C_AUTO 0x01000 /* C, but switch to C++ if `class' is met */
|
|
|
2434 #define YACC 0x10000 /* yacc file */
|
|
|
2435
|
|
428
|
2436 /*
|
|
|
2437 * The C symbol tables.
|
|
|
2438 */
|
|
|
2439 enum sym_type
|
|
|
2440 {
|
|
|
2441 st_none,
|
|
|
2442 st_C_objprot, st_C_objimpl, st_C_objend,
|
|
|
2443 st_C_gnumacro,
|
|
2325
|
2444 st_C_ignore, st_C_attribute,
|
|
428
|
2445 st_C_javastruct,
|
|
|
2446 st_C_operator,
|
|
531
|
2447 st_C_class, st_C_template,
|
|
2325
|
2448 st_C_struct, st_C_extern, st_C_enum, st_C_define, st_C_typedef
|
|
428
|
2449 };
|
|
|
2450
|
|
709
|
2451 static unsigned int hash __P((const char *, unsigned int));
|
|
|
2452 static struct C_stab_entry * in_word_set __P((const char *, unsigned int));
|
|
|
2453 static enum sym_type C_symtype __P((char *, int, int));
|
|
442
|
2454
|
|
428
|
2455 /* Feed stuff between (but not including) %[ and %] lines to:
|
|
2325
|
2456 gperf -m 5
|
|
428
|
2457 %[
|
|
2325
|
2458 %compare-strncmp
|
|
|
2459 %enum
|
|
|
2460 %struct-type
|
|
428
|
2461 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
|
|
|
2462 %%
|
|
2325
|
2463 if, 0, st_C_ignore
|
|
|
2464 for, 0, st_C_ignore
|
|
|
2465 while, 0, st_C_ignore
|
|
|
2466 switch, 0, st_C_ignore
|
|
|
2467 return, 0, st_C_ignore
|
|
|
2468 __attribute__, 0, st_C_attribute
|
|
|
2469 @interface, 0, st_C_objprot
|
|
|
2470 @protocol, 0, st_C_objprot
|
|
|
2471 @implementation,0, st_C_objimpl
|
|
|
2472 @end, 0, st_C_objend
|
|
3876
|
2473 import, (C_JAVA & ~C_PLPL), st_C_ignore
|
|
|
2474 package, (C_JAVA & ~C_PLPL), st_C_ignore
|
|
2325
|
2475 friend, C_PLPL, st_C_ignore
|
|
3876
|
2476 extends, (C_JAVA & ~C_PLPL), st_C_javastruct
|
|
|
2477 implements, (C_JAVA & ~C_PLPL), st_C_javastruct
|
|
|
2478 interface, (C_JAVA & ~C_PLPL), st_C_struct
|
|
2325
|
2479 class, 0, st_C_class
|
|
|
2480 namespace, C_PLPL, st_C_struct
|
|
|
2481 domain, C_STAR, st_C_struct
|
|
|
2482 union, 0, st_C_struct
|
|
|
2483 struct, 0, st_C_struct
|
|
|
2484 extern, 0, st_C_extern
|
|
|
2485 enum, 0, st_C_enum
|
|
|
2486 typedef, 0, st_C_typedef
|
|
|
2487 define, 0, st_C_define
|
|
3517
|
2488 undef, 0, st_C_define
|
|
2325
|
2489 operator, C_PLPL, st_C_operator
|
|
|
2490 template, 0, st_C_template
|
|
428
|
2491 # DEFUN used in emacs, the next three used in glibc (SYSCALL only for mach).
|
|
2325
|
2492 DEFUN, 0, st_C_gnumacro
|
|
|
2493 SYSCALL, 0, st_C_gnumacro
|
|
|
2494 ENTRY, 0, st_C_gnumacro
|
|
|
2495 PSEUDO, 0, st_C_gnumacro
|
|
428
|
2496 # These are defined inside C functions, so currently they are not met.
|
|
|
2497 # EXFUN used in glibc, DEFVAR_* in emacs.
|
|
2325
|
2498 #EXFUN, 0, st_C_gnumacro
|
|
|
2499 #DEFVAR_, 0, st_C_gnumacro
|
|
428
|
2500 %]
|
|
2325
|
2501 and replace lines between %< and %> with its output, then:
|
|
|
2502 - remove the #if characterset check
|
|
|
2503 - make in_word_set static and not inline. */
|
|
428
|
2504 /*%<*/
|
|
2325
|
2505 /* C code produced by gperf version 3.0.1 */
|
|
|
2506 /* Command-line: gperf -m 5 */
|
|
3517
|
2507 /* Computed positions: -k'2-3' */
|
|
2325
|
2508
|
|
428
|
2509 struct C_stab_entry { char *name; int c_ext; enum sym_type type; };
|
|
3517
|
2510 /* maximum key range = 33, duplicates = 0 */
|
|
428
|
2511
|
|
|
2512 #ifdef __GNUC__
|
|
|
2513 __inline
|
|
2325
|
2514 #else
|
|
|
2515 #ifdef __cplusplus
|
|
|
2516 inline
|
|
|
2517 #endif
|
|
428
|
2518 #endif
|
|
|
2519 static unsigned int
|
|
|
2520 hash (str, len)
|
|
|
2521 register const char *str;
|
|
|
2522 register unsigned int len;
|
|
|
2523 {
|
|
|
2524 static unsigned char asso_values[] =
|
|
|
2525 {
|
|
3517
|
2526 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2527 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2528 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2529 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2530 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2531 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2532 35, 35, 35, 35, 35, 35, 35, 35, 35, 15,
|
|
|
2533 14, 35, 35, 35, 35, 35, 35, 35, 14, 35,
|
|
|
2534 35, 35, 35, 12, 13, 35, 35, 35, 35, 12,
|
|
|
2535 35, 35, 35, 35, 35, 1, 35, 16, 35, 6,
|
|
|
2536 23, 0, 0, 35, 22, 0, 35, 35, 5, 0,
|
|
|
2537 0, 15, 1, 35, 6, 35, 8, 19, 35, 16,
|
|
|
2538 4, 5, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2539 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2540 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2541 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2542 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2543 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2544 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2545 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2546 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2547 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2548 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2549 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2550 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
|
|
|
2551 35, 35, 35, 35, 35, 35
|
|
428
|
2552 };
|
|
3517
|
2553 register int hval = len;
|
|
|
2554
|
|
|
2555 switch (hval)
|
|
|
2556 {
|
|
|
2557 default:
|
|
|
2558 hval += asso_values[(unsigned char)str[2]];
|
|
|
2559 /*FALLTHROUGH*/
|
|
|
2560 case 2:
|
|
|
2561 hval += asso_values[(unsigned char)str[1]];
|
|
|
2562 break;
|
|
|
2563 }
|
|
|
2564 return hval;
|
|
428
|
2565 }
|
|
|
2566
|
|
|
2567 static struct C_stab_entry *
|
|
|
2568 in_word_set (str, len)
|
|
|
2569 register const char *str;
|
|
|
2570 register unsigned int len;
|
|
|
2571 {
|
|
2325
|
2572 enum
|
|
|
2573 {
|
|
3517
|
2574 TOTAL_KEYWORDS = 32,
|
|
2325
|
2575 MIN_WORD_LENGTH = 2,
|
|
|
2576 MAX_WORD_LENGTH = 15,
|
|
3517
|
2577 MIN_HASH_VALUE = 2,
|
|
|
2578 MAX_HASH_VALUE = 34
|
|
2325
|
2579 };
|
|
|
2580
|
|
428
|
2581 static struct C_stab_entry wordlist[] =
|
|
|
2582 {
|
|
3517
|
2583 {""}, {""},
|
|
2325
|
2584 {"if", 0, st_C_ignore},
|
|
3517
|
2585 {""},
|
|
2325
|
2586 {"@end", 0, st_C_objend},
|
|
3517
|
2587 {"union", 0, st_C_struct},
|
|
|
2588 {"define", 0, st_C_define},
|
|
3876
|
2589 {"import", (C_JAVA & ~C_PLPL), st_C_ignore},
|
|
3517
|
2590 {"template", 0, st_C_template},
|
|
|
2591 {"operator", C_PLPL, st_C_operator},
|
|
|
2592 {"@interface", 0, st_C_objprot},
|
|
3876
|
2593 {"implements", (C_JAVA & ~C_PLPL), st_C_javastruct},
|
|
3517
|
2594 {"friend", C_PLPL, st_C_ignore},
|
|
|
2595 {"typedef", 0, st_C_typedef},
|
|
|
2596 {"return", 0, st_C_ignore},
|
|
|
2597 {"@implementation",0, st_C_objimpl},
|
|
|
2598 {"@protocol", 0, st_C_objprot},
|
|
3876
|
2599 {"interface", (C_JAVA & ~C_PLPL), st_C_struct},
|
|
2325
|
2600 {"extern", 0, st_C_extern},
|
|
3876
|
2601 {"extends", (C_JAVA & ~C_PLPL), st_C_javastruct},
|
|
3517
|
2602 {"struct", 0, st_C_struct},
|
|
|
2603 {"domain", C_STAR, st_C_struct},
|
|
|
2604 {"switch", 0, st_C_ignore},
|
|
|
2605 {"enum", 0, st_C_enum},
|
|
2325
|
2606 {"for", 0, st_C_ignore},
|
|
3517
|
2607 {"namespace", C_PLPL, st_C_struct},
|
|
|
2608 {"class", 0, st_C_class},
|
|
|
2609 {"while", 0, st_C_ignore},
|
|
|
2610 {"undef", 0, st_C_define},
|
|
3876
|
2611 {"package", (C_JAVA & ~C_PLPL), st_C_ignore},
|
|
2325
|
2612 {"__attribute__", 0, st_C_attribute},
|
|
|
2613 {"SYSCALL", 0, st_C_gnumacro},
|
|
3517
|
2614 {"ENTRY", 0, st_C_gnumacro},
|
|
2325
|
2615 {"PSEUDO", 0, st_C_gnumacro},
|
|
|
2616 {"DEFUN", 0, st_C_gnumacro}
|
|
428
|
2617 };
|
|
|
2618
|
|
|
2619 if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
|
|
|
2620 {
|
|
|
2621 register int key = hash (str, len);
|
|
|
2622
|
|
|
2623 if (key <= MAX_HASH_VALUE && key >= 0)
|
|
|
2624 {
|
|
|
2625 register const char *s = wordlist[key].name;
|
|
|
2626
|
|
2325
|
2627 if (*str == *s && !strncmp (str + 1, s + 1, len - 1) && s[len] == '\0')
|
|
428
|
2628 return &wordlist[key];
|
|
|
2629 }
|
|
|
2630 }
|
|
|
2631 return 0;
|
|
|
2632 }
|
|
|
2633 /*%>*/
|
|
|
2634
|
|
|
2635 static enum sym_type
|
|
|
2636 C_symtype (str, len, c_ext)
|
|
|
2637 char *str;
|
|
|
2638 int len;
|
|
|
2639 int c_ext;
|
|
|
2640 {
|
|
|
2641 register struct C_stab_entry *se = in_word_set (str, len);
|
|
|
2642
|
|
|
2643 if (se == NULL || (se->c_ext && !(c_ext & se->c_ext)))
|
|
|
2644 return st_none;
|
|
|
2645 return se->type;
|
|
|
2646 }
|
|
458
|
2647
|
|
428
|
2648
|
|
458
|
2649 /*
|
|
2325
|
2650 * Ignoring __attribute__ ((list))
|
|
|
2651 */
|
|
|
2652 static bool inattribute; /* looking at an __attribute__ construct */
|
|
|
2653
|
|
|
2654 /*
|
|
458
|
2655 * C functions and variables are recognized using a simple
|
|
|
2656 * finite automaton. fvdef is its state variable.
|
|
|
2657 */
|
|
2225
|
2658 static enum
|
|
428
|
2659 {
|
|
|
2660 fvnone, /* nothing seen */
|
|
458
|
2661 fdefunkey, /* Emacs DEFUN keyword seen */
|
|
|
2662 fdefunname, /* Emacs DEFUN name seen */
|
|
428
|
2663 foperator, /* func: operator keyword seen (cplpl) */
|
|
|
2664 fvnameseen, /* function or variable name seen */
|
|
|
2665 fstartlist, /* func: just after open parenthesis */
|
|
|
2666 finlist, /* func: in parameter list */
|
|
|
2667 flistseen, /* func: after parameter list */
|
|
|
2668 fignore, /* func: before open brace */
|
|
|
2669 vignore /* var-like: ignore until ';' */
|
|
|
2670 } fvdef;
|
|
|
2671
|
|
2225
|
2672 static bool fvextern; /* func or var: extern keyword seen; */
|
|
428
|
2673
|
|
458
|
2674 /*
|
|
|
2675 * typedefs are recognized using a simple finite automaton.
|
|
|
2676 * typdef is its state variable.
|
|
|
2677 */
|
|
2225
|
2678 static enum
|
|
428
|
2679 {
|
|
|
2680 tnone, /* nothing seen */
|
|
|
2681 tkeyseen, /* typedef keyword seen */
|
|
|
2682 ttypeseen, /* defined type seen */
|
|
|
2683 tinbody, /* inside typedef body */
|
|
|
2684 tend, /* just before typedef tag */
|
|
|
2685 tignore /* junk after typedef tag */
|
|
|
2686 } typdef;
|
|
|
2687
|
|
458
|
2688 /*
|
|
|
2689 * struct-like structures (enum, struct and union) are recognized
|
|
|
2690 * using another simple finite automaton. `structdef' is its state
|
|
|
2691 * variable.
|
|
|
2692 */
|
|
2225
|
2693 static enum
|
|
428
|
2694 {
|
|
458
|
2695 snone, /* nothing seen yet,
|
|
2325
|
2696 or in struct body if bracelev > 0 */
|
|
428
|
2697 skeyseen, /* struct-like keyword seen */
|
|
|
2698 stagseen, /* struct-like tag seen */
|
|
458
|
2699 scolonseen /* colon seen after struct-like tag */
|
|
428
|
2700 } structdef;
|
|
|
2701
|
|
|
2702 /*
|
|
|
2703 * When objdef is different from onone, objtag is the name of the class.
|
|
|
2704 */
|
|
2225
|
2705 static char *objtag = "<uninited>";
|
|
428
|
2706
|
|
|
2707 /*
|
|
|
2708 * Yet another little state machine to deal with preprocessor lines.
|
|
|
2709 */
|
|
2225
|
2710 static enum
|
|
428
|
2711 {
|
|
|
2712 dnone, /* nothing seen */
|
|
|
2713 dsharpseen, /* '#' seen as first char on line */
|
|
|
2714 ddefineseen, /* '#' and 'define' seen */
|
|
|
2715 dignorerest /* ignore rest of line */
|
|
|
2716 } definedef;
|
|
|
2717
|
|
|
2718 /*
|
|
|
2719 * State machine for Objective C protocols and implementations.
|
|
458
|
2720 * Idea by Tom R.Hageman <tom@basil.icce.rug.nl> (1995)
|
|
428
|
2721 */
|
|
2225
|
2722 static enum
|
|
428
|
2723 {
|
|
|
2724 onone, /* nothing seen */
|
|
|
2725 oprotocol, /* @interface or @protocol seen */
|
|
|
2726 oimplementation, /* @implementations seen */
|
|
|
2727 otagseen, /* class name seen */
|
|
|
2728 oparenseen, /* parenthesis before category seen */
|
|
|
2729 ocatseen, /* category name seen */
|
|
|
2730 oinbody, /* in @implementation body */
|
|
|
2731 omethodsign, /* in @implementation body, after +/- */
|
|
|
2732 omethodtag, /* after method name */
|
|
|
2733 omethodcolon, /* after method colon */
|
|
|
2734 omethodparm, /* after method parameter */
|
|
|
2735 oignore /* wait for @end */
|
|
|
2736 } objdef;
|
|
|
2737
|
|
|
2738
|
|
|
2739 /*
|
|
|
2740 * Use this structure to keep info about the token read, and how it
|
|
|
2741 * should be tagged. Used by the make_C_tag function to build a tag.
|
|
|
2742 */
|
|
2225
|
2743 static struct tok
|
|
428
|
2744 {
|
|
2225
|
2745 char *line; /* string containing the token */
|
|
|
2746 int offset; /* where the token starts in LINE */
|
|
|
2747 int length; /* token length */
|
|
|
2748 /*
|
|
|
2749 The previous members can be used to pass strings around for generic
|
|
|
2750 purposes. The following ones specifically refer to creating tags. In this
|
|
|
2751 case the token contained here is the pattern that will be used to create a
|
|
|
2752 tag.
|
|
|
2753 */
|
|
|
2754 bool valid; /* do not create a tag; the token should be
|
|
|
2755 invalidated whenever a state machine is
|
|
|
2756 reset prematurely */
|
|
|
2757 bool named; /* create a named tag */
|
|
|
2758 int lineno; /* source line number of tag */
|
|
|
2759 long linepos; /* source char number of tag */
|
|
458
|
2760 } token; /* latest token read */
|
|
428
|
2761
|
|
|
2762 /*
|
|
458
|
2763 * Variables and functions for dealing with nested structures.
|
|
|
2764 * Idea by Mykola Dzyuba <mdzyuba@yahoo.com> (2001)
|
|
428
|
2765 */
|
|
709
|
2766 static void pushclass_above __P((int, char *, int));
|
|
|
2767 static void popclass_above __P((int));
|
|
|
2768 static void write_classname __P((linebuffer *, char *qualifier));
|
|
458
|
2769
|
|
2225
|
2770 static struct {
|
|
458
|
2771 char **cname; /* nested class names */
|
|
2325
|
2772 int *bracelev; /* nested class brace level */
|
|
458
|
2773 int nl; /* class nesting level (elements used) */
|
|
|
2774 int size; /* length of the array */
|
|
|
2775 } cstack; /* stack for nested declaration tags */
|
|
|
2776 /* Current struct nesting depth (namespace, class, struct, union, enum). */
|
|
|
2777 #define nestlev (cstack.nl)
|
|
2225
|
2778 /* After struct keyword or in struct body, not inside a nested function. */
|
|
458
|
2779 #define instruct (structdef == snone && nestlev > 0 \
|
|
2325
|
2780 && bracelev == cstack.bracelev[nestlev-1] + 1)
|
|
458
|
2781
|
|
|
2782 static void
|
|
2325
|
2783 pushclass_above (bracelev, str, len)
|
|
|
2784 int bracelev;
|
|
458
|
2785 char *str;
|
|
|
2786 int len;
|
|
|
2787 {
|
|
|
2788 int nl;
|
|
|
2789
|
|
2325
|
2790 popclass_above (bracelev);
|
|
458
|
2791 nl = cstack.nl;
|
|
|
2792 if (nl >= cstack.size)
|
|
|
2793 {
|
|
|
2794 int size = cstack.size *= 2;
|
|
|
2795 xrnew (cstack.cname, size, char *);
|
|
2325
|
2796 xrnew (cstack.bracelev, size, int);
|
|
458
|
2797 }
|
|
2325
|
2798 assert (nl == 0 || cstack.bracelev[nl-1] < bracelev);
|
|
458
|
2799 cstack.cname[nl] = (str == NULL) ? NULL : savenstr (str, len);
|
|
2325
|
2800 cstack.bracelev[nl] = bracelev;
|
|
458
|
2801 cstack.nl = nl + 1;
|
|
|
2802 }
|
|
|
2803
|
|
|
2804 static void
|
|
2325
|
2805 popclass_above (bracelev)
|
|
|
2806 int bracelev;
|
|
458
|
2807 {
|
|
|
2808 int nl;
|
|
|
2809
|
|
|
2810 for (nl = cstack.nl - 1;
|
|
2325
|
2811 nl >= 0 && cstack.bracelev[nl] >= bracelev;
|
|
458
|
2812 nl--)
|
|
|
2813 {
|
|
|
2814 if (cstack.cname[nl] != NULL)
|
|
|
2815 free (cstack.cname[nl]);
|
|
|
2816 cstack.nl = nl;
|
|
|
2817 }
|
|
|
2818 }
|
|
|
2819
|
|
|
2820 static void
|
|
|
2821 write_classname (cn, qualifier)
|
|
|
2822 linebuffer *cn;
|
|
|
2823 char *qualifier;
|
|
|
2824 {
|
|
|
2825 int i, len;
|
|
|
2826 int qlen = strlen (qualifier);
|
|
|
2827
|
|
|
2828 if (cstack.nl == 0 || cstack.cname[0] == NULL)
|
|
|
2829 {
|
|
|
2830 len = 0;
|
|
|
2831 cn->len = 0;
|
|
|
2832 cn->buffer[0] = '\0';
|
|
|
2833 }
|
|
|
2834 else
|
|
|
2835 {
|
|
|
2836 len = strlen (cstack.cname[0]);
|
|
|
2837 linebuffer_setlen (cn, len);
|
|
|
2838 strcpy (cn->buffer, cstack.cname[0]);
|
|
|
2839 }
|
|
|
2840 for (i = 1; i < cstack.nl; i++)
|
|
|
2841 {
|
|
|
2842 char *s;
|
|
|
2843 int slen;
|
|
|
2844
|
|
|
2845 s = cstack.cname[i];
|
|
|
2846 if (s == NULL)
|
|
|
2847 continue;
|
|
|
2848 slen = strlen (s);
|
|
|
2849 len += slen + qlen;
|
|
|
2850 linebuffer_setlen (cn, len);
|
|
|
2851 strncat (cn->buffer, qualifier, qlen);
|
|
|
2852 strncat (cn->buffer, s, slen);
|
|
|
2853 }
|
|
|
2854 }
|
|
|
2855
|
|
|
2856
|
|
709
|
2857 static bool consider_token __P((char *, int, int, int *, int, int, bool *));
|
|
|
2858 static void make_C_tag __P((bool));
|
|
442
|
2859
|
|
428
|
2860 /*
|
|
|
2861 * consider_token ()
|
|
|
2862 * checks to see if the current token is at the start of a
|
|
|
2863 * function or variable, or corresponds to a typedef, or
|
|
|
2864 * is a struct/union/enum tag, or #define, or an enum constant.
|
|
|
2865 *
|
|
|
2866 * *IS_FUNC gets TRUE iff the token is a function or #define macro
|
|
458
|
2867 * with args. C_EXTP points to which language we are looking at.
|
|
428
|
2868 *
|
|
|
2869 * Globals
|
|
|
2870 * fvdef IN OUT
|
|
|
2871 * structdef IN OUT
|
|
|
2872 * definedef IN OUT
|
|
|
2873 * typdef IN OUT
|
|
|
2874 * objdef IN OUT
|
|
|
2875 */
|
|
|
2876
|
|
|
2877 static bool
|
|
2325
|
2878 consider_token (str, len, c, c_extp, bracelev, parlev, is_func_or_var)
|
|
428
|
2879 register char *str; /* IN: token pointer */
|
|
|
2880 register int len; /* IN: token length */
|
|
442
|
2881 register int c; /* IN: first char after the token */
|
|
458
|
2882 int *c_extp; /* IN, OUT: C extensions mask */
|
|
2325
|
2883 int bracelev; /* IN: brace level */
|
|
428
|
2884 int parlev; /* IN: parenthesis level */
|
|
|
2885 bool *is_func_or_var; /* OUT: function or variable found */
|
|
|
2886 {
|
|
2325
|
2887 /* When structdef is stagseen, scolonseen, or snone with bracelev > 0,
|
|
458
|
2888 structtype is the type of the preceding struct-like keyword, and
|
|
2325
|
2889 structbracelev is the brace level where it has been seen. */
|
|
458
|
2890 static enum sym_type structtype;
|
|
2325
|
2891 static int structbracelev;
|
|
458
|
2892 static enum sym_type toktype;
|
|
|
2893
|
|
|
2894
|
|
|
2895 toktype = C_symtype (str, len, *c_extp);
|
|
428
|
2896
|
|
|
2897 /*
|
|
2325
|
2898 * Skip __attribute__
|
|
428
|
2899 */
|
|
2325
|
2900 if (toktype == st_C_attribute)
|
|
428
|
2901 {
|
|
2325
|
2902 inattribute = TRUE;
|
|
428
|
2903 return FALSE;
|
|
2325
|
2904 }
|
|
|
2905
|
|
|
2906 /*
|
|
|
2907 * Advance the definedef state machine.
|
|
|
2908 */
|
|
|
2909 switch (definedef)
|
|
|
2910 {
|
|
|
2911 case dnone:
|
|
|
2912 /* We're not on a preprocessor line. */
|
|
|
2913 if (toktype == st_C_gnumacro)
|
|
|
2914 {
|
|
|
2915 fvdef = fdefunkey;
|
|
|
2916 return FALSE;
|
|
|
2917 }
|
|
|
2918 break;
|
|
|
2919 case dsharpseen:
|
|
|
2920 if (toktype == st_C_define)
|
|
|
2921 {
|
|
|
2922 definedef = ddefineseen;
|
|
|
2923 }
|
|
|
2924 else
|
|
|
2925 {
|
|
|
2926 definedef = dignorerest;
|
|
|
2927 }
|
|
|
2928 return FALSE;
|
|
|
2929 case ddefineseen:
|
|
|
2930 /*
|
|
|
2931 * Make a tag for any macro, unless it is a constant
|
|
|
2932 * and constantypedefs is FALSE.
|
|
|
2933 */
|
|
|
2934 definedef = dignorerest;
|
|
|
2935 *is_func_or_var = (c == '(');
|
|
|
2936 if (!*is_func_or_var && !constantypedefs)
|
|
|
2937 return FALSE;
|
|
|
2938 else
|
|
|
2939 return TRUE;
|
|
|
2940 case dignorerest:
|
|
|
2941 return FALSE;
|
|
|
2942 default:
|
|
|
2943 error ("internal error: definedef value.", (char *)NULL);
|
|
|
2944 }
|
|
|
2945
|
|
|
2946 /*
|
|
|
2947 * Now typedefs
|
|
|
2948 */
|
|
|
2949 switch (typdef)
|
|
|
2950 {
|
|
|
2951 case tnone:
|
|
|
2952 if (toktype == st_C_typedef)
|
|
|
2953 {
|
|
|
2954 if (typedefs)
|
|
|
2955 typdef = tkeyseen;
|
|
|
2956 fvextern = FALSE;
|
|
|
2957 fvdef = fvnone;
|
|
|
2958 return FALSE;
|
|
|
2959 }
|
|
|
2960 break;
|
|
|
2961 case tkeyseen:
|
|
|
2962 switch (toktype)
|
|
|
2963 {
|
|
|
2964 case st_none:
|
|
|
2965 case st_C_class:
|
|
|
2966 case st_C_struct:
|
|
|
2967 case st_C_enum:
|
|
|
2968 typdef = ttypeseen;
|
|
|
2969 }
|
|
|
2970 break;
|
|
|
2971 case ttypeseen:
|
|
|
2972 if (structdef == snone && fvdef == fvnone)
|
|
|
2973 {
|
|
|
2974 fvdef = fvnameseen;
|
|
|
2975 return TRUE;
|
|
|
2976 }
|
|
|
2977 break;
|
|
|
2978 case tend:
|
|
|
2979 switch (toktype)
|
|
|
2980 {
|
|
|
2981 case st_C_class:
|
|
|
2982 case st_C_struct:
|
|
|
2983 case st_C_enum:
|
|
|
2984 return FALSE;
|
|
|
2985 }
|
|
|
2986 return TRUE;
|
|
|
2987 }
|
|
|
2988
|
|
|
2989 /*
|
|
|
2990 * This structdef business is NOT invoked when we are ctags and the
|
|
|
2991 * file is plain C. This is because a struct tag may have the same
|
|
|
2992 * name as another tag, and this loses with ctags.
|
|
|
2993 */
|
|
|
2994 switch (toktype)
|
|
|
2995 {
|
|
|
2996 case st_C_javastruct:
|
|
|
2997 if (structdef == stagseen)
|
|
|
2998 structdef = scolonseen;
|
|
|
2999 return FALSE;
|
|
|
3000 case st_C_template:
|
|
|
3001 case st_C_class:
|
|
|
3002 if ((*c_extp & C_AUTO) /* automatic detection of C++ language */
|
|
|
3003 && bracelev == 0
|
|
|
3004 && definedef == dnone && structdef == snone
|
|
|
3005 && typdef == tnone && fvdef == fvnone)
|
|
|
3006 *c_extp = (*c_extp | C_PLPL) & ~C_AUTO;
|
|
|
3007 if (toktype == st_C_template)
|
|
|
3008 break;
|
|
|
3009 /* FALLTHRU */
|
|
|
3010 case st_C_struct:
|
|
|
3011 case st_C_enum:
|
|
|
3012 if (parlev == 0
|
|
|
3013 && fvdef != vignore
|
|
|
3014 && (typdef == tkeyseen
|
|
|
3015 || (typedefs_or_cplusplus && structdef == snone)))
|
|
|
3016 {
|
|
|
3017 structdef = skeyseen;
|
|
|
3018 structtype = toktype;
|
|
|
3019 structbracelev = bracelev;
|
|
|
3020 if (fvdef == fvnameseen)
|
|
|
3021 fvdef = fvnone;
|
|
|
3022 }
|
|
|
3023 return FALSE;
|
|
|
3024 }
|
|
|
3025
|
|
|
3026 if (structdef == skeyseen)
|
|
|
3027 {
|
|
|
3028 structdef = stagseen;
|
|
|
3029 return TRUE;
|
|
|
3030 }
|
|
|
3031
|
|
|
3032 if (typdef != tnone)
|
|
|
3033 definedef = dnone;
|
|
|
3034
|
|
|
3035 /* Detect Objective C constructs. */
|
|
|
3036 switch (objdef)
|
|
|
3037 {
|
|
|
3038 case onone:
|
|
|
3039 switch (toktype)
|
|
|
3040 {
|
|
|
3041 case st_C_objprot:
|
|
|
3042 objdef = oprotocol;
|
|
|
3043 return FALSE;
|
|
|
3044 case st_C_objimpl:
|
|
|
3045 objdef = oimplementation;
|
|
|
3046 return FALSE;
|
|
|
3047 }
|
|
|
3048 break;
|
|
|
3049 case oimplementation:
|
|
|
3050 /* Save the class tag for functions or variables defined inside. */
|
|
|
3051 objtag = savenstr (str, len);
|
|
|
3052 objdef = oinbody;
|
|
|
3053 return FALSE;
|
|
|
3054 case oprotocol:
|
|
|
3055 /* Save the class tag for categories. */
|
|
|
3056 objtag = savenstr (str, len);
|
|
|
3057 objdef = otagseen;
|
|
|
3058 *is_func_or_var = TRUE;
|
|
|
3059 return TRUE;
|
|
|
3060 case oparenseen:
|
|
|
3061 objdef = ocatseen;
|
|
|
3062 *is_func_or_var = TRUE;
|
|
|
3063 return TRUE;
|
|
|
3064 case oinbody:
|
|
|
3065 break;
|
|
|
3066 case omethodsign:
|
|
|
3067 if (parlev == 0)
|
|
|
3068 {
|
|
|
3069 fvdef = fvnone;
|
|
|
3070 objdef = omethodtag;
|
|
|
3071 linebuffer_setlen (&token_name, len);
|
|
|
3072 strncpy (token_name.buffer, str, len);
|
|
|
3073 token_name.buffer[len] = '\0';
|
|
|
3074 return TRUE;
|
|
|
3075 }
|
|
|
3076 return FALSE;
|
|
|
3077 case omethodcolon:
|
|
|
3078 if (parlev == 0)
|
|
|
3079 objdef = omethodparm;
|
|
|
3080 return FALSE;
|
|
|
3081 case omethodparm:
|
|
|
3082 if (parlev == 0)
|
|
|
3083 {
|
|
|
3084 fvdef = fvnone;
|
|
|
3085 objdef = omethodtag;
|
|
|
3086 linebuffer_setlen (&token_name, token_name.len + len);
|
|
|
3087 strncat (token_name.buffer, str, len);
|
|
|
3088 return TRUE;
|
|
|
3089 }
|
|
|
3090 return FALSE;
|
|
|
3091 case oignore:
|
|
|
3092 if (toktype == st_C_objend)
|
|
|
3093 {
|
|
|
3094 /* Memory leakage here: the string pointed by objtag is
|
|
|
3095 never released, because many tests would be needed to
|
|
|
3096 avoid breaking on incorrect input code. The amount of
|
|
|
3097 memory leaked here is the sum of the lengths of the
|
|
|
3098 class tags.
|
|
|
3099 free (objtag); */
|
|
|
3100 objdef = onone;
|
|
|
3101 }
|
|
|
3102 return FALSE;
|
|
|
3103 }
|
|
|
3104
|
|
|
3105 /* A function, variable or enum constant? */
|
|
|
3106 switch (toktype)
|
|
|
3107 {
|
|
|
3108 case st_C_extern:
|
|
|
3109 fvextern = TRUE;
|
|
|
3110 switch (fvdef)
|
|
|
3111 {
|
|
|
3112 case finlist:
|
|
|
3113 case flistseen:
|
|
|
3114 case fignore:
|
|
|
3115 case vignore:
|
|
|
3116 break;
|
|
|
3117 default:
|
|
|
3118 fvdef = fvnone;
|
|
|
3119 }
|
|
|
3120 return FALSE;
|
|
|
3121 case st_C_ignore:
|
|
|
3122 fvextern = FALSE;
|
|
|
3123 fvdef = vignore;
|
|
|
3124 return FALSE;
|
|
|
3125 case st_C_operator:
|
|
|
3126 fvdef = foperator;
|
|
|
3127 *is_func_or_var = TRUE;
|
|
|
3128 return TRUE;
|
|
|
3129 case st_none:
|
|
|
3130 if (constantypedefs
|
|
|
3131 && structdef == snone
|
|
|
3132 && structtype == st_C_enum && bracelev > structbracelev)
|
|
|
3133 return TRUE; /* enum constant */
|
|
|
3134 switch (fvdef)
|
|
|
3135 {
|
|
|
3136 case fdefunkey:
|
|
|
3137 if (bracelev > 0)
|
|
|
3138 break;
|
|
|
3139 fvdef = fdefunname; /* GNU macro */
|
|
|
3140 *is_func_or_var = TRUE;
|
|
|
3141 return TRUE;
|
|
|
3142 case fvnone:
|
|
|
3143 switch (typdef)
|
|
|
3144 {
|
|
|
3145 case ttypeseen:
|
|
|
3146 return FALSE;
|
|
|
3147 case tnone:
|
|
|
3148 if ((strneq (str, "asm", 3) && endtoken (str[3]))
|
|
|
3149 || (strneq (str, "__asm__", 7) && endtoken (str[7])))
|
|
|
3150 {
|
|
|
3151 fvdef = vignore;
|
|
|
3152 return FALSE;
|
|
|
3153 }
|
|
|
3154 break;
|
|
|
3155 }
|
|
|
3156 /* FALLTHRU */
|
|
|
3157 case fvnameseen:
|
|
2225
|
3158 if (len >= 10 && strneq (str+len-10, "::operator", 10))
|
|
458
|
3159 {
|
|
2225
|
3160 if (*c_extp & C_AUTO) /* automatic detection of C++ */
|
|
|
3161 *c_extp = (*c_extp | C_PLPL) & ~C_AUTO;
|
|
458
|
3162 fvdef = foperator;
|
|
|
3163 *is_func_or_var = TRUE;
|
|
|
3164 return TRUE;
|
|
|
3165 }
|
|
2325
|
3166 if (bracelev > 0 && !instruct)
|
|
458
|
3167 break;
|
|
428
|
3168 fvdef = fvnameseen; /* function or variable */
|
|
|
3169 *is_func_or_var = TRUE;
|
|
|
3170 return TRUE;
|
|
|
3171 }
|
|
|
3172 break;
|
|
|
3173 }
|
|
|
3174
|
|
|
3175 return FALSE;
|
|
|
3176 }
|
|
|
3177
|
|
458
|
3178
|
|
428
|
3179 /*
|
|
458
|
3180 * C_entries often keeps pointers to tokens or lines which are older than
|
|
|
3181 * the line currently read. By keeping two line buffers, and switching
|
|
|
3182 * them at end of line, it is possible to use those pointers.
|
|
428
|
3183 */
|
|
2225
|
3184 static struct
|
|
458
|
3185 {
|
|
|
3186 long linepos;
|
|
|
3187 linebuffer lb;
|
|
|
3188 } lbs[2];
|
|
|
3189
|
|
428
|
3190 #define current_lb_is_new (newndx == curndx)
|
|
|
3191 #define switch_line_buffers() (curndx = 1 - curndx)
|
|
|
3192
|
|
|
3193 #define curlb (lbs[curndx].lb)
|
|
|
3194 #define newlb (lbs[newndx].lb)
|
|
|
3195 #define curlinepos (lbs[curndx].linepos)
|
|
|
3196 #define newlinepos (lbs[newndx].linepos)
|
|
|
3197
|
|
2225
|
3198 #define plainc ((c_ext & C_EXT) == C_PLAIN)
|
|
|
3199 #define cplpl (c_ext & C_PLPL)
|
|
|
3200 #define cjava ((c_ext & C_JAVA) == C_JAVA)
|
|
|
3201
|
|
428
|
3202 #define CNL_SAVE_DEFINEDEF() \
|
|
|
3203 do { \
|
|
|
3204 curlinepos = charno; \
|
|
2225
|
3205 readline (&curlb, inf); \
|
|
428
|
3206 lp = curlb.buffer; \
|
|
|
3207 quotednl = FALSE; \
|
|
|
3208 newndx = curndx; \
|
|
|
3209 } while (0)
|
|
|
3210
|
|
|
3211 #define CNL() \
|
|
|
3212 do { \
|
|
|
3213 CNL_SAVE_DEFINEDEF(); \
|
|
458
|
3214 if (savetoken.valid) \
|
|
428
|
3215 { \
|
|
458
|
3216 token = savetoken; \
|
|
|
3217 savetoken.valid = FALSE; \
|
|
428
|
3218 } \
|
|
|
3219 definedef = dnone; \
|
|
|
3220 } while (0)
|
|
|
3221
|
|
|
3222
|
|
|
3223 static void
|
|
|
3224 make_C_tag (isfun)
|
|
|
3225 bool isfun;
|
|
|
3226 {
|
|
3876
|
3227 /* This function is never called when token.valid is FALSE, but
|
|
428
|
3228 we must protect against invalid input or internal errors. */
|
|
2225
|
3229 if (!DEBUG && !token.valid)
|
|
|
3230 return;
|
|
|
3231
|
|
|
3232 if (token.valid)
|
|
|
3233 make_tag (token_name.buffer, token_name.len, isfun, token.line,
|
|
|
3234 token.offset+token.length+1, token.lineno, token.linepos);
|
|
|
3235 else /* this case is optimised away if !DEBUG */
|
|
|
3236 make_tag (concat ("INVALID TOKEN:-->", token_name.buffer, ""),
|
|
|
3237 token_name.len + 17, isfun, token.line,
|
|
|
3238 token.offset+token.length+1, token.lineno, token.linepos);
|
|
|
3239
|
|
|
3240 token.valid = FALSE;
|
|
428
|
3241 }
|
|
|
3242
|
|
|
3243
|
|
458
|
3244 /*
|
|
|
3245 * C_entries ()
|
|
|
3246 * This routine finds functions, variables, typedefs,
|
|
|
3247 * #define's, enum constants and struct/union/enum definitions in
|
|
|
3248 * C syntax and adds them to the list.
|
|
|
3249 */
|
|
442
|
3250 static void
|
|
428
|
3251 C_entries (c_ext, inf)
|
|
|
3252 int c_ext; /* extension of C */
|
|
|
3253 FILE *inf; /* input file */
|
|
|
3254 {
|
|
|
3255 register char c; /* latest char read; '\0' for end of line */
|
|
|
3256 register char *lp; /* pointer one beyond the character `c' */
|
|
|
3257 int curndx, newndx; /* indices for current and new lb */
|
|
|
3258 register int tokoff; /* offset in line of start of current token */
|
|
|
3259 register int toklen; /* length of current token */
|
|
|
3260 char *qualifier; /* string used to qualify names */
|
|
|
3261 int qlen; /* length of qualifier */
|
|
2325
|
3262 int bracelev; /* current brace level */
|
|
|
3263 int bracketlev; /* current bracket level */
|
|
428
|
3264 int parlev; /* current parenthesis level */
|
|
2325
|
3265 int attrparlev; /* __attribute__ parenthesis level */
|
|
|
3266 int templatelev; /* current template level */
|
|
|
3267 int typdefbracelev; /* bracelev where a typedef struct body begun */
|
|
428
|
3268 bool incomm, inquote, inchar, quotednl, midtoken;
|
|
458
|
3269 bool yacc_rules; /* in the rules part of a yacc file */
|
|
3876
|
3270 struct tok savetoken = {0}; /* token saved during preprocessor handling */
|
|
458
|
3271
|
|
|
3272
|
|
2225
|
3273 linebuffer_init (&lbs[0].lb);
|
|
|
3274 linebuffer_init (&lbs[1].lb);
|
|
458
|
3275 if (cstack.size == 0)
|
|
|
3276 {
|
|
|
3277 cstack.size = (DEBUG) ? 1 : 4;
|
|
|
3278 cstack.nl = 0;
|
|
|
3279 cstack.cname = xnew (cstack.size, char *);
|
|
2325
|
3280 cstack.bracelev = xnew (cstack.size, int);
|
|
458
|
3281 }
|
|
428
|
3282
|
|
2325
|
3283 tokoff = toklen = typdefbracelev = 0; /* keep compiler quiet */
|
|
428
|
3284 curndx = newndx = 0;
|
|
|
3285 lp = curlb.buffer;
|
|
|
3286 *lp = 0;
|
|
|
3287
|
|
|
3288 fvdef = fvnone; fvextern = FALSE; typdef = tnone;
|
|
|
3289 structdef = snone; definedef = dnone; objdef = onone;
|
|
458
|
3290 yacc_rules = FALSE;
|
|
428
|
3291 midtoken = inquote = inchar = incomm = quotednl = FALSE;
|
|
458
|
3292 token.valid = savetoken.valid = FALSE;
|
|
2325
|
3293 bracelev = bracketlev = parlev = attrparlev = templatelev = 0;
|
|
428
|
3294 if (cjava)
|
|
|
3295 { qualifier = "."; qlen = 1; }
|
|
|
3296 else
|
|
|
3297 { qualifier = "::"; qlen = 2; }
|
|
|
3298
|
|
458
|
3299
|
|
428
|
3300 while (!feof (inf))
|
|
|
3301 {
|
|
|
3302 c = *lp++;
|
|
|
3303 if (c == '\\')
|
|
|
3304 {
|
|
2325
|
3305 /* If we are at the end of the line, the next character is a
|
|
|
3306 '\0'; do not skip it, because it is what tells us
|
|
428
|
3307 to read the next line. */
|
|
|
3308 if (*lp == '\0')
|
|
|
3309 {
|
|
|
3310 quotednl = TRUE;
|
|
|
3311 continue;
|
|
|
3312 }
|
|
|
3313 lp++;
|
|
|
3314 c = ' ';
|
|
|
3315 }
|
|
|
3316 else if (incomm)
|
|
|
3317 {
|
|
|
3318 switch (c)
|
|
|
3319 {
|
|
|
3320 case '*':
|
|
|
3321 if (*lp == '/')
|
|
|
3322 {
|
|
|
3323 c = *lp++;
|
|
|
3324 incomm = FALSE;
|
|
|
3325 }
|
|
|
3326 break;
|
|
|
3327 case '\0':
|
|
|
3328 /* Newlines inside comments do not end macro definitions in
|
|
|
3329 traditional cpp. */
|
|
|
3330 CNL_SAVE_DEFINEDEF ();
|
|
|
3331 break;
|
|
|
3332 }
|
|
|
3333 continue;
|
|
|
3334 }
|
|
|
3335 else if (inquote)
|
|
|
3336 {
|
|
|
3337 switch (c)
|
|
|
3338 {
|
|
|
3339 case '"':
|
|
|
3340 inquote = FALSE;
|
|
|
3341 break;
|
|
|
3342 case '\0':
|
|
|
3343 /* Newlines inside strings do not end macro definitions
|
|
|
3344 in traditional cpp, even though compilers don't
|
|
|
3345 usually accept them. */
|
|
|
3346 CNL_SAVE_DEFINEDEF ();
|
|
|
3347 break;
|
|
|
3348 }
|
|
|
3349 continue;
|
|
|
3350 }
|
|
|
3351 else if (inchar)
|
|
|
3352 {
|
|
|
3353 switch (c)
|
|
|
3354 {
|
|
|
3355 case '\0':
|
|
|
3356 /* Hmmm, something went wrong. */
|
|
|
3357 CNL ();
|
|
|
3358 /* FALLTHRU */
|
|
|
3359 case '\'':
|
|
|
3360 inchar = FALSE;
|
|
|
3361 break;
|
|
|
3362 }
|
|
|
3363 continue;
|
|
|
3364 }
|
|
2325
|
3365 else if (bracketlev > 0)
|
|
|
3366 {
|
|
|
3367 switch (c)
|
|
|
3368 {
|
|
|
3369 case ']':
|
|
|
3370 if (--bracketlev > 0)
|
|
428
|
3371 continue;
|
|
2325
|
3372 break;
|
|
|
3373 case '\0':
|
|
|
3374 CNL_SAVE_DEFINEDEF ();
|
|
|
3375 break;
|
|
|
3376 }
|
|
|
3377 continue;
|
|
|
3378 }
|
|
|
3379 else switch (c)
|
|
|
3380 {
|
|
|
3381 case '"':
|
|
|
3382 inquote = TRUE;
|
|
|
3383 if (inattribute)
|
|
|
3384 break;
|
|
|
3385 switch (fvdef)
|
|
|
3386 {
|
|
|
3387 case fdefunkey:
|
|
|
3388 case fstartlist:
|
|
|
3389 case finlist:
|
|
|
3390 case fignore:
|
|
|
3391 case vignore:
|
|
428
|
3392 break;
|
|
2325
|
3393 default:
|
|
|
3394 fvextern = FALSE;
|
|
|
3395 fvdef = fvnone;
|
|
|
3396 }
|
|
|
3397 continue;
|
|
|
3398 case '\'':
|
|
|
3399 inchar = TRUE;
|
|
|
3400 if (inattribute)
|
|
|
3401 break;
|
|
|
3402 if (fvdef != finlist && fvdef != fignore && fvdef !=vignore)
|
|
|
3403 {
|
|
|
3404 fvextern = FALSE;
|
|
|
3405 fvdef = fvnone;
|
|
|
3406 }
|
|
|
3407 continue;
|
|
|
3408 case '/':
|
|
|
3409 if (*lp == '*')
|
|
|
3410 {
|
|
3972
|
3411 incomm = TRUE;
|
|
2325
|
3412 lp++;
|
|
3972
|
3413 c = ' ';
|
|
2325
|
3414 }
|
|
|
3415 else if (/* cplpl && */ *lp == '/')
|
|
|
3416 {
|
|
|
3417 c = '\0';
|
|
|
3418 }
|
|
3972
|
3419 break;
|
|
2325
|
3420 case '%':
|
|
|
3421 if ((c_ext & YACC) && *lp == '%')
|
|
|
3422 {
|
|
|
3423 /* Entering or exiting rules section in yacc file. */
|
|
|
3424 lp++;
|
|
|
3425 definedef = dnone; fvdef = fvnone; fvextern = FALSE;
|
|
|
3426 typdef = tnone; structdef = snone;
|
|
|
3427 midtoken = inquote = inchar = incomm = quotednl = FALSE;
|
|
|
3428 bracelev = 0;
|
|
|
3429 yacc_rules = !yacc_rules;
|
|
|
3430 continue;
|
|
|
3431 }
|
|
|
3432 else
|
|
|
3433 break;
|
|
|
3434 case '#':
|
|
|
3435 if (definedef == dnone)
|
|
|
3436 {
|
|
|
3437 char *cp;
|
|
|
3438 bool cpptoken = TRUE;
|
|
|
3439
|
|
|
3440 /* Look back on this line. If all blanks, or nonblanks
|
|
|
3441 followed by an end of comment, this is a preprocessor
|
|
|
3442 token. */
|
|
|
3443 for (cp = newlb.buffer; cp < lp-1; cp++)
|
|
|
3444 if (!iswhite (*cp))
|
|
|
3445 {
|
|
|
3446 if (*cp == '*' && *(cp+1) == '/')
|
|
|
3447 {
|
|
|
3448 cp++;
|
|
|
3449 cpptoken = TRUE;
|
|
|
3450 }
|
|
|
3451 else
|
|
|
3452 cpptoken = FALSE;
|
|
|
3453 }
|
|
|
3454 if (cpptoken)
|
|
|
3455 definedef = dsharpseen;
|
|
|
3456 } /* if (definedef == dnone) */
|
|
|
3457 continue;
|
|
|
3458 case '[':
|
|
|
3459 bracketlev++;
|
|
428
|
3460 continue;
|
|
2325
|
3461 } /* switch (c) */
|
|
428
|
3462
|
|
|
3463
|
|
458
|
3464 /* Consider token only if some involved conditions are satisfied. */
|
|
|
3465 if (typdef != tignore
|
|
428
|
3466 && definedef != dignorerest
|
|
458
|
3467 && fvdef != finlist
|
|
2325
|
3468 && templatelev == 0
|
|
458
|
3469 && (definedef != dnone
|
|
2325
|
3470 || structdef != scolonseen)
|
|
|
3471 && !inattribute)
|
|
428
|
3472 {
|
|
|
3473 if (midtoken)
|
|
|
3474 {
|
|
|
3475 if (endtoken (c))
|
|
|
3476 {
|
|
2225
|
3477 if (c == ':' && *lp == ':' && begtoken (lp[1]))
|
|
|
3478 /* This handles :: in the middle,
|
|
|
3479 but not at the beginning of an identifier.
|
|
|
3480 Also, space-separated :: is not recognised. */
|
|
428
|
3481 {
|
|
2225
|
3482 if (c_ext & C_AUTO) /* automatic detection of C++ */
|
|
|
3483 c_ext = (c_ext | C_PLPL) & ~C_AUTO;
|
|
428
|
3484 lp += 2;
|
|
|
3485 toklen += 2;
|
|
|
3486 c = lp[-1];
|
|
458
|
3487 goto still_in_token;
|
|
428
|
3488 }
|
|
|
3489 else
|
|
|
3490 {
|
|
458
|
3491 bool funorvar = FALSE;
|
|
|
3492
|
|
428
|
3493 if (yacc_rules
|
|
|
3494 || consider_token (newlb.buffer + tokoff, toklen, c,
|
|
2325
|
3495 &c_ext, bracelev, parlev,
|
|
|
3496 &funorvar))
|
|
428
|
3497 {
|
|
|
3498 if (fvdef == foperator)
|
|
|
3499 {
|
|
|
3500 char *oldlp = lp;
|
|
|
3501 lp = skip_spaces (lp-1);
|
|
|
3502 if (*lp != '\0')
|
|
|
3503 lp += 1;
|
|
|
3504 while (*lp != '\0'
|
|
442
|
3505 && !iswhite (*lp) && *lp != '(')
|
|
428
|
3506 lp += 1;
|
|
|
3507 c = *lp++;
|
|
|
3508 toklen += lp - oldlp;
|
|
|
3509 }
|
|
458
|
3510 token.named = FALSE;
|
|
2225
|
3511 if (!plainc
|
|
458
|
3512 && nestlev > 0 && definedef == dnone)
|
|
|
3513 /* in struct body */
|
|
428
|
3514 {
|
|
458
|
3515 write_classname (&token_name, qualifier);
|
|
|
3516 linebuffer_setlen (&token_name,
|
|
|
3517 token_name.len+qlen+toklen);
|
|
428
|
3518 strcat (token_name.buffer, qualifier);
|
|
|
3519 strncat (token_name.buffer,
|
|
|
3520 newlb.buffer + tokoff, toklen);
|
|
458
|
3521 token.named = TRUE;
|
|
428
|
3522 }
|
|
|
3523 else if (objdef == ocatseen)
|
|
|
3524 /* Objective C category */
|
|
|
3525 {
|
|
|
3526 int len = strlen (objtag) + 2 + toklen;
|
|
458
|
3527 linebuffer_setlen (&token_name, len);
|
|
428
|
3528 strcpy (token_name.buffer, objtag);
|
|
|
3529 strcat (token_name.buffer, "(");
|
|
|
3530 strncat (token_name.buffer,
|
|
|
3531 newlb.buffer + tokoff, toklen);
|
|
|
3532 strcat (token_name.buffer, ")");
|
|
458
|
3533 token.named = TRUE;
|
|
428
|
3534 }
|
|
|
3535 else if (objdef == omethodtag
|
|
|
3536 || objdef == omethodparm)
|
|
|
3537 /* Objective C method */
|
|
|
3538 {
|
|
458
|
3539 token.named = TRUE;
|
|
|
3540 }
|
|
|
3541 else if (fvdef == fdefunname)
|
|
|
3542 /* GNU DEFUN and similar macros */
|
|
|
3543 {
|
|
|
3544 bool defun = (newlb.buffer[tokoff] == 'F');
|
|
|
3545 int off = tokoff;
|
|
|
3546 int len = toklen;
|
|
|
3547
|
|
|
3548 /* Rewrite the tag so that emacs lisp DEFUNs
|
|
|
3549 can be found by their elisp name */
|
|
|
3550 if (defun)
|
|
|
3551 {
|
|
|
3552 off += 1;
|
|
|
3553 len -= 1;
|
|
|
3554 }
|
|
|
3555 linebuffer_setlen (&token_name, len);
|
|
|
3556 strncpy (token_name.buffer,
|
|
|
3557 newlb.buffer + off, len);
|
|
|
3558 token_name.buffer[len] = '\0';
|
|
|
3559 if (defun)
|
|
|
3560 while (--len >= 0)
|
|
|
3561 if (token_name.buffer[len] == '_')
|
|
|
3562 token_name.buffer[len] = '-';
|
|
|
3563 token.named = defun;
|
|
428
|
3564 }
|
|
|
3565 else
|
|
|
3566 {
|
|
458
|
3567 linebuffer_setlen (&token_name, toklen);
|
|
428
|
3568 strncpy (token_name.buffer,
|
|
|
3569 newlb.buffer + tokoff, toklen);
|
|
|
3570 token_name.buffer[toklen] = '\0';
|
|
|
3571 /* Name macros and members. */
|
|
458
|
3572 token.named = (structdef == stagseen
|
|
|
3573 || typdef == ttypeseen
|
|
|
3574 || typdef == tend
|
|
|
3575 || (funorvar
|
|
|
3576 && definedef == dignorerest)
|
|
|
3577 || (funorvar
|
|
|
3578 && definedef == dnone
|
|
|
3579 && structdef == snone
|
|
2325
|
3580 && bracelev > 0));
|
|
428
|
3581 }
|
|
458
|
3582 token.lineno = lineno;
|
|
|
3583 token.offset = tokoff;
|
|
|
3584 token.length = toklen;
|
|
|
3585 token.line = newlb.buffer;
|
|
|
3586 token.linepos = newlinepos;
|
|
|
3587 token.valid = TRUE;
|
|
428
|
3588
|
|
|
3589 if (definedef == dnone
|
|
|
3590 && (fvdef == fvnameseen
|
|
|
3591 || fvdef == foperator
|
|
|
3592 || structdef == stagseen
|
|
|
3593 || typdef == tend
|
|
458
|
3594 || typdef == ttypeseen
|
|
428
|
3595 || objdef != onone))
|
|
|
3596 {
|
|
|
3597 if (current_lb_is_new)
|
|
|
3598 switch_line_buffers ();
|
|
|
3599 }
|
|
458
|
3600 else if (definedef != dnone
|
|
|
3601 || fvdef == fdefunname
|
|
|
3602 || instruct)
|
|
428
|
3603 make_C_tag (funorvar);
|
|
|
3604 }
|
|
2325
|
3605 else /* not yacc and consider_token failed */
|
|
|
3606 {
|
|
|
3607 if (inattribute && fvdef == fignore)
|
|
|
3608 {
|
|
|
3609 /* We have just met __attribute__ after a
|
|
|
3610 function parameter list: do not tag the
|
|
|
3611 function again. */
|
|
|
3612 fvdef = fvnone;
|
|
|
3613 }
|
|
|
3614 }
|
|
428
|
3615 midtoken = FALSE;
|
|
|
3616 }
|
|
|
3617 } /* if (endtoken (c)) */
|
|
|
3618 else if (intoken (c))
|
|
458
|
3619 still_in_token:
|
|
428
|
3620 {
|
|
|
3621 toklen++;
|
|
|
3622 continue;
|
|
|
3623 }
|
|
|
3624 } /* if (midtoken) */
|
|
|
3625 else if (begtoken (c))
|
|
|
3626 {
|
|
|
3627 switch (definedef)
|
|
|
3628 {
|
|
|
3629 case dnone:
|
|
|
3630 switch (fvdef)
|
|
|
3631 {
|
|
|
3632 case fstartlist:
|
|
2325
|
3633 /* This prevents tagging fb in
|
|
|
3634 void (__attribute__((noreturn)) *fb) (void);
|
|
|
3635 Fixing this is not easy and not very important. */
|
|
428
|
3636 fvdef = finlist;
|
|
|
3637 continue;
|
|
|
3638 case flistseen:
|
|
2225
|
3639 if (plainc || declarations)
|
|
|
3640 {
|
|
|
3641 make_C_tag (TRUE); /* a function */
|
|
|
3642 fvdef = fignore;
|
|
|
3643 }
|
|
428
|
3644 break;
|
|
|
3645 }
|
|
|
3646 if (structdef == stagseen && !cjava)
|
|
458
|
3647 {
|
|
2325
|
3648 popclass_above (bracelev);
|
|
458
|
3649 structdef = snone;
|
|
|
3650 }
|
|
428
|
3651 break;
|
|
|
3652 case dsharpseen:
|
|
458
|
3653 savetoken = token;
|
|
2225
|
3654 break;
|
|
428
|
3655 }
|
|
|
3656 if (!yacc_rules || lp == newlb.buffer + 1)
|
|
|
3657 {
|
|
|
3658 tokoff = lp - 1 - newlb.buffer;
|
|
|
3659 toklen = 1;
|
|
|
3660 midtoken = TRUE;
|
|
|
3661 }
|
|
|
3662 continue;
|
|
|
3663 } /* if (begtoken) */
|
|
|
3664 } /* if must look at token */
|
|
|
3665
|
|
|
3666
|
|
|
3667 /* Detect end of line, colon, comma, semicolon and various braces
|
|
|
3668 after having handled a token.*/
|
|
|
3669 switch (c)
|
|
|
3670 {
|
|
|
3671 case ':':
|
|
2325
|
3672 if (inattribute)
|
|
|
3673 break;
|
|
458
|
3674 if (yacc_rules && token.offset == 0 && token.valid)
|
|
|
3675 {
|
|
|
3676 make_C_tag (FALSE); /* a yacc function */
|
|
|
3677 break;
|
|
|
3678 }
|
|
428
|
3679 if (definedef != dnone)
|
|
|
3680 break;
|
|
|
3681 switch (objdef)
|
|
|
3682 {
|
|
|
3683 case otagseen:
|
|
|
3684 objdef = oignore;
|
|
|
3685 make_C_tag (TRUE); /* an Objective C class */
|
|
|
3686 break;
|
|
|
3687 case omethodtag:
|
|
|
3688 case omethodparm:
|
|
|
3689 objdef = omethodcolon;
|
|
458
|
3690 linebuffer_setlen (&token_name, token_name.len + 1);
|
|
428
|
3691 strcat (token_name.buffer, ":");
|
|
|
3692 break;
|
|
|
3693 }
|
|
|
3694 if (structdef == stagseen)
|
|
2225
|
3695 {
|
|
|
3696 structdef = scolonseen;
|
|
|
3697 break;
|
|
|
3698 }
|
|
|
3699 /* Should be useless, but may be work as a safety net. */
|
|
|
3700 if (cplpl && fvdef == flistseen)
|
|
|
3701 {
|
|
|
3702 make_C_tag (TRUE); /* a function */
|
|
|
3703 fvdef = fignore;
|
|
|
3704 break;
|
|
|
3705 }
|
|
428
|
3706 break;
|
|
|
3707 case ';':
|
|
2325
|
3708 if (definedef != dnone || inattribute)
|
|
428
|
3709 break;
|
|
458
|
3710 switch (typdef)
|
|
428
|
3711 {
|
|
458
|
3712 case tend:
|
|
|
3713 case ttypeseen:
|
|
|
3714 make_C_tag (FALSE); /* a typedef */
|
|
|
3715 typdef = tnone;
|
|
|
3716 fvdef = fvnone;
|
|
428
|
3717 break;
|
|
458
|
3718 case tnone:
|
|
|
3719 case tinbody:
|
|
|
3720 case tignore:
|
|
|
3721 switch (fvdef)
|
|
|
3722 {
|
|
|
3723 case fignore:
|
|
2225
|
3724 if (typdef == tignore || cplpl)
|
|
458
|
3725 fvdef = fvnone;
|
|
|
3726 break;
|
|
|
3727 case fvnameseen:
|
|
2325
|
3728 if ((globals && bracelev == 0 && (!fvextern || declarations))
|
|
458
|
3729 || (members && instruct))
|
|
|
3730 make_C_tag (FALSE); /* a variable */
|
|
|
3731 fvextern = FALSE;
|
|
|
3732 fvdef = fvnone;
|
|
|
3733 token.valid = FALSE;
|
|
|
3734 break;
|
|
|
3735 case flistseen:
|
|
2325
|
3736 if ((declarations
|
|
|
3737 && (cplpl || !instruct)
|
|
|
3738 && (typdef == tnone || (typdef != tignore && instruct)))
|
|
|
3739 || (members
|
|
|
3740 && plainc && instruct))
|
|
|
3741 make_C_tag (TRUE); /* a function */
|
|
458
|
3742 /* FALLTHRU */
|
|
|
3743 default:
|
|
|
3744 fvextern = FALSE;
|
|
|
3745 fvdef = fvnone;
|
|
|
3746 if (declarations
|
|
2225
|
3747 && cplpl && structdef == stagseen)
|
|
458
|
3748 make_C_tag (FALSE); /* forward declaration */
|
|
|
3749 else
|
|
|
3750 token.valid = FALSE;
|
|
|
3751 } /* switch (fvdef) */
|
|
428
|
3752 /* FALLTHRU */
|
|
|
3753 default:
|
|
458
|
3754 if (!instruct)
|
|
|
3755 typdef = tnone;
|
|
428
|
3756 }
|
|
|
3757 if (structdef == stagseen)
|
|
|
3758 structdef = snone;
|
|
|
3759 break;
|
|
|
3760 case ',':
|
|
2325
|
3761 if (definedef != dnone || inattribute)
|
|
428
|
3762 break;
|
|
|
3763 switch (objdef)
|
|
|
3764 {
|
|
|
3765 case omethodtag:
|
|
|
3766 case omethodparm:
|
|
|
3767 make_C_tag (TRUE); /* an Objective C method */
|
|
|
3768 objdef = oinbody;
|
|
|
3769 break;
|
|
|
3770 }
|
|
|
3771 switch (fvdef)
|
|
|
3772 {
|
|
458
|
3773 case fdefunkey:
|
|
428
|
3774 case foperator:
|
|
458
|
3775 case fstartlist:
|
|
428
|
3776 case finlist:
|
|
|
3777 case fignore:
|
|
|
3778 case vignore:
|
|
|
3779 break;
|
|
458
|
3780 case fdefunname:
|
|
|
3781 fvdef = fignore;
|
|
|
3782 break;
|
|
2325
|
3783 case fvnameseen:
|
|
|
3784 if (parlev == 0
|
|
|
3785 && ((globals
|
|
|
3786 && bracelev == 0
|
|
|
3787 && templatelev == 0
|
|
|
3788 && (!fvextern || declarations))
|
|
|
3789 || (members && instruct)))
|
|
|
3790 make_C_tag (FALSE); /* a variable */
|
|
458
|
3791 break;
|
|
2325
|
3792 case flistseen:
|
|
458
|
3793 if ((declarations && typdef == tnone && !instruct)
|
|
|
3794 || (members && typdef != tignore && instruct))
|
|
|
3795 {
|
|
2325
|
3796 make_C_tag (TRUE); /* a function */
|
|
458
|
3797 fvdef = fvnameseen;
|
|
|
3798 }
|
|
|
3799 else if (!declarations)
|
|
|
3800 fvdef = fvnone;
|
|
|
3801 token.valid = FALSE;
|
|
428
|
3802 break;
|
|
|
3803 default:
|
|
|
3804 fvdef = fvnone;
|
|
|
3805 }
|
|
|
3806 if (structdef == stagseen)
|
|
|
3807 structdef = snone;
|
|
|
3808 break;
|
|
2325
|
3809 case ']':
|
|
|
3810 if (definedef != dnone || inattribute)
|
|
428
|
3811 break;
|
|
458
|
3812 if (structdef == stagseen)
|
|
|
3813 structdef = snone;
|
|
|
3814 switch (typdef)
|
|
428
|
3815 {
|
|
458
|
3816 case ttypeseen:
|
|
|
3817 case tend:
|
|
428
|
3818 typdef = tignore;
|
|
|
3819 make_C_tag (FALSE); /* a typedef */
|
|
|
3820 break;
|
|
458
|
3821 case tnone:
|
|
|
3822 case tinbody:
|
|
|
3823 switch (fvdef)
|
|
|
3824 {
|
|
|
3825 case foperator:
|
|
|
3826 case finlist:
|
|
|
3827 case fignore:
|
|
|
3828 case vignore:
|
|
|
3829 break;
|
|
|
3830 case fvnameseen:
|
|
2325
|
3831 if ((members && bracelev == 1)
|
|
|
3832 || (globals && bracelev == 0
|
|
458
|
3833 && (!fvextern || declarations)))
|
|
|
3834 make_C_tag (FALSE); /* a variable */
|
|
|
3835 /* FALLTHRU */
|
|
|
3836 default:
|
|
|
3837 fvdef = fvnone;
|
|
|
3838 }
|
|
428
|
3839 break;
|
|
|
3840 }
|
|
|
3841 break;
|
|
|
3842 case '(':
|
|
2325
|
3843 if (inattribute)
|
|
|
3844 {
|
|
|
3845 attrparlev++;
|
|
|
3846 break;
|
|
|
3847 }
|
|
428
|
3848 if (definedef != dnone)
|
|
|
3849 break;
|
|
|
3850 if (objdef == otagseen && parlev == 0)
|
|
|
3851 objdef = oparenseen;
|
|
|
3852 switch (fvdef)
|
|
|
3853 {
|
|
|
3854 case fvnameseen:
|
|
|
3855 if (typdef == ttypeseen
|
|
|
3856 && *lp != '*'
|
|
458
|
3857 && !instruct)
|
|
428
|
3858 {
|
|
|
3859 /* This handles constructs like:
|
|
|
3860 typedef void OperatorFun (int fun); */
|
|
|
3861 make_C_tag (FALSE);
|
|
|
3862 typdef = tignore;
|
|
458
|
3863 fvdef = fignore;
|
|
|
3864 break;
|
|
428
|
3865 }
|
|
|
3866 /* FALLTHRU */
|
|
|
3867 case foperator:
|
|
|
3868 fvdef = fstartlist;
|
|
|
3869 break;
|
|
|
3870 case flistseen:
|
|
|
3871 fvdef = finlist;
|
|
|
3872 break;
|
|
|
3873 }
|
|
|
3874 parlev++;
|
|
|
3875 break;
|
|
|
3876 case ')':
|
|
2325
|
3877 if (inattribute)
|
|
|
3878 {
|
|
|
3879 if (--attrparlev == 0)
|
|
|
3880 inattribute = FALSE;
|
|
|
3881 break;
|
|
|
3882 }
|
|
428
|
3883 if (definedef != dnone)
|
|
|
3884 break;
|
|
|
3885 if (objdef == ocatseen && parlev == 1)
|
|
|
3886 {
|
|
|
3887 make_C_tag (TRUE); /* an Objective C category */
|
|
|
3888 objdef = oignore;
|
|
|
3889 }
|
|
|
3890 if (--parlev == 0)
|
|
|
3891 {
|
|
|
3892 switch (fvdef)
|
|
|
3893 {
|
|
|
3894 case fstartlist:
|
|
|
3895 case finlist:
|
|
|
3896 fvdef = flistseen;
|
|
|
3897 break;
|
|
|
3898 }
|
|
458
|
3899 if (!instruct
|
|
|
3900 && (typdef == tend
|
|
|
3901 || typdef == ttypeseen))
|
|
428
|
3902 {
|
|
|
3903 typdef = tignore;
|
|
|
3904 make_C_tag (FALSE); /* a typedef */
|
|
|
3905 }
|
|
|
3906 }
|
|
|
3907 else if (parlev < 0) /* can happen due to ill-conceived #if's. */
|
|
|
3908 parlev = 0;
|
|
|
3909 break;
|
|
|
3910 case '{':
|
|
|
3911 if (definedef != dnone)
|
|
|
3912 break;
|
|
|
3913 if (typdef == ttypeseen)
|
|
|
3914 {
|
|
531
|
3915 /* Whenever typdef is set to tinbody (currently only
|
|
2325
|
3916 here), typdefbracelev should be set to bracelev. */
|
|
531
|
3917 typdef = tinbody;
|
|
2325
|
3918 typdefbracelev = bracelev;
|
|
428
|
3919 }
|
|
|
3920 switch (fvdef)
|
|
|
3921 {
|
|
|
3922 case flistseen:
|
|
458
|
3923 make_C_tag (TRUE); /* a function */
|
|
428
|
3924 /* FALLTHRU */
|
|
|
3925 case fignore:
|
|
|
3926 fvdef = fvnone;
|
|
|
3927 break;
|
|
|
3928 case fvnone:
|
|
|
3929 switch (objdef)
|
|
|
3930 {
|
|
|
3931 case otagseen:
|
|
|
3932 make_C_tag (TRUE); /* an Objective C class */
|
|
|
3933 objdef = oignore;
|
|
|
3934 break;
|
|
|
3935 case omethodtag:
|
|
|
3936 case omethodparm:
|
|
|
3937 make_C_tag (TRUE); /* an Objective C method */
|
|
|
3938 objdef = oinbody;
|
|
|
3939 break;
|
|
|
3940 default:
|
|
|
3941 /* Neutralize `extern "C" {' grot. */
|
|
2325
|
3942 if (bracelev == 0 && structdef == snone && nestlev == 0
|
|
458
|
3943 && typdef == tnone)
|
|
2325
|
3944 bracelev = -1;
|
|
428
|
3945 }
|
|
2225
|
3946 break;
|
|
428
|
3947 }
|
|
458
|
3948 switch (structdef)
|
|
|
3949 {
|
|
|
3950 case skeyseen: /* unnamed struct */
|
|
2325
|
3951 pushclass_above (bracelev, NULL, 0);
|
|
458
|
3952 structdef = snone;
|
|
|
3953 break;
|
|
|
3954 case stagseen: /* named struct or enum */
|
|
|
3955 case scolonseen: /* a class */
|
|
2325
|
3956 pushclass_above (bracelev,token.line+token.offset, token.length);
|
|
458
|
3957 structdef = snone;
|
|
|
3958 make_C_tag (FALSE); /* a struct or enum */
|
|
|
3959 break;
|
|
|
3960 }
|
|
2325
|
3961 bracelev++;
|
|
428
|
3962 break;
|
|
|
3963 case '*':
|
|
|
3964 if (definedef != dnone)
|
|
|
3965 break;
|
|
|
3966 if (fvdef == fstartlist)
|
|
2225
|
3967 {
|
|
|
3968 fvdef = fvnone; /* avoid tagging `foo' in `foo (*bar()) ()' */
|
|
|
3969 token.valid = FALSE;
|
|
|
3970 }
|
|
428
|
3971 break;
|
|
|
3972 case '}':
|
|
|
3973 if (definedef != dnone)
|
|
|
3974 break;
|
|
2225
|
3975 if (!ignoreindent && lp == newlb.buffer + 1)
|
|
428
|
3976 {
|
|
2325
|
3977 if (bracelev != 0)
|
|
2225
|
3978 token.valid = FALSE;
|
|
2325
|
3979 bracelev = 0; /* reset brace level if first column */
|
|
428
|
3980 parlev = 0; /* also reset paren level, just in case... */
|
|
|
3981 }
|
|
2325
|
3982 else if (bracelev > 0)
|
|
|
3983 bracelev--;
|
|
2225
|
3984 else
|
|
|
3985 token.valid = FALSE; /* something gone amiss, token unreliable */
|
|
2325
|
3986 popclass_above (bracelev);
|
|
458
|
3987 structdef = snone;
|
|
2325
|
3988 /* Only if typdef == tinbody is typdefbracelev significant. */
|
|
|
3989 if (typdef == tinbody && bracelev <= typdefbracelev)
|
|
428
|
3990 {
|
|
2325
|
3991 assert (bracelev == typdefbracelev);
|
|
458
|
3992 typdef = tend;
|
|
428
|
3993 }
|
|
|
3994 break;
|
|
|
3995 case '=':
|
|
|
3996 if (definedef != dnone)
|
|
|
3997 break;
|
|
|
3998 switch (fvdef)
|
|
|
3999 {
|
|
|
4000 case foperator:
|
|
|
4001 case finlist:
|
|
|
4002 case fignore:
|
|
|
4003 case vignore:
|
|
|
4004 break;
|
|
|
4005 case fvnameseen:
|
|
2325
|
4006 if ((members && bracelev == 1)
|
|
|
4007 || (globals && bracelev == 0 && (!fvextern || declarations)))
|
|
428
|
4008 make_C_tag (FALSE); /* a variable */
|
|
|
4009 /* FALLTHRU */
|
|
|
4010 default:
|
|
|
4011 fvdef = vignore;
|
|
|
4012 }
|
|
|
4013 break;
|
|
458
|
4014 case '<':
|
|
2325
|
4015 if (cplpl
|
|
|
4016 && (structdef == stagseen || fvdef == fvnameseen))
|
|
458
|
4017 {
|
|
2325
|
4018 templatelev++;
|
|
458
|
4019 break;
|
|
|
4020 }
|
|
|
4021 goto resetfvdef;
|
|
|
4022 case '>':
|
|
2325
|
4023 if (templatelev > 0)
|
|
458
|
4024 {
|
|
2325
|
4025 templatelev--;
|
|
458
|
4026 break;
|
|
|
4027 }
|
|
|
4028 goto resetfvdef;
|
|
428
|
4029 case '+':
|
|
|
4030 case '-':
|
|
2325
|
4031 if (objdef == oinbody && bracelev == 0)
|
|
428
|
4032 {
|
|
|
4033 objdef = omethodsign;
|
|
|
4034 break;
|
|
|
4035 }
|
|
|
4036 /* FALLTHRU */
|
|
458
|
4037 resetfvdef:
|
|
2325
|
4038 case '#': case '~': case '&': case '%': case '/':
|
|
|
4039 case '|': case '^': case '!': case '.': case '?':
|
|
428
|
4040 if (definedef != dnone)
|
|
|
4041 break;
|
|
|
4042 /* These surely cannot follow a function tag in C. */
|
|
|
4043 switch (fvdef)
|
|
|
4044 {
|
|
|
4045 case foperator:
|
|
|
4046 case finlist:
|
|
|
4047 case fignore:
|
|
|
4048 case vignore:
|
|
|
4049 break;
|
|
|
4050 default:
|
|
|
4051 fvdef = fvnone;
|
|
|
4052 }
|
|
|
4053 break;
|
|
|
4054 case '\0':
|
|
|
4055 if (objdef == otagseen)
|
|
|
4056 {
|
|
|
4057 make_C_tag (TRUE); /* an Objective C class */
|
|
|
4058 objdef = oignore;
|
|
|
4059 }
|
|
|
4060 /* If a macro spans multiple lines don't reset its state. */
|
|
|
4061 if (quotednl)
|
|
|
4062 CNL_SAVE_DEFINEDEF ();
|
|
|
4063 else
|
|
|
4064 CNL ();
|
|
|
4065 break;
|
|
|
4066 } /* switch (c) */
|
|
|
4067
|
|
|
4068 } /* while not eof */
|
|
458
|
4069
|
|
|
4070 free (lbs[0].lb.buffer);
|
|
|
4071 free (lbs[1].lb.buffer);
|
|
428
|
4072 }
|
|
|
4073
|
|
|
4074 /*
|
|
|
4075 * Process either a C++ file or a C file depending on the setting
|
|
|
4076 * of a global flag.
|
|
|
4077 */
|
|
442
|
4078 static void
|
|
428
|
4079 default_C_entries (inf)
|
|
|
4080 FILE *inf;
|
|
|
4081 {
|
|
458
|
4082 C_entries (cplusplus ? C_PLPL : C_AUTO, inf);
|
|
428
|
4083 }
|
|
|
4084
|
|
458
|
4085 /* Always do plain C. */
|
|
442
|
4086 static void
|
|
428
|
4087 plain_C_entries (inf)
|
|
|
4088 FILE *inf;
|
|
|
4089 {
|
|
|
4090 C_entries (0, inf);
|
|
|
4091 }
|
|
|
4092
|
|
|
4093 /* Always do C++. */
|
|
442
|
4094 static void
|
|
428
|
4095 Cplusplus_entries (inf)
|
|
|
4096 FILE *inf;
|
|
|
4097 {
|
|
|
4098 C_entries (C_PLPL, inf);
|
|
|
4099 }
|
|
|
4100
|
|
|
4101 /* Always do Java. */
|
|
442
|
4102 static void
|
|
428
|
4103 Cjava_entries (inf)
|
|
|
4104 FILE *inf;
|
|
|
4105 {
|
|
|
4106 C_entries (C_JAVA, inf);
|
|
|
4107 }
|
|
|
4108
|
|
|
4109 /* Always do C*. */
|
|
442
|
4110 static void
|
|
428
|
4111 Cstar_entries (inf)
|
|
|
4112 FILE *inf;
|
|
|
4113 {
|
|
|
4114 C_entries (C_STAR, inf);
|
|
|
4115 }
|
|
|
4116
|
|
|
4117 /* Always do Yacc. */
|
|
442
|
4118 static void
|
|
428
|
4119 Yacc_entries (inf)
|
|
|
4120 FILE *inf;
|
|
|
4121 {
|
|
|
4122 C_entries (YACC, inf);
|
|
|
4123 }
|
|
458
|
4124
|
|
428
|
4125
|
|
709
|
4126 /* Useful macros. */
|
|
428
|
4127 #define LOOP_ON_INPUT_LINES(file_pointer, line_buffer, char_pointer) \
|
|
2225
|
4128 for (; /* loop initialization */ \
|
|
428
|
4129 !feof (file_pointer) /* loop test */ \
|
|
2225
|
4130 && /* instructions at start of loop */ \
|
|
|
4131 (readline (&line_buffer, file_pointer), \
|
|
|
4132 char_pointer = line_buffer.buffer, \
|
|
428
|
4133 TRUE); \
|
|
|
4134 )
|
|
2554
|
4135
|
|
|
4136 #define LOOKING_AT(cp, kw) /* kw is the keyword, a literal string */ \
|
|
|
4137 ((assert("" kw), TRUE) /* syntax error if not a literal string */ \
|
|
|
4138 && strneq ((cp), kw, sizeof(kw)-1) /* cp points at kw */ \
|
|
|
4139 && notinname ((cp)[sizeof(kw)-1]) /* end of kw */ \
|
|
|
4140 && ((cp) = skip_spaces((cp)+sizeof(kw)-1))) /* skip spaces */
|
|
|
4141
|
|
|
4142 /* Similar to LOOKING_AT but does not use notinname, does not skip */
|
|
|
4143 #define LOOKING_AT_NOCASE(cp, kw) /* the keyword is a literal string */ \
|
|
|
4144 ((assert("" kw), TRUE) /* syntax error if not a literal string */ \
|
|
|
4145 && strncaseeq ((cp), kw, sizeof(kw)-1) /* cp points at kw */ \
|
|
|
4146 && ((cp) += sizeof(kw)-1)) /* skip spaces */
|
|
428
|
4147
|
|
|
4148 /*
|
|
|
4149 * Read a file, but do no processing. This is used to do regexp
|
|
|
4150 * matching on files that have no language defined.
|
|
|
4151 */
|
|
442
|
4152 static void
|
|
428
|
4153 just_read_file (inf)
|
|
|
4154 FILE *inf;
|
|
|
4155 {
|
|
|
4156 register char *dummy;
|
|
|
4157
|
|
|
4158 LOOP_ON_INPUT_LINES (inf, lb, dummy)
|
|
|
4159 continue;
|
|
|
4160 }
|
|
458
|
4161
|
|
428
|
4162
|
|
|
4163 /* Fortran parsing */
|
|
|
4164
|
|
2225
|
4165 static void F_takeprec __P((void));
|
|
|
4166 static void F_getit __P((FILE *));
|
|
428
|
4167
|
|
442
|
4168 static void
|
|
2225
|
4169 F_takeprec ()
|
|
428
|
4170 {
|
|
|
4171 dbp = skip_spaces (dbp);
|
|
|
4172 if (*dbp != '*')
|
|
|
4173 return;
|
|
|
4174 dbp++;
|
|
|
4175 dbp = skip_spaces (dbp);
|
|
|
4176 if (strneq (dbp, "(*)", 3))
|
|
|
4177 {
|
|
|
4178 dbp += 3;
|
|
|
4179 return;
|
|
|
4180 }
|
|
458
|
4181 if (!ISDIGIT (*dbp))
|
|
428
|
4182 {
|
|
|
4183 --dbp; /* force failure */
|
|
|
4184 return;
|
|
|
4185 }
|
|
|
4186 do
|
|
|
4187 dbp++;
|
|
458
|
4188 while (ISDIGIT (*dbp));
|
|
428
|
4189 }
|
|
|
4190
|
|
|
4191 static void
|
|
2225
|
4192 F_getit (inf)
|
|
428
|
4193 FILE *inf;
|
|
|
4194 {
|
|
|
4195 register char *cp;
|
|
|
4196
|
|
|
4197 dbp = skip_spaces (dbp);
|
|
|
4198 if (*dbp == '\0')
|
|
|
4199 {
|
|
2225
|
4200 readline (&lb, inf);
|
|
428
|
4201 dbp = lb.buffer;
|
|
|
4202 if (dbp[5] != '&')
|
|
|
4203 return;
|
|
|
4204 dbp += 6;
|
|
|
4205 dbp = skip_spaces (dbp);
|
|
|
4206 }
|
|
458
|
4207 if (!ISALPHA (*dbp) && *dbp != '_' && *dbp != '$')
|
|
428
|
4208 return;
|
|
|
4209 for (cp = dbp + 1; *cp != '\0' && intoken (*cp); cp++)
|
|
|
4210 continue;
|
|
2225
|
4211 make_tag (dbp, cp-dbp, TRUE,
|
|
|
4212 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
428
|
4213 }
|
|
|
4214
|
|
|
4215
|
|
442
|
4216 static void
|
|
428
|
4217 Fortran_functions (inf)
|
|
|
4218 FILE *inf;
|
|
|
4219 {
|
|
|
4220 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
|
4221 {
|
|
|
4222 if (*dbp == '%')
|
|
|
4223 dbp++; /* Ratfor escape to fortran */
|
|
|
4224 dbp = skip_spaces (dbp);
|
|
|
4225 if (*dbp == '\0')
|
|
|
4226 continue;
|
|
|
4227 switch (lowcase (*dbp))
|
|
|
4228 {
|
|
|
4229 case 'i':
|
|
2225
|
4230 if (nocase_tail ("integer"))
|
|
|
4231 F_takeprec ();
|
|
428
|
4232 break;
|
|
|
4233 case 'r':
|
|
2225
|
4234 if (nocase_tail ("real"))
|
|
|
4235 F_takeprec ();
|
|
428
|
4236 break;
|
|
|
4237 case 'l':
|
|
2225
|
4238 if (nocase_tail ("logical"))
|
|
|
4239 F_takeprec ();
|
|
428
|
4240 break;
|
|
|
4241 case 'c':
|
|
2225
|
4242 if (nocase_tail ("complex") || nocase_tail ("character"))
|
|
|
4243 F_takeprec ();
|
|
428
|
4244 break;
|
|
|
4245 case 'd':
|
|
2225
|
4246 if (nocase_tail ("double"))
|
|
428
|
4247 {
|
|
|
4248 dbp = skip_spaces (dbp);
|
|
|
4249 if (*dbp == '\0')
|
|
|
4250 continue;
|
|
2225
|
4251 if (nocase_tail ("precision"))
|
|
428
|
4252 break;
|
|
|
4253 continue;
|
|
|
4254 }
|
|
|
4255 break;
|
|
|
4256 }
|
|
|
4257 dbp = skip_spaces (dbp);
|
|
|
4258 if (*dbp == '\0')
|
|
|
4259 continue;
|
|
|
4260 switch (lowcase (*dbp))
|
|
|
4261 {
|
|
|
4262 case 'f':
|
|
2225
|
4263 if (nocase_tail ("function"))
|
|
|
4264 F_getit (inf);
|
|
428
|
4265 continue;
|
|
|
4266 case 's':
|
|
2225
|
4267 if (nocase_tail ("subroutine"))
|
|
|
4268 F_getit (inf);
|
|
428
|
4269 continue;
|
|
|
4270 case 'e':
|
|
2225
|
4271 if (nocase_tail ("entry"))
|
|
|
4272 F_getit (inf);
|
|
428
|
4273 continue;
|
|
|
4274 case 'b':
|
|
2225
|
4275 if (nocase_tail ("blockdata") || nocase_tail ("block data"))
|
|
428
|
4276 {
|
|
|
4277 dbp = skip_spaces (dbp);
|
|
|
4278 if (*dbp == '\0') /* assume un-named */
|
|
2225
|
4279 make_tag ("blockdata", 9, TRUE,
|
|
|
4280 lb.buffer, dbp - lb.buffer, lineno, linecharno);
|
|
428
|
4281 else
|
|
2225
|
4282 F_getit (inf); /* look for name */
|
|
428
|
4283 }
|
|
|
4284 continue;
|
|
|
4285 }
|
|
|
4286 }
|
|
|
4287 }
|
|
458
|
4288
|
|
428
|
4289
|
|
|
4290 /*
|
|
|
4291 * Ada parsing
|
|
2225
|
4292 * Original code by
|
|
|
4293 * Philippe Waroquiers (1998)
|
|
428
|
4294 */
|
|
442
|
4295
|
|
2225
|
4296 static void Ada_getit __P((FILE *, char *));
|
|
442
|
4297
|
|
428
|
4298 /* Once we are positioned after an "interesting" keyword, let's get
|
|
|
4299 the real tag value necessary. */
|
|
|
4300 static void
|
|
2225
|
4301 Ada_getit (inf, name_qualifier)
|
|
428
|
4302 FILE *inf;
|
|
|
4303 char *name_qualifier;
|
|
|
4304 {
|
|
|
4305 register char *cp;
|
|
|
4306 char *name;
|
|
|
4307 char c;
|
|
|
4308
|
|
|
4309 while (!feof (inf))
|
|
|
4310 {
|
|
|
4311 dbp = skip_spaces (dbp);
|
|
|
4312 if (*dbp == '\0'
|
|
|
4313 || (dbp[0] == '-' && dbp[1] == '-'))
|
|
|
4314 {
|
|
2225
|
4315 readline (&lb, inf);
|
|
428
|
4316 dbp = lb.buffer;
|
|
|
4317 }
|
|
2225
|
4318 switch (lowcase(*dbp))
|
|
428
|
4319 {
|
|
|
4320 case 'b':
|
|
2225
|
4321 if (nocase_tail ("body"))
|
|
428
|
4322 {
|
|
|
4323 /* Skipping body of procedure body or package body or ....
|
|
|
4324 resetting qualifier to body instead of spec. */
|
|
|
4325 name_qualifier = "/b";
|
|
|
4326 continue;
|
|
|
4327 }
|
|
|
4328 break;
|
|
|
4329 case 't':
|
|
|
4330 /* Skipping type of task type or protected type ... */
|
|
2225
|
4331 if (nocase_tail ("type"))
|
|
428
|
4332 continue;
|
|
|
4333 break;
|
|
|
4334 }
|
|
|
4335 if (*dbp == '"')
|
|
|
4336 {
|
|
|
4337 dbp += 1;
|
|
|
4338 for (cp = dbp; *cp != '\0' && *cp != '"'; cp++)
|
|
|
4339 continue;
|
|
|
4340 }
|
|
|
4341 else
|
|
|
4342 {
|
|
|
4343 dbp = skip_spaces (dbp);
|
|
|
4344 for (cp = dbp;
|
|
|
4345 (*cp != '\0'
|
|
458
|
4346 && (ISALPHA (*cp) || ISDIGIT (*cp) || *cp == '_' || *cp == '.'));
|
|
428
|
4347 cp++)
|
|
|
4348 continue;
|
|
|
4349 if (cp == dbp)
|
|
|
4350 return;
|
|
|
4351 }
|
|
|
4352 c = *cp;
|
|
|
4353 *cp = '\0';
|
|
|
4354 name = concat (dbp, name_qualifier, "");
|
|
|
4355 *cp = c;
|
|
2225
|
4356 make_tag (name, strlen (name), TRUE,
|
|
|
4357 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
4358 free (name);
|
|
428
|
4359 if (c == '"')
|
|
|
4360 dbp = cp + 1;
|
|
|
4361 return;
|
|
|
4362 }
|
|
|
4363 }
|
|
|
4364
|
|
442
|
4365 static void
|
|
428
|
4366 Ada_funcs (inf)
|
|
|
4367 FILE *inf;
|
|
|
4368 {
|
|
|
4369 bool inquote = FALSE;
|
|
2225
|
4370 bool skip_till_semicolumn = FALSE;
|
|
428
|
4371
|
|
|
4372 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
|
4373 {
|
|
|
4374 while (*dbp != '\0')
|
|
|
4375 {
|
|
|
4376 /* Skip a string i.e. "abcd". */
|
|
|
4377 if (inquote || (*dbp == '"'))
|
|
|
4378 {
|
|
|
4379 dbp = etags_strchr ((inquote) ? dbp : dbp+1, '"');
|
|
|
4380 if (dbp != NULL)
|
|
|
4381 {
|
|
|
4382 inquote = FALSE;
|
|
|
4383 dbp += 1;
|
|
|
4384 continue; /* advance char */
|
|
|
4385 }
|
|
|
4386 else
|
|
|
4387 {
|
|
|
4388 inquote = TRUE;
|
|
|
4389 break; /* advance line */
|
|
|
4390 }
|
|
|
4391 }
|
|
|
4392
|
|
|
4393 /* Skip comments. */
|
|
|
4394 if (dbp[0] == '-' && dbp[1] == '-')
|
|
|
4395 break; /* advance line */
|
|
|
4396
|
|
|
4397 /* Skip character enclosed in single quote i.e. 'a'
|
|
|
4398 and skip single quote starting an attribute i.e. 'Image. */
|
|
|
4399 if (*dbp == '\'')
|
|
|
4400 {
|
|
|
4401 dbp++ ;
|
|
|
4402 if (*dbp != '\0')
|
|
|
4403 dbp++;
|
|
|
4404 continue;
|
|
|
4405 }
|
|
|
4406
|
|
2225
|
4407 if (skip_till_semicolumn)
|
|
|
4408 {
|
|
|
4409 if (*dbp == ';')
|
|
|
4410 skip_till_semicolumn = FALSE;
|
|
|
4411 dbp++;
|
|
|
4412 continue; /* advance char */
|
|
|
4413 }
|
|
|
4414
|
|
428
|
4415 /* Search for beginning of a token. */
|
|
|
4416 if (!begtoken (*dbp))
|
|
|
4417 {
|
|
|
4418 dbp++;
|
|
|
4419 continue; /* advance char */
|
|
|
4420 }
|
|
|
4421
|
|
|
4422 /* We are at the beginning of a token. */
|
|
2225
|
4423 switch (lowcase(*dbp))
|
|
428
|
4424 {
|
|
|
4425 case 'f':
|
|
2225
|
4426 if (!packages_only && nocase_tail ("function"))
|
|
|
4427 Ada_getit (inf, "/f");
|
|
428
|
4428 else
|
|
|
4429 break; /* from switch */
|
|
|
4430 continue; /* advance char */
|
|
|
4431 case 'p':
|
|
2225
|
4432 if (!packages_only && nocase_tail ("procedure"))
|
|
|
4433 Ada_getit (inf, "/p");
|
|
|
4434 else if (nocase_tail ("package"))
|
|
|
4435 Ada_getit (inf, "/s");
|
|
|
4436 else if (nocase_tail ("protected")) /* protected type */
|
|
|
4437 Ada_getit (inf, "/t");
|
|
428
|
4438 else
|
|
|
4439 break; /* from switch */
|
|
|
4440 continue; /* advance char */
|
|
2225
|
4441
|
|
|
4442 case 'u':
|
|
|
4443 if (typedefs && !packages_only && nocase_tail ("use"))
|
|
|
4444 {
|
|
|
4445 /* when tagging types, avoid tagging use type Pack.Typename;
|
|
|
4446 for this, we will skip everything till a ; */
|
|
|
4447 skip_till_semicolumn = TRUE;
|
|
|
4448 continue; /* advance char */
|
|
|
4449 }
|
|
|
4450
|
|
428
|
4451 case 't':
|
|
2225
|
4452 if (!packages_only && nocase_tail ("task"))
|
|
|
4453 Ada_getit (inf, "/k");
|
|
|
4454 else if (typedefs && !packages_only && nocase_tail ("type"))
|
|
428
|
4455 {
|
|
2225
|
4456 Ada_getit (inf, "/t");
|
|
428
|
4457 while (*dbp != '\0')
|
|
|
4458 dbp += 1;
|
|
|
4459 }
|
|
|
4460 else
|
|
|
4461 break; /* from switch */
|
|
|
4462 continue; /* advance char */
|
|
|
4463 }
|
|
|
4464
|
|
|
4465 /* Look for the end of the token. */
|
|
|
4466 while (!endtoken (*dbp))
|
|
|
4467 dbp++;
|
|
|
4468
|
|
|
4469 } /* advance char */
|
|
|
4470 } /* advance line */
|
|
|
4471 }
|
|
458
|
4472
|
|
428
|
4473
|
|
|
4474 /*
|
|
|
4475 * Unix and microcontroller assembly tag handling
|
|
2225
|
4476 * Labels: /^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]/
|
|
|
4477 * Idea by Bob Weiner, Motorola Inc. (1994)
|
|
428
|
4478 */
|
|
442
|
4479 static void
|
|
428
|
4480 Asm_labels (inf)
|
|
|
4481 FILE *inf;
|
|
|
4482 {
|
|
|
4483 register char *cp;
|
|
|
4484
|
|
|
4485 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
4486 {
|
|
|
4487 /* If first char is alphabetic or one of [_.$], test for colon
|
|
|
4488 following identifier. */
|
|
458
|
4489 if (ISALPHA (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
|
|
428
|
4490 {
|
|
|
4491 /* Read past label. */
|
|
|
4492 cp++;
|
|
458
|
4493 while (ISALNUM (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
|
|
428
|
4494 cp++;
|
|
442
|
4495 if (*cp == ':' || iswhite (*cp))
|
|
2225
|
4496 /* Found end of label, so copy it and add it to the table. */
|
|
|
4497 make_tag (lb.buffer, cp - lb.buffer, TRUE,
|
|
428
|
4498 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
4499 }
|
|
|
4500 }
|
|
|
4501 }
|
|
458
|
4502
|
|
428
|
4503
|
|
|
4504 /*
|
|
458
|
4505 * Perl support
|
|
2225
|
4506 * Perl sub names: /^sub[ \t\n]+[^ \t\n{]+/
|
|
428
|
4507 * Perl variable names: /^(my|local).../
|
|
2225
|
4508 * Original code by Bart Robinson <lomew@cs.utah.edu> (1995)
|
|
|
4509 * Additions by Michael Ernst <mernst@alum.mit.edu> (1997)
|
|
|
4510 * Ideas by Kai Großjohann <Kai.Grossjohann@CS.Uni-Dortmund.DE> (2001)
|
|
428
|
4511 */
|
|
442
|
4512 static void
|
|
428
|
4513 Perl_functions (inf)
|
|
|
4514 FILE *inf;
|
|
|
4515 {
|
|
2225
|
4516 char *package = savestr ("main"); /* current package name */
|
|
428
|
4517 register char *cp;
|
|
|
4518
|
|
|
4519 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
4520 {
|
|
2225
|
4521 skip_spaces(cp);
|
|
|
4522
|
|
|
4523 if (LOOKING_AT (cp, "package"))
|
|
|
4524 {
|
|
|
4525 free (package);
|
|
|
4526 get_tag (cp, &package);
|
|
|
4527 }
|
|
|
4528 else if (LOOKING_AT (cp, "sub"))
|
|
428
|
4529 {
|
|
2225
|
4530 char *pos;
|
|
|
4531 char *sp = cp;
|
|
|
4532
|
|
|
4533 while (!notinname (*cp))
|
|
|
4534 cp++;
|
|
|
4535 if (cp == sp)
|
|
|
4536 continue; /* nothing found */
|
|
|
4537 if ((pos = etags_strchr (sp, ':')) != NULL
|
|
|
4538 && pos < cp && pos[1] == ':')
|
|
|
4539 /* The name is already qualified. */
|
|
|
4540 make_tag (sp, cp - sp, TRUE,
|
|
|
4541 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
4542 else
|
|
|
4543 /* Qualify it. */
|
|
|
4544 {
|
|
|
4545 char savechar, *name;
|
|
|
4546
|
|
|
4547 savechar = *cp;
|
|
|
4548 *cp = '\0';
|
|
|
4549 name = concat (package, "::", sp);
|
|
|
4550 *cp = savechar;
|
|
|
4551 make_tag (name, strlen(name), TRUE,
|
|
|
4552 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
4553 free (name);
|
|
|
4554 }
|
|
428
|
4555 }
|
|
2225
|
4556 else if (globals) /* only if we are tagging global vars */
|
|
428
|
4557 {
|
|
2225
|
4558 /* Skip a qualifier, if any. */
|
|
|
4559 bool qual = LOOKING_AT (cp, "my") || LOOKING_AT (cp, "local");
|
|
428
|
4560 /* After "my" or "local", but before any following paren or space. */
|
|
2225
|
4561 char *varstart = cp;
|
|
|
4562
|
|
|
4563 if (qual /* should this be removed? If yes, how? */
|
|
|
4564 && (*cp == '$' || *cp == '@' || *cp == '%'))
|
|
428
|
4565 {
|
|
2225
|
4566 varstart += 1;
|
|
|
4567 do
|
|
428
|
4568 cp++;
|
|
2225
|
4569 while (ISALNUM (*cp) || *cp == '_');
|
|
428
|
4570 }
|
|
2225
|
4571 else if (qual)
|
|
428
|
4572 {
|
|
|
4573 /* Should be examining a variable list at this point;
|
|
|
4574 could insist on seeing an open parenthesis. */
|
|
|
4575 while (*cp != '\0' && *cp != ';' && *cp != '=' && *cp != ')')
|
|
|
4576 cp++;
|
|
|
4577 }
|
|
2225
|
4578 else
|
|
|
4579 continue;
|
|
|
4580
|
|
|
4581 make_tag (varstart, cp - varstart, FALSE,
|
|
|
4582 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
428
|
4583 }
|
|
|
4584 }
|
|
3517
|
4585 free (package);
|
|
428
|
4586 }
|
|
458
|
4587
|
|
709
|
4588
|
|
428
|
4589 /*
|
|
458
|
4590 * Python support
|
|
2225
|
4591 * Look for /^[\t]*def[ \t\n]+[^ \t\n(:]+/ or /^class[ \t\n]+[^ \t\n(:]+/
|
|
|
4592 * Idea by Eric S. Raymond <esr@thyrsus.com> (1997)
|
|
|
4593 * More ideas by seb bacon <seb@jamkit.com> (2002)
|
|
428
|
4594 */
|
|
442
|
4595 static void
|
|
428
|
4596 Python_functions (inf)
|
|
|
4597 FILE *inf;
|
|
|
4598 {
|
|
|
4599 register char *cp;
|
|
|
4600
|
|
|
4601 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
2225
|
4602 {
|
|
|
4603 cp = skip_spaces (cp);
|
|
|
4604 if (LOOKING_AT (cp, "def") || LOOKING_AT (cp, "class"))
|
|
|
4605 {
|
|
|
4606 char *name = cp;
|
|
|
4607 while (!notinname (*cp) && *cp != ':')
|
|
|
4608 cp++;
|
|
|
4609 make_tag (name, cp - name, TRUE,
|
|
|
4610 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
4611 }
|
|
|
4612 }
|
|
709
|
4613 }
|
|
|
4614
|
|
|
4615
|
|
|
4616 /*
|
|
|
4617 * PHP support
|
|
|
4618 * Look for:
|
|
|
4619 * - /^[ \t]*function[ \t\n]+[^ \t\n(]+/
|
|
|
4620 * - /^[ \t]*class[ \t\n]+[^ \t\n]+/
|
|
|
4621 * - /^[ \t]*define\(\"[^\"]+/
|
|
|
4622 * Only with --members:
|
|
|
4623 * - /^[ \t]*var[ \t\n]+\$[^ \t\n=;]/
|
|
2225
|
4624 * Idea by Diez B. Roggisch (2001)
|
|
709
|
4625 */
|
|
|
4626 static void
|
|
|
4627 PHP_functions (inf)
|
|
|
4628 FILE *inf;
|
|
|
4629 {
|
|
2225
|
4630 register char *cp, *name;
|
|
709
|
4631 bool search_identifier = FALSE;
|
|
|
4632
|
|
|
4633 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
428
|
4634 {
|
|
709
|
4635 cp = skip_spaces (cp);
|
|
2225
|
4636 name = cp;
|
|
709
|
4637 if (search_identifier
|
|
|
4638 && *cp != '\0')
|
|
428
|
4639 {
|
|
2225
|
4640 while (!notinname (*cp))
|
|
428
|
4641 cp++;
|
|
2225
|
4642 make_tag (name, cp - name, TRUE,
|
|
|
4643 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
709
|
4644 search_identifier = FALSE;
|
|
428
|
4645 }
|
|
709
|
4646 else if (LOOKING_AT (cp, "function"))
|
|
|
4647 {
|
|
|
4648 if(*cp == '&')
|
|
|
4649 cp = skip_spaces (cp+1);
|
|
|
4650 if(*cp != '\0')
|
|
|
4651 {
|
|
2225
|
4652 name = cp;
|
|
|
4653 while (!notinname (*cp))
|
|
709
|
4654 cp++;
|
|
2225
|
4655 make_tag (name, cp - name, TRUE,
|
|
|
4656 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
709
|
4657 }
|
|
|
4658 else
|
|
|
4659 search_identifier = TRUE;
|
|
|
4660 }
|
|
|
4661 else if (LOOKING_AT (cp, "class"))
|
|
428
|
4662 {
|
|
709
|
4663 if (*cp != '\0')
|
|
|
4664 {
|
|
2225
|
4665 name = cp;
|
|
709
|
4666 while (*cp != '\0' && !iswhite (*cp))
|
|
|
4667 cp++;
|
|
2225
|
4668 make_tag (name, cp - name, FALSE,
|
|
|
4669 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
709
|
4670 }
|
|
|
4671 else
|
|
|
4672 search_identifier = TRUE;
|
|
|
4673 }
|
|
|
4674 else if (strneq (cp, "define", 6)
|
|
|
4675 && (cp = skip_spaces (cp+6))
|
|
|
4676 && *cp++ == '('
|
|
|
4677 && (*cp == '"' || *cp == '\''))
|
|
|
4678 {
|
|
|
4679 char quote = *cp++;
|
|
2225
|
4680 name = cp;
|
|
709
|
4681 while (*cp != quote && *cp != '\0')
|
|
428
|
4682 cp++;
|
|
2225
|
4683 make_tag (name, cp - name, FALSE,
|
|
|
4684 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
709
|
4685 }
|
|
|
4686 else if (members
|
|
|
4687 && LOOKING_AT (cp, "var")
|
|
|
4688 && *cp == '$')
|
|
|
4689 {
|
|
2225
|
4690 name = cp;
|
|
|
4691 while (!notinname(*cp))
|
|
709
|
4692 cp++;
|
|
2225
|
4693 make_tag (name, cp - name, FALSE,
|
|
|
4694 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
428
|
4695 }
|
|
|
4696 }
|
|
|
4697 }
|
|
458
|
4698
|
|
428
|
4699
|
|
2225
|
4700 /*
|
|
428
|
4701 * Cobol tag functions
|
|
|
4702 * We could look for anything that could be a paragraph name.
|
|
|
4703 * i.e. anything that starts in column 8 is one word and ends in a full stop.
|
|
2225
|
4704 * Idea by Corny de Souza (1993)
|
|
428
|
4705 */
|
|
442
|
4706 static void
|
|
428
|
4707 Cobol_paragraphs (inf)
|
|
|
4708 FILE *inf;
|
|
|
4709 {
|
|
|
4710 register char *bp, *ep;
|
|
|
4711
|
|
|
4712 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
4713 {
|
|
|
4714 if (lb.len < 9)
|
|
|
4715 continue;
|
|
|
4716 bp += 8;
|
|
|
4717
|
|
|
4718 /* If eoln, compiler option or comment ignore whole line. */
|
|
458
|
4719 if (bp[-1] != ' ' || !ISALNUM (bp[0]))
|
|
428
|
4720 continue;
|
|
|
4721
|
|
458
|
4722 for (ep = bp; ISALNUM (*ep) || *ep == '-'; ep++)
|
|
428
|
4723 continue;
|
|
|
4724 if (*ep++ == '.')
|
|
2225
|
4725 make_tag (bp, ep - bp, TRUE,
|
|
|
4726 lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
|
|
428
|
4727 }
|
|
|
4728 }
|
|
458
|
4729
|
|
|
4730
|
|
|
4731 /*
|
|
|
4732 * Makefile support
|
|
2225
|
4733 * Ideas by Assar Westerlund <assar@sics.se> (2001)
|
|
458
|
4734 */
|
|
|
4735 static void
|
|
|
4736 Makefile_targets (inf)
|
|
|
4737 FILE *inf;
|
|
|
4738 {
|
|
|
4739 register char *bp;
|
|
|
4740
|
|
|
4741 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
4742 {
|
|
|
4743 if (*bp == '\t' || *bp == '#')
|
|
|
4744 continue;
|
|
|
4745 while (*bp != '\0' && *bp != '=' && *bp != ':')
|
|
|
4746 bp++;
|
|
2225
|
4747 if (*bp == ':' || (globals && *bp == '='))
|
|
3876
|
4748 {
|
|
|
4749 /* We should detect if there is more than one tag, but we do not.
|
|
|
4750 We just skip initial and final spaces. */
|
|
|
4751 char * namestart = skip_spaces (lb.buffer);
|
|
|
4752 while (--bp > namestart)
|
|
|
4753 if (!notinname (*bp))
|
|
|
4754 break;
|
|
|
4755 make_tag (namestart, bp - namestart + 1, TRUE,
|
|
|
4756 lb.buffer, bp - lb.buffer + 2, lineno, linecharno);
|
|
|
4757 }
|
|
458
|
4758 }
|
|
|
4759 }
|
|
|
4760
|
|
428
|
4761
|
|
|
4762 /*
|
|
2225
|
4763 * Pascal parsing
|
|
|
4764 * Original code by Mosur K. Mohan (1989)
|
|
|
4765 *
|
|
428
|
4766 * Locates tags for procedures & functions. Doesn't do any type- or
|
|
|
4767 * var-definitions. It does look for the keyword "extern" or
|
|
|
4768 * "forward" immediately following the procedure statement; if found,
|
|
|
4769 * the tag is skipped.
|
|
|
4770 */
|
|
442
|
4771 static void
|
|
428
|
4772 Pascal_functions (inf)
|
|
|
4773 FILE *inf;
|
|
|
4774 {
|
|
|
4775 linebuffer tline; /* mostly copied from C_entries */
|
|
|
4776 long save_lcno;
|
|
2225
|
4777 int save_lineno, namelen, taglen;
|
|
|
4778 char c, *name;
|
|
428
|
4779
|
|
|
4780 bool /* each of these flags is TRUE iff: */
|
|
|
4781 incomment, /* point is inside a comment */
|
|
|
4782 inquote, /* point is inside '..' string */
|
|
|
4783 get_tagname, /* point is after PROCEDURE/FUNCTION
|
|
|
4784 keyword, so next item = potential tag */
|
|
|
4785 found_tag, /* point is after a potential tag */
|
|
|
4786 inparms, /* point is within parameter-list */
|
|
|
4787 verify_tag; /* point has passed the parm-list, so the
|
|
|
4788 next token will determine whether this
|
|
|
4789 is a FORWARD/EXTERN to be ignored, or
|
|
|
4790 whether it is a real tag */
|
|
|
4791
|
|
2225
|
4792 save_lcno = save_lineno = namelen = taglen = 0; /* keep compiler quiet */
|
|
|
4793 name = NULL; /* keep compiler quiet */
|
|
428
|
4794 dbp = lb.buffer;
|
|
|
4795 *dbp = '\0';
|
|
2225
|
4796 linebuffer_init (&tline);
|
|
428
|
4797
|
|
|
4798 incomment = inquote = FALSE;
|
|
|
4799 found_tag = FALSE; /* have a proc name; check if extern */
|
|
2225
|
4800 get_tagname = FALSE; /* found "procedure" keyword */
|
|
428
|
4801 inparms = FALSE; /* found '(' after "proc" */
|
|
|
4802 verify_tag = FALSE; /* check if "extern" is ahead */
|
|
|
4803
|
|
|
4804
|
|
|
4805 while (!feof (inf)) /* long main loop to get next char */
|
|
|
4806 {
|
|
|
4807 c = *dbp++;
|
|
|
4808 if (c == '\0') /* if end of line */
|
|
|
4809 {
|
|
2225
|
4810 readline (&lb, inf);
|
|
428
|
4811 dbp = lb.buffer;
|
|
|
4812 if (*dbp == '\0')
|
|
|
4813 continue;
|
|
|
4814 if (!((found_tag && verify_tag)
|
|
|
4815 || get_tagname))
|
|
|
4816 c = *dbp++; /* only if don't need *dbp pointing
|
|
|
4817 to the beginning of the name of
|
|
|
4818 the procedure or function */
|
|
|
4819 }
|
|
|
4820 if (incomment)
|
|
|
4821 {
|
|
|
4822 if (c == '}') /* within { } comments */
|
|
|
4823 incomment = FALSE;
|
|
|
4824 else if (c == '*' && *dbp == ')') /* within (* *) comments */
|
|
|
4825 {
|
|
|
4826 dbp++;
|
|
|
4827 incomment = FALSE;
|
|
|
4828 }
|
|
|
4829 continue;
|
|
|
4830 }
|
|
|
4831 else if (inquote)
|
|
|
4832 {
|
|
|
4833 if (c == '\'')
|
|
|
4834 inquote = FALSE;
|
|
|
4835 continue;
|
|
|
4836 }
|
|
|
4837 else
|
|
|
4838 switch (c)
|
|
|
4839 {
|
|
|
4840 case '\'':
|
|
|
4841 inquote = TRUE; /* found first quote */
|
|
|
4842 continue;
|
|
|
4843 case '{': /* found open { comment */
|
|
|
4844 incomment = TRUE;
|
|
|
4845 continue;
|
|
|
4846 case '(':
|
|
|
4847 if (*dbp == '*') /* found open (* comment */
|
|
|
4848 {
|
|
|
4849 incomment = TRUE;
|
|
|
4850 dbp++;
|
|
|
4851 }
|
|
|
4852 else if (found_tag) /* found '(' after tag, i.e., parm-list */
|
|
|
4853 inparms = TRUE;
|
|
|
4854 continue;
|
|
|
4855 case ')': /* end of parms list */
|
|
|
4856 if (inparms)
|
|
|
4857 inparms = FALSE;
|
|
|
4858 continue;
|
|
|
4859 case ';':
|
|
|
4860 if (found_tag && !inparms) /* end of proc or fn stmt */
|
|
|
4861 {
|
|
|
4862 verify_tag = TRUE;
|
|
|
4863 break;
|
|
|
4864 }
|
|
|
4865 continue;
|
|
|
4866 }
|
|
|
4867 if (found_tag && verify_tag && (*dbp != ' '))
|
|
|
4868 {
|
|
2225
|
4869 /* Check if this is an "extern" declaration. */
|
|
428
|
4870 if (*dbp == '\0')
|
|
|
4871 continue;
|
|
|
4872 if (lowcase (*dbp == 'e'))
|
|
|
4873 {
|
|
2225
|
4874 if (nocase_tail ("extern")) /* superfluous, really! */
|
|
428
|
4875 {
|
|
|
4876 found_tag = FALSE;
|
|
|
4877 verify_tag = FALSE;
|
|
|
4878 }
|
|
|
4879 }
|
|
|
4880 else if (lowcase (*dbp) == 'f')
|
|
|
4881 {
|
|
2225
|
4882 if (nocase_tail ("forward")) /* check for forward reference */
|
|
428
|
4883 {
|
|
|
4884 found_tag = FALSE;
|
|
|
4885 verify_tag = FALSE;
|
|
|
4886 }
|
|
|
4887 }
|
|
|
4888 if (found_tag && verify_tag) /* not external proc, so make tag */
|
|
|
4889 {
|
|
|
4890 found_tag = FALSE;
|
|
|
4891 verify_tag = FALSE;
|
|
2225
|
4892 make_tag (name, namelen, TRUE,
|
|
|
4893 tline.buffer, taglen, save_lineno, save_lcno);
|
|
428
|
4894 continue;
|
|
|
4895 }
|
|
|
4896 }
|
|
|
4897 if (get_tagname) /* grab name of proc or fn */
|
|
|
4898 {
|
|
2225
|
4899 char *cp;
|
|
|
4900
|
|
428
|
4901 if (*dbp == '\0')
|
|
|
4902 continue;
|
|
|
4903
|
|
2225
|
4904 /* Find block name. */
|
|
|
4905 for (cp = dbp + 1; *cp != '\0' && !endtoken (*cp); cp++)
|
|
|
4906 continue;
|
|
|
4907
|
|
|
4908 /* Save all values for later tagging. */
|
|
458
|
4909 linebuffer_setlen (&tline, lb.len);
|
|
428
|
4910 strcpy (tline.buffer, lb.buffer);
|
|
|
4911 save_lineno = lineno;
|
|
|
4912 save_lcno = linecharno;
|
|
2225
|
4913 name = tline.buffer + (dbp - lb.buffer);
|
|
|
4914 namelen = cp - dbp;
|
|
|
4915 taglen = cp - lb.buffer + 1;
|
|
|
4916
|
|
428
|
4917 dbp = cp; /* set dbp to e-o-token */
|
|
|
4918 get_tagname = FALSE;
|
|
|
4919 found_tag = TRUE;
|
|
|
4920 continue;
|
|
|
4921
|
|
2225
|
4922 /* And proceed to check for "extern". */
|
|
428
|
4923 }
|
|
|
4924 else if (!incomment && !inquote && !found_tag)
|
|
|
4925 {
|
|
2225
|
4926 /* Check for proc/fn keywords. */
|
|
428
|
4927 switch (lowcase (c))
|
|
|
4928 {
|
|
|
4929 case 'p':
|
|
2225
|
4930 if (nocase_tail ("rocedure")) /* c = 'p', dbp has advanced */
|
|
428
|
4931 get_tagname = TRUE;
|
|
|
4932 continue;
|
|
|
4933 case 'f':
|
|
2225
|
4934 if (nocase_tail ("unction"))
|
|
428
|
4935 get_tagname = TRUE;
|
|
|
4936 continue;
|
|
|
4937 }
|
|
|
4938 }
|
|
2225
|
4939 } /* while not eof */
|
|
428
|
4940
|
|
|
4941 free (tline.buffer);
|
|
|
4942 }
|
|
458
|
4943
|
|
428
|
4944
|
|
|
4945 /*
|
|
458
|
4946 * Lisp tag functions
|
|
428
|
4947 * look for (def or (DEF, quote or QUOTE
|
|
|
4948 */
|
|
442
|
4949
|
|
709
|
4950 static void L_getit __P((void));
|
|
442
|
4951
|
|
428
|
4952 static void
|
|
|
4953 L_getit ()
|
|
|
4954 {
|
|
|
4955 if (*dbp == '\'') /* Skip prefix quote */
|
|
|
4956 dbp++;
|
|
|
4957 else if (*dbp == '(')
|
|
|
4958 {
|
|
2225
|
4959 dbp++;
|
|
|
4960 /* Try to skip "(quote " */
|
|
|
4961 if (!LOOKING_AT (dbp, "quote") && !LOOKING_AT (dbp, "QUOTE"))
|
|
|
4962 /* Ok, then skip "(" before name in (defstruct (foo)) */
|
|
|
4963 dbp = skip_spaces (dbp);
|
|
428
|
4964 }
|
|
2225
|
4965 get_tag (dbp, NULL);
|
|
428
|
4966 }
|
|
|
4967
|
|
442
|
4968 static void
|
|
428
|
4969 Lisp_functions (inf)
|
|
|
4970 FILE *inf;
|
|
|
4971 {
|
|
|
4972 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
|
4973 {
|
|
2225
|
4974 if (dbp[0] != '(')
|
|
|
4975 continue;
|
|
|
4976
|
|
|
4977 if (strneq (dbp+1, "def", 3) || strneq (dbp+1, "DEF", 3))
|
|
428
|
4978 {
|
|
2225
|
4979 dbp = skip_non_spaces (dbp);
|
|
|
4980 dbp = skip_spaces (dbp);
|
|
|
4981 L_getit ();
|
|
|
4982 }
|
|
|
4983 else
|
|
|
4984 {
|
|
|
4985 /* Check for (foo::defmumble name-defined ... */
|
|
|
4986 do
|
|
|
4987 dbp++;
|
|
|
4988 while (!notinname (*dbp) && *dbp != ':');
|
|
|
4989 if (*dbp == ':')
|
|
428
|
4990 {
|
|
|
4991 do
|
|
|
4992 dbp++;
|
|
2225
|
4993 while (*dbp == ':');
|
|
|
4994
|
|
|
4995 if (strneq (dbp, "def", 3) || strneq (dbp, "DEF", 3))
|
|
428
|
4996 {
|
|
2225
|
4997 dbp = skip_non_spaces (dbp);
|
|
|
4998 dbp = skip_spaces (dbp);
|
|
|
4999 L_getit ();
|
|
428
|
5000 }
|
|
|
5001 }
|
|
|
5002 }
|
|
|
5003 }
|
|
|
5004 }
|
|
458
|
5005
|
|
428
|
5006
|
|
|
5007 /*
|
|
2325
|
5008 * Lua script language parsing
|
|
|
5009 * Original code by David A. Capello <dacap@users.sourceforge.net> (2004)
|
|
|
5010 *
|
|
|
5011 * "function" and "local function" are tags if they start at column 1.
|
|
|
5012 */
|
|
|
5013 static void
|
|
|
5014 Lua_functions (inf)
|
|
|
5015 FILE *inf;
|
|
|
5016 {
|
|
|
5017 register char *bp;
|
|
|
5018
|
|
|
5019 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
5020 {
|
|
|
5021 if (bp[0] != 'f' && bp[0] != 'l')
|
|
|
5022 continue;
|
|
|
5023
|
|
3876
|
5024 (void)LOOKING_AT (bp, "local"); /* skip possible "local" */
|
|
2325
|
5025
|
|
|
5026 if (LOOKING_AT (bp, "function"))
|
|
|
5027 get_tag (bp, NULL);
|
|
|
5028 }
|
|
|
5029 }
|
|
|
5030
|
|
|
5031
|
|
|
5032 /*
|
|
2554
|
5033 * Postscript tags
|
|
428
|
5034 * Just look for lines where the first character is '/'
|
|
|
5035 * Also look at "defineps" for PSWrap
|
|
2225
|
5036 * Ideas by:
|
|
|
5037 * Richard Mlynarik <mly@adoc.xerox.com> (1997)
|
|
|
5038 * Masatake Yamato <masata-y@is.aist-nara.ac.jp> (1999)
|
|
428
|
5039 */
|
|
442
|
5040 static void
|
|
2225
|
5041 PS_functions (inf)
|
|
428
|
5042 FILE *inf;
|
|
|
5043 {
|
|
|
5044 register char *bp, *ep;
|
|
|
5045
|
|
|
5046 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
5047 {
|
|
|
5048 if (bp[0] == '/')
|
|
|
5049 {
|
|
|
5050 for (ep = bp+1;
|
|
|
5051 *ep != '\0' && *ep != ' ' && *ep != '{';
|
|
|
5052 ep++)
|
|
|
5053 continue;
|
|
2225
|
5054 make_tag (bp, ep - bp, TRUE,
|
|
|
5055 lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
|
|
428
|
5056 }
|
|
2225
|
5057 else if (LOOKING_AT (bp, "defineps"))
|
|
|
5058 get_tag (bp, NULL);
|
|
428
|
5059 }
|
|
|
5060 }
|
|
|
5061
|
|
|
5062
|
|
|
5063 /*
|
|
2554
|
5064 * Forth tags
|
|
|
5065 * Ignore anything after \ followed by space or in ( )
|
|
|
5066 * Look for words defined by :
|
|
|
5067 * Look for constant, code, create, defer, value, and variable
|
|
|
5068 * OBP extensions: Look for buffer:, field,
|
|
|
5069 * Ideas by Eduardo Horvath <eeh@netbsd.org> (2004)
|
|
|
5070 */
|
|
|
5071 static void
|
|
|
5072 Forth_words (inf)
|
|
|
5073 FILE *inf;
|
|
|
5074 {
|
|
|
5075 register char *bp;
|
|
|
5076
|
|
|
5077 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
5078 while ((bp = skip_spaces (bp))[0] != '\0')
|
|
|
5079 if (bp[0] == '\\' && iswhite(bp[1]))
|
|
|
5080 break; /* read next line */
|
|
|
5081 else if (bp[0] == '(' && iswhite(bp[1]))
|
|
|
5082 do /* skip to ) or eol */
|
|
|
5083 bp++;
|
|
|
5084 while (*bp != ')' && *bp != '\0');
|
|
|
5085 else if ((bp[0] == ':' && iswhite(bp[1]) && bp++)
|
|
|
5086 || LOOKING_AT_NOCASE (bp, "constant")
|
|
|
5087 || LOOKING_AT_NOCASE (bp, "code")
|
|
|
5088 || LOOKING_AT_NOCASE (bp, "create")
|
|
|
5089 || LOOKING_AT_NOCASE (bp, "defer")
|
|
|
5090 || LOOKING_AT_NOCASE (bp, "value")
|
|
|
5091 || LOOKING_AT_NOCASE (bp, "variable")
|
|
|
5092 || LOOKING_AT_NOCASE (bp, "buffer:")
|
|
|
5093 || LOOKING_AT_NOCASE (bp, "field"))
|
|
|
5094 get_tag (skip_spaces (bp), NULL); /* Yay! A definition! */
|
|
|
5095 else
|
|
|
5096 bp = skip_non_spaces (bp);
|
|
|
5097 }
|
|
|
5098
|
|
|
5099
|
|
|
5100 /*
|
|
428
|
5101 * Scheme tag functions
|
|
|
5102 * look for (def... xyzzy
|
|
2225
|
5103 * (def... (xyzzy
|
|
|
5104 * (def ... ((...(xyzzy ....
|
|
|
5105 * (set! xyzzy
|
|
|
5106 * Original code by Ken Haase (1985?)
|
|
428
|
5107 */
|
|
442
|
5108 static void
|
|
428
|
5109 Scheme_functions (inf)
|
|
|
5110 FILE *inf;
|
|
|
5111 {
|
|
|
5112 register char *bp;
|
|
|
5113
|
|
|
5114 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
|
5115 {
|
|
2225
|
5116 if (strneq (bp, "(def", 4) || strneq (bp, "(DEF", 4))
|
|
428
|
5117 {
|
|
2225
|
5118 bp = skip_non_spaces (bp+4);
|
|
428
|
5119 /* Skip over open parens and white space */
|
|
2225
|
5120 while (notinname (*bp))
|
|
428
|
5121 bp++;
|
|
2225
|
5122 get_tag (bp, NULL);
|
|
428
|
5123 }
|
|
709
|
5124 if (LOOKING_AT (bp, "(SET!") || LOOKING_AT (bp, "(set!"))
|
|
2225
|
5125 get_tag (bp, NULL);
|
|
428
|
5126 }
|
|
|
5127 }
|
|
458
|
5128
|
|
428
|
5129
|
|
|
5130 /* Find tags in TeX and LaTeX input files. */
|
|
|
5131
|
|
|
5132 /* TEX_toktab is a table of TeX control sequences that define tags.
|
|
2225
|
5133 * Each entry records one such control sequence.
|
|
|
5134 *
|
|
|
5135 * Original code from who knows whom.
|
|
|
5136 * Ideas by:
|
|
|
5137 * Stefan Monnier (2002)
|
|
|
5138 */
|
|
|
5139
|
|
|
5140 static linebuffer *TEX_toktab = NULL; /* Table with tag tokens */
|
|
428
|
5141
|
|
|
5142 /* Default set of control sequences to put into TEX_toktab.
|
|
|
5143 The value of environment var TEXTAGS is prepended to this. */
|
|
2225
|
5144 static char *TEX_defenv = "\
|
|
428
|
5145 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem\
|
|
2225
|
5146 :part:appendix:entry:index:def\
|
|
|
5147 :newcommand:renewcommand:newenvironment:renewenvironment";
|
|
428
|
5148
|
|
709
|
5149 static void TEX_mode __P((FILE *));
|
|
2225
|
5150 static void TEX_decode_env __P((char *, char *));
|
|
|
5151
|
|
|
5152 static char TEX_esc = '\\';
|
|
|
5153 static char TEX_opgrp = '{';
|
|
|
5154 static char TEX_clgrp = '}';
|
|
428
|
5155
|
|
|
5156 /*
|
|
|
5157 * TeX/LaTeX scanning loop.
|
|
|
5158 */
|
|
442
|
5159 static void
|
|
458
|
5160 TeX_commands (inf)
|
|
428
|
5161 FILE *inf;
|
|
|
5162 {
|
|
2225
|
5163 char *cp;
|
|
|
5164 linebuffer *key;
|
|
428
|
5165
|
|
|
5166 /* Select either \ or ! as escape character. */
|
|
|
5167 TEX_mode (inf);
|
|
|
5168
|
|
|
5169 /* Initialize token table once from environment. */
|
|
2225
|
5170 if (TEX_toktab == NULL)
|
|
|
5171 TEX_decode_env ("TEXTAGS", TEX_defenv);
|
|
428
|
5172
|
|
|
5173 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
5174 {
|
|
2225
|
5175 /* Look at each TEX keyword in line. */
|
|
|
5176 for (;;)
|
|
428
|
5177 {
|
|
2225
|
5178 /* Look for a TEX escape. */
|
|
|
5179 while (*cp++ != TEX_esc)
|
|
|
5180 if (cp[-1] == '\0' || cp[-1] == '%')
|
|
|
5181 goto tex_next_line;
|
|
|
5182
|
|
|
5183 for (key = TEX_toktab; key->buffer != NULL; key++)
|
|
|
5184 if (strneq (cp, key->buffer, key->len))
|
|
|
5185 {
|
|
|
5186 register char *p;
|
|
|
5187 int namelen, linelen;
|
|
|
5188 bool opgrp = FALSE;
|
|
|
5189
|
|
|
5190 cp = skip_spaces (cp + key->len);
|
|
|
5191 if (*cp == TEX_opgrp)
|
|
|
5192 {
|
|
|
5193 opgrp = TRUE;
|
|
|
5194 cp++;
|
|
|
5195 }
|
|
|
5196 for (p = cp;
|
|
|
5197 (!iswhite (*p) && *p != '#' &&
|
|
|
5198 *p != TEX_opgrp && *p != TEX_clgrp);
|
|
|
5199 p++)
|
|
|
5200 continue;
|
|
|
5201 namelen = p - cp;
|
|
|
5202 linelen = lb.len;
|
|
|
5203 if (!opgrp || *p == TEX_clgrp)
|
|
|
5204 {
|
|
|
5205 while (*p != '\0' && *p != TEX_opgrp && *p != TEX_clgrp)
|
|
3876
|
5206 p++;
|
|
2225
|
5207 linelen = p - lb.buffer + 1;
|
|
|
5208 }
|
|
|
5209 make_tag (cp, namelen, TRUE,
|
|
|
5210 lb.buffer, linelen, lineno, linecharno);
|
|
|
5211 goto tex_next_line; /* We only tag a line once */
|
|
|
5212 }
|
|
428
|
5213 }
|
|
2225
|
5214 tex_next_line:
|
|
|
5215 ;
|
|
428
|
5216 }
|
|
|
5217 }
|
|
|
5218
|
|
|
5219 #define TEX_LESC '\\'
|
|
|
5220 #define TEX_SESC '!'
|
|
|
5221
|
|
|
5222 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
|
|
|
5223 chars accordingly. */
|
|
442
|
5224 static void
|
|
428
|
5225 TEX_mode (inf)
|
|
|
5226 FILE *inf;
|
|
|
5227 {
|
|
|
5228 int c;
|
|
|
5229
|
|
|
5230 while ((c = getc (inf)) != EOF)
|
|
|
5231 {
|
|
|
5232 /* Skip to next line if we hit the TeX comment char. */
|
|
2225
|
5233 if (c == '%')
|
|
3876
|
5234 while (c != '\n' && c != EOF)
|
|
428
|
5235 c = getc (inf);
|
|
|
5236 else if (c == TEX_LESC || c == TEX_SESC )
|
|
|
5237 break;
|
|
|
5238 }
|
|
|
5239
|
|
|
5240 if (c == TEX_LESC)
|
|
|
5241 {
|
|
|
5242 TEX_esc = TEX_LESC;
|
|
|
5243 TEX_opgrp = '{';
|
|
|
5244 TEX_clgrp = '}';
|
|
|
5245 }
|
|
|
5246 else
|
|
|
5247 {
|
|
|
5248 TEX_esc = TEX_SESC;
|
|
|
5249 TEX_opgrp = '<';
|
|
|
5250 TEX_clgrp = '>';
|
|
|
5251 }
|
|
|
5252 /* If the input file is compressed, inf is a pipe, and rewind may fail.
|
|
|
5253 No attempt is made to correct the situation. */
|
|
|
5254 rewind (inf);
|
|
|
5255 }
|
|
|
5256
|
|
|
5257 /* Read environment and prepend it to the default string.
|
|
|
5258 Build token table. */
|
|
2225
|
5259 static void
|
|
428
|
5260 TEX_decode_env (evarname, defenv)
|
|
|
5261 char *evarname;
|
|
|
5262 char *defenv;
|
|
|
5263 {
|
|
|
5264 register char *env, *p;
|
|
2225
|
5265 int i, len;
|
|
428
|
5266
|
|
|
5267 /* Append default string to environment. */
|
|
|
5268 env = getenv (evarname);
|
|
|
5269 if (!env)
|
|
|
5270 env = defenv;
|
|
|
5271 else
|
|
|
5272 {
|
|
|
5273 char *oldenv = env;
|
|
|
5274 env = concat (oldenv, defenv, "");
|
|
|
5275 }
|
|
|
5276
|
|
|
5277 /* Allocate a token table */
|
|
2225
|
5278 for (len = 1, p = env; p;)
|
|
428
|
5279 if ((p = etags_strchr (p, ':')) && *++p != '\0')
|
|
2225
|
5280 len++;
|
|
|
5281 TEX_toktab = xnew (len, linebuffer);
|
|
428
|
5282
|
|
|
5283 /* Unpack environment string into token table. Be careful about */
|
|
|
5284 /* zero-length strings (leading ':', "::" and trailing ':') */
|
|
2225
|
5285 for (i = 0; *env != '\0';)
|
|
428
|
5286 {
|
|
|
5287 p = etags_strchr (env, ':');
|
|
|
5288 if (!p) /* End of environment string. */
|
|
|
5289 p = env + strlen (env);
|
|
|
5290 if (p - env > 0)
|
|
|
5291 { /* Only non-zero strings. */
|
|
2225
|
5292 TEX_toktab[i].buffer = savenstr (env, p - env);
|
|
|
5293 TEX_toktab[i].len = p - env;
|
|
428
|
5294 i++;
|
|
|
5295 }
|
|
|
5296 if (*p)
|
|
|
5297 env = p + 1;
|
|
|
5298 else
|
|
|
5299 {
|
|
2225
|
5300 TEX_toktab[i].buffer = NULL; /* Mark end of table. */
|
|
|
5301 TEX_toktab[i].len = 0;
|
|
428
|
5302 break;
|
|
|
5303 }
|
|
|
5304 }
|
|
|
5305 }
|
|
458
|
5306
|
|
|
5307
|
|
|
5308 /* Texinfo support. Dave Love, Mar. 2000. */
|
|
|
5309 static void
|
|
|
5310 Texinfo_nodes (inf)
|
|
|
5311 FILE * inf;
|
|
|
5312 {
|
|
|
5313 char *cp, *start;
|
|
|
5314 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
709
|
5315 if (LOOKING_AT (cp, "@node"))
|
|
|
5316 {
|
|
|
5317 start = cp;
|
|
|
5318 while (*cp != '\0' && *cp != ',')
|
|
|
5319 cp++;
|
|
2225
|
5320 make_tag (start, cp - start, TRUE,
|
|
|
5321 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
5322 }
|
|
|
5323 }
|
|
|
5324
|
|
|
5325
|
|
|
5326 /*
|
|
|
5327 * HTML support.
|
|
|
5328 * Contents of <title>, <h1>, <h2>, <h3> are tags.
|
|
|
5329 * Contents of <a name=xxx> are tags with name xxx.
|
|
|
5330 *
|
|
|
5331 * Francesco Potort́, 2002.
|
|
|
5332 */
|
|
|
5333 static void
|
|
|
5334 HTML_labels (inf)
|
|
|
5335 FILE * inf;
|
|
|
5336 {
|
|
|
5337 bool getnext = FALSE; /* next text outside of HTML tags is a tag */
|
|
|
5338 bool skiptag = FALSE; /* skip to the end of the current HTML tag */
|
|
|
5339 bool intag = FALSE; /* inside an html tag, looking for ID= */
|
|
|
5340 bool inanchor = FALSE; /* when INTAG, is an anchor, look for NAME= */
|
|
|
5341 char *end;
|
|
|
5342
|
|
|
5343
|
|
|
5344 linebuffer_setlen (&token_name, 0); /* no name in buffer */
|
|
|
5345
|
|
|
5346 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
|
5347 for (;;) /* loop on the same line */
|
|
|
5348 {
|
|
|
5349 if (skiptag) /* skip HTML tag */
|
|
|
5350 {
|
|
|
5351 while (*dbp != '\0' && *dbp != '>')
|
|
|
5352 dbp++;
|
|
|
5353 if (*dbp == '>')
|
|
|
5354 {
|
|
|
5355 dbp += 1;
|
|
|
5356 skiptag = FALSE;
|
|
|
5357 continue; /* look on the same line */
|
|
|
5358 }
|
|
|
5359 break; /* go to next line */
|
|
|
5360 }
|
|
|
5361
|
|
|
5362 else if (intag) /* look for "name=" or "id=" */
|
|
|
5363 {
|
|
|
5364 while (*dbp != '\0' && *dbp != '>'
|
|
|
5365 && lowcase (*dbp) != 'n' && lowcase (*dbp) != 'i')
|
|
|
5366 dbp++;
|
|
|
5367 if (*dbp == '\0')
|
|
|
5368 break; /* go to next line */
|
|
|
5369 if (*dbp == '>')
|
|
|
5370 {
|
|
|
5371 dbp += 1;
|
|
|
5372 intag = FALSE;
|
|
|
5373 continue; /* look on the same line */
|
|
|
5374 }
|
|
|
5375 if ((inanchor && LOOKING_AT_NOCASE (dbp, "name="))
|
|
|
5376 || LOOKING_AT_NOCASE (dbp, "id="))
|
|
|
5377 {
|
|
|
5378 bool quoted = (dbp[0] == '"');
|
|
|
5379
|
|
|
5380 if (quoted)
|
|
|
5381 for (end = ++dbp; *end != '\0' && *end != '"'; end++)
|
|
|
5382 continue;
|
|
|
5383 else
|
|
|
5384 for (end = dbp; *end != '\0' && intoken (*end); end++)
|
|
|
5385 continue;
|
|
|
5386 linebuffer_setlen (&token_name, end - dbp);
|
|
|
5387 strncpy (token_name.buffer, dbp, end - dbp);
|
|
|
5388 token_name.buffer[end - dbp] = '\0';
|
|
|
5389
|
|
|
5390 dbp = end;
|
|
|
5391 intag = FALSE; /* we found what we looked for */
|
|
|
5392 skiptag = TRUE; /* skip to the end of the tag */
|
|
|
5393 getnext = TRUE; /* then grab the text */
|
|
|
5394 continue; /* look on the same line */
|
|
|
5395 }
|
|
|
5396 dbp += 1;
|
|
|
5397 }
|
|
|
5398
|
|
|
5399 else if (getnext) /* grab next tokens and tag them */
|
|
|
5400 {
|
|
|
5401 dbp = skip_spaces (dbp);
|
|
|
5402 if (*dbp == '\0')
|
|
|
5403 break; /* go to next line */
|
|
|
5404 if (*dbp == '<')
|
|
|
5405 {
|
|
|
5406 intag = TRUE;
|
|
|
5407 inanchor = (lowcase (dbp[1]) == 'a' && !intoken (dbp[2]));
|
|
|
5408 continue; /* look on the same line */
|
|
|
5409 }
|
|
|
5410
|
|
|
5411 for (end = dbp + 1; *end != '\0' && *end != '<'; end++)
|
|
|
5412 continue;
|
|
|
5413 make_tag (token_name.buffer, token_name.len, TRUE,
|
|
|
5414 dbp, end - dbp, lineno, linecharno);
|
|
|
5415 linebuffer_setlen (&token_name, 0); /* no name in buffer */
|
|
|
5416 getnext = FALSE;
|
|
|
5417 break; /* go to next line */
|
|
|
5418 }
|
|
|
5419
|
|
|
5420 else /* look for an interesting HTML tag */
|
|
|
5421 {
|
|
|
5422 while (*dbp != '\0' && *dbp != '<')
|
|
|
5423 dbp++;
|
|
|
5424 if (*dbp == '\0')
|
|
|
5425 break; /* go to next line */
|
|
|
5426 intag = TRUE;
|
|
|
5427 if (lowcase (dbp[1]) == 'a' && !intoken (dbp[2]))
|
|
|
5428 {
|
|
|
5429 inanchor = TRUE;
|
|
|
5430 continue; /* look on the same line */
|
|
|
5431 }
|
|
|
5432 else if (LOOKING_AT_NOCASE (dbp, "<title>")
|
|
|
5433 || LOOKING_AT_NOCASE (dbp, "<h1>")
|
|
|
5434 || LOOKING_AT_NOCASE (dbp, "<h2>")
|
|
|
5435 || LOOKING_AT_NOCASE (dbp, "<h3>"))
|
|
|
5436 {
|
|
|
5437 intag = FALSE;
|
|
|
5438 getnext = TRUE;
|
|
|
5439 continue; /* look on the same line */
|
|
|
5440 }
|
|
|
5441 dbp += 1;
|
|
|
5442 }
|
|
709
|
5443 }
|
|
458
|
5444 }
|
|
|
5445
|
|
428
|
5446
|
|
|
5447 /*
|
|
2225
|
5448 * Prolog support
|
|
428
|
5449 *
|
|
709
|
5450 * Assumes that the predicate or rule starts at column 0.
|
|
|
5451 * Only the first clause of a predicate or rule is added.
|
|
2225
|
5452 * Original code by Sunichirou Sugou (1989)
|
|
|
5453 * Rewritten by Anders Lindgren (1996)
|
|
428
|
5454 */
|
|
709
|
5455 static int prolog_pr __P((char *, char *));
|
|
|
5456 static void prolog_skip_comment __P((linebuffer *, FILE *));
|
|
|
5457 static int prolog_atom __P((char *, int));
|
|
442
|
5458
|
|
|
5459 static void
|
|
428
|
5460 Prolog_functions (inf)
|
|
|
5461 FILE *inf;
|
|
|
5462 {
|
|
|
5463 char *cp, *last;
|
|
|
5464 int len;
|
|
|
5465 int allocated;
|
|
|
5466
|
|
|
5467 allocated = 0;
|
|
|
5468 len = 0;
|
|
|
5469 last = NULL;
|
|
|
5470
|
|
|
5471 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
5472 {
|
|
|
5473 if (cp[0] == '\0') /* Empty line */
|
|
|
5474 continue;
|
|
442
|
5475 else if (iswhite (cp[0])) /* Not a predicate */
|
|
428
|
5476 continue;
|
|
|
5477 else if (cp[0] == '/' && cp[1] == '*') /* comment. */
|
|
|
5478 prolog_skip_comment (&lb, inf);
|
|
709
|
5479 else if ((len = prolog_pr (cp, last)) > 0)
|
|
428
|
5480 {
|
|
709
|
5481 /* Predicate or rule. Store the function name so that we
|
|
|
5482 only generate a tag for the first clause. */
|
|
428
|
5483 if (last == NULL)
|
|
|
5484 last = xnew(len + 1, char);
|
|
|
5485 else if (len + 1 > allocated)
|
|
458
|
5486 xrnew (last, len + 1, char);
|
|
428
|
5487 allocated = len + 1;
|
|
|
5488 strncpy (last, cp, len);
|
|
|
5489 last[len] = '\0';
|
|
|
5490 }
|
|
|
5491 }
|
|
3517
|
5492 if (last != NULL)
|
|
|
5493 free (last);
|
|
428
|
5494 }
|
|
|
5495
|
|
|
5496
|
|
442
|
5497 static void
|
|
428
|
5498 prolog_skip_comment (plb, inf)
|
|
|
5499 linebuffer *plb;
|
|
|
5500 FILE *inf;
|
|
|
5501 {
|
|
|
5502 char *cp;
|
|
|
5503
|
|
|
5504 do
|
|
|
5505 {
|
|
|
5506 for (cp = plb->buffer; *cp != '\0'; cp++)
|
|
|
5507 if (cp[0] == '*' && cp[1] == '/')
|
|
|
5508 return;
|
|
2225
|
5509 readline (plb, inf);
|
|
428
|
5510 }
|
|
|
5511 while (!feof(inf));
|
|
|
5512 }
|
|
|
5513
|
|
|
5514 /*
|
|
709
|
5515 * A predicate or rule definition is added if it matches:
|
|
428
|
5516 * <beginning of line><Prolog Atom><whitespace>(
|
|
709
|
5517 * or <beginning of line><Prolog Atom><whitespace>:-
|
|
428
|
5518 *
|
|
|
5519 * It is added to the tags database if it doesn't match the
|
|
|
5520 * name of the previous clause header.
|
|
|
5521 *
|
|
709
|
5522 * Return the size of the name of the predicate or rule, or 0 if no
|
|
|
5523 * header was found.
|
|
428
|
5524 */
|
|
442
|
5525 static int
|
|
709
|
5526 prolog_pr (s, last)
|
|
428
|
5527 char *s;
|
|
|
5528 char *last; /* Name of last clause. */
|
|
|
5529 {
|
|
|
5530 int pos;
|
|
|
5531 int len;
|
|
|
5532
|
|
|
5533 pos = prolog_atom (s, 0);
|
|
|
5534 if (pos < 1)
|
|
|
5535 return 0;
|
|
|
5536
|
|
|
5537 len = pos;
|
|
|
5538 pos = skip_spaces (s + pos) - s;
|
|
|
5539
|
|
709
|
5540 if ((s[pos] == '.'
|
|
|
5541 || (s[pos] == '(' && (pos += 1))
|
|
|
5542 || (s[pos] == ':' && s[pos + 1] == '-' && (pos += 2)))
|
|
|
5543 && (last == NULL /* save only the first clause */
|
|
2325
|
5544 || len != (int)strlen (last)
|
|
709
|
5545 || !strneq (s, last, len)))
|
|
428
|
5546 {
|
|
2225
|
5547 make_tag (s, len, TRUE, s, pos, lineno, linecharno);
|
|
428
|
5548 return len;
|
|
|
5549 }
|
|
709
|
5550 else
|
|
|
5551 return 0;
|
|
428
|
5552 }
|
|
|
5553
|
|
|
5554 /*
|
|
|
5555 * Consume a Prolog atom.
|
|
|
5556 * Return the number of bytes consumed, or -1 if there was an error.
|
|
|
5557 *
|
|
|
5558 * A prolog atom, in this context, could be one of:
|
|
|
5559 * - An alphanumeric sequence, starting with a lower case letter.
|
|
|
5560 * - A quoted arbitrary string. Single quotes can escape themselves.
|
|
|
5561 * Backslash quotes everything.
|
|
|
5562 */
|
|
442
|
5563 static int
|
|
428
|
5564 prolog_atom (s, pos)
|
|
|
5565 char *s;
|
|
|
5566 int pos;
|
|
|
5567 {
|
|
|
5568 int origpos;
|
|
|
5569
|
|
|
5570 origpos = pos;
|
|
|
5571
|
|
458
|
5572 if (ISLOWER(s[pos]) || (s[pos] == '_'))
|
|
428
|
5573 {
|
|
|
5574 /* The atom is unquoted. */
|
|
|
5575 pos++;
|
|
458
|
5576 while (ISALNUM(s[pos]) || (s[pos] == '_'))
|
|
428
|
5577 {
|
|
|
5578 pos++;
|
|
|
5579 }
|
|
|
5580 return pos - origpos;
|
|
|
5581 }
|
|
|
5582 else if (s[pos] == '\'')
|
|
|
5583 {
|
|
|
5584 pos++;
|
|
|
5585
|
|
2225
|
5586 for (;;)
|
|
428
|
5587 {
|
|
|
5588 if (s[pos] == '\'')
|
|
|
5589 {
|
|
|
5590 pos++;
|
|
|
5591 if (s[pos] != '\'')
|
|
|
5592 break;
|
|
|
5593 pos++; /* A double quote */
|
|
|
5594 }
|
|
|
5595 else if (s[pos] == '\0')
|
|
|
5596 /* Multiline quoted atoms are ignored. */
|
|
|
5597 return -1;
|
|
|
5598 else if (s[pos] == '\\')
|
|
|
5599 {
|
|
|
5600 if (s[pos+1] == '\0')
|
|
|
5601 return -1;
|
|
|
5602 pos += 2;
|
|
|
5603 }
|
|
|
5604 else
|
|
|
5605 pos++;
|
|
|
5606 }
|
|
|
5607 return pos - origpos;
|
|
|
5608 }
|
|
|
5609 else
|
|
|
5610 return -1;
|
|
|
5611 }
|
|
458
|
5612
|
|
428
|
5613
|
|
|
5614 /*
|
|
2225
|
5615 * Support for Erlang
|
|
428
|
5616 *
|
|
|
5617 * Generates tags for functions, defines, and records.
|
|
|
5618 * Assumes that Erlang functions start at column 0.
|
|
2225
|
5619 * Original code by Anders Lindgren (1996)
|
|
428
|
5620 */
|
|
709
|
5621 static int erlang_func __P((char *, char *));
|
|
|
5622 static void erlang_attribute __P((char *));
|
|
2225
|
5623 static int erlang_atom __P((char *));
|
|
442
|
5624
|
|
|
5625 static void
|
|
428
|
5626 Erlang_functions (inf)
|
|
|
5627 FILE *inf;
|
|
|
5628 {
|
|
|
5629 char *cp, *last;
|
|
|
5630 int len;
|
|
|
5631 int allocated;
|
|
|
5632
|
|
|
5633 allocated = 0;
|
|
|
5634 len = 0;
|
|
|
5635 last = NULL;
|
|
|
5636
|
|
|
5637 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
5638 {
|
|
|
5639 if (cp[0] == '\0') /* Empty line */
|
|
|
5640 continue;
|
|
442
|
5641 else if (iswhite (cp[0])) /* Not function nor attribute */
|
|
428
|
5642 continue;
|
|
|
5643 else if (cp[0] == '%') /* comment */
|
|
|
5644 continue;
|
|
|
5645 else if (cp[0] == '"') /* Sometimes, strings start in column one */
|
|
|
5646 continue;
|
|
|
5647 else if (cp[0] == '-') /* attribute, e.g. "-define" */
|
|
|
5648 {
|
|
|
5649 erlang_attribute (cp);
|
|
3517
|
5650 if (last != NULL)
|
|
|
5651 {
|
|
|
5652 free (last);
|
|
|
5653 last = NULL;
|
|
|
5654 }
|
|
428
|
5655 }
|
|
|
5656 else if ((len = erlang_func (cp, last)) > 0)
|
|
|
5657 {
|
|
|
5658 /*
|
|
|
5659 * Function. Store the function name so that we only
|
|
|
5660 * generates a tag for the first clause.
|
|
|
5661 */
|
|
|
5662 if (last == NULL)
|
|
|
5663 last = xnew (len + 1, char);
|
|
|
5664 else if (len + 1 > allocated)
|
|
458
|
5665 xrnew (last, len + 1, char);
|
|
428
|
5666 allocated = len + 1;
|
|
|
5667 strncpy (last, cp, len);
|
|
|
5668 last[len] = '\0';
|
|
|
5669 }
|
|
|
5670 }
|
|
3517
|
5671 if (last != NULL)
|
|
|
5672 free (last);
|
|
428
|
5673 }
|
|
|
5674
|
|
|
5675
|
|
|
5676 /*
|
|
|
5677 * A function definition is added if it matches:
|
|
|
5678 * <beginning of line><Erlang Atom><whitespace>(
|
|
|
5679 *
|
|
|
5680 * It is added to the tags database if it doesn't match the
|
|
|
5681 * name of the previous clause header.
|
|
|
5682 *
|
|
|
5683 * Return the size of the name of the function, or 0 if no function
|
|
|
5684 * was found.
|
|
|
5685 */
|
|
442
|
5686 static int
|
|
428
|
5687 erlang_func (s, last)
|
|
|
5688 char *s;
|
|
|
5689 char *last; /* Name of last clause. */
|
|
|
5690 {
|
|
|
5691 int pos;
|
|
|
5692 int len;
|
|
|
5693
|
|
2225
|
5694 pos = erlang_atom (s);
|
|
428
|
5695 if (pos < 1)
|
|
|
5696 return 0;
|
|
|
5697
|
|
|
5698 len = pos;
|
|
|
5699 pos = skip_spaces (s + pos) - s;
|
|
|
5700
|
|
|
5701 /* Save only the first clause. */
|
|
|
5702 if (s[pos++] == '('
|
|
|
5703 && (last == NULL
|
|
|
5704 || len != (int)strlen (last)
|
|
|
5705 || !strneq (s, last, len)))
|
|
|
5706 {
|
|
2225
|
5707 make_tag (s, len, TRUE, s, pos, lineno, linecharno);
|
|
428
|
5708 return len;
|
|
|
5709 }
|
|
|
5710
|
|
|
5711 return 0;
|
|
|
5712 }
|
|
|
5713
|
|
|
5714
|
|
|
5715 /*
|
|
|
5716 * Handle attributes. Currently, tags are generated for defines
|
|
|
5717 * and records.
|
|
|
5718 *
|
|
|
5719 * They are on the form:
|
|
|
5720 * -define(foo, bar).
|
|
|
5721 * -define(Foo(M, N), M+N).
|
|
|
5722 * -record(graph, {vtab = notable, cyclic = true}).
|
|
|
5723 */
|
|
442
|
5724 static void
|
|
428
|
5725 erlang_attribute (s)
|
|
|
5726 char *s;
|
|
|
5727 {
|
|
2225
|
5728 char *cp = s;
|
|
|
5729
|
|
|
5730 if ((LOOKING_AT (cp, "-define") || LOOKING_AT (cp, "-record"))
|
|
|
5731 && *cp++ == '(')
|
|
428
|
5732 {
|
|
2225
|
5733 int len = erlang_atom (skip_spaces (cp));
|
|
|
5734 if (len > 0)
|
|
|
5735 make_tag (cp, len, TRUE, s, cp + len - s, lineno, linecharno);
|
|
428
|
5736 }
|
|
|
5737 return;
|
|
|
5738 }
|
|
|
5739
|
|
|
5740
|
|
|
5741 /*
|
|
|
5742 * Consume an Erlang atom (or variable).
|
|
|
5743 * Return the number of bytes consumed, or -1 if there was an error.
|
|
|
5744 */
|
|
442
|
5745 static int
|
|
2225
|
5746 erlang_atom (s)
|
|
428
|
5747 char *s;
|
|
|
5748 {
|
|
2225
|
5749 int pos = 0;
|
|
428
|
5750
|
|
458
|
5751 if (ISALPHA (s[pos]) || s[pos] == '_')
|
|
428
|
5752 {
|
|
|
5753 /* The atom is unquoted. */
|
|
2225
|
5754 do
|
|
428
|
5755 pos++;
|
|
2225
|
5756 while (ISALNUM (s[pos]) || s[pos] == '_');
|
|
428
|
5757 }
|
|
|
5758 else if (s[pos] == '\'')
|
|
|
5759 {
|
|
2225
|
5760 for (pos++; s[pos] != '\''; pos++)
|
|
|
5761 if (s[pos] == '\0' /* multiline quoted atoms are ignored */
|
|
|
5762 || (s[pos] == '\\' && s[++pos] == '\0'))
|
|
|
5763 return 0;
|
|
428
|
5764 pos++;
|
|
|
5765 }
|
|
2225
|
5766
|
|
|
5767 return pos;
|
|
428
|
5768 }
|
|
458
|
5769
|
|
428
|
5770
|
|
709
|
5771 static char *scan_separators __P((char *));
|
|
2225
|
5772 static void add_regex __P((char *, language *));
|
|
709
|
5773 static char *substitute __P((char *, char *, struct re_registers *));
|
|
442
|
5774
|
|
2225
|
5775 /*
|
|
|
5776 * Take a string like "/blah/" and turn it into "blah", verifying
|
|
|
5777 * that the first and last characters are the same, and handling
|
|
|
5778 * quoted separator characters. Actually, stops on the occurrence of
|
|
|
5779 * an unquoted separator. Also process \t, \n, etc. and turn into
|
|
|
5780 * appropriate characters. Works in place. Null terminates name string.
|
|
|
5781 * Returns pointer to terminating separator, or NULL for
|
|
|
5782 * unterminated regexps.
|
|
|
5783 */
|
|
428
|
5784 static char *
|
|
|
5785 scan_separators (name)
|
|
|
5786 char *name;
|
|
|
5787 {
|
|
|
5788 char sep = name[0];
|
|
|
5789 char *copyto = name;
|
|
|
5790 bool quoted = FALSE;
|
|
|
5791
|
|
|
5792 for (++name; *name != '\0'; ++name)
|
|
|
5793 {
|
|
|
5794 if (quoted)
|
|
|
5795 {
|
|
2225
|
5796 switch (*name)
|
|
428
|
5797 {
|
|
2225
|
5798 case 'a': *copyto++ = '\007'; break; /* BEL (bell) */
|
|
|
5799 case 'b': *copyto++ = '\b'; break; /* BS (back space) */
|
|
|
5800 case 'd': *copyto++ = 0177; break; /* DEL (delete) */
|
|
|
5801 case 'e': *copyto++ = 033; break; /* ESC (delete) */
|
|
|
5802 case 'f': *copyto++ = '\f'; break; /* FF (form feed) */
|
|
|
5803 case 'n': *copyto++ = '\n'; break; /* NL (new line) */
|
|
|
5804 case 'r': *copyto++ = '\r'; break; /* CR (carriage return) */
|
|
|
5805 case 't': *copyto++ = '\t'; break; /* TAB (horizontal tab) */
|
|
|
5806 case 'v': *copyto++ = '\v'; break; /* VT (vertical tab) */
|
|
|
5807 default:
|
|
|
5808 if (*name == sep)
|
|
|
5809 *copyto++ = sep;
|
|
|
5810 else
|
|
|
5811 {
|
|
|
5812 /* Something else is quoted, so preserve the quote. */
|
|
|
5813 *copyto++ = '\\';
|
|
|
5814 *copyto++ = *name;
|
|
|
5815 }
|
|
|
5816 break;
|
|
428
|
5817 }
|
|
|
5818 quoted = FALSE;
|
|
|
5819 }
|
|
|
5820 else if (*name == '\\')
|
|
|
5821 quoted = TRUE;
|
|
|
5822 else if (*name == sep)
|
|
|
5823 break;
|
|
|
5824 else
|
|
|
5825 *copyto++ = *name;
|
|
|
5826 }
|
|
2225
|
5827 if (*name != sep)
|
|
|
5828 name = NULL; /* signal unterminated regexp */
|
|
428
|
5829
|
|
|
5830 /* Terminate copied string. */
|
|
|
5831 *copyto = '\0';
|
|
|
5832 return name;
|
|
|
5833 }
|
|
|
5834
|
|
|
5835 /* Look at the argument of --regex or --no-regex and do the right
|
|
|
5836 thing. Same for each line of a regexp file. */
|
|
442
|
5837 static void
|
|
2225
|
5838 analyse_regex (regex_arg)
|
|
428
|
5839 char *regex_arg;
|
|
|
5840 {
|
|
|
5841 if (regex_arg == NULL)
|
|
709
|
5842 {
|
|
2225
|
5843 free_regexps (); /* --no-regex: remove existing regexps */
|
|
709
|
5844 return;
|
|
|
5845 }
|
|
428
|
5846
|
|
|
5847 /* A real --regexp option or a line in a regexp file. */
|
|
|
5848 switch (regex_arg[0])
|
|
|
5849 {
|
|
|
5850 /* Comments in regexp file or null arg to --regex. */
|
|
|
5851 case '\0':
|
|
|
5852 case ' ':
|
|
|
5853 case '\t':
|
|
|
5854 break;
|
|
|
5855
|
|
|
5856 /* Read a regex file. This is recursive and may result in a
|
|
|
5857 loop, which will stop when the file descriptors are exhausted. */
|
|
|
5858 case '@':
|
|
|
5859 {
|
|
|
5860 FILE *regexfp;
|
|
|
5861 linebuffer regexbuf;
|
|
|
5862 char *regexfile = regex_arg + 1;
|
|
|
5863
|
|
|
5864 /* regexfile is a file containing regexps, one per line. */
|
|
|
5865 regexfp = fopen (regexfile, "r");
|
|
|
5866 if (regexfp == NULL)
|
|
|
5867 {
|
|
|
5868 pfatal (regexfile);
|
|
|
5869 return;
|
|
|
5870 }
|
|
2225
|
5871 linebuffer_init (®exbuf);
|
|
428
|
5872 while (readline_internal (®exbuf, regexfp) > 0)
|
|
2225
|
5873 analyse_regex (regexbuf.buffer);
|
|
428
|
5874 free (regexbuf.buffer);
|
|
|
5875 fclose (regexfp);
|
|
|
5876 }
|
|
|
5877 break;
|
|
|
5878
|
|
|
5879 /* Regexp to be used for a specific language only. */
|
|
|
5880 case '{':
|
|
|
5881 {
|
|
|
5882 language *lang;
|
|
|
5883 char *lang_name = regex_arg + 1;
|
|
|
5884 char *cp;
|
|
|
5885
|
|
|
5886 for (cp = lang_name; *cp != '}'; cp++)
|
|
|
5887 if (*cp == '\0')
|
|
|
5888 {
|
|
|
5889 error ("unterminated language name in regex: %s", regex_arg);
|
|
|
5890 return;
|
|
|
5891 }
|
|
2225
|
5892 *cp++ = '\0';
|
|
458
|
5893 lang = get_language_from_langname (lang_name);
|
|
428
|
5894 if (lang == NULL)
|
|
|
5895 return;
|
|
2225
|
5896 add_regex (cp, lang);
|
|
428
|
5897 }
|
|
|
5898 break;
|
|
|
5899
|
|
|
5900 /* Regexp to be used for any language. */
|
|
|
5901 default:
|
|
2225
|
5902 add_regex (regex_arg, NULL);
|
|
428
|
5903 break;
|
|
|
5904 }
|
|
|
5905 }
|
|
|
5906
|
|
2225
|
5907 /* Separate the regexp pattern, compile it,
|
|
|
5908 and care for optional name and modifiers. */
|
|
442
|
5909 static void
|
|
2225
|
5910 add_regex (regexp_pattern, lang)
|
|
428
|
5911 char *regexp_pattern;
|
|
|
5912 language *lang;
|
|
|
5913 {
|
|
531
|
5914 static struct re_pattern_buffer zeropattern;
|
|
2225
|
5915 char sep, *pat, *name, *modifiers;
|
|
428
|
5916 const char *err;
|
|
|
5917 struct re_pattern_buffer *patbuf;
|
|
2225
|
5918 regexp *rp;
|
|
|
5919 bool
|
|
|
5920 force_explicit_name = TRUE, /* do not use implicit tag names */
|
|
|
5921 ignore_case = FALSE, /* case is significant */
|
|
|
5922 multi_line = FALSE, /* matches are done one line at a time */
|
|
|
5923 single_line = FALSE; /* dot does not match newline */
|
|
|
5924
|
|
|
5925
|
|
|
5926 if (strlen(regexp_pattern) < 3)
|
|
|
5927 {
|
|
|
5928 error ("null regexp", (char *)NULL);
|
|
|
5929 return;
|
|
|
5930 }
|
|
|
5931 sep = regexp_pattern[0];
|
|
|
5932 name = scan_separators (regexp_pattern);
|
|
|
5933 if (name == NULL)
|
|
428
|
5934 {
|
|
|
5935 error ("%s: unterminated regexp", regexp_pattern);
|
|
|
5936 return;
|
|
|
5937 }
|
|
2225
|
5938 if (name[1] == sep)
|
|
428
|
5939 {
|
|
2225
|
5940 error ("null name for regexp \"%s\"", regexp_pattern);
|
|
428
|
5941 return;
|
|
|
5942 }
|
|
2225
|
5943 modifiers = scan_separators (name);
|
|
|
5944 if (modifiers == NULL) /* no terminating separator --> no name */
|
|
|
5945 {
|
|
|
5946 modifiers = name;
|
|
|
5947 name = "";
|
|
|
5948 }
|
|
|
5949 else
|
|
|
5950 modifiers += 1; /* skip separator */
|
|
|
5951
|
|
|
5952 /* Parse regex modifiers. */
|
|
|
5953 for (; modifiers[0] != '\0'; modifiers++)
|
|
|
5954 switch (modifiers[0])
|
|
|
5955 {
|
|
|
5956 case 'N':
|
|
|
5957 if (modifiers == name)
|
|
|
5958 error ("forcing explicit tag name but no name, ignoring", NULL);
|
|
|
5959 force_explicit_name = TRUE;
|
|
|
5960 break;
|
|
|
5961 case 'i':
|
|
|
5962 ignore_case = TRUE;
|
|
|
5963 break;
|
|
|
5964 case 's':
|
|
|
5965 single_line = TRUE;
|
|
|
5966 /* FALLTHRU */
|
|
|
5967 case 'm':
|
|
|
5968 multi_line = TRUE;
|
|
|
5969 need_filebuf = TRUE;
|
|
|
5970 break;
|
|
|
5971 default:
|
|
|
5972 {
|
|
|
5973 char wrongmod [2];
|
|
|
5974 wrongmod[0] = modifiers[0];
|
|
|
5975 wrongmod[1] = '\0';
|
|
|
5976 error ("invalid regexp modifier `%s', ignoring", wrongmod);
|
|
|
5977 }
|
|
|
5978 break;
|
|
|
5979 }
|
|
428
|
5980
|
|
|
5981 patbuf = xnew (1, struct re_pattern_buffer);
|
|
531
|
5982 *patbuf = zeropattern;
|
|
|
5983 if (ignore_case)
|
|
2225
|
5984 {
|
|
|
5985 static char lc_trans[CHARS];
|
|
|
5986 int i;
|
|
|
5987 for (i = 0; i < CHARS; i++)
|
|
|
5988 lc_trans[i] = lowcase (i);
|
|
|
5989 patbuf->translate = lc_trans; /* translation table to fold case */
|
|
|
5990 }
|
|
|
5991
|
|
|
5992 if (multi_line)
|
|
|
5993 pat = concat ("^", regexp_pattern, ""); /* anchor to beginning of line */
|
|
|
5994 else
|
|
|
5995 pat = regexp_pattern;
|
|
|
5996
|
|
|
5997 if (single_line)
|
|
|
5998 re_set_syntax (RE_SYNTAX_EMACS | RE_DOT_NEWLINE);
|
|
|
5999 else
|
|
|
6000 re_set_syntax (RE_SYNTAX_EMACS);
|
|
|
6001
|
|
|
6002 err = re_compile_pattern (pat, strlen (regexp_pattern), patbuf);
|
|
|
6003 if (multi_line)
|
|
|
6004 free (pat);
|
|
428
|
6005 if (err != NULL)
|
|
|
6006 {
|
|
|
6007 error ("%s while compiling pattern", err);
|
|
|
6008 return;
|
|
|
6009 }
|
|
|
6010
|
|
2225
|
6011 rp = p_head;
|
|
|
6012 p_head = xnew (1, regexp);
|
|
|
6013 p_head->pattern = savestr (regexp_pattern);
|
|
|
6014 p_head->p_next = rp;
|
|
709
|
6015 p_head->lang = lang;
|
|
|
6016 p_head->pat = patbuf;
|
|
2225
|
6017 p_head->name = savestr (name);
|
|
428
|
6018 p_head->error_signaled = FALSE;
|
|
2225
|
6019 p_head->force_explicit_name = force_explicit_name;
|
|
|
6020 p_head->ignore_case = ignore_case;
|
|
|
6021 p_head->multi_line = multi_line;
|
|
428
|
6022 }
|
|
|
6023
|
|
|
6024 /*
|
|
|
6025 * Do the substitutions indicated by the regular expression and
|
|
|
6026 * arguments.
|
|
|
6027 */
|
|
|
6028 static char *
|
|
|
6029 substitute (in, out, regs)
|
|
|
6030 char *in, *out;
|
|
|
6031 struct re_registers *regs;
|
|
|
6032 {
|
|
|
6033 char *result, *t;
|
|
|
6034 int size, dig, diglen;
|
|
|
6035
|
|
|
6036 result = NULL;
|
|
|
6037 size = strlen (out);
|
|
|
6038
|
|
|
6039 /* Pass 1: figure out how much to allocate by finding all \N strings. */
|
|
|
6040 if (out[size - 1] == '\\')
|
|
|
6041 fatal ("pattern error in \"%s\"", out);
|
|
|
6042 for (t = etags_strchr (out, '\\');
|
|
|
6043 t != NULL;
|
|
|
6044 t = etags_strchr (t + 2, '\\'))
|
|
458
|
6045 if (ISDIGIT (t[1]))
|
|
428
|
6046 {
|
|
|
6047 dig = t[1] - '0';
|
|
|
6048 diglen = regs->end[dig] - regs->start[dig];
|
|
|
6049 size += diglen - 2;
|
|
|
6050 }
|
|
|
6051 else
|
|
|
6052 size -= 1;
|
|
|
6053
|
|
|
6054 /* Allocate space and do the substitutions. */
|
|
2225
|
6055 assert (size >= 0);
|
|
428
|
6056 result = xnew (size + 1, char);
|
|
|
6057
|
|
|
6058 for (t = result; *out != '\0'; out++)
|
|
458
|
6059 if (*out == '\\' && ISDIGIT (*++out))
|
|
428
|
6060 {
|
|
|
6061 dig = *out - '0';
|
|
|
6062 diglen = regs->end[dig] - regs->start[dig];
|
|
|
6063 strncpy (t, in + regs->start[dig], diglen);
|
|
|
6064 t += diglen;
|
|
|
6065 }
|
|
|
6066 else
|
|
|
6067 *t++ = *out;
|
|
|
6068 *t = '\0';
|
|
|
6069
|
|
2225
|
6070 assert (t <= result + size);
|
|
|
6071 assert (t - result == (int)strlen (result));
|
|
428
|
6072
|
|
|
6073 return result;
|
|
|
6074 }
|
|
|
6075
|
|
2225
|
6076 /* Deallocate all regexps. */
|
|
442
|
6077 static void
|
|
2225
|
6078 free_regexps ()
|
|
428
|
6079 {
|
|
2225
|
6080 regexp *rp;
|
|
428
|
6081 while (p_head != NULL)
|
|
|
6082 {
|
|
2225
|
6083 rp = p_head->p_next;
|
|
|
6084 free (p_head->pattern);
|
|
|
6085 free (p_head->name);
|
|
428
|
6086 free (p_head);
|
|
2225
|
6087 p_head = rp;
|
|
428
|
6088 }
|
|
|
6089 return;
|
|
|
6090 }
|
|
2225
|
6091
|
|
|
6092 /*
|
|
|
6093 * Reads the whole file as a single string from `filebuf' and looks for
|
|
|
6094 * multi-line regular expressions, creating tags on matches.
|
|
|
6095 * readline already dealt with normal regexps.
|
|
|
6096 *
|
|
|
6097 * Idea by Ben Wing <ben@666.com> (2002).
|
|
|
6098 */
|
|
|
6099 static void
|
|
|
6100 regex_tag_multiline ()
|
|
|
6101 {
|
|
|
6102 char *buffer = filebuf.buffer;
|
|
|
6103 regexp *rp;
|
|
|
6104 char *name;
|
|
|
6105
|
|
|
6106 for (rp = p_head; rp != NULL; rp = rp->p_next)
|
|
|
6107 {
|
|
|
6108 int match = 0;
|
|
|
6109
|
|
|
6110 if (!rp->multi_line)
|
|
|
6111 continue; /* skip normal regexps */
|
|
|
6112
|
|
|
6113 /* Generic initialisations before parsing file from memory. */
|
|
|
6114 lineno = 1; /* reset global line number */
|
|
|
6115 charno = 0; /* reset global char number */
|
|
|
6116 linecharno = 0; /* reset global char number of line start */
|
|
|
6117
|
|
|
6118 /* Only use generic regexps or those for the current language. */
|
|
|
6119 if (rp->lang != NULL && rp->lang != curfdp->lang)
|
|
|
6120 continue;
|
|
|
6121
|
|
|
6122 while (match >= 0 && match < filebuf.len)
|
|
|
6123 {
|
|
|
6124 match = re_search (rp->pat, buffer, filebuf.len, charno,
|
|
|
6125 filebuf.len - match, &rp->regs);
|
|
|
6126 switch (match)
|
|
|
6127 {
|
|
|
6128 case -2:
|
|
|
6129 /* Some error. */
|
|
|
6130 if (!rp->error_signaled)
|
|
|
6131 {
|
|
|
6132 error ("regexp stack overflow while matching \"%s\"",
|
|
|
6133 rp->pattern);
|
|
|
6134 rp->error_signaled = TRUE;
|
|
|
6135 }
|
|
|
6136 break;
|
|
|
6137 case -1:
|
|
|
6138 /* No match. */
|
|
|
6139 break;
|
|
|
6140 default:
|
|
|
6141 if (match == rp->regs.end[0])
|
|
|
6142 {
|
|
|
6143 if (!rp->error_signaled)
|
|
|
6144 {
|
|
|
6145 error ("regexp matches the empty string: \"%s\"",
|
|
|
6146 rp->pattern);
|
|
|
6147 rp->error_signaled = TRUE;
|
|
|
6148 }
|
|
|
6149 match = -3; /* exit from while loop */
|
|
|
6150 break;
|
|
|
6151 }
|
|
|
6152
|
|
|
6153 /* Match occurred. Construct a tag. */
|
|
|
6154 while (charno < rp->regs.end[0])
|
|
|
6155 if (buffer[charno++] == '\n')
|
|
|
6156 lineno++, linecharno = charno;
|
|
|
6157 name = rp->name;
|
|
|
6158 if (name[0] == '\0')
|
|
|
6159 name = NULL;
|
|
|
6160 else /* make a named tag */
|
|
|
6161 name = substitute (buffer, rp->name, &rp->regs);
|
|
|
6162 if (rp->force_explicit_name)
|
|
|
6163 /* Force explicit tag name, if a name is there. */
|
|
|
6164 pfnote (name, TRUE, buffer + linecharno,
|
|
|
6165 charno - linecharno + 1, lineno, linecharno);
|
|
|
6166 else
|
|
|
6167 make_tag (name, strlen (name), TRUE, buffer + linecharno,
|
|
|
6168 charno - linecharno + 1, lineno, linecharno);
|
|
|
6169 break;
|
|
|
6170 }
|
|
|
6171 }
|
|
|
6172 }
|
|
|
6173 }
|
|
|
6174
|
|
428
|
6175
|
|
2225
|
6176 static bool
|
|
|
6177 nocase_tail (cp)
|
|
|
6178 char *cp;
|
|
428
|
6179 {
|
|
2225
|
6180 register int len = 0;
|
|
|
6181
|
|
|
6182 while (*cp != '\0' && lowcase (*cp) == lowcase (dbp[len]))
|
|
|
6183 cp++, len++;
|
|
|
6184 if (*cp == '\0' && !intoken (dbp[len]))
|
|
|
6185 {
|
|
|
6186 dbp += len;
|
|
|
6187 return TRUE;
|
|
|
6188 }
|
|
|
6189 return FALSE;
|
|
428
|
6190 }
|
|
|
6191
|
|
442
|
6192 static void
|
|
2225
|
6193 get_tag (bp, namepp)
|
|
|
6194 register char *bp;
|
|
|
6195 char **namepp;
|
|
428
|
6196 {
|
|
2225
|
6197 register char *cp = bp;
|
|
|
6198
|
|
|
6199 if (*bp != '\0')
|
|
|
6200 {
|
|
|
6201 /* Go till you get to white space or a syntactic break */
|
|
|
6202 for (cp = bp + 1; !notinname (*cp); cp++)
|
|
|
6203 continue;
|
|
|
6204 make_tag (bp, cp - bp, TRUE,
|
|
|
6205 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
6206 }
|
|
|
6207
|
|
|
6208 if (namepp != NULL)
|
|
|
6209 *namepp = savenstr (bp, cp - bp);
|
|
428
|
6210 }
|
|
|
6211
|
|
|
6212 /*
|
|
|
6213 * Read a line of text from `stream' into `lbp', excluding the
|
|
|
6214 * newline or CR-NL, if any. Return the number of characters read from
|
|
|
6215 * `stream', which is the length of the line including the newline.
|
|
|
6216 *
|
|
2225
|
6217 * On DOS or Windows we do not count the CR character, if any before the
|
|
|
6218 * NL, in the returned length; this mirrors the behavior of Emacs on those
|
|
428
|
6219 * platforms (for text files, it translates CR-NL to NL as it reads in the
|
|
|
6220 * file).
|
|
2225
|
6221 *
|
|
|
6222 * If multi-line regular expressions are requested, each line read is
|
|
|
6223 * appended to `filebuf'.
|
|
428
|
6224 */
|
|
442
|
6225 static long
|
|
428
|
6226 readline_internal (lbp, stream)
|
|
|
6227 linebuffer *lbp;
|
|
|
6228 register FILE *stream;
|
|
|
6229 {
|
|
|
6230 char *buffer = lbp->buffer;
|
|
|
6231 register char *p = lbp->buffer;
|
|
|
6232 register char *pend;
|
|
|
6233 int chars_deleted;
|
|
|
6234
|
|
|
6235 pend = p + lbp->size; /* Separate to avoid 386/IX compiler bug. */
|
|
|
6236
|
|
2225
|
6237 for (;;)
|
|
428
|
6238 {
|
|
|
6239 register int c = getc (stream);
|
|
|
6240 if (p == pend)
|
|
|
6241 {
|
|
|
6242 /* We're at the end of linebuffer: expand it. */
|
|
|
6243 lbp->size *= 2;
|
|
458
|
6244 xrnew (buffer, lbp->size, char);
|
|
428
|
6245 p += buffer - lbp->buffer;
|
|
|
6246 pend = buffer + lbp->size;
|
|
|
6247 lbp->buffer = buffer;
|
|
|
6248 }
|
|
|
6249 if (c == EOF)
|
|
|
6250 {
|
|
|
6251 *p = '\0';
|
|
|
6252 chars_deleted = 0;
|
|
|
6253 break;
|
|
|
6254 }
|
|
|
6255 if (c == '\n')
|
|
|
6256 {
|
|
|
6257 if (p > buffer && p[-1] == '\r')
|
|
|
6258 {
|
|
|
6259 p -= 1;
|
|
458
|
6260 #ifdef DOS_NT
|
|
428
|
6261 /* Assume CRLF->LF translation will be performed by Emacs
|
|
|
6262 when loading this file, so CRs won't appear in the buffer.
|
|
|
6263 It would be cleaner to compensate within Emacs;
|
|
|
6264 however, Emacs does not know how many CRs were deleted
|
|
|
6265 before any given point in the file. */
|
|
|
6266 chars_deleted = 1;
|
|
|
6267 #else
|
|
|
6268 chars_deleted = 2;
|
|
|
6269 #endif
|
|
|
6270 }
|
|
|
6271 else
|
|
|
6272 {
|
|
|
6273 chars_deleted = 1;
|
|
|
6274 }
|
|
|
6275 *p = '\0';
|
|
|
6276 break;
|
|
|
6277 }
|
|
|
6278 *p++ = c;
|
|
|
6279 }
|
|
|
6280 lbp->len = p - buffer;
|
|
|
6281
|
|
2225
|
6282 if (need_filebuf /* we need filebuf for multi-line regexps */
|
|
|
6283 && chars_deleted > 0) /* not at EOF */
|
|
|
6284 {
|
|
|
6285 while (filebuf.size <= filebuf.len + lbp->len + 1) /* +1 for \n */
|
|
|
6286 {
|
|
|
6287 /* Expand filebuf. */
|
|
|
6288 filebuf.size *= 2;
|
|
|
6289 xrnew (filebuf.buffer, filebuf.size, char);
|
|
|
6290 }
|
|
|
6291 strncpy (filebuf.buffer + filebuf.len, lbp->buffer, lbp->len);
|
|
|
6292 filebuf.len += lbp->len;
|
|
|
6293 filebuf.buffer[filebuf.len++] = '\n';
|
|
|
6294 filebuf.buffer[filebuf.len] = '\0';
|
|
|
6295 }
|
|
|
6296
|
|
428
|
6297 return lbp->len + chars_deleted;
|
|
|
6298 }
|
|
|
6299
|
|
|
6300 /*
|
|
|
6301 * Like readline_internal, above, but in addition try to match the
|
|
2225
|
6302 * input line against relevant regular expressions and manage #line
|
|
|
6303 * directives.
|
|
428
|
6304 */
|
|
2225
|
6305 static void
|
|
428
|
6306 readline (lbp, stream)
|
|
|
6307 linebuffer *lbp;
|
|
|
6308 FILE *stream;
|
|
|
6309 {
|
|
2225
|
6310 long result;
|
|
|
6311
|
|
|
6312 linecharno = charno; /* update global char number of line start */
|
|
|
6313 result = readline_internal (lbp, stream); /* read line */
|
|
|
6314 lineno += 1; /* increment global line number */
|
|
|
6315 charno += result; /* increment global char number */
|
|
|
6316
|
|
|
6317 /* Honour #line directives. */
|
|
|
6318 if (!no_line_directive)
|
|
|
6319 {
|
|
|
6320 static bool discard_until_line_directive;
|
|
|
6321
|
|
|
6322 /* Check whether this is a #line directive. */
|
|
|
6323 if (result > 12 && strneq (lbp->buffer, "#line ", 6))
|
|
|
6324 {
|
|
3876
|
6325 unsigned int lno;
|
|
|
6326 int start = 0;
|
|
|
6327
|
|
|
6328 if (sscanf (lbp->buffer, "#line %u \"%n", &lno, &start) >= 1
|
|
|
6329 && start > 0) /* double quote character found */
|
|
2225
|
6330 {
|
|
|
6331 char *endp = lbp->buffer + start;
|
|
|
6332
|
|
|
6333 while ((endp = etags_strchr (endp, '"')) != NULL
|
|
|
6334 && endp[-1] == '\\')
|
|
|
6335 endp++;
|
|
|
6336 if (endp != NULL)
|
|
|
6337 /* Ok, this is a real #line directive. Let's deal with it. */
|
|
|
6338 {
|
|
|
6339 char *taggedabsname; /* absolute name of original file */
|
|
|
6340 char *taggedfname; /* name of original file as given */
|
|
|
6341 char *name; /* temp var */
|
|
|
6342
|
|
|
6343 discard_until_line_directive = FALSE; /* found it */
|
|
|
6344 name = lbp->buffer + start;
|
|
|
6345 *endp = '\0';
|
|
|
6346 canonicalize_filename (name); /* for DOS */
|
|
3876
|
6347 taggedabsname = absolute_filename (name, tagfiledir);
|
|
2225
|
6348 if (filename_is_absolute (name)
|
|
|
6349 || filename_is_absolute (curfdp->infname))
|
|
|
6350 taggedfname = savestr (taggedabsname);
|
|
|
6351 else
|
|
|
6352 taggedfname = relative_filename (taggedabsname,tagfiledir);
|
|
|
6353
|
|
|
6354 if (streq (curfdp->taggedfname, taggedfname))
|
|
|
6355 /* The #line directive is only a line number change. We
|
|
|
6356 deal with this afterwards. */
|
|
|
6357 free (taggedfname);
|
|
|
6358 else
|
|
|
6359 /* The tags following this #line directive should be
|
|
|
6360 attributed to taggedfname. In order to do this, set
|
|
|
6361 curfdp accordingly. */
|
|
|
6362 {
|
|
|
6363 fdesc *fdp; /* file description pointer */
|
|
|
6364
|
|
|
6365 /* Go look for a file description already set up for the
|
|
|
6366 file indicated in the #line directive. If there is
|
|
|
6367 one, use it from now until the next #line
|
|
|
6368 directive. */
|
|
|
6369 for (fdp = fdhead; fdp != NULL; fdp = fdp->next)
|
|
|
6370 if (streq (fdp->infname, curfdp->infname)
|
|
|
6371 && streq (fdp->taggedfname, taggedfname))
|
|
|
6372 /* If we remove the second test above (after the &&)
|
|
|
6373 then all entries pertaining to the same file are
|
|
|
6374 coalesced in the tags file. If we use it, then
|
|
|
6375 entries pertaining to the same file but generated
|
|
|
6376 from different files (via #line directives) will
|
|
|
6377 go into separate sections in the tags file. These
|
|
|
6378 alternatives look equivalent. The first one
|
|
|
6379 destroys some apparently useless information. */
|
|
|
6380 {
|
|
|
6381 curfdp = fdp;
|
|
|
6382 free (taggedfname);
|
|
|
6383 break;
|
|
|
6384 }
|
|
|
6385 /* Else, if we already tagged the real file, skip all
|
|
|
6386 input lines until the next #line directive. */
|
|
|
6387 if (fdp == NULL) /* not found */
|
|
|
6388 for (fdp = fdhead; fdp != NULL; fdp = fdp->next)
|
|
|
6389 if (streq (fdp->infabsname, taggedabsname))
|
|
|
6390 {
|
|
|
6391 discard_until_line_directive = TRUE;
|
|
|
6392 free (taggedfname);
|
|
|
6393 break;
|
|
|
6394 }
|
|
|
6395 /* Else create a new file description and use that from
|
|
|
6396 now on, until the next #line directive. */
|
|
|
6397 if (fdp == NULL) /* not found */
|
|
|
6398 {
|
|
|
6399 fdp = fdhead;
|
|
|
6400 fdhead = xnew (1, fdesc);
|
|
|
6401 *fdhead = *curfdp; /* copy curr. file description */
|
|
|
6402 fdhead->next = fdp;
|
|
|
6403 fdhead->infname = savestr (curfdp->infname);
|
|
|
6404 fdhead->infabsname = savestr (curfdp->infabsname);
|
|
|
6405 fdhead->infabsdir = savestr (curfdp->infabsdir);
|
|
|
6406 fdhead->taggedfname = taggedfname;
|
|
|
6407 fdhead->usecharno = FALSE;
|
|
|
6408 fdhead->prop = NULL;
|
|
|
6409 fdhead->written = FALSE;
|
|
|
6410 curfdp = fdhead;
|
|
|
6411 }
|
|
|
6412 }
|
|
|
6413 free (taggedabsname);
|
|
|
6414 lineno = lno - 1;
|
|
|
6415 readline (lbp, stream);
|
|
|
6416 return;
|
|
|
6417 } /* if a real #line directive */
|
|
|
6418 } /* if #line is followed by a a number */
|
|
|
6419 } /* if line begins with "#line " */
|
|
|
6420
|
|
|
6421 /* If we are here, no #line directive was found. */
|
|
|
6422 if (discard_until_line_directive)
|
|
|
6423 {
|
|
|
6424 if (result > 0)
|
|
|
6425 {
|
|
|
6426 /* Do a tail recursion on ourselves, thus discarding the contents
|
|
|
6427 of the line buffer. */
|
|
|
6428 readline (lbp, stream);
|
|
|
6429 return;
|
|
|
6430 }
|
|
|
6431 /* End of file. */
|
|
|
6432 discard_until_line_directive = FALSE;
|
|
|
6433 return;
|
|
|
6434 }
|
|
|
6435 } /* if #line directives should be considered */
|
|
|
6436
|
|
|
6437 {
|
|
|
6438 int match;
|
|
|
6439 regexp *rp;
|
|
|
6440 char *name;
|
|
|
6441
|
|
|
6442 /* Match against relevant regexps. */
|
|
|
6443 if (lbp->len > 0)
|
|
|
6444 for (rp = p_head; rp != NULL; rp = rp->p_next)
|
|
|
6445 {
|
|
|
6446 /* Only use generic regexps or those for the current language.
|
|
|
6447 Also do not use multiline regexps, which is the job of
|
|
|
6448 regex_tag_multiline. */
|
|
|
6449 if ((rp->lang != NULL && rp->lang != fdhead->lang)
|
|
|
6450 || rp->multi_line)
|
|
|
6451 continue;
|
|
|
6452
|
|
|
6453 match = re_match (rp->pat, lbp->buffer, lbp->len, 0, &rp->regs);
|
|
|
6454 switch (match)
|
|
|
6455 {
|
|
|
6456 case -2:
|
|
|
6457 /* Some error. */
|
|
|
6458 if (!rp->error_signaled)
|
|
|
6459 {
|
|
|
6460 error ("regexp stack overflow while matching \"%s\"",
|
|
|
6461 rp->pattern);
|
|
|
6462 rp->error_signaled = TRUE;
|
|
|
6463 }
|
|
|
6464 break;
|
|
|
6465 case -1:
|
|
|
6466 /* No match. */
|
|
|
6467 break;
|
|
|
6468 case 0:
|
|
|
6469 /* Empty string matched. */
|
|
|
6470 if (!rp->error_signaled)
|
|
|
6471 {
|
|
|
6472 error ("regexp matches the empty string: \"%s\"", rp->pattern);
|
|
|
6473 rp->error_signaled = TRUE;
|
|
|
6474 }
|
|
|
6475 break;
|
|
|
6476 default:
|
|
|
6477 /* Match occurred. Construct a tag. */
|
|
|
6478 name = rp->name;
|
|
|
6479 if (name[0] == '\0')
|
|
|
6480 name = NULL;
|
|
|
6481 else /* make a named tag */
|
|
|
6482 name = substitute (lbp->buffer, rp->name, &rp->regs);
|
|
|
6483 if (rp->force_explicit_name)
|
|
|
6484 /* Force explicit tag name, if a name is there. */
|
|
|
6485 pfnote (name, TRUE, lbp->buffer, match, lineno, linecharno);
|
|
|
6486 else
|
|
|
6487 make_tag (name, strlen (name), TRUE,
|
|
|
6488 lbp->buffer, match, lineno, linecharno);
|
|
|
6489 break;
|
|
|
6490 }
|
|
|
6491 }
|
|
|
6492 }
|
|
428
|
6493 }
|
|
458
|
6494
|
|
428
|
6495
|
|
|
6496 /*
|
|
|
6497 * Return a pointer to a space of size strlen(cp)+1 allocated
|
|
|
6498 * with xnew where the string CP has been copied.
|
|
|
6499 */
|
|
442
|
6500 static char *
|
|
428
|
6501 savestr (cp)
|
|
|
6502 char *cp;
|
|
|
6503 {
|
|
|
6504 return savenstr (cp, strlen (cp));
|
|
|
6505 }
|
|
|
6506
|
|
|
6507 /*
|
|
|
6508 * Return a pointer to a space of size LEN+1 allocated with xnew where
|
|
|
6509 * the string CP has been copied for at most the first LEN characters.
|
|
|
6510 */
|
|
442
|
6511 static char *
|
|
428
|
6512 savenstr (cp, len)
|
|
|
6513 char *cp;
|
|
|
6514 int len;
|
|
|
6515 {
|
|
|
6516 register char *dp;
|
|
|
6517
|
|
|
6518 dp = xnew (len + 1, char);
|
|
|
6519 strncpy (dp, cp, len);
|
|
|
6520 dp[len] = '\0';
|
|
|
6521 return dp;
|
|
|
6522 }
|
|
|
6523
|
|
|
6524 /*
|
|
|
6525 * Return the ptr in sp at which the character c last
|
|
|
6526 * appears; NULL if not found
|
|
442
|
6527 *
|
|
|
6528 * Identical to POSIX strrchr, included for portability.
|
|
428
|
6529 */
|
|
442
|
6530 static char *
|
|
428
|
6531 etags_strrchr (sp, c)
|
|
442
|
6532 register const char *sp;
|
|
|
6533 register int c;
|
|
428
|
6534 {
|
|
438
|
6535 register const char *r;
|
|
428
|
6536
|
|
|
6537 r = NULL;
|
|
|
6538 do
|
|
|
6539 {
|
|
|
6540 if (*sp == c)
|
|
|
6541 r = sp;
|
|
|
6542 } while (*sp++);
|
|
442
|
6543 return (char *)r;
|
|
428
|
6544 }
|
|
|
6545
|
|
|
6546 /*
|
|
|
6547 * Return the ptr in sp at which the character c first
|
|
|
6548 * appears; NULL if not found
|
|
442
|
6549 *
|
|
|
6550 * Identical to POSIX strchr, included for portability.
|
|
428
|
6551 */
|
|
442
|
6552 static char *
|
|
428
|
6553 etags_strchr (sp, c)
|
|
442
|
6554 register const char *sp;
|
|
|
6555 register int c;
|
|
428
|
6556 {
|
|
|
6557 do
|
|
|
6558 {
|
|
|
6559 if (*sp == c)
|
|
442
|
6560 return (char *)sp;
|
|
428
|
6561 } while (*sp++);
|
|
|
6562 return NULL;
|
|
|
6563 }
|
|
|
6564
|
|
2225
|
6565 /*
|
|
|
6566 * Compare two strings, ignoring case for alphabetic characters.
|
|
|
6567 *
|
|
|
6568 * Same as BSD's strcasecmp, included for portability.
|
|
|
6569 */
|
|
|
6570 static int
|
|
|
6571 etags_strcasecmp (s1, s2)
|
|
|
6572 register const char *s1;
|
|
|
6573 register const char *s2;
|
|
|
6574 {
|
|
|
6575 while (*s1 != '\0'
|
|
|
6576 && (ISALPHA (*s1) && ISALPHA (*s2)
|
|
|
6577 ? lowcase (*s1) == lowcase (*s2)
|
|
|
6578 : *s1 == *s2))
|
|
|
6579 s1++, s2++;
|
|
|
6580
|
|
|
6581 return (ISALPHA (*s1) && ISALPHA (*s2)
|
|
|
6582 ? lowcase (*s1) - lowcase (*s2)
|
|
|
6583 : *s1 - *s2);
|
|
|
6584 }
|
|
|
6585
|
|
|
6586 /*
|
|
|
6587 * Compare two strings, ignoring case for alphabetic characters.
|
|
|
6588 * Stop after a given number of characters
|
|
|
6589 *
|
|
|
6590 * Same as BSD's strncasecmp, included for portability.
|
|
|
6591 */
|
|
|
6592 static int
|
|
|
6593 etags_strncasecmp (s1, s2, n)
|
|
|
6594 register const char *s1;
|
|
|
6595 register const char *s2;
|
|
|
6596 register int n;
|
|
|
6597 {
|
|
|
6598 while (*s1 != '\0' && n-- > 0
|
|
|
6599 && (ISALPHA (*s1) && ISALPHA (*s2)
|
|
|
6600 ? lowcase (*s1) == lowcase (*s2)
|
|
|
6601 : *s1 == *s2))
|
|
|
6602 s1++, s2++;
|
|
|
6603
|
|
|
6604 if (n < 0)
|
|
|
6605 return 0;
|
|
|
6606 else
|
|
|
6607 return (ISALPHA (*s1) && ISALPHA (*s2)
|
|
|
6608 ? lowcase (*s1) - lowcase (*s2)
|
|
|
6609 : *s1 - *s2);
|
|
|
6610 }
|
|
|
6611
|
|
2554
|
6612 /* Skip spaces (end of string is not space), return new pointer. */
|
|
442
|
6613 static char *
|
|
428
|
6614 skip_spaces (cp)
|
|
|
6615 char *cp;
|
|
|
6616 {
|
|
442
|
6617 while (iswhite (*cp))
|
|
428
|
6618 cp++;
|
|
|
6619 return cp;
|
|
|
6620 }
|
|
|
6621
|
|
2554
|
6622 /* Skip non spaces, except end of string, return new pointer. */
|
|
442
|
6623 static char *
|
|
428
|
6624 skip_non_spaces (cp)
|
|
|
6625 char *cp;
|
|
|
6626 {
|
|
442
|
6627 while (*cp != '\0' && !iswhite (*cp))
|
|
428
|
6628 cp++;
|
|
|
6629 return cp;
|
|
|
6630 }
|
|
|
6631
|
|
|
6632 /* Print error message and exit. */
|
|
458
|
6633 void
|
|
428
|
6634 fatal (s1, s2)
|
|
|
6635 char *s1, *s2;
|
|
|
6636 {
|
|
|
6637 error (s1, s2);
|
|
2225
|
6638 exit (EXIT_FAILURE);
|
|
428
|
6639 }
|
|
|
6640
|
|
442
|
6641 static void
|
|
428
|
6642 pfatal (s1)
|
|
|
6643 char *s1;
|
|
|
6644 {
|
|
|
6645 perror (s1);
|
|
2225
|
6646 exit (EXIT_FAILURE);
|
|
428
|
6647 }
|
|
|
6648
|
|
442
|
6649 static void
|
|
428
|
6650 suggest_asking_for_help ()
|
|
|
6651 {
|
|
2325
|
6652 fprintf (stderr, "\tTry `%s %s' for a complete list of options.\n",
|
|
3517
|
6653 progname, NO_LONG_OPTIONS ? "-h" : "--help");
|
|
2225
|
6654 exit (EXIT_FAILURE);
|
|
428
|
6655 }
|
|
|
6656
|
|
|
6657 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
|
|
442
|
6658 static void
|
|
428
|
6659 error (s1, s2)
|
|
|
6660 const char *s1, *s2;
|
|
|
6661 {
|
|
|
6662 fprintf (stderr, "%s: ", progname);
|
|
|
6663 fprintf (stderr, s1, s2);
|
|
|
6664 fprintf (stderr, "\n");
|
|
|
6665 }
|
|
|
6666
|
|
|
6667 /* Return a newly-allocated string whose contents
|
|
|
6668 concatenate those of s1, s2, s3. */
|
|
442
|
6669 static char *
|
|
428
|
6670 concat (s1, s2, s3)
|
|
|
6671 char *s1, *s2, *s3;
|
|
|
6672 {
|
|
|
6673 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3);
|
|
|
6674 char *result = xnew (len1 + len2 + len3 + 1, char);
|
|
|
6675
|
|
|
6676 strcpy (result, s1);
|
|
|
6677 strcpy (result + len1, s2);
|
|
|
6678 strcpy (result + len1 + len2, s3);
|
|
|
6679 result[len1 + len2 + len3] = '\0';
|
|
|
6680
|
|
|
6681 return result;
|
|
|
6682 }
|
|
458
|
6683
|
|
428
|
6684
|
|
|
6685 /* Does the same work as the system V getcwd, but does not need to
|
|
|
6686 guess the buffer size in advance. */
|
|
442
|
6687 static char *
|
|
428
|
6688 etags_getcwd ()
|
|
|
6689 {
|
|
|
6690 #ifdef HAVE_GETCWD
|
|
|
6691 int bufsize = 200;
|
|
|
6692 char *path = xnew (bufsize, char);
|
|
|
6693
|
|
|
6694 while (getcwd (path, bufsize) == NULL)
|
|
|
6695 {
|
|
|
6696 if (errno != ERANGE)
|
|
|
6697 pfatal ("getcwd");
|
|
|
6698 bufsize *= 2;
|
|
|
6699 free (path);
|
|
|
6700 path = xnew (bufsize, char);
|
|
|
6701 }
|
|
|
6702
|
|
|
6703 canonicalize_filename (path);
|
|
|
6704 return path;
|
|
|
6705
|
|
|
6706 #else /* not HAVE_GETCWD */
|
|
458
|
6707 #if MSDOS
|
|
|
6708
|
|
|
6709 char *p, path[MAXPATHLEN + 1]; /* Fixed size is safe on MSDOS. */
|
|
|
6710
|
|
|
6711 getwd (path);
|
|
|
6712
|
|
|
6713 for (p = path; *p != '\0'; p++)
|
|
|
6714 if (*p == '\\')
|
|
|
6715 *p = '/';
|
|
|
6716 else
|
|
|
6717 *p = lowcase (*p);
|
|
|
6718
|
|
|
6719 return strdup (path);
|
|
|
6720 #else /* not MSDOS */
|
|
428
|
6721 linebuffer path;
|
|
|
6722 FILE *pipe;
|
|
|
6723
|
|
2225
|
6724 linebuffer_init (&path);
|
|
428
|
6725 pipe = (FILE *) popen ("pwd 2>/dev/null", "r");
|
|
|
6726 if (pipe == NULL || readline_internal (&path, pipe) == 0)
|
|
|
6727 pfatal ("pwd");
|
|
|
6728 pclose (pipe);
|
|
|
6729
|
|
|
6730 return path.buffer;
|
|
458
|
6731 #endif /* not MSDOS */
|
|
428
|
6732 #endif /* not HAVE_GETCWD */
|
|
|
6733 }
|
|
|
6734
|
|
|
6735 /* Return a newly allocated string containing the file name of FILE
|
|
|
6736 relative to the absolute directory DIR (which should end with a slash). */
|
|
442
|
6737 static char *
|
|
428
|
6738 relative_filename (file, dir)
|
|
|
6739 char *file, *dir;
|
|
|
6740 {
|
|
|
6741 char *fp, *dp, *afn, *res;
|
|
|
6742 int i;
|
|
|
6743
|
|
|
6744 /* Find the common root of file and dir (with a trailing slash). */
|
|
|
6745 afn = absolute_filename (file, cwd);
|
|
|
6746 fp = afn;
|
|
|
6747 dp = dir;
|
|
|
6748 while (*fp++ == *dp++)
|
|
|
6749 continue;
|
|
|
6750 fp--, dp--; /* back to the first differing char */
|
|
458
|
6751 #ifdef DOS_NT
|
|
428
|
6752 if (fp == afn && afn[0] != '/') /* cannot build a relative name */
|
|
|
6753 return afn;
|
|
|
6754 #endif
|
|
|
6755 do /* look at the equal chars until '/' */
|
|
|
6756 fp--, dp--;
|
|
|
6757 while (*fp != '/');
|
|
|
6758
|
|
|
6759 /* Build a sequence of "../" strings for the resulting relative file name. */
|
|
|
6760 i = 0;
|
|
|
6761 while ((dp = etags_strchr (dp + 1, '/')) != NULL)
|
|
|
6762 i += 1;
|
|
|
6763 res = xnew (3*i + strlen (fp + 1) + 1, char);
|
|
|
6764 res[0] = '\0';
|
|
|
6765 while (i-- > 0)
|
|
|
6766 strcat (res, "../");
|
|
|
6767
|
|
|
6768 /* Add the file name relative to the common root of file and dir. */
|
|
|
6769 strcat (res, fp + 1);
|
|
|
6770 free (afn);
|
|
|
6771
|
|
|
6772 return res;
|
|
|
6773 }
|
|
|
6774
|
|
|
6775 /* Return a newly allocated string containing the absolute file name
|
|
|
6776 of FILE given DIR (which should end with a slash). */
|
|
442
|
6777 static char *
|
|
428
|
6778 absolute_filename (file, dir)
|
|
|
6779 char *file, *dir;
|
|
|
6780 {
|
|
|
6781 char *slashp, *cp, *res;
|
|
|
6782
|
|
|
6783 if (filename_is_absolute (file))
|
|
|
6784 res = savestr (file);
|
|
458
|
6785 #ifdef DOS_NT
|
|
428
|
6786 /* We don't support non-absolute file names with a drive
|
|
|
6787 letter, like `d:NAME' (it's too much hassle). */
|
|
|
6788 else if (file[1] == ':')
|
|
|
6789 fatal ("%s: relative file names with drive letters not supported", file);
|
|
|
6790 #endif
|
|
|
6791 else
|
|
|
6792 res = concat (dir, file, "");
|
|
|
6793
|
|
|
6794 /* Delete the "/dirname/.." and "/." substrings. */
|
|
|
6795 slashp = etags_strchr (res, '/');
|
|
|
6796 while (slashp != NULL && slashp[0] != '\0')
|
|
|
6797 {
|
|
|
6798 if (slashp[1] == '.')
|
|
|
6799 {
|
|
|
6800 if (slashp[2] == '.'
|
|
|
6801 && (slashp[3] == '/' || slashp[3] == '\0'))
|
|
|
6802 {
|
|
|
6803 cp = slashp;
|
|
|
6804 do
|
|
|
6805 cp--;
|
|
|
6806 while (cp >= res && !filename_is_absolute (cp));
|
|
|
6807 if (cp < res)
|
|
|
6808 cp = slashp; /* the absolute name begins with "/.." */
|
|
458
|
6809 #ifdef DOS_NT
|
|
|
6810 /* Under MSDOS and NT we get `d:/NAME' as absolute
|
|
428
|
6811 file name, so the luser could say `d:/../NAME'.
|
|
|
6812 We silently treat this as `d:/NAME'. */
|
|
|
6813 else if (cp[0] != '/')
|
|
|
6814 cp = slashp;
|
|
|
6815 #endif
|
|
|
6816 strcpy (cp, slashp + 3);
|
|
|
6817 slashp = cp;
|
|
|
6818 continue;
|
|
|
6819 }
|
|
|
6820 else if (slashp[2] == '/' || slashp[2] == '\0')
|
|
|
6821 {
|
|
|
6822 strcpy (slashp, slashp + 2);
|
|
|
6823 continue;
|
|
|
6824 }
|
|
|
6825 }
|
|
|
6826
|
|
|
6827 slashp = etags_strchr (slashp + 1, '/');
|
|
|
6828 }
|
|
|
6829
|
|
3517
|
6830 if (res[0] == '\0') /* just a safety net: should never happen */
|
|
|
6831 {
|
|
|
6832 free (res);
|
|
|
6833 return savestr ("/");
|
|
|
6834 }
|
|
428
|
6835 else
|
|
|
6836 return res;
|
|
|
6837 }
|
|
|
6838
|
|
|
6839 /* Return a newly allocated string containing the absolute
|
|
|
6840 file name of dir where FILE resides given DIR (which should
|
|
|
6841 end with a slash). */
|
|
442
|
6842 static char *
|
|
428
|
6843 absolute_dirname (file, dir)
|
|
|
6844 char *file, *dir;
|
|
|
6845 {
|
|
|
6846 char *slashp, *res;
|
|
|
6847 char save;
|
|
|
6848
|
|
|
6849 canonicalize_filename (file);
|
|
|
6850 slashp = etags_strrchr (file, '/');
|
|
|
6851 if (slashp == NULL)
|
|
|
6852 return savestr (dir);
|
|
|
6853 save = slashp[1];
|
|
|
6854 slashp[1] = '\0';
|
|
|
6855 res = absolute_filename (file, dir);
|
|
|
6856 slashp[1] = save;
|
|
|
6857
|
|
|
6858 return res;
|
|
|
6859 }
|
|
|
6860
|
|
|
6861 /* Whether the argument string is an absolute file name. The argument
|
|
|
6862 string must have been canonicalized with canonicalize_filename. */
|
|
442
|
6863 static bool
|
|
428
|
6864 filename_is_absolute (fn)
|
|
|
6865 char *fn;
|
|
|
6866 {
|
|
|
6867 return (fn[0] == '/'
|
|
458
|
6868 #ifdef DOS_NT
|
|
|
6869 || (ISALPHA(fn[0]) && fn[1] == ':' && fn[2] == '/')
|
|
428
|
6870 #endif
|
|
|
6871 );
|
|
|
6872 }
|
|
|
6873
|
|
|
6874 /* Translate backslashes into slashes. Works in place. */
|
|
442
|
6875 static void
|
|
428
|
6876 canonicalize_filename (fn)
|
|
|
6877 register char *fn;
|
|
|
6878 {
|
|
458
|
6879 #ifdef DOS_NT
|
|
428
|
6880 /* Canonicalize drive letter case. */
|
|
458
|
6881 if (fn[0] != '\0' && fn[1] == ':' && ISLOWER (fn[0]))
|
|
|
6882 fn[0] = upcase (fn[0]);
|
|
428
|
6883 /* Convert backslashes to slashes. */
|
|
|
6884 for (; *fn != '\0'; fn++)
|
|
|
6885 if (*fn == '\\')
|
|
|
6886 *fn = '/';
|
|
|
6887 #else
|
|
|
6888 /* No action. */
|
|
|
6889 fn = NULL; /* shut up the compiler */
|
|
|
6890 #endif
|
|
|
6891 }
|
|
|
6892
|
|
2225
|
6893
|
|
|
6894 /* Initialize a linebuffer for use */
|
|
|
6895 static void
|
|
|
6896 linebuffer_init (lbp)
|
|
|
6897 linebuffer *lbp;
|
|
|
6898 {
|
|
|
6899 lbp->size = (DEBUG) ? 3 : 200;
|
|
|
6900 lbp->buffer = xnew (lbp->size, char);
|
|
|
6901 lbp->buffer[0] = '\0';
|
|
|
6902 lbp->len = 0;
|
|
|
6903 }
|
|
|
6904
|
|
458
|
6905 /* Set the minimum size of a string contained in a linebuffer. */
|
|
442
|
6906 static void
|
|
458
|
6907 linebuffer_setlen (lbp, toksize)
|
|
428
|
6908 linebuffer *lbp;
|
|
|
6909 int toksize;
|
|
|
6910 {
|
|
458
|
6911 while (lbp->size <= toksize)
|
|
|
6912 {
|
|
|
6913 lbp->size *= 2;
|
|
|
6914 xrnew (lbp->buffer, lbp->size, char);
|
|
|
6915 }
|
|
|
6916 lbp->len = toksize;
|
|
428
|
6917 }
|
|
|
6918
|
|
2225
|
6919 /* Like malloc but get fatal error if memory is exhausted. */
|
|
|
6920 static PTR
|
|
428
|
6921 xmalloc (size)
|
|
|
6922 unsigned int size;
|
|
|
6923 {
|
|
709
|
6924 PTR result = (PTR) malloc (size);
|
|
428
|
6925 if (result == NULL)
|
|
|
6926 fatal ("virtual memory exhausted", (char *)NULL);
|
|
|
6927 return result;
|
|
|
6928 }
|
|
|
6929
|
|
2225
|
6930 static PTR
|
|
428
|
6931 xrealloc (ptr, size)
|
|
|
6932 char *ptr;
|
|
|
6933 unsigned int size;
|
|
|
6934 {
|
|
709
|
6935 PTR result = (PTR) realloc (ptr, size);
|
|
428
|
6936 if (result == NULL)
|
|
|
6937 fatal ("virtual memory exhausted", (char *)NULL);
|
|
|
6938 return result;
|
|
|
6939 }
|
|
709
|
6940
|
|
|
6941 /*
|
|
|
6942 * Local Variables:
|
|
|
6943 * indent-tabs-mode: t
|
|
|
6944 * tab-width: 8
|
|
2225
|
6945 * fill-column: 79
|
|
|
6946 * c-font-lock-extra-types: ("FILE" "bool" "language" "linebuffer" "fdesc" "node" "regexp")
|
|
3972
|
6947 * c-file-style: "gnu"
|
|
709
|
6948 * End:
|
|
|
6949 */
|
|
2225
|
6950
|
|
|
6951 /* arch-tag: 8a9b748d-390c-4922-99db-2eeefa921051
|
|
|
6952 (do not change this comment) */
|
|
|
6953
|
|
|
6954 /* etags.c ends here */
|
