|
0
|
1 /* Tags file maker to go with GNU Emacs
|
|
|
2 Copyright (C) 1984, 87, 88, 89, 93, 94, 95
|
|
|
3 Free Software Foundation, Inc. and Ken Arnold
|
|
4
|
4
|
|
0
|
5 This file is not considered part of GNU Emacs.
|
|
|
6
|
|
|
7 This program is free software; you can redistribute it and/or modify
|
|
|
8 it under the terms of the GNU General Public License as published by
|
|
|
9 the Free Software Foundation; either version 2 of the License, or
|
|
|
10 (at your option) any later version.
|
|
|
11
|
|
|
12 This program is distributed in the hope that it will be useful,
|
|
|
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
15 GNU General Public License for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
4
|
18 along with this program; if not, write to the Free Software Foundation,
|
|
|
19 Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
|
0
|
20
|
|
|
21 /*
|
|
|
22 * Authors:
|
|
|
23 * Ctags originally by Ken Arnold.
|
|
|
24 * Fortran added by Jim Kleckner.
|
|
|
25 * Ed Pelegri-Llopart added C typedefs.
|
|
|
26 * Gnu Emacs TAGS format and modifications by RMS?
|
|
|
27 * Sam Kendall added C++.
|
|
|
28 * Francesco Potorti` reorganised C and C++ based on work by Joe Wells.
|
|
|
29 * Regexp tags by Tom Tromey.
|
|
|
30 *
|
|
4
|
31 * Francesco Potorti` (F.Potorti@cnuce.cnr.it) is the current maintainer.
|
|
0
|
32 */
|
|
|
33
|
|
201
|
34 char pot_etags_version[] = "@(#) pot revision number is 12.28";
|
|
0
|
35
|
|
272
|
36 /* Prototyping magic snarfed from gmalloc.c */
|
|
|
37 #if defined (__cplusplus) || defined (__STDC__)
|
|
|
38 #undef PP
|
|
|
39 #define PP(args) args
|
|
|
40 #undef __ptr_t
|
|
|
41 #define __ptr_t void *
|
|
|
42 #else /* Not C++ or ANSI C. */
|
|
|
43 #undef PP
|
|
|
44 #define PP(args) ()
|
|
|
45 #undef const
|
|
|
46 #define const
|
|
|
47 #undef __ptr_t
|
|
|
48 #define __ptr_t char *
|
|
|
49 #endif /* C++ or ANSI C. */
|
|
|
50
|
|
|
51 #ifdef HAVE_CONFIG_H
|
|
|
52 # include <config.h>
|
|
|
53 /* On some systems, Emacs defines static as nothing for the sake
|
|
|
54 of unexec. We don't want that here since we don't use unexec. */
|
|
|
55 # undef static
|
|
|
56 # define ETAGS_REGEXPS /* use the regexp features */
|
|
|
57 # define LONG_OPTIONS /* accept long options */
|
|
|
58 #endif /* HAVE_CONFIG_H */
|
|
|
59
|
|
0
|
60 #define TRUE 1
|
|
|
61 #define FALSE 0
|
|
4
|
62
|
|
0
|
63 #ifndef DEBUG
|
|
|
64 # define DEBUG FALSE
|
|
|
65 #endif
|
|
|
66
|
|
|
67 #ifdef MSDOS
|
|
4
|
68 # include <fcntl.h>
|
|
|
69 # include <sys/param.h>
|
|
173
|
70 # include <io.h>
|
|
|
71 # ifndef HAVE_CONFIG_H
|
|
|
72 # define DOS_NT
|
|
|
73 # include <sys/config.h>
|
|
|
74 # endif
|
|
0
|
75 #endif /* MSDOS */
|
|
|
76
|
|
|
77 #ifdef WINDOWSNT
|
|
4
|
78 # include <stdlib.h>
|
|
|
79 # include <fcntl.h>
|
|
|
80 # include <string.h>
|
|
|
81 # include <io.h>
|
|
|
82 # define MAXPATHLEN _MAX_PATH
|
|
173
|
83 # ifdef HAVE_CONFIG_H
|
|
|
84 # undef HAVE_NTGUI
|
|
|
85 # else
|
|
|
86 # define DOS_NT
|
|
|
87 # define HAVE_GETCWD
|
|
|
88 # endif /* not HAVE_CONFIG_H */
|
|
|
89 #endif /* WINDOWSNT */
|
|
4
|
90
|
|
173
|
91 #if !defined (WINDOWSNT) && defined (STDC_HEADERS)
|
|
142
|
92 #include <stdlib.h>
|
|
|
93 #include <string.h>
|
|
|
94 #endif
|
|
|
95
|
|
173
|
96 #ifdef HAVE_UNISTD_H
|
|
|
97 # include <unistd.h>
|
|
|
98 #else
|
|
|
99 # ifdef HAVE_GETCWD
|
|
|
100 extern char *getcwd ();
|
|
|
101 # endif
|
|
|
102 #endif /* HAVE_UNISTD_H */
|
|
|
103
|
|
0
|
104 #include <stdio.h>
|
|
|
105 #include <ctype.h>
|
|
|
106 #include <errno.h>
|
|
|
107 #ifndef errno
|
|
173
|
108 extern int errno;
|
|
0
|
109 #endif
|
|
|
110 #include <sys/types.h>
|
|
|
111 #include <sys/stat.h>
|
|
|
112
|
|
|
113 #if !defined (S_ISREG) && defined (S_IFREG)
|
|
|
114 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
|
|
|
115 #endif
|
|
|
116
|
|
155
|
117 #ifdef LONG_OPTIONS
|
|
173
|
118 # include <getopt.h>
|
|
155
|
119 #else
|
|
|
120 # define getopt_long(argc,argv,optstr,lopts,lind) getopt (argc, argv, optstr)
|
|
|
121 extern char *optarg;
|
|
|
122 extern int optind, opterr;
|
|
|
123 #endif /* LONG_OPTIONS */
|
|
0
|
124
|
|
|
125 #ifdef ETAGS_REGEXPS
|
|
173
|
126 # include <regex.h>
|
|
0
|
127 #endif /* ETAGS_REGEXPS */
|
|
|
128
|
|
|
129 /* Define CTAGS to make the program "ctags" compatible with the usual one.
|
|
134
|
130 Leave it undefined to make the program "etags", which makes emacs-style
|
|
0
|
131 tag tables and tags typedefs, #defines and struct/union/enum by default. */
|
|
|
132 #ifdef CTAGS
|
|
|
133 # undef CTAGS
|
|
|
134 # define CTAGS TRUE
|
|
|
135 #else
|
|
|
136 # define CTAGS FALSE
|
|
|
137 #endif
|
|
|
138
|
|
|
139 /* Exit codes for success and failure. */
|
|
|
140 #ifdef VMS
|
|
4
|
141 # define GOOD 1
|
|
|
142 # define BAD 0
|
|
0
|
143 #else
|
|
4
|
144 # define GOOD 0
|
|
|
145 # define BAD 1
|
|
0
|
146 #endif
|
|
|
147
|
|
|
148 /* C extensions. */
|
|
|
149 #define C_PLPL 0x00001 /* C++ */
|
|
|
150 #define C_STAR 0x00003 /* C* */
|
|
149
|
151 #define C_JAVA 0x00005 /* JAVA */
|
|
0
|
152 #define YACC 0x10000 /* yacc file */
|
|
|
153
|
|
134
|
154 #define streq(s,t) ((DEBUG && (s) == NULL && (t) == NULL \
|
|
|
155 && (abort (), 1)) || !strcmp (s, t))
|
|
|
156 #define strneq(s,t,n) ((DEBUG && (s) == NULL && (t) == NULL \
|
|
|
157 && (abort (), 1)) || !strncmp (s, t, n))
|
|
4
|
158
|
|
|
159 #define lowcase(c) tolower ((char)c)
|
|
|
160
|
|
153
|
161 #define CHARS 256 /* 2^sizeof(char) */
|
|
201
|
162 #define CHAR(x) ((unsigned int)x & (CHARS - 1))
|
|
153
|
163 #define iswhite(c) (_wht[CHAR(c)]) /* c is white */
|
|
|
164 #define notinname(c) (_nin[CHAR(c)]) /* c is not in a name */
|
|
|
165 #define begtoken(c) (_btk[CHAR(c)]) /* c can start token */
|
|
|
166 #define intoken(c) (_itk[CHAR(c)]) /* c can be in token */
|
|
|
167 #define endtoken(c) (_etk[CHAR(c)]) /* c ends tokens */
|
|
0
|
168
|
|
278
|
169 /*#ifdef INFODOCK*/
|
|
|
170 /*#undef OO_BROWSER*/
|
|
|
171 /* Due to the way this file is constructed, this unfortunately doesn't */
|
|
|
172 /* work except for documentation purposes. -slb */
|
|
276
|
173 #define OO_BROWSER 1
|
|
278
|
174 /*#endif*/
|
|
276
|
175
|
|
|
176 #ifdef OO_BROWSER
|
|
|
177 #define set_construct(construct) \
|
|
|
178 if (!oo_browser_construct) oo_browser_construct = construct
|
|
|
179 void oo_browser_clear_all_globals();
|
|
|
180 void oo_browser_clear_some_globals();
|
|
|
181 void oo_browser_check_and_clear_structtype();
|
|
|
182 #endif
|
|
0
|
183
|
|
|
184 /*
|
|
201
|
185 * xnew, xrnew -- allocate, reallocate storage
|
|
0
|
186 *
|
|
|
187 * SYNOPSIS: Type *xnew (int n, Type);
|
|
201
|
188 * Type *xrnew (OldPointer, int n, Type);
|
|
0
|
189 */
|
|
142
|
190 #ifdef chkmalloc
|
|
|
191 # include "chkmalloc.h"
|
|
201
|
192 # define xnew(n,Type) ((Type *) trace_malloc (__FILE__, __LINE__, \
|
|
|
193 (n) * sizeof (Type)))
|
|
|
194 # define xrnew(op,n,Type) ((Type *) trace_realloc (__FILE__, __LINE__, \
|
|
|
195 (op), (n) * sizeof (Type)))
|
|
142
|
196 #else
|
|
201
|
197 # define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
|
|
|
198 # define xrnew(op,n,Type) ((Type *) xrealloc ((op), (n) * sizeof (Type)))
|
|
142
|
199 #endif
|
|
0
|
200
|
|
155
|
201 typedef int bool;
|
|
0
|
202
|
|
201
|
203 typedef void Lang_function ();
|
|
|
204
|
|
|
205 typedef struct
|
|
|
206 {
|
|
|
207 char *name;
|
|
|
208 Lang_function *function;
|
|
|
209 char **suffixes;
|
|
|
210 char **interpreters;
|
|
|
211 } language;
|
|
|
212
|
|
|
213 typedef struct node_st
|
|
4
|
214 { /* sorting structure */
|
|
0
|
215 char *name; /* function or type name */
|
|
276
|
216 #ifdef OO_BROWSER
|
|
|
217 short int construct; /* Construct type for the OO-Browser */
|
|
|
218 #endif
|
|
0
|
219 char *file; /* file name */
|
|
155
|
220 bool is_func; /* use pattern or line no */
|
|
|
221 bool been_warned; /* set if noticed dup */
|
|
4
|
222 int lno; /* line number tag is on */
|
|
0
|
223 long cno; /* character number line starts on */
|
|
|
224 char *pat; /* search pattern */
|
|
201
|
225 struct node_st *left, *right; /* left and right sons */
|
|
|
226 } node;
|
|
|
227
|
|
276
|
228 #ifdef OO_BROWSER
|
|
|
229 /* If you add to this array, you must add a corresponding entry to the
|
|
|
230 following enum. */
|
|
|
231 static char *oo_browser_default_classes[] =
|
|
|
232 /* Lack of square brackets around some of these entries are intentional. */
|
|
|
233 {"null", "class", "method", "[constant]", "[enumeration]", "[enum_label]",
|
|
|
234 "extern", "[function]", "[macro]", "objc", "[structure]", "[type]",
|
|
|
235 "[union]", "[variable]"};
|
|
|
236
|
|
|
237 /* If you add to this enum, you must add a corresponding entry to the
|
|
|
238 preceding array. */
|
|
|
239 enum oo_browser_constructs {C_NULL, C_CLASS, C_METHOD, C_CONSTANT, C_ENUMERATION,
|
|
|
240 C_ENUM_LABEL, C_EXTERN, C_FUNCTION, C_MACRO,
|
|
|
241 C_OBJC, C_STRUCTURE, C_TYPE, C_UNION, C_VARIABLE};
|
|
|
242
|
|
|
243 enum oo_browser_constructs oo_browser_construct = C_NULL;
|
|
|
244 #endif
|
|
|
245
|
|
201
|
246 /*
|
|
|
247 * A `linebuffer' is a structure which holds a line of text.
|
|
|
248 * `readline_internal' reads a line from a stream into a linebuffer
|
|
|
249 * and works regardless of the length of the line.
|
|
|
250 * SIZE is the size of BUFFER, LEN is the length of the string in
|
|
|
251 * BUFFER after readline reads it.
|
|
|
252 */
|
|
|
253 typedef struct
|
|
|
254 {
|
|
|
255 long size;
|
|
|
256 int len;
|
|
|
257 char *buffer;
|
|
|
258 } linebuffer;
|
|
|
259
|
|
|
260 extern char *getenv PP ((const char *envvar));
|
|
|
261
|
|
153
|
262 /* Many compilers barf on this:
|
|
|
263 Lang_function Asm_labels;
|
|
|
264 so let's write it this way */
|
|
201
|
265 void Asm_labels PP ((FILE *inf));
|
|
|
266 void C_entries PP ((int c_ext, FILE *inf));
|
|
|
267 void default_C_entries PP ((FILE *inf));
|
|
|
268 void plain_C_entries PP ((FILE *inf));
|
|
|
269 void Cjava_entries PP ((FILE *inf));
|
|
|
270 void Cplusplus_entries PP ((FILE *inf));
|
|
|
271 void Yacc_entries PP ((FILE *inf));
|
|
|
272 void Cobol_paragraphs PP ((FILE *inf));
|
|
|
273 void Cstar_entries PP ((FILE *inf));
|
|
|
274 void Erlang_functions PP ((FILE *inf));
|
|
|
275 void Fortran_functions PP ((FILE *inf));
|
|
|
276 void Lisp_functions PP ((FILE *inf));
|
|
|
277 void Pascal_functions PP ((FILE *inf));
|
|
|
278 void Perl_functions PP ((FILE *inf));
|
|
|
279 void Postscript_functions PP ((FILE *inf));
|
|
|
280 void Prolog_functions PP ((FILE *inf));
|
|
|
281 void Python_functions PP ((FILE *inf));
|
|
|
282 void Scheme_functions PP ((FILE *inf));
|
|
|
283 void TeX_functions PP ((FILE *inf));
|
|
|
284 void just_read_file PP ((FILE *inf));
|
|
|
285
|
|
|
286 void print_language_names PP ((void));
|
|
|
287 void print_version PP ((void));
|
|
|
288 void print_help PP ((void));
|
|
|
289
|
|
|
290 language *get_language_from_name PP ((char *name));
|
|
|
291 language *get_language_from_interpreter PP ((char *interpreter));
|
|
|
292 language *get_language_from_suffix PP ((char *suffix));
|
|
|
293 int total_size_of_entries PP ((node *np));
|
|
|
294 long readline PP ((linebuffer *lbp, FILE *stream));
|
|
|
295 long readline_internal PP ((linebuffer *lbp, FILE *stream));
|
|
0
|
296 #ifdef ETAGS_REGEXPS
|
|
201
|
297 void analyse_regex PP ((char *regex_arg));
|
|
|
298 void add_regex PP ((char *regexp_pattern, language *lang));
|
|
|
299 void free_patterns PP ((void));
|
|
155
|
300 #endif /* ETAGS_REGEXPS */
|
|
201
|
301 void error PP ((const char *s1, const char *s2));
|
|
|
302 void suggest_asking_for_help PP ((void));
|
|
|
303 void fatal PP ((char *s1, char *s2));
|
|
|
304 void pfatal PP ((char *s1));
|
|
|
305 void add_node PP ((node *np, node **cur_node_p));
|
|
|
306
|
|
|
307 void init PP ((void));
|
|
|
308 void initbuffer PP ((linebuffer *lbp));
|
|
|
309 void find_entries PP ((char *file, FILE *inf));
|
|
|
310 void free_tree PP ((node *np));
|
|
|
311 void pfnote PP ((char *name, bool is_func, char *linestart, int linelen, int lno, long cno));
|
|
|
312 void new_pfnote PP ((char *name, int namelen, bool is_func, char *linestart, int linelen, int lno, long cno));
|
|
|
313 void process_file PP ((char *file));
|
|
|
314 void put_entries PP ((node *np));
|
|
|
315 void takeprec PP ((void));
|
|
|
316
|
|
|
317 char *concat PP ((char *s1, char *s2, char *s3));
|
|
|
318 char *skip_spaces PP ((char *cp));
|
|
|
319 char *skip_non_spaces PP ((char *cp));
|
|
|
320 char *savenstr PP ((char *cp, int len));
|
|
|
321 char *savestr PP ((char *cp));
|
|
|
322 char *etags_strchr PP ((char *sp, int c));
|
|
|
323 char *etags_strrchr PP ((char *sp, int c));
|
|
|
324 char *etags_getcwd PP ((void));
|
|
|
325 char *relative_filename PP ((char *file, char *dir));
|
|
|
326 char *absolute_filename PP ((char *file, char *dir));
|
|
|
327 char *absolute_dirname PP ((char *file, char *dir));
|
|
|
328 bool filename_is_absolute PP ((char *fn));
|
|
|
329 void canonicalize_filename PP ((char *fn));
|
|
|
330 void grow_linebuffer PP ((linebuffer *lbp, int toksize));
|
|
|
331 long *xmalloc PP ((unsigned int size));
|
|
|
332 long *xrealloc PP ((char *ptr, unsigned int size));
|
|
0
|
333
|
|
|
334
|
|
|
335 char searchar = '/'; /* use /.../ searches */
|
|
|
336
|
|
|
337 char *tagfile; /* output file */
|
|
4
|
338 char *progname; /* name this program was invoked with */
|
|
0
|
339 char *cwd; /* current working directory */
|
|
|
340 char *tagfiledir; /* directory of tagfile */
|
|
|
341 FILE *tagf; /* ioptr for tags file */
|
|
201
|
342
|
|
|
343 char *curfile; /* current input file name */
|
|
|
344 language *curlang; /* current language */
|
|
|
345
|
|
|
346 int lineno; /* line number of current line */
|
|
|
347 long charno; /* current character number */
|
|
|
348 long linecharno; /* charno of start of current line */
|
|
|
349 char *dbp; /* pointer to start of current tag */
|
|
|
350 node *head; /* the head of the binary tree of tags */
|
|
|
351
|
|
|
352 linebuffer lb; /* the current line */
|
|
|
353 linebuffer token_name; /* used by C_entries as a temporary area */
|
|
0
|
354 struct
|
|
|
355 {
|
|
|
356 long linepos;
|
|
201
|
357 linebuffer lb; /* used by C_entries instead of lb */
|
|
0
|
358 } lbs[2];
|
|
|
359
|
|
|
360 /* boolean "functions" (see init) */
|
|
155
|
361 bool _wht[CHARS], _nin[CHARS], _itk[CHARS], _btk[CHARS], _etk[CHARS];
|
|
4
|
362 char
|
|
|
363 /* white chars */
|
|
173
|
364 *white = " \f\t\n\r",
|
|
153
|
365 /* not in a name */
|
|
201
|
366 *nonam = " \f\t\n\r(=,[;",
|
|
4
|
367 /* token ending chars */
|
|
173
|
368 *endtk = " \t\n\r\"'#()[]{}=-+%*/&|^~!<>;,.:?",
|
|
4
|
369 /* token starting chars */
|
|
|
370 *begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~@",
|
|
|
371 /* valid in-token chars */
|
|
153
|
372 *midtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
|
|
0
|
373
|
|
155
|
374 bool append_to_tagfile; /* -a: append to tags */
|
|
|
375 /* The following four default to TRUE for etags, but to FALSE for ctags. */
|
|
|
376 bool typedefs; /* -t: create tags for C typedefs */
|
|
|
377 bool typedefs_and_cplusplus; /* -T: create tags for C typedefs, level */
|
|
0
|
378 /* 0 struct/enum/union decls, and C++ */
|
|
|
379 /* member functions. */
|
|
155
|
380 bool constantypedefs; /* -d: create tags for C #define, enum */
|
|
153
|
381 /* constants and variables. */
|
|
0
|
382 /* -D: opposite of -d. Default under ctags. */
|
|
201
|
383 bool globals; /* create tags for global variables */
|
|
155
|
384 bool members; /* create tags for C member variables */
|
|
|
385 bool update; /* -u: update tags */
|
|
|
386 bool vgrind_style; /* -v: create vgrind style index output */
|
|
|
387 bool no_warnings; /* -w: suppress warnings */
|
|
|
388 bool cxref_style; /* -x: create cxref style output */
|
|
|
389 bool cplusplus; /* .[hc] means C++, not C */
|
|
|
390 bool noindentypedefs; /* -I: ignore indentation in C */
|
|
276
|
391 #ifdef OO_BROWSER
|
|
|
392 bool oo_browser_format; /* -O: OO-Browser tags format */
|
|
|
393 #endif
|
|
155
|
394
|
|
|
395 #ifdef LONG_OPTIONS
|
|
0
|
396 struct option longopts[] =
|
|
|
397 {
|
|
155
|
398 { "append", no_argument, NULL, 'a' },
|
|
|
399 { "backward-search", no_argument, NULL, 'B' },
|
|
|
400 { "c++", no_argument, NULL, 'C' },
|
|
|
401 { "cxref", no_argument, NULL, 'x' },
|
|
|
402 { "defines", no_argument, NULL, 'd' },
|
|
|
403 { "no-defines", no_argument, NULL, 'D' },
|
|
|
404 { "globals", no_argument, &globals, TRUE },
|
|
|
405 { "no-globals", no_argument, &globals, FALSE },
|
|
|
406 { "help", no_argument, NULL, 'h' },
|
|
|
407 { "help", no_argument, NULL, 'H' },
|
|
|
408 { "ignore-indentation", no_argument, NULL, 'I' },
|
|
|
409 { "include", required_argument, NULL, 'i' },
|
|
|
410 { "language", required_argument, NULL, 'l' },
|
|
|
411 { "members", no_argument, &members, TRUE },
|
|
|
412 { "no-members", no_argument, &members, FALSE },
|
|
|
413 { "no-warn", no_argument, NULL, 'w' },
|
|
|
414 { "output", required_argument, NULL, 'o' },
|
|
276
|
415 #ifdef OO_BROWSER
|
|
|
416 { "oo-browser", no_argument, NULL, 'O' },
|
|
|
417 #endif
|
|
155
|
418 #ifdef ETAGS_REGEXPS
|
|
|
419 { "regex", required_argument, NULL, 'r' },
|
|
|
420 { "no-regex", no_argument, NULL, 'R' },
|
|
|
421 #endif /* ETAGS_REGEXPS */
|
|
|
422 { "typedefs", no_argument, NULL, 't' },
|
|
|
423 { "typedefs-and-c++", no_argument, NULL, 'T' },
|
|
|
424 { "update", no_argument, NULL, 'u' },
|
|
|
425 { "version", no_argument, NULL, 'V' },
|
|
|
426 { "vgrind", no_argument, NULL, 'v' },
|
|
0
|
427 { 0 }
|
|
|
428 };
|
|
155
|
429 #endif /* LONG_OPTIONS */
|
|
0
|
430
|
|
|
431 #ifdef ETAGS_REGEXPS
|
|
|
432 /* Structure defining a regular expression. Elements are
|
|
|
433 the compiled pattern, and the name string. */
|
|
201
|
434 typedef struct pattern
|
|
0
|
435 {
|
|
201
|
436 struct pattern *p_next;
|
|
|
437 language *language;
|
|
|
438 char *regex;
|
|
0
|
439 struct re_pattern_buffer *pattern;
|
|
|
440 struct re_registers regs;
|
|
|
441 char *name_pattern;
|
|
155
|
442 bool error_signaled;
|
|
201
|
443 } pattern;
|
|
0
|
444
|
|
|
445 /* Array of all regexps. */
|
|
201
|
446 pattern *p_head = NULL;
|
|
0
|
447 #endif /* ETAGS_REGEXPS */
|
|
|
448
|
|
|
449 /*
|
|
|
450 * Language stuff.
|
|
|
451 */
|
|
|
452
|
|
|
453 /* Non-NULL if language fixed. */
|
|
201
|
454 language *forced_lang = NULL;
|
|
0
|
455
|
|
|
456 /* Assembly code */
|
|
4
|
457 char *Asm_suffixes [] = { "a", /* Unix assembler */
|
|
0
|
458 "asm", /* Microcontroller assembly */
|
|
|
459 "def", /* BSO/Tasking definition includes */
|
|
|
460 "inc", /* Microcontroller include files */
|
|
|
461 "ins", /* Microcontroller include files */
|
|
|
462 "s", "sa", /* Unix assembler */
|
|
|
463 "src", /* BSO/Tasking C compiler output */
|
|
|
464 NULL
|
|
|
465 };
|
|
|
466
|
|
|
467 /* Note that .c and .h can be considered C++, if the --c++ flag was
|
|
|
468 given. That is why default_C_entries is called here. */
|
|
4
|
469 char *default_C_suffixes [] =
|
|
0
|
470 { "c", "h", NULL };
|
|
|
471
|
|
4
|
472 char *Cplusplus_suffixes [] =
|
|
149
|
473 { "C", "H", "c++", "cc", "cpp", "cxx", "h++", "hh", "hpp", "hxx",
|
|
|
474 "M", /* Objective C++ */
|
|
|
475 "pdb", /* Postscript with C syntax */
|
|
|
476 NULL };
|
|
|
477
|
|
|
478 char *Cjava_suffixes [] =
|
|
|
479 { "java", NULL };
|
|
4
|
480
|
|
153
|
481 char *Cobol_suffixes [] =
|
|
|
482 { "COB", "cob", NULL };
|
|
|
483
|
|
4
|
484 char *Cstar_suffixes [] =
|
|
0
|
485 { "cs", "hs", NULL };
|
|
|
486
|
|
4
|
487 char *Erlang_suffixes [] =
|
|
|
488 { "erl", "hrl", NULL };
|
|
|
489
|
|
|
490 char *Fortran_suffixes [] =
|
|
0
|
491 { "F", "f", "f90", "for", NULL };
|
|
|
492
|
|
4
|
493 char *Lisp_suffixes [] =
|
|
0
|
494 { "cl", "clisp", "el", "l", "lisp", "lsp", "ml", NULL };
|
|
|
495
|
|
4
|
496 char *Pascal_suffixes [] =
|
|
0
|
497 { "p", "pas", NULL };
|
|
|
498
|
|
4
|
499 char *Perl_suffixes [] =
|
|
0
|
500 { "pl", "pm", NULL };
|
|
4
|
501 char *Perl_interpreters [] =
|
|
|
502 { "perl", "@PERL@", NULL };
|
|
|
503
|
|
|
504 char *plain_C_suffixes [] =
|
|
|
505 { "pc", /* Pro*C file */
|
|
|
506 "m", /* Objective C file */
|
|
|
507 "lm", /* Objective lex file */
|
|
|
508 NULL };
|
|
|
509
|
|
149
|
510 char *Postscript_suffixes [] =
|
|
|
511 { "ps", NULL };
|
|
|
512
|
|
4
|
513 char *Prolog_suffixes [] =
|
|
0
|
514 { "prolog", NULL };
|
|
|
515
|
|
201
|
516 char *Python_suffixes [] =
|
|
|
517 { "py", NULL };
|
|
|
518
|
|
4
|
519 /* Can't do the `SCM' or `scm' prefix with a version number. */
|
|
|
520 char *Scheme_suffixes [] =
|
|
201
|
521 { "SCM", "SM", "oak", "sch", "scheme", "scm", "sm", "ss", "t", NULL };
|
|
0
|
522
|
|
4
|
523 char *TeX_suffixes [] =
|
|
|
524 { "TeX", "bib", "clo", "cls", "ltx", "sty", "tex", NULL };
|
|
|
525
|
|
|
526 char *Yacc_suffixes [] =
|
|
|
527 { "y", "ym", NULL }; /* .ym is Objective yacc file */
|
|
0
|
528
|
|
201
|
529 /*
|
|
|
530 * Table of languages.
|
|
|
531 *
|
|
|
532 * It is ok for a given function to be listed under more than one
|
|
|
533 * name. I just didn't.
|
|
|
534 */
|
|
|
535
|
|
|
536 language lang_names [] =
|
|
0
|
537 {
|
|
149
|
538 { "asm", Asm_labels, Asm_suffixes, NULL },
|
|
|
539 { "c", default_C_entries, default_C_suffixes, NULL },
|
|
|
540 { "c++", Cplusplus_entries, Cplusplus_suffixes, NULL },
|
|
|
541 { "c*", Cstar_entries, Cstar_suffixes, NULL },
|
|
153
|
542 { "cobol", Cobol_paragraphs, Cobol_suffixes, NULL },
|
|
149
|
543 { "erlang", Erlang_functions, Erlang_suffixes, NULL },
|
|
|
544 { "fortran", Fortran_functions, Fortran_suffixes, NULL },
|
|
153
|
545 { "java", Cjava_entries, Cjava_suffixes, NULL },
|
|
149
|
546 { "lisp", Lisp_functions, Lisp_suffixes, NULL },
|
|
|
547 { "pascal", Pascal_functions, Pascal_suffixes, NULL },
|
|
|
548 { "perl", Perl_functions, Perl_suffixes, Perl_interpreters },
|
|
|
549 { "postscript", Postscript_functions, Postscript_suffixes, NULL },
|
|
|
550 { "proc", plain_C_entries, plain_C_suffixes, NULL },
|
|
|
551 { "prolog", Prolog_functions, Prolog_suffixes, NULL },
|
|
201
|
552 { "python", Python_functions, Python_suffixes, NULL },
|
|
149
|
553 { "scheme", Scheme_functions, Scheme_suffixes, NULL },
|
|
|
554 { "tex", TeX_functions, TeX_suffixes, NULL },
|
|
|
555 { "yacc", Yacc_entries, Yacc_suffixes, NULL },
|
|
4
|
556 { "auto", NULL }, /* default guessing scheme */
|
|
|
557 { "none", just_read_file }, /* regexp matching only */
|
|
|
558 { NULL, NULL } /* end of list */
|
|
0
|
559 };
|
|
|
560
|
|
|
561
|
|
4
|
562 void
|
|
|
563 print_language_names ()
|
|
0
|
564 {
|
|
201
|
565 language *lang;
|
|
4
|
566 char **ext;
|
|
0
|
567
|
|
|
568 puts ("\nThese are the currently supported languages, along with the\n\
|
|
|
569 default file name suffixes:");
|
|
|
570 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
571 {
|
|
|
572 printf ("\t%s\t", lang->name);
|
|
|
573 if (lang->suffixes != NULL)
|
|
|
574 for (ext = lang->suffixes; *ext != NULL; ext++)
|
|
|
575 printf (" .%s", *ext);
|
|
|
576 puts ("");
|
|
|
577 }
|
|
|
578 puts ("Where `auto' means use default language for files based on file\n\
|
|
|
579 name suffix, and `none' means only do regexp processing on files.\n\
|
|
|
580 If no language is specified and no matching suffix is found,\n\
|
|
|
581 the first line of the file is read for a sharp-bang (#!) sequence\n\
|
|
|
582 followed by the name of an interpreter. If no such sequence is found,\n\
|
|
|
583 Fortran is tried first; if no tags are found, C is tried next.");
|
|
|
584 }
|
|
|
585
|
|
|
586 #ifndef VERSION
|
|
173
|
587 # define VERSION "20"
|
|
0
|
588 #endif
|
|
4
|
589 void
|
|
|
590 print_version ()
|
|
0
|
591 {
|
|
4
|
592 printf ("%s (GNU Emacs %s)\n", (CTAGS) ? "ctags" : "etags", VERSION);
|
|
|
593 puts ("Copyright (C) 1996 Free Software Foundation, Inc. and Ken Arnold");
|
|
|
594 puts ("This program is distributed under the same terms as Emacs");
|
|
0
|
595
|
|
|
596 exit (GOOD);
|
|
|
597 }
|
|
|
598
|
|
4
|
599 void
|
|
|
600 print_help ()
|
|
0
|
601 {
|
|
155
|
602 printf ("Usage: %s [options] [[regex-option ...] file-name] ...\n\
|
|
|
603 \n\
|
|
|
604 These are the options accepted by %s.\n", progname, progname);
|
|
|
605 #ifdef LONG_OPTIONS
|
|
|
606 puts ("You may use unambiguous abbreviations for the long option names.");
|
|
|
607 #else
|
|
|
608 puts ("Long option names do not work with this executable, as it is not\n\
|
|
|
609 linked with GNU getopt.");
|
|
|
610 #endif /* LONG_OPTIONS */
|
|
201
|
611 puts ("A - as file name means read names from stdin (one per line).");
|
|
4
|
612 if (!CTAGS)
|
|
201
|
613 printf (" Absolute names are stored in the output file as they are.\n\
|
|
|
614 Relative ones are stored relative to the output file's directory.");
|
|
4
|
615 puts ("\n");
|
|
0
|
616
|
|
|
617 puts ("-a, --append\n\
|
|
|
618 Append tag entries to existing tags file.");
|
|
|
619
|
|
|
620 if (CTAGS)
|
|
|
621 puts ("-B, --backward-search\n\
|
|
|
622 Write the search commands for the tag entries using '?', the\n\
|
|
|
623 backward-search command instead of '/', the forward-search command.");
|
|
|
624
|
|
|
625 puts ("-C, --c++\n\
|
|
|
626 Treat files whose name suffix defaults to C language as C++ files.");
|
|
|
627
|
|
|
628 if (CTAGS)
|
|
|
629 puts ("-d, --defines\n\
|
|
155
|
630 Create tag entries for C #define constants and enum constants, too.");
|
|
0
|
631 else
|
|
|
632 puts ("-D, --no-defines\n\
|
|
155
|
633 Don't create tag entries for C #define constants and enum constants.\n\
|
|
|
634 This makes the tags file smaller.");
|
|
0
|
635
|
|
|
636 if (!CTAGS)
|
|
|
637 {
|
|
|
638 puts ("-i FILE, --include=FILE\n\
|
|
|
639 Include a note in tag file indicating that, when searching for\n\
|
|
|
640 a tag, one should also consult the tags file FILE after\n\
|
|
|
641 checking the current file.");
|
|
|
642 puts ("-l LANG, --language=LANG\n\
|
|
|
643 Force the following files to be considered as written in the\n\
|
|
|
644 named language up to the next --language=LANG option.");
|
|
|
645 }
|
|
|
646
|
|
155
|
647 if (CTAGS)
|
|
|
648 puts ("--globals\n\
|
|
201
|
649 Create tag entries for global variables in some languages.");
|
|
155
|
650 else
|
|
|
651 puts ("--no-globals\n\
|
|
201
|
652 Do not create tag entries for global variables in some\n\
|
|
|
653 languages. This makes the tags file smaller.");
|
|
155
|
654 puts ("--members\n\
|
|
|
655 Create tag entries for member variables in C and derived languages.");
|
|
|
656
|
|
0
|
657 #ifdef ETAGS_REGEXPS
|
|
149
|
658 puts ("-r /REGEXP/, --regex=/REGEXP/ or --regex=@regexfile\n\
|
|
0
|
659 Make a tag for each line matching pattern REGEXP in the\n\
|
|
149
|
660 following files. regexfile is a file containing one REGEXP\n\
|
|
|
661 per line. REGEXP is anchored (as if preceded by ^).\n\
|
|
0
|
662 The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
|
|
|
663 named tags can be created with:\n\
|
|
|
664 --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
|
|
|
665 puts ("-R, --no-regex\n\
|
|
|
666 Don't create tags from regexps for the following files.");
|
|
|
667 #endif /* ETAGS_REGEXPS */
|
|
|
668 puts ("-o FILE, --output=FILE\n\
|
|
|
669 Write the tags to FILE.");
|
|
276
|
670 #ifdef OO_BROWSER
|
|
|
671 puts ("-O, --oo-browser\n\
|
|
|
672 Generate a specialized tags format used only by the Altrasoft OO-Browser.");
|
|
|
673 #endif
|
|
0
|
674 puts ("-I, --ignore-indentation\n\
|
|
|
675 Don't rely on indentation quite as much as normal. Currently,\n\
|
|
|
676 this means not to assume that a closing brace in the first\n\
|
|
|
677 column is the final brace of a function or structure\n\
|
|
|
678 definition in C and C++.");
|
|
|
679
|
|
|
680 if (CTAGS)
|
|
|
681 {
|
|
|
682 puts ("-t, --typedefs\n\
|
|
|
683 Generate tag entries for C typedefs.");
|
|
|
684 puts ("-T, --typedefs-and-c++\n\
|
|
|
685 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
|
|
|
686 and C++ member functions.");
|
|
|
687 puts ("-u, --update\n\
|
|
|
688 Update the tag entries for the given files, leaving tag\n\
|
|
|
689 entries for other files in place. Currently, this is\n\
|
|
|
690 implemented by deleting the existing entries for the given\n\
|
|
|
691 files and then rewriting the new entries at the end of the\n\
|
|
|
692 tags file. It is often faster to simply rebuild the entire\n\
|
|
|
693 tag file than to use this.");
|
|
|
694 puts ("-v, --vgrind\n\
|
|
|
695 Generates an index of items intended for human consumption,\n\
|
|
|
696 similar to the output of vgrind. The index is sorted, and\n\
|
|
|
697 gives the page number of each item.");
|
|
|
698 puts ("-w, --no-warn\n\
|
|
|
699 Suppress warning messages about entries defined in multiple\n\
|
|
|
700 files.");
|
|
|
701 puts ("-x, --cxref\n\
|
|
|
702 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
|
|
|
703 The output uses line numbers instead of page numbers, but\n\
|
|
|
704 beyond that the differences are cosmetic; try both to see\n\
|
|
|
705 which you like.");
|
|
|
706 }
|
|
|
707
|
|
|
708 puts ("-V, --version\n\
|
|
|
709 Print the version of the program.\n\
|
|
|
710 -h, --help\n\
|
|
|
711 Print this help message.");
|
|
|
712
|
|
|
713 print_language_names ();
|
|
|
714
|
|
4
|
715 puts ("");
|
|
|
716 puts ("Report bugs to bug-gnu-emacs@prep.ai.mit.edu");
|
|
|
717
|
|
0
|
718 exit (GOOD);
|
|
|
719 }
|
|
|
720
|
|
|
721
|
|
|
722 enum argument_type
|
|
|
723 {
|
|
|
724 at_language,
|
|
|
725 at_regexp,
|
|
|
726 at_filename
|
|
|
727 };
|
|
|
728
|
|
134
|
729 /* This structure helps us allow mixing of --lang and file names. */
|
|
0
|
730 typedef struct
|
|
|
731 {
|
|
|
732 enum argument_type arg_type;
|
|
|
733 char *what;
|
|
201
|
734 language *lang;
|
|
0
|
735 } argument;
|
|
|
736
|
|
|
737 #ifdef VMS /* VMS specific functions */
|
|
|
738
|
|
|
739 #define EOS '\0'
|
|
|
740
|
|
|
741 /* This is a BUG! ANY arbitrary limit is a BUG!
|
|
|
742 Won't someone please fix this? */
|
|
|
743 #define MAX_FILE_SPEC_LEN 255
|
|
|
744 typedef struct {
|
|
|
745 short curlen;
|
|
|
746 char body[MAX_FILE_SPEC_LEN + 1];
|
|
|
747 } vspec;
|
|
|
748
|
|
|
749 /*
|
|
|
750 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
|
|
134
|
751 returning in each successive call the next file name matching the input
|
|
0
|
752 spec. The function expects that each in_spec passed
|
|
|
753 to it will be processed to completion; in particular, up to and
|
|
|
754 including the call following that in which the last matching name
|
|
|
755 is returned, the function ignores the value of in_spec, and will
|
|
|
756 only start processing a new spec with the following call.
|
|
|
757 If an error occurs, on return out_spec contains the value
|
|
|
758 of in_spec when the error occurred.
|
|
|
759
|
|
134
|
760 With each successive file name returned in out_spec, the
|
|
0
|
761 function's return value is one. When there are no more matching
|
|
|
762 names the function returns zero. If on the first call no file
|
|
|
763 matches in_spec, or there is any other error, -1 is returned.
|
|
|
764 */
|
|
|
765
|
|
|
766 #include <rmsdef.h>
|
|
|
767 #include <descrip.h>
|
|
|
768 #define OUTSIZE MAX_FILE_SPEC_LEN
|
|
|
769 short
|
|
4
|
770 fn_exp (out, in)
|
|
|
771 vspec *out;
|
|
|
772 char *in;
|
|
0
|
773 {
|
|
|
774 static long context = 0;
|
|
|
775 static struct dsc$descriptor_s o;
|
|
|
776 static struct dsc$descriptor_s i;
|
|
155
|
777 static bool pass1 = TRUE;
|
|
0
|
778 long status;
|
|
|
779 short retval;
|
|
|
780
|
|
|
781 if (pass1)
|
|
|
782 {
|
|
|
783 pass1 = FALSE;
|
|
|
784 o.dsc$a_pointer = (char *) out;
|
|
|
785 o.dsc$w_length = (short)OUTSIZE;
|
|
|
786 i.dsc$a_pointer = in;
|
|
|
787 i.dsc$w_length = (short)strlen(in);
|
|
|
788 i.dsc$b_dtype = DSC$K_DTYPE_T;
|
|
|
789 i.dsc$b_class = DSC$K_CLASS_S;
|
|
|
790 o.dsc$b_dtype = DSC$K_DTYPE_VT;
|
|
|
791 o.dsc$b_class = DSC$K_CLASS_VS;
|
|
|
792 }
|
|
|
793 if ((status = lib$find_file(&i, &o, &context, 0, 0)) == RMS$_NORMAL)
|
|
|
794 {
|
|
|
795 out->body[out->curlen] = EOS;
|
|
|
796 return 1;
|
|
|
797 }
|
|
|
798 else if (status == RMS$_NMF)
|
|
|
799 retval = 0;
|
|
|
800 else
|
|
|
801 {
|
|
|
802 strcpy(out->body, in);
|
|
|
803 retval = -1;
|
|
|
804 }
|
|
|
805 lib$find_file_end(&context);
|
|
|
806 pass1 = TRUE;
|
|
|
807 return retval;
|
|
|
808 }
|
|
|
809
|
|
|
810 /*
|
|
|
811 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
|
|
|
812 name of each file specified by the provided arg expanding wildcards.
|
|
|
813 */
|
|
|
814 char *
|
|
4
|
815 gfnames (arg, p_error)
|
|
|
816 char *arg;
|
|
155
|
817 bool *p_error;
|
|
0
|
818 {
|
|
|
819 static vspec filename = {MAX_FILE_SPEC_LEN, "\0"};
|
|
|
820
|
|
|
821 switch (fn_exp (&filename, arg))
|
|
|
822 {
|
|
|
823 case 1:
|
|
|
824 *p_error = FALSE;
|
|
|
825 return filename.body;
|
|
|
826 case 0:
|
|
|
827 *p_error = FALSE;
|
|
|
828 return NULL;
|
|
|
829 default:
|
|
|
830 *p_error = TRUE;
|
|
|
831 return filename.body;
|
|
|
832 }
|
|
|
833 }
|
|
|
834
|
|
|
835 #ifndef OLD /* Newer versions of VMS do provide `system'. */
|
|
4
|
836 system (cmd)
|
|
|
837 char *cmd;
|
|
0
|
838 {
|
|
142
|
839 error ("%s", "system() function not implemented under VMS");
|
|
0
|
840 }
|
|
|
841 #endif
|
|
|
842
|
|
|
843 #define VERSION_DELIM ';'
|
|
4
|
844 char *massage_name (s)
|
|
|
845 char *s;
|
|
0
|
846 {
|
|
|
847 char *start = s;
|
|
|
848
|
|
|
849 for ( ; *s; s++)
|
|
|
850 if (*s == VERSION_DELIM)
|
|
|
851 {
|
|
|
852 *s = EOS;
|
|
|
853 break;
|
|
|
854 }
|
|
|
855 else
|
|
|
856 *s = lowcase (*s);
|
|
|
857 return start;
|
|
|
858 }
|
|
|
859 #endif /* VMS */
|
|
|
860
|
|
|
861
|
|
4
|
862 int
|
|
|
863 main (argc, argv)
|
|
|
864 int argc;
|
|
|
865 char *argv[];
|
|
0
|
866 {
|
|
|
867 int i;
|
|
142
|
868 unsigned int nincluded_files;
|
|
|
869 char **included_files;
|
|
0
|
870 char *this_file;
|
|
|
871 argument *argbuffer;
|
|
142
|
872 int current_arg, file_count;
|
|
201
|
873 linebuffer filename_lb;
|
|
0
|
874 #ifdef VMS
|
|
155
|
875 bool got_err;
|
|
0
|
876 #endif
|
|
|
877
|
|
|
878 #ifdef DOS_NT
|
|
|
879 _fmode = O_BINARY; /* all of files are treated as binary files */
|
|
|
880 #endif /* DOS_NT */
|
|
|
881
|
|
|
882 progname = argv[0];
|
|
142
|
883 nincluded_files = 0;
|
|
|
884 included_files = xnew (argc, char *);
|
|
|
885 current_arg = 0;
|
|
|
886 file_count = 0;
|
|
0
|
887
|
|
|
888 /* Allocate enough no matter what happens. Overkill, but each one
|
|
|
889 is small. */
|
|
|
890 argbuffer = xnew (argc, argument);
|
|
|
891
|
|
|
892 #ifdef ETAGS_REGEXPS
|
|
|
893 /* Set syntax for regular expression routines. */
|
|
173
|
894 re_set_syntax (RE_SYNTAX_EMACS | RE_INTERVALS);
|
|
0
|
895 #endif /* ETAGS_REGEXPS */
|
|
|
896
|
|
|
897 /*
|
|
|
898 * If etags, always find typedefs and structure tags. Why not?
|
|
153
|
899 * Also default is to find macro constants, enum constants and
|
|
155
|
900 * global variables.
|
|
0
|
901 */
|
|
|
902 if (!CTAGS)
|
|
153
|
903 {
|
|
|
904 typedefs = typedefs_and_cplusplus = constantypedefs = TRUE;
|
|
155
|
905 globals = TRUE;
|
|
|
906 members = FALSE;
|
|
153
|
907 }
|
|
0
|
908
|
|
|
909 while (1)
|
|
|
910 {
|
|
155
|
911 int opt;
|
|
|
912 char *optstring;
|
|
|
913
|
|
|
914 #ifdef ETAGS_REGEXPS
|
|
276
|
915 #ifndef OO_BROWSER
|
|
155
|
916 optstring = "-aCdDf:Il:o:r:RStTi:BuvxwVhH";
|
|
|
917 #else
|
|
276
|
918 optstring = "-aCdDf:Il:o:r:RStTi:BOuvxwVhH";
|
|
|
919 #endif
|
|
|
920 #else
|
|
|
921 #ifndef OO_BROWSER
|
|
155
|
922 optstring = "-aCdDf:Il:o:StTi:BuvxwVhH";
|
|
276
|
923 #else
|
|
|
924 optstring = "-aCdDf:Il:o:StTi:BOuvxwVhH";
|
|
|
925 #endif
|
|
155
|
926 #endif /* ETAGS_REGEXPS */
|
|
|
927
|
|
|
928 #ifndef LONG_OPTIONS
|
|
|
929 optstring = optstring + 1;
|
|
|
930 #endif /* LONG_OPTIONS */
|
|
|
931
|
|
|
932 opt = getopt_long (argc, argv, optstring, longopts, 0);
|
|
0
|
933 if (opt == EOF)
|
|
|
934 break;
|
|
|
935
|
|
|
936 switch (opt)
|
|
|
937 {
|
|
|
938 case 0:
|
|
|
939 /* If getopt returns 0, then it has already processed a
|
|
|
940 long-named option. We should do nothing. */
|
|
|
941 break;
|
|
|
942
|
|
|
943 case 1:
|
|
134
|
944 /* This means that a file name has been seen. Record it. */
|
|
0
|
945 argbuffer[current_arg].arg_type = at_filename;
|
|
|
946 argbuffer[current_arg].what = optarg;
|
|
|
947 ++current_arg;
|
|
|
948 ++file_count;
|
|
|
949 break;
|
|
|
950
|
|
|
951 /* Common options. */
|
|
153
|
952 case 'a': append_to_tagfile = TRUE; break;
|
|
|
953 case 'C': cplusplus = TRUE; break;
|
|
|
954 case 'd': constantypedefs = TRUE; break;
|
|
|
955 case 'D': constantypedefs = FALSE; break;
|
|
0
|
956 case 'f': /* for compatibility with old makefiles */
|
|
|
957 case 'o':
|
|
|
958 if (tagfile)
|
|
|
959 {
|
|
201
|
960 /* convert char to string, to call error with */
|
|
|
961 char buf[2];
|
|
|
962 sprintf (buf, "%c", opt);
|
|
|
963 error ("-%s option may only be given once.", buf);
|
|
4
|
964 suggest_asking_for_help ();
|
|
0
|
965 }
|
|
|
966 tagfile = optarg;
|
|
|
967 break;
|
|
276
|
968 #ifdef OO_BROWSER
|
|
|
969 case 'O':
|
|
|
970 oo_browser_format = TRUE;
|
|
|
971 break;
|
|
|
972 #endif
|
|
0
|
973 case 'I':
|
|
|
974 case 'S': /* for backward compatibility */
|
|
|
975 noindentypedefs = TRUE;
|
|
|
976 break;
|
|
|
977 case 'l':
|
|
201
|
978 {
|
|
|
979 language *lang = get_language_from_name (optarg);
|
|
|
980 if (lang != NULL)
|
|
|
981 {
|
|
|
982 argbuffer[current_arg].lang = lang;
|
|
|
983 argbuffer[current_arg].arg_type = at_language;
|
|
|
984 ++current_arg;
|
|
|
985 }
|
|
|
986 }
|
|
0
|
987 break;
|
|
|
988 #ifdef ETAGS_REGEXPS
|
|
|
989 case 'r':
|
|
|
990 argbuffer[current_arg].arg_type = at_regexp;
|
|
|
991 argbuffer[current_arg].what = optarg;
|
|
|
992 ++current_arg;
|
|
|
993 break;
|
|
|
994 case 'R':
|
|
|
995 argbuffer[current_arg].arg_type = at_regexp;
|
|
|
996 argbuffer[current_arg].what = NULL;
|
|
|
997 ++current_arg;
|
|
|
998 break;
|
|
|
999 #endif /* ETAGS_REGEXPS */
|
|
|
1000 case 'V':
|
|
|
1001 print_version ();
|
|
|
1002 break;
|
|
|
1003 case 'h':
|
|
|
1004 case 'H':
|
|
|
1005 print_help ();
|
|
|
1006 break;
|
|
|
1007 case 't':
|
|
|
1008 typedefs = TRUE;
|
|
|
1009 break;
|
|
|
1010 case 'T':
|
|
|
1011 typedefs = typedefs_and_cplusplus = TRUE;
|
|
|
1012 break;
|
|
|
1013 #if (!CTAGS)
|
|
|
1014 /* Etags options */
|
|
|
1015 case 'i':
|
|
|
1016 included_files[nincluded_files++] = optarg;
|
|
|
1017 break;
|
|
|
1018 #else /* CTAGS */
|
|
|
1019 /* Ctags options. */
|
|
153
|
1020 case 'B': searchar = '?'; break;
|
|
|
1021 case 'u': update = TRUE; break;
|
|
|
1022 case 'v': vgrind_style = TRUE; /*FALLTHRU*/
|
|
|
1023 case 'x': cxref_style = TRUE; break;
|
|
|
1024 case 'w': no_warnings = TRUE; break;
|
|
0
|
1025 #endif /* CTAGS */
|
|
|
1026 default:
|
|
4
|
1027 suggest_asking_for_help ();
|
|
0
|
1028 }
|
|
|
1029 }
|
|
|
1030
|
|
|
1031 for (; optind < argc; ++optind)
|
|
|
1032 {
|
|
|
1033 argbuffer[current_arg].arg_type = at_filename;
|
|
|
1034 argbuffer[current_arg].what = argv[optind];
|
|
|
1035 ++current_arg;
|
|
|
1036 ++file_count;
|
|
|
1037 }
|
|
|
1038
|
|
|
1039 if (nincluded_files == 0 && file_count == 0)
|
|
|
1040 {
|
|
155
|
1041 error ("no input files specified.", 0);
|
|
4
|
1042 suggest_asking_for_help ();
|
|
0
|
1043 }
|
|
|
1044
|
|
|
1045 if (tagfile == NULL)
|
|
4
|
1046 tagfile = CTAGS ? "tags" : "TAGS";
|
|
0
|
1047 cwd = etags_getcwd (); /* the current working directory */
|
|
4
|
1048 if (cwd[strlen (cwd) - 1] != '/')
|
|
149
|
1049 {
|
|
|
1050 char *oldcwd = cwd;
|
|
|
1051 cwd = concat (oldcwd, "/", "");
|
|
|
1052 free (oldcwd);
|
|
|
1053 }
|
|
0
|
1054 if (streq (tagfile, "-"))
|
|
4
|
1055 tagfiledir = cwd;
|
|
0
|
1056 else
|
|
4
|
1057 tagfiledir = absolute_dirname (tagfile, cwd);
|
|
0
|
1058
|
|
|
1059 init (); /* set up boolean "functions" */
|
|
|
1060
|
|
|
1061 initbuffer (&lb);
|
|
|
1062 initbuffer (&token_name);
|
|
|
1063 initbuffer (&lbs[0].lb);
|
|
|
1064 initbuffer (&lbs[1].lb);
|
|
|
1065 initbuffer (&filename_lb);
|
|
|
1066
|
|
|
1067 if (!CTAGS)
|
|
|
1068 {
|
|
|
1069 if (streq (tagfile, "-"))
|
|
4
|
1070 {
|
|
|
1071 tagf = stdout;
|
|
|
1072 #ifdef DOS_NT
|
|
|
1073 /* Switch redirected `stdout' to binary mode (setting `_fmode'
|
|
|
1074 doesn't take effect until after `stdout' is already open). */
|
|
|
1075 if (!isatty (fileno (stdout)))
|
|
|
1076 setmode (fileno (stdout), O_BINARY);
|
|
|
1077 #endif /* DOS_NT */
|
|
|
1078 }
|
|
0
|
1079 else
|
|
|
1080 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
|
|
|
1081 if (tagf == NULL)
|
|
|
1082 pfatal (tagfile);
|
|
|
1083 }
|
|
|
1084
|
|
|
1085 /*
|
|
|
1086 * Loop through files finding functions.
|
|
|
1087 */
|
|
|
1088 for (i = 0; i < current_arg; ++i)
|
|
|
1089 {
|
|
|
1090 switch (argbuffer[i].arg_type)
|
|
|
1091 {
|
|
|
1092 case at_language:
|
|
201
|
1093 forced_lang = argbuffer[i].lang;
|
|
0
|
1094 break;
|
|
|
1095 #ifdef ETAGS_REGEXPS
|
|
|
1096 case at_regexp:
|
|
149
|
1097 analyse_regex (argbuffer[i].what);
|
|
0
|
1098 break;
|
|
|
1099 #endif
|
|
|
1100 case at_filename:
|
|
|
1101 #ifdef VMS
|
|
|
1102 while ((this_file = gfnames (argbuffer[i].what, &got_err)) != NULL)
|
|
|
1103 {
|
|
|
1104 if (got_err)
|
|
|
1105 {
|
|
155
|
1106 error ("can't find file %s\n", this_file);
|
|
0
|
1107 argc--, argv++;
|
|
|
1108 }
|
|
|
1109 else
|
|
|
1110 {
|
|
|
1111 this_file = massage_name (this_file);
|
|
|
1112 }
|
|
|
1113 #else
|
|
|
1114 this_file = argbuffer[i].what;
|
|
|
1115 #endif
|
|
276
|
1116 #ifdef OO_BROWSER
|
|
|
1117 oo_browser_clear_all_globals();
|
|
|
1118 #endif
|
|
0
|
1119 /* Input file named "-" means read file names from stdin
|
|
201
|
1120 (one per line) and use them. */
|
|
0
|
1121 if (streq (this_file, "-"))
|
|
|
1122 while (readline_internal (&filename_lb, stdin) > 0)
|
|
276
|
1123 #ifdef OO_BROWSER
|
|
|
1124 {
|
|
|
1125 oo_browser_clear_some_globals();
|
|
|
1126 #endif
|
|
0
|
1127 process_file (filename_lb.buffer);
|
|
276
|
1128 #ifdef OO_BROWSER
|
|
|
1129 }
|
|
|
1130 #endif
|
|
0
|
1131 else
|
|
|
1132 process_file (this_file);
|
|
|
1133 #ifdef VMS
|
|
|
1134 }
|
|
|
1135 #endif
|
|
|
1136 break;
|
|
|
1137 }
|
|
|
1138 }
|
|
|
1139
|
|
201
|
1140 #ifdef ETAGS_REGEXPS
|
|
|
1141 free_patterns ();
|
|
|
1142 #endif /* ETAGS_REGEXPS */
|
|
|
1143
|
|
0
|
1144 if (!CTAGS)
|
|
|
1145 {
|
|
|
1146 while (nincluded_files-- > 0)
|
|
|
1147 fprintf (tagf, "\f\n%s,include\n", *included_files++);
|
|
|
1148
|
|
|
1149 fclose (tagf);
|
|
|
1150 exit (GOOD);
|
|
|
1151 }
|
|
|
1152
|
|
|
1153 /* If CTAGS, we are here. process_file did not write the tags yet,
|
|
|
1154 because we want them ordered. Let's do it now. */
|
|
|
1155 if (cxref_style)
|
|
|
1156 {
|
|
|
1157 put_entries (head);
|
|
|
1158 exit (GOOD);
|
|
|
1159 }
|
|
|
1160
|
|
|
1161 if (update)
|
|
|
1162 {
|
|
|
1163 char cmd[BUFSIZ];
|
|
|
1164 for (i = 0; i < current_arg; ++i)
|
|
|
1165 {
|
|
|
1166 if (argbuffer[i].arg_type != at_filename)
|
|
|
1167 continue;
|
|
|
1168 sprintf (cmd,
|
|
|
1169 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
|
|
|
1170 tagfile, argbuffer[i].what, tagfile);
|
|
|
1171 if (system (cmd) != GOOD)
|
|
4
|
1172 fatal ("failed to execute shell command", (char *)NULL);
|
|
0
|
1173 }
|
|
|
1174 append_to_tagfile = TRUE;
|
|
|
1175 }
|
|
|
1176
|
|
|
1177 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
|
|
|
1178 if (tagf == NULL)
|
|
|
1179 pfatal (tagfile);
|
|
|
1180 put_entries (head);
|
|
|
1181 fclose (tagf);
|
|
|
1182
|
|
|
1183 if (update)
|
|
|
1184 {
|
|
|
1185 char cmd[BUFSIZ];
|
|
|
1186 sprintf (cmd, "sort %s -o %s", tagfile, tagfile);
|
|
|
1187 exit (system (cmd));
|
|
|
1188 }
|
|
4
|
1189 return GOOD;
|
|
0
|
1190 }
|
|
|
1191
|
|
|
1192
|
|
|
1193 /*
|
|
201
|
1194 * Return a language given the name.
|
|
0
|
1195 */
|
|
201
|
1196 language *
|
|
4
|
1197 get_language_from_name (name)
|
|
|
1198 char *name;
|
|
0
|
1199 {
|
|
201
|
1200 language *lang;
|
|
|
1201
|
|
|
1202 if (name == NULL)
|
|
|
1203 error ("empty language name", (char *)NULL);
|
|
|
1204 else
|
|
|
1205 {
|
|
|
1206 for (lang = lang_names; lang->name != NULL; lang++)
|
|
4
|
1207 if (streq (name, lang->name))
|
|
201
|
1208 return lang;
|
|
|
1209 error ("unknown language \"%s\"", name);
|
|
|
1210 }
|
|
|
1211
|
|
|
1212 return NULL;
|
|
0
|
1213 }
|
|
|
1214
|
|
|
1215
|
|
|
1216 /*
|
|
201
|
1217 * Return a language given the interpreter name.
|
|
0
|
1218 */
|
|
201
|
1219 language *
|
|
4
|
1220 get_language_from_interpreter (interpreter)
|
|
|
1221 char *interpreter;
|
|
0
|
1222 {
|
|
201
|
1223 language *lang;
|
|
4
|
1224 char **iname;
|
|
0
|
1225
|
|
|
1226 if (interpreter == NULL)
|
|
|
1227 return NULL;
|
|
|
1228 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1229 if (lang->interpreters != NULL)
|
|
|
1230 for (iname = lang->interpreters; *iname != NULL; iname++)
|
|
|
1231 if (streq (*iname, interpreter))
|
|
201
|
1232 return lang;
|
|
0
|
1233
|
|
|
1234 return NULL;
|
|
|
1235 }
|
|
|
1236
|
|
|
1237
|
|
|
1238
|
|
|
1239 /*
|
|
201
|
1240 * Return a language given the file suffix.
|
|
0
|
1241 */
|
|
201
|
1242 language *
|
|
4
|
1243 get_language_from_suffix (suffix)
|
|
|
1244 char *suffix;
|
|
0
|
1245 {
|
|
201
|
1246 language *lang;
|
|
4
|
1247 char **ext;
|
|
0
|
1248
|
|
|
1249 if (suffix == NULL)
|
|
|
1250 return NULL;
|
|
|
1251 for (lang = lang_names; lang->name != NULL; lang++)
|
|
|
1252 if (lang->suffixes != NULL)
|
|
|
1253 for (ext = lang->suffixes; *ext != NULL; ext++)
|
|
|
1254 if (streq (*ext, suffix))
|
|
201
|
1255 return lang;
|
|
0
|
1256
|
|
|
1257 return NULL;
|
|
|
1258 }
|
|
|
1259
|
|
|
1260
|
|
|
1261 /*
|
|
|
1262 * This routine is called on each file argument.
|
|
|
1263 */
|
|
|
1264 void
|
|
4
|
1265 process_file (file)
|
|
|
1266 char *file;
|
|
0
|
1267 {
|
|
|
1268 struct stat stat_buf;
|
|
|
1269 FILE *inf;
|
|
201
|
1270
|
|
|
1271 canonicalize_filename (file);
|
|
0
|
1272 if (stat (file, &stat_buf) == 0 && !S_ISREG (stat_buf.st_mode))
|
|
|
1273 {
|
|
155
|
1274 error ("skipping %s: it is not a regular file.", file);
|
|
0
|
1275 return;
|
|
|
1276 }
|
|
|
1277 if (streq (file, tagfile) && !streq (tagfile, "-"))
|
|
|
1278 {
|
|
155
|
1279 error ("skipping inclusion of %s in self.", file);
|
|
0
|
1280 return;
|
|
|
1281 }
|
|
|
1282 inf = fopen (file, "r");
|
|
|
1283 if (inf == NULL)
|
|
|
1284 {
|
|
|
1285 perror (file);
|
|
|
1286 return;
|
|
|
1287 }
|
|
|
1288
|
|
|
1289 find_entries (file, inf);
|
|
|
1290
|
|
|
1291 if (!CTAGS)
|
|
|
1292 {
|
|
|
1293 char *filename;
|
|
|
1294
|
|
201
|
1295 if (filename_is_absolute (file))
|
|
0
|
1296 {
|
|
134
|
1297 /* file is an absolute file name. Canonicalise it. */
|
|
0
|
1298 filename = absolute_filename (file, cwd);
|
|
|
1299 }
|
|
|
1300 else
|
|
|
1301 {
|
|
134
|
1302 /* file is a file name relative to cwd. Make it relative
|
|
0
|
1303 to the directory of the tags file. */
|
|
|
1304 filename = relative_filename (file, tagfiledir);
|
|
|
1305 }
|
|
276
|
1306 #ifdef OO_BROWSER
|
|
|
1307 if (oo_browser_format)
|
|
|
1308 fprintf (tagf, "\f\n%s\n", filename);
|
|
|
1309 else
|
|
|
1310 #endif
|
|
0
|
1311 fprintf (tagf, "\f\n%s,%d\n", filename, total_size_of_entries (head));
|
|
|
1312 free (filename);
|
|
|
1313 put_entries (head);
|
|
|
1314 free_tree (head);
|
|
|
1315 head = NULL;
|
|
|
1316 }
|
|
|
1317 }
|
|
|
1318
|
|
|
1319 /*
|
|
|
1320 * This routine sets up the boolean pseudo-functions which work
|
|
201
|
1321 * by setting boolean flags dependent upon the corresponding character.
|
|
0
|
1322 * Every char which is NOT in that string is not a white char. Therefore,
|
|
|
1323 * all of the array "_wht" is set to FALSE, and then the elements
|
|
|
1324 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
|
|
|
1325 * of a char is TRUE if it is the string "white", else FALSE.
|
|
|
1326 */
|
|
|
1327 void
|
|
4
|
1328 init ()
|
|
0
|
1329 {
|
|
4
|
1330 register char *sp;
|
|
0
|
1331 register int i;
|
|
|
1332
|
|
153
|
1333 for (i = 0; i < CHARS; i++)
|
|
201
|
1334 iswhite(i) = notinname(i) = begtoken(i) = intoken(i) = endtoken(i) = FALSE;
|
|
|
1335 for (sp = white; *sp != '\0'; sp++) iswhite (*sp) = TRUE;
|
|
|
1336 for (sp = nonam; *sp != '\0'; sp++) notinname (*sp) = TRUE;
|
|
|
1337 for (sp = begtk; *sp != '\0'; sp++) begtoken (*sp) = TRUE;
|
|
|
1338 for (sp = midtk; *sp != '\0'; sp++) intoken (*sp) = TRUE;
|
|
|
1339 for (sp = endtk; *sp != '\0'; sp++) endtoken (*sp) = TRUE;
|
|
|
1340 iswhite('\0') = iswhite('\n');
|
|
|
1341 notinname('\0') = notinname('\n');
|
|
|
1342 begtoken('\0') = begtoken('\n');
|
|
|
1343 intoken('\0') = intoken('\n');
|
|
|
1344 endtoken('\0') = endtoken('\n');
|
|
0
|
1345 }
|
|
|
1346
|
|
|
1347 /*
|
|
|
1348 * This routine opens the specified file and calls the function
|
|
|
1349 * which finds the function and type definitions.
|
|
|
1350 */
|
|
201
|
1351 node *last_node = NULL;
|
|
|
1352
|
|
0
|
1353 void
|
|
4
|
1354 find_entries (file, inf)
|
|
|
1355 char *file;
|
|
|
1356 FILE *inf;
|
|
0
|
1357 {
|
|
|
1358 char *cp;
|
|
201
|
1359 language *lang;
|
|
|
1360 node *old_last_node;
|
|
|
1361
|
|
0
|
1362 curfile = savestr (file);
|
|
|
1363
|
|
|
1364 /* If user specified a language, use it. */
|
|
201
|
1365 lang = forced_lang;
|
|
|
1366 if (lang != NULL && lang->function != NULL)
|
|
0
|
1367 {
|
|
201
|
1368 curlang = lang;
|
|
|
1369 lang->function (inf);
|
|
|
1370 free (curfile);
|
|
0
|
1371 fclose (inf);
|
|
|
1372 return;
|
|
|
1373 }
|
|
|
1374
|
|
|
1375 cp = etags_strrchr (file, '.');
|
|
|
1376 if (cp != NULL)
|
|
|
1377 {
|
|
|
1378 cp += 1;
|
|
201
|
1379 lang = get_language_from_suffix (cp);
|
|
|
1380 if (lang != NULL && lang->function != NULL)
|
|
0
|
1381 {
|
|
201
|
1382 curlang = lang;
|
|
|
1383 lang->function (inf);
|
|
|
1384 free (curfile);
|
|
0
|
1385 fclose (inf);
|
|
|
1386 return;
|
|
|
1387 }
|
|
|
1388 }
|
|
|
1389
|
|
|
1390 /* Look for sharp-bang as the first two characters. */
|
|
201
|
1391 if (readline_internal (&lb, inf) > 0
|
|
142
|
1392 && lb.len >= 2
|
|
0
|
1393 && lb.buffer[0] == '#'
|
|
|
1394 && lb.buffer[1] == '!')
|
|
|
1395 {
|
|
|
1396 char *lp;
|
|
|
1397
|
|
|
1398 /* Set lp to point at the first char after the last slash in the
|
|
|
1399 line or, if no slashes, at the first nonblank. Then set cp to
|
|
|
1400 the first successive blank and terminate the string. */
|
|
|
1401 lp = etags_strrchr (lb.buffer+2, '/');
|
|
|
1402 if (lp != NULL)
|
|
|
1403 lp += 1;
|
|
|
1404 else
|
|
201
|
1405 lp = skip_spaces (lb.buffer + 2);
|
|
|
1406 cp = skip_non_spaces (lp);
|
|
0
|
1407 *cp = '\0';
|
|
|
1408
|
|
4
|
1409 if (strlen (lp) > 0)
|
|
0
|
1410 {
|
|
201
|
1411 lang = get_language_from_interpreter (lp);
|
|
|
1412 if (lang != NULL && lang->function != NULL)
|
|
0
|
1413 {
|
|
201
|
1414 curlang = lang;
|
|
|
1415 lang->function (inf);
|
|
0
|
1416 fclose (inf);
|
|
201
|
1417 free (curfile);
|
|
0
|
1418 return;
|
|
|
1419 }
|
|
|
1420 }
|
|
|
1421 }
|
|
|
1422 rewind (inf);
|
|
|
1423
|
|
|
1424 /* Try Fortran. */
|
|
|
1425 old_last_node = last_node;
|
|
201
|
1426 curlang = get_language_from_name ("fortran");
|
|
0
|
1427 Fortran_functions (inf);
|
|
|
1428
|
|
|
1429 /* No Fortran entries found. Try C. */
|
|
|
1430 if (old_last_node == last_node)
|
|
|
1431 {
|
|
|
1432 rewind (inf);
|
|
201
|
1433 curlang = get_language_from_name (cplusplus ? "c++" : "c");
|
|
0
|
1434 default_C_entries (inf);
|
|
|
1435 }
|
|
201
|
1436 free (curfile);
|
|
0
|
1437 fclose (inf);
|
|
|
1438 return;
|
|
|
1439 }
|
|
|
1440
|
|
|
1441 /* Record a tag. */
|
|
4
|
1442 void
|
|
|
1443 pfnote (name, is_func, linestart, linelen, lno, cno)
|
|
|
1444 char *name; /* tag name, or NULL if unnamed */
|
|
155
|
1445 bool is_func; /* tag is a function */
|
|
0
|
1446 char *linestart; /* start of the line where tag is */
|
|
|
1447 int linelen; /* length of the line where tag is */
|
|
|
1448 int lno; /* line number */
|
|
|
1449 long cno; /* character number */
|
|
|
1450 {
|
|
201
|
1451 register node *np;
|
|
4
|
1452
|
|
|
1453 if (CTAGS && name == NULL)
|
|
|
1454 return;
|
|
|
1455
|
|
201
|
1456 np = xnew (1, node);
|
|
0
|
1457
|
|
|
1458 /* If ctags mode, change name "main" to M<thisfilename>. */
|
|
|
1459 if (CTAGS && !cxref_style && streq (name, "main"))
|
|
|
1460 {
|
|
|
1461 register char *fp = etags_strrchr (curfile, '/');
|
|
|
1462 np->name = concat ("M", fp == 0 ? curfile : fp + 1, "");
|
|
|
1463 fp = etags_strrchr (np->name, '.');
|
|
|
1464 if (fp && fp[1] != '\0' && fp[2] == '\0')
|
|
|
1465 fp[0] = 0;
|
|
|
1466 }
|
|
|
1467 else
|
|
|
1468 np->name = name;
|
|
|
1469 np->been_warned = FALSE;
|
|
|
1470 np->file = curfile;
|
|
|
1471 np->is_func = is_func;
|
|
|
1472 np->lno = lno;
|
|
|
1473 /* Our char numbers are 0-base, because of C language tradition?
|
|
|
1474 ctags compatibility? old versions compatibility? I don't know.
|
|
4
|
1475 Anyway, since emacs's are 1-base we expect etags.el to take care
|
|
0
|
1476 of the difference. If we wanted to have 1-based numbers, we would
|
|
|
1477 uncomment the +1 below. */
|
|
|
1478 np->cno = cno /* + 1 */ ;
|
|
|
1479 np->left = np->right = NULL;
|
|
4
|
1480 if (CTAGS && !cxref_style)
|
|
|
1481 {
|
|
|
1482 if (strlen (linestart) < 50)
|
|
|
1483 np->pat = concat (linestart, "$", "");
|
|
|
1484 else
|
|
|
1485 np->pat = savenstr (linestart, 50);
|
|
|
1486 }
|
|
|
1487 else
|
|
|
1488 np->pat = savenstr (linestart, linelen);
|
|
0
|
1489
|
|
276
|
1490 #ifdef OO_BROWSER
|
|
|
1491 if (oo_browser_format)
|
|
|
1492 np->construct = oo_browser_construct;
|
|
|
1493 oo_browser_construct = C_NULL;
|
|
|
1494 oo_browser_check_and_clear_structtype();
|
|
|
1495 #endif
|
|
|
1496
|
|
0
|
1497 add_node (np, &head);
|
|
|
1498 }
|
|
|
1499
|
|
201
|
1500 /* Date: Wed, 22 Jan 1997 02:56:31 -0500 [last amended 18 Sep 1997]
|
|
|
1501 * From: Sam Kendall <kendall@mv.mv.com>
|
|
153
|
1502 * Subject: Proposal for firming up the TAGS format specification
|
|
|
1503 * To: F.Potorti@cnuce.cnr.it
|
|
|
1504 *
|
|
|
1505 * pfnote should emit the optimized form [unnamed tag] only if:
|
|
201
|
1506 * 1. name does not contain any of the characters " \t\r\n(),;";
|
|
153
|
1507 * 2. linestart contains name as either a rightmost, or rightmost but
|
|
|
1508 * one character, substring;
|
|
|
1509 * 3. the character, if any, immediately before name in linestart must
|
|
201
|
1510 * be one of the characters " \t(),;";
|
|
153
|
1511 * 4. the character, if any, immediately after name in linestart must
|
|
201
|
1512 * also be one of the characters " \t(),;".
|
|
|
1513 *
|
|
|
1514 * The real implementation uses the notinname() macro, which recognises
|
|
|
1515 * characters slightly different form " \t\r\n(),;". See the variable
|
|
|
1516 * `nonam'.
|
|
153
|
1517 */
|
|
|
1518 #define traditional_tag_style TRUE
|
|
|
1519 void
|
|
|
1520 new_pfnote (name, namelen, is_func, linestart, linelen, lno, cno)
|
|
|
1521 char *name; /* tag name, or NULL if unnamed */
|
|
|
1522 int namelen; /* tag length */
|
|
155
|
1523 bool is_func; /* tag is a function */
|
|
153
|
1524 char *linestart; /* start of the line where tag is */
|
|
|
1525 int linelen; /* length of the line where tag is */
|
|
|
1526 int lno; /* line number */
|
|
|
1527 long cno; /* character number */
|
|
|
1528 {
|
|
|
1529 register char *cp;
|
|
155
|
1530 bool named;
|
|
153
|
1531
|
|
|
1532 named = TRUE;
|
|
|
1533 if (!CTAGS)
|
|
|
1534 {
|
|
|
1535 for (cp = name; !notinname (*cp); cp++)
|
|
|
1536 continue;
|
|
|
1537 if (*cp == '\0') /* rule #1 */
|
|
|
1538 {
|
|
|
1539 cp = linestart + linelen - namelen;
|
|
|
1540 if (notinname (linestart[linelen-1]))
|
|
|
1541 cp -= 1; /* rule #4 */
|
|
276
|
1542 #ifdef OO_BROWSER
|
|
|
1543 if (!oo_browser_format
|
|
|
1544 && cp >= linestart /* rule #2 */
|
|
|
1545 #else
|
|
153
|
1546 if (cp >= linestart /* rule #2 */
|
|
276
|
1547 #endif
|
|
153
|
1548 && (cp == linestart
|
|
|
1549 || notinname (cp[-1])) /* rule #3 */
|
|
|
1550 && strneq (name, cp, namelen)) /* rule #2 */
|
|
|
1551 named = FALSE; /* use unnamed tag */
|
|
|
1552 }
|
|
|
1553 }
|
|
|
1554
|
|
|
1555 if (named)
|
|
|
1556 name = savenstr (name, namelen);
|
|
|
1557 else
|
|
|
1558 name = NULL;
|
|
|
1559 pfnote (name, is_func, linestart, linelen, lno, cno);
|
|
|
1560 }
|
|
|
1561
|
|
0
|
1562 /*
|
|
|
1563 * free_tree ()
|
|
|
1564 * recurse on left children, iterate on right children.
|
|
|
1565 */
|
|
|
1566 void
|
|
201
|
1567 free_tree (np)
|
|
|
1568 register node *np;
|
|
0
|
1569 {
|
|
201
|
1570 while (np)
|
|
0
|
1571 {
|
|
201
|
1572 register node *node_right = np->right;
|
|
|
1573 free_tree (np->left);
|
|
|
1574 if (np->name != NULL)
|
|
|
1575 free (np->name);
|
|
|
1576 free (np->pat);
|
|
|
1577 free (np);
|
|
|
1578 np = node_right;
|
|
0
|
1579 }
|
|
|
1580 }
|
|
|
1581
|
|
|
1582 /*
|
|
|
1583 * add_node ()
|
|
|
1584 * Adds a node to the tree of nodes. In etags mode, we don't keep
|
|
|
1585 * it sorted; we just keep a linear list. In ctags mode, maintain
|
|
|
1586 * an ordered tree, with no attempt at balancing.
|
|
|
1587 *
|
|
|
1588 * add_node is the only function allowed to add nodes, so it can
|
|
|
1589 * maintain state.
|
|
|
1590 */
|
|
|
1591 void
|
|
201
|
1592 add_node (np, cur_node_p)
|
|
|
1593 node *np, **cur_node_p;
|
|
0
|
1594 {
|
|
|
1595 register int dif;
|
|
201
|
1596 register node *cur_node = *cur_node_p;
|
|
0
|
1597
|
|
|
1598 if (cur_node == NULL)
|
|
|
1599 {
|
|
201
|
1600 *cur_node_p = np;
|
|
|
1601 last_node = np;
|
|
0
|
1602 return;
|
|
|
1603 }
|
|
|
1604
|
|
|
1605 if (!CTAGS)
|
|
|
1606 {
|
|
|
1607 /* Etags Mode */
|
|
|
1608 if (last_node == NULL)
|
|
4
|
1609 fatal ("internal error in add_node", (char *)NULL);
|
|
201
|
1610 last_node->right = np;
|
|
|
1611 last_node = np;
|
|
0
|
1612 }
|
|
|
1613 else
|
|
|
1614 {
|
|
|
1615 /* Ctags Mode */
|
|
201
|
1616 dif = strcmp (np->name, cur_node->name);
|
|
0
|
1617
|
|
|
1618 /*
|
|
|
1619 * If this tag name matches an existing one, then
|
|
|
1620 * do not add the node, but maybe print a warning.
|
|
|
1621 */
|
|
|
1622 if (!dif)
|
|
|
1623 {
|
|
201
|
1624 if (streq (np->file, cur_node->file))
|
|
0
|
1625 {
|
|
|
1626 if (!no_warnings)
|
|
|
1627 {
|
|
|
1628 fprintf (stderr, "Duplicate entry in file %s, line %d: %s\n",
|
|
201
|
1629 np->file, lineno, np->name);
|
|
0
|
1630 fprintf (stderr, "Second entry ignored\n");
|
|
|
1631 }
|
|
|
1632 }
|
|
|
1633 else if (!cur_node->been_warned && !no_warnings)
|
|
|
1634 {
|
|
|
1635 fprintf
|
|
|
1636 (stderr,
|
|
|
1637 "Duplicate entry in files %s and %s: %s (Warning only)\n",
|
|
201
|
1638 np->file, cur_node->file, np->name);
|
|
0
|
1639 cur_node->been_warned = TRUE;
|
|
|
1640 }
|
|
|
1641 return;
|
|
|
1642 }
|
|
|
1643
|
|
|
1644 /* Actually add the node */
|
|
201
|
1645 add_node (np, dif < 0 ? &cur_node->left : &cur_node->right);
|
|
0
|
1646 }
|
|
|
1647 }
|
|
|
1648
|
|
276
|
1649 #ifdef OO_BROWSER
|
|
|
1650 /* Default class name for the current OO-Browser tag. */
|
|
|
1651 static char *oo_browser_class;
|
|
|
1652 /* Prefix character to use in OO-Browser listings for the current tag. */
|
|
|
1653 static char oo_browser_prefix;
|
|
|
1654 #endif
|
|
|
1655
|
|
0
|
1656 void
|
|
201
|
1657 put_entries (np)
|
|
|
1658 register node *np;
|
|
0
|
1659 {
|
|
|
1660 register char *sp;
|
|
|
1661
|
|
201
|
1662 if (np == NULL)
|
|
0
|
1663 return;
|
|
|
1664
|
|
|
1665 /* Output subentries that precede this one */
|
|
201
|
1666 put_entries (np->left);
|
|
0
|
1667
|
|
|
1668 /* Output this entry */
|
|
|
1669
|
|
|
1670 if (!CTAGS)
|
|
|
1671 {
|
|
276
|
1672 #ifdef OO_BROWSER
|
|
|
1673 if (oo_browser_format)
|
|
|
1674 {
|
|
|
1675 /* Omit C++ `class' and `method' entries as well as Objective-C
|
|
|
1676 entries from this OO-Browser tags file since the browser handles
|
|
|
1677 them independently of this file. Omit `extern' variable declarations
|
|
|
1678 as they are unused by the OO-Browser. */
|
|
|
1679 if (np->construct != C_CLASS
|
|
|
1680 && np->construct != C_METHOD
|
|
|
1681 && np->construct != C_EXTERN
|
|
|
1682 && np->construct != C_OBJC)
|
|
|
1683 {
|
|
|
1684 oo_browser_class = oo_browser_default_classes[np->construct];
|
|
|
1685 switch (np->construct)
|
|
|
1686 {
|
|
|
1687 case C_CONSTANT:
|
|
|
1688 case C_ENUMERATION:
|
|
|
1689 case C_ENUM_LABEL:
|
|
|
1690 case C_STRUCTURE:
|
|
|
1691 case C_TYPE:
|
|
|
1692 case C_UNION:
|
|
|
1693 case C_VARIABLE:
|
|
|
1694 oo_browser_prefix = '=';
|
|
|
1695 break;
|
|
|
1696 case C_FUNCTION:
|
|
|
1697 case C_MACRO:
|
|
|
1698 oo_browser_prefix = '-';
|
|
|
1699 break;
|
|
|
1700 }
|
|
|
1701 if (np->name != NULL)
|
|
|
1702 fprintf (tagf, "%s@%c %s@%s\n",
|
|
|
1703 oo_browser_class, oo_browser_prefix,
|
|
|
1704 np->name, np->pat);
|
|
|
1705 else
|
|
|
1706 fprintf (tagf, "%s@%c ???@%s\n",
|
|
|
1707 oo_browser_class, oo_browser_prefix, np->pat);
|
|
|
1708 }
|
|
|
1709 }
|
|
|
1710 else
|
|
|
1711 {
|
|
|
1712 #endif
|
|
201
|
1713 if (np->name != NULL)
|
|
173
|
1714 fprintf (tagf, "%s\177%s\001%d,%ld\n",
|
|
201
|
1715 np->pat, np->name, np->lno, np->cno);
|
|
0
|
1716 else
|
|
173
|
1717 fprintf (tagf, "%s\177%d,%ld\n",
|
|
201
|
1718 np->pat, np->lno, np->cno);
|
|
276
|
1719 #ifdef OO_BROWSER
|
|
|
1720 }
|
|
|
1721 #endif
|
|
0
|
1722 }
|
|
4
|
1723 else
|
|
0
|
1724 {
|
|
201
|
1725 if (np->name == NULL)
|
|
4
|
1726 error ("internal error: NULL name in ctags mode.", (char *)NULL);
|
|
|
1727
|
|
|
1728 if (cxref_style)
|
|
|
1729 {
|
|
|
1730 if (vgrind_style)
|
|
|
1731 fprintf (stdout, "%s %s %d\n",
|
|
201
|
1732 np->name, np->file, (np->lno + 63) / 64);
|
|
4
|
1733 else
|
|
|
1734 fprintf (stdout, "%-16s %3d %-16s %s\n",
|
|
201
|
1735 np->name, np->lno, np->file, np->pat);
|
|
0
|
1736 }
|
|
|
1737 else
|
|
4
|
1738 {
|
|
201
|
1739 fprintf (tagf, "%s\t%s\t", np->name, np->file);
|
|
|
1740
|
|
|
1741 if (np->is_func)
|
|
4
|
1742 { /* a function */
|
|
|
1743 putc (searchar, tagf);
|
|
|
1744 putc ('^', tagf);
|
|
|
1745
|
|
201
|
1746 for (sp = np->pat; *sp; sp++)
|
|
4
|
1747 {
|
|
|
1748 if (*sp == '\\' || *sp == searchar)
|
|
|
1749 putc ('\\', tagf);
|
|
|
1750 putc (*sp, tagf);
|
|
|
1751 }
|
|
|
1752 putc (searchar, tagf);
|
|
|
1753 }
|
|
|
1754 else
|
|
|
1755 { /* a typedef; text pattern inadequate */
|
|
201
|
1756 fprintf (tagf, "%d", np->lno);
|
|
4
|
1757 }
|
|
|
1758 putc ('\n', tagf);
|
|
0
|
1759 }
|
|
|
1760 }
|
|
|
1761
|
|
|
1762 /* Output subentries that follow this one */
|
|
201
|
1763 put_entries (np->right);
|
|
0
|
1764 }
|
|
|
1765
|
|
|
1766 /* Length of a number's decimal representation. */
|
|
201
|
1767 int number_len PP ((long num));
|
|
4
|
1768 int
|
|
|
1769 number_len (num)
|
|
|
1770 long num;
|
|
0
|
1771 {
|
|
201
|
1772 int len = 1;
|
|
|
1773 while ((num /= 10) > 0)
|
|
|
1774 len += 1;
|
|
0
|
1775 return len;
|
|
|
1776 }
|
|
|
1777
|
|
|
1778 /*
|
|
|
1779 * Return total number of characters that put_entries will output for
|
|
|
1780 * the nodes in the subtree of the specified node. Works only if
|
|
|
1781 * we are not ctags, but called only in that case. This count
|
|
|
1782 * is irrelevant with the new tags.el, but is still supplied for
|
|
|
1783 * backward compatibility.
|
|
|
1784 */
|
|
|
1785 int
|
|
201
|
1786 total_size_of_entries (np)
|
|
|
1787 register node *np;
|
|
0
|
1788 {
|
|
|
1789 register int total;
|
|
|
1790
|
|
201
|
1791 if (np == NULL)
|
|
0
|
1792 return 0;
|
|
|
1793
|
|
201
|
1794 for (total = 0; np != NULL; np = np->right)
|
|
0
|
1795 {
|
|
|
1796 /* Count left subentries. */
|
|
201
|
1797 total += total_size_of_entries (np->left);
|
|
0
|
1798
|
|
|
1799 /* Count this entry */
|
|
201
|
1800 total += strlen (np->pat) + 1;
|
|
|
1801 total += number_len ((long) np->lno) + 1 + number_len (np->cno) + 1;
|
|
|
1802 if (np->name != NULL)
|
|
|
1803 total += 1 + strlen (np->name); /* \001name */
|
|
0
|
1804 }
|
|
|
1805
|
|
|
1806 return total;
|
|
|
1807 }
|
|
|
1808
|
|
|
1809 /*
|
|
|
1810 * The C symbol tables.
|
|
|
1811 */
|
|
|
1812 enum sym_type
|
|
|
1813 {
|
|
155
|
1814 st_none,
|
|
|
1815 st_C_objprot, st_C_objimpl, st_C_objend,
|
|
|
1816 st_C_gnumacro,
|
|
|
1817 st_C_ignore,
|
|
|
1818 st_C_javastruct,
|
|
|
1819 st_C_struct, st_C_enum, st_C_define, st_C_typedef, st_C_typespec
|
|
276
|
1820 #ifdef OO_BROWSER
|
|
|
1821 , st_C_union, st_C_class, st_C_extern, st_C_inline
|
|
|
1822 #endif
|
|
0
|
1823 };
|
|
|
1824
|
|
|
1825 /* Feed stuff between (but not including) %[ and %] lines to:
|
|
4
|
1826 gperf -c -k 1,3 -o -p -r -t
|
|
0
|
1827 %[
|
|
4
|
1828 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
|
|
0
|
1829 %%
|
|
4
|
1830 @interface, 0, st_C_objprot
|
|
|
1831 @protocol, 0, st_C_objprot
|
|
|
1832 @implementation,0, st_C_objimpl
|
|
|
1833 @end, 0, st_C_objend
|
|
155
|
1834 import, C_JAVA, st_C_ignore
|
|
|
1835 package, C_JAVA, st_C_ignore
|
|
|
1836 friend, C_PLPL, st_C_ignore
|
|
153
|
1837 extends, C_JAVA, st_C_javastruct
|
|
|
1838 implements, C_JAVA, st_C_javastruct
|
|
173
|
1839 interface, C_JAVA, st_C_struct
|
|
276
|
1840 class, C_PLPL, st_C_class
|
|
4
|
1841 namespace, C_PLPL, st_C_struct
|
|
0
|
1842 domain, C_STAR, st_C_struct
|
|
276
|
1843 union, 0, st_C_union
|
|
0
|
1844 struct, 0, st_C_struct
|
|
|
1845 enum, 0, st_C_enum
|
|
|
1846 typedef, 0, st_C_typedef
|
|
|
1847 define, 0, st_C_define
|
|
276
|
1848 inline, 0, st_C_inline
|
|
4
|
1849 bool, C_PLPL, st_C_typespec
|
|
0
|
1850 long, 0, st_C_typespec
|
|
|
1851 short, 0, st_C_typespec
|
|
|
1852 int, 0, st_C_typespec
|
|
|
1853 char, 0, st_C_typespec
|
|
|
1854 float, 0, st_C_typespec
|
|
|
1855 double, 0, st_C_typespec
|
|
|
1856 signed, 0, st_C_typespec
|
|
|
1857 unsigned, 0, st_C_typespec
|
|
|
1858 auto, 0, st_C_typespec
|
|
|
1859 void, 0, st_C_typespec
|
|
276
|
1860 extern, 0, st_C_extern
|
|
0
|
1861 static, 0, st_C_typespec
|
|
|
1862 const, 0, st_C_typespec
|
|
|
1863 volatile, 0, st_C_typespec
|
|
4
|
1864 explicit, C_PLPL, st_C_typespec
|
|
|
1865 mutable, C_PLPL, st_C_typespec
|
|
|
1866 typename, C_PLPL, st_C_typespec
|
|
|
1867 # DEFUN used in emacs, the next three used in glibc (SYSCALL only for mach).
|
|
|
1868 DEFUN, 0, st_C_gnumacro
|
|
|
1869 SYSCALL, 0, st_C_gnumacro
|
|
|
1870 ENTRY, 0, st_C_gnumacro
|
|
|
1871 PSEUDO, 0, st_C_gnumacro
|
|
|
1872 # These are defined inside C functions, so currently they are not met.
|
|
|
1873 # EXFUN used in glibc, DEFVAR_* in emacs.
|
|
|
1874 #EXFUN, 0, st_C_gnumacro
|
|
|
1875 #DEFVAR_, 0, st_C_gnumacro
|
|
0
|
1876 %]
|
|
|
1877 and replace lines between %< and %> with its output. */
|
|
|
1878 /*%<*/
|
|
276
|
1879 /* C code produced by gperf version 2.5 (GNU C++ version) */
|
|
4
|
1880 /* Command-line: gperf -c -k 1,3 -o -p -r -t */
|
|
|
1881 struct C_stab_entry { char *name; int c_ext; enum sym_type type; };
|
|
0
|
1882
|
|
276
|
1883 #define TOTAL_KEYWORDS 41
|
|
0
|
1884 #define MIN_WORD_LENGTH 3
|
|
4
|
1885 #define MAX_WORD_LENGTH 15
|
|
276
|
1886 #define MIN_HASH_VALUE 19
|
|
|
1887 #define MAX_HASH_VALUE 100
|
|
|
1888 /* maximum key range = 82, duplicates = 0 */
|
|
|
1889
|
|
|
1890 static unsigned int
|
|
4
|
1891 hash (str, len)
|
|
|
1892 register char *str;
|
|
276
|
1893 register int unsigned len;
|
|
0
|
1894 {
|
|
276
|
1895 static unsigned char asso_values[] =
|
|
0
|
1896 {
|
|
276
|
1897 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1898 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1899 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1900 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1901 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1902 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1903 101, 101, 101, 101, 25, 101, 101, 101, 31, 33,
|
|
|
1904 46, 101, 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1905 60, 101, 101, 43, 1, 101, 101, 101, 101, 101,
|
|
|
1906 101, 101, 101, 101, 101, 101, 101, 11, 17, 4,
|
|
|
1907 44, 63, 31, 8, 101, 29, 101, 101, 14, 15,
|
|
|
1908 44, 5, 13, 101, 38, 15, 25, 33, 55, 101,
|
|
|
1909 101, 101, 101, 101, 101, 101, 101, 101,
|
|
|
1910 };
|
|
|
1911 return len + asso_values[str[2]] + asso_values[str[0]];
|
|
0
|
1912 }
|
|
|
1913
|
|
4
|
1914 struct C_stab_entry *
|
|
|
1915 in_word_set (str, len)
|
|
|
1916 register char *str;
|
|
|
1917 register unsigned int len;
|
|
0
|
1918 {
|
|
276
|
1919 static struct C_stab_entry wordlist[] =
|
|
0
|
1920 {
|
|
4
|
1921 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
|
|
276
|
1922 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
|
|
|
1923 {"",}, {"char", 0, st_C_typespec},
|
|
|
1924 {"class", C_PLPL, st_C_class},
|
|
173
|
1925 {"",}, {"",}, {"",},
|
|
276
|
1926 {"package", C_JAVA, st_C_ignore},
|
|
|
1927 {"short", 0, st_C_typespec},
|
|
|
1928 {"bool", C_PLPL, st_C_typespec},
|
|
|
1929 {"",}, {"",},
|
|
|
1930 {"signed", 0, st_C_typespec},
|
|
|
1931 {"",}, {"",},
|
|
|
1932 {"static", 0, st_C_typespec},
|
|
|
1933 {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
|
|
|
1934 {"ENTRY", 0, st_C_gnumacro},
|
|
|
1935 {"auto", 0, st_C_typespec},
|
|
|
1936 {"float", 0, st_C_typespec},
|
|
|
1937 {"",}, {"",}, {"",},
|
|
|
1938 {"typedef", 0, st_C_typedef},
|
|
|
1939 {"typename", C_PLPL, st_C_typespec},
|
|
|
1940 {"mutable", C_PLPL, st_C_typespec},
|
|
|
1941 {"import", C_JAVA, st_C_ignore},
|
|
|
1942 {"inline", 0, st_C_inline},
|
|
|
1943 {"",}, {"",},
|
|
|
1944 {"implements", C_JAVA, st_C_javastruct},
|
|
|
1945 {"const", 0, st_C_typespec},
|
|
173
|
1946 {"",},
|
|
276
|
1947 {"@implementation", 0, st_C_objimpl},
|
|
|
1948 {"unsigned", 0, st_C_typespec},
|
|
|
1949 {"int", 0, st_C_typespec},
|
|
173
|
1950 {"",},
|
|
276
|
1951 {"struct", 0, st_C_struct},
|
|
153
|
1952 {"",}, {"",},
|
|
276
|
1953 {"long", 0, st_C_typespec},
|
|
|
1954 {"interface", C_JAVA, st_C_struct},
|
|
|
1955 {"",},
|
|
|
1956 {"domain", C_STAR, st_C_struct},
|
|
|
1957 {"friend", C_PLPL, st_C_ignore},
|
|
|
1958 {"union", 0, st_C_union},
|
|
|
1959 {"namespace", C_PLPL, st_C_struct},
|
|
|
1960 {"",}, {"",}, {"",},
|
|
|
1961 {"@protocol", 0, st_C_objprot},
|
|
|
1962 {"@end", 0, st_C_objend},
|
|
|
1963 {"",}, {"",}, {"",},
|
|
|
1964 {"volatile", 0, st_C_typespec},
|
|
|
1965 {"",},
|
|
|
1966 {"@interface", 0, st_C_objprot},
|
|
|
1967 {"",},
|
|
|
1968 {"define", 0, st_C_define},
|
|
|
1969 {"DEFUN", 0, st_C_gnumacro},
|
|
|
1970 {"double", 0, st_C_typespec},
|
|
|
1971 {"explicit", C_PLPL, st_C_typespec},
|
|
|
1972 {"",}, {"",}, {"",},
|
|
|
1973 {"void", 0, st_C_typespec},
|
|
173
|
1974 {"",}, {"",}, {"",}, {"",},
|
|
276
|
1975 {"SYSCALL", 0, st_C_gnumacro},
|
|
|
1976 {"extern", 0, st_C_extern},
|
|
|
1977 {"extends", C_JAVA, st_C_javastruct},
|
|
|
1978 {"",}, {"",}, {"",},
|
|
|
1979 {"PSEUDO", 0, st_C_gnumacro},
|
|
|
1980 {"enum", 0, st_C_enum},
|
|
0
|
1981 };
|
|
|
1982
|
|
|
1983 if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
|
|
|
1984 {
|
|
|
1985 register int key = hash (str, len);
|
|
|
1986
|
|
276
|
1987 if (key <= MAX_HASH_VALUE && key >= 0)
|
|
0
|
1988 {
|
|
4
|
1989 register char *s = wordlist[key].name;
|
|
|
1990
|
|
|
1991 if (*s == *str && !strncmp (str + 1, s + 1, len - 1))
|
|
0
|
1992 return &wordlist[key];
|
|
|
1993 }
|
|
|
1994 }
|
|
|
1995 return 0;
|
|
|
1996 }
|
|
|
1997 /*%>*/
|
|
|
1998
|
|
201
|
1999 enum sym_type C_symtype PP ((char *str, int len, int c_ext));
|
|
4
|
2000 enum sym_type
|
|
|
2001 C_symtype (str, len, c_ext)
|
|
|
2002 char *str;
|
|
|
2003 int len;
|
|
|
2004 int c_ext;
|
|
0
|
2005 {
|
|
4
|
2006 register struct C_stab_entry *se = in_word_set (str, len);
|
|
0
|
2007
|
|
|
2008 if (se == NULL || (se->c_ext && !(c_ext & se->c_ext)))
|
|
|
2009 return st_none;
|
|
|
2010 return se->type;
|
|
|
2011 }
|
|
|
2012
|
|
|
2013 /*
|
|
153
|
2014 * C functions and variables are recognized using a simple
|
|
155
|
2015 * finite automaton. fvdef is its state variable.
|
|
0
|
2016 */
|
|
4
|
2017 enum
|
|
0
|
2018 {
|
|
153
|
2019 fvnone, /* nothing seen */
|
|
|
2020 fvnameseen, /* function or variable name seen */
|
|
|
2021 fstartlist, /* func: just after open parenthesis */
|
|
|
2022 finlist, /* func: in parameter list */
|
|
|
2023 flistseen, /* func: after parameter list */
|
|
|
2024 fignore, /* func: before open brace */
|
|
155
|
2025 vignore /* var-like: ignore until ';' */
|
|
|
2026 } fvdef;
|
|
0
|
2027
|
|
|
2028
|
|
|
2029 /*
|
|
|
2030 * typedefs are recognized using a simple finite automaton.
|
|
4
|
2031 * typdef is its state variable.
|
|
0
|
2032 */
|
|
4
|
2033 enum
|
|
0
|
2034 {
|
|
|
2035 tnone, /* nothing seen */
|
|
|
2036 ttypedseen, /* typedef keyword seen */
|
|
|
2037 tinbody, /* inside typedef body */
|
|
|
2038 tend, /* just before typedef tag */
|
|
|
2039 tignore /* junk after typedef tag */
|
|
4
|
2040 } typdef;
|
|
0
|
2041
|
|
|
2042
|
|
|
2043 /*
|
|
|
2044 * struct-like structures (enum, struct and union) are recognized
|
|
|
2045 * using another simple finite automaton. `structdef' is its state
|
|
|
2046 * variable.
|
|
|
2047 */
|
|
4
|
2048 enum
|
|
0
|
2049 {
|
|
|
2050 snone, /* nothing seen yet */
|
|
|
2051 skeyseen, /* struct-like keyword seen */
|
|
|
2052 stagseen, /* struct-like tag seen */
|
|
|
2053 scolonseen, /* colon seen after struct-like tag */
|
|
|
2054 sinbody /* in struct body: recognize member func defs*/
|
|
4
|
2055 } structdef;
|
|
0
|
2056
|
|
|
2057 /*
|
|
|
2058 * When structdef is stagseen, scolonseen, or sinbody, structtag is the
|
|
|
2059 * struct tag, and structtype is the type of the preceding struct-like
|
|
|
2060 * keyword.
|
|
|
2061 */
|
|
4
|
2062 char *structtag = "<uninited>";
|
|
0
|
2063 enum sym_type structtype;
|
|
|
2064
|
|
276
|
2065 #ifdef OO_BROWSER
|
|
|
2066 void
|
|
|
2067 oo_browser_check_and_clear_structtype()
|
|
|
2068 {
|
|
|
2069 /* Allow for multiple enum_label tags. */
|
|
|
2070 if (structtype != st_C_enum)
|
|
|
2071 structtype = st_none;
|
|
|
2072 }
|
|
|
2073 #endif
|
|
|
2074
|
|
0
|
2075 /*
|
|
4
|
2076 * When objdef is different from onone, objtag is the name of the class.
|
|
|
2077 */
|
|
|
2078 char *objtag = "<uninited>";
|
|
|
2079
|
|
|
2080 /*
|
|
0
|
2081 * Yet another little state machine to deal with preprocessor lines.
|
|
|
2082 */
|
|
4
|
2083 enum
|
|
0
|
2084 {
|
|
|
2085 dnone, /* nothing seen */
|
|
|
2086 dsharpseen, /* '#' seen as first char on line */
|
|
|
2087 ddefineseen, /* '#' and 'define' seen */
|
|
|
2088 dignorerest /* ignore rest of line */
|
|
4
|
2089 } definedef;
|
|
|
2090
|
|
|
2091 /*
|
|
|
2092 * State machine for Objective C protocols and implementations.
|
|
153
|
2093 * Tom R.Hageman <tom@basil.icce.rug.nl>
|
|
4
|
2094 */
|
|
|
2095 enum
|
|
|
2096 {
|
|
|
2097 onone, /* nothing seen */
|
|
|
2098 oprotocol, /* @interface or @protocol seen */
|
|
|
2099 oimplementation, /* @implementations seen */
|
|
|
2100 otagseen, /* class name seen */
|
|
|
2101 oparenseen, /* parenthesis before category seen */
|
|
|
2102 ocatseen, /* category name seen */
|
|
|
2103 oinbody, /* in @implementation body */
|
|
|
2104 omethodsign, /* in @implementation body, after +/- */
|
|
|
2105 omethodtag, /* after method name */
|
|
|
2106 omethodcolon, /* after method colon */
|
|
|
2107 omethodparm, /* after method parameter */
|
|
|
2108 oignore /* wait for @end */
|
|
|
2109 } objdef;
|
|
0
|
2110
|
|
155
|
2111 /*
|
|
|
2112 * Use this structure to keep info about the token read, and how it
|
|
|
2113 * should be tagged. Used by the make_C_tag function to build a tag.
|
|
|
2114 */
|
|
|
2115 typedef struct
|
|
|
2116 {
|
|
|
2117 bool valid;
|
|
|
2118 char *str;
|
|
|
2119 bool named;
|
|
|
2120 int linelen;
|
|
|
2121 int lineno;
|
|
|
2122 long linepos;
|
|
|
2123 char *buffer;
|
|
201
|
2124 } token;
|
|
|
2125
|
|
|
2126 token tok; /* latest token read */
|
|
155
|
2127
|
|
0
|
2128 /*
|
|
|
2129 * Set this to TRUE, and the next token considered is called a function.
|
|
|
2130 * Used only for GNU emacs's function-defining macros.
|
|
|
2131 */
|
|
155
|
2132 bool next_token_is_func;
|
|
0
|
2133
|
|
|
2134 /*
|
|
|
2135 * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
|
|
|
2136 */
|
|
155
|
2137 bool yacc_rules;
|
|
0
|
2138
|
|
|
2139 /*
|
|
4
|
2140 * methodlen is the length of the method name stored in token_name.
|
|
|
2141 */
|
|
|
2142 int methodlen;
|
|
|
2143
|
|
276
|
2144 #ifdef OO_BROWSER
|
|
|
2145 void
|
|
|
2146 oo_browser_clear_all_globals()
|
|
|
2147 {
|
|
|
2148 /* Initialize globals so there is no carry over between files. */
|
|
|
2149 oo_browser_construct = C_NULL;
|
|
|
2150 fvdef = fvnone; typdef = tnone; structdef = snone;
|
|
|
2151 definedef = dnone; objdef = onone;
|
|
|
2152 structtype = st_none;
|
|
|
2153 next_token_is_func = yacc_rules = FALSE;
|
|
|
2154 }
|
|
|
2155
|
|
|
2156 void
|
|
|
2157 oo_browser_clear_some_globals()
|
|
|
2158 {
|
|
|
2159 oo_browser_construct = C_NULL;
|
|
|
2160 structtype = st_none;
|
|
|
2161 }
|
|
|
2162 #endif
|
|
|
2163
|
|
4
|
2164 /*
|
|
0
|
2165 * consider_token ()
|
|
|
2166 * checks to see if the current token is at the start of a
|
|
153
|
2167 * function or variable, or corresponds to a typedef, or
|
|
|
2168 * is a struct/union/enum tag, or #define, or an enum constant.
|
|
0
|
2169 *
|
|
4
|
2170 * *IS_FUNC gets TRUE iff the token is a function or #define macro
|
|
|
2171 * with args. C_EXT is which language we are looking at.
|
|
0
|
2172 *
|
|
|
2173 * In the future we will need some way to adjust where the end of
|
|
|
2174 * the token is; for instance, implementing the C++ keyword
|
|
|
2175 * `operator' properly will adjust the end of the token to be after
|
|
|
2176 * whatever follows `operator'.
|
|
|
2177 *
|
|
|
2178 * Globals
|
|
155
|
2179 * fvdef IN OUT
|
|
0
|
2180 * structdef IN OUT
|
|
|
2181 * definedef IN OUT
|
|
|
2182 * typdef IN OUT
|
|
4
|
2183 * objdef IN OUT
|
|
0
|
2184 * next_token_is_func IN OUT
|
|
|
2185 */
|
|
201
|
2186 bool consider_token PP ((char *str, int len, int c, int c_ext,
|
|
|
2187 int cblev, int parlev, bool *is_func_or_var));
|
|
155
|
2188 bool
|
|
153
|
2189 consider_token (str, len, c, c_ext, cblev, parlev, is_func_or_var)
|
|
0
|
2190 register char *str; /* IN: token pointer */
|
|
|
2191 register int len; /* IN: token length */
|
|
201
|
2192 register int c; /* IN: first char after the token */
|
|
0
|
2193 int c_ext; /* IN: C extensions mask */
|
|
|
2194 int cblev; /* IN: curly brace level */
|
|
4
|
2195 int parlev; /* IN: parenthesis level */
|
|
155
|
2196 bool *is_func_or_var; /* OUT: function or variable found */
|
|
0
|
2197 {
|
|
|
2198 enum sym_type toktype = C_symtype (str, len, c_ext);
|
|
|
2199
|
|
276
|
2200 #ifdef OO_BROWSER
|
|
|
2201 switch (toktype)
|
|
|
2202 {
|
|
|
2203 case st_C_struct:
|
|
|
2204 set_construct(C_STRUCTURE);
|
|
|
2205 break;
|
|
|
2206 case st_C_union:
|
|
|
2207 set_construct(C_UNION);
|
|
|
2208 break;
|
|
|
2209 case st_C_class:
|
|
|
2210 set_construct(C_CLASS);
|
|
|
2211 break;
|
|
|
2212 case st_C_enum:
|
|
|
2213 set_construct(C_ENUMERATION);
|
|
|
2214 break;
|
|
|
2215 case st_C_typedef:
|
|
|
2216 set_construct(C_TYPE);
|
|
|
2217 break;
|
|
|
2218 case st_C_extern:
|
|
|
2219 set_construct(C_EXTERN);
|
|
|
2220 break;
|
|
|
2221 case st_C_inline:
|
|
|
2222 set_construct(C_FUNCTION);
|
|
|
2223 break;
|
|
|
2224 }
|
|
|
2225 #endif
|
|
|
2226
|
|
0
|
2227 /*
|
|
|
2228 * Advance the definedef state machine.
|
|
|
2229 */
|
|
|
2230 switch (definedef)
|
|
|
2231 {
|
|
|
2232 case dnone:
|
|
|
2233 /* We're not on a preprocessor line. */
|
|
|
2234 break;
|
|
|
2235 case dsharpseen:
|
|
|
2236 if (toktype == st_C_define)
|
|
|
2237 {
|
|
|
2238 definedef = ddefineseen;
|
|
|
2239 }
|
|
|
2240 else
|
|
|
2241 {
|
|
|
2242 definedef = dignorerest;
|
|
|
2243 }
|
|
|
2244 return FALSE;
|
|
|
2245 case ddefineseen:
|
|
|
2246 /*
|
|
|
2247 * Make a tag for any macro, unless it is a constant
|
|
|
2248 * and constantypedefs is FALSE.
|
|
|
2249 */
|
|
|
2250 definedef = dignorerest;
|
|
276
|
2251 #ifndef OO_BROWSER
|
|
153
|
2252 *is_func_or_var = (c == '(');
|
|
276
|
2253 #else
|
|
|
2254 {
|
|
|
2255 char *p = str + len * sizeof(char);
|
|
|
2256
|
|
|
2257 if (*p == '(')
|
|
|
2258 /* This must be a macro since there is no
|
|
|
2259 whitespace between the opening parenthesis
|
|
|
2260 and the definition name. */
|
|
|
2261 *is_func_or_var = TRUE;
|
|
|
2262 else
|
|
|
2263 {
|
|
|
2264 *is_func_or_var = FALSE;
|
|
|
2265
|
|
|
2266 /* Handle possible whitespace between macro tag and opening
|
|
|
2267 parenthesis and ensure this is an actual macro.
|
|
|
2268 -- Bob Weiner, Altrasoft, 11/19/1997 */
|
|
|
2269 while (*p && isspace(*p)) p++;
|
|
|
2270 if (*p) c = *p;
|
|
|
2271
|
|
|
2272 /* Skip over nested parentheses. */
|
|
|
2273 if (c == '(')
|
|
|
2274 {
|
|
|
2275 short depth = 1;
|
|
|
2276
|
|
|
2277 while (*++p && depth > 0 && *p != '\n')
|
|
|
2278 {
|
|
|
2279 switch (*p)
|
|
|
2280 {
|
|
|
2281 case '(':
|
|
|
2282 depth++; break;
|
|
|
2283 case ')':
|
|
|
2284 depth--; break;
|
|
|
2285 }
|
|
|
2286 }
|
|
|
2287
|
|
|
2288 /* If this is a macro, we have just passed
|
|
|
2289 the arguments and there will be more on
|
|
|
2290 the line before the NULL character that marks
|
|
|
2291 the end of the line token. */
|
|
|
2292 while (*p == ' ' || *p == '\t') p++;
|
|
|
2293 if (*p) *is_func_or_var = TRUE;
|
|
|
2294 }
|
|
|
2295 }
|
|
|
2296 }
|
|
|
2297
|
|
|
2298 set_construct((*is_func_or_var) ? C_MACRO : C_CONSTANT);
|
|
|
2299 #endif
|
|
153
|
2300 if (!*is_func_or_var && !constantypedefs)
|
|
0
|
2301 return FALSE;
|
|
|
2302 else
|
|
|
2303 return TRUE;
|
|
|
2304 case dignorerest:
|
|
|
2305 return FALSE;
|
|
|
2306 default:
|
|
4
|
2307 error ("internal error: definedef value.", (char *)NULL);
|
|
0
|
2308 }
|
|
|
2309
|
|
|
2310 /*
|
|
|
2311 * Now typedefs
|
|
|
2312 */
|
|
|
2313 switch (typdef)
|
|
|
2314 {
|
|
|
2315 case tnone:
|
|
|
2316 if (toktype == st_C_typedef)
|
|
|
2317 {
|
|
|
2318 if (typedefs)
|
|
|
2319 typdef = ttypedseen;
|
|
155
|
2320 fvdef = fvnone;
|
|
0
|
2321 return FALSE;
|
|
|
2322 }
|
|
|
2323 break;
|
|
|
2324 case ttypedseen:
|
|
|
2325 switch (toktype)
|
|
|
2326 {
|
|
|
2327 case st_none:
|
|
|
2328 case st_C_typespec:
|
|
276
|
2329 #ifdef OO_BROWSER
|
|
|
2330 case st_C_extern:
|
|
|
2331 #endif
|
|
0
|
2332 typdef = tend;
|
|
|
2333 break;
|
|
|
2334 case st_C_struct:
|
|
|
2335 case st_C_enum:
|
|
276
|
2336 #ifdef OO_BROWSER
|
|
|
2337 case st_C_union:
|
|
|
2338 case st_C_class:
|
|
|
2339 #endif
|
|
0
|
2340 break;
|
|
|
2341 }
|
|
|
2342 /* Do not return here, so the structdef stuff has a chance. */
|
|
|
2343 break;
|
|
|
2344 case tend:
|
|
|
2345 switch (toktype)
|
|
|
2346 {
|
|
|
2347 case st_C_typespec:
|
|
|
2348 case st_C_struct:
|
|
|
2349 case st_C_enum:
|
|
276
|
2350 #ifdef OO_BROWSER
|
|
|
2351 case st_C_extern:
|
|
|
2352 case st_C_union:
|
|
|
2353 case st_C_class:
|
|
|
2354 #endif
|
|
0
|
2355 return FALSE;
|
|
|
2356 }
|
|
|
2357 return TRUE;
|
|
|
2358 }
|
|
|
2359
|
|
|
2360 /*
|
|
|
2361 * This structdef business is currently only invoked when cblev==0.
|
|
|
2362 * It should be recursively invoked whatever the curly brace level,
|
|
|
2363 * and a stack of states kept, to allow for definitions of structs
|
|
|
2364 * within structs.
|
|
|
2365 *
|
|
|
2366 * This structdef business is NOT invoked when we are ctags and the
|
|
|
2367 * file is plain C. This is because a struct tag may have the same
|
|
|
2368 * name as another tag, and this loses with ctags.
|
|
|
2369 */
|
|
|
2370 switch (toktype)
|
|
|
2371 {
|
|
153
|
2372 case st_C_javastruct:
|
|
149
|
2373 if (structdef == stagseen)
|
|
|
2374 structdef = scolonseen;
|
|
|
2375 return FALSE;
|
|
0
|
2376 case st_C_struct:
|
|
|
2377 case st_C_enum:
|
|
276
|
2378 #ifdef OO_BROWSER
|
|
|
2379 case st_C_union:
|
|
|
2380 case st_C_class:
|
|
|
2381 case st_C_extern:
|
|
|
2382 #endif
|
|
0
|
2383 if (typdef == ttypedseen
|
|
|
2384 || (typedefs_and_cplusplus && cblev == 0 && structdef == snone))
|
|
|
2385 {
|
|
|
2386 structdef = skeyseen;
|
|
|
2387 structtype = toktype;
|
|
|
2388 }
|
|
|
2389 return FALSE;
|
|
|
2390 }
|
|
4
|
2391
|
|
0
|
2392 if (structdef == skeyseen)
|
|
|
2393 {
|
|
153
|
2394 /* Save the tag for struct/union/class, for functions and variables
|
|
|
2395 that may be defined inside. */
|
|
276
|
2396 #ifndef OO_BROWSER
|
|
0
|
2397 if (structtype == st_C_struct)
|
|
276
|
2398 #else
|
|
|
2399 if (structtype == st_C_struct
|
|
|
2400 || structtype == st_C_union
|
|
|
2401 || structtype == st_C_class)
|
|
|
2402 #endif
|
|
0
|
2403 structtag = savenstr (str, len);
|
|
|
2404 else
|
|
|
2405 structtag = "<enum>";
|
|
|
2406 structdef = stagseen;
|
|
|
2407 return TRUE;
|
|
|
2408 }
|
|
|
2409
|
|
155
|
2410 /* Avoid entering fvdef stuff if typdef is going on. */
|
|
0
|
2411 if (typdef != tnone)
|
|
|
2412 {
|
|
|
2413 definedef = dnone;
|
|
|
2414 return FALSE;
|
|
|
2415 }
|
|
|
2416
|
|
4
|
2417 /* Detect GNU macros.
|
|
|
2418
|
|
|
2419 DEFUN note for writers of emacs C code:
|
|
|
2420 The DEFUN macro, used in emacs C source code, has a first arg
|
|
|
2421 that is a string (the lisp function name), and a second arg that
|
|
|
2422 is a C function name. Since etags skips strings, the second arg
|
|
|
2423 is tagged. This is unfortunate, as it would be better to tag the
|
|
|
2424 first arg. The simplest way to deal with this problem would be
|
|
|
2425 to name the tag with a name built from the function name, by
|
|
|
2426 removing the initial 'F' character and substituting '-' for '_'.
|
|
|
2427 Anyway, this assumes that the conventions of naming lisp
|
|
|
2428 functions will never change. Currently, this method is not
|
|
|
2429 implemented, so writers of emacs code are recommended to put the
|
|
|
2430 first two args of a DEFUN on the same line. */
|
|
|
2431 if (definedef == dnone && toktype == st_C_gnumacro)
|
|
|
2432 {
|
|
|
2433 next_token_is_func = TRUE;
|
|
|
2434 return FALSE;
|
|
|
2435 }
|
|
0
|
2436 if (next_token_is_func)
|
|
|
2437 {
|
|
|
2438 next_token_is_func = FALSE;
|
|
155
|
2439 fvdef = fignore;
|
|
153
|
2440 *is_func_or_var = TRUE;
|
|
0
|
2441 return TRUE;
|
|
|
2442 }
|
|
|
2443
|
|
4
|
2444 /* Detect Objective C constructs. */
|
|
|
2445 switch (objdef)
|
|
|
2446 {
|
|
|
2447 case onone:
|
|
|
2448 switch (toktype)
|
|
|
2449 {
|
|
|
2450 case st_C_objprot:
|
|
276
|
2451 #ifdef OO_BROWSER
|
|
|
2452 set_construct(C_OBJC);
|
|
|
2453 #endif
|
|
4
|
2454 objdef = oprotocol;
|
|
|
2455 return FALSE;
|
|
|
2456 case st_C_objimpl:
|
|
276
|
2457 #ifdef OO_BROWSER
|
|
|
2458 set_construct(C_OBJC);
|
|
|
2459 #endif
|
|
4
|
2460 objdef = oimplementation;
|
|
|
2461 return FALSE;
|
|
|
2462 }
|
|
|
2463 break;
|
|
|
2464 case oimplementation:
|
|
153
|
2465 /* Save the class tag for functions or variables defined inside. */
|
|
4
|
2466 objtag = savenstr (str, len);
|
|
|
2467 objdef = oinbody;
|
|
|
2468 return FALSE;
|
|
|
2469 case oprotocol:
|
|
|
2470 /* Save the class tag for categories. */
|
|
|
2471 objtag = savenstr (str, len);
|
|
|
2472 objdef = otagseen;
|
|
153
|
2473 *is_func_or_var = TRUE;
|
|
4
|
2474 return TRUE;
|
|
|
2475 case oparenseen:
|
|
|
2476 objdef = ocatseen;
|
|
153
|
2477 *is_func_or_var = TRUE;
|
|
4
|
2478 return TRUE;
|
|
|
2479 case oinbody:
|
|
|
2480 break;
|
|
|
2481 case omethodsign:
|
|
|
2482 if (parlev == 0)
|
|
|
2483 {
|
|
|
2484 objdef = omethodtag;
|
|
|
2485 methodlen = len;
|
|
153
|
2486 grow_linebuffer (&token_name, methodlen + 1);
|
|
4
|
2487 strncpy (token_name.buffer, str, len);
|
|
|
2488 token_name.buffer[methodlen] = '\0';
|
|
153
|
2489 token_name.len = methodlen;
|
|
4
|
2490 return TRUE;
|
|
|
2491 }
|
|
|
2492 return FALSE;
|
|
|
2493 case omethodcolon:
|
|
|
2494 if (parlev == 0)
|
|
|
2495 objdef = omethodparm;
|
|
|
2496 return FALSE;
|
|
|
2497 case omethodparm:
|
|
|
2498 if (parlev == 0)
|
|
|
2499 {
|
|
|
2500 objdef = omethodtag;
|
|
|
2501 methodlen += len;
|
|
153
|
2502 grow_linebuffer (&token_name, methodlen + 1);
|
|
4
|
2503 strncat (token_name.buffer, str, len);
|
|
153
|
2504 token_name.len = methodlen;
|
|
4
|
2505 return TRUE;
|
|
|
2506 }
|
|
|
2507 return FALSE;
|
|
|
2508 case oignore:
|
|
|
2509 if (toktype == st_C_objend)
|
|
|
2510 {
|
|
|
2511 /* Memory leakage here: the string pointed by objtag is
|
|
|
2512 never released, because many tests would be needed to
|
|
|
2513 avoid breaking on incorrect input code. The amount of
|
|
|
2514 memory leaked here is the sum of the lengths of the
|
|
|
2515 class tags.
|
|
|
2516 free (objtag); */
|
|
|
2517 objdef = onone;
|
|
|
2518 }
|
|
|
2519 return FALSE;
|
|
|
2520 }
|
|
|
2521
|
|
153
|
2522 /* A function, variable or enum constant? */
|
|
0
|
2523 switch (toktype)
|
|
|
2524 {
|
|
|
2525 case st_C_typespec:
|
|
276
|
2526 #ifdef OO_BROWSER
|
|
|
2527 case st_C_extern:
|
|
|
2528 #endif
|
|
155
|
2529 if (fvdef != finlist && fvdef != fignore && fvdef != vignore)
|
|
|
2530 fvdef = fvnone; /* should be useless */
|
|
153
|
2531 return FALSE;
|
|
155
|
2532 case st_C_ignore:
|
|
|
2533 fvdef = vignore;
|
|
0
|
2534 return FALSE;
|
|
4
|
2535 case st_none:
|
|
|
2536 if (constantypedefs && structdef == sinbody && structtype == st_C_enum)
|
|
276
|
2537 #ifdef OO_BROWSER
|
|
|
2538 {
|
|
|
2539 oo_browser_construct = C_ENUM_LABEL;
|
|
|
2540 #endif
|
|
4
|
2541 return TRUE;
|
|
276
|
2542 #ifdef OO_BROWSER
|
|
|
2543 }
|
|
|
2544 #endif
|
|
155
|
2545 if (fvdef == fvnone)
|
|
0
|
2546 {
|
|
155
|
2547 fvdef = fvnameseen; /* function or variable */
|
|
153
|
2548 *is_func_or_var = TRUE;
|
|
0
|
2549 return TRUE;
|
|
|
2550 }
|
|
|
2551 }
|
|
|
2552
|
|
|
2553 return FALSE;
|
|
|
2554 }
|
|
|
2555
|
|
|
2556 /*
|
|
|
2557 * C_entries ()
|
|
153
|
2558 * This routine finds functions, variables, typedefs,
|
|
|
2559 * #define's, enum constants and struct/union/enum definitions in
|
|
|
2560 * #C syntax and adds them to the list.
|
|
0
|
2561 */
|
|
|
2562 #define current_lb_is_new (newndx == curndx)
|
|
|
2563 #define switch_line_buffers() (curndx = 1 - curndx)
|
|
|
2564
|
|
|
2565 #define curlb (lbs[curndx].lb)
|
|
|
2566 #define othlb (lbs[1-curndx].lb)
|
|
|
2567 #define newlb (lbs[newndx].lb)
|
|
|
2568 #define curlinepos (lbs[curndx].linepos)
|
|
|
2569 #define othlinepos (lbs[1-curndx].linepos)
|
|
|
2570 #define newlinepos (lbs[newndx].linepos)
|
|
|
2571
|
|
201
|
2572 #define CNL_SAVE_DEFINEDEF() \
|
|
0
|
2573 do { \
|
|
|
2574 curlinepos = charno; \
|
|
|
2575 lineno++; \
|
|
4
|
2576 linecharno = charno; \
|
|
0
|
2577 charno += readline (&curlb, inf); \
|
|
|
2578 lp = curlb.buffer; \
|
|
|
2579 quotednl = FALSE; \
|
|
|
2580 newndx = curndx; \
|
|
|
2581 } while (0)
|
|
|
2582
|
|
201
|
2583 #define CNL() \
|
|
0
|
2584 do { \
|
|
201
|
2585 CNL_SAVE_DEFINEDEF(); \
|
|
0
|
2586 if (savetok.valid) \
|
|
|
2587 { \
|
|
|
2588 tok = savetok; \
|
|
|
2589 savetok.valid = FALSE; \
|
|
|
2590 } \
|
|
|
2591 definedef = dnone; \
|
|
|
2592 } while (0)
|
|
|
2593
|
|
134
|
2594
|
|
201
|
2595 void make_C_tag PP ((bool isfun));
|
|
134
|
2596 void
|
|
155
|
2597 make_C_tag (isfun)
|
|
|
2598 bool isfun;
|
|
134
|
2599 {
|
|
|
2600 /* This function should never be called when tok.valid is FALSE, but
|
|
|
2601 we must protect against invalid input or internal errors. */
|
|
155
|
2602 if (tok.valid)
|
|
134
|
2603 {
|
|
153
|
2604 if (traditional_tag_style)
|
|
|
2605 {
|
|
|
2606 /* This was the original code. Now we call new_pfnote instead,
|
|
|
2607 which uses the new method for naming tags (see new_pfnote). */
|
|
|
2608 char *name = NULL;
|
|
|
2609
|
|
155
|
2610 if (CTAGS || tok.named)
|
|
153
|
2611 name = savestr (token_name.buffer);
|
|
|
2612 pfnote (name, isfun,
|
|
155
|
2613 tok.buffer, tok.linelen, tok.lineno, tok.linepos);
|
|
153
|
2614 }
|
|
|
2615 else
|
|
|
2616 new_pfnote (token_name.buffer, token_name.len, isfun,
|
|
155
|
2617 tok.buffer, tok.linelen, tok.lineno, tok.linepos);
|
|
|
2618 tok.valid = FALSE;
|
|
134
|
2619 }
|
|
|
2620 else if (DEBUG)
|
|
|
2621 abort ();
|
|
|
2622 }
|
|
|
2623
|
|
4
|
2624
|
|
|
2625 void
|
|
|
2626 C_entries (c_ext, inf)
|
|
0
|
2627 int c_ext; /* extension of C */
|
|
|
2628 FILE *inf; /* input file */
|
|
|
2629 {
|
|
|
2630 register char c; /* latest char read; '\0' for end of line */
|
|
|
2631 register char *lp; /* pointer one beyond the character `c' */
|
|
|
2632 int curndx, newndx; /* indices for current and new lb */
|
|
4
|
2633 register int tokoff; /* offset in line of start of current token */
|
|
|
2634 register int toklen; /* length of current token */
|
|
153
|
2635 char *qualifier; /* string used to qualify names */
|
|
|
2636 int qlen; /* length of qualifier */
|
|
0
|
2637 int cblev; /* current curly brace level */
|
|
|
2638 int parlev; /* current parenthesis level */
|
|
155
|
2639 bool incomm, inquote, inchar, quotednl, midtoken;
|
|
|
2640 bool cplpl, cjava;
|
|
201
|
2641 token savetok; /* token saved during preprocessor handling */
|
|
|
2642
|
|
|
2643
|
|
|
2644 tokoff = toklen = 0; /* keep compiler quiet */
|
|
0
|
2645 curndx = newndx = 0;
|
|
|
2646 lineno = 0;
|
|
|
2647 charno = 0;
|
|
|
2648 lp = curlb.buffer;
|
|
|
2649 *lp = 0;
|
|
|
2650
|
|
155
|
2651 fvdef = fvnone; typdef = tnone; structdef = snone;
|
|
4
|
2652 definedef = dnone; objdef = onone;
|
|
0
|
2653 next_token_is_func = yacc_rules = FALSE;
|
|
|
2654 midtoken = inquote = inchar = incomm = quotednl = FALSE;
|
|
|
2655 tok.valid = savetok.valid = FALSE;
|
|
|
2656 cblev = 0;
|
|
|
2657 parlev = 0;
|
|
153
|
2658 cplpl = (c_ext & C_PLPL) == C_PLPL;
|
|
|
2659 cjava = (c_ext & C_JAVA) == C_JAVA;
|
|
|
2660 if (cjava)
|
|
|
2661 { qualifier = "."; qlen = 1; }
|
|
|
2662 else
|
|
|
2663 { qualifier = "::"; qlen = 2; }
|
|
0
|
2664
|
|
|
2665 while (!feof (inf))
|
|
|
2666 {
|
|
|
2667 c = *lp++;
|
|
|
2668 if (c == '\\')
|
|
|
2669 {
|
|
|
2670 /* If we're at the end of the line, the next character is a
|
|
|
2671 '\0'; don't skip it, because it's the thing that tells us
|
|
|
2672 to read the next line. */
|
|
|
2673 if (*lp == '\0')
|
|
|
2674 {
|
|
|
2675 quotednl = TRUE;
|
|
|
2676 continue;
|
|
|
2677 }
|
|
|
2678 lp++;
|
|
|
2679 c = ' ';
|
|
|
2680 }
|
|
|
2681 else if (incomm)
|
|
|
2682 {
|
|
|
2683 switch (c)
|
|
|
2684 {
|
|
|
2685 case '*':
|
|
|
2686 if (*lp == '/')
|
|
|
2687 {
|
|
|
2688 c = *lp++;
|
|
|
2689 incomm = FALSE;
|
|
|
2690 }
|
|
|
2691 break;
|
|
|
2692 case '\0':
|
|
|
2693 /* Newlines inside comments do not end macro definitions in
|
|
|
2694 traditional cpp. */
|
|
201
|
2695 CNL_SAVE_DEFINEDEF ();
|
|
0
|
2696 break;
|
|
|
2697 }
|
|
|
2698 continue;
|
|
|
2699 }
|
|
|
2700 else if (inquote)
|
|
|
2701 {
|
|
|
2702 switch (c)
|
|
|
2703 {
|
|
|
2704 case '"':
|
|
|
2705 inquote = FALSE;
|
|
|
2706 break;
|
|
|
2707 case '\0':
|
|
|
2708 /* Newlines inside strings do not end macro definitions
|
|
|
2709 in traditional cpp, even though compilers don't
|
|
|
2710 usually accept them. */
|
|
201
|
2711 CNL_SAVE_DEFINEDEF ();
|
|
0
|
2712 break;
|
|
|
2713 }
|
|
|
2714 continue;
|
|
|
2715 }
|
|
|
2716 else if (inchar)
|
|
|
2717 {
|
|
|
2718 switch (c)
|
|
|
2719 {
|
|
|
2720 case '\0':
|
|
|
2721 /* Hmmm, something went wrong. */
|
|
201
|
2722 CNL ();
|
|
0
|
2723 /* FALLTHRU */
|
|
|
2724 case '\'':
|
|
|
2725 inchar = FALSE;
|
|
|
2726 break;
|
|
|
2727 }
|
|
|
2728 continue;
|
|
|
2729 }
|
|
|
2730 else
|
|
|
2731 switch (c)
|
|
|
2732 {
|
|
|
2733 case '"':
|
|
|
2734 inquote = TRUE;
|
|
155
|
2735 if (fvdef != finlist && fvdef != fignore && fvdef !=vignore)
|
|
|
2736 fvdef = fvnone;
|
|
0
|
2737 continue;
|
|
|
2738 case '\'':
|
|
|
2739 inchar = TRUE;
|
|
155
|
2740 if (fvdef != finlist && fvdef != fignore && fvdef !=vignore)
|
|
|
2741 fvdef = fvnone;
|
|
0
|
2742 continue;
|
|
|
2743 case '/':
|
|
|
2744 if (*lp == '*')
|
|
|
2745 {
|
|
|
2746 lp++;
|
|
|
2747 incomm = TRUE;
|
|
|
2748 continue;
|
|
|
2749 }
|
|
4
|
2750 else if (/* cplpl && */ *lp == '/')
|
|
0
|
2751 {
|
|
4
|
2752 c = '\0';
|
|
0
|
2753 break;
|
|
|
2754 }
|
|
|
2755 else
|
|
|
2756 break;
|
|
|
2757 case '%':
|
|
|
2758 if ((c_ext & YACC) && *lp == '%')
|
|
|
2759 {
|
|
|
2760 /* entering or exiting rules section in yacc file */
|
|
|
2761 lp++;
|
|
155
|
2762 definedef = dnone; fvdef = fvnone;
|
|
0
|
2763 typdef = tnone; structdef = snone;
|
|
|
2764 next_token_is_func = FALSE;
|
|
|
2765 midtoken = inquote = inchar = incomm = quotednl = FALSE;
|
|
|
2766 cblev = 0;
|
|
|
2767 yacc_rules = !yacc_rules;
|
|
|
2768 continue;
|
|
|
2769 }
|
|
|
2770 else
|
|
|
2771 break;
|
|
|
2772 case '#':
|
|
|
2773 if (definedef == dnone)
|
|
|
2774 {
|
|
|
2775 char *cp;
|
|
155
|
2776 bool cpptoken = TRUE;
|
|
0
|
2777
|
|
|
2778 /* Look back on this line. If all blanks, or nonblanks
|
|
|
2779 followed by an end of comment, this is a preprocessor
|
|
|
2780 token. */
|
|
|
2781 for (cp = newlb.buffer; cp < lp-1; cp++)
|
|
|
2782 if (!iswhite (*cp))
|
|
|
2783 {
|
|
|
2784 if (*cp == '*' && *(cp+1) == '/')
|
|
|
2785 {
|
|
|
2786 cp++;
|
|
|
2787 cpptoken = TRUE;
|
|
|
2788 }
|
|
|
2789 else
|
|
|
2790 cpptoken = FALSE;
|
|
|
2791 }
|
|
|
2792 if (cpptoken)
|
|
|
2793 definedef = dsharpseen;
|
|
|
2794 } /* if (definedef == dnone) */
|
|
|
2795
|
|
|
2796 continue;
|
|
|
2797 } /* switch (c) */
|
|
|
2798
|
|
|
2799
|
|
|
2800 /* Consider token only if some complicated conditions are satisfied. */
|
|
|
2801 if ((definedef != dnone
|
|
|
2802 || (cblev == 0 && structdef != scolonseen)
|
|
4
|
2803 || (cblev == 1 && cplpl && structdef == sinbody)
|
|
|
2804 || (structdef == sinbody && structtype == st_C_enum))
|
|
0
|
2805 && typdef != tignore
|
|
|
2806 && definedef != dignorerest
|
|
155
|
2807 && fvdef != finlist)
|
|
0
|
2808 {
|
|
|
2809 if (midtoken)
|
|
|
2810 {
|
|
|
2811 if (endtoken (c))
|
|
|
2812 {
|
|
4
|
2813 if (c == ':' && cplpl && *lp == ':' && begtoken(*(lp + 1)))
|
|
0
|
2814 {
|
|
|
2815 /*
|
|
|
2816 * This handles :: in the middle, but not at the
|
|
|
2817 * beginning of an identifier.
|
|
|
2818 */
|
|
|
2819 lp += 2;
|
|
|
2820 toklen += 3;
|
|
276
|
2821 #ifdef OO_BROWSER
|
|
|
2822 set_construct(C_METHOD);
|
|
|
2823 #endif
|
|
0
|
2824 }
|
|
|
2825 else
|
|
|
2826 {
|
|
155
|
2827 bool funorvar = FALSE;
|
|
0
|
2828
|
|
|
2829 if (yacc_rules
|
|
4
|
2830 || consider_token (newlb.buffer + tokoff, toklen, c,
|
|
153
|
2831 c_ext, cblev, parlev, &funorvar))
|
|
0
|
2832 {
|
|
153
|
2833 tok.named = FALSE;
|
|
0
|
2834 if (structdef == sinbody
|
|
|
2835 && definedef == dnone
|
|
153
|
2836 && funorvar)
|
|
|
2837 /* function or var defined in C++ class body */
|
|
0
|
2838 {
|
|
153
|
2839 int len = strlen (structtag) + qlen + toklen;
|
|
|
2840 grow_linebuffer (&token_name, len + 1);
|
|
0
|
2841 strcpy (token_name.buffer, structtag);
|
|
153
|
2842 strcat (token_name.buffer, qualifier);
|
|
0
|
2843 strncat (token_name.buffer,
|
|
153
|
2844 newlb.buffer + tokoff, toklen);
|
|
|
2845 token_name.len = len;
|
|
0
|
2846 tok.named = TRUE;
|
|
276
|
2847 #ifdef OO_BROWSER
|
|
|
2848 oo_browser_construct = C_METHOD;
|
|
|
2849 #endif
|
|
0
|
2850 }
|
|
4
|
2851 else if (objdef == ocatseen)
|
|
|
2852 /* Objective C category */
|
|
|
2853 {
|
|
153
|
2854 int len = strlen (objtag) + 2 + toklen;
|
|
|
2855 grow_linebuffer (&token_name, len + 1);
|
|
4
|
2856 strcpy (token_name.buffer, objtag);
|
|
|
2857 strcat (token_name.buffer, "(");
|
|
|
2858 strncat (token_name.buffer,
|
|
153
|
2859 newlb.buffer + tokoff, toklen);
|
|
4
|
2860 strcat (token_name.buffer, ")");
|
|
153
|
2861 token_name.len = len;
|
|
4
|
2862 tok.named = TRUE;
|
|
276
|
2863 #ifdef OO_BROWSER
|
|
|
2864 oo_browser_construct = C_OBJC;
|
|
|
2865 #endif
|
|
4
|
2866 }
|
|
|
2867 else if (objdef == omethodtag
|
|
|
2868 || objdef == omethodparm)
|
|
|
2869 /* Objective C method */
|
|
|
2870 {
|
|
|
2871 tok.named = TRUE;
|
|
276
|
2872 #ifdef OO_BROWSER
|
|
|
2873 oo_browser_construct = C_OBJC;
|
|
|
2874 #endif
|
|
4
|
2875 }
|
|
0
|
2876 else
|
|
|
2877 {
|
|
153
|
2878 grow_linebuffer (&token_name, toklen + 1);
|
|
0
|
2879 strncpy (token_name.buffer,
|
|
153
|
2880 newlb.buffer + tokoff, toklen);
|
|
0
|
2881 token_name.buffer[toklen] = '\0';
|
|
153
|
2882 token_name.len = toklen;
|
|
|
2883 /* Name macros. */
|
|
276
|
2884 tok.named
|
|
|
2885 = (structdef == stagseen
|
|
|
2886 || typdef == tend
|
|
278
|
2887 #ifdef OO_BROWSER
|
|
|
2888 /* Also name #define constants,
|
|
|
2889 enumerations and enum_labels.
|
|
|
2890 Conditionalize `funorvar' reference
|
|
|
2891 here or #defines will appear without
|
|
|
2892 their #names.
|
|
|
2893 -- Bob Weiner, Altrasoft, 4/25/1998 */
|
|
|
2894 || ((oo_browser_format || funorvar)
|
|
|
2895 && definedef == dignorerest)
|
|
276
|
2896 || (oo_browser_format
|
|
|
2897 && (oo_browser_construct == C_ENUMERATION
|
|
278
|
2898 || oo_browser_construct == C_ENUM_LABEL))
|
|
276
|
2899 #else
|
|
278
|
2900 || (funorvar
|
|
|
2901 && definedef == dignorerest)
|
|
276
|
2902 #endif
|
|
278
|
2903 );
|
|
0
|
2904 }
|
|
|
2905 tok.lineno = lineno;
|
|
|
2906 tok.linelen = tokoff + toklen + 1;
|
|
|
2907 tok.buffer = newlb.buffer;
|
|
|
2908 tok.linepos = newlinepos;
|
|
|
2909 tok.valid = TRUE;
|
|
|
2910
|
|
|
2911 if (definedef == dnone
|
|
155
|
2912 && (fvdef == fvnameseen
|
|
0
|
2913 || structdef == stagseen
|
|
4
|
2914 || typdef == tend
|
|
|
2915 || objdef != onone))
|
|
0
|
2916 {
|
|
|
2917 if (current_lb_is_new)
|
|
|
2918 switch_line_buffers ();
|
|
|
2919 }
|
|
|
2920 else
|
|
155
|
2921 make_C_tag (funorvar);
|
|
0
|
2922 }
|
|
|
2923 midtoken = FALSE;
|
|
|
2924 }
|
|
|
2925 } /* if (endtoken (c)) */
|
|
|
2926 else if (intoken (c))
|
|
|
2927 {
|
|
|
2928 toklen++;
|
|
|
2929 continue;
|
|
|
2930 }
|
|
|
2931 } /* if (midtoken) */
|
|
|
2932 else if (begtoken (c))
|
|
|
2933 {
|
|
|
2934 switch (definedef)
|
|
|
2935 {
|
|
|
2936 case dnone:
|
|
155
|
2937 switch (fvdef)
|
|
0
|
2938 {
|
|
|
2939 case fstartlist:
|
|
155
|
2940 fvdef = finlist;
|
|
0
|
2941 continue;
|
|
|
2942 case flistseen:
|
|
276
|
2943 #ifdef OO_BROWSER
|
|
|
2944 set_construct(C_MACRO);
|
|
|
2945 #endif
|
|
155
|
2946 make_C_tag (TRUE); /* a function */
|
|
|
2947 fvdef = fignore;
|
|
0
|
2948 break;
|
|
153
|
2949 case fvnameseen:
|
|
155
|
2950 fvdef = fvnone;
|
|
0
|
2951 break;
|
|
|
2952 }
|
|
149
|
2953 if (structdef == stagseen && !cjava)
|
|
0
|
2954 structdef = snone;
|
|
|
2955 break;
|
|
|
2956 case dsharpseen:
|
|
|
2957 savetok = tok;
|
|
|
2958 }
|
|
|
2959 if (!yacc_rules || lp == newlb.buffer + 1)
|
|
|
2960 {
|
|
|
2961 tokoff = lp - 1 - newlb.buffer;
|
|
|
2962 toklen = 1;
|
|
|
2963 midtoken = TRUE;
|
|
|
2964 }
|
|
|
2965 continue;
|
|
|
2966 } /* if (begtoken) */
|
|
|
2967 } /* if must look at token */
|
|
|
2968
|
|
|
2969
|
|
|
2970 /* Detect end of line, colon, comma, semicolon and various braces
|
|
|
2971 after having handled a token.*/
|
|
|
2972 switch (c)
|
|
|
2973 {
|
|
|
2974 case ':':
|
|
|
2975 if (definedef != dnone)
|
|
|
2976 break;
|
|
4
|
2977 switch (objdef)
|
|
|
2978 {
|
|
|
2979 case otagseen:
|
|
|
2980 objdef = oignore;
|
|
155
|
2981 make_C_tag (TRUE); /* an Objective C class */
|
|
4
|
2982 break;
|
|
|
2983 case omethodtag:
|
|
|
2984 case omethodparm:
|
|
|
2985 objdef = omethodcolon;
|
|
|
2986 methodlen += 1;
|
|
153
|
2987 grow_linebuffer (&token_name, methodlen + 1);
|
|
4
|
2988 strcat (token_name.buffer, ":");
|
|
153
|
2989 token_name.len = methodlen;
|
|
4
|
2990 break;
|
|
|
2991 }
|
|
0
|
2992 if (structdef == stagseen)
|
|
|
2993 structdef = scolonseen;
|
|
|
2994 else
|
|
155
|
2995 switch (fvdef)
|
|
0
|
2996 {
|
|
153
|
2997 case fvnameseen:
|
|
0
|
2998 if (yacc_rules)
|
|
|
2999 {
|
|
155
|
3000 make_C_tag (FALSE); /* a yacc function */
|
|
|
3001 fvdef = fignore;
|
|
0
|
3002 }
|
|
|
3003 break;
|
|
|
3004 case fstartlist:
|
|
155
|
3005 fvdef = fvnone;
|
|
0
|
3006 break;
|
|
|
3007 }
|
|
|
3008 break;
|
|
|
3009 case ';':
|
|
|
3010 if (definedef != dnone)
|
|
|
3011 break;
|
|
|
3012 if (cblev == 0)
|
|
|
3013 switch (typdef)
|
|
|
3014 {
|
|
|
3015 case tend:
|
|
276
|
3016 #ifdef OO_BROWSER
|
|
|
3017 set_construct(C_TYPE);
|
|
|
3018 #endif
|
|
155
|
3019 make_C_tag (FALSE); /* a typedef */
|
|
0
|
3020 /* FALLTHRU */
|
|
|
3021 default:
|
|
|
3022 typdef = tnone;
|
|
|
3023 }
|
|
155
|
3024 switch (fvdef)
|
|
0
|
3025 {
|
|
153
|
3026 case fignore:
|
|
|
3027 break;
|
|
|
3028 case fvnameseen:
|
|
276
|
3029 #ifndef OO_BROWSER
|
|
155
|
3030 if ((globals && cblev == 0) || (members && cblev == 1))
|
|
|
3031 make_C_tag (FALSE); /* a variable */
|
|
276
|
3032 #else
|
|
|
3033 if (constantypedefs && structdef == snone)
|
|
|
3034 {
|
|
|
3035 tok.named = TRUE;
|
|
|
3036 switch (structtype)
|
|
|
3037 {
|
|
|
3038 case st_C_enum:
|
|
|
3039 set_construct(C_ENUMERATION);
|
|
|
3040 break;
|
|
|
3041 case st_C_class:
|
|
|
3042 set_construct(C_CLASS);
|
|
|
3043 break;
|
|
|
3044 default:
|
|
|
3045 set_construct(C_VARIABLE);
|
|
|
3046 break;
|
|
|
3047 }
|
|
|
3048 make_C_tag (FALSE);
|
|
|
3049 /* Force reset of st_C_enum structtype value. */
|
|
|
3050 structtype = st_none;
|
|
|
3051 }
|
|
|
3052 #endif
|
|
153
|
3053 /* FALLTHRU */
|
|
|
3054 default:
|
|
155
|
3055 fvdef = fvnone;
|
|
0
|
3056 /* The following instruction invalidates the token.
|
|
|
3057 Probably the token should be invalidated in all
|
|
|
3058 other cases where some state machine is reset. */
|
|
|
3059 tok.valid = FALSE;
|
|
|
3060 }
|
|
|
3061 if (structdef == stagseen)
|
|
|
3062 structdef = snone;
|
|
|
3063 break;
|
|
|
3064 case ',':
|
|
|
3065 if (definedef != dnone)
|
|
|
3066 break;
|
|
4
|
3067 switch (objdef)
|
|
|
3068 {
|
|
|
3069 case omethodtag:
|
|
|
3070 case omethodparm:
|
|
155
|
3071 make_C_tag (TRUE); /* an Objective C method */
|
|
4
|
3072 objdef = oinbody;
|
|
|
3073 break;
|
|
|
3074 }
|
|
155
|
3075 switch (fvdef)
|
|
153
|
3076 {
|
|
|
3077 case finlist:
|
|
|
3078 case fignore:
|
|
|
3079 case vignore:
|
|
|
3080 break;
|
|
|
3081 case fvnameseen:
|
|
155
|
3082 if ((globals && cblev == 0) || (members && cblev == 1))
|
|
|
3083 make_C_tag (FALSE); /* a variable */
|
|
153
|
3084 break;
|
|
|
3085 default:
|
|
155
|
3086 fvdef = fvnone;
|
|
153
|
3087 }
|
|
0
|
3088 if (structdef == stagseen)
|
|
|
3089 structdef = snone;
|
|
|
3090 break;
|
|
|
3091 case '[':
|
|
|
3092 if (definedef != dnone)
|
|
|
3093 break;
|
|
|
3094 if (cblev == 0 && typdef == tend)
|
|
|
3095 {
|
|
276
|
3096 #ifdef OO_BROWSER
|
|
|
3097 set_construct(C_TYPE);
|
|
|
3098 #endif
|
|
0
|
3099 typdef = tignore;
|
|
155
|
3100 make_C_tag (FALSE); /* a typedef */
|
|
0
|
3101 break;
|
|
|
3102 }
|
|
155
|
3103 switch (fvdef)
|
|
153
|
3104 {
|
|
|
3105 case finlist:
|
|
|
3106 case fignore:
|
|
|
3107 case vignore:
|
|
|
3108 break;
|
|
|
3109 case fvnameseen:
|
|
276
|
3110 #ifndef OO_BROWSER
|
|
155
|
3111 if ((globals && cblev == 0) || (members && cblev == 1))
|
|
|
3112 make_C_tag (FALSE); /* a variable */
|
|
276
|
3113 #else
|
|
|
3114 if (constantypedefs && structdef == snone)
|
|
|
3115 {
|
|
|
3116 tok.named = TRUE;
|
|
|
3117 switch (structtype)
|
|
|
3118 {
|
|
|
3119 case st_C_enum:
|
|
|
3120 set_construct(C_ENUMERATION);
|
|
|
3121 break;
|
|
|
3122 case st_C_class:
|
|
|
3123 set_construct(C_CLASS);
|
|
|
3124 break;
|
|
|
3125 default:
|
|
|
3126 set_construct(C_VARIABLE);
|
|
|
3127 break;
|
|
|
3128 }
|
|
|
3129 make_C_tag (FALSE);
|
|
|
3130 /* Force reset of st_C_enum structtype value. */
|
|
|
3131 structtype = st_none;
|
|
|
3132 }
|
|
|
3133 #endif
|
|
153
|
3134 /* FALLTHRU */
|
|
|
3135 default:
|
|
155
|
3136 fvdef = fvnone;
|
|
153
|
3137 }
|
|
0
|
3138 if (structdef == stagseen)
|
|
|
3139 structdef = snone;
|
|
|
3140 break;
|
|
|
3141 case '(':
|
|
|
3142 if (definedef != dnone)
|
|
|
3143 break;
|
|
4
|
3144 if (objdef == otagseen && parlev == 0)
|
|
|
3145 objdef = oparenseen;
|
|
155
|
3146 switch (fvdef)
|
|
0
|
3147 {
|
|
153
|
3148 case fvnone:
|
|
0
|
3149 switch (typdef)
|
|
|
3150 {
|
|
|
3151 case ttypedseen:
|
|
|
3152 case tend:
|
|
134
|
3153 if (tok.valid && *lp != '*')
|
|
0
|
3154 {
|
|
153
|
3155 /* This handles constructs like:
|
|
|
3156 typedef void OperatorFun (int fun); */
|
|
276
|
3157 #ifdef OO_BROWSER
|
|
|
3158 set_construct(C_TYPE);
|
|
|
3159 #endif
|
|
155
|
3160 make_C_tag (FALSE);
|
|
0
|
3161 typdef = tignore;
|
|
|
3162 }
|
|
|
3163 break;
|
|
|
3164 } /* switch (typdef) */
|
|
|
3165 break;
|
|
153
|
3166 case fvnameseen:
|
|
155
|
3167 fvdef = fstartlist;
|
|
0
|
3168 break;
|
|
|
3169 case flistseen:
|
|
155
|
3170 fvdef = finlist;
|
|
0
|
3171 break;
|
|
|
3172 }
|
|
|
3173 parlev++;
|
|
|
3174 break;
|
|
|
3175 case ')':
|
|
|
3176 if (definedef != dnone)
|
|
|
3177 break;
|
|
4
|
3178 if (objdef == ocatseen && parlev == 1)
|
|
|
3179 {
|
|
155
|
3180 make_C_tag (TRUE); /* an Objective C category */
|
|
4
|
3181 objdef = oignore;
|
|
|
3182 }
|
|
0
|
3183 if (--parlev == 0)
|
|
|
3184 {
|
|
155
|
3185 switch (fvdef)
|
|
0
|
3186 {
|
|
|
3187 case fstartlist:
|
|
|
3188 case finlist:
|
|
155
|
3189 fvdef = flistseen;
|
|
0
|
3190 break;
|
|
|
3191 }
|
|
|
3192 if (cblev == 0 && typdef == tend)
|
|
|
3193 {
|
|
276
|
3194 #ifdef OO_BROWSER
|
|
|
3195 set_construct(C_TYPE);
|
|
|
3196 #endif
|
|
0
|
3197 typdef = tignore;
|
|
155
|
3198 make_C_tag (FALSE); /* a typedef */
|
|
0
|
3199 }
|
|
|
3200 }
|
|
|
3201 else if (parlev < 0) /* can happen due to ill-conceived #if's. */
|
|
|
3202 parlev = 0;
|
|
|
3203 break;
|
|
|
3204 case '{':
|
|
|
3205 if (definedef != dnone)
|
|
|
3206 break;
|
|
|
3207 if (typdef == ttypedseen)
|
|
|
3208 typdef = tinbody;
|
|
|
3209 switch (structdef)
|
|
|
3210 {
|
|
|
3211 case skeyseen: /* unnamed struct */
|
|
4
|
3212 structdef = sinbody;
|
|
0
|
3213 structtag = "_anonymous_";
|
|
|
3214 break;
|
|
|
3215 case stagseen:
|
|
|
3216 case scolonseen: /* named struct */
|
|
|
3217 structdef = sinbody;
|
|
155
|
3218 make_C_tag (FALSE); /* a struct */
|
|
0
|
3219 break;
|
|
|
3220 }
|
|
155
|
3221 switch (fvdef)
|
|
0
|
3222 {
|
|
|
3223 case flistseen:
|
|
276
|
3224 #ifdef OO_BROWSER
|
|
|
3225 set_construct(C_FUNCTION);
|
|
|
3226 /* Ensure function name is recorded.
|
|
|
3227 -- Bob Weiner, Altrasoft */
|
|
|
3228 tok.named = TRUE;
|
|
|
3229 #endif
|
|
155
|
3230 make_C_tag (TRUE); /* a function */
|
|
0
|
3231 /* FALLTHRU */
|
|
|
3232 case fignore:
|
|
155
|
3233 fvdef = fvnone;
|
|
0
|
3234 break;
|
|
153
|
3235 case fvnone:
|
|
4
|
3236 switch (objdef)
|
|
|
3237 {
|
|
|
3238 case otagseen:
|
|
155
|
3239 make_C_tag (TRUE); /* an Objective C class */
|
|
4
|
3240 objdef = oignore;
|
|
|
3241 break;
|
|
|
3242 case omethodtag:
|
|
|
3243 case omethodparm:
|
|
155
|
3244 make_C_tag (TRUE); /* an Objective C method */
|
|
4
|
3245 objdef = oinbody;
|
|
|
3246 break;
|
|
|
3247 default:
|
|
|
3248 /* Neutralize `extern "C" {' grot. */
|
|
|
3249 if (cblev == 0 && structdef == snone && typdef == tnone)
|
|
|
3250 cblev = -1;
|
|
|
3251 }
|
|
0
|
3252 }
|
|
|
3253 cblev++;
|
|
|
3254 break;
|
|
|
3255 case '*':
|
|
|
3256 if (definedef != dnone)
|
|
|
3257 break;
|
|
155
|
3258 if (fvdef == fstartlist)
|
|
|
3259 fvdef = fvnone; /* avoid tagging `foo' in `foo (*bar()) ()' */
|
|
0
|
3260 break;
|
|
|
3261 case '}':
|
|
|
3262 if (definedef != dnone)
|
|
|
3263 break;
|
|
|
3264 if (!noindentypedefs && lp == newlb.buffer + 1)
|
|
|
3265 {
|
|
|
3266 cblev = 0; /* reset curly brace level if first column */
|
|
|
3267 parlev = 0; /* also reset paren level, just in case... */
|
|
|
3268 }
|
|
|
3269 else if (cblev > 0)
|
|
|
3270 cblev--;
|
|
|
3271 if (cblev == 0)
|
|
|
3272 {
|
|
|
3273 if (typdef == tinbody)
|
|
|
3274 typdef = tend;
|
|
|
3275 /* Memory leakage here: the string pointed by structtag is
|
|
|
3276 never released, because I fear to miss something and
|
|
|
3277 break things while freeing the area. The amount of
|
|
4
|
3278 memory leaked here is the sum of the lengths of the
|
|
0
|
3279 struct tags.
|
|
|
3280 if (structdef == sinbody)
|
|
|
3281 free (structtag); */
|
|
|
3282
|
|
|
3283 structdef = snone;
|
|
|
3284 structtag = "<error>";
|
|
276
|
3285 #ifdef OO_BROWSER
|
|
|
3286 /* Next line added to avoid any state carryover between
|
|
|
3287 functions. -- Bob Weiner, Altrasoft, 11/19/1997 */
|
|
|
3288 fvdef = fvnone; oo_browser_construct = C_NULL;
|
|
|
3289 #endif
|
|
0
|
3290 }
|
|
|
3291 break;
|
|
153
|
3292 case '=':
|
|
|
3293 if (definedef != dnone)
|
|
|
3294 break;
|
|
155
|
3295 switch (fvdef)
|
|
153
|
3296 {
|
|
|
3297 case finlist:
|
|
|
3298 case fignore:
|
|
|
3299 case vignore:
|
|
|
3300 break;
|
|
|
3301 case fvnameseen:
|
|
276
|
3302 #ifndef OO_BROWSER
|
|
155
|
3303 if ((globals && cblev == 0) || (members && cblev == 1))
|
|
|
3304 make_C_tag (FALSE); /* a variable */
|
|
276
|
3305 #else
|
|
|
3306 if (constantypedefs)
|
|
|
3307 {
|
|
|
3308 tok.named = TRUE;
|
|
|
3309 switch (structtype)
|
|
|
3310 {
|
|
|
3311 case st_C_enum:
|
|
|
3312 set_construct(C_ENUMERATION);
|
|
|
3313 break;
|
|
|
3314 case st_C_class:
|
|
|
3315 set_construct(C_CLASS);
|
|
|
3316 break;
|
|
|
3317 default:
|
|
|
3318 /* a global variable */
|
|
|
3319 set_construct(C_VARIABLE);
|
|
|
3320 break;
|
|
|
3321 }
|
|
|
3322 make_C_tag (FALSE);
|
|
|
3323 /* Force reset of st_C_enum structtype value. */
|
|
|
3324 structtype = st_none;
|
|
|
3325 }
|
|
|
3326 #endif
|
|
153
|
3327 /* FALLTHRU */
|
|
|
3328 default:
|
|
155
|
3329 fvdef = vignore;
|
|
153
|
3330 }
|
|
|
3331 break;
|
|
4
|
3332 case '+':
|
|
|
3333 case '-':
|
|
|
3334 if (objdef == oinbody && cblev == 0)
|
|
|
3335 {
|
|
|
3336 objdef = omethodsign;
|
|
|
3337 break;
|
|
|
3338 }
|
|
|
3339 /* FALLTHRU */
|
|
153
|
3340 case '#': case '~': case '&': case '%': case '/': case '|':
|
|
|
3341 case '^': case '!': case '<': case '>': case '.': case '?': case ']':
|
|
0
|
3342 if (definedef != dnone)
|
|
|
3343 break;
|
|
|
3344 /* These surely cannot follow a function tag. */
|
|
155
|
3345 if (fvdef != finlist && fvdef != fignore && fvdef != vignore)
|
|
|
3346 fvdef = fvnone;
|
|
0
|
3347 break;
|
|
|
3348 case '\0':
|
|
4
|
3349 if (objdef == otagseen)
|
|
|
3350 {
|
|
155
|
3351 make_C_tag (TRUE); /* an Objective C class */
|
|
4
|
3352 objdef = oignore;
|
|
|
3353 }
|
|
0
|
3354 /* If a macro spans multiple lines don't reset its state. */
|
|
|
3355 if (quotednl)
|
|
201
|
3356 CNL_SAVE_DEFINEDEF ();
|
|
0
|
3357 else
|
|
201
|
3358 CNL ();
|
|
0
|
3359 break;
|
|
|
3360 } /* switch (c) */
|
|
|
3361
|
|
|
3362 } /* while not eof */
|
|
|
3363 }
|
|
|
3364
|
|
|
3365 /*
|
|
|
3366 * Process either a C++ file or a C file depending on the setting
|
|
|
3367 * of a global flag.
|
|
|
3368 */
|
|
|
3369 void
|
|
4
|
3370 default_C_entries (inf)
|
|
|
3371 FILE *inf;
|
|
0
|
3372 {
|
|
|
3373 C_entries (cplusplus ? C_PLPL : 0, inf);
|
|
|
3374 }
|
|
|
3375
|
|
|
3376 /* Always do plain ANSI C. */
|
|
|
3377 void
|
|
|
3378 plain_C_entries (inf)
|
|
|
3379 FILE *inf;
|
|
|
3380 {
|
|
|
3381 C_entries (0, inf);
|
|
|
3382 }
|
|
|
3383
|
|
|
3384 /* Always do C++. */
|
|
|
3385 void
|
|
4
|
3386 Cplusplus_entries (inf)
|
|
|
3387 FILE *inf;
|
|
0
|
3388 {
|
|
|
3389 C_entries (C_PLPL, inf);
|
|
|
3390 }
|
|
|
3391
|
|
149
|
3392 /* Always do Java. */
|
|
|
3393 void
|
|
155
|
3394 Cjava_entries (inf)
|
|
|
3395 FILE *inf;
|
|
149
|
3396 {
|
|
|
3397 C_entries (C_JAVA, inf);
|
|
|
3398 }
|
|
|
3399
|
|
0
|
3400 /* Always do C*. */
|
|
|
3401 void
|
|
4
|
3402 Cstar_entries (inf)
|
|
|
3403 FILE *inf;
|
|
0
|
3404 {
|
|
|
3405 C_entries (C_STAR, inf);
|
|
|
3406 }
|
|
|
3407
|
|
|
3408 /* Always do Yacc. */
|
|
|
3409 void
|
|
4
|
3410 Yacc_entries (inf)
|
|
|
3411 FILE *inf;
|
|
0
|
3412 {
|
|
|
3413 C_entries (YACC, inf);
|
|
|
3414 }
|
|
|
3415
|
|
201
|
3416 /* A useful macro. */
|
|
|
3417 #define LOOP_ON_INPUT_LINES(file_pointer, line_buffer, char_pointer) \
|
|
|
3418 for (lineno = charno = 0; /* loop initialization */ \
|
|
|
3419 !feof (file_pointer) /* loop test */ \
|
|
|
3420 && (lineno++, /* instructions at start of loop */ \
|
|
|
3421 linecharno = charno, \
|
|
|
3422 charno += readline (&line_buffer, file_pointer), \
|
|
|
3423 char_pointer = lb.buffer, \
|
|
|
3424 TRUE); \
|
|
|
3425 )
|
|
|
3426
|
|
|
3427
|
|
|
3428 /*
|
|
|
3429 * Read a file, but do no processing. This is used to do regexp
|
|
|
3430 * matching on files that have no language defined.
|
|
|
3431 */
|
|
|
3432 void
|
|
|
3433 just_read_file (inf)
|
|
|
3434 FILE *inf;
|
|
|
3435 {
|
|
|
3436 register char *dummy;
|
|
|
3437
|
|
|
3438 LOOP_ON_INPUT_LINES (inf, lb, dummy)
|
|
|
3439 continue;
|
|
|
3440 }
|
|
|
3441
|
|
0
|
3442 /* Fortran parsing */
|
|
|
3443
|
|
201
|
3444 bool tail PP ((char *cp));
|
|
155
|
3445 bool
|
|
4
|
3446 tail (cp)
|
|
|
3447 char *cp;
|
|
0
|
3448 {
|
|
|
3449 register int len = 0;
|
|
|
3450
|
|
|
3451 while (*cp && lowcase(*cp) == lowcase(dbp[len]))
|
|
|
3452 cp++, len++;
|
|
|
3453 if (*cp == '\0' && !intoken(dbp[len]))
|
|
|
3454 {
|
|
|
3455 dbp += len;
|
|
|
3456 return TRUE;
|
|
|
3457 }
|
|
|
3458 return FALSE;
|
|
|
3459 }
|
|
|
3460
|
|
|
3461 void
|
|
4
|
3462 takeprec ()
|
|
0
|
3463 {
|
|
201
|
3464 dbp = skip_spaces (dbp);
|
|
0
|
3465 if (*dbp != '*')
|
|
|
3466 return;
|
|
|
3467 dbp++;
|
|
201
|
3468 dbp = skip_spaces (dbp);
|
|
0
|
3469 if (strneq (dbp, "(*)", 3))
|
|
|
3470 {
|
|
|
3471 dbp += 3;
|
|
|
3472 return;
|
|
|
3473 }
|
|
|
3474 if (!isdigit (*dbp))
|
|
|
3475 {
|
|
|
3476 --dbp; /* force failure */
|
|
|
3477 return;
|
|
|
3478 }
|
|
|
3479 do
|
|
|
3480 dbp++;
|
|
|
3481 while (isdigit (*dbp));
|
|
|
3482 }
|
|
|
3483
|
|
201
|
3484 void getit PP ((FILE *inf));
|
|
0
|
3485 void
|
|
4
|
3486 getit (inf)
|
|
|
3487 FILE *inf;
|
|
0
|
3488 {
|
|
|
3489 register char *cp;
|
|
|
3490
|
|
201
|
3491 dbp = skip_spaces (dbp);
|
|
0
|
3492 if (*dbp == '\0')
|
|
|
3493 {
|
|
|
3494 lineno++;
|
|
|
3495 linecharno = charno;
|
|
|
3496 charno += readline (&lb, inf);
|
|
|
3497 dbp = lb.buffer;
|
|
|
3498 if (dbp[5] != '&')
|
|
|
3499 return;
|
|
|
3500 dbp += 6;
|
|
201
|
3501 dbp = skip_spaces (dbp);
|
|
0
|
3502 }
|
|
|
3503 if (!isalpha (*dbp)
|
|
|
3504 && *dbp != '_'
|
|
|
3505 && *dbp != '$')
|
|
|
3506 return;
|
|
201
|
3507 for (cp = dbp + 1; *cp && intoken (*cp); cp++)
|
|
0
|
3508 continue;
|
|
4
|
3509 pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
|
|
|
3510 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
0
|
3511 }
|
|
|
3512
|
|
201
|
3513
|
|
0
|
3514 void
|
|
4
|
3515 Fortran_functions (inf)
|
|
|
3516 FILE *inf;
|
|
0
|
3517 {
|
|
201
|
3518 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
0
|
3519 {
|
|
|
3520 if (*dbp == '%')
|
|
|
3521 dbp++; /* Ratfor escape to fortran */
|
|
201
|
3522 dbp = skip_spaces (dbp);
|
|
0
|
3523 if (*dbp == '\0')
|
|
|
3524 continue;
|
|
|
3525 switch (lowcase (*dbp))
|
|
|
3526 {
|
|
|
3527 case 'i':
|
|
|
3528 if (tail ("integer"))
|
|
|
3529 takeprec ();
|
|
|
3530 break;
|
|
|
3531 case 'r':
|
|
|
3532 if (tail ("real"))
|
|
|
3533 takeprec ();
|
|
|
3534 break;
|
|
|
3535 case 'l':
|
|
|
3536 if (tail ("logical"))
|
|
|
3537 takeprec ();
|
|
|
3538 break;
|
|
|
3539 case 'c':
|
|
|
3540 if (tail ("complex") || tail ("character"))
|
|
|
3541 takeprec ();
|
|
|
3542 break;
|
|
|
3543 case 'd':
|
|
|
3544 if (tail ("double"))
|
|
|
3545 {
|
|
201
|
3546 dbp = skip_spaces (dbp);
|
|
0
|
3547 if (*dbp == '\0')
|
|
|
3548 continue;
|
|
|
3549 if (tail ("precision"))
|
|
|
3550 break;
|
|
|
3551 continue;
|
|
|
3552 }
|
|
|
3553 break;
|
|
|
3554 }
|
|
201
|
3555 dbp = skip_spaces (dbp);
|
|
0
|
3556 if (*dbp == '\0')
|
|
|
3557 continue;
|
|
|
3558 switch (lowcase (*dbp))
|
|
|
3559 {
|
|
|
3560 case 'f':
|
|
|
3561 if (tail ("function"))
|
|
|
3562 getit (inf);
|
|
|
3563 continue;
|
|
|
3564 case 's':
|
|
|
3565 if (tail ("subroutine"))
|
|
|
3566 getit (inf);
|
|
|
3567 continue;
|
|
|
3568 case 'e':
|
|
|
3569 if (tail ("entry"))
|
|
|
3570 getit (inf);
|
|
|
3571 continue;
|
|
|
3572 case 'p':
|
|
|
3573 if (tail ("program"))
|
|
|
3574 {
|
|
|
3575 getit (inf);
|
|
|
3576 continue;
|
|
|
3577 }
|
|
|
3578 if (tail ("procedure"))
|
|
|
3579 getit (inf);
|
|
|
3580 continue;
|
|
|
3581 }
|
|
|
3582 }
|
|
|
3583 }
|
|
|
3584
|
|
|
3585 /*
|
|
|
3586 * Bob Weiner, Motorola Inc., 4/3/94
|
|
|
3587 * Unix and microcontroller assembly tag handling
|
|
|
3588 * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
|
|
|
3589 */
|
|
|
3590 void
|
|
4
|
3591 Asm_labels (inf)
|
|
|
3592 FILE *inf;
|
|
0
|
3593 {
|
|
|
3594 register char *cp;
|
|
|
3595
|
|
201
|
3596 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
0
|
3597 {
|
|
|
3598 /* If first char is alphabetic or one of [_.$], test for colon
|
|
|
3599 following identifier. */
|
|
|
3600 if (isalpha (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
|
|
|
3601 {
|
|
|
3602 /* Read past label. */
|
|
|
3603 cp++;
|
|
|
3604 while (isalnum (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
|
|
|
3605 cp++;
|
|
|
3606 if (*cp == ':' || isspace (*cp))
|
|
|
3607 {
|
|
|
3608 /* Found end of label, so copy it and add it to the table. */
|
|
4
|
3609 pfnote ((CTAGS) ? savenstr(lb.buffer, cp-lb.buffer) : NULL, TRUE,
|
|
0
|
3610 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
3611 }
|
|
|
3612 }
|
|
|
3613 }
|
|
|
3614 }
|
|
|
3615
|
|
|
3616 /*
|
|
|
3617 * Perl support by Bart Robinson <lomew@cs.utah.edu>
|
|
201
|
3618 * enhanced by Michael Ernst <mernst@alum.mit.edu>
|
|
0
|
3619 * Perl sub names: look for /^sub[ \t\n]+[^ \t\n{]+/
|
|
201
|
3620 * Perl variable names: /^(my|local).../
|
|
0
|
3621 */
|
|
|
3622 void
|
|
|
3623 Perl_functions (inf)
|
|
|
3624 FILE *inf;
|
|
|
3625 {
|
|
|
3626 register char *cp;
|
|
|
3627
|
|
201
|
3628 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
0
|
3629 {
|
|
201
|
3630 if (*cp++ == 's'
|
|
|
3631 && *cp++ == 'u'
|
|
|
3632 && *cp++ == 'b' && isspace (*cp++))
|
|
|
3633 {
|
|
|
3634 cp = skip_spaces (cp);
|
|
|
3635 if (*cp != '\0')
|
|
|
3636 {
|
|
|
3637 while (*cp != '\0'
|
|
|
3638 && !isspace (*cp) && *cp != '{' && *cp != '(')
|
|
|
3639 cp++;
|
|
|
3640 pfnote ((CTAGS) ? savenstr(lb.buffer, cp-lb.buffer) : NULL, TRUE,
|
|
|
3641 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
3642 }
|
|
|
3643 }
|
|
|
3644 else if (globals /* only if tagging global vars is enabled */
|
|
|
3645 && ((cp = lb.buffer,
|
|
|
3646 *cp++ == 'm'
|
|
|
3647 && *cp++ == 'y')
|
|
|
3648 || (cp = lb.buffer,
|
|
|
3649 *cp++ == 'l'
|
|
|
3650 && *cp++ == 'o'
|
|
|
3651 && *cp++ == 'c'
|
|
|
3652 && *cp++ == 'a'
|
|
|
3653 && *cp++ == 'l'))
|
|
|
3654 && (*cp == '(' || isspace (*cp)))
|
|
|
3655 {
|
|
|
3656 /* After "my" or "local", but before any following paren or space. */
|
|
|
3657 char *varname = NULL;
|
|
|
3658
|
|
|
3659 cp = skip_spaces (cp);
|
|
|
3660 if (*cp == '$' || *cp == '@' || *cp == '%')
|
|
|
3661 {
|
|
|
3662 char* varstart = ++cp;
|
|
|
3663 while (isalnum (*cp) || *cp == '_')
|
|
|
3664 cp++;
|
|
|
3665 varname = savenstr (varstart, cp-varstart);
|
|
|
3666 }
|
|
|
3667 else
|
|
|
3668 {
|
|
|
3669 /* Should be examining a variable list at this point;
|
|
|
3670 could insist on seeing an open parenthesis. */
|
|
|
3671 while (*cp != '\0' && *cp != ';' && *cp != '=' && *cp != ')')
|
|
|
3672 cp++;
|
|
|
3673 }
|
|
|
3674
|
|
|
3675 /* Perhaps I should back cp up one character, so the TAGS table
|
|
|
3676 doesn't mention (and so depend upon) the following char. */
|
|
|
3677 pfnote ((CTAGS) ? savenstr (lb.buffer, cp-lb.buffer) : varname,
|
|
|
3678 FALSE, lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
3679 }
|
|
|
3680 }
|
|
|
3681 }
|
|
|
3682
|
|
|
3683 /*
|
|
|
3684 * Python support by Eric S. Raymond <esr@thyrsus.com>
|
|
|
3685 * Look for /^def[ \t\n]+[^ \t\n(:]+/ or /^class[ \t\n]+[^ \t\n(:]+/
|
|
|
3686 */
|
|
|
3687 void
|
|
|
3688 Python_functions (inf)
|
|
|
3689 FILE *inf;
|
|
|
3690 {
|
|
|
3691 register char *cp;
|
|
|
3692
|
|
|
3693 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
3694 {
|
|
|
3695 if (*cp++ == 'd'
|
|
|
3696 && *cp++ == 'e'
|
|
|
3697 && *cp++ == 'f' && isspace (*cp++))
|
|
|
3698 {
|
|
|
3699 cp = skip_spaces (cp);
|
|
|
3700 while (*cp != '\0' && !isspace (*cp) && *cp != '(' && *cp != ':')
|
|
|
3701 cp++;
|
|
|
3702 pfnote ((char *) NULL, TRUE,
|
|
|
3703 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
3704 }
|
|
|
3705
|
|
0
|
3706 cp = lb.buffer;
|
|
201
|
3707 if (*cp++ == 'c'
|
|
|
3708 && *cp++ == 'l'
|
|
|
3709 && *cp++ == 'a'
|
|
|
3710 && *cp++ == 's'
|
|
|
3711 && *cp++ == 's' && isspace (*cp++))
|
|
0
|
3712 {
|
|
201
|
3713 cp = skip_spaces (cp);
|
|
|
3714 while (*cp != '\0' && !isspace (*cp) && *cp != '(' && *cp != ':')
|
|
0
|
3715 cp++;
|
|
201
|
3716 pfnote ((char *) NULL, TRUE,
|
|
0
|
3717 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
|
3718 }
|
|
|
3719 }
|
|
|
3720 }
|
|
|
3721
|
|
153
|
3722 /* Idea by Corny de Souza
|
|
|
3723 * Cobol tag functions
|
|
|
3724 * We could look for anything that could be a paragraph name.
|
|
|
3725 * i.e. anything that starts in column 8 is one word and ends in a full stop.
|
|
|
3726 */
|
|
|
3727 void
|
|
|
3728 Cobol_paragraphs (inf)
|
|
|
3729 FILE *inf;
|
|
|
3730 {
|
|
201
|
3731 register char *bp, *ep;
|
|
|
3732
|
|
|
3733 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
153
|
3734 {
|
|
|
3735 if (lb.len < 9)
|
|
|
3736 continue;
|
|
201
|
3737 bp += 8;
|
|
153
|
3738
|
|
|
3739 /* If eoln, compiler option or comment ignore whole line. */
|
|
201
|
3740 if (bp[-1] != ' ' || !isalnum (bp[0]))
|
|
153
|
3741 continue;
|
|
|
3742
|
|
201
|
3743 for (ep = bp; isalnum (*ep) || *ep == '-'; ep++)
|
|
153
|
3744 continue;
|
|
201
|
3745 if (*ep++ == '.')
|
|
|
3746 pfnote ((CTAGS) ? savenstr (bp, ep-bp) : NULL, TRUE,
|
|
|
3747 lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
|
|
153
|
3748 }
|
|
|
3749 }
|
|
|
3750
|
|
0
|
3751 /* Added by Mosur Mohan, 4/22/88 */
|
|
|
3752 /* Pascal parsing */
|
|
|
3753
|
|
|
3754 /*
|
|
|
3755 * Locates tags for procedures & functions. Doesn't do any type- or
|
|
|
3756 * var-definitions. It does look for the keyword "extern" or
|
|
|
3757 * "forward" immediately following the procedure statement; if found,
|
|
|
3758 * the tag is skipped.
|
|
|
3759 */
|
|
|
3760 void
|
|
4
|
3761 Pascal_functions (inf)
|
|
|
3762 FILE *inf;
|
|
0
|
3763 {
|
|
201
|
3764 linebuffer tline; /* mostly copied from C_entries */
|
|
4
|
3765 long save_lcno;
|
|
|
3766 int save_lineno, save_len;
|
|
|
3767 char c, *cp, *namebuf;
|
|
0
|
3768
|
|
155
|
3769 bool /* each of these flags is TRUE iff: */
|
|
0
|
3770 incomment, /* point is inside a comment */
|
|
|
3771 inquote, /* point is inside '..' string */
|
|
|
3772 get_tagname, /* point is after PROCEDURE/FUNCTION
|
|
|
3773 keyword, so next item = potential tag */
|
|
|
3774 found_tag, /* point is after a potential tag */
|
|
|
3775 inparms, /* point is within parameter-list */
|
|
|
3776 verify_tag; /* point has passed the parm-list, so the
|
|
|
3777 next token will determine whether this
|
|
|
3778 is a FORWARD/EXTERN to be ignored, or
|
|
|
3779 whether it is a real tag */
|
|
|
3780
|
|
201
|
3781 save_lcno = save_lineno = save_len = 0; /* keep compiler quiet */
|
|
|
3782 namebuf = NULL; /* keep compiler quiet */
|
|
0
|
3783 lineno = 0;
|
|
|
3784 charno = 0;
|
|
|
3785 dbp = lb.buffer;
|
|
|
3786 *dbp = '\0';
|
|
|
3787 initbuffer (&tline);
|
|
|
3788
|
|
|
3789 incomment = inquote = FALSE;
|
|
|
3790 found_tag = FALSE; /* have a proc name; check if extern */
|
|
|
3791 get_tagname = FALSE; /* have found "procedure" keyword */
|
|
|
3792 inparms = FALSE; /* found '(' after "proc" */
|
|
|
3793 verify_tag = FALSE; /* check if "extern" is ahead */
|
|
|
3794
|
|
201
|
3795
|
|
|
3796 while (!feof (inf)) /* long main loop to get next char */
|
|
0
|
3797 {
|
|
|
3798 c = *dbp++;
|
|
|
3799 if (c == '\0') /* if end of line */
|
|
|
3800 {
|
|
4
|
3801 lineno++;
|
|
|
3802 linecharno = charno;
|
|
|
3803 charno += readline (&lb, inf);
|
|
|
3804 dbp = lb.buffer;
|
|
0
|
3805 if (*dbp == '\0')
|
|
|
3806 continue;
|
|
201
|
3807 if (!((found_tag && verify_tag)
|
|
|
3808 || get_tagname))
|
|
0
|
3809 c = *dbp++; /* only if don't need *dbp pointing
|
|
|
3810 to the beginning of the name of
|
|
|
3811 the procedure or function */
|
|
|
3812 }
|
|
|
3813 if (incomment)
|
|
|
3814 {
|
|
|
3815 if (c == '}') /* within { } comments */
|
|
|
3816 incomment = FALSE;
|
|
|
3817 else if (c == '*' && *dbp == ')') /* within (* *) comments */
|
|
|
3818 {
|
|
|
3819 dbp++;
|
|
|
3820 incomment = FALSE;
|
|
|
3821 }
|
|
|
3822 continue;
|
|
|
3823 }
|
|
|
3824 else if (inquote)
|
|
|
3825 {
|
|
|
3826 if (c == '\'')
|
|
|
3827 inquote = FALSE;
|
|
|
3828 continue;
|
|
|
3829 }
|
|
|
3830 else
|
|
|
3831 switch (c)
|
|
|
3832 {
|
|
|
3833 case '\'':
|
|
|
3834 inquote = TRUE; /* found first quote */
|
|
|
3835 continue;
|
|
|
3836 case '{': /* found open { comment */
|
|
|
3837 incomment = TRUE;
|
|
|
3838 continue;
|
|
|
3839 case '(':
|
|
|
3840 if (*dbp == '*') /* found open (* comment */
|
|
|
3841 {
|
|
|
3842 incomment = TRUE;
|
|
|
3843 dbp++;
|
|
|
3844 }
|
|
|
3845 else if (found_tag) /* found '(' after tag, i.e., parm-list */
|
|
|
3846 inparms = TRUE;
|
|
|
3847 continue;
|
|
|
3848 case ')': /* end of parms list */
|
|
|
3849 if (inparms)
|
|
|
3850 inparms = FALSE;
|
|
|
3851 continue;
|
|
|
3852 case ';':
|
|
|
3853 if (found_tag && !inparms) /* end of proc or fn stmt */
|
|
|
3854 {
|
|
|
3855 verify_tag = TRUE;
|
|
|
3856 break;
|
|
|
3857 }
|
|
|
3858 continue;
|
|
|
3859 }
|
|
|
3860 if (found_tag && verify_tag && (*dbp != ' '))
|
|
|
3861 {
|
|
|
3862 /* check if this is an "extern" declaration */
|
|
|
3863 if (*dbp == '\0')
|
|
|
3864 continue;
|
|
|
3865 if (lowcase (*dbp == 'e'))
|
|
|
3866 {
|
|
|
3867 if (tail ("extern")) /* superfluous, really! */
|
|
|
3868 {
|
|
|
3869 found_tag = FALSE;
|
|
|
3870 verify_tag = FALSE;
|
|
|
3871 }
|
|
|
3872 }
|
|
|
3873 else if (lowcase (*dbp) == 'f')
|
|
|
3874 {
|
|
|
3875 if (tail ("forward")) /* check for forward reference */
|
|
|
3876 {
|
|
|
3877 found_tag = FALSE;
|
|
|
3878 verify_tag = FALSE;
|
|
|
3879 }
|
|
|
3880 }
|
|
|
3881 if (found_tag && verify_tag) /* not external proc, so make tag */
|
|
|
3882 {
|
|
|
3883 found_tag = FALSE;
|
|
|
3884 verify_tag = FALSE;
|
|
4
|
3885 pfnote (namebuf, TRUE,
|
|
0
|
3886 tline.buffer, save_len, save_lineno, save_lcno);
|
|
|
3887 continue;
|
|
|
3888 }
|
|
|
3889 }
|
|
|
3890 if (get_tagname) /* grab name of proc or fn */
|
|
|
3891 {
|
|
|
3892 if (*dbp == '\0')
|
|
|
3893 continue;
|
|
|
3894
|
|
|
3895 /* save all values for later tagging */
|
|
142
|
3896 grow_linebuffer (&tline, lb.len + 1);
|
|
0
|
3897 strcpy (tline.buffer, lb.buffer);
|
|
|
3898 save_lineno = lineno;
|
|
|
3899 save_lcno = linecharno;
|
|
|
3900
|
|
|
3901 /* grab block name */
|
|
153
|
3902 for (cp = dbp + 1; *cp != '\0' && !endtoken (*cp); cp++)
|
|
0
|
3903 continue;
|
|
4
|
3904 namebuf = (CTAGS) ? savenstr (dbp, cp-dbp) : NULL;
|
|
|
3905 dbp = cp; /* set dbp to e-o-token */
|
|
0
|
3906 save_len = dbp - lb.buffer + 1;
|
|
|
3907 get_tagname = FALSE;
|
|
|
3908 found_tag = TRUE;
|
|
|
3909 continue;
|
|
|
3910
|
|
|
3911 /* and proceed to check for "extern" */
|
|
|
3912 }
|
|
|
3913 else if (!incomment && !inquote && !found_tag)
|
|
|
3914 {
|
|
|
3915 /* check for proc/fn keywords */
|
|
|
3916 switch (lowcase (c))
|
|
|
3917 {
|
|
|
3918 case 'p':
|
|
|
3919 if (tail ("rocedure")) /* c = 'p', dbp has advanced */
|
|
|
3920 get_tagname = TRUE;
|
|
|
3921 continue;
|
|
|
3922 case 'f':
|
|
|
3923 if (tail ("unction"))
|
|
|
3924 get_tagname = TRUE;
|
|
|
3925 continue;
|
|
|
3926 }
|
|
|
3927 }
|
|
|
3928 } /* while not eof */
|
|
|
3929
|
|
|
3930 free (tline.buffer);
|
|
|
3931 }
|
|
|
3932
|
|
|
3933 /*
|
|
|
3934 * lisp tag functions
|
|
|
3935 * look for (def or (DEF, quote or QUOTE
|
|
|
3936 */
|
|
201
|
3937 int L_isdef PP ((char *strp));
|
|
4
|
3938 int
|
|
|
3939 L_isdef (strp)
|
|
|
3940 register char *strp;
|
|
0
|
3941 {
|
|
|
3942 return ((strp[1] == 'd' || strp[1] == 'D')
|
|
|
3943 && (strp[2] == 'e' || strp[2] == 'E')
|
|
|
3944 && (strp[3] == 'f' || strp[3] == 'F'));
|
|
|
3945 }
|
|
201
|
3946 int L_isquote PP ((char *strp));
|
|
4
|
3947 int
|
|
|
3948 L_isquote (strp)
|
|
|
3949 register char *strp;
|
|
0
|
3950 {
|
|
201
|
3951 return ((*++strp == 'q' || *strp == 'Q')
|
|
|
3952 && (*++strp == 'u' || *strp == 'U')
|
|
|
3953 && (*++strp == 'o' || *strp == 'O')
|
|
|
3954 && (*++strp == 't' || *strp == 'T')
|
|
|
3955 && (*++strp == 'e' || *strp == 'E')
|
|
|
3956 && isspace (*++strp));
|
|
0
|
3957 }
|
|
|
3958
|
|
201
|
3959 void L_getit PP ((void));
|
|
4
|
3960 void
|
|
|
3961 L_getit ()
|
|
0
|
3962 {
|
|
|
3963 register char *cp;
|
|
|
3964
|
|
|
3965 if (*dbp == '\'') /* Skip prefix quote */
|
|
|
3966 dbp++;
|
|
201
|
3967 else if (*dbp == '(')
|
|
0
|
3968 {
|
|
201
|
3969 if (L_isquote (dbp))
|
|
|
3970 dbp += 7; /* Skip "(quote " */
|
|
|
3971 else
|
|
|
3972 dbp += 1; /* Skip "(" before name in (defstruct (foo)) */
|
|
|
3973 dbp = skip_spaces (dbp);
|
|
0
|
3974 }
|
|
201
|
3975
|
|
0
|
3976 for (cp = dbp /*+1*/;
|
|
153
|
3977 *cp != '\0' && *cp != '(' && *cp != ' ' && *cp != ')';
|
|
0
|
3978 cp++)
|
|
|
3979 continue;
|
|
|
3980 if (cp == dbp)
|
|
|
3981 return;
|
|
|
3982
|
|
4
|
3983 pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
|
|
|
3984 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
0
|
3985 }
|
|
|
3986
|
|
|
3987 void
|
|
4
|
3988 Lisp_functions (inf)
|
|
|
3989 FILE *inf;
|
|
0
|
3990 {
|
|
201
|
3991 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
0
|
3992 {
|
|
|
3993 if (dbp[0] == '(')
|
|
|
3994 {
|
|
|
3995 if (L_isdef (dbp))
|
|
|
3996 {
|
|
201
|
3997 dbp = skip_non_spaces (dbp);
|
|
|
3998 dbp = skip_spaces (dbp);
|
|
0
|
3999 L_getit ();
|
|
|
4000 }
|
|
|
4001 else
|
|
|
4002 {
|
|
|
4003 /* Check for (foo::defmumble name-defined ... */
|
|
|
4004 do
|
|
|
4005 dbp++;
|
|
201
|
4006 while (*dbp != '\0' && !isspace (*dbp)
|
|
0
|
4007 && *dbp != ':' && *dbp != '(' && *dbp != ')');
|
|
|
4008 if (*dbp == ':')
|
|
|
4009 {
|
|
|
4010 do
|
|
|
4011 dbp++;
|
|
|
4012 while (*dbp == ':');
|
|
|
4013
|
|
|
4014 if (L_isdef (dbp - 1))
|
|
|
4015 {
|
|
201
|
4016 dbp = skip_non_spaces (dbp);
|
|
|
4017 dbp = skip_spaces (dbp);
|
|
0
|
4018 L_getit ();
|
|
|
4019 }
|
|
|
4020 }
|
|
|
4021 }
|
|
|
4022 }
|
|
|
4023 }
|
|
|
4024 }
|
|
|
4025
|
|
|
4026 /*
|
|
149
|
4027 * Postscript tag functions
|
|
|
4028 * Just look for lines where the first character is '/'
|
|
153
|
4029 * Richard Mlynarik <mly@adoc.xerox.com>
|
|
149
|
4030 */
|
|
|
4031 void
|
|
|
4032 Postscript_functions (inf)
|
|
|
4033 FILE *inf;
|
|
|
4034 {
|
|
201
|
4035 register char *bp, *ep;
|
|
|
4036
|
|
|
4037 LOOP_ON_INPUT_LINES (inf, lb, bp)
|
|
149
|
4038 {
|
|
201
|
4039 if (bp[0] == '/')
|
|
149
|
4040 {
|
|
201
|
4041 for (ep = bp+1;
|
|
|
4042 *ep != '\0' && *ep != ' ' && *ep != '{';
|
|
|
4043 ep++)
|
|
149
|
4044 continue;
|
|
201
|
4045 pfnote ((CTAGS) ? savenstr (bp, ep-bp) : NULL, TRUE,
|
|
|
4046 lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
|
|
149
|
4047 }
|
|
|
4048 }
|
|
|
4049 }
|
|
|
4050
|
|
|
4051
|
|
|
4052 /*
|
|
0
|
4053 * Scheme tag functions
|
|
|
4054 * look for (def... xyzzy
|
|
|
4055 * look for (def... (xyzzy
|
|
|
4056 * look for (def ... ((...(xyzzy ....
|
|
|
4057 * look for (set! xyzzy
|
|
|
4058 */
|
|
|
4059
|
|
201
|
4060 void get_scheme PP ((void));
|
|
0
|
4061
|
|
|
4062 void
|
|
4
|
4063 Scheme_functions (inf)
|
|
|
4064 FILE *inf;
|
|
0
|
4065 {
|
|
201
|
4066 LOOP_ON_INPUT_LINES (inf, lb, dbp)
|
|
0
|
4067 {
|
|
201
|
4068 if (dbp[0] == '('
|
|
|
4069 && (dbp[1] == 'D' || dbp[1] == 'd')
|
|
|
4070 && (dbp[2] == 'E' || dbp[2] == 'e')
|
|
|
4071 && (dbp[3] == 'F' || dbp[3] == 'f'))
|
|
0
|
4072 {
|
|
201
|
4073 dbp = skip_non_spaces (dbp);
|
|
0
|
4074 /* Skip over open parens and white space */
|
|
201
|
4075 while (isspace (*dbp) || *dbp == '(')
|
|
0
|
4076 dbp++;
|
|
|
4077 get_scheme ();
|
|
|
4078 }
|
|
201
|
4079 if (dbp[0] == '('
|
|
|
4080 && (dbp[1] == 'S' || dbp[1] == 's')
|
|
|
4081 && (dbp[2] == 'E' || dbp[2] == 'e')
|
|
|
4082 && (dbp[3] == 'T' || dbp[3] == 't')
|
|
|
4083 && (dbp[4] == '!' || dbp[4] == '!')
|
|
|
4084 && (isspace (dbp[5])))
|
|
0
|
4085 {
|
|
201
|
4086 dbp = skip_non_spaces (dbp);
|
|
|
4087 dbp = skip_spaces (dbp);
|
|
0
|
4088 get_scheme ();
|
|
|
4089 }
|
|
|
4090 }
|
|
|
4091 }
|
|
|
4092
|
|
|
4093 void
|
|
4
|
4094 get_scheme ()
|
|
0
|
4095 {
|
|
|
4096 register char *cp;
|
|
|
4097
|
|
|
4098 if (*dbp == '\0')
|
|
|
4099 return;
|
|
|
4100 /* Go till you get to white space or a syntactic break */
|
|
|
4101 for (cp = dbp + 1;
|
|
201
|
4102 *cp != '\0' && *cp != '(' && *cp != ')' && !isspace (*cp);
|
|
0
|
4103 cp++)
|
|
|
4104 continue;
|
|
4
|
4105 pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
|
|
|
4106 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
|
|
0
|
4107 }
|
|
|
4108
|
|
|
4109 /* Find tags in TeX and LaTeX input files. */
|
|
|
4110
|
|
|
4111 /* TEX_toktab is a table of TeX control sequences that define tags.
|
|
|
4112 Each TEX_tabent records one such control sequence.
|
|
|
4113 CONVERT THIS TO USE THE Stab TYPE!! */
|
|
|
4114 struct TEX_tabent
|
|
|
4115 {
|
|
4
|
4116 char *name;
|
|
0
|
4117 int len;
|
|
|
4118 };
|
|
|
4119
|
|
|
4120 struct TEX_tabent *TEX_toktab = NULL; /* Table with tag tokens */
|
|
|
4121
|
|
|
4122 /* Default set of control sequences to put into TEX_toktab.
|
|
|
4123 The value of environment var TEXTAGS is prepended to this. */
|
|
|
4124
|
|
4
|
4125 char *TEX_defenv = "\
|
|
0
|
4126 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem\
|
|
|
4127 :part:appendix:entry:index";
|
|
|
4128
|
|
201
|
4129 void TEX_mode PP ((FILE *inf));
|
|
|
4130 struct TEX_tabent *TEX_decode_env PP ((char *evarname, char *defenv));
|
|
|
4131 int TEX_Token PP ((char *cp));
|
|
0
|
4132
|
|
|
4133 char TEX_esc = '\\';
|
|
|
4134 char TEX_opgrp = '{';
|
|
|
4135 char TEX_clgrp = '}';
|
|
|
4136
|
|
|
4137 /*
|
|
|
4138 * TeX/LaTeX scanning loop.
|
|
|
4139 */
|
|
|
4140 void
|
|
4
|
4141 TeX_functions (inf)
|
|
|
4142 FILE *inf;
|
|
0
|
4143 {
|
|
201
|
4144 char *cp, *lasthit;
|
|
153
|
4145 register int i;
|
|
0
|
4146
|
|
|
4147 /* Select either \ or ! as escape character. */
|
|
|
4148 TEX_mode (inf);
|
|
|
4149
|
|
|
4150 /* Initialize token table once from environment. */
|
|
|
4151 if (!TEX_toktab)
|
|
|
4152 TEX_toktab = TEX_decode_env ("TEXTAGS", TEX_defenv);
|
|
|
4153
|
|
201
|
4154 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
|
4155 {
|
|
|
4156 lasthit = cp;
|
|
|
4157 /* Look at each esc in line. */
|
|
|
4158 while ((cp = etags_strchr (cp, TEX_esc)) != NULL)
|
|
0
|
4159 {
|
|
201
|
4160 if (*++cp == '\0')
|
|
0
|
4161 break;
|
|
201
|
4162 linecharno += cp - lasthit;
|
|
|
4163 lasthit = cp;
|
|
0
|
4164 i = TEX_Token (lasthit);
|
|
153
|
4165 if (i >= 0)
|
|
0
|
4166 {
|
|
153
|
4167 /* We seem to include the TeX command in the tag name.
|
|
|
4168 register char *p;
|
|
|
4169 for (p = lasthit + TEX_toktab[i].len;
|
|
|
4170 *p != '\0' && *p != TEX_clgrp;
|
|
|
4171 p++)
|
|
|
4172 continue; */
|
|
|
4173 pfnote (/*savenstr (lasthit, p-lasthit)*/ (char *)NULL, TRUE,
|
|
142
|
4174 lb.buffer, lb.len, lineno, linecharno);
|
|
153
|
4175 break; /* We only tag a line once */
|
|
0
|
4176 }
|
|
|
4177 }
|
|
|
4178 }
|
|
|
4179 }
|
|
|
4180
|
|
|
4181 #define TEX_LESC '\\'
|
|
|
4182 #define TEX_SESC '!'
|
|
|
4183 #define TEX_cmt '%'
|
|
|
4184
|
|
|
4185 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
|
|
|
4186 chars accordingly. */
|
|
|
4187 void
|
|
4
|
4188 TEX_mode (inf)
|
|
|
4189 FILE *inf;
|
|
0
|
4190 {
|
|
|
4191 int c;
|
|
|
4192
|
|
|
4193 while ((c = getc (inf)) != EOF)
|
|
|
4194 {
|
|
|
4195 /* Skip to next line if we hit the TeX comment char. */
|
|
|
4196 if (c == TEX_cmt)
|
|
|
4197 while (c != '\n')
|
|
|
4198 c = getc (inf);
|
|
|
4199 else if (c == TEX_LESC || c == TEX_SESC )
|
|
|
4200 break;
|
|
|
4201 }
|
|
|
4202
|
|
|
4203 if (c == TEX_LESC)
|
|
|
4204 {
|
|
|
4205 TEX_esc = TEX_LESC;
|
|
|
4206 TEX_opgrp = '{';
|
|
|
4207 TEX_clgrp = '}';
|
|
|
4208 }
|
|
|
4209 else
|
|
|
4210 {
|
|
|
4211 TEX_esc = TEX_SESC;
|
|
|
4212 TEX_opgrp = '<';
|
|
|
4213 TEX_clgrp = '>';
|
|
|
4214 }
|
|
|
4215 rewind (inf);
|
|
|
4216 }
|
|
|
4217
|
|
|
4218 /* Read environment and prepend it to the default string.
|
|
|
4219 Build token table. */
|
|
|
4220 struct TEX_tabent *
|
|
4
|
4221 TEX_decode_env (evarname, defenv)
|
|
|
4222 char *evarname;
|
|
|
4223 char *defenv;
|
|
0
|
4224 {
|
|
4
|
4225 register char *env, *p;
|
|
0
|
4226
|
|
|
4227 struct TEX_tabent *tab;
|
|
|
4228 int size, i;
|
|
|
4229
|
|
|
4230 /* Append default string to environment. */
|
|
|
4231 env = getenv (evarname);
|
|
|
4232 if (!env)
|
|
|
4233 env = defenv;
|
|
|
4234 else
|
|
149
|
4235 {
|
|
|
4236 char *oldenv = env;
|
|
|
4237 env = concat (oldenv, defenv, "");
|
|
|
4238 free (oldenv);
|
|
|
4239 }
|
|
0
|
4240
|
|
|
4241 /* Allocate a token table */
|
|
|
4242 for (size = 1, p = env; p;)
|
|
201
|
4243 if ((p = etags_strchr (p, ':')) && *++p != '\0')
|
|
0
|
4244 size++;
|
|
|
4245 /* Add 1 to leave room for null terminator. */
|
|
|
4246 tab = xnew (size + 1, struct TEX_tabent);
|
|
|
4247
|
|
|
4248 /* Unpack environment string into token table. Be careful about */
|
|
|
4249 /* zero-length strings (leading ':', "::" and trailing ':') */
|
|
|
4250 for (i = 0; *env;)
|
|
|
4251 {
|
|
|
4252 p = etags_strchr (env, ':');
|
|
|
4253 if (!p) /* End of environment string. */
|
|
|
4254 p = env + strlen (env);
|
|
|
4255 if (p - env > 0)
|
|
|
4256 { /* Only non-zero strings. */
|
|
|
4257 tab[i].name = savenstr (env, p - env);
|
|
|
4258 tab[i].len = strlen (tab[i].name);
|
|
|
4259 i++;
|
|
|
4260 }
|
|
|
4261 if (*p)
|
|
|
4262 env = p + 1;
|
|
|
4263 else
|
|
|
4264 {
|
|
|
4265 tab[i].name = NULL; /* Mark end of table. */
|
|
|
4266 tab[i].len = 0;
|
|
|
4267 break;
|
|
|
4268 }
|
|
|
4269 }
|
|
|
4270 return tab;
|
|
|
4271 }
|
|
|
4272
|
|
|
4273 /* If the text at CP matches one of the tag-defining TeX command names,
|
|
|
4274 return the pointer to the first occurrence of that command in TEX_toktab.
|
|
|
4275 Otherwise return -1.
|
|
201
|
4276 Keep the capital `T' in `token' for dumb truncating compilers
|
|
0
|
4277 (this distinguishes it from `TEX_toktab' */
|
|
|
4278 int
|
|
4
|
4279 TEX_Token (cp)
|
|
|
4280 char *cp;
|
|
0
|
4281 {
|
|
|
4282 int i;
|
|
|
4283
|
|
|
4284 for (i = 0; TEX_toktab[i].len > 0; i++)
|
|
|
4285 if (strneq (TEX_toktab[i].name, cp, TEX_toktab[i].len))
|
|
|
4286 return i;
|
|
|
4287 return -1;
|
|
|
4288 }
|
|
|
4289
|
|
4
|
4290 /*
|
|
|
4291 * Prolog support (rewritten) by Anders Lindgren, Mar. 96
|
|
|
4292 *
|
|
|
4293 * Assumes that the predicate starts at column 0.
|
|
|
4294 * Only the first clause of a predicate is added.
|
|
|
4295 */
|
|
201
|
4296 int prolog_pred PP ((char *s, char *last));
|
|
|
4297 void prolog_skip_comment PP ((linebuffer *plb, FILE *inf));
|
|
|
4298 int prolog_atom PP ((char *s, int pos));
|
|
153
|
4299
|
|
4
|
4300 void
|
|
|
4301 Prolog_functions (inf)
|
|
|
4302 FILE *inf;
|
|
0
|
4303 {
|
|
201
|
4304 char *cp, *last;
|
|
4
|
4305 int len;
|
|
|
4306 int allocated;
|
|
|
4307
|
|
|
4308 allocated = 0;
|
|
|
4309 len = 0;
|
|
|
4310 last = NULL;
|
|
|
4311
|
|
201
|
4312 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
0
|
4313 {
|
|
201
|
4314 if (cp[0] == '\0') /* Empty line */
|
|
|
4315 continue;
|
|
|
4316 else if (isspace (cp[0])) /* Not a predicate */
|
|
0
|
4317 continue;
|
|
201
|
4318 else if (cp[0] == '/' && cp[1] == '*') /* comment. */
|
|
4
|
4319 prolog_skip_comment (&lb, inf);
|
|
201
|
4320 else if ((len = prolog_pred (cp, last)) > 0)
|
|
4
|
4321 {
|
|
|
4322 /* Predicate. Store the function name so that we only
|
|
134
|
4323 generate a tag for the first clause. */
|
|
4
|
4324 if (last == NULL)
|
|
|
4325 last = xnew(len + 1, char);
|
|
|
4326 else if (len + 1 > allocated)
|
|
201
|
4327 last = xrnew (last, len + 1, char);
|
|
4
|
4328 allocated = len + 1;
|
|
201
|
4329 strncpy (last, cp, len);
|
|
4
|
4330 last[len] = '\0';
|
|
|
4331 }
|
|
0
|
4332 }
|
|
|
4333 }
|
|
|
4334
|
|
4
|
4335
|
|
0
|
4336 void
|
|
4
|
4337 prolog_skip_comment (plb, inf)
|
|
201
|
4338 linebuffer *plb;
|
|
4
|
4339 FILE *inf;
|
|
0
|
4340 {
|
|
|
4341 char *cp;
|
|
|
4342
|
|
|
4343 do
|
|
|
4344 {
|
|
|
4345 for (cp = plb->buffer; *cp != '\0'; cp++)
|
|
|
4346 if (cp[0] == '*' && cp[1] == '/')
|
|
|
4347 return;
|
|
4
|
4348 lineno++;
|
|
|
4349 linecharno += readline (plb, inf);
|
|
0
|
4350 }
|
|
|
4351 while (!feof(inf));
|
|
|
4352 }
|
|
4
|
4353
|
|
|
4354 /*
|
|
|
4355 * A predicate definition is added if it matches:
|
|
|
4356 * <beginning of line><Prolog Atom><whitespace>(
|
|
|
4357 *
|
|
|
4358 * It is added to the tags database if it doesn't match the
|
|
|
4359 * name of the previous clause header.
|
|
|
4360 *
|
|
|
4361 * Return the size of the name of the predicate, or 0 if no header
|
|
|
4362 * was found.
|
|
|
4363 */
|
|
|
4364 int
|
|
|
4365 prolog_pred (s, last)
|
|
|
4366 char *s;
|
|
|
4367 char *last; /* Name of last clause. */
|
|
|
4368 {
|
|
|
4369 int pos;
|
|
|
4370 int len;
|
|
|
4371
|
|
153
|
4372 pos = prolog_atom (s, 0);
|
|
4
|
4373 if (pos < 1)
|
|
|
4374 return 0;
|
|
|
4375
|
|
|
4376 len = pos;
|
|
201
|
4377 pos = skip_spaces (s + pos) - s;
|
|
4
|
4378
|
|
|
4379 if ((s[pos] == '(') || (s[pos] == '.'))
|
|
|
4380 {
|
|
|
4381 if (s[pos] == '(')
|
|
|
4382 pos++;
|
|
|
4383
|
|
|
4384 /* Save only the first clause. */
|
|
153
|
4385 if (last == NULL
|
|
|
4386 || len != strlen (last)
|
|
|
4387 || !strneq (s, last, len))
|
|
4
|
4388 {
|
|
|
4389 pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
|
|
|
4390 s, pos, lineno, linecharno);
|
|
|
4391 return len;
|
|
|
4392 }
|
|
|
4393 }
|
|
|
4394 return 0;
|
|
|
4395 }
|
|
|
4396
|
|
|
4397 /*
|
|
|
4398 * Consume a Prolog atom.
|
|
|
4399 * Return the number of bytes consumed, or -1 if there was an error.
|
|
|
4400 *
|
|
|
4401 * A prolog atom, in this context, could be one of:
|
|
|
4402 * - An alphanumeric sequence, starting with a lower case letter.
|
|
|
4403 * - A quoted arbitrary string. Single quotes can escape themselves.
|
|
|
4404 * Backslash quotes everything.
|
|
|
4405 */
|
|
|
4406 int
|
|
|
4407 prolog_atom (s, pos)
|
|
|
4408 char *s;
|
|
|
4409 int pos;
|
|
|
4410 {
|
|
|
4411 int origpos;
|
|
|
4412
|
|
|
4413 origpos = pos;
|
|
|
4414
|
|
|
4415 if (islower(s[pos]) || (s[pos] == '_'))
|
|
|
4416 {
|
|
|
4417 /* The atom is unquoted. */
|
|
|
4418 pos++;
|
|
|
4419 while (isalnum(s[pos]) || (s[pos] == '_'))
|
|
|
4420 {
|
|
|
4421 pos++;
|
|
|
4422 }
|
|
|
4423 return pos - origpos;
|
|
|
4424 }
|
|
|
4425 else if (s[pos] == '\'')
|
|
|
4426 {
|
|
|
4427 pos++;
|
|
|
4428
|
|
|
4429 while (1)
|
|
|
4430 {
|
|
|
4431 if (s[pos] == '\'')
|
|
|
4432 {
|
|
|
4433 pos++;
|
|
|
4434 if (s[pos] != '\'')
|
|
|
4435 break;
|
|
|
4436 pos++; /* A double quote */
|
|
|
4437 }
|
|
|
4438 else if (s[pos] == '\0')
|
|
|
4439 /* Multiline quoted atoms are ignored. */
|
|
|
4440 return -1;
|
|
|
4441 else if (s[pos] == '\\')
|
|
|
4442 {
|
|
|
4443 if (s[pos+1] == '\0')
|
|
|
4444 return -1;
|
|
|
4445 pos += 2;
|
|
|
4446 }
|
|
|
4447 else
|
|
|
4448 pos++;
|
|
|
4449 }
|
|
|
4450 return pos - origpos;
|
|
|
4451 }
|
|
|
4452 else
|
|
|
4453 return -1;
|
|
|
4454 }
|
|
|
4455
|
|
|
4456 /*
|
|
|
4457 * Support for Erlang -- Anders Lindgren, Feb 1996.
|
|
|
4458 *
|
|
|
4459 * Generates tags for functions, defines, and records.
|
|
|
4460 *
|
|
|
4461 * Assumes that Erlang functions start at column 0.
|
|
|
4462 */
|
|
201
|
4463 int erlang_func PP ((char *s, char *last));
|
|
|
4464 void erlang_attribute PP ((char *s));
|
|
|
4465 int erlang_atom PP ((char *s, int pos));
|
|
153
|
4466
|
|
4
|
4467 void
|
|
|
4468 Erlang_functions (inf)
|
|
|
4469 FILE *inf;
|
|
|
4470 {
|
|
201
|
4471 char *cp, *last;
|
|
4
|
4472 int len;
|
|
|
4473 int allocated;
|
|
|
4474
|
|
|
4475 allocated = 0;
|
|
|
4476 len = 0;
|
|
|
4477 last = NULL;
|
|
|
4478
|
|
201
|
4479 LOOP_ON_INPUT_LINES (inf, lb, cp)
|
|
4
|
4480 {
|
|
201
|
4481 if (cp[0] == '\0') /* Empty line */
|
|
4
|
4482 continue;
|
|
201
|
4483 else if (isspace (cp[0])) /* Not function nor attribute */
|
|
|
4484 continue;
|
|
|
4485 else if (cp[0] == '%') /* comment */
|
|
4
|
4486 continue;
|
|
201
|
4487 else if (cp[0] == '"') /* Sometimes, strings start in column one */
|
|
4
|
4488 continue;
|
|
201
|
4489 else if (cp[0] == '-') /* attribute, e.g. "-define" */
|
|
4
|
4490 {
|
|
201
|
4491 erlang_attribute (cp);
|
|
4
|
4492 last = NULL;
|
|
|
4493 }
|
|
201
|
4494 else if ((len = erlang_func (cp, last)) > 0)
|
|
4
|
4495 {
|
|
|
4496 /*
|
|
|
4497 * Function. Store the function name so that we only
|
|
|
4498 * generates a tag for the first clause.
|
|
|
4499 */
|
|
|
4500 if (last == NULL)
|
|
153
|
4501 last = xnew (len + 1, char);
|
|
4
|
4502 else if (len + 1 > allocated)
|
|
201
|
4503 last = xrnew (last, len + 1, char);
|
|
4
|
4504 allocated = len + 1;
|
|
201
|
4505 strncpy (last, cp, len);
|
|
4
|
4506 last[len] = '\0';
|
|
|
4507 }
|
|
|
4508 }
|
|
|
4509 }
|
|
|
4510
|
|
|
4511
|
|
|
4512 /*
|
|
|
4513 * A function definition is added if it matches:
|
|
|
4514 * <beginning of line><Erlang Atom><whitespace>(
|
|
|
4515 *
|
|
|
4516 * It is added to the tags database if it doesn't match the
|
|
|
4517 * name of the previous clause header.
|
|
|
4518 *
|
|
|
4519 * Return the size of the name of the function, or 0 if no function
|
|
|
4520 * was found.
|
|
|
4521 */
|
|
|
4522 int
|
|
|
4523 erlang_func (s, last)
|
|
|
4524 char *s;
|
|
|
4525 char *last; /* Name of last clause. */
|
|
|
4526 {
|
|
|
4527 int pos;
|
|
|
4528 int len;
|
|
|
4529
|
|
153
|
4530 pos = erlang_atom (s, 0);
|
|
4
|
4531 if (pos < 1)
|
|
|
4532 return 0;
|
|
|
4533
|
|
|
4534 len = pos;
|
|
201
|
4535 pos = skip_spaces (s + pos) - s;
|
|
153
|
4536
|
|
|
4537 /* Save only the first clause. */
|
|
|
4538 if (s[pos++] == '('
|
|
|
4539 && (last == NULL
|
|
|
4540 || len != strlen (last)
|
|
|
4541 || !strneq (s, last, len)))
|
|
4
|
4542 {
|
|
|
4543 pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
|
|
|
4544 s, pos, lineno, linecharno);
|
|
|
4545 return len;
|
|
|
4546 }
|
|
153
|
4547
|
|
4
|
4548 return 0;
|
|
|
4549 }
|
|
|
4550
|
|
|
4551
|
|
|
4552 /*
|
|
|
4553 * Handle attributes. Currently, tags are generated for defines
|
|
|
4554 * and records.
|
|
|
4555 *
|
|
|
4556 * They are on the form:
|
|
|
4557 * -define(foo, bar).
|
|
|
4558 * -define(Foo(M, N), M+N).
|
|
|
4559 * -record(graph, {vtab = notable, cyclic = true}).
|
|
|
4560 */
|
|
|
4561 void
|
|
|
4562 erlang_attribute (s)
|
|
|
4563 char *s;
|
|
|
4564 {
|
|
|
4565 int pos;
|
|
|
4566 int len;
|
|
|
4567
|
|
153
|
4568 if (strneq (s, "-define", 7) || strneq (s, "-record", 7))
|
|
4
|
4569 {
|
|
201
|
4570 pos = skip_spaces (s + 7) - s;
|
|
4
|
4571 if (s[pos++] == '(')
|
|
|
4572 {
|
|
201
|
4573 pos = skip_spaces (s + pos) - s;
|
|
|
4574 len = erlang_atom (s, pos);
|
|
|
4575 if (len != 0)
|
|
|
4576 pfnote ((CTAGS) ? savenstr (& s[pos], len) : NULL, TRUE,
|
|
|
4577 s, pos + len, lineno, linecharno);
|
|
4
|
4578 }
|
|
|
4579 }
|
|
|
4580 return;
|
|
|
4581 }
|
|
|
4582
|
|
|
4583
|
|
|
4584 /*
|
|
|
4585 * Consume an Erlang atom (or variable).
|
|
|
4586 * Return the number of bytes consumed, or -1 if there was an error.
|
|
|
4587 */
|
|
|
4588 int
|
|
|
4589 erlang_atom (s, pos)
|
|
|
4590 char *s;
|
|
|
4591 int pos;
|
|
|
4592 {
|
|
|
4593 int origpos;
|
|
|
4594
|
|
|
4595 origpos = pos;
|
|
|
4596
|
|
|
4597 if (isalpha (s[pos]) || s[pos] == '_')
|
|
|
4598 {
|
|
|
4599 /* The atom is unquoted. */
|
|
|
4600 pos++;
|
|
|
4601 while (isalnum (s[pos]) || s[pos] == '_')
|
|
|
4602 pos++;
|
|
|
4603 return pos - origpos;
|
|
|
4604 }
|
|
|
4605 else if (s[pos] == '\'')
|
|
|
4606 {
|
|
|
4607 pos++;
|
|
|
4608
|
|
|
4609 while (1)
|
|
|
4610 {
|
|
|
4611 if (s[pos] == '\'')
|
|
|
4612 {
|
|
|
4613 pos++;
|
|
|
4614 break;
|
|
|
4615 }
|
|
|
4616 else if (s[pos] == '\0')
|
|
|
4617 /* Multiline quoted atoms are ignored. */
|
|
|
4618 return -1;
|
|
|
4619 else if (s[pos] == '\\')
|
|
|
4620 {
|
|
|
4621 if (s[pos+1] == '\0')
|
|
|
4622 return -1;
|
|
|
4623 pos += 2;
|
|
|
4624 }
|
|
|
4625 else
|
|
|
4626 pos++;
|
|
|
4627 }
|
|
|
4628 return pos - origpos;
|
|
|
4629 }
|
|
|
4630 else
|
|
|
4631 return -1;
|
|
|
4632 }
|
|
0
|
4633
|
|
|
4634 #ifdef ETAGS_REGEXPS
|
|
201
|
4635
|
|
0
|
4636 /* Take a string like "/blah/" and turn it into "blah", making sure
|
|
|
4637 that the first and last characters are the same, and handling
|
|
2
|
4638 quoted separator characters. Actually, stops on the occurrence of
|
|
0
|
4639 an unquoted separator. Also turns "\t" into a Tab character.
|
|
|
4640 Returns pointer to terminating separator. Works in place. Null
|
|
|
4641 terminates name string. */
|
|
201
|
4642 char * scan_separators PP ((char *name));
|
|
4
|
4643 char *
|
|
|
4644 scan_separators (name)
|
|
|
4645 char *name;
|
|
0
|
4646 {
|
|
|
4647 char sep = name[0];
|
|
|
4648 char *copyto = name;
|
|
155
|
4649 bool quoted = FALSE;
|
|
0
|
4650
|
|
|
4651 for (++name; *name != '\0'; ++name)
|
|
|
4652 {
|
|
|
4653 if (quoted)
|
|
|
4654 {
|
|
|
4655 if (*name == 't')
|
|
|
4656 *copyto++ = '\t';
|
|
|
4657 else if (*name == sep)
|
|
|
4658 *copyto++ = sep;
|
|
|
4659 else
|
|
|
4660 {
|
|
|
4661 /* Something else is quoted, so preserve the quote. */
|
|
|
4662 *copyto++ = '\\';
|
|
|
4663 *copyto++ = *name;
|
|
|
4664 }
|
|
|
4665 quoted = FALSE;
|
|
|
4666 }
|
|
|
4667 else if (*name == '\\')
|
|
|
4668 quoted = TRUE;
|
|
|
4669 else if (*name == sep)
|
|
|
4670 break;
|
|
|
4671 else
|
|
|
4672 *copyto++ = *name;
|
|
|
4673 }
|
|
|
4674
|
|
|
4675 /* Terminate copied string. */
|
|
|
4676 *copyto = '\0';
|
|
|
4677 return name;
|
|
|
4678 }
|
|
|
4679
|
|
149
|
4680 /* Look at the argument of --regex or --no-regex and do the right
|
|
201
|
4681 thing. Same for each line of a regexp file. */
|
|
149
|
4682 void
|
|
|
4683 analyse_regex (regex_arg)
|
|
|
4684 char *regex_arg;
|
|
|
4685 {
|
|
|
4686 if (regex_arg == NULL)
|
|
201
|
4687 free_patterns (); /* --no-regex: remove existing regexps */
|
|
|
4688
|
|
|
4689 /* A real --regexp option or a line in a regexp file. */
|
|
|
4690 switch (regex_arg[0])
|
|
149
|
4691 {
|
|
201
|
4692 /* Comments in regexp file or null arg to --regex. */
|
|
|
4693 case '\0':
|
|
|
4694 case ' ':
|
|
|
4695 case '\t':
|
|
|
4696 break;
|
|
|
4697
|
|
|
4698 /* Read a regex file. This is recursive and may result in a
|
|
|
4699 loop, which will stop when the file descriptors are exhausted. */
|
|
|
4700 case '@':
|
|
|
4701 {
|
|
|
4702 FILE *regexfp;
|
|
|
4703 linebuffer regexbuf;
|
|
|
4704 char *regexfile = regex_arg + 1;
|
|
|
4705
|
|
|
4706 /* regexfile is a file containing regexps, one per line. */
|
|
|
4707 regexfp = fopen (regexfile, "r");
|
|
|
4708 if (regexfp == NULL)
|
|
|
4709 {
|
|
|
4710 pfatal (regexfile);
|
|
|
4711 return;
|
|
|
4712 }
|
|
|
4713 initbuffer (®exbuf);
|
|
|
4714 while (readline_internal (®exbuf, regexfp) > 0)
|
|
|
4715 analyse_regex (regexbuf.buffer);
|
|
|
4716 free (regexbuf.buffer);
|
|
|
4717 fclose (regexfp);
|
|
|
4718 }
|
|
|
4719 break;
|
|
|
4720
|
|
|
4721 /* Regexp to be used for a specific language only. */
|
|
|
4722 case '{':
|
|
|
4723 {
|
|
|
4724 language *lang;
|
|
|
4725 char *lang_name = regex_arg + 1;
|
|
|
4726 char *cp;
|
|
|
4727
|
|
|
4728 for (cp = lang_name; *cp != '}'; cp++)
|
|
|
4729 if (*cp == '\0')
|
|
|
4730 {
|
|
|
4731 error ("unterminated language name in regex: %s", regex_arg);
|
|
|
4732 return;
|
|
|
4733 }
|
|
|
4734 *cp = '\0';
|
|
|
4735 lang = get_language_from_name (lang_name);
|
|
|
4736 if (lang == NULL)
|
|
149
|
4737 return;
|
|
201
|
4738 add_regex (cp + 1, lang);
|
|
|
4739 }
|
|
|
4740 break;
|
|
|
4741
|
|
|
4742 /* Regexp to be used for any language. */
|
|
|
4743 default:
|
|
|
4744 add_regex (regex_arg, NULL);
|
|
|
4745 break;
|
|
149
|
4746 }
|
|
|
4747 }
|
|
|
4748
|
|
0
|
4749 /* Turn a name, which is an ed-style (but Emacs syntax) regular
|
|
|
4750 expression, into a real regular expression by compiling it. */
|
|
|
4751 void
|
|
201
|
4752 add_regex (regexp_pattern, lang)
|
|
4
|
4753 char *regexp_pattern;
|
|
201
|
4754 language *lang;
|
|
0
|
4755 {
|
|
|
4756 char *name;
|
|
|
4757 const char *err;
|
|
|
4758 struct re_pattern_buffer *patbuf;
|
|
201
|
4759 pattern *pp;
|
|
0
|
4760
|
|
149
|
4761
|
|
0
|
4762 if (regexp_pattern[strlen(regexp_pattern)-1] != regexp_pattern[0])
|
|
|
4763 {
|
|
|
4764 error ("%s: unterminated regexp", regexp_pattern);
|
|
|
4765 return;
|
|
|
4766 }
|
|
|
4767 name = scan_separators (regexp_pattern);
|
|
|
4768 if (regexp_pattern[0] == '\0')
|
|
|
4769 {
|
|
4
|
4770 error ("null regexp", (char *)NULL);
|
|
0
|
4771 return;
|
|
|
4772 }
|
|
|
4773 (void) scan_separators (name);
|
|
|
4774
|
|
|
4775 patbuf = xnew (1, struct re_pattern_buffer);
|
|
|
4776 patbuf->translate = NULL;
|
|
|
4777 patbuf->fastmap = NULL;
|
|
|
4778 patbuf->buffer = NULL;
|
|
|
4779 patbuf->allocated = 0;
|
|
|
4780
|
|
|
4781 err = re_compile_pattern (regexp_pattern, strlen (regexp_pattern), patbuf);
|
|
|
4782 if (err != NULL)
|
|
|
4783 {
|
|
4
|
4784 error ("%s while compiling pattern", err);
|
|
0
|
4785 return;
|
|
|
4786 }
|
|
|
4787
|
|
201
|
4788 pp = p_head;
|
|
|
4789 p_head = xnew (1, pattern);
|
|
|
4790 p_head->regex = savestr (regexp_pattern);
|
|
|
4791 p_head->p_next = pp;
|
|
|
4792 p_head->language = lang;
|
|
|
4793 p_head->pattern = patbuf;
|
|
|
4794 p_head->name_pattern = savestr (name);
|
|
|
4795 p_head->error_signaled = FALSE;
|
|
0
|
4796 }
|
|
|
4797
|
|
|
4798 /*
|
|
|
4799 * Do the substitutions indicated by the regular expression and
|
|
|
4800 * arguments.
|
|
|
4801 */
|
|
201
|
4802 char * substitute PP ((char *in, char *out, struct re_registers *regs));
|
|
4
|
4803 char *
|
|
|
4804 substitute (in, out, regs)
|
|
|
4805 char *in, *out;
|
|
|
4806 struct re_registers *regs;
|
|
0
|
4807 {
|
|
142
|
4808 char *result, *t;
|
|
|
4809 int size, dig, diglen;
|
|
|
4810
|
|
|
4811 result = NULL;
|
|
|
4812 size = strlen (out);
|
|
|
4813
|
|
|
4814 /* Pass 1: figure out how much to allocate by finding all \N strings. */
|
|
|
4815 if (out[size - 1] == '\\')
|
|
|
4816 fatal ("pattern error in \"%s\"", out);
|
|
|
4817 for (t = etags_strchr (out, '\\');
|
|
|
4818 t != NULL;
|
|
|
4819 t = etags_strchr (t + 2, '\\'))
|
|
|
4820 if (isdigit (t[1]))
|
|
|
4821 {
|
|
|
4822 dig = t[1] - '0';
|
|
|
4823 diglen = regs->end[dig] - regs->start[dig];
|
|
|
4824 size += diglen - 2;
|
|
|
4825 }
|
|
|
4826 else
|
|
|
4827 size -= 1;
|
|
0
|
4828
|
|
|
4829 /* Allocate space and do the substitutions. */
|
|
|
4830 result = xnew (size + 1, char);
|
|
142
|
4831
|
|
|
4832 for (t = result; *out != '\0'; out++)
|
|
|
4833 if (*out == '\\' && isdigit (*++out))
|
|
|
4834 {
|
|
|
4835 /* Using "dig2" satisfies my debugger. Bleah. */
|
|
|
4836 dig = *out - '0';
|
|
|
4837 diglen = regs->end[dig] - regs->start[dig];
|
|
|
4838 strncpy (t, in + regs->start[dig], diglen);
|
|
|
4839 t += diglen;
|
|
|
4840 }
|
|
|
4841 else
|
|
|
4842 *t++ = *out;
|
|
|
4843 *t = '\0';
|
|
|
4844
|
|
|
4845 if (DEBUG && (t > result + size || t - result != strlen (result)))
|
|
|
4846 abort ();
|
|
0
|
4847
|
|
|
4848 return result;
|
|
|
4849 }
|
|
201
|
4850
|
|
|
4851 /* Deallocate all patterns. */
|
|
|
4852 void
|
|
|
4853 free_patterns ()
|
|
|
4854 {
|
|
|
4855 pattern *pp;
|
|
|
4856 while (p_head != NULL)
|
|
|
4857 {
|
|
|
4858 pp = p_head->p_next;
|
|
|
4859 free (p_head->regex);
|
|
|
4860 free (p_head->name_pattern);
|
|
|
4861 free (p_head);
|
|
|
4862 p_head = pp;
|
|
|
4863 }
|
|
|
4864 return;
|
|
|
4865 }
|
|
0
|
4866
|
|
|
4867 #endif /* ETAGS_REGEXPS */
|
|
|
4868 /* Initialize a linebuffer for use */
|
|
|
4869 void
|
|
201
|
4870 initbuffer (lbp)
|
|
|
4871 linebuffer *lbp;
|
|
0
|
4872 {
|
|
201
|
4873 lbp->size = 200;
|
|
|
4874 lbp->buffer = xnew (200, char);
|
|
0
|
4875 }
|
|
|
4876
|
|
|
4877 /*
|
|
201
|
4878 * Read a line of text from `stream' into `lbp', excluding the
|
|
|
4879 * newline or CR-NL, if any. Return the number of characters read from
|
|
|
4880 * `stream', which is the length of the line including the newline.
|
|
|
4881 *
|
|
|
4882 * On DOS or Windows we do not count the CR character, if any, before the
|
|
|
4883 * NL, in the returned length; this mirrors the behavior of emacs on those
|
|
|
4884 * platforms (for text files, it translates CR-NL to NL as it reads in the
|
|
|
4885 * file).
|
|
0
|
4886 */
|
|
|
4887 long
|
|
201
|
4888 readline_internal (lbp, stream)
|
|
|
4889 linebuffer *lbp;
|
|
4
|
4890 register FILE *stream;
|
|
0
|
4891 {
|
|
201
|
4892 char *buffer = lbp->buffer;
|
|
|
4893 register char *p = lbp->buffer;
|
|
0
|
4894 register char *pend;
|
|
|
4895 int chars_deleted;
|
|
|
4896
|
|
201
|
4897 pend = p + lbp->size; /* Separate to avoid 386/IX compiler bug. */
|
|
0
|
4898
|
|
|
4899 while (1)
|
|
|
4900 {
|
|
|
4901 register int c = getc (stream);
|
|
|
4902 if (p == pend)
|
|
|
4903 {
|
|
201
|
4904 /* We're at the end of linebuffer: expand it. */
|
|
|
4905 lbp->size *= 2;
|
|
|
4906 buffer = xrnew (buffer, lbp->size, char);
|
|
|
4907 p += buffer - lbp->buffer;
|
|
|
4908 pend = buffer + lbp->size;
|
|
|
4909 lbp->buffer = buffer;
|
|
0
|
4910 }
|
|
|
4911 if (c == EOF)
|
|
|
4912 {
|
|
4
|
4913 *p = '\0';
|
|
0
|
4914 chars_deleted = 0;
|
|
|
4915 break;
|
|
|
4916 }
|
|
|
4917 if (c == '\n')
|
|
|
4918 {
|
|
|
4919 if (p > buffer && p[-1] == '\r')
|
|
|
4920 {
|
|
142
|
4921 p -= 1;
|
|
4
|
4922 #ifdef DOS_NT
|
|
|
4923 /* Assume CRLF->LF translation will be performed by Emacs
|
|
|
4924 when loading this file, so CRs won't appear in the buffer.
|
|
|
4925 It would be cleaner to compensate within Emacs;
|
|
|
4926 however, Emacs does not know how many CRs were deleted
|
|
|
4927 before any given point in the file. */
|
|
|
4928 chars_deleted = 1;
|
|
|
4929 #else
|
|
0
|
4930 chars_deleted = 2;
|
|
4
|
4931 #endif
|
|
0
|
4932 }
|
|
|
4933 else
|
|
|
4934 {
|
|
|
4935 chars_deleted = 1;
|
|
|
4936 }
|
|
142
|
4937 *p = '\0';
|
|
0
|
4938 break;
|
|
|
4939 }
|
|
|
4940 *p++ = c;
|
|
|
4941 }
|
|
201
|
4942 lbp->len = p - buffer;
|
|
|
4943
|
|
|
4944 return lbp->len + chars_deleted;
|
|
0
|
4945 }
|
|
|
4946
|
|
|
4947 /*
|
|
142
|
4948 * Like readline_internal, above, but in addition try to match the
|
|
201
|
4949 * input line against relevant regular expressions.
|
|
0
|
4950 */
|
|
|
4951 long
|
|
201
|
4952 readline (lbp, stream)
|
|
|
4953 linebuffer *lbp;
|
|
4
|
4954 FILE *stream;
|
|
0
|
4955 {
|
|
|
4956 /* Read new line. */
|
|
201
|
4957 long result = readline_internal (lbp, stream);
|
|
0
|
4958 #ifdef ETAGS_REGEXPS
|
|
201
|
4959 int match;
|
|
|
4960 pattern *pp;
|
|
|
4961
|
|
|
4962 /* Match against relevant patterns. */
|
|
|
4963 if (lbp->len > 0)
|
|
|
4964 for (pp = p_head; pp != NULL; pp = pp->p_next)
|
|
142
|
4965 {
|
|
201
|
4966 /* Only use generic regexps or those for the current language. */
|
|
|
4967 if (pp->language != NULL && pp->language != curlang)
|
|
|
4968 continue;
|
|
|
4969
|
|
|
4970 match = re_match (pp->pattern, lbp->buffer, lbp->len, 0, &pp->regs);
|
|
142
|
4971 switch (match)
|
|
|
4972 {
|
|
|
4973 case -2:
|
|
|
4974 /* Some error. */
|
|
201
|
4975 if (!pp->error_signaled)
|
|
142
|
4976 {
|
|
201
|
4977 error ("error while matching \"%s\"", pp->regex);
|
|
|
4978 pp->error_signaled = TRUE;
|
|
142
|
4979 }
|
|
|
4980 break;
|
|
|
4981 case -1:
|
|
|
4982 /* No match. */
|
|
|
4983 break;
|
|
|
4984 default:
|
|
|
4985 /* Match occurred. Construct a tag. */
|
|
201
|
4986 if (pp->name_pattern[0] != '\0')
|
|
142
|
4987 {
|
|
|
4988 /* Make a named tag. */
|
|
201
|
4989 char *name = substitute (lbp->buffer,
|
|
|
4990 pp->name_pattern, &pp->regs);
|
|
142
|
4991 if (name != NULL)
|
|
201
|
4992 pfnote (name, TRUE, lbp->buffer, match, lineno, linecharno);
|
|
142
|
4993 }
|
|
|
4994 else
|
|
|
4995 {
|
|
|
4996 /* Make an unnamed tag. */
|
|
|
4997 pfnote ((char *)NULL, TRUE,
|
|
201
|
4998 lbp->buffer, match, lineno, linecharno);
|
|
142
|
4999 }
|
|
|
5000 break;
|
|
|
5001 }
|
|
|
5002 }
|
|
0
|
5003 #endif /* ETAGS_REGEXPS */
|
|
142
|
5004
|
|
0
|
5005 return result;
|
|
|
5006 }
|
|
|
5007
|
|
|
5008 /*
|
|
|
5009 * Return a pointer to a space of size strlen(cp)+1 allocated
|
|
|
5010 * with xnew where the string CP has been copied.
|
|
|
5011 */
|
|
|
5012 char *
|
|
4
|
5013 savestr (cp)
|
|
|
5014 char *cp;
|
|
0
|
5015 {
|
|
|
5016 return savenstr (cp, strlen (cp));
|
|
|
5017 }
|
|
|
5018
|
|
|
5019 /*
|
|
|
5020 * Return a pointer to a space of size LEN+1 allocated with xnew where
|
|
|
5021 * the string CP has been copied for at most the first LEN characters.
|
|
|
5022 */
|
|
|
5023 char *
|
|
4
|
5024 savenstr (cp, len)
|
|
|
5025 char *cp;
|
|
|
5026 int len;
|
|
0
|
5027 {
|
|
|
5028 register char *dp;
|
|
|
5029
|
|
|
5030 dp = xnew (len + 1, char);
|
|
|
5031 strncpy (dp, cp, len);
|
|
|
5032 dp[len] = '\0';
|
|
|
5033 return dp;
|
|
|
5034 }
|
|
|
5035
|
|
|
5036 /*
|
|
|
5037 * Return the ptr in sp at which the character c last
|
|
|
5038 * appears; NULL if not found
|
|
|
5039 *
|
|
|
5040 * Identical to System V strrchr, included for portability.
|
|
|
5041 */
|
|
|
5042 char *
|
|
4
|
5043 etags_strrchr (sp, c)
|
|
201
|
5044 register char *sp;
|
|
|
5045 register int c;
|
|
0
|
5046 {
|
|
4
|
5047 register char *r;
|
|
0
|
5048
|
|
|
5049 r = NULL;
|
|
|
5050 do
|
|
|
5051 {
|
|
|
5052 if (*sp == c)
|
|
|
5053 r = sp;
|
|
|
5054 } while (*sp++);
|
|
4
|
5055 return r;
|
|
0
|
5056 }
|
|
|
5057
|
|
|
5058
|
|
|
5059 /*
|
|
|
5060 * Return the ptr in sp at which the character c first
|
|
|
5061 * appears; NULL if not found
|
|
|
5062 *
|
|
|
5063 * Identical to System V strchr, included for portability.
|
|
|
5064 */
|
|
|
5065 char *
|
|
4
|
5066 etags_strchr (sp, c)
|
|
201
|
5067 register char *sp;
|
|
|
5068 register int c;
|
|
0
|
5069 {
|
|
|
5070 do
|
|
|
5071 {
|
|
|
5072 if (*sp == c)
|
|
4
|
5073 return sp;
|
|
0
|
5074 } while (*sp++);
|
|
|
5075 return NULL;
|
|
|
5076 }
|
|
|
5077
|
|
201
|
5078 /* Skip spaces, return new pointer. */
|
|
|
5079 char *
|
|
|
5080 skip_spaces (cp)
|
|
|
5081 char *cp;
|
|
|
5082 {
|
|
|
5083 while (isspace (*cp)) /* isspace('\0')==FALSE */
|
|
|
5084 cp++;
|
|
|
5085 return cp;
|
|
|
5086 }
|
|
|
5087
|
|
|
5088 /* Skip non spaces, return new pointer. */
|
|
|
5089 char *
|
|
|
5090 skip_non_spaces (cp)
|
|
|
5091 char *cp;
|
|
|
5092 {
|
|
|
5093 while (!iswhite (*cp)) /* iswhite('\0')==TRUE */
|
|
|
5094 cp++;
|
|
|
5095 return cp;
|
|
|
5096 }
|
|
|
5097
|
|
0
|
5098 /* Print error message and exit. */
|
|
|
5099 void
|
|
4
|
5100 fatal (s1, s2)
|
|
|
5101 char *s1, *s2;
|
|
0
|
5102 {
|
|
|
5103 error (s1, s2);
|
|
|
5104 exit (BAD);
|
|
|
5105 }
|
|
|
5106
|
|
|
5107 void
|
|
4
|
5108 pfatal (s1)
|
|
|
5109 char *s1;
|
|
0
|
5110 {
|
|
|
5111 perror (s1);
|
|
|
5112 exit (BAD);
|
|
|
5113 }
|
|
|
5114
|
|
4
|
5115 void
|
|
|
5116 suggest_asking_for_help ()
|
|
|
5117 {
|
|
173
|
5118 fprintf (stderr, "\tTry `%s %s' for a complete list of options.\n",
|
|
|
5119 progname,
|
|
|
5120 #ifdef LONG_OPTIONS
|
|
|
5121 "--help"
|
|
|
5122 #else
|
|
|
5123 "-h"
|
|
|
5124 #endif
|
|
|
5125 );
|
|
4
|
5126 exit (BAD);
|
|
|
5127 }
|
|
|
5128
|
|
0
|
5129 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
|
|
|
5130 void
|
|
4
|
5131 error (s1, s2)
|
|
201
|
5132 const char *s1, *s2;
|
|
0
|
5133 {
|
|
|
5134 fprintf (stderr, "%s: ", progname);
|
|
|
5135 fprintf (stderr, s1, s2);
|
|
|
5136 fprintf (stderr, "\n");
|
|
|
5137 }
|
|
|
5138
|
|
|
5139 /* Return a newly-allocated string whose contents
|
|
|
5140 concatenate those of s1, s2, s3. */
|
|
|
5141 char *
|
|
4
|
5142 concat (s1, s2, s3)
|
|
|
5143 char *s1, *s2, *s3;
|
|
0
|
5144 {
|
|
|
5145 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3);
|
|
|
5146 char *result = xnew (len1 + len2 + len3 + 1, char);
|
|
|
5147
|
|
|
5148 strcpy (result, s1);
|
|
|
5149 strcpy (result + len1, s2);
|
|
|
5150 strcpy (result + len1 + len2, s3);
|
|
|
5151 result[len1 + len2 + len3] = '\0';
|
|
|
5152
|
|
|
5153 return result;
|
|
|
5154 }
|
|
|
5155
|
|
|
5156 /* Does the same work as the system V getcwd, but does not need to
|
|
|
5157 guess the buffer size in advance. */
|
|
|
5158 char *
|
|
4
|
5159 etags_getcwd ()
|
|
0
|
5160 {
|
|
4
|
5161 #ifdef HAVE_GETCWD
|
|
0
|
5162 int bufsize = 200;
|
|
|
5163 char *path = xnew (bufsize, char);
|
|
|
5164
|
|
|
5165 while (getcwd (path, bufsize) == NULL)
|
|
|
5166 {
|
|
|
5167 if (errno != ERANGE)
|
|
|
5168 pfatal ("getcwd");
|
|
|
5169 bufsize *= 2;
|
|
142
|
5170 free (path);
|
|
0
|
5171 path = xnew (bufsize, char);
|
|
|
5172 }
|
|
|
5173
|
|
201
|
5174 canonicalize_filename (path);
|
|
0
|
5175 return path;
|
|
4
|
5176
|
|
|
5177 #else /* not HAVE_GETCWD */
|
|
|
5178 #ifdef MSDOS
|
|
|
5179 char *p, path[MAXPATHLEN + 1]; /* Fixed size is safe on MSDOS. */
|
|
|
5180
|
|
|
5181 getwd (path);
|
|
|
5182
|
|
|
5183 for (p = path; *p != '\0'; p++)
|
|
|
5184 if (*p == '\\')
|
|
|
5185 *p = '/';
|
|
|
5186 else
|
|
|
5187 *p = lowcase (*p);
|
|
|
5188
|
|
|
5189 return strdup (path);
|
|
|
5190 #else /* not MSDOS */
|
|
201
|
5191 linebuffer path;
|
|
4
|
5192 FILE *pipe;
|
|
0
|
5193
|
|
|
5194 initbuffer (&path);
|
|
4
|
5195 pipe = (FILE *) popen ("pwd 2>/dev/null", "r");
|
|
|
5196 if (pipe == NULL || readline_internal (&path, pipe) == 0)
|
|
0
|
5197 pfatal ("pwd");
|
|
4
|
5198 pclose (pipe);
|
|
0
|
5199
|
|
|
5200 return path.buffer;
|
|
4
|
5201 #endif /* not MSDOS */
|
|
0
|
5202 #endif /* not HAVE_GETCWD */
|
|
|
5203 }
|
|
|
5204
|
|
201
|
5205 /* Return a newly allocated string containing the file name of FILE
|
|
|
5206 relative to the absolute directory DIR (which should end with a slash). */
|
|
0
|
5207 char *
|
|
4
|
5208 relative_filename (file, dir)
|
|
|
5209 char *file, *dir;
|
|
0
|
5210 {
|
|
201
|
5211 char *fp, *dp, *afn, *res;
|
|
134
|
5212 int i;
|
|
4
|
5213
|
|
|
5214 /* Find the common root of file and dir (with a trailing slash). */
|
|
201
|
5215 afn = absolute_filename (file, cwd);
|
|
|
5216 fp = afn;
|
|
0
|
5217 dp = dir;
|
|
|
5218 while (*fp++ == *dp++)
|
|
|
5219 continue;
|
|
4
|
5220 fp--, dp--; /* back to the first differing char */
|
|
134
|
5221 do /* look at the equal chars until '/' */
|
|
4
|
5222 fp--, dp--;
|
|
0
|
5223 while (*fp != '/');
|
|
|
5224
|
|
134
|
5225 /* Build a sequence of "../" strings for the resulting relative file name. */
|
|
|
5226 i = 0;
|
|
|
5227 while ((dp = etags_strchr (dp + 1, '/')) != NULL)
|
|
|
5228 i += 1;
|
|
|
5229 res = xnew (3*i + strlen (fp + 1) + 1, char);
|
|
|
5230 res[0] = '\0';
|
|
|
5231 while (i-- > 0)
|
|
|
5232 strcat (res, "../");
|
|
|
5233
|
|
|
5234 /* Add the file name relative to the common root of file and dir. */
|
|
|
5235 strcat (res, fp + 1);
|
|
201
|
5236 free (afn);
|
|
0
|
5237
|
|
|
5238 return res;
|
|
|
5239 }
|
|
|
5240
|
|
201
|
5241 /* Return a newly allocated string containing the absolute file name
|
|
|
5242 of FILE given DIR (which should end with a slash). */
|
|
0
|
5243 char *
|
|
201
|
5244 absolute_filename (file, dir)
|
|
|
5245 char *file, *dir;
|
|
0
|
5246 {
|
|
|
5247 char *slashp, *cp, *res;
|
|
|
5248
|
|
201
|
5249 if (filename_is_absolute (file))
|
|
134
|
5250 res = savestr (file);
|
|
4
|
5251 #ifdef DOS_NT
|
|
134
|
5252 /* We don't support non-absolute file names with a drive
|
|
4
|
5253 letter, like `d:NAME' (it's too much hassle). */
|
|
|
5254 else if (file[1] == ':')
|
|
134
|
5255 fatal ("%s: relative file names with drive letters not supported", file);
|
|
4
|
5256 #endif
|
|
0
|
5257 else
|
|
201
|
5258 res = concat (dir, file, "");
|
|
0
|
5259
|
|
|
5260 /* Delete the "/dirname/.." and "/." substrings. */
|
|
|
5261 slashp = etags_strchr (res, '/');
|
|
|
5262 while (slashp != NULL && slashp[0] != '\0')
|
|
|
5263 {
|
|
|
5264 if (slashp[1] == '.')
|
|
|
5265 {
|
|
|
5266 if (slashp[2] == '.'
|
|
|
5267 && (slashp[3] == '/' || slashp[3] == '\0'))
|
|
|
5268 {
|
|
|
5269 cp = slashp;
|
|
|
5270 do
|
|
|
5271 cp--;
|
|
201
|
5272 while (cp >= res && !filename_is_absolute (cp));
|
|
134
|
5273 if (cp < res)
|
|
|
5274 cp = slashp; /* the absolute name begins with "/.." */
|
|
4
|
5275 #ifdef DOS_NT
|
|
|
5276 /* Under MSDOS and NT we get `d:/NAME' as absolute
|
|
134
|
5277 file name, so the luser could say `d:/../NAME'.
|
|
4
|
5278 We silently treat this as `d:/NAME'. */
|
|
134
|
5279 else if (cp[0] != '/')
|
|
|
5280 cp = slashp;
|
|
4
|
5281 #endif
|
|
134
|
5282 strcpy (cp, slashp + 3);
|
|
0
|
5283 slashp = cp;
|
|
|
5284 continue;
|
|
|
5285 }
|
|
|
5286 else if (slashp[2] == '/' || slashp[2] == '\0')
|
|
|
5287 {
|
|
|
5288 strcpy (slashp, slashp + 2);
|
|
|
5289 continue;
|
|
|
5290 }
|
|
|
5291 }
|
|
|
5292
|
|
|
5293 slashp = etags_strchr (slashp + 1, '/');
|
|
|
5294 }
|
|
134
|
5295
|
|
|
5296 if (res[0] == '\0')
|
|
|
5297 return savestr ("/");
|
|
|
5298 else
|
|
|
5299 return res;
|
|
0
|
5300 }
|
|
|
5301
|
|
|
5302 /* Return a newly allocated string containing the absolute
|
|
201
|
5303 file name of dir where FILE resides given DIR (which should
|
|
0
|
5304 end with a slash). */
|
|
|
5305 char *
|
|
201
|
5306 absolute_dirname (file, dir)
|
|
|
5307 char *file, *dir;
|
|
0
|
5308 {
|
|
|
5309 char *slashp, *res;
|
|
|
5310 char save;
|
|
201
|
5311
|
|
|
5312 canonicalize_filename (file);
|
|
0
|
5313 slashp = etags_strrchr (file, '/');
|
|
|
5314 if (slashp == NULL)
|
|
201
|
5315 return savestr (dir);
|
|
0
|
5316 save = slashp[1];
|
|
|
5317 slashp[1] = '\0';
|
|
201
|
5318 res = absolute_filename (file, dir);
|
|
0
|
5319 slashp[1] = save;
|
|
|
5320
|
|
|
5321 return res;
|
|
|
5322 }
|
|
|
5323
|
|
201
|
5324 /* Whether the argument string is an absolute file name. The argument
|
|
|
5325 string must have been canonicalized with canonicalize_filename. */
|
|
|
5326 bool
|
|
|
5327 filename_is_absolute (fn)
|
|
|
5328 char *fn;
|
|
|
5329 {
|
|
|
5330 return (fn[0] == '/'
|
|
|
5331 #ifdef DOS_NT
|
|
|
5332 || (isalpha(fn[0]) && fn[1] == ':' && fn[2] == '/')
|
|
|
5333 #endif
|
|
|
5334 );
|
|
|
5335 }
|
|
|
5336
|
|
|
5337 /* Translate backslashes into slashes. Works in place. */
|
|
|
5338 void
|
|
|
5339 canonicalize_filename (fn)
|
|
|
5340 register char *fn;
|
|
|
5341 {
|
|
|
5342 #ifdef DOS_NT
|
|
|
5343 for (; *fn != '\0'; fn++)
|
|
|
5344 if (*fn == '\\')
|
|
|
5345 *fn = '/';
|
|
|
5346 #else
|
|
|
5347 /* No action. */
|
|
|
5348 #endif
|
|
|
5349 }
|
|
|
5350
|
|
4
|
5351 /* Increase the size of a linebuffer. */
|
|
|
5352 void
|
|
201
|
5353 grow_linebuffer (lbp, toksize)
|
|
|
5354 linebuffer *lbp;
|
|
4
|
5355 int toksize;
|
|
0
|
5356 {
|
|
201
|
5357 while (lbp->size < toksize)
|
|
|
5358 lbp->size *= 2;
|
|
|
5359 lbp->buffer = xrnew (lbp->buffer, lbp->size, char);
|
|
4
|
5360 }
|
|
|
5361
|
|
|
5362 /* Like malloc but get fatal error if memory is exhausted. */
|
|
|
5363 long *
|
|
|
5364 xmalloc (size)
|
|
|
5365 unsigned int size;
|
|
|
5366 {
|
|
|
5367 long *result = (long *) malloc (size);
|
|
0
|
5368 if (result == NULL)
|
|
4
|
5369 fatal ("virtual memory exhausted", (char *)NULL);
|
|
0
|
5370 return result;
|
|
|
5371 }
|
|
|
5372
|
|
4
|
5373 long *
|
|
|
5374 xrealloc (ptr, size)
|
|
|
5375 char *ptr;
|
|
|
5376 unsigned int size;
|
|
0
|
5377 {
|
|
4
|
5378 long *result = (long *) realloc (ptr, size);
|
|
0
|
5379 if (result == NULL)
|
|
4
|
5380 fatal ("virtual memory exhausted", (char *)NULL);
|
|
0
|
5381 return result;
|
|
|
5382 }
|
