* etags.c (pfnote): Initialise been_warned in the node.
[bpt/emacs.git] / lib-src / etags.c
1 /* Tags file maker to go with GNU Emacs
2 Copyright (C) 1984,87,88,89,93,94 Free Software Foundation, Inc. and Ken Arnold
3 This file is not considered part of GNU Emacs.
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
18
19 /*
20 * Authors:
21 * Ctags originally by Ken Arnold.
22 * Fortran added by Jim Kleckner.
23 * Ed Pelegri-Llopart added C typedefs.
24 * Gnu Emacs TAGS format and modifications by RMS?
25 * Sam Kendall added C++.
26 * Francesco Potorti` reorganised C and C++ based on work by Joe Wells.
27 #ifdef ETAGS_REGEXPS
28 * Regexp tags by Tom Tromey.
29 #endif
30 *
31 * Francesco Potorti` (pot@cnuce.cnr.it) is the current maintainer.
32 */
33
34
35 char pot_etags_version[] = "@(#) pot revision number is 11.19";
36 #ifdef MSDOS
37 #include <fcntl.h>
38 #include <sys/param.h>
39 #endif /* MSDOS */
40
41 #ifdef WINDOWSNT
42 #include <stdlib.h>
43 #include <fcntl.h>
44 #include <string.h>
45 #define MAXPATHLEN _MAX_PATH
46 #endif
47
48 #ifdef HAVE_CONFIG_H
49 #include <config.h>
50 /* On some systems, Emacs defines static as nothing for the sake
51 of unexec. We don't want that here since we don't use unexec. */
52 #undef static
53 #endif
54
55 #include <stdio.h>
56 #include <ctype.h>
57 #include <errno.h>
58 #ifndef errno
59 extern int errno;
60 #endif
61 #include <sys/types.h>
62 #include <sys/stat.h>
63
64 #if !defined (S_ISREG) && defined (S_IFREG)
65 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
66 #endif
67
68 #include <getopt.h>
69
70 #ifdef ETAGS_REGEXPS
71 #include <regex.h>
72 #endif /* ETAGS_REGEXPS */
73
74 #define TRUE 1
75 #define FALSE 0
76
77 /* Define CTAGS to make the program "ctags" compatible with the usual one.
78 Let it undefined to make the program "etags", which makes emacs-style
79 tag tables and tags typedefs, #defines and struct/union/enum by default. */
80 #ifdef CTAGS
81 # undef CTAGS
82 # define CTAGS TRUE
83 #else
84 # define CTAGS FALSE
85 #endif
86
87 /* Exit codes for success and failure. */
88 #ifdef VMS
89 #define GOOD 1
90 #define BAD 0
91 #else
92 #define GOOD 0
93 #define BAD 1
94 #endif
95
96 /* C extensions. */
97 #define C_PLPL 0x00001 /* C++ */
98 #define C_STAR 0x00003 /* C* */
99 #define YACC 0x10000 /* yacc file */
100
101 #define streq(s,t) (strcmp (s, t) == 0)
102 #define strneq(s,t,n) (strncmp (s, t, n) == 0)
103
104 #define iswhite(arg) (_wht[arg]) /* T if char is white */
105 #define begtoken(arg) (_btk[arg]) /* T if char can start token */
106 #define intoken(arg) (_itk[arg]) /* T if char can be in token */
107 #define endtoken(arg) (_etk[arg]) /* T if char ends tokens */
108
109 /*
110 * xnew -- allocate storage
111 *
112 * SYNOPSIS: Type *xnew (int n, Type);
113 */
114 #define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
115
116 typedef int logical;
117
118 typedef struct nd_st
119 { /* sorting structure */
120 char *name; /* function or type name */
121 char *file; /* file name */
122 logical is_func; /* use pattern or line no */
123 logical named; /* list name separately */
124 logical been_warned; /* set if noticed dup */
125 int lno; /* line number tag is on */
126 long cno; /* character number line starts on */
127 char *pat; /* search pattern */
128 struct nd_st *left, *right; /* left and right sons */
129 } NODE;
130
131 extern char *getenv ();
132
133 char *concat ();
134 char *savenstr (), *savestr ();
135 char *etags_strchr (), *etags_strrchr ();
136 char *etags_getcwd ();
137 char *relative_filename (), *absolute_filename (), *absolute_dirname ();
138 char *xmalloc (), *xrealloc ();
139
140 typedef void Lang_function ();
141 #if FALSE /* many compilers barf on this */
142 Lang_function Asm_labels;
143 Lang_function default_C_entries;
144 Lang_function C_entries;
145 Lang_function Cplusplus_entries;
146 Lang_function Cstar_entries;
147 Lang_function Fortran_functions;
148 Lang_function Yacc_entries;
149 Lang_function Lisp_functions;
150 Lang_function Pascal_functions;
151 Lang_function Prolog_functions;
152 Lang_function Scheme_functions;
153 Lang_function TeX_functions;
154 Lang_function just_read_file;
155 #else /* so let's write it this way */
156 void Asm_labels ();
157 void default_C_entries ();
158 void C_entries ();
159 void Cplusplus_entries ();
160 void Cstar_entries ();
161 void Fortran_functions ();
162 void Yacc_entries ();
163 void Lisp_functions ();
164 void Pascal_functions ();
165 void Prolog_functions ();
166 void Scheme_functions ();
167 void TeX_functions ();
168 void just_read_file ();
169 #endif
170
171 logical get_language ();
172 int total_size_of_entries ();
173 long readline ();
174 long readline_internal ();
175 #ifdef ETAGS_REGEXPS
176 void add_regex ();
177 #endif
178 void add_node ();
179 void error ();
180 void fatal (), pfatal ();
181 void find_entries ();
182 void free_tree ();
183 void getit ();
184 void init ();
185 void initbuffer ();
186 void pfnote ();
187 void process_file ();
188 void put_entries ();
189 void takeprec ();
190
191 \f
192 char searchar = '/'; /* use /.../ searches */
193
194 int lineno; /* line number of current line */
195 long charno; /* current character number */
196
197 long linecharno; /* charno of start of line; not used by C,
198 but by every other language. */
199
200 char *curfile; /* current input file name */
201 char *tagfile; /* output file */
202 char *progname; /* name this program was invoked with */
203 char *cwd; /* current working directory */
204 char *tagfiledir; /* directory of tagfile */
205
206 FILE *tagf; /* ioptr for tags file */
207 NODE *head; /* the head of the binary tree of tags */
208
209 /*
210 * A `struct linebuffer' is a structure which holds a line of text.
211 * `readline' reads a line from a stream into a linebuffer and works
212 * regardless of the length of the line.
213 */
214 struct linebuffer
215 {
216 long size;
217 char *buffer;
218 };
219
220 struct linebuffer lb; /* the current line */
221 struct
222 {
223 long linepos;
224 struct linebuffer lb; /* used by C_entries instead of lb */
225 } lbs[2];
226
227 /* boolean "functions" (see init) */
228 logical _wht[0177], _etk[0177], _itk[0177], _btk[0177];
229 char
230 *white = " \f\t\n\013", /* white chars */
231 *endtk = " \t\n\013\"'#()[]{}=-+%*/&|^~!<>;,.:?", /* token ending chars */
232 /* token starting chars */
233 *begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~",
234 /* valid in-token chars */
235 *intk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
236
237 logical append_to_tagfile; /* -a: append to tags */
238 /* The following three default to TRUE for etags, but to FALSE for ctags. */
239 logical typedefs; /* -t: create tags for typedefs */
240 logical typedefs_and_cplusplus; /* -T: create tags for typedefs, level */
241 /* 0 struct/enum/union decls, and C++ */
242 /* member functions. */
243 logical constantypedefs; /* -d: create tags for C #define and enum */
244 /* constants. Enum consts not implemented. */
245 /* -D: opposite of -d. Default under ctags. */
246 logical update; /* -u: update tags */
247 logical vgrind_style; /* -v: create vgrind style index output */
248 logical no_warnings; /* -w: suppress warnings */
249 logical cxref_style; /* -x: create cxref style output */
250 logical cplusplus; /* .[hc] means C++, not C */
251 logical noindentypedefs; /* -I: ignore indentation in C */
252 #define permit_duplicates TRUE /* allow duplicate tags */
253
254 struct option longopts[] =
255 {
256 { "append", no_argument, NULL, 'a' },
257 { "backward-search", no_argument, NULL, 'B' },
258 { "c++", no_argument, NULL, 'C' },
259 { "cxref", no_argument, NULL, 'x' },
260 { "defines", no_argument, NULL, 'd' },
261 { "help", no_argument, NULL, 'h' },
262 { "help", no_argument, NULL, 'H' },
263 { "ignore-indentation", no_argument, NULL, 'I' },
264 { "include", required_argument, NULL, 'i' },
265 { "language", required_argument, NULL, 'l' },
266 { "no-defines", no_argument, NULL, 'D' },
267 { "no-regex", no_argument, NULL, 'R' },
268 { "no-warn", no_argument, NULL, 'w' },
269 { "output", required_argument, NULL, 'o' },
270 { "regex", required_argument, NULL, 'r' },
271 { "typedefs", no_argument, NULL, 't' },
272 { "typedefs-and-c++", no_argument, NULL, 'T' },
273 { "update", no_argument, NULL, 'u' },
274 { "version", no_argument, NULL, 'V' },
275 { "vgrind", no_argument, NULL, 'v' },
276 { 0 }
277 };
278
279 #ifdef ETAGS_REGEXPS
280 /* Structure defining a regular expression. Elements are
281 the compiled pattern, and the name string. */
282 struct pattern
283 {
284 struct re_pattern_buffer *pattern;
285 struct re_registers regs;
286 char *name_pattern;
287 logical error_signaled;
288 };
289
290 /* Number of regexps found. */
291 int num_patterns = 0;
292
293 /* Array of all regexps. */
294 struct pattern *patterns = NULL;
295 #endif /* ETAGS_REGEXPS */
296
297 /* Language stuff. */
298 struct lang_entry
299 {
300 char *extension;
301 Lang_function *function;
302 };
303
304 /* Table of language names and corresponding functions. */
305 /* It is ok for a given function to be listed under more than one
306 name. I just didn't. */
307 /* "auto" language reverts to default behavior. */
308 struct lang_entry lang_names[] =
309 {
310 { "asm", Asm_labels },
311 { "c", default_C_entries },
312 { "c++", Cplusplus_entries },
313 { "c*", Cstar_entries },
314 { "fortran", Fortran_functions },
315 { "lisp", Lisp_functions },
316 { "none", just_read_file },
317 { "pascal", Pascal_functions },
318 { "scheme" , Scheme_functions },
319 { "tex", TeX_functions },
320 { "auto", NULL },
321 { NULL, NULL }
322 };
323
324 /* Table of file extensions and corresponding language functions. */
325 struct lang_entry lang_extensions[] =
326 {
327 /* Assume that ".s" or ".a" is assembly code. -wolfgang.
328 Or even ".sa". */
329 { "a", Asm_labels }, /* Unix assembler */
330 { "asm", Asm_labels }, /* Microcontroller assembly */
331 { "def", Asm_labels }, /* BSO/Tasking definition includes */
332 { "inc", Asm_labels }, /* Microcontroller include files */
333 { "ins", Asm_labels }, /* Microcontroller include files */
334 { "s", Asm_labels },
335 { "sa", Asm_labels }, /* Unix assembler */
336 { "src", Asm_labels }, /* BSO/Tasking C compiler output */
337
338 /* .aux, .bbl, .clo, .cls, .dtx or .tex implies LaTeX source code. */
339 { "aux", TeX_functions },
340 { "bbl", TeX_functions },
341 { "clo", TeX_functions },
342 { "cls", TeX_functions },
343 { "dtx", TeX_functions },
344 { "sty", TeX_functions },
345 { "tex", TeX_functions },
346
347 /* .l or .el or .lisp (or .cl or .clisp or ...) implies lisp source code */
348 { "cl", Lisp_functions },
349 { "clisp", Lisp_functions },
350 { "el", Lisp_functions },
351 { "l", Lisp_functions },
352 { "lisp", Lisp_functions },
353 { "lsp", Lisp_functions },
354
355 /* .scm or .sm or .scheme implies scheme source code */
356 { "SCM", Scheme_functions },
357 { "SM", Scheme_functions },
358 { "oak", Scheme_functions },
359 { "sch", Scheme_functions },
360 { "scheme", Scheme_functions },
361 { "scm", Scheme_functions },
362 { "sm", Scheme_functions },
363 { "t", Scheme_functions },
364 /* FIXME Can't do the `SCM' or `scm' prefix with a version number */
365
366 /* Note that ".c" and ".h" can be considered C++, if the --c++
367 flag was given. That is why default_C_entries is called here. */
368 { "c", default_C_entries },
369 { "h", default_C_entries },
370
371 /* .C or .H or .cpp or .cxx or .hxx or .hh or .cc or .cpp: a C++ file */
372 { "C", Cplusplus_entries },
373 { "H", Cplusplus_entries },
374 { "cc", Cplusplus_entries },
375 { "cpp", Cplusplus_entries },
376 { "cxx", Cplusplus_entries },
377 { "hh", Cplusplus_entries },
378 { "hxx", Cplusplus_entries },
379
380 /* .y: a yacc file */
381 { "y", Yacc_entries },
382
383 /* .cs or .hs: a C* file */
384 { "cs", Cstar_entries },
385 { "hs", Cstar_entries },
386
387 /* .f and .for are FORTRAN. */
388 { "F", Fortran_functions },
389 { "f", Fortran_functions },
390 { "for", Fortran_functions },
391
392 /* .pl implies prolog source code */
393 { "pl", Prolog_functions },
394
395 /* .p or .pas: a Pascal file */
396 { "p", Pascal_functions },
397 { "pas", Pascal_functions },
398
399 { NULL, NULL }
400 };
401
402 /* Non-NULL if language fixed. */
403 Lang_function *lang_func = NULL;
404
405 \f
406 void
407 print_language_names ()
408 {
409 struct lang_entry *name, *ext;
410
411 puts ("\nThese are the currently supported languages, along with the\n\
412 default extensions for files:");
413 for (name = lang_names; name->extension; ++name)
414 {
415 printf ("\t%s\t", name->extension);
416 for (ext = lang_extensions; ext->extension; ++ext)
417 if (name->function == ext->function)
418 printf (" .%s", ext->extension);
419 puts ("");
420 }
421 puts ("Where `auto' means use default language for files based on filename\n\
422 extension, and `none' means only do regexp processing on files.\n\
423 If no language is specified and no extension is found for some file,\n\
424 Fortran is tried first; if no tags are found, C is tried next.");
425 }
426
427 void
428 print_version ()
429 {
430 #ifdef VERSION
431 printf ("%s for Emacs version %s.\n", (CTAGS) ? "CTAGS" : "ETAGS", VERSION);
432 #else
433 printf ("%s for Emacs version 19.\n", (CTAGS) ? "CTAGS" : "ETAGS");
434 #endif
435
436 exit (GOOD);
437 }
438
439 void
440 print_help ()
441 {
442 printf ("These are the options accepted by %s. You may use unambiguous\n\
443 abbreviations for the long option names. A - as file name means read\n\
444 names from stdin.\n\n", progname);
445
446 puts ("-a, --append\n\
447 Append tag entries to existing tags file.");
448
449 if (CTAGS)
450 puts ("-B, --backward-search\n\
451 Write the search commands for the tag entries using '?', the\n\
452 backward-search command instead of '/', the forward-search command.");
453
454 puts ("-C, --c++\n\
455 Treat files whose extension defaults to C language as C++ files.");
456
457 if (CTAGS)
458 puts ("-d, --defines\n\
459 Create tag entries for constant C #defines, too.");
460 else
461 puts ("-D, --no-defines\n\
462 Don't create tag entries for constant C #defines. This makes\n\
463 the tags file smaller.");
464
465 if (!CTAGS)
466 {
467 puts ("-i FILE, --include=FILE\n\
468 Include a note in tag file indicating that, when searching for\n\
469 a tag, one should also consult the tags file FILE after\n\
470 checking the current file.");
471 puts ("-l LANG, --language=LANG\n\
472 Force the following files to be considered as written in the\n\
473 named language up to the next --language=LANG option.");
474 }
475
476 #ifdef ETAGS_REGEXPS
477 puts ("-r /REGEXP/, --regex=/REGEXP/\n\
478 Make a tag for each line matching pattern REGEXP in the\n\
479 following files. REGEXP is anchored (as if preceded by ^).\n\
480 The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
481 named tags can be created with:\n\
482 --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
483 puts ("-R, --no-regex\n\
484 Don't create tags from regexps for the following files.");
485 #endif /* ETAGS_REGEXPS */
486 puts ("-o FILE, --output=FILE\n\
487 Write the tags to FILE.");
488 puts ("-I, --ignore-indentation\n\
489 Don't rely on indentation quite as much as normal. Currently,\n\
490 this means not to assume that a closing brace in the first\n\
491 column is the final brace of a function or structure\n\
492 definition in C and C++.");
493
494 if (CTAGS)
495 {
496 puts ("-t, --typedefs\n\
497 Generate tag entries for C typedefs.");
498 puts ("-T, --typedefs-and-c++\n\
499 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
500 and C++ member functions.");
501 puts ("-u, --update\n\
502 Update the tag entries for the given files, leaving tag\n\
503 entries for other files in place. Currently, this is\n\
504 implemented by deleting the existing entries for the given\n\
505 files and then rewriting the new entries at the end of the\n\
506 tags file. It is often faster to simply rebuild the entire\n\
507 tag file than to use this.");
508 puts ("-v, --vgrind\n\
509 Generates an index of items intended for human consumption,\n\
510 similar to the output of vgrind. The index is sorted, and\n\
511 gives the page number of each item.");
512 puts ("-w, --no-warn\n\
513 Suppress warning messages about entries defined in multiple\n\
514 files.");
515 puts ("-x, --cxref\n\
516 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
517 The output uses line numbers instead of page numbers, but\n\
518 beyond that the differences are cosmetic; try both to see\n\
519 which you like.");
520 }
521
522 puts ("-V, --version\n\
523 Print the version of the program.\n\
524 -h, --help\n\
525 Print this help message.");
526
527 print_language_names ();
528
529 exit (GOOD);
530 }
531
532 \f
533 enum argument_type
534 {
535 at_language,
536 at_regexp,
537 at_filename
538 };
539
540 /* This structure helps us allow mixing of --lang and filenames. */
541 typedef struct
542 {
543 enum argument_type arg_type;
544 char *what;
545 Lang_function *function;
546 } ARGUMENT;
547
548 #ifdef VMS /* VMS specific functions */
549
550 #define EOS '\0'
551
552 /* This is a BUG! ANY arbitrary limit is a BUG!
553 Won't someone please fix this? */
554 #define MAX_FILE_SPEC_LEN 255
555 typedef struct {
556 short curlen;
557 char body[MAX_FILE_SPEC_LEN + 1];
558 } vspec;
559
560 /*
561 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
562 returning in each successive call the next filename matching the input
563 spec. The function expects that each in_spec passed
564 to it will be processed to completion; in particular, up to and
565 including the call following that in which the last matching name
566 is returned, the function ignores the value of in_spec, and will
567 only start processing a new spec with the following call.
568 If an error occurs, on return out_spec contains the value
569 of in_spec when the error occurred.
570
571 With each successive filename returned in out_spec, the
572 function's return value is one. When there are no more matching
573 names the function returns zero. If on the first call no file
574 matches in_spec, or there is any other error, -1 is returned.
575 */
576
577 #include <rmsdef.h>
578 #include <descrip.h>
579 #define OUTSIZE MAX_FILE_SPEC_LEN
580 short
581 fn_exp (out, in)
582 vspec *out;
583 char *in;
584 {
585 static long context = 0;
586 static struct dsc$descriptor_s o;
587 static struct dsc$descriptor_s i;
588 static logical pass1 = TRUE;
589 long status;
590 short retval;
591
592 if (pass1)
593 {
594 pass1 = FALSE;
595 o.dsc$a_pointer = (char *) out;
596 o.dsc$w_length = (short)OUTSIZE;
597 i.dsc$a_pointer = in;
598 i.dsc$w_length = (short)strlen(in);
599 i.dsc$b_dtype = DSC$K_DTYPE_T;
600 i.dsc$b_class = DSC$K_CLASS_S;
601 o.dsc$b_dtype = DSC$K_DTYPE_VT;
602 o.dsc$b_class = DSC$K_CLASS_VS;
603 }
604 if ((status = lib$find_file(&i, &o, &context, 0, 0)) == RMS$_NORMAL)
605 {
606 out->body[out->curlen] = EOS;
607 return 1;
608 }
609 else if (status == RMS$_NMF)
610 retval = 0;
611 else
612 {
613 strcpy(out->body, in);
614 retval = -1;
615 }
616 lib$find_file_end(&context);
617 pass1 = TRUE;
618 return retval;
619 }
620
621 /*
622 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
623 name of each file specified by the provided arg expanding wildcards.
624 */
625 char *
626 gfnames (arg, p_error)
627 char *arg;
628 logical *p_error;
629 {
630 static vspec filename = {MAX_FILE_SPEC_LEN, "\0"};
631
632 switch (fn_exp (&filename, arg))
633 {
634 case 1:
635 *p_error = FALSE;
636 return filename.body;
637 case 0:
638 *p_error = FALSE;
639 return NULL;
640 default:
641 *p_error = TRUE;
642 return filename.body;
643 }
644 }
645
646 #ifndef OLD /* Newer versions of VMS do provide `system'. */
647 system (cmd)
648 char *cmd;
649 {
650 fprintf (stderr, "system() function not implemented under VMS\n");
651 }
652 #endif
653
654 #define VERSION_DELIM ';'
655 char *massage_name (s)
656 char *s;
657 {
658 char *start = s;
659
660 for ( ; *s; s++)
661 if (*s == VERSION_DELIM)
662 {
663 *s = EOS;
664 break;
665 }
666 else
667 *s = tolower(*s);
668 return start;
669 }
670 #endif /* VMS */
671
672 \f
673 void
674 main (argc, argv)
675 int argc;
676 char *argv[];
677 {
678 int i;
679 unsigned int nincluded_files = 0;
680 char **included_files = xnew (argc, char *);
681 char *this_file;
682 ARGUMENT *argbuffer;
683 int current_arg = 0, file_count = 0;
684 struct linebuffer filename_lb;
685 #ifdef VMS
686 logical got_err;
687 #endif
688
689 #ifdef DOS_NT
690 _fmode = O_BINARY; /* all of files are treated as binary files */
691 #endif /* DOS_NT */
692
693 progname = argv[0];
694
695 /* Allocate enough no matter what happens. Overkill, but each one
696 is small. */
697 argbuffer = xnew (argc, ARGUMENT);
698
699 #ifdef ETAGS_REGEXPS
700 /* Set syntax for regular expression routines. */
701 re_set_syntax (RE_SYNTAX_EMACS);
702 #endif /* ETAGS_REGEXPS */
703
704 /*
705 * If etags, always find typedefs and structure tags. Why not?
706 * Also default is to find macro constants.
707 */
708 if (!CTAGS)
709 typedefs = typedefs_and_cplusplus = constantypedefs = TRUE;
710
711 while (1)
712 {
713 int opt = getopt_long (argc, argv,
714 "-aCdDf:Il:o:r:RStTi:BuvxwVhH", longopts, 0);
715
716 if (opt == EOF)
717 break;
718
719 switch (opt)
720 {
721 case 0:
722 /* If getopt returns 0, then it has already processed a
723 long-named option. We should do nothing. */
724 break;
725
726 case 1:
727 /* This means that a filename has been seen. Record it. */
728 argbuffer[current_arg].arg_type = at_filename;
729 argbuffer[current_arg].what = optarg;
730 ++current_arg;
731 ++file_count;
732 break;
733
734 /* Common options. */
735 case 'a':
736 append_to_tagfile = TRUE;
737 break;
738 case 'C':
739 cplusplus = TRUE;
740 break;
741 case 'd':
742 constantypedefs = TRUE;
743 break;
744 case 'D':
745 constantypedefs = FALSE;
746 break;
747 case 'f': /* for compatibility with old makefiles */
748 case 'o':
749 if (tagfile)
750 {
751 fprintf (stderr, "%s: -%c option may only be given once.\n",
752 progname, opt);
753 goto usage;
754 }
755 tagfile = optarg;
756 break;
757 case 'I':
758 case 'S': /* for backward compatibility */
759 noindentypedefs = TRUE;
760 break;
761 case 'l':
762 if (!get_language (optarg, &argbuffer[current_arg].function))
763 {
764 fprintf (stderr, "%s: language \"%s\" not recognized.\n",
765 progname, optarg);
766 goto usage;
767 }
768 argbuffer[current_arg].arg_type = at_language;
769 ++current_arg;
770 break;
771 #ifdef ETAGS_REGEXPS
772 case 'r':
773 argbuffer[current_arg].arg_type = at_regexp;
774 argbuffer[current_arg].what = optarg;
775 ++current_arg;
776 break;
777 case 'R':
778 argbuffer[current_arg].arg_type = at_regexp;
779 argbuffer[current_arg].what = NULL;
780 ++current_arg;
781 break;
782 #endif /* ETAGS_REGEXPS */
783 case 'V':
784 print_version ();
785 break;
786 case 'h':
787 case 'H':
788 print_help ();
789 break;
790 case 't':
791 typedefs = TRUE;
792 break;
793 case 'T':
794 typedefs = typedefs_and_cplusplus = TRUE;
795 break;
796 #if (!CTAGS)
797 /* Etags options */
798 case 'i':
799 included_files[nincluded_files++] = optarg;
800 break;
801 #else /* CTAGS */
802 /* Ctags options. */
803 case 'B':
804 searchar = '?';
805 break;
806 case 'u':
807 update = TRUE;
808 break;
809 case 'v':
810 vgrind_style = TRUE;
811 /*FALLTHRU*/
812 case 'x':
813 cxref_style = TRUE;
814 break;
815 case 'w':
816 no_warnings = TRUE;
817 break;
818 #endif /* CTAGS */
819 default:
820 goto usage;
821 }
822 }
823
824 for (; optind < argc; ++optind)
825 {
826 argbuffer[current_arg].arg_type = at_filename;
827 argbuffer[current_arg].what = argv[optind];
828 ++current_arg;
829 ++file_count;
830 }
831
832 if (nincluded_files == 0 && file_count == 0)
833 {
834 fprintf (stderr, "%s: No input files specified.\n", progname);
835
836 usage:
837 fprintf (stderr, "\tTry `%s --help' for a complete list of options.\n",
838 progname);
839 exit (BAD);
840 }
841
842 if (tagfile == NULL)
843 {
844 tagfile = CTAGS ? "tags" : "TAGS";
845 }
846 cwd = etags_getcwd (); /* the current working directory */
847 strcat (cwd, "/");
848 if (streq (tagfile, "-"))
849 {
850 tagfiledir = cwd;
851 }
852 else
853 {
854 tagfiledir = absolute_dirname (tagfile, cwd);
855 }
856
857 init (); /* set up boolean "functions" */
858
859 initbuffer (&lb);
860 initbuffer (&lbs[0].lb);
861 initbuffer (&lbs[1].lb);
862 initbuffer (&filename_lb);
863
864 if (!CTAGS)
865 {
866 if (streq (tagfile, "-"))
867 tagf = stdout;
868 else
869 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
870 if (tagf == NULL)
871 pfatal (tagfile);
872 }
873
874 /*
875 * Loop through files finding functions.
876 */
877 for (i = 0; i < current_arg; ++i)
878 {
879 switch (argbuffer[i].arg_type)
880 {
881 case at_language:
882 lang_func = argbuffer[i].function;
883 break;
884 #ifdef ETAGS_REGEXPS
885 case at_regexp:
886 add_regex (argbuffer[i].what);
887 break;
888 #endif
889 case at_filename:
890 #ifdef VMS
891 while ((this_file = gfnames (argbuffer[i].what, &got_err)) != NULL)
892 {
893 if (got_err)
894 {
895 error ("Can't find file %s\n", this_file);
896 argc--, argv++;
897 }
898 else
899 {
900 this_file = massage_name (this_file);
901 }
902 #else
903 this_file = argbuffer[i].what;
904 #endif
905 /* Input file named "-" means read file names from stdin
906 and use them. */
907 if (streq (this_file, "-"))
908 {
909 while (!feof (stdin))
910 {
911 (void) readline_internal (&filename_lb, stdin);
912 if (strlen (filename_lb.buffer) > 0)
913 process_file (filename_lb.buffer);
914 }
915 }
916 else
917 process_file (this_file);
918 #ifdef VMS
919 }
920 #endif
921 break;
922 }
923 }
924
925 if (!CTAGS)
926 {
927 while (nincluded_files-- > 0)
928 fprintf (tagf, "\f\n%s,include\n", *included_files++);
929
930 fclose (tagf);
931 exit (GOOD);
932 }
933
934 /* If CTAGS, we are here. process_file did not write the tags yet,
935 because we want them ordered. Let's do it now. */
936 if (cxref_style)
937 {
938 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
939 if (tagf == NULL)
940 pfatal (tagfile);
941 put_entries (head);
942 exit (GOOD);
943 }
944
945 if (update)
946 {
947 char cmd[BUFSIZ];
948 for (i = 0; i < current_arg; ++i)
949 {
950 if (argbuffer[i].arg_type != at_filename)
951 continue;
952 sprintf (cmd,
953 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
954 tagfile, argbuffer[i].what, tagfile);
955 if (system (cmd) != GOOD)
956 fatal ("failed to execute shell command");
957 }
958 append_to_tagfile = TRUE;
959 }
960
961 tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
962 if (tagf == NULL)
963 pfatal (tagfile);
964 put_entries (head);
965 fclose (tagf);
966
967 if (update)
968 {
969 char cmd[BUFSIZ];
970 sprintf (cmd, "sort %s -o %s", tagfile, tagfile);
971 exit (system (cmd));
972 }
973 exit (GOOD);
974 }
975
976
977 /*
978 * Set the language, given the name.
979 */
980 logical
981 get_language (language, func)
982 char *language;
983 Lang_function **func;
984 {
985 struct lang_entry *lang;
986
987 for (lang = lang_names; lang->extension; ++lang)
988 {
989 if (streq (language, lang->extension))
990 {
991 *func = lang->function;
992 return TRUE;
993 }
994 }
995
996 return FALSE;
997 }
998
999
1000 /*
1001 * This routine is called on each file argument.
1002 */
1003 void
1004 process_file (file)
1005 char *file;
1006 {
1007 struct stat stat_buf;
1008 FILE *inf;
1009
1010 if (stat (file, &stat_buf) == 0 && !S_ISREG (stat_buf.st_mode))
1011 {
1012 fprintf (stderr, "Skipping %s: it is not a regular file.\n", file);
1013 return;
1014 }
1015 if (streq (file, tagfile) && !streq (tagfile, "-"))
1016 {
1017 fprintf (stderr, "Skipping inclusion of %s in self.\n", file);
1018 return;
1019 }
1020 inf = fopen (file, "r");
1021 if (inf == NULL)
1022 {
1023 perror (file);
1024 return;
1025 }
1026
1027 find_entries (file, inf);
1028
1029 if (!CTAGS)
1030 {
1031 char *filename;
1032
1033 if (file[0] == '/')
1034 {
1035 /* file is an absolute filename. Canonicalise it. */
1036 filename = absolute_filename (file, cwd);
1037 }
1038 else
1039 {
1040 /* file is a filename relative to cwd. Make it relative
1041 to the directory of the tags file. */
1042 filename = relative_filename (file, tagfiledir);
1043 }
1044 fprintf (tagf, "\f\n%s,%d\n", filename, total_size_of_entries (head));
1045 put_entries (head);
1046 free_tree (head);
1047 head = NULL;
1048 }
1049 }
1050
1051 /*
1052 * This routine sets up the boolean pseudo-functions which work
1053 * by setting boolean flags dependent upon the corresponding character
1054 * Every char which is NOT in that string is not a white char. Therefore,
1055 * all of the array "_wht" is set to FALSE, and then the elements
1056 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
1057 * of a char is TRUE if it is the string "white", else FALSE.
1058 */
1059 void
1060 init ()
1061 {
1062 register char *sp;
1063 register int i;
1064
1065 for (i = 0; i < 0177; i++)
1066 _wht[i] = _etk[i] = _itk[i] = _btk[i] = FALSE;
1067 for (sp = white; *sp; sp++)
1068 _wht[*sp] = TRUE;
1069 for (sp = endtk; *sp; sp++)
1070 _etk[*sp] = TRUE;
1071 for (sp = intk; *sp; sp++)
1072 _itk[*sp] = TRUE;
1073 for (sp = begtk; *sp; sp++)
1074 _btk[*sp] = TRUE;
1075 _wht[0] = _wht['\n'];
1076 _etk[0] = _etk['\n'];
1077 _btk[0] = _btk['\n'];
1078 _itk[0] = _itk['\n'];
1079 }
1080
1081 /*
1082 * This routine opens the specified file and calls the function
1083 * which finds the function and type definitions.
1084 */
1085 void
1086 find_entries (file, inf)
1087 char *file;
1088 FILE *inf;
1089 {
1090 char *cp;
1091 struct lang_entry *lang;
1092 NODE *old_last_node;
1093 extern NODE *last_node;
1094
1095 curfile = savestr (file);
1096 cp = etags_strrchr (file, '.');
1097
1098 /* If user specified a language, use it. */
1099 if (lang_func != NULL)
1100 {
1101 lang_func (inf);
1102 fclose (inf);
1103 return;
1104 }
1105
1106 if (cp)
1107 {
1108 ++cp;
1109 for (lang = lang_extensions; lang->extension; ++lang)
1110 {
1111 if (streq (cp, lang->extension))
1112 {
1113 lang->function (inf);
1114 fclose (inf);
1115 return;
1116 }
1117 }
1118 }
1119
1120 /* Try Fortran. */
1121 old_last_node = last_node;
1122 Fortran_functions (inf);
1123
1124 /* No Fortran entries found. Try C. */
1125 if (old_last_node == last_node)
1126 default_C_entries (inf);
1127 fclose (inf);
1128 }
1129 \f
1130 /* Record a tag. */
1131 /* Should take a TOKEN* instead!! */
1132 void
1133 pfnote (name, is_func, named, linestart, linelen, lno, cno)
1134 char *name; /* tag name */
1135 logical is_func; /* tag is a function */
1136 logical named; /* tag different from text of definition */
1137 char *linestart; /* start of the line where tag is */
1138 int linelen; /* length of the line where tag is */
1139 int lno; /* line number */
1140 long cno; /* character number */
1141 {
1142 register NODE *np = xnew (1, NODE);
1143 register char *fp;
1144
1145 /* If ctags mode, change name "main" to M<thisfilename>. */
1146 if (CTAGS && !cxref_style && streq (name, "main"))
1147 {
1148 fp = etags_strrchr (curfile, '/');
1149 np->name = concat ("M", fp == 0 ? curfile : fp + 1, "");
1150 fp = etags_strrchr (np->name, '.');
1151 if (fp && fp[1] != '\0' && fp[2] == '\0')
1152 fp[0] = 0;
1153 np->named = TRUE;
1154 }
1155 else
1156 {
1157 np->name = name;
1158 np->named = named;
1159 }
1160 np->been_warned = FALSE;
1161 np->file = curfile;
1162 np->is_func = is_func;
1163 np->lno = lno;
1164 /* Our char numbers are 0-base, because of C language tradition?
1165 ctags compatibility? old versions compatibility? I don't know.
1166 Anyway, since emacs's are 1-base we espect etags.el to take care
1167 of the difference. If we wanted to have 1-based numbers, we would
1168 uncomment the +1 below. */
1169 np->cno = cno /* + 1 */ ;
1170 np->left = np->right = NULL;
1171 np->pat = savenstr (linestart, ((CTAGS && !cxref_style) ? 50 : linelen));
1172
1173 add_node (np, &head);
1174 }
1175
1176 /*
1177 * free_tree ()
1178 * recurse on left children, iterate on right children.
1179 */
1180 void
1181 free_tree (node)
1182 register NODE *node;
1183 {
1184 while (node)
1185 {
1186 register NODE *node_right = node->right;
1187 free_tree (node->left);
1188 if (node->named)
1189 free (node->name);
1190 free (node->pat);
1191 free ((char *) node);
1192 node = node_right;
1193 }
1194 }
1195
1196 /*
1197 * add_node ()
1198 * Adds a node to the tree of nodes. In etags mode, we don't keep
1199 * it sorted; we just keep a linear list. In ctags mode, maintain
1200 * an ordered tree, with no attempt at balancing.
1201 *
1202 * add_node is the only function allowed to add nodes, so it can
1203 * maintain state.
1204 */
1205 NODE *last_node = NULL;
1206 void
1207 add_node (node, cur_node_p)
1208 NODE *node, **cur_node_p;
1209 {
1210 register int dif;
1211 register NODE *cur_node = *cur_node_p;
1212
1213 if (cur_node == NULL)
1214 {
1215 *cur_node_p = node;
1216 last_node = node;
1217 return;
1218 }
1219
1220 if (!CTAGS)
1221 {
1222 /* Etags Mode */
1223 if (last_node == NULL)
1224 fatal ("internal error in add_node", 0);
1225 last_node->right = node;
1226 last_node = node;
1227 }
1228 else
1229 {
1230 /* Ctags Mode */
1231 dif = strcmp (node->name, cur_node->name);
1232
1233 /*
1234 * If this tag name matches an existing one, then
1235 * do not add the node, but maybe print a warning.
1236 */
1237 if (!dif)
1238 {
1239 if (node->file == cur_node->file)
1240 {
1241 if (!no_warnings)
1242 {
1243 fprintf (stderr, "Duplicate entry in file %s, line %d: %s\n",
1244 node->file, lineno, node->name);
1245 fprintf (stderr, "Second entry ignored\n");
1246 }
1247 return;
1248 }
1249 if (!cur_node->been_warned && !no_warnings)
1250 {
1251 fprintf (stderr,
1252 "Duplicate entry in files %s and %s: %s (Warning only)\n",
1253 node->file, cur_node->file, node->name);
1254 }
1255 cur_node->been_warned = TRUE;
1256 return;
1257 }
1258
1259 /* Maybe refuse to add duplicate nodes. */
1260 if (!permit_duplicates)
1261 {
1262 if (streq (node->name, cur_node->name)
1263 && streq (node->file, cur_node->file))
1264 return;
1265 }
1266
1267 /* Actually add the node */
1268 add_node (node, dif < 0 ? &cur_node->left : &cur_node->right);
1269 }
1270 }
1271 \f
1272 void
1273 put_entries (node)
1274 register NODE *node;
1275 {
1276 register char *sp;
1277
1278 if (node == NULL)
1279 return;
1280
1281 /* Output subentries that precede this one */
1282 put_entries (node->left);
1283
1284 /* Output this entry */
1285
1286 if (!CTAGS)
1287 {
1288 if (node->named)
1289 {
1290 fprintf (tagf, "%s\177%s\001%d,%d\n",
1291 node->pat, node->name,
1292 node->lno, node->cno);
1293 }
1294 else
1295 {
1296 fprintf (tagf, "%s\177%d,%d\n",
1297 node->pat,
1298 node->lno, node->cno);
1299 }
1300 }
1301 else if (!cxref_style)
1302 {
1303 fprintf (tagf, "%s\t%s\t",
1304 node->name, node->file);
1305
1306 if (node->is_func)
1307 { /* a function */
1308 putc (searchar, tagf);
1309 putc ('^', tagf);
1310
1311 for (sp = node->pat; *sp; sp++)
1312 {
1313 if (*sp == '\\' || *sp == searchar)
1314 putc ('\\', tagf);
1315 putc (*sp, tagf);
1316 }
1317 putc (searchar, tagf);
1318 }
1319 else
1320 { /* a typedef; text pattern inadequate */
1321 fprintf (tagf, "%d", node->lno);
1322 }
1323 putc ('\n', tagf);
1324 }
1325 else if (vgrind_style)
1326 fprintf (stdout, "%s %s %d\n",
1327 node->name, node->file, (node->lno + 63) / 64);
1328 else
1329 fprintf (stdout, "%-16s %3d %-16s %s\n",
1330 node->name, node->lno, node->file, node->pat);
1331
1332 /* Output subentries that follow this one */
1333 put_entries (node->right);
1334 }
1335
1336 /* Length of a number's decimal representation. */
1337 int
1338 number_len (num)
1339 long num;
1340 {
1341 int len = 0;
1342 if (!num)
1343 return 1;
1344 for (; num; num /= 10)
1345 ++len;
1346 return len;
1347 }
1348
1349 /*
1350 * Return total number of characters that put_entries will output for
1351 * the nodes in the subtree of the specified node. Works only if
1352 * we are not ctags, but called only in that case. This count
1353 * is irrelevant with the new tags.el, but is still supplied for
1354 * backward compatibility.
1355 */
1356 int
1357 total_size_of_entries (node)
1358 register NODE *node;
1359 {
1360 register int total;
1361
1362 if (node == NULL)
1363 return 0;
1364
1365 total = 0;
1366 for (; node; node = node->right)
1367 {
1368 /* Count left subentries. */
1369 total += total_size_of_entries (node->left);
1370
1371 /* Count this entry */
1372 total += strlen (node->pat) + 1;
1373 total += number_len ((long) node->lno) + 1 + number_len (node->cno) + 1;
1374 if (node->named)
1375 total += 1 + strlen (node->name); /* \001name */
1376 }
1377
1378 return total;
1379 }
1380 \f
1381 /*
1382 * The C symbol tables.
1383 */
1384 enum sym_type
1385 {
1386 st_none, st_C_struct, st_C_enum, st_C_define, st_C_typedef, st_C_typespec
1387 };
1388
1389 /* Feed stuff between (but not including) %[ and %] lines to:
1390 gperf -c -k1,3 -o -p -r -t
1391 %[
1392 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
1393 %%
1394 class, C_PLPL, st_C_struct
1395 domain, C_STAR, st_C_struct
1396 union, 0, st_C_struct
1397 struct, 0, st_C_struct
1398 enum, 0, st_C_enum
1399 typedef, 0, st_C_typedef
1400 define, 0, st_C_define
1401 long, 0, st_C_typespec
1402 short, 0, st_C_typespec
1403 int, 0, st_C_typespec
1404 char, 0, st_C_typespec
1405 float, 0, st_C_typespec
1406 double, 0, st_C_typespec
1407 signed, 0, st_C_typespec
1408 unsigned, 0, st_C_typespec
1409 auto, 0, st_C_typespec
1410 void, 0, st_C_typespec
1411 extern, 0, st_C_typespec
1412 static, 0, st_C_typespec
1413 const, 0, st_C_typespec
1414 volatile, 0, st_C_typespec
1415 %]
1416 and replace lines between %< and %> with its output. */
1417 /*%<*/
1418 /* C code produced by gperf version 1.8.1 (K&R C version) */
1419 /* Command-line: gperf -c -k1,3 -o -p -r -t */
1420
1421
1422 struct C_stab_entry { char *name; int c_ext; enum sym_type type; };
1423
1424 #define MIN_WORD_LENGTH 3
1425 #define MAX_WORD_LENGTH 8
1426 #define MIN_HASH_VALUE 10
1427 #define MAX_HASH_VALUE 62
1428 /*
1429 21 keywords
1430 53 is the maximum key range
1431 */
1432
1433 static int
1434 hash (str, len)
1435 register char *str;
1436 register int len;
1437 {
1438 static unsigned char hash_table[] =
1439 {
1440 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1441 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1442 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1443 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1444 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1445 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1446 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1447 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1448 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1449 62, 62, 62, 62, 62, 62, 62, 2, 62, 7,
1450 6, 9, 15, 30, 62, 24, 62, 62, 1, 24,
1451 7, 27, 13, 62, 19, 26, 18, 27, 1, 62,
1452 62, 62, 62, 62, 62, 62, 62, 62,
1453 };
1454 return len + hash_table[str[2]] + hash_table[str[0]];
1455 }
1456
1457 struct C_stab_entry *
1458 in_word_set (str, len)
1459 register char *str;
1460 register int len;
1461 {
1462
1463 static struct C_stab_entry wordlist[] =
1464 {
1465 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
1466 {"",},
1467 {"volatile", 0, st_C_typespec},
1468 {"",},
1469 {"long", 0, st_C_typespec},
1470 {"char", 0, st_C_typespec},
1471 {"class", C_PLPL, st_C_struct},
1472 {"",}, {"",}, {"",}, {"",},
1473 {"const", 0, st_C_typespec},
1474 {"",}, {"",}, {"",}, {"",},
1475 {"auto", 0, st_C_typespec},
1476 {"",}, {"",},
1477 {"define", 0, st_C_define},
1478 {"",},
1479 {"void", 0, st_C_typespec},
1480 {"",}, {"",}, {"",},
1481 {"extern", 0, st_C_typespec},
1482 {"static", 0, st_C_typespec},
1483 {"",},
1484 {"domain", C_STAR, st_C_struct},
1485 {"",},
1486 {"typedef", 0, st_C_typedef},
1487 {"double", 0, st_C_typespec},
1488 {"enum", 0, st_C_enum},
1489 {"",}, {"",}, {"",}, {"",},
1490 {"int", 0, st_C_typespec},
1491 {"",},
1492 {"float", 0, st_C_typespec},
1493 {"",}, {"",}, {"",},
1494 {"struct", 0, st_C_struct},
1495 {"",}, {"",}, {"",}, {"",},
1496 {"union", 0, st_C_struct},
1497 {"",},
1498 {"short", 0, st_C_typespec},
1499 {"",}, {"",},
1500 {"unsigned", 0, st_C_typespec},
1501 {"signed", 0, st_C_typespec},
1502 };
1503
1504 if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
1505 {
1506 register int key = hash (str, len);
1507
1508 if (key <= MAX_HASH_VALUE && key >= MIN_HASH_VALUE)
1509 {
1510 register char *s = wordlist[key].name;
1511
1512 if (*s == *str && strneq (str + 1, s + 1, len - 1))
1513 return &wordlist[key];
1514 }
1515 }
1516 return 0;
1517 }
1518 /*%>*/
1519
1520 enum sym_type
1521 C_symtype(str, len, c_ext)
1522 char *str;
1523 int len;
1524 int c_ext;
1525 {
1526 register struct C_stab_entry *se = in_word_set(str, len);
1527
1528 if (se == NULL || (se->c_ext && !(c_ext & se->c_ext)))
1529 return st_none;
1530 return se->type;
1531 }
1532 \f
1533 /*
1534 * C functions are recognized using a simple finite automaton.
1535 * funcdef is its state variable.
1536 */
1537 typedef enum
1538 {
1539 fnone, /* nothing seen */
1540 ftagseen, /* function-like tag seen */
1541 fstartlist, /* just after open parenthesis */
1542 finlist, /* in parameter list */
1543 flistseen, /* after parameter list */
1544 fignore /* before open brace */
1545 } FUNCST;
1546 FUNCST funcdef;
1547
1548
1549 /*
1550 * typedefs are recognized using a simple finite automaton.
1551 * typeddef is its state variable.
1552 */
1553 typedef enum
1554 {
1555 tnone, /* nothing seen */
1556 ttypedseen, /* typedef keyword seen */
1557 tinbody, /* inside typedef body */
1558 tend, /* just before typedef tag */
1559 tignore /* junk after typedef tag */
1560 } TYPEDST;
1561 TYPEDST typdef;
1562
1563
1564 /*
1565 * struct-like structures (enum, struct and union) are recognized
1566 * using another simple finite automaton. `structdef' is its state
1567 * variable.
1568 */
1569 typedef enum
1570 {
1571 snone, /* nothing seen yet */
1572 skeyseen, /* struct-like keyword seen */
1573 stagseen, /* struct-like tag seen */
1574 scolonseen, /* colon seen after struct-like tag */
1575 sinbody /* in struct body: recognize member func defs*/
1576 } STRUCTST;
1577 STRUCTST structdef;
1578
1579 /*
1580 * When structdef is stagseen, scolonseen, or sinbody, structtag is the
1581 * struct tag, and structtype is the type of the preceding struct-like
1582 * keyword.
1583 */
1584 char *structtag = "<uninited>";
1585 enum sym_type structtype;
1586
1587 /*
1588 * Yet another little state machine to deal with preprocessor lines.
1589 */
1590 typedef enum
1591 {
1592 dnone, /* nothing seen */
1593 dsharpseen, /* '#' seen as first char on line */
1594 ddefineseen, /* '#' and 'define' seen */
1595 dignorerest /* ignore rest of line */
1596 } DEFINEST;
1597 DEFINEST definedef;
1598
1599 /*
1600 * Set this to TRUE, and the next token considered is called a function.
1601 * Used only for GNU emacs's function-defining macros.
1602 */
1603 logical next_token_is_func;
1604
1605 /*
1606 * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
1607 */
1608 logical yacc_rules;
1609
1610 /*
1611 * consider_token ()
1612 * checks to see if the current token is at the start of a
1613 * function, or corresponds to a typedef, or is a struct/union/enum
1614 * tag.
1615 *
1616 * *IS_FUNC gets TRUE iff the token is a function or macro with args.
1617 * C_EXT is which language we are looking at.
1618 *
1619 * In the future we will need some way to adjust where the end of
1620 * the token is; for instance, implementing the C++ keyword
1621 * `operator' properly will adjust the end of the token to be after
1622 * whatever follows `operator'.
1623 *
1624 * Globals
1625 * funcdef IN OUT
1626 * structdef IN OUT
1627 * definedef IN OUT
1628 * typdef IN OUT
1629 * next_token_is_func IN OUT
1630 */
1631
1632 logical
1633 consider_token (str, len, c, c_ext, cblev, is_func)
1634 register char *str; /* IN: token pointer */
1635 register int len; /* IN: token length */
1636 register char c; /* IN: first char after the token */
1637 int c_ext; /* IN: C extensions mask */
1638 int cblev; /* IN: curly brace level */
1639 logical *is_func; /* OUT: function found */
1640 {
1641 enum sym_type toktype = C_symtype (str, len, c_ext);
1642
1643 /*
1644 * Advance the definedef state machine.
1645 */
1646 switch (definedef)
1647 {
1648 case dnone:
1649 /* We're not on a preprocessor line. */
1650 break;
1651 case dsharpseen:
1652 if (toktype == st_C_define)
1653 {
1654 definedef = ddefineseen;
1655 }
1656 else
1657 {
1658 definedef = dignorerest;
1659 }
1660 return FALSE;
1661 case ddefineseen:
1662 /*
1663 * Make a tag for any macro, unless it is a constant
1664 * and constantypedefs is FALSE.
1665 */
1666 definedef = dignorerest;
1667 *is_func = (c == '(');
1668 if (!*is_func && !constantypedefs)
1669 return FALSE;
1670 else
1671 return TRUE;
1672 case dignorerest:
1673 return FALSE;
1674 default:
1675 error ("internal error: definedef value.", 0);
1676 }
1677
1678 /*
1679 * Now typedefs
1680 */
1681 switch (typdef)
1682 {
1683 case tnone:
1684 if (toktype == st_C_typedef)
1685 {
1686 if (typedefs)
1687 typdef = ttypedseen;
1688 funcdef = fnone;
1689 return FALSE;
1690 }
1691 break;
1692 case ttypedseen:
1693 switch (toktype)
1694 {
1695 case st_none:
1696 case st_C_typespec:
1697 typdef = tend;
1698 break;
1699 case st_C_struct:
1700 case st_C_enum:
1701 break;
1702 }
1703 /* Do not return here, so the structdef stuff has a chance. */
1704 break;
1705 case tend:
1706 switch (toktype)
1707 {
1708 case st_C_typespec:
1709 case st_C_struct:
1710 case st_C_enum:
1711 return FALSE;
1712 }
1713 return TRUE;
1714 }
1715
1716 /*
1717 * This structdef business is currently only invoked when cblev==0.
1718 * It should be recursively invoked whatever the curly brace level,
1719 * and a stack of states kept, to allow for definitions of structs
1720 * within structs.
1721 *
1722 * This structdef business is NOT invoked when we are ctags and the
1723 * file is plain C. This is because a struct tag may have the same
1724 * name as another tag, and this loses with ctags.
1725 *
1726 * This if statement deals with the typdef state machine as
1727 * follows: if typdef==ttypedseen and token is struct/union/class/enum,
1728 * return FALSE. All the other code here is for the structdef
1729 * state machine.
1730 */
1731 switch (toktype)
1732 {
1733 case st_C_struct:
1734 case st_C_enum:
1735 if (typdef == ttypedseen
1736 || (typedefs_and_cplusplus && cblev == 0 && structdef == snone))
1737 {
1738 structdef = skeyseen;
1739 structtype = toktype;
1740 }
1741 return FALSE;
1742 }
1743 if (structdef == skeyseen)
1744 {
1745 /* Save the tag for struct/union/class, for functions that may be
1746 defined inside. */
1747 if (structtype == st_C_struct)
1748 structtag = savenstr (str, len);
1749 else
1750 structtag = "<enum>";
1751 structdef = stagseen;
1752 return TRUE;
1753 }
1754
1755 /* Avoid entering funcdef stuff if typdef is going on. */
1756 if (typdef != tnone)
1757 {
1758 definedef = dnone;
1759 return FALSE;
1760 }
1761
1762 /* Detect GNU macros. */
1763 if (definedef == dnone)
1764 if (strneq (str, "DEFUN", 5) /* Used in emacs */
1765 #if FALSE
1766 These are defined inside C functions, so currently they
1767 are not met anyway.
1768 || strneq (str, "EXFUN", 5) /* Used in glibc */
1769 || strneq (str, "DEFVAR_", 7) /* Used in emacs */
1770 #endif
1771 || strneq (str, "SYSCALL", 7) /* Used in glibc (mach) */
1772 || strneq (str, "ENTRY", 5) /* Used in glibc */
1773 || strneq (str, "PSEUDO", 6)) /* Used in glibc */
1774
1775 {
1776 next_token_is_func = TRUE;
1777 return FALSE;
1778 }
1779 if (next_token_is_func)
1780 {
1781 next_token_is_func = FALSE;
1782 funcdef = fignore;
1783 *is_func = TRUE;
1784 return TRUE;
1785 }
1786
1787 /* A function? */
1788 switch (toktype)
1789 {
1790 case st_C_typespec:
1791 if (funcdef != finlist && funcdef != fignore)
1792 funcdef = fnone; /* should be useless */
1793 return FALSE;
1794 default:
1795 if (funcdef == fnone)
1796 {
1797 funcdef = ftagseen;
1798 *is_func = TRUE;
1799 return TRUE;
1800 }
1801 }
1802
1803 return FALSE;
1804 }
1805
1806 /*
1807 * C_entries ()
1808 * This routine finds functions, typedefs, #define's and
1809 * struct/union/enum definitions in C syntax and adds them
1810 * to the list.
1811 */
1812 typedef struct
1813 {
1814 char *str;
1815 logical named;
1816 int linelen;
1817 int lineno;
1818 } TOKEN;
1819
1820 #define current_lb_is_new (newndx == curndx)
1821 #define switch_line_buffers() (curndx = 1 - curndx)
1822
1823 #define curlb (lbs[curndx].lb)
1824 #define othlb (lbs[1-curndx].lb)
1825 #define newlb (lbs[newndx].lb)
1826 #define curlinepos (lbs[curndx].linepos)
1827 #define othlinepos (lbs[1-curndx].linepos)
1828 #define newlinepos (lbs[newndx].linepos)
1829
1830 #define CNL_SAVE_DEFINEDEF \
1831 do { \
1832 curlinepos = charno; \
1833 lineno++; \
1834 charno += readline (&curlb, inf); \
1835 lp = curlb.buffer; \
1836 quotednl = FALSE; \
1837 newndx = curndx; \
1838 } while (0)
1839
1840 #define CNL \
1841 do { \
1842 CNL_SAVE_DEFINEDEF; \
1843 if (token_saved) \
1844 { \
1845 tok = savetok; \
1846 token_saved = FALSE; \
1847 } \
1848 definedef = dnone; \
1849 } while (0)
1850
1851 #define make_tag_from_new_lb(isfun) pfnote (tok.str, isfun, tok.named, \
1852 newlb.buffer, tok.linelen, tok.lineno, newlinepos)
1853 #define make_tag_from_oth_lb(isfun) pfnote (tok.str, isfun, tok.named, \
1854 othlb.buffer, tok.linelen, tok.lineno, othlinepos)
1855
1856 void
1857 C_entries (c_ext, inf)
1858 int c_ext; /* extension of C */
1859 FILE *inf; /* input file */
1860 {
1861 register char c; /* latest char read; '\0' for end of line */
1862 register char *lp; /* pointer one beyond the character `c' */
1863 int curndx, newndx; /* indices for current and new lb */
1864 TOKEN tok; /* latest token read */
1865 register int tokoff; /* offset in line of start of current token */
1866 register int toklen; /* length of current token */
1867 int cblev; /* current curly brace level */
1868 int parlev; /* current parenthesis level */
1869 logical incomm, inquote, inchar, quotednl, midtoken;
1870 logical cplpl;
1871 logical token_saved; /* token saved */
1872 TOKEN savetok; /* token saved during preprocessor handling */
1873
1874 curndx = newndx = 0;
1875 lineno = 0;
1876 charno = 0;
1877 lp = curlb.buffer;
1878 *lp = 0;
1879
1880 definedef = dnone; funcdef = fnone; typdef = tnone; structdef = snone;
1881 next_token_is_func = yacc_rules = token_saved = FALSE;
1882 midtoken = inquote = inchar = incomm = quotednl = FALSE;
1883 cblev = 0;
1884 parlev = 0;
1885 cplpl = c_ext & C_PLPL;
1886
1887 while (!feof (inf))
1888 {
1889 c = *lp++;
1890 if (c == '\\')
1891 {
1892 /* If we're at the end of the line, the next character is a
1893 '\0'; don't skip it, because it's the thing that tells us
1894 to read the next line. */
1895 if (*lp == '\0')
1896 {
1897 quotednl = TRUE;
1898 continue;
1899 }
1900 lp++;
1901 c = ' ';
1902 }
1903 else if (incomm)
1904 {
1905 switch (c)
1906 {
1907 case '*':
1908 if (*lp == '/')
1909 {
1910 c = *lp++;
1911 incomm = FALSE;
1912 }
1913 break;
1914 case '\0':
1915 /* Newlines inside comments do not end macro definitions in
1916 traditional cpp. */
1917 CNL_SAVE_DEFINEDEF;
1918 break;
1919 }
1920 continue;
1921 }
1922 else if (inquote)
1923 {
1924 switch (c)
1925 {
1926 case '"':
1927 inquote = FALSE;
1928 break;
1929 case '\0':
1930 /* Newlines inside strings do not end macro definitions
1931 in traditional cpp, even though compilers don't
1932 usually accept them. */
1933 CNL_SAVE_DEFINEDEF;
1934 break;
1935 }
1936 continue;
1937 }
1938 else if (inchar)
1939 {
1940 switch (c)
1941 {
1942 case '\0':
1943 /* Hmmm, something went wrong. */
1944 CNL;
1945 /* FALLTHRU */
1946 case '\'':
1947 inchar = FALSE;
1948 break;
1949 }
1950 continue;
1951 }
1952 else
1953 switch (c)
1954 {
1955 case '"':
1956 inquote = TRUE;
1957 if (funcdef != finlist && funcdef != fignore)
1958 funcdef = fnone;
1959 continue;
1960 case '\'':
1961 inchar = TRUE;
1962 if (funcdef != finlist && funcdef != fignore)
1963 funcdef = fnone;
1964 continue;
1965 case '/':
1966 if (*lp == '*')
1967 {
1968 lp++;
1969 incomm = TRUE;
1970 continue;
1971 }
1972 else if (cplpl && *lp == '/')
1973 {
1974 c = 0;
1975 break;
1976 }
1977 else
1978 break;
1979 case '%':
1980 if ((c_ext & YACC) && *lp == '%')
1981 {
1982 /* entering or exiting rules section in yacc file */
1983 lp++;
1984 definedef = dnone; funcdef = fnone;
1985 typdef = tnone; structdef = snone;
1986 next_token_is_func = FALSE;
1987 midtoken = inquote = inchar = incomm = quotednl = FALSE;
1988 cblev = 0;
1989 yacc_rules = !yacc_rules;
1990 continue;
1991 }
1992 else
1993 break;
1994 case '#':
1995 if (definedef == dnone)
1996 {
1997 char *cp;
1998 logical cpptoken = TRUE;
1999
2000 /* Look back on this line. If all blanks, or nonblanks
2001 followed by an end of comment, this is a preprocessor
2002 token. */
2003 for (cp = newlb.buffer; cp < lp-1; cp++)
2004 if (!iswhite (*cp))
2005 {
2006 if (*cp == '*' && *(cp+1) == '/')
2007 {
2008 cp++;
2009 cpptoken = TRUE;
2010 }
2011 else
2012 cpptoken = FALSE;
2013 }
2014 if (cpptoken)
2015 definedef = dsharpseen;
2016 } /* if (definedef == dnone) */
2017
2018 continue;
2019 } /* switch (c) */
2020
2021
2022 /* Consider token only if some complicated conditions are satisfied. */
2023 if ((definedef != dnone
2024 || (cblev == 0 && structdef != scolonseen)
2025 || (cblev == 1 && cplpl && structdef == sinbody))
2026 && typdef != tignore
2027 && definedef != dignorerest
2028 && funcdef != finlist)
2029 {
2030 if (midtoken)
2031 {
2032 if (endtoken (c))
2033 {
2034 if (cplpl && c == ':' && *lp == ':' && begtoken(*(lp + 1)))
2035 {
2036 /*
2037 * This handles :: in the middle, but not at the
2038 * beginning of an identifier.
2039 */
2040 lp += 2;
2041 toklen += 3;
2042 }
2043 else
2044 {
2045 logical is_func = FALSE;
2046
2047 if (yacc_rules
2048 || consider_token (newlb.buffer + tokoff, toklen,
2049 c, c_ext, cblev, &is_func))
2050 {
2051 if (structdef == sinbody
2052 && definedef == dnone
2053 && is_func)
2054 /* function defined in C++ class body */
2055 {
2056 char *cp = newlb.buffer + tokoff + toklen;
2057 char c = *cp;
2058 *cp = '\0';
2059 tok.str = concat (structtag, "::",
2060 newlb.buffer + tokoff);
2061 *cp = c;
2062 tok.named = TRUE;
2063 }
2064 else
2065 {
2066 tok.str = savenstr (newlb.buffer+tokoff, toklen);
2067 if (structdef == stagseen
2068 || typdef == tend
2069 || (is_func
2070 && definedef == dignorerest)) /* macro */
2071 tok.named = TRUE;
2072 else
2073 tok.named = FALSE;
2074 }
2075 tok.lineno = lineno;
2076 tok.linelen = tokoff + toklen + 1;
2077
2078 if (definedef == dnone
2079 && (funcdef == ftagseen
2080 || structdef == stagseen
2081 || typdef == tend))
2082 {
2083 if (current_lb_is_new)
2084 switch_line_buffers ();
2085 }
2086 else
2087 make_tag_from_new_lb (is_func);
2088 }
2089 midtoken = FALSE;
2090 }
2091 } /* if (endtoken (c)) */
2092 else if (intoken (c))
2093 {
2094 toklen++;
2095 continue;
2096 }
2097 } /* if (midtoken) */
2098 else if (begtoken (c))
2099 {
2100 switch (definedef)
2101 {
2102 case dnone:
2103 switch (funcdef)
2104 {
2105 case fstartlist:
2106 funcdef = finlist;
2107 continue;
2108 case flistseen:
2109 make_tag_from_oth_lb (TRUE);
2110 funcdef = fignore;
2111 break;
2112 case ftagseen:
2113 funcdef = fnone;
2114 break;
2115 }
2116 if (structdef == stagseen)
2117 structdef = snone;
2118 break;
2119 case dsharpseen:
2120 savetok = tok;
2121 token_saved = TRUE;
2122 }
2123 if (!yacc_rules || lp == newlb.buffer + 1)
2124 {
2125 tokoff = lp - 1 - newlb.buffer;
2126 toklen = 1;
2127 midtoken = TRUE;
2128 }
2129 continue;
2130 } /* if (begtoken) */
2131 } /* if must look at token */
2132
2133
2134 /* Detect end of line, colon, comma, semicolon and various braces
2135 after having handled a token.*/
2136 switch (c)
2137 {
2138 case ':':
2139 if (definedef != dnone)
2140 break;
2141 if (structdef == stagseen)
2142 structdef = scolonseen;
2143 else
2144 switch (funcdef)
2145 {
2146 case ftagseen:
2147 if (yacc_rules)
2148 {
2149 make_tag_from_oth_lb (FALSE);
2150 funcdef = fignore;
2151 }
2152 break;
2153 case fstartlist:
2154 funcdef = fnone;
2155 break;
2156 }
2157 break;
2158 case ';':
2159 if (definedef != dnone)
2160 break;
2161 if (cblev == 0)
2162 switch (typdef)
2163 {
2164 case tend:
2165 make_tag_from_oth_lb (FALSE);
2166 /* FALLTHRU */
2167 default:
2168 typdef = tnone;
2169 }
2170 if (funcdef != fignore)
2171 funcdef = fnone;
2172 if (structdef == stagseen)
2173 structdef = snone;
2174 break;
2175 case ',':
2176 if (definedef != dnone)
2177 break;
2178 if (funcdef != finlist && funcdef != fignore)
2179 funcdef = fnone;
2180 if (structdef == stagseen)
2181 structdef = snone;
2182 break;
2183 case '[':
2184 if (definedef != dnone)
2185 break;
2186 if (cblev == 0 && typdef == tend)
2187 {
2188 typdef = tignore;
2189 make_tag_from_oth_lb (FALSE);
2190 break;
2191 }
2192 if (funcdef != finlist && funcdef != fignore)
2193 funcdef = fnone;
2194 if (structdef == stagseen)
2195 structdef = snone;
2196 break;
2197 case '(':
2198 if (definedef != dnone)
2199 break;
2200 switch (funcdef)
2201 {
2202 case fnone:
2203 switch (typdef)
2204 {
2205 case ttypedseen:
2206 case tend:
2207 /* Make sure that the next char is not a '*'.
2208 This handles constructs like:
2209 typedef void OperatorFun (int fun); */
2210 if (*lp != '*')
2211 {
2212 typdef = tignore;
2213 make_tag_from_oth_lb (FALSE);
2214 }
2215 break;
2216 } /* switch (typdef) */
2217 break;
2218 case ftagseen:
2219 funcdef = fstartlist;
2220 break;
2221 case flistseen:
2222 funcdef = finlist;
2223 break;
2224 }
2225 parlev++;
2226 break;
2227 case ')':
2228 if (definedef != dnone)
2229 break;
2230 if (--parlev == 0)
2231 {
2232 switch (funcdef)
2233 {
2234 case fstartlist:
2235 case finlist:
2236 funcdef = flistseen;
2237 break;
2238 }
2239 if (cblev == 0 && typdef == tend)
2240 {
2241 typdef = tignore;
2242 make_tag_from_oth_lb (FALSE);
2243 }
2244 }
2245 else if (parlev < 0) /* can happen due to ill-conceived #if's. */
2246 parlev = 0;
2247 break;
2248 case '{':
2249 if (definedef != dnone)
2250 break;
2251 if (typdef == ttypedseen)
2252 typdef = tinbody;
2253 switch (structdef)
2254 {
2255 case skeyseen: /* unnamed struct */
2256 structtag = "_anonymous_";
2257 structdef = sinbody;
2258 break;
2259 case stagseen:
2260 case scolonseen: /* named struct */
2261 structdef = sinbody;
2262 make_tag_from_oth_lb (FALSE);
2263 break;
2264 }
2265 switch (funcdef)
2266 {
2267 case flistseen:
2268 make_tag_from_oth_lb (TRUE);
2269 /* FALLTHRU */
2270 case fignore:
2271 funcdef = fnone;
2272 break;
2273 case fnone:
2274 /* Neutralize `extern "C" {' grot and look inside structs. */
2275 if (cblev == 0 && structdef == snone && typdef == tnone)
2276 cblev = -1;
2277 }
2278 cblev++;
2279 break;
2280 case '*':
2281 if (definedef != dnone)
2282 break;
2283 if (funcdef == fstartlist)
2284 funcdef = fnone; /* avoid tagging `foo' in `foo (*bar()) ()' */
2285 break;
2286 case '}':
2287 if (definedef != dnone)
2288 break;
2289 if (!noindentypedefs && lp == newlb.buffer + 1)
2290 {
2291 cblev = 0; /* reset curly brace level if first column */
2292 parlev = 0; /* also reset paren level, just in case... */
2293 }
2294 else if (cblev > 0)
2295 cblev--;
2296 if (cblev == 0)
2297 {
2298 if (typdef == tinbody)
2299 typdef = tend;
2300 #if FALSE /* too risky */
2301 if (structdef == sinbody)
2302 free (structtag);
2303 #endif
2304 structdef = snone;
2305 structtag = "<error>";
2306 }
2307 break;
2308 case '=':
2309 case '#': case '+': case '-': case '~': case '&': case '%': case '/':
2310 case '|': case '^': case '!': case '<': case '>': case '.': case '?':
2311 if (definedef != dnone)
2312 break;
2313 /* These surely cannot follow a function tag. */
2314 if (funcdef != finlist && funcdef != fignore)
2315 funcdef = fnone;
2316 break;
2317 case '\0':
2318 /* If a macro spans multiple lines don't reset its state. */
2319 if (quotednl)
2320 CNL_SAVE_DEFINEDEF;
2321 else
2322 CNL;
2323 break;
2324 } /* switch (c) */
2325
2326 } /* while not eof */
2327 }
2328
2329 /*
2330 * Process either a C++ file or a C file depending on the setting
2331 * of a global flag.
2332 */
2333 void
2334 default_C_entries (inf)
2335 FILE *inf;
2336 {
2337 C_entries (cplusplus ? C_PLPL : 0, inf);
2338 }
2339
2340 /* Always do C++. */
2341 void
2342 Cplusplus_entries (inf)
2343 FILE *inf;
2344 {
2345 C_entries (C_PLPL, inf);
2346 }
2347
2348 /* Always do C*. */
2349 void
2350 Cstar_entries (inf)
2351 FILE *inf;
2352 {
2353 C_entries (C_STAR, inf);
2354 }
2355
2356 /* Always do Yacc. */
2357 void
2358 Yacc_entries (inf)
2359 FILE *inf;
2360 {
2361 C_entries (YACC, inf);
2362 }
2363 \f
2364 /* Fortran parsing */
2365
2366 char *dbp;
2367
2368 logical
2369 tail (cp)
2370 char *cp;
2371 {
2372 register int len = 0;
2373
2374 while (*cp && (*cp | ' ') == (dbp[len] | ' '))
2375 cp++, len++;
2376 if (*cp == 0)
2377 {
2378 dbp += len;
2379 return TRUE;
2380 }
2381 return FALSE;
2382 }
2383
2384 void
2385 takeprec ()
2386 {
2387 while (isspace (*dbp))
2388 dbp++;
2389 if (*dbp != '*')
2390 return;
2391 dbp++;
2392 while (isspace (*dbp))
2393 dbp++;
2394 if (tail ("(*)"))
2395 return;
2396 if (!isdigit (*dbp))
2397 {
2398 --dbp; /* force failure */
2399 return;
2400 }
2401 do
2402 dbp++;
2403 while (isdigit (*dbp));
2404 }
2405
2406 void
2407 getit (inf)
2408 FILE *inf;
2409 {
2410 register char *cp;
2411
2412 while (isspace (*dbp))
2413 dbp++;
2414 if (*dbp == '\0')
2415 {
2416 lineno++;
2417 linecharno = charno;
2418 charno += readline (&lb, inf);
2419 dbp = lb.buffer;
2420 if (dbp[5] != '&')
2421 return;
2422 dbp += 6;
2423 while (isspace (*dbp))
2424 dbp++;
2425 }
2426 if (!isalpha (*dbp)
2427 && *dbp != '_'
2428 && *dbp != '$')
2429 return;
2430 for (cp = dbp + 1;
2431 (*cp
2432 && (isalpha (*cp) || isdigit (*cp) || (*cp == '_') || (*cp == '$')));
2433 cp++)
2434 continue;
2435 pfnote (savenstr (dbp, cp-dbp), TRUE, FALSE, lb.buffer,
2436 cp - lb.buffer + 1, lineno, linecharno);
2437 }
2438
2439 void
2440 Fortran_functions (inf)
2441 FILE *inf;
2442 {
2443 lineno = 0;
2444 charno = 0;
2445
2446 while (!feof (inf))
2447 {
2448 lineno++;
2449 linecharno = charno;
2450 charno += readline (&lb, inf);
2451 dbp = lb.buffer;
2452 if (*dbp == '%')
2453 dbp++; /* Ratfor escape to fortran */
2454 while (isspace (*dbp))
2455 dbp++;
2456 if (*dbp == 0)
2457 continue;
2458 switch (*dbp | ' ')
2459 {
2460 case 'i':
2461 if (tail ("integer"))
2462 takeprec ();
2463 break;
2464 case 'r':
2465 if (tail ("real"))
2466 takeprec ();
2467 break;
2468 case 'l':
2469 if (tail ("logical"))
2470 takeprec ();
2471 break;
2472 case 'c':
2473 if (tail ("complex") || tail ("character"))
2474 takeprec ();
2475 break;
2476 case 'd':
2477 if (tail ("double"))
2478 {
2479 while (isspace (*dbp))
2480 dbp++;
2481 if (*dbp == 0)
2482 continue;
2483 if (tail ("precision"))
2484 break;
2485 continue;
2486 }
2487 break;
2488 }
2489 while (isspace (*dbp))
2490 dbp++;
2491 if (*dbp == 0)
2492 continue;
2493 switch (*dbp | ' ')
2494 {
2495 case 'f':
2496 if (tail ("function"))
2497 getit (inf);
2498 continue;
2499 case 's':
2500 if (tail ("subroutine"))
2501 getit (inf);
2502 continue;
2503 case 'e':
2504 if (tail ("entry"))
2505 getit (inf);
2506 continue;
2507 case 'p':
2508 if (tail ("program"))
2509 {
2510 getit (inf);
2511 continue;
2512 }
2513 if (tail ("procedure"))
2514 getit (inf);
2515 continue;
2516 }
2517 }
2518 }
2519 \f
2520 /*
2521 * Bob Weiner, Motorola Inc., 4/3/94
2522 * Unix and microcontroller assembly tag handling
2523 * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
2524 */
2525 void
2526 Asm_labels (inf)
2527 FILE *inf;
2528 {
2529 register char *cp;
2530
2531 lineno = 0;
2532 charno = 0;
2533
2534 while (!feof (inf))
2535 {
2536 lineno++;
2537 linecharno = charno;
2538 charno += readline (&lb, inf);
2539 cp = lb.buffer;
2540
2541 /* If first char is alphabetic or one of [_.$], test for colon
2542 following identifier. */
2543 if (isalpha (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
2544 {
2545 /* Read past label. */
2546 cp++;
2547 while (isalnum (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
2548 cp++;
2549 if (*cp == ':' || isspace (*cp))
2550 {
2551 /* Found end of label, so copy it and add it to the table. */
2552 pfnote (savenstr (lb.buffer, cp-lb.buffer), TRUE, FALSE,
2553 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
2554 }
2555 }
2556 }
2557 }
2558 \f
2559 /* Added by Mosur Mohan, 4/22/88 */
2560 /* Pascal parsing */
2561
2562 #define GET_NEW_LINE \
2563 { \
2564 linecharno = charno; lineno++; \
2565 charno += 1 + readline (&lb, inf); \
2566 dbp = lb.buffer; \
2567 }
2568
2569 /*
2570 * Locates tags for procedures & functions. Doesn't do any type- or
2571 * var-definitions. It does look for the keyword "extern" or
2572 * "forward" immediately following the procedure statement; if found,
2573 * the tag is skipped.
2574 */
2575 void
2576 Pascal_functions (inf)
2577 FILE *inf;
2578 {
2579 struct linebuffer tline; /* mostly copied from C_entries */
2580 long save_lcno;
2581 int save_lineno;
2582 char c, *cp;
2583 char *nambuf;
2584
2585 logical /* each of these flags is TRUE iff: */
2586 incomment, /* point is inside a comment */
2587 inquote, /* point is inside '..' string */
2588 get_tagname, /* point is after PROCEDURE/FUNCTION */
2589 /* keyword, so next item = potential tag */
2590 found_tag, /* point is after a potential tag */
2591 inparms, /* point is within parameter-list */
2592 verify_tag; /* point has passed the parm-list, so the */
2593 /* next token will determine whether */
2594 /* this is a FORWARD/EXTERN to be */
2595 /* ignored, or whether it is a real tag */
2596
2597 lineno = 0;
2598 charno = 0;
2599 dbp = lb.buffer;
2600 *dbp = 0;
2601 initbuffer (&tline);
2602
2603 incomment = inquote = FALSE;
2604 found_tag = FALSE; /* have a proc name; check if extern */
2605 get_tagname = FALSE; /* have found "procedure" keyword */
2606 inparms = FALSE; /* found '(' after "proc" */
2607 verify_tag = FALSE; /* check if "extern" is ahead */
2608
2609 /* long main loop to get next char */
2610 while (!feof (inf))
2611 {
2612 c = *dbp++;
2613 if (c == '\0') /* if end of line */
2614 {
2615 GET_NEW_LINE;
2616 if (*dbp == '\0')
2617 continue;
2618 if (!((found_tag && verify_tag) ||
2619 get_tagname))
2620 c = *dbp++; /* only if don't need *dbp pointing */
2621 /* to the beginning of the name of */
2622 /* the procedure or function */
2623 }
2624 if (incomment)
2625 {
2626 if (c == '}') /* within { - } comments */
2627 incomment = FALSE;
2628 else if (c == '*' && dbp[1] == ')') /* within (* - *) comments */
2629 {
2630 dbp++;
2631 incomment = FALSE;
2632 }
2633 continue;
2634 }
2635 else if (inquote)
2636 {
2637 if (c == '\'')
2638 inquote = FALSE;
2639 continue;
2640 }
2641 else
2642 switch (c)
2643 {
2644 case '\'':
2645 inquote = TRUE; /* found first quote */
2646 continue;
2647 case '{': /* found open-{-comment */
2648 incomment = TRUE;
2649 continue;
2650 case '(':
2651 if (*dbp == '*') /* found open-(*-comment */
2652 {
2653 incomment = TRUE;
2654 dbp++;
2655 }
2656 else if (found_tag) /* found '(' after tag, i.e., parm-list */
2657 inparms = TRUE;
2658 continue;
2659 case ')': /* end of parms list */
2660 if (inparms)
2661 inparms = FALSE;
2662 continue;
2663 case ';':
2664 if ((found_tag) && (!inparms)) /* end of proc or fn stmt */
2665 {
2666 verify_tag = TRUE;
2667 break;
2668 }
2669 continue;
2670 }
2671 if ((found_tag) && (verify_tag) && (*dbp != ' '))
2672 {
2673 /* check if this is an "extern" declaration */
2674 if (*dbp == 0)
2675 continue;
2676 if ((*dbp == 'e') || (*dbp == 'E'))
2677 {
2678 if (tail ("extern")) /* superfluous, really! */
2679 {
2680 found_tag = FALSE;
2681 verify_tag = FALSE;
2682 }
2683 }
2684 else if ((*dbp == 'f') || (*dbp == 'F'))
2685 {
2686 if (tail ("forward")) /* check for forward reference */
2687 {
2688 found_tag = FALSE;
2689 verify_tag = FALSE;
2690 }
2691 }
2692 if ((found_tag) && (verify_tag)) /* not external proc, so make tag */
2693 {
2694 found_tag = FALSE;
2695 verify_tag = FALSE;
2696 pfnote (nambuf, TRUE, FALSE, tline.buffer,
2697 cp - tline.buffer + 1, save_lineno, save_lcno);
2698 continue;
2699 }
2700 }
2701 if (get_tagname) /* grab name of proc or fn */
2702 {
2703 if (*dbp == 0)
2704 continue;
2705
2706 /* save all values for later tagging */
2707 tline.size = lb.size;
2708 strcpy (tline.buffer, lb.buffer);
2709 save_lineno = lineno;
2710 save_lcno = linecharno;
2711
2712 /* grab block name */
2713 for (cp = dbp + 1; *cp && (!endtoken (*cp)); cp++)
2714 continue;
2715 nambuf = savenstr (dbp, cp-dbp);
2716 dbp = cp; /* restore dbp to e-o-token */
2717 get_tagname = FALSE;
2718 found_tag = TRUE;
2719 continue;
2720
2721 /* and proceed to check for "extern" */
2722 }
2723 else if (!incomment && !inquote && !found_tag)
2724 {
2725 /* check for proc/fn keywords */
2726 switch (c | ' ')
2727 {
2728 case 'p':
2729 if (tail ("rocedure")) /* c = 'p', dbp has advanced */
2730 get_tagname = TRUE;
2731 continue;
2732 case 'f':
2733 if (tail ("unction"))
2734 get_tagname = TRUE;
2735 continue;
2736 }
2737 }
2738 } /* while not eof */
2739 }
2740 \f
2741 /*
2742 * lisp tag functions
2743 * look for (def or (DEF, quote or QUOTE
2744 */
2745 int
2746 L_isdef (strp)
2747 register char *strp;
2748 {
2749 return ((strp[1] == 'd' || strp[1] == 'D')
2750 && (strp[2] == 'e' || strp[2] == 'E')
2751 && (strp[3] == 'f' || strp[3] == 'F'));
2752 }
2753
2754 int
2755 L_isquote (strp)
2756 register char *strp;
2757 {
2758 return ((*(++strp) == 'q' || *strp == 'Q')
2759 && (*(++strp) == 'u' || *strp == 'U')
2760 && (*(++strp) == 'o' || *strp == 'O')
2761 && (*(++strp) == 't' || *strp == 'T')
2762 && (*(++strp) == 'e' || *strp == 'E')
2763 && isspace(*(++strp)));
2764 }
2765
2766 void
2767 L_getit ()
2768 {
2769 register char *cp;
2770
2771 if (*dbp == '\'') /* Skip prefix quote */
2772 dbp++;
2773 else if (*dbp == '(' && L_isquote (dbp)) /* Skip "(quote " */
2774 {
2775 dbp += 7;
2776 while (isspace(*dbp))
2777 dbp++;
2778 }
2779 for (cp = dbp /*+1*/;
2780 *cp && *cp != '(' && *cp != ' ' && *cp != ')';
2781 cp++)
2782 continue;
2783 if (cp == dbp)
2784 return;
2785
2786 pfnote (savenstr (dbp, cp-dbp), TRUE, FALSE, lb.buffer,
2787 cp - lb.buffer + 1, lineno, linecharno);
2788 }
2789
2790 void
2791 Lisp_functions (inf)
2792 FILE *inf;
2793 {
2794 lineno = 0;
2795 charno = 0;
2796
2797 while (!feof (inf))
2798 {
2799 lineno++;
2800 linecharno = charno;
2801 charno += readline (&lb, inf);
2802 dbp = lb.buffer;
2803 if (dbp[0] == '(')
2804 {
2805 if (L_isdef (dbp))
2806 {
2807 while (!isspace (*dbp))
2808 dbp++;
2809 while (isspace (*dbp))
2810 dbp++;
2811 L_getit ();
2812 }
2813 else
2814 {
2815 /* Check for (foo::defmumble name-defined ... */
2816 do
2817 dbp++;
2818 while (*dbp && !isspace (*dbp)
2819 && *dbp != ':' && *dbp != '(' && *dbp != ')');
2820 if (*dbp == ':')
2821 {
2822 do
2823 dbp++;
2824 while (*dbp == ':');
2825
2826 if (L_isdef (dbp - 1))
2827 {
2828 while (!isspace (*dbp))
2829 dbp++;
2830 while (isspace (*dbp))
2831 dbp++;
2832 L_getit ();
2833 }
2834 }
2835 }
2836 }
2837 }
2838 }
2839 \f
2840 /*
2841 * Scheme tag functions
2842 * look for (def... xyzzy
2843 * look for (def... (xyzzy
2844 * look for (def ... ((...(xyzzy ....
2845 * look for (set! xyzzy
2846 */
2847
2848 void get_scheme ();
2849
2850 void
2851 Scheme_functions (inf)
2852 FILE *inf;
2853 {
2854 lineno = 0;
2855 charno = 0;
2856
2857 while (!feof (inf))
2858 {
2859 lineno++;
2860 linecharno = charno;
2861 charno += readline (&lb, inf);
2862 dbp = lb.buffer;
2863 if (dbp[0] == '(' &&
2864 (dbp[1] == 'D' || dbp[1] == 'd') &&
2865 (dbp[2] == 'E' || dbp[2] == 'e') &&
2866 (dbp[3] == 'F' || dbp[3] == 'f'))
2867 {
2868 while (!isspace (*dbp))
2869 dbp++;
2870 /* Skip over open parens and white space */
2871 while (*dbp && (isspace (*dbp) || *dbp == '('))
2872 dbp++;
2873 get_scheme ();
2874 }
2875 if (dbp[0] == '(' &&
2876 (dbp[1] == 'S' || dbp[1] == 's') &&
2877 (dbp[2] == 'E' || dbp[2] == 'e') &&
2878 (dbp[3] == 'T' || dbp[3] == 't') &&
2879 (dbp[4] == '!' || dbp[4] == '!') &&
2880 (isspace (dbp[5])))
2881 {
2882 while (!isspace (*dbp))
2883 dbp++;
2884 /* Skip over white space */
2885 while (isspace (*dbp))
2886 dbp++;
2887 get_scheme ();
2888 }
2889 }
2890 }
2891
2892 void
2893 get_scheme ()
2894 {
2895 register char *cp;
2896
2897 if (*dbp == 0)
2898 return;
2899 /* Go till you get to white space or a syntactic break */
2900 for (cp = dbp + 1;
2901 *cp && *cp != '(' && *cp != ')' && !isspace (*cp);
2902 cp++)
2903 continue;
2904 pfnote (savenstr (dbp, cp-dbp), TRUE, FALSE,
2905 lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
2906 }
2907 \f
2908 /* Find tags in TeX and LaTeX input files. */
2909
2910 /* TEX_toktab is a table of TeX control sequences that define tags.
2911 Each TEX_tabent records one such control sequence.
2912 CONVERT THIS TO USE THE Stab TYPE!! */
2913 struct TEX_tabent
2914 {
2915 char *name;
2916 int len;
2917 };
2918
2919 struct TEX_tabent *TEX_toktab = NULL; /* Table with tag tokens */
2920
2921 /* Default set of control sequences to put into TEX_toktab.
2922 The value of environment var TEXTAGS is prepended to this. */
2923
2924 char *TEX_defenv = "\
2925 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem:typeout";
2926
2927 void TEX_mode ();
2928 struct TEX_tabent *TEX_decode_env ();
2929 void TEX_getit ();
2930 int TEX_Token ();
2931
2932 char TEX_esc = '\\';
2933 char TEX_opgrp = '{';
2934 char TEX_clgrp = '}';
2935
2936 /*
2937 * TeX/LaTeX scanning loop.
2938 */
2939 void
2940 TeX_functions (inf)
2941 FILE *inf;
2942 {
2943 char *lasthit;
2944
2945 lineno = 0;
2946 charno = 0;
2947
2948 /* Select either \ or ! as escape character. */
2949 TEX_mode (inf);
2950
2951 /* Initialize token table once from environment. */
2952 if (!TEX_toktab)
2953 TEX_toktab = TEX_decode_env ("TEXTAGS", TEX_defenv);
2954
2955 while (!feof (inf))
2956 { /* Scan each line in file */
2957 lineno++;
2958 linecharno = charno;
2959 charno += readline (&lb, inf);
2960 dbp = lb.buffer;
2961 lasthit = dbp;
2962 while (dbp = etags_strchr (dbp, TEX_esc)) /* Look at each esc in line */
2963 {
2964 register int i;
2965
2966 if (!*(++dbp))
2967 break;
2968 linecharno += dbp - lasthit;
2969 lasthit = dbp;
2970 i = TEX_Token (lasthit);
2971 if (0 <= i)
2972 {
2973 TEX_getit (lasthit, TEX_toktab[i].len);
2974 break; /* We only save a line once */
2975 }
2976 }
2977 }
2978 }
2979
2980 #define TEX_LESC '\\'
2981 #define TEX_SESC '!'
2982 #define TEX_cmt '%'
2983
2984 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
2985 chars accordingly. */
2986 void
2987 TEX_mode (inf)
2988 FILE *inf;
2989 {
2990 int c;
2991
2992 while ((c = getc (inf)) != EOF)
2993 {
2994 /* Skip to next line if we hit the TeX comment char. */
2995 if (c == TEX_cmt)
2996 while (c != '\n')
2997 c = getc (inf);
2998 else if (c == TEX_LESC || c == TEX_SESC )
2999 break;
3000 }
3001
3002 if (c == TEX_LESC)
3003 {
3004 TEX_esc = TEX_LESC;
3005 TEX_opgrp = '{';
3006 TEX_clgrp = '}';
3007 }
3008 else
3009 {
3010 TEX_esc = TEX_SESC;
3011 TEX_opgrp = '<';
3012 TEX_clgrp = '>';
3013 }
3014 rewind (inf);
3015 }
3016
3017 /* Read environment and prepend it to the default string.
3018 Build token table. */
3019 struct TEX_tabent *
3020 TEX_decode_env (evarname, defenv)
3021 char *evarname;
3022 char *defenv;
3023 {
3024 register char *env, *p;
3025
3026 struct TEX_tabent *tab;
3027 int size, i;
3028
3029 /* Append default string to environment. */
3030 env = getenv (evarname);
3031 if (!env)
3032 env = defenv;
3033 else
3034 env = concat (env, defenv, "");
3035
3036 /* Allocate a token table */
3037 for (size = 1, p = env; p;)
3038 if ((p = etags_strchr (p, ':')) && *(++p))
3039 size++;
3040 /* Add 1 to leave room for null terminator. */
3041 tab = xnew (size + 1, struct TEX_tabent);
3042
3043 /* Unpack environment string into token table. Be careful about */
3044 /* zero-length strings (leading ':', "::" and trailing ':') */
3045 for (i = 0; *env;)
3046 {
3047 p = etags_strchr (env, ':');
3048 if (!p) /* End of environment string. */
3049 p = env + strlen (env);
3050 if (p - env > 0)
3051 { /* Only non-zero strings. */
3052 tab[i].name = savenstr (env, p - env);
3053 tab[i].len = strlen (tab[i].name);
3054 i++;
3055 }
3056 if (*p)
3057 env = p + 1;
3058 else
3059 {
3060 tab[i].name = NULL; /* Mark end of table. */
3061 tab[i].len = 0;
3062 break;
3063 }
3064 }
3065 return tab;
3066 }
3067
3068 /* Record a tag defined by a TeX command of length LEN and starting at NAME.
3069 The name being defined actually starts at (NAME + LEN + 1).
3070 But we seem to include the TeX command in the tag name. */
3071 void
3072 TEX_getit (name, len)
3073 char *name;
3074 int len;
3075 {
3076 char *p = name + len;
3077
3078 if (*name == 0)
3079 return;
3080
3081 /* Let tag name extend to next group close (or end of line) */
3082 while (*p && *p != TEX_clgrp)
3083 p++;
3084 pfnote (savenstr (name, p-name), TRUE, FALSE, lb.buffer,
3085 strlen (lb.buffer), lineno, linecharno);
3086 }
3087
3088 /* If the text at CP matches one of the tag-defining TeX command names,
3089 return the pointer to the first occurrence of that command in TEX_toktab.
3090 Otherwise return -1.
3091 Keep the capital `T' in `Token' for dumb truncating compilers
3092 (this distinguishes it from `TEX_toktab' */
3093 int
3094 TEX_Token (cp)
3095 char *cp;
3096 {
3097 int i;
3098
3099 for (i = 0; TEX_toktab[i].len > 0; i++)
3100 if (strneq (TEX_toktab[i].name, cp, TEX_toktab[i].len))
3101 return i;
3102 return -1;
3103 }
3104 \f
3105 /* Support for Prolog. */
3106
3107 /* Whole head (not only functor, but also arguments)
3108 is gotten in compound term. */
3109 void
3110 prolog_getit (s)
3111 char *s;
3112 {
3113 char *save_s;
3114 int insquote, npar;
3115
3116 save_s = s;
3117 insquote = FALSE;
3118 npar = 0;
3119 while (1)
3120 {
3121 if (s[0] == '\0') /* syntax error. */
3122 return;
3123 else if (insquote && s[0] == '\'' && s[1] == '\'')
3124 s += 2;
3125 else if (s[0] == '\'')
3126 {
3127 insquote = !insquote;
3128 s++;
3129 }
3130 else if (!insquote && s[0] == '(')
3131 {
3132 npar++;
3133 s++;
3134 }
3135 else if (!insquote && s[0] == ')')
3136 {
3137 npar--;
3138 s++;
3139 if (npar == 0)
3140 break;
3141 else if (npar < 0) /* syntax error. */
3142 return;
3143 }
3144 else if (!insquote && s[0] == '.'
3145 && (isspace (s[1]) || s[1] == '\0'))
3146 { /* fullstop. */
3147 if (npar != 0) /* syntax error. */
3148 return;
3149 s++;
3150 break;
3151 }
3152 else
3153 s++;
3154 }
3155 pfnote (savenstr (save_s, s-save_s), TRUE, FALSE,
3156 save_s, s-save_s, lineno, linecharno);
3157 }
3158
3159 /* It is assumed that prolog predicate starts from column 0. */
3160 void
3161 Prolog_functions (inf)
3162 FILE *inf;
3163 {
3164 void skip_comment (), prolog_getit ();
3165
3166 lineno = linecharno = charno = 0;
3167 while (!feof (inf))
3168 {
3169 lineno++;
3170 linecharno += charno;
3171 charno = readline (&lb, inf) + 1; /* 1 for newline. */
3172 dbp = lb.buffer;
3173 if (isspace (dbp[0])) /* not predicate header. */
3174 continue;
3175 else if (dbp[0] == '%') /* comment. */
3176 continue;
3177 else if (dbp[0] == '/' && dbp[1] == '*') /* comment. */
3178 skip_comment (&lb, inf, &lineno, &linecharno);
3179 else /* found. */
3180 prolog_getit (dbp);
3181 }
3182 }
3183
3184 void
3185 skip_comment (plb, inf, plineno, plinecharno)
3186 struct linebuffer *plb;
3187 FILE *inf;
3188 int *plineno; /* result */
3189 long *plinecharno; /* result */
3190 {
3191 char *cp;
3192
3193 do
3194 {
3195 for (cp = plb->buffer; *cp != '\0'; cp++)
3196 if (cp[0] == '*' && cp[1] == '/')
3197 return;
3198 (*plineno)++;
3199 *plinecharno += readline (plb, inf) + 1; /* 1 for newline. */
3200 }
3201 while (!feof(inf));
3202 }
3203 \f
3204 #ifdef ETAGS_REGEXPS
3205 /* Take a string like "/blah/" and turn it into "blah", making sure
3206 that the first and last characters are the same, and handling
3207 quoted separator characters. Actually, stops on the occurence of
3208 an unquoted separator. Also turns "\t" into a Tab character.
3209 Returns pointer to terminating separator. Works in place. Null
3210 terminates name string. */
3211 char *
3212 scan_separators (name)
3213 char *name;
3214 {
3215 char sep = name[0];
3216 char *copyto = name;
3217 logical quoted = FALSE;
3218
3219 for (++name; *name != '\0'; ++name)
3220 {
3221 if (quoted)
3222 {
3223 if (*name == 't')
3224 *copyto++ = '\t';
3225 else if (*name == sep)
3226 *copyto++ = sep;
3227 else
3228 {
3229 /* Something else is quoted, so preserve the quote. */
3230 *copyto++ = '\\';
3231 *copyto++ = *name;
3232 }
3233 quoted = FALSE;
3234 }
3235 else if (*name == '\\')
3236 quoted = TRUE;
3237 else if (*name == sep)
3238 break;
3239 else
3240 *copyto++ = *name;
3241 }
3242
3243 /* Terminate copied string. */
3244 *copyto = '\0';
3245 return name;
3246 }
3247
3248 /* Turn a name, which is an ed-style (but Emacs syntax) regular
3249 expression, into a real regular expression by compiling it. */
3250 void
3251 add_regex (regexp_pattern)
3252 char *regexp_pattern;
3253 {
3254 char *name;
3255 const char *err;
3256 struct re_pattern_buffer *patbuf;
3257
3258 if (regexp_pattern == NULL)
3259 {
3260 /* Remove existing regexps. */
3261 num_patterns = 0;
3262 patterns = NULL;
3263 return;
3264 }
3265
3266 if (regexp_pattern[0] == '\0')
3267 {
3268 error ("missing regexp", 0);
3269 return;
3270 }
3271 if (regexp_pattern[strlen(regexp_pattern)-1] != regexp_pattern[0])
3272 {
3273 error ("%s: unterminated regexp", regexp_pattern);
3274 return;
3275 }
3276 name = scan_separators (regexp_pattern);
3277 if (regexp_pattern[0] == '\0')
3278 {
3279 error ("null regexp", 0);
3280 return;
3281 }
3282 (void) scan_separators (name);
3283
3284 patbuf = xnew (1, struct re_pattern_buffer);
3285 patbuf->translate = NULL;
3286 patbuf->fastmap = NULL;
3287 patbuf->buffer = NULL;
3288 patbuf->allocated = 0;
3289
3290 err = re_compile_pattern (regexp_pattern, strlen (regexp_pattern), patbuf);
3291 if (err != NULL)
3292 {
3293 error ("%s while compiling pattern", err);
3294 return;
3295 }
3296
3297 num_patterns += 1;
3298 if (num_patterns == 1)
3299 patterns = xnew (1, struct pattern);
3300 else
3301 patterns = ((struct pattern *)
3302 xrealloc (patterns,
3303 (num_patterns * sizeof (struct pattern))));
3304 patterns[num_patterns - 1].pattern = patbuf;
3305 patterns[num_patterns - 1].name_pattern = savestr (name);
3306 patterns[num_patterns - 1].error_signaled = FALSE;
3307 }
3308
3309 /*
3310 * Do the subtitutions indicated by the regular expression and
3311 * arguments.
3312 */
3313 char *
3314 substitute (in, out, regs)
3315 char *in, *out;
3316 struct re_registers *regs;
3317 {
3318 char *result = NULL, *t;
3319 int size = 0;
3320
3321 /* Pass 1: figure out how much size to allocate. */
3322 for (t = out; *t; ++t)
3323 {
3324 if (*t == '\\')
3325 {
3326 ++t;
3327 if (!*t)
3328 {
3329 fprintf (stderr, "%s: pattern subtitution ends prematurely\n",
3330 progname);
3331 return NULL;
3332 }
3333 if (isdigit (*t))
3334 {
3335 int dig = *t - '0';
3336 size += regs->end[dig] - regs->start[dig];
3337 }
3338 }
3339 }
3340
3341 /* Allocate space and do the substitutions. */
3342 result = xnew (size + 1, char);
3343 size = 0;
3344 for (; *out; ++out)
3345 {
3346 if (*out == '\\')
3347 {
3348 ++out;
3349 if (isdigit (*out))
3350 {
3351 /* Using "dig2" satisfies my debugger. Bleah. */
3352 int dig2 = *out - '0';
3353 strncpy (result + size, in + regs->start[dig2],
3354 regs->end[dig2] - regs->start[dig2]);
3355 size += regs->end[dig2] - regs->start[dig2];
3356 }
3357 else
3358 {
3359 switch (*out)
3360 {
3361 case '\t':
3362 result[size++] = '\t';
3363 break;
3364 case '\\':
3365 *out = '\\';
3366 break;
3367 default:
3368 result[size++] = *out;
3369 break;
3370 }
3371 }
3372 }
3373 else
3374 result[size++] = *out;
3375 }
3376 result[size] = '\0';
3377
3378 return result;
3379 }
3380 \f
3381 #endif /* ETAGS_REGEXPS */
3382 /* Initialize a linebuffer for use */
3383 void
3384 initbuffer (linebuffer)
3385 struct linebuffer *linebuffer;
3386 {
3387 linebuffer->size = 200;
3388 linebuffer->buffer = xnew (200, char);
3389 }
3390
3391 /*
3392 * Read a line of text from `stream' into `linebuffer'.
3393 * Return the number of characters read from `stream',
3394 * which is the length of the line including the newline, if any.
3395 */
3396 long
3397 readline_internal (linebuffer, stream)
3398 struct linebuffer *linebuffer;
3399 register FILE *stream;
3400 {
3401 char *buffer = linebuffer->buffer;
3402 register char *p = linebuffer->buffer;
3403 register char *pend;
3404 int chars_deleted;
3405
3406 pend = p + linebuffer->size; /* Separate to avoid 386/IX compiler bug. */
3407
3408 while (1)
3409 {
3410 register int c = getc (stream);
3411 if (p == pend)
3412 {
3413 linebuffer->size *= 2;
3414 buffer = (char *) xrealloc (buffer, linebuffer->size);
3415 p += buffer - linebuffer->buffer;
3416 pend = buffer + linebuffer->size;
3417 linebuffer->buffer = buffer;
3418 }
3419 if (c == EOF)
3420 {
3421 chars_deleted = 0;
3422 break;
3423 }
3424 if (c == '\n')
3425 {
3426 if (p[-1] == '\r' && p > buffer)
3427 {
3428 *--p = '\0';
3429 chars_deleted = 2;
3430 }
3431 else
3432 {
3433 *p = '\0';
3434 chars_deleted = 1;
3435 }
3436 break;
3437 }
3438 *p++ = c;
3439 }
3440
3441 return p - buffer + chars_deleted;
3442 }
3443
3444 /*
3445 * Like readline_internal, above, but try to match the input
3446 * line against any existing regular expressions.
3447 */
3448 long
3449 readline (linebuffer, stream)
3450 struct linebuffer *linebuffer;
3451 FILE *stream;
3452 {
3453 /* Read new line. */
3454 int i;
3455 long result = readline_internal (linebuffer, stream);
3456
3457 #ifdef ETAGS_REGEXPS
3458 /* Match against all listed patterns. */
3459 for (i = 0; i < num_patterns; ++i)
3460 {
3461 int match = re_match (patterns[i].pattern, linebuffer->buffer,
3462 (int)result, 0, &patterns[i].regs);
3463 switch (match)
3464 {
3465 case -2:
3466 /* Some error. */
3467 if (!patterns[i].error_signaled)
3468 {
3469 error ("error while matching pattern %d", i);
3470 patterns[i].error_signaled = TRUE;
3471 }
3472 break;
3473 case -1:
3474 /* No match. */
3475 break;
3476 default:
3477 /* Match occurred. Construct a tag. */
3478 if (patterns[i].name_pattern[0] != '\0')
3479 {
3480 /* Make a named tag. */
3481 char *name = substitute (linebuffer->buffer,
3482 patterns[i].name_pattern,
3483 &patterns[i].regs);
3484 if (name != NULL)
3485 pfnote (name, TRUE, TRUE, linebuffer->buffer,
3486 match, lineno, linecharno);
3487 }
3488 else
3489 {
3490 /* Make an unnamed tag. */
3491 pfnote (NULL, TRUE, FALSE, linebuffer->buffer,
3492 match, lineno, linecharno);
3493 }
3494 break;
3495 }
3496 }
3497 #endif /* ETAGS_REGEXPS */
3498
3499 return result;
3500 }
3501
3502 /*
3503 * Read a file, but do no processing. This is used to do regexp
3504 * matching on files that have no language defined.
3505 */
3506 void
3507 just_read_file (inf)
3508 FILE *inf;
3509 {
3510 while (!feof (inf))
3511 {
3512 ++lineno;
3513 linecharno = charno;
3514 charno += readline (&lb, inf) + 1;
3515 }
3516 }
3517
3518 \f
3519 /*
3520 * Return a pointer to a space of size strlen(cp)+1 allocated
3521 * with xnew where the string CP has been copied.
3522 */
3523 char *
3524 savestr (cp)
3525 char *cp;
3526 {
3527 return savenstr (cp, strlen (cp));
3528 }
3529
3530 /*
3531 * Return a pointer to a space of size LEN+1 allocated with xnew where
3532 * the string CP has been copied for at most the first LEN characters.
3533 */
3534 char *
3535 savenstr (cp, len)
3536 char *cp;
3537 int len;
3538 {
3539 register char *dp;
3540
3541 dp = xnew (len + 1, char);
3542 strncpy (dp, cp, len);
3543 dp[len] = '\0';
3544 return dp;
3545 }
3546
3547 /*
3548 * Return the ptr in sp at which the character c last
3549 * appears; NULL if not found
3550 *
3551 * Identical to System V strrchr, included for portability.
3552 */
3553 char *
3554 etags_strrchr (sp, c)
3555 register char *sp, c;
3556 {
3557 register char *r;
3558
3559 r = NULL;
3560 do
3561 {
3562 if (*sp == c)
3563 r = sp;
3564 } while (*sp++);
3565 return r;
3566 }
3567
3568
3569 /*
3570 * Return the ptr in sp at which the character c first
3571 * appears; NULL if not found
3572 *
3573 * Identical to System V strchr, included for portability.
3574 */
3575 char *
3576 etags_strchr (sp, c)
3577 register char *sp, c;
3578 {
3579 do
3580 {
3581 if (*sp == c)
3582 return sp;
3583 } while (*sp++);
3584 return NULL;
3585 }
3586
3587 /* Print error message and exit. */
3588 void
3589 fatal (s1, s2)
3590 char *s1, *s2;
3591 {
3592 error (s1, s2);
3593 exit (BAD);
3594 }
3595
3596 void
3597 pfatal (s1)
3598 char *s1;
3599 {
3600 perror (s1);
3601 exit (BAD);
3602 }
3603
3604 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
3605 void
3606 error (s1, s2)
3607 char *s1, *s2;
3608 {
3609 fprintf (stderr, "%s: ", progname);
3610 fprintf (stderr, s1, s2);
3611 fprintf (stderr, "\n");
3612 }
3613
3614 /* Return a newly-allocated string whose contents
3615 concatenate those of s1, s2, s3. */
3616 char *
3617 concat (s1, s2, s3)
3618 char *s1, *s2, *s3;
3619 {
3620 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3);
3621 char *result = xnew (len1 + len2 + len3 + 1, char);
3622
3623 strcpy (result, s1);
3624 strcpy (result + len1, s2);
3625 strcpy (result + len1 + len2, s3);
3626 result[len1 + len2 + len3] = '\0';
3627
3628 return result;
3629 }
3630 \f
3631 /* Does the same work as the system V getcwd, but does not need to
3632 guess buffer size in advance. */
3633 char *
3634 etags_getcwd ()
3635 #ifdef DOS_NT
3636 {
3637 char *p, path[MAXPATHLEN + 1]; /* Fixed size is safe on MSDOS. */
3638
3639 getwd (path);
3640 p = path;
3641 while (*p)
3642 if (*p == '\\')
3643 *p++ = '/';
3644 else
3645 *p++ = tolower (*p);
3646
3647 return strdup (path);
3648 }
3649 #elif HAVE_GETCWD /* not DOS_NT */
3650 {
3651 int bufsize = 200;
3652 char *path = xnew (bufsize, char);
3653
3654 while (getcwd (path, bufsize) == NULL)
3655 {
3656 if (errno != ERANGE)
3657 pfatal ("pwd");
3658 bufsize *= 2;
3659 path = xnew (bufsize, char);
3660 }
3661
3662 return path;
3663 }
3664 #else /* not DOS_NT and not HAVE_GETCWD */
3665 {
3666 struct linebuffer path;
3667 FILE *pipe;
3668
3669 initbuffer (&path);
3670 pipe = (FILE *) popen ("pwd 2>/dev/null", "r");
3671 if (pipe == NULL || readline_internal (&path, pipe) == 0)
3672 pfatal ("pwd");
3673 pclose (pipe);
3674
3675 return path.buffer;
3676 }
3677 #endif /* not DOS_NT and not HAVE_GETCWD */
3678
3679 /* Return a newly allocated string containing the filename
3680 of FILE relative to the absolute directory DIR (which
3681 should end with a slash). */
3682 char *
3683 relative_filename (file, dir)
3684 char *file, *dir;
3685 {
3686 char *fp, *dp, *res;
3687
3688 /* Find the common root of file and dir. */
3689 fp = absolute_filename (file, cwd);
3690 dp = dir;
3691 while (*fp++ == *dp++)
3692 continue;
3693 do
3694 {
3695 fp--;
3696 dp--;
3697 }
3698 while (*fp != '/');
3699
3700 /* Build a sequence of "../" strings for the resulting relative filename. */
3701 for (dp = etags_strchr (dp + 1, '/'), res = "";
3702 dp != NULL;
3703 dp = etags_strchr (dp + 1, '/'))
3704 {
3705 res = concat (res, "../", "");
3706 }
3707
3708 /* Add the filename relative to the common root of file and dir. */
3709 res = concat (res, fp + 1, "");
3710
3711 return res; /* temporary stub */
3712 }
3713
3714 /* Return a newly allocated string containing the
3715 absolute filename of FILE given CWD (which should
3716 end with a slash). */
3717 char *
3718 absolute_filename (file, cwd)
3719 char *file, *cwd;
3720 {
3721 char *slashp, *cp, *res;
3722
3723 if (file[0] == '/')
3724 res = concat (file, "", "");
3725 else
3726 res = concat (cwd, file, "");
3727
3728 /* Delete the "/dirname/.." and "/." substrings. */
3729 slashp = etags_strchr (res, '/');
3730 while (slashp != NULL && slashp[0] != '\0')
3731 {
3732 if (slashp[1] == '.')
3733 {
3734 if (slashp[2] == '.'
3735 && (slashp[3] == '/' || slashp[3] == '\0'))
3736 {
3737 cp = slashp;
3738 do
3739 cp--;
3740 while (cp >= res && *cp != '/');
3741 if (*cp == '/')
3742 {
3743 strcpy (cp, slashp + 3);
3744 }
3745 else /* else (cp == res) */
3746 {
3747 if (slashp[3] != '\0')
3748 strcpy (cp, slashp + 4);
3749 else
3750 return ".";
3751 }
3752 slashp = cp;
3753 continue;
3754 }
3755 else if (slashp[2] == '/' || slashp[2] == '\0')
3756 {
3757 strcpy (slashp, slashp + 2);
3758 continue;
3759 }
3760 }
3761
3762 slashp = etags_strchr (slashp + 1, '/');
3763 }
3764
3765 return res;
3766 }
3767
3768 /* Return a newly allocated string containing the absolute
3769 filename of dir where FILE resides given CWD (which should
3770 end with a slash). */
3771 char *
3772 absolute_dirname (file, cwd)
3773 char *file, *cwd;
3774 {
3775 char *slashp, *res;
3776 char save;
3777
3778 slashp = etags_strrchr (file, '/');
3779 if (slashp == NULL)
3780 return cwd;
3781 save = slashp[1];
3782 slashp[1] = '\0';
3783 res = absolute_filename (file, cwd);
3784 slashp[1] = save;
3785
3786 return res;
3787 }
3788
3789 /* Like malloc but get fatal error if memory is exhausted. */
3790 char *
3791 xmalloc (size)
3792 unsigned int size;
3793 {
3794 char *result = (char *) malloc (size);
3795 if (result == NULL)
3796 fatal ("virtual memory exhausted", 0);
3797 return result;
3798 }
3799
3800 char *
3801 xrealloc (ptr, size)
3802 char *ptr;
3803 unsigned int size;
3804 {
3805 char *result = (char *) realloc (ptr, size);
3806 if (result == NULL)
3807 fatal ("virtual memory exhausted");
3808 return result;
3809 }