1 /* Tags file maker to go with GNU Emacs
2 Copyright (C) 1984, 87, 88, 89, 93, 94, 95
3 Free Software Foundation, Inc. and Ken Arnold
4 This file is not considered part of GNU Emacs.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
22 * Ctags originally by Ken Arnold.
23 * Fortran added by Jim Kleckner.
24 * Ed Pelegri-Llopart added C typedefs.
25 * Gnu Emacs TAGS format and modifications by RMS?
26 * Sam Kendall added C++.
27 * Francesco Potorti` reorganised C and C++ based on work by Joe Wells.
29 * Regexp tags by Tom Tromey.
32 * Francesco Potorti` (pot@cnuce.cnr.it) is the current maintainer.
35 char pot_etags_version
[] = "@(#) pot revision number is 11.30";
45 #include <sys/param.h>
52 #define MAXPATHLEN _MAX_PATH
57 /* On some systems, Emacs defines static as nothing for the sake
58 of unexec. We don't want that here since we don't use unexec. */
68 #include <sys/types.h>
71 #if !defined (S_ISREG) && defined (S_IFREG)
72 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
79 #endif /* ETAGS_REGEXPS */
81 /* Define CTAGS to make the program "ctags" compatible with the usual one.
82 Let it undefined to make the program "etags", which makes emacs-style
83 tag tables and tags typedefs, #defines and struct/union/enum by default. */
91 /* Exit codes for success and failure. */
101 #define C_PLPL 0x00001 /* C++ */
102 #define C_STAR 0x00003 /* C* */
103 #define YACC 0x10000 /* yacc file */
105 #define streq(s,t) (strcmp (s, t) == 0)
106 #define strneq(s,t,n) (strncmp (s, t, n) == 0)
108 #define iswhite(arg) (_wht[arg]) /* T if char is white */
109 #define begtoken(arg) (_btk[arg]) /* T if char can start token */
110 #define intoken(arg) (_itk[arg]) /* T if char can be in token */
111 #define endtoken(arg) (_etk[arg]) /* T if char ends tokens */
114 * xnew -- allocate storage
116 * SYNOPSIS: Type *xnew (int n, Type);
118 #define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
123 { /* sorting structure */
124 char *name
; /* function or type name */
125 char *file
; /* file name */
126 logical is_func
; /* use pattern or line no */
127 logical named
; /* list name separately */
128 logical been_warned
; /* set if noticed dup */
129 int lno
; /* line number tag is on */
130 long cno
; /* character number line starts on */
131 char *pat
; /* search pattern */
132 struct nd_st
*left
, *right
; /* left and right sons */
135 extern char *getenv ();
138 char *savenstr (), *savestr ();
139 char *etags_strchr (), *etags_strrchr ();
140 char *etags_getcwd ();
141 char *relative_filename (), *absolute_filename (), *absolute_dirname ();
142 long *xmalloc (), *xrealloc ();
144 typedef void Lang_function ();
145 #if FALSE /* many compilers barf on this */
146 Lang_function Asm_labels
;
147 Lang_function default_C_entries
;
148 Lang_function C_entries
;
149 Lang_function Cplusplus_entries
;
150 Lang_function Cstar_entries
;
151 Lang_function Fortran_functions
;
152 Lang_function Yacc_entries
;
153 Lang_function Lisp_functions
;
154 Lang_function Pascal_functions
;
155 Lang_function Prolog_functions
;
156 Lang_function Scheme_functions
;
157 Lang_function TeX_functions
;
158 Lang_function just_read_file
;
159 #else /* so let's write it this way */
161 void default_C_entries ();
163 void Cplusplus_entries ();
164 void Cstar_entries ();
165 void Fortran_functions ();
166 void Yacc_entries ();
167 void Lisp_functions ();
168 void Pascal_functions ();
169 void Prolog_functions ();
170 void Scheme_functions ();
171 void TeX_functions ();
172 void just_read_file ();
175 logical
get_language ();
176 int total_size_of_entries ();
178 long readline_internal ();
184 void fatal (), pfatal ();
185 void find_entries ();
191 void process_file ();
196 char searchar
= '/'; /* use /.../ searches */
198 int lineno
; /* line number of current line */
199 long charno
; /* current character number */
201 long linecharno
; /* charno of start of line; not used by C,
202 but by every other language. */
204 char *curfile
; /* current input file name */
205 char *tagfile
; /* output file */
206 char *progname
; /* name this program was invoked with */
207 char *cwd
; /* current working directory */
208 char *tagfiledir
; /* directory of tagfile */
210 FILE *tagf
; /* ioptr for tags file */
211 NODE
*head
; /* the head of the binary tree of tags */
214 * A `struct linebuffer' is a structure which holds a line of text.
215 * `readline' reads a line from a stream into a linebuffer and works
216 * regardless of the length of the line.
224 struct linebuffer lb
; /* the current line */
225 struct linebuffer token_name
; /* used by C_entries as temporary area */
229 struct linebuffer lb
; /* used by C_entries instead of lb */
232 /* boolean "functions" (see init) */
233 logical _wht
[0177], _etk
[0177], _itk
[0177], _btk
[0177];
235 *white
= " \f\t\n\013", /* white chars */
236 *endtk
= " \t\n\013\"'#()[]{}=-+%*/&|^~!<>;,.:?", /* token ending chars */
237 /* token starting chars */
238 *begtk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~",
239 /* valid in-token chars */
240 *intk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
242 logical append_to_tagfile
; /* -a: append to tags */
243 /* The following three default to TRUE for etags, but to FALSE for ctags. */
244 logical typedefs
; /* -t: create tags for typedefs */
245 logical typedefs_and_cplusplus
; /* -T: create tags for typedefs, level */
246 /* 0 struct/enum/union decls, and C++ */
247 /* member functions. */
248 logical constantypedefs
; /* -d: create tags for C #define and enum */
249 /* constants. Enum consts not implemented. */
250 /* -D: opposite of -d. Default under ctags. */
251 logical update
; /* -u: update tags */
252 logical vgrind_style
; /* -v: create vgrind style index output */
253 logical no_warnings
; /* -w: suppress warnings */
254 logical cxref_style
; /* -x: create cxref style output */
255 logical cplusplus
; /* .[hc] means C++, not C */
256 logical noindentypedefs
; /* -I: ignore indentation in C */
257 #define permit_duplicates TRUE /* allow duplicate tags */
259 struct option longopts
[] =
261 { "append", no_argument
, NULL
, 'a' },
262 { "backward-search", no_argument
, NULL
, 'B' },
263 { "c++", no_argument
, NULL
, 'C' },
264 { "cxref", no_argument
, NULL
, 'x' },
265 { "defines", no_argument
, NULL
, 'd' },
266 { "help", no_argument
, NULL
, 'h' },
267 { "help", no_argument
, NULL
, 'H' },
268 { "ignore-indentation", no_argument
, NULL
, 'I' },
269 { "include", required_argument
, NULL
, 'i' },
270 { "language", required_argument
, NULL
, 'l' },
271 { "no-defines", no_argument
, NULL
, 'D' },
272 { "no-regex", no_argument
, NULL
, 'R' },
273 { "no-warn", no_argument
, NULL
, 'w' },
274 { "output", required_argument
, NULL
, 'o' },
275 { "regex", required_argument
, NULL
, 'r' },
276 { "typedefs", no_argument
, NULL
, 't' },
277 { "typedefs-and-c++", no_argument
, NULL
, 'T' },
278 { "update", no_argument
, NULL
, 'u' },
279 { "version", no_argument
, NULL
, 'V' },
280 { "vgrind", no_argument
, NULL
, 'v' },
285 /* Structure defining a regular expression. Elements are
286 the compiled pattern, and the name string. */
289 struct re_pattern_buffer
*pattern
;
290 struct re_registers regs
;
292 logical error_signaled
;
295 /* Number of regexps found. */
296 int num_patterns
= 0;
298 /* Array of all regexps. */
299 struct pattern
*patterns
= NULL
;
300 #endif /* ETAGS_REGEXPS */
302 /* Language stuff. */
306 Lang_function
*function
;
309 /* Table of language names and corresponding functions. */
310 /* It is ok for a given function to be listed under more than one
311 name. I just didn't. */
312 /* "auto" language reverts to default behavior. */
313 struct lang_entry lang_names
[] =
315 { "asm", Asm_labels
},
316 { "c", default_C_entries
},
317 { "c++", Cplusplus_entries
},
318 { "c*", Cstar_entries
},
319 { "fortran", Fortran_functions
},
320 { "lisp", Lisp_functions
},
321 { "none", just_read_file
},
322 { "pascal", Pascal_functions
},
323 { "scheme" , Scheme_functions
},
324 { "tex", TeX_functions
},
329 /* Table of file extensions and corresponding language functions. */
330 struct lang_entry lang_extensions
[] =
332 /* Assume that ".s" or ".a" is assembly code. -wolfgang.
334 { "a", Asm_labels
}, /* Unix assembler */
335 { "asm", Asm_labels
}, /* Microcontroller assembly */
336 { "def", Asm_labels
}, /* BSO/Tasking definition includes */
337 { "inc", Asm_labels
}, /* Microcontroller include files */
338 { "ins", Asm_labels
}, /* Microcontroller include files */
340 { "sa", Asm_labels
}, /* Unix assembler */
341 { "src", Asm_labels
}, /* BSO/Tasking C compiler output */
343 /* .aux, .bbl, .clo, .cls, .dtx or .tex implies LaTeX source code. */
344 { "aux", TeX_functions
},
345 { "bbl", TeX_functions
},
346 { "clo", TeX_functions
},
347 { "cls", TeX_functions
},
348 { "dtx", TeX_functions
},
349 { "sty", TeX_functions
},
350 { "tex", TeX_functions
},
352 /* .l or .el or .lisp (or .cl or .clisp or ...) implies lisp source code */
353 { "cl", Lisp_functions
},
354 { "clisp", Lisp_functions
},
355 { "el", Lisp_functions
},
356 { "l", Lisp_functions
},
357 { "lisp", Lisp_functions
},
358 { "lsp", Lisp_functions
},
360 /* .scm or .sm or .scheme implies scheme source code */
361 { "SCM", Scheme_functions
},
362 { "SM", Scheme_functions
},
363 { "oak", Scheme_functions
},
364 { "sch", Scheme_functions
},
365 { "scheme", Scheme_functions
},
366 { "scm", Scheme_functions
},
367 { "sm", Scheme_functions
},
368 { "t", Scheme_functions
},
369 /* FIXME Can't do the `SCM' or `scm' prefix with a version number */
371 /* Note that ".c" and ".h" can be considered C++, if the --c++
372 flag was given. That is why default_C_entries is called here. */
373 { "c", default_C_entries
},
374 { "h", default_C_entries
},
376 /* .C or .H or .c++ or .cc or .cpp or .cxx or .h++ or .hh or .hxx:
378 { "C", Cplusplus_entries
},
379 { "H", Cplusplus_entries
},
380 { "c++", Cplusplus_entries
},
381 { "cc", Cplusplus_entries
},
382 { "cpp", Cplusplus_entries
},
383 { "cxx", Cplusplus_entries
},
384 { "h++", Cplusplus_entries
},
385 { "hh", Cplusplus_entries
},
386 { "hxx", Cplusplus_entries
},
388 /* .y: a yacc file */
389 { "y", Yacc_entries
},
391 /* .cs or .hs: a C* file */
392 { "cs", Cstar_entries
},
393 { "hs", Cstar_entries
},
395 /* .f and .for are FORTRAN. */
396 { "F", Fortran_functions
},
397 { "f", Fortran_functions
},
398 { "for", Fortran_functions
},
400 /* .pl implies prolog source code */
401 { "pl", Prolog_functions
},
403 /* .p or .pas: a Pascal file */
404 { "p", Pascal_functions
},
405 { "pas", Pascal_functions
},
410 /* Non-NULL if language fixed. */
411 Lang_function
*lang_func
= NULL
;
415 print_language_names ()
417 struct lang_entry
*name
, *ext
;
419 puts ("\nThese are the currently supported languages, along with the\n\
420 default extensions for files:");
421 for (name
= lang_names
; name
->extension
; ++name
)
423 printf ("\t%s\t", name
->extension
);
424 for (ext
= lang_extensions
; ext
->extension
; ++ext
)
425 if (name
->function
== ext
->function
)
426 printf (" .%s", ext
->extension
);
429 puts ("Where `auto' means use default language for files based on filename\n\
430 extension, and `none' means only do regexp processing on files.\n\
431 If no language is specified and no extension is found for some file,\n\
432 Fortran is tried first; if no tags are found, C is tried next.");
439 printf ("%s for Emacs version %s.\n", (CTAGS
) ? "CTAGS" : "ETAGS", VERSION
);
441 printf ("%s for Emacs version 19.\n", (CTAGS
) ? "CTAGS" : "ETAGS");
450 printf ("These are the options accepted by %s. You may use unambiguous\n\
451 abbreviations for the long option names. A - as file name means read\n\
452 names from stdin.\n\n", progname
);
454 puts ("-a, --append\n\
455 Append tag entries to existing tags file.");
458 puts ("-B, --backward-search\n\
459 Write the search commands for the tag entries using '?', the\n\
460 backward-search command instead of '/', the forward-search command.");
463 Treat files whose extension defaults to C language as C++ files.");
466 puts ("-d, --defines\n\
467 Create tag entries for constant C #defines, too.");
469 puts ("-D, --no-defines\n\
470 Don't create tag entries for constant C #defines. This makes\n\
471 the tags file smaller.");
475 puts ("-i FILE, --include=FILE\n\
476 Include a note in tag file indicating that, when searching for\n\
477 a tag, one should also consult the tags file FILE after\n\
478 checking the current file.");
479 puts ("-l LANG, --language=LANG\n\
480 Force the following files to be considered as written in the\n\
481 named language up to the next --language=LANG option.");
485 puts ("-r /REGEXP/, --regex=/REGEXP/\n\
486 Make a tag for each line matching pattern REGEXP in the\n\
487 following files. REGEXP is anchored (as if preceded by ^).\n\
488 The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
489 named tags can be created with:\n\
490 --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
491 puts ("-R, --no-regex\n\
492 Don't create tags from regexps for the following files.");
493 #endif /* ETAGS_REGEXPS */
494 puts ("-o FILE, --output=FILE\n\
495 Write the tags to FILE.");
496 puts ("-I, --ignore-indentation\n\
497 Don't rely on indentation quite as much as normal. Currently,\n\
498 this means not to assume that a closing brace in the first\n\
499 column is the final brace of a function or structure\n\
500 definition in C and C++.");
504 puts ("-t, --typedefs\n\
505 Generate tag entries for C typedefs.");
506 puts ("-T, --typedefs-and-c++\n\
507 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
508 and C++ member functions.");
509 puts ("-u, --update\n\
510 Update the tag entries for the given files, leaving tag\n\
511 entries for other files in place. Currently, this is\n\
512 implemented by deleting the existing entries for the given\n\
513 files and then rewriting the new entries at the end of the\n\
514 tags file. It is often faster to simply rebuild the entire\n\
515 tag file than to use this.");
516 puts ("-v, --vgrind\n\
517 Generates an index of items intended for human consumption,\n\
518 similar to the output of vgrind. The index is sorted, and\n\
519 gives the page number of each item.");
520 puts ("-w, --no-warn\n\
521 Suppress warning messages about entries defined in multiple\n\
523 puts ("-x, --cxref\n\
524 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
525 The output uses line numbers instead of page numbers, but\n\
526 beyond that the differences are cosmetic; try both to see\n\
530 puts ("-V, --version\n\
531 Print the version of the program.\n\
533 Print this help message.");
535 print_language_names ();
548 /* This structure helps us allow mixing of --lang and filenames. */
551 enum argument_type arg_type
;
553 Lang_function
*function
;
556 #ifdef VMS /* VMS specific functions */
560 /* This is a BUG! ANY arbitrary limit is a BUG!
561 Won't someone please fix this? */
562 #define MAX_FILE_SPEC_LEN 255
565 char body
[MAX_FILE_SPEC_LEN
+ 1];
569 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
570 returning in each successive call the next filename matching the input
571 spec. The function expects that each in_spec passed
572 to it will be processed to completion; in particular, up to and
573 including the call following that in which the last matching name
574 is returned, the function ignores the value of in_spec, and will
575 only start processing a new spec with the following call.
576 If an error occurs, on return out_spec contains the value
577 of in_spec when the error occurred.
579 With each successive filename returned in out_spec, the
580 function's return value is one. When there are no more matching
581 names the function returns zero. If on the first call no file
582 matches in_spec, or there is any other error, -1 is returned.
587 #define OUTSIZE MAX_FILE_SPEC_LEN
593 static long context
= 0;
594 static struct dsc$descriptor_s o
;
595 static struct dsc$descriptor_s i
;
596 static logical pass1
= TRUE
;
603 o
.dsc$a_pointer
= (char *) out
;
604 o
.dsc$w_length
= (short)OUTSIZE
;
605 i
.dsc$a_pointer
= in
;
606 i
.dsc$w_length
= (short)strlen(in
);
607 i
.dsc$b_dtype
= DSC$K_DTYPE_T
;
608 i
.dsc$b_class
= DSC$K_CLASS_S
;
609 o
.dsc$b_dtype
= DSC$K_DTYPE_VT
;
610 o
.dsc$b_class
= DSC$K_CLASS_VS
;
612 if ((status
= lib$
find_file(&i
, &o
, &context
, 0, 0)) == RMS$_NORMAL
)
614 out
->body
[out
->curlen
] = EOS
;
617 else if (status
== RMS$_NMF
)
621 strcpy(out
->body
, in
);
624 lib$
find_file_end(&context
);
630 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
631 name of each file specified by the provided arg expanding wildcards.
634 gfnames (arg
, p_error
)
638 static vspec filename
= {MAX_FILE_SPEC_LEN
, "\0"};
640 switch (fn_exp (&filename
, arg
))
644 return filename
.body
;
650 return filename
.body
;
654 #ifndef OLD /* Newer versions of VMS do provide `system'. */
658 fprintf (stderr
, "system() function not implemented under VMS\n");
662 #define VERSION_DELIM ';'
663 char *massage_name (s
)
669 if (*s
== VERSION_DELIM
)
687 unsigned int nincluded_files
= 0;
688 char **included_files
= xnew (argc
, char *);
691 int current_arg
= 0, file_count
= 0;
692 struct linebuffer filename_lb
;
698 _fmode
= O_BINARY
; /* all of files are treated as binary files */
703 /* Allocate enough no matter what happens. Overkill, but each one
705 argbuffer
= xnew (argc
, ARGUMENT
);
708 /* Set syntax for regular expression routines. */
709 re_set_syntax (RE_SYNTAX_EMACS
);
710 #endif /* ETAGS_REGEXPS */
713 * If etags, always find typedefs and structure tags. Why not?
714 * Also default is to find macro constants.
717 typedefs
= typedefs_and_cplusplus
= constantypedefs
= TRUE
;
721 int opt
= getopt_long (argc
, argv
,
722 "-aCdDf:Il:o:r:RStTi:BuvxwVhH", longopts
, 0);
730 /* If getopt returns 0, then it has already processed a
731 long-named option. We should do nothing. */
735 /* This means that a filename has been seen. Record it. */
736 argbuffer
[current_arg
].arg_type
= at_filename
;
737 argbuffer
[current_arg
].what
= optarg
;
742 /* Common options. */
744 append_to_tagfile
= TRUE
;
750 constantypedefs
= TRUE
;
753 constantypedefs
= FALSE
;
755 case 'f': /* for compatibility with old makefiles */
759 fprintf (stderr
, "%s: -%c option may only be given once.\n",
766 case 'S': /* for backward compatibility */
767 noindentypedefs
= TRUE
;
770 if (!get_language (optarg
, &argbuffer
[current_arg
].function
))
772 fprintf (stderr
, "%s: language \"%s\" not recognized.\n",
776 argbuffer
[current_arg
].arg_type
= at_language
;
781 argbuffer
[current_arg
].arg_type
= at_regexp
;
782 argbuffer
[current_arg
].what
= optarg
;
786 argbuffer
[current_arg
].arg_type
= at_regexp
;
787 argbuffer
[current_arg
].what
= NULL
;
790 #endif /* ETAGS_REGEXPS */
802 typedefs
= typedefs_and_cplusplus
= TRUE
;
807 included_files
[nincluded_files
++] = optarg
;
832 for (; optind
< argc
; ++optind
)
834 argbuffer
[current_arg
].arg_type
= at_filename
;
835 argbuffer
[current_arg
].what
= argv
[optind
];
840 if (nincluded_files
== 0 && file_count
== 0)
842 fprintf (stderr
, "%s: No input files specified.\n", progname
);
845 fprintf (stderr
, "\tTry `%s --help' for a complete list of options.\n",
852 tagfile
= CTAGS
? "tags" : "TAGS";
854 cwd
= etags_getcwd (); /* the current working directory */
856 if (streq (tagfile
, "-"))
862 tagfiledir
= absolute_dirname (tagfile
, cwd
);
865 init (); /* set up boolean "functions" */
868 initbuffer (&token_name
);
869 initbuffer (&lbs
[0].lb
);
870 initbuffer (&lbs
[1].lb
);
871 initbuffer (&filename_lb
);
875 if (streq (tagfile
, "-"))
878 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
884 * Loop through files finding functions.
886 for (i
= 0; i
< current_arg
; ++i
)
888 switch (argbuffer
[i
].arg_type
)
891 lang_func
= argbuffer
[i
].function
;
895 add_regex (argbuffer
[i
].what
);
900 while ((this_file
= gfnames (argbuffer
[i
].what
, &got_err
)) != NULL
)
904 error ("Can't find file %s\n", this_file
);
909 this_file
= massage_name (this_file
);
912 this_file
= argbuffer
[i
].what
;
914 /* Input file named "-" means read file names from stdin
916 if (streq (this_file
, "-"))
917 while (readline_internal (&filename_lb
, stdin
) > 0)
918 process_file (filename_lb
.buffer
);
920 process_file (this_file
);
930 while (nincluded_files
-- > 0)
931 fprintf (tagf
, "\f\n%s,include\n", *included_files
++);
937 /* If CTAGS, we are here. process_file did not write the tags yet,
938 because we want them ordered. Let's do it now. */
941 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
951 for (i
= 0; i
< current_arg
; ++i
)
953 if (argbuffer
[i
].arg_type
!= at_filename
)
956 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
957 tagfile
, argbuffer
[i
].what
, tagfile
);
958 if (system (cmd
) != GOOD
)
959 fatal ("failed to execute shell command");
961 append_to_tagfile
= TRUE
;
964 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
973 sprintf (cmd
, "sort %s -o %s", tagfile
, tagfile
);
981 * Set the language, given the name.
984 get_language (language
, func
)
986 Lang_function
**func
;
988 struct lang_entry
*lang
;
990 for (lang
= lang_names
; lang
->extension
; ++lang
)
992 if (streq (language
, lang
->extension
))
994 *func
= lang
->function
;
1004 * This routine is called on each file argument.
1010 struct stat stat_buf
;
1013 if (stat (file
, &stat_buf
) == 0 && !S_ISREG (stat_buf
.st_mode
))
1015 fprintf (stderr
, "Skipping %s: it is not a regular file.\n", file
);
1018 if (streq (file
, tagfile
) && !streq (tagfile
, "-"))
1020 fprintf (stderr
, "Skipping inclusion of %s in self.\n", file
);
1023 inf
= fopen (file
, "r");
1030 find_entries (file
, inf
);
1037 if (file
[0] == '/' || (isalpha (file
[0]) && file
[1] == ':'))
1042 /* file is an absolute filename. Canonicalise it. */
1043 filename
= absolute_filename (file
, cwd
);
1047 /* file is a filename relative to cwd. Make it relative
1048 to the directory of the tags file. */
1049 filename
= relative_filename (file
, tagfiledir
);
1051 fprintf (tagf
, "\f\n%s,%d\n", filename
, total_size_of_entries (head
));
1060 * This routine sets up the boolean pseudo-functions which work
1061 * by setting boolean flags dependent upon the corresponding character
1062 * Every char which is NOT in that string is not a white char. Therefore,
1063 * all of the array "_wht" is set to FALSE, and then the elements
1064 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
1065 * of a char is TRUE if it is the string "white", else FALSE.
1073 for (i
= 0; i
< 0177; i
++)
1074 _wht
[i
] = _etk
[i
] = _itk
[i
] = _btk
[i
] = FALSE
;
1075 for (sp
= white
; *sp
; sp
++)
1077 for (sp
= endtk
; *sp
; sp
++)
1079 for (sp
= intk
; *sp
; sp
++)
1081 for (sp
= begtk
; *sp
; sp
++)
1083 _wht
[0] = _wht
['\n'];
1084 _etk
[0] = _etk
['\n'];
1085 _btk
[0] = _btk
['\n'];
1086 _itk
[0] = _itk
['\n'];
1090 * This routine opens the specified file and calls the function
1091 * which finds the function and type definitions.
1094 find_entries (file
, inf
)
1099 struct lang_entry
*lang
;
1100 NODE
*old_last_node
;
1101 extern NODE
*last_node
;
1103 curfile
= savestr (file
);
1104 cp
= etags_strrchr (file
, '.');
1106 /* If user specified a language, use it. */
1107 if (lang_func
!= NULL
)
1117 for (lang
= lang_extensions
; lang
->extension
; ++lang
)
1119 if (streq (cp
, lang
->extension
))
1121 lang
->function (inf
);
1129 old_last_node
= last_node
;
1130 Fortran_functions (inf
);
1132 /* No Fortran entries found. Try C. */
1133 if (old_last_node
== last_node
)
1134 default_C_entries (inf
);
1140 pfnote (name
, is_func
, named
, linestart
, linelen
, lno
, cno
)
1141 char *name
; /* tag name */
1142 logical is_func
; /* tag is a function */
1143 logical named
; /* tag different from text of definition */
1144 char *linestart
; /* start of the line where tag is */
1145 int linelen
; /* length of the line where tag is */
1146 int lno
; /* line number */
1147 long cno
; /* character number */
1149 register NODE
*np
= xnew (1, NODE
);
1152 /* If ctags mode, change name "main" to M<thisfilename>. */
1153 if (CTAGS
&& !cxref_style
&& streq (name
, "main"))
1155 fp
= etags_strrchr (curfile
, '/');
1156 np
->name
= concat ("M", fp
== 0 ? curfile
: fp
+ 1, "");
1157 fp
= etags_strrchr (np
->name
, '.');
1158 if (fp
&& fp
[1] != '\0' && fp
[2] == '\0')
1167 np
->been_warned
= FALSE
;
1169 np
->is_func
= is_func
;
1171 /* Our char numbers are 0-base, because of C language tradition?
1172 ctags compatibility? old versions compatibility? I don't know.
1173 Anyway, since emacs's are 1-base we espect etags.el to take care
1174 of the difference. If we wanted to have 1-based numbers, we would
1175 uncomment the +1 below. */
1176 np
->cno
= cno
/* + 1 */ ;
1177 np
->left
= np
->right
= NULL
;
1178 np
->pat
= savenstr (linestart
, ((CTAGS
&& !cxref_style
) ? 50 : linelen
));
1180 add_node (np
, &head
);
1185 * recurse on left children, iterate on right children.
1189 register NODE
*node
;
1193 register NODE
*node_right
= node
->right
;
1194 free_tree (node
->left
);
1198 free ((char *) node
);
1205 * Adds a node to the tree of nodes. In etags mode, we don't keep
1206 * it sorted; we just keep a linear list. In ctags mode, maintain
1207 * an ordered tree, with no attempt at balancing.
1209 * add_node is the only function allowed to add nodes, so it can
1212 NODE
*last_node
= NULL
;
1214 add_node (node
, cur_node_p
)
1215 NODE
*node
, **cur_node_p
;
1218 register NODE
*cur_node
= *cur_node_p
;
1220 if (cur_node
== NULL
)
1230 if (last_node
== NULL
)
1231 fatal ("internal error in add_node", 0);
1232 last_node
->right
= node
;
1238 dif
= strcmp (node
->name
, cur_node
->name
);
1241 * If this tag name matches an existing one, then
1242 * do not add the node, but maybe print a warning.
1246 if (node
->file
== cur_node
->file
)
1250 fprintf (stderr
, "Duplicate entry in file %s, line %d: %s\n",
1251 node
->file
, lineno
, node
->name
);
1252 fprintf (stderr
, "Second entry ignored\n");
1256 if (!cur_node
->been_warned
&& !no_warnings
)
1259 "Duplicate entry in files %s and %s: %s (Warning only)\n",
1260 node
->file
, cur_node
->file
, node
->name
);
1262 cur_node
->been_warned
= TRUE
;
1266 /* Maybe refuse to add duplicate nodes. */
1267 if (!permit_duplicates
)
1269 if (streq (node
->name
, cur_node
->name
)
1270 && streq (node
->file
, cur_node
->file
))
1274 /* Actually add the node */
1275 add_node (node
, dif
< 0 ? &cur_node
->left
: &cur_node
->right
);
1281 register NODE
*node
;
1288 /* Output subentries that precede this one */
1289 put_entries (node
->left
);
1291 /* Output this entry */
1297 fprintf (tagf
, "%s\177%s\001%d,%d\n",
1298 node
->pat
, node
->name
,
1299 node
->lno
, node
->cno
);
1303 fprintf (tagf
, "%s\177%d,%d\n",
1305 node
->lno
, node
->cno
);
1308 else if (!cxref_style
)
1310 fprintf (tagf
, "%s\t%s\t",
1311 node
->name
, node
->file
);
1315 putc (searchar
, tagf
);
1318 for (sp
= node
->pat
; *sp
; sp
++)
1320 if (*sp
== '\\' || *sp
== searchar
)
1324 putc (searchar
, tagf
);
1327 { /* a typedef; text pattern inadequate */
1328 fprintf (tagf
, "%d", node
->lno
);
1332 else if (vgrind_style
)
1333 fprintf (stdout
, "%s %s %d\n",
1334 node
->name
, node
->file
, (node
->lno
+ 63) / 64);
1336 fprintf (stdout
, "%-16s %3d %-16s %s\n",
1337 node
->name
, node
->lno
, node
->file
, node
->pat
);
1339 /* Output subentries that follow this one */
1340 put_entries (node
->right
);
1343 /* Length of a number's decimal representation. */
1351 for (; num
; num
/= 10)
1357 * Return total number of characters that put_entries will output for
1358 * the nodes in the subtree of the specified node. Works only if
1359 * we are not ctags, but called only in that case. This count
1360 * is irrelevant with the new tags.el, but is still supplied for
1361 * backward compatibility.
1364 total_size_of_entries (node
)
1365 register NODE
*node
;
1373 for (; node
; node
= node
->right
)
1375 /* Count left subentries. */
1376 total
+= total_size_of_entries (node
->left
);
1378 /* Count this entry */
1379 total
+= strlen (node
->pat
) + 1;
1380 total
+= number_len ((long) node
->lno
) + 1 + number_len (node
->cno
) + 1;
1382 total
+= 1 + strlen (node
->name
); /* \001name */
1389 * The C symbol tables.
1393 st_none
, st_C_struct
, st_C_enum
, st_C_define
, st_C_typedef
, st_C_typespec
1396 /* Feed stuff between (but not including) %[ and %] lines to:
1397 gperf -c -k1,3 -o -p -r -t
1399 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
1401 class, C_PLPL, st_C_struct
1402 domain, C_STAR, st_C_struct
1403 union, 0, st_C_struct
1404 struct, 0, st_C_struct
1406 typedef, 0, st_C_typedef
1407 define, 0, st_C_define
1408 long, 0, st_C_typespec
1409 short, 0, st_C_typespec
1410 int, 0, st_C_typespec
1411 char, 0, st_C_typespec
1412 float, 0, st_C_typespec
1413 double, 0, st_C_typespec
1414 signed, 0, st_C_typespec
1415 unsigned, 0, st_C_typespec
1416 auto, 0, st_C_typespec
1417 void, 0, st_C_typespec
1418 extern, 0, st_C_typespec
1419 static, 0, st_C_typespec
1420 const, 0, st_C_typespec
1421 volatile, 0, st_C_typespec
1423 and replace lines between %< and %> with its output. */
1425 /* C code produced by gperf version 1.8.1 (K&R C version) */
1426 /* Command-line: gperf -c -k1,3 -o -p -r -t */
1429 struct C_stab_entry
{ char *name
; int c_ext
; enum sym_type type
; };
1431 #define MIN_WORD_LENGTH 3
1432 #define MAX_WORD_LENGTH 8
1433 #define MIN_HASH_VALUE 10
1434 #define MAX_HASH_VALUE 62
1437 53 is the maximum key range
1445 static unsigned char hash_table
[] =
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, 62, 62, 62,
1450 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1451 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1452 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1453 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1454 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1455 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1456 62, 62, 62, 62, 62, 62, 62, 2, 62, 7,
1457 6, 9, 15, 30, 62, 24, 62, 62, 1, 24,
1458 7, 27, 13, 62, 19, 26, 18, 27, 1, 62,
1459 62, 62, 62, 62, 62, 62, 62, 62,
1461 return len
+ hash_table
[str
[2]] + hash_table
[str
[0]];
1464 struct C_stab_entry
*
1465 in_word_set (str
, len
)
1470 static struct C_stab_entry wordlist
[] =
1472 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
1474 {"volatile", 0, st_C_typespec
},
1476 {"long", 0, st_C_typespec
},
1477 {"char", 0, st_C_typespec
},
1478 {"class", C_PLPL
, st_C_struct
},
1479 {"",}, {"",}, {"",}, {"",},
1480 {"const", 0, st_C_typespec
},
1481 {"",}, {"",}, {"",}, {"",},
1482 {"auto", 0, st_C_typespec
},
1484 {"define", 0, st_C_define
},
1486 {"void", 0, st_C_typespec
},
1487 {"",}, {"",}, {"",},
1488 {"extern", 0, st_C_typespec
},
1489 {"static", 0, st_C_typespec
},
1491 {"domain", C_STAR
, st_C_struct
},
1493 {"typedef", 0, st_C_typedef
},
1494 {"double", 0, st_C_typespec
},
1495 {"enum", 0, st_C_enum
},
1496 {"",}, {"",}, {"",}, {"",},
1497 {"int", 0, st_C_typespec
},
1499 {"float", 0, st_C_typespec
},
1500 {"",}, {"",}, {"",},
1501 {"struct", 0, st_C_struct
},
1502 {"",}, {"",}, {"",}, {"",},
1503 {"union", 0, st_C_struct
},
1505 {"short", 0, st_C_typespec
},
1507 {"unsigned", 0, st_C_typespec
},
1508 {"signed", 0, st_C_typespec
},
1511 if (len
<= MAX_WORD_LENGTH
&& len
>= MIN_WORD_LENGTH
)
1513 register int key
= hash (str
, len
);
1515 if (key
<= MAX_HASH_VALUE
&& key
>= MIN_HASH_VALUE
)
1517 register char *s
= wordlist
[key
].name
;
1519 if (*s
== *str
&& strneq (str
+ 1, s
+ 1, len
- 1))
1520 return &wordlist
[key
];
1528 C_symtype(str
, len
, c_ext
)
1533 register struct C_stab_entry
*se
= in_word_set(str
, len
);
1535 if (se
== NULL
|| (se
->c_ext
&& !(c_ext
& se
->c_ext
)))
1541 * C functions are recognized using a simple finite automaton.
1542 * funcdef is its state variable.
1546 fnone
, /* nothing seen */
1547 ftagseen
, /* function-like tag seen */
1548 fstartlist
, /* just after open parenthesis */
1549 finlist
, /* in parameter list */
1550 flistseen
, /* after parameter list */
1551 fignore
/* before open brace */
1557 * typedefs are recognized using a simple finite automaton.
1558 * typeddef is its state variable.
1562 tnone
, /* nothing seen */
1563 ttypedseen
, /* typedef keyword seen */
1564 tinbody
, /* inside typedef body */
1565 tend
, /* just before typedef tag */
1566 tignore
/* junk after typedef tag */
1572 * struct-like structures (enum, struct and union) are recognized
1573 * using another simple finite automaton. `structdef' is its state
1578 snone
, /* nothing seen yet */
1579 skeyseen
, /* struct-like keyword seen */
1580 stagseen
, /* struct-like tag seen */
1581 scolonseen
, /* colon seen after struct-like tag */
1582 sinbody
/* in struct body: recognize member func defs*/
1587 * When structdef is stagseen, scolonseen, or sinbody, structtag is the
1588 * struct tag, and structtype is the type of the preceding struct-like
1591 char *structtag
= "<uninited>";
1592 enum sym_type structtype
;
1595 * Yet another little state machine to deal with preprocessor lines.
1599 dnone
, /* nothing seen */
1600 dsharpseen
, /* '#' seen as first char on line */
1601 ddefineseen
, /* '#' and 'define' seen */
1602 dignorerest
/* ignore rest of line */
1607 * Set this to TRUE, and the next token considered is called a function.
1608 * Used only for GNU emacs's function-defining macros.
1610 logical next_token_is_func
;
1613 * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
1619 * checks to see if the current token is at the start of a
1620 * function, or corresponds to a typedef, or is a struct/union/enum
1623 * *IS_FUNC gets TRUE iff the token is a function or macro with args.
1624 * C_EXT is which language we are looking at.
1626 * In the future we will need some way to adjust where the end of
1627 * the token is; for instance, implementing the C++ keyword
1628 * `operator' properly will adjust the end of the token to be after
1629 * whatever follows `operator'.
1636 * next_token_is_func IN OUT
1640 consider_token (str
, len
, c
, c_ext
, cblev
, is_func
)
1641 register char *str
; /* IN: token pointer */
1642 register int len
; /* IN: token length */
1643 register char c
; /* IN: first char after the token */
1644 int c_ext
; /* IN: C extensions mask */
1645 int cblev
; /* IN: curly brace level */
1646 logical
*is_func
; /* OUT: function found */
1648 enum sym_type toktype
= C_symtype (str
, len
, c_ext
);
1651 * Advance the definedef state machine.
1656 /* We're not on a preprocessor line. */
1659 if (toktype
== st_C_define
)
1661 definedef
= ddefineseen
;
1665 definedef
= dignorerest
;
1670 * Make a tag for any macro, unless it is a constant
1671 * and constantypedefs is FALSE.
1673 definedef
= dignorerest
;
1674 *is_func
= (c
== '(');
1675 if (!*is_func
&& !constantypedefs
)
1682 error ("internal error: definedef value.", 0);
1691 if (toktype
== st_C_typedef
)
1694 typdef
= ttypedseen
;
1710 /* Do not return here, so the structdef stuff has a chance. */
1724 * This structdef business is currently only invoked when cblev==0.
1725 * It should be recursively invoked whatever the curly brace level,
1726 * and a stack of states kept, to allow for definitions of structs
1729 * This structdef business is NOT invoked when we are ctags and the
1730 * file is plain C. This is because a struct tag may have the same
1731 * name as another tag, and this loses with ctags.
1733 * This if statement deals with the typdef state machine as
1734 * follows: if typdef==ttypedseen and token is struct/union/class/enum,
1735 * return FALSE. All the other code here is for the structdef
1742 if (typdef
== ttypedseen
1743 || (typedefs_and_cplusplus
&& cblev
== 0 && structdef
== snone
))
1745 structdef
= skeyseen
;
1746 structtype
= toktype
;
1750 if (structdef
== skeyseen
)
1752 /* Save the tag for struct/union/class, for functions that may be
1754 if (structtype
== st_C_struct
)
1755 structtag
= savenstr (str
, len
);
1757 structtag
= "<enum>";
1758 structdef
= stagseen
;
1762 /* Avoid entering funcdef stuff if typdef is going on. */
1763 if (typdef
!= tnone
)
1769 /* Detect GNU macros. */
1770 if (definedef
== dnone
)
1771 if (strneq (str
, "DEFUN", 5) /* Used in emacs */
1773 These are defined inside C functions
, so currently they
1775 || strneq (str
, "EXFUN", 5) /* Used in glibc */
1776 || strneq (str
, "DEFVAR_", 7) /* Used in emacs */
1778 || strneq (str
, "SYSCALL", 7) /* Used in glibc (mach) */
1779 || strneq (str
, "ENTRY", 5) /* Used in glibc */
1780 || strneq (str
, "PSEUDO", 6)) /* Used in glibc */
1783 next_token_is_func
= TRUE
;
1786 if (next_token_is_func
)
1788 next_token_is_func
= FALSE
;
1798 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1799 funcdef
= fnone
; /* should be useless */
1802 if (funcdef
== fnone
)
1815 * This routine finds functions, typedefs, #define's and
1816 * struct/union/enum definitions in C syntax and adds them
1830 #define current_lb_is_new (newndx == curndx)
1831 #define switch_line_buffers() (curndx = 1 - curndx)
1833 #define curlb (lbs[curndx].lb)
1834 #define othlb (lbs[1-curndx].lb)
1835 #define newlb (lbs[newndx].lb)
1836 #define curlinepos (lbs[curndx].linepos)
1837 #define othlinepos (lbs[1-curndx].linepos)
1838 #define newlinepos (lbs[newndx].linepos)
1840 #define CNL_SAVE_DEFINEDEF \
1842 curlinepos = charno; \
1844 charno += readline (&curlb, inf); \
1845 lp = curlb.buffer; \
1852 CNL_SAVE_DEFINEDEF; \
1853 if (savetok.valid) \
1856 savetok.valid = FALSE; \
1858 definedef = dnone; \
1861 #define make_tag(isfun) do \
1864 pfnote (savestr (token_name.buffer), isfun, tok.named, \
1865 tok.buffer, tok.linelen, tok.lineno, tok.linepos); \
1866 else if (DEBUG) abort (); \
1867 tok.valid = FALSE; \
1871 C_entries (c_ext
, inf
)
1872 int c_ext
; /* extension of C */
1873 FILE *inf
; /* input file */
1875 register char c
; /* latest char read; '\0' for end of line */
1876 register char *lp
; /* pointer one beyond the character `c' */
1877 int curndx
, newndx
; /* indices for current and new lb */
1878 TOKEN tok
; /* latest token read */
1879 register int tokoff
; /* offset in line of start of current token */
1880 register int toklen
; /* length of current token */
1881 int cblev
; /* current curly brace level */
1882 int parlev
; /* current parenthesis level */
1883 logical incomm
, inquote
, inchar
, quotednl
, midtoken
;
1885 TOKEN savetok
; /* token saved during preprocessor handling */
1888 curndx
= newndx
= 0;
1894 definedef
= dnone
; funcdef
= fnone
; typdef
= tnone
; structdef
= snone
;
1895 next_token_is_func
= yacc_rules
= FALSE
;
1896 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
1897 tok
.valid
= savetok
.valid
= FALSE
;
1900 cplpl
= c_ext
& C_PLPL
;
1907 /* If we're at the end of the line, the next character is a
1908 '\0'; don't skip it, because it's the thing that tells us
1909 to read the next line. */
1930 /* Newlines inside comments do not end macro definitions in
1945 /* Newlines inside strings do not end macro definitions
1946 in traditional cpp, even though compilers don't
1947 usually accept them. */
1958 /* Hmmm, something went wrong. */
1972 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1977 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1987 else if (cplpl
&& *lp
== '/')
1995 if ((c_ext
& YACC
) && *lp
== '%')
1997 /* entering or exiting rules section in yacc file */
1999 definedef
= dnone
; funcdef
= fnone
;
2000 typdef
= tnone
; structdef
= snone
;
2001 next_token_is_func
= FALSE
;
2002 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
2004 yacc_rules
= !yacc_rules
;
2010 if (definedef
== dnone
)
2013 logical cpptoken
= TRUE
;
2015 /* Look back on this line. If all blanks, or nonblanks
2016 followed by an end of comment, this is a preprocessor
2018 for (cp
= newlb
.buffer
; cp
< lp
-1; cp
++)
2021 if (*cp
== '*' && *(cp
+1) == '/')
2030 definedef
= dsharpseen
;
2031 } /* if (definedef == dnone) */
2037 /* Consider token only if some complicated conditions are satisfied. */
2038 if ((definedef
!= dnone
2039 || (cblev
== 0 && structdef
!= scolonseen
)
2040 || (cblev
== 1 && cplpl
&& structdef
== sinbody
))
2041 && typdef
!= tignore
2042 && definedef
!= dignorerest
2043 && funcdef
!= finlist
)
2049 if (cplpl
&& c
== ':' && *lp
== ':' && begtoken(*(lp
+ 1)))
2052 * This handles :: in the middle, but not at the
2053 * beginning of an identifier.
2060 logical is_func
= FALSE
;
2063 || consider_token (newlb
.buffer
+ tokoff
, toklen
,
2064 c
, c_ext
, cblev
, &is_func
))
2066 if (structdef
== sinbody
2067 && definedef
== dnone
2069 /* function defined in C++ class body */
2071 int strsize
= strlen(structtag
) + 2 + toklen
+ 1;
2072 while (token_name
.size
< strsize
)
2074 token_name
.size
*= 2;
2076 = (char *) xrealloc (token_name
.buffer
,
2079 strcpy (token_name
.buffer
, structtag
);
2080 strcat (token_name
.buffer
, "::");
2081 strncat (token_name
.buffer
,
2082 newlb
.buffer
+tokoff
, toklen
);
2087 while (token_name
.size
< toklen
+ 1)
2089 token_name
.size
*= 2;
2091 = (char *) xrealloc (token_name
.buffer
,
2094 strncpy (token_name
.buffer
,
2095 newlb
.buffer
+tokoff
, toklen
);
2096 token_name
.buffer
[toklen
] = '\0';
2097 if (structdef
== stagseen
2100 && definedef
== dignorerest
)) /* macro */
2105 tok
.lineno
= lineno
;
2106 tok
.linelen
= tokoff
+ toklen
+ 1;
2107 tok
.buffer
= newlb
.buffer
;
2108 tok
.linepos
= newlinepos
;
2111 if (definedef
== dnone
2112 && (funcdef
== ftagseen
2113 || structdef
== stagseen
2116 if (current_lb_is_new
)
2117 switch_line_buffers ();
2124 } /* if (endtoken (c)) */
2125 else if (intoken (c
))
2130 } /* if (midtoken) */
2131 else if (begtoken (c
))
2149 if (structdef
== stagseen
)
2155 if (!yacc_rules
|| lp
== newlb
.buffer
+ 1)
2157 tokoff
= lp
- 1 - newlb
.buffer
;
2162 } /* if (begtoken) */
2163 } /* if must look at token */
2166 /* Detect end of line, colon, comma, semicolon and various braces
2167 after having handled a token.*/
2171 if (definedef
!= dnone
)
2173 if (structdef
== stagseen
)
2174 structdef
= scolonseen
;
2191 if (definedef
!= dnone
)
2202 if (funcdef
!= fignore
)
2204 if (structdef
== stagseen
)
2208 if (definedef
!= dnone
)
2210 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2212 if (structdef
== stagseen
)
2216 if (definedef
!= dnone
)
2218 if (cblev
== 0 && typdef
== tend
)
2224 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2226 if (structdef
== stagseen
)
2230 if (definedef
!= dnone
)
2239 /* Make sure that the next char is not a '*'.
2240 This handles constructs like:
2241 typedef void OperatorFun (int fun); */
2248 } /* switch (typdef) */
2251 funcdef
= fstartlist
;
2260 if (definedef
!= dnone
)
2268 funcdef
= flistseen
;
2271 if (cblev
== 0 && typdef
== tend
)
2277 else if (parlev
< 0) /* can happen due to ill-conceived #if's. */
2281 if (definedef
!= dnone
)
2283 if (typdef
== ttypedseen
)
2287 case skeyseen
: /* unnamed struct */
2288 structtag
= "_anonymous_";
2289 structdef
= sinbody
;
2292 case scolonseen
: /* named struct */
2293 structdef
= sinbody
;
2306 /* Neutralize `extern "C" {' grot and look inside structs. */
2307 if (cblev
== 0 && structdef
== snone
&& typdef
== tnone
)
2313 if (definedef
!= dnone
)
2315 if (funcdef
== fstartlist
)
2316 funcdef
= fnone
; /* avoid tagging `foo' in `foo (*bar()) ()' */
2319 if (definedef
!= dnone
)
2321 if (!noindentypedefs
&& lp
== newlb
.buffer
+ 1)
2323 cblev
= 0; /* reset curly brace level if first column */
2324 parlev
= 0; /* also reset paren level, just in case... */
2330 if (typdef
== tinbody
)
2332 #if FALSE /* too risky */
2333 if (structdef
== sinbody
)
2338 structtag
= "<error>";
2342 case '#': case '+': case '-': case '~': case '&': case '%': case '/':
2343 case '|': case '^': case '!': case '<': case '>': case '.': case '?':
2344 if (definedef
!= dnone
)
2346 /* These surely cannot follow a function tag. */
2347 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2351 /* If a macro spans multiple lines don't reset its state. */
2359 } /* while not eof */
2363 * Process either a C++ file or a C file depending on the setting
2367 default_C_entries (inf
)
2370 C_entries (cplusplus
? C_PLPL
: 0, inf
);
2373 /* Always do C++. */
2375 Cplusplus_entries (inf
)
2378 C_entries (C_PLPL
, inf
);
2386 C_entries (C_STAR
, inf
);
2389 /* Always do Yacc. */
2394 C_entries (YACC
, inf
);
2397 /* Fortran parsing */
2405 register int len
= 0;
2407 while (*cp
&& (*cp
| ' ') == (dbp
[len
] | ' '))
2420 while (isspace (*dbp
))
2425 while (isspace (*dbp
))
2429 if (!isdigit (*dbp
))
2431 --dbp
; /* force failure */
2436 while (isdigit (*dbp
));
2445 while (isspace (*dbp
))
2450 linecharno
= charno
;
2451 charno
+= readline (&lb
, inf
);
2456 while (isspace (*dbp
))
2465 && (isalpha (*cp
) || isdigit (*cp
) || (*cp
== '_') || (*cp
== '$')));
2468 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2469 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2473 Fortran_functions (inf
)
2482 linecharno
= charno
;
2483 charno
+= readline (&lb
, inf
);
2486 dbp
++; /* Ratfor escape to fortran */
2487 while (isspace (*dbp
))
2494 if (tail ("integer"))
2502 if (tail ("logical"))
2506 if (tail ("complex") || tail ("character"))
2510 if (tail ("double"))
2512 while (isspace (*dbp
))
2516 if (tail ("precision"))
2522 while (isspace (*dbp
))
2529 if (tail ("function"))
2533 if (tail ("subroutine"))
2541 if (tail ("program"))
2546 if (tail ("procedure"))
2554 * Bob Weiner, Motorola Inc., 4/3/94
2555 * Unix and microcontroller assembly tag handling
2556 * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
2570 linecharno
= charno
;
2571 charno
+= readline (&lb
, inf
);
2574 /* If first char is alphabetic or one of [_.$], test for colon
2575 following identifier. */
2576 if (isalpha (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2578 /* Read past label. */
2580 while (isalnum (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2582 if (*cp
== ':' || isspace (*cp
))
2584 /* Found end of label, so copy it and add it to the table. */
2585 pfnote (savenstr (lb
.buffer
, cp
-lb
.buffer
), TRUE
, FALSE
,
2586 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2592 /* Added by Mosur Mohan, 4/22/88 */
2593 /* Pascal parsing */
2595 #define GET_NEW_LINE \
2597 linecharno = charno; lineno++; \
2598 charno += 1 + readline (&lb, inf); \
2603 * Locates tags for procedures & functions. Doesn't do any type- or
2604 * var-definitions. It does look for the keyword "extern" or
2605 * "forward" immediately following the procedure statement; if found,
2606 * the tag is skipped.
2609 Pascal_functions (inf
)
2612 struct linebuffer tline
; /* mostly copied from C_entries */
2618 logical
/* each of these flags is TRUE iff: */
2619 incomment
, /* point is inside a comment */
2620 inquote
, /* point is inside '..' string */
2621 get_tagname
, /* point is after PROCEDURE/FUNCTION */
2622 /* keyword, so next item = potential tag */
2623 found_tag
, /* point is after a potential tag */
2624 inparms
, /* point is within parameter-list */
2625 verify_tag
; /* point has passed the parm-list, so the */
2626 /* next token will determine whether */
2627 /* this is a FORWARD/EXTERN to be */
2628 /* ignored, or whether it is a real tag */
2634 initbuffer (&tline
);
2636 incomment
= inquote
= FALSE
;
2637 found_tag
= FALSE
; /* have a proc name; check if extern */
2638 get_tagname
= FALSE
; /* have found "procedure" keyword */
2639 inparms
= FALSE
; /* found '(' after "proc" */
2640 verify_tag
= FALSE
; /* check if "extern" is ahead */
2642 /* long main loop to get next char */
2646 if (c
== '\0') /* if end of line */
2651 if (!((found_tag
&& verify_tag
) ||
2653 c
= *dbp
++; /* only if don't need *dbp pointing */
2654 /* to the beginning of the name of */
2655 /* the procedure or function */
2659 if (c
== '}') /* within { - } comments */
2661 else if (c
== '*' && dbp
[1] == ')') /* within (* - *) comments */
2678 inquote
= TRUE
; /* found first quote */
2680 case '{': /* found open-{-comment */
2684 if (*dbp
== '*') /* found open-(*-comment */
2689 else if (found_tag
) /* found '(' after tag, i.e., parm-list */
2692 case ')': /* end of parms list */
2697 if ((found_tag
) && (!inparms
)) /* end of proc or fn stmt */
2704 if ((found_tag
) && (verify_tag
) && (*dbp
!= ' '))
2706 /* check if this is an "extern" declaration */
2709 if ((*dbp
== 'e') || (*dbp
== 'E'))
2711 if (tail ("extern")) /* superfluous, really! */
2717 else if ((*dbp
== 'f') || (*dbp
== 'F'))
2719 if (tail ("forward")) /* check for forward reference */
2725 if ((found_tag
) && (verify_tag
)) /* not external proc, so make tag */
2729 pfnote (nambuf
, TRUE
, FALSE
, tline
.buffer
,
2730 cp
- tline
.buffer
+ 1, save_lineno
, save_lcno
);
2734 if (get_tagname
) /* grab name of proc or fn */
2739 /* save all values for later tagging */
2740 tline
.size
= lb
.size
;
2741 strcpy (tline
.buffer
, lb
.buffer
);
2742 save_lineno
= lineno
;
2743 save_lcno
= linecharno
;
2745 /* grab block name */
2746 for (cp
= dbp
+ 1; *cp
&& (!endtoken (*cp
)); cp
++)
2748 nambuf
= savenstr (dbp
, cp
-dbp
);
2749 dbp
= cp
; /* restore dbp to e-o-token */
2750 get_tagname
= FALSE
;
2754 /* and proceed to check for "extern" */
2756 else if (!incomment
&& !inquote
&& !found_tag
)
2758 /* check for proc/fn keywords */
2762 if (tail ("rocedure")) /* c = 'p', dbp has advanced */
2766 if (tail ("unction"))
2771 } /* while not eof */
2775 * lisp tag functions
2776 * look for (def or (DEF, quote or QUOTE
2780 register char *strp
;
2782 return ((strp
[1] == 'd' || strp
[1] == 'D')
2783 && (strp
[2] == 'e' || strp
[2] == 'E')
2784 && (strp
[3] == 'f' || strp
[3] == 'F'));
2789 register char *strp
;
2791 return ((*(++strp
) == 'q' || *strp
== 'Q')
2792 && (*(++strp
) == 'u' || *strp
== 'U')
2793 && (*(++strp
) == 'o' || *strp
== 'O')
2794 && (*(++strp
) == 't' || *strp
== 'T')
2795 && (*(++strp
) == 'e' || *strp
== 'E')
2796 && isspace(*(++strp
)));
2804 if (*dbp
== '\'') /* Skip prefix quote */
2806 else if (*dbp
== '(' && L_isquote (dbp
)) /* Skip "(quote " */
2809 while (isspace(*dbp
))
2812 for (cp
= dbp
/*+1*/;
2813 *cp
&& *cp
!= '(' && *cp
!= ' ' && *cp
!= ')';
2819 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2820 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2824 Lisp_functions (inf
)
2833 linecharno
= charno
;
2834 charno
+= readline (&lb
, inf
);
2840 while (!isspace (*dbp
))
2842 while (isspace (*dbp
))
2848 /* Check for (foo::defmumble name-defined ... */
2851 while (*dbp
&& !isspace (*dbp
)
2852 && *dbp
!= ':' && *dbp
!= '(' && *dbp
!= ')');
2857 while (*dbp
== ':');
2859 if (L_isdef (dbp
- 1))
2861 while (!isspace (*dbp
))
2863 while (isspace (*dbp
))
2874 * Scheme tag functions
2875 * look for (def... xyzzy
2876 * look for (def... (xyzzy
2877 * look for (def ... ((...(xyzzy ....
2878 * look for (set! xyzzy
2884 Scheme_functions (inf
)
2893 linecharno
= charno
;
2894 charno
+= readline (&lb
, inf
);
2896 if (dbp
[0] == '(' &&
2897 (dbp
[1] == 'D' || dbp
[1] == 'd') &&
2898 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2899 (dbp
[3] == 'F' || dbp
[3] == 'f'))
2901 while (!isspace (*dbp
))
2903 /* Skip over open parens and white space */
2904 while (*dbp
&& (isspace (*dbp
) || *dbp
== '('))
2908 if (dbp
[0] == '(' &&
2909 (dbp
[1] == 'S' || dbp
[1] == 's') &&
2910 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2911 (dbp
[3] == 'T' || dbp
[3] == 't') &&
2912 (dbp
[4] == '!' || dbp
[4] == '!') &&
2915 while (!isspace (*dbp
))
2917 /* Skip over white space */
2918 while (isspace (*dbp
))
2932 /* Go till you get to white space or a syntactic break */
2934 *cp
&& *cp
!= '(' && *cp
!= ')' && !isspace (*cp
);
2937 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
,
2938 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2941 /* Find tags in TeX and LaTeX input files. */
2943 /* TEX_toktab is a table of TeX control sequences that define tags.
2944 Each TEX_tabent records one such control sequence.
2945 CONVERT THIS TO USE THE Stab TYPE!! */
2952 struct TEX_tabent
*TEX_toktab
= NULL
; /* Table with tag tokens */
2954 /* Default set of control sequences to put into TEX_toktab.
2955 The value of environment var TEXTAGS is prepended to this. */
2957 char *TEX_defenv
= "\
2958 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem:typeout";
2961 struct TEX_tabent
*TEX_decode_env ();
2965 char TEX_esc
= '\\';
2966 char TEX_opgrp
= '{';
2967 char TEX_clgrp
= '}';
2970 * TeX/LaTeX scanning loop.
2981 /* Select either \ or ! as escape character. */
2984 /* Initialize token table once from environment. */
2986 TEX_toktab
= TEX_decode_env ("TEXTAGS", TEX_defenv
);
2989 { /* Scan each line in file */
2991 linecharno
= charno
;
2992 charno
+= readline (&lb
, inf
);
2995 while (dbp
= etags_strchr (dbp
, TEX_esc
)) /* Look at each esc in line */
3001 linecharno
+= dbp
- lasthit
;
3003 i
= TEX_Token (lasthit
);
3006 TEX_getit (lasthit
, TEX_toktab
[i
].len
);
3007 break; /* We only save a line once */
3013 #define TEX_LESC '\\'
3014 #define TEX_SESC '!'
3017 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
3018 chars accordingly. */
3025 while ((c
= getc (inf
)) != EOF
)
3027 /* Skip to next line if we hit the TeX comment char. */
3031 else if (c
== TEX_LESC
|| c
== TEX_SESC
)
3050 /* Read environment and prepend it to the default string.
3051 Build token table. */
3053 TEX_decode_env (evarname
, defenv
)
3057 register char *env
, *p
;
3059 struct TEX_tabent
*tab
;
3062 /* Append default string to environment. */
3063 env
= getenv (evarname
);
3067 env
= concat (env
, defenv
, "");
3069 /* Allocate a token table */
3070 for (size
= 1, p
= env
; p
;)
3071 if ((p
= etags_strchr (p
, ':')) && *(++p
))
3073 /* Add 1 to leave room for null terminator. */
3074 tab
= xnew (size
+ 1, struct TEX_tabent
);
3076 /* Unpack environment string into token table. Be careful about */
3077 /* zero-length strings (leading ':', "::" and trailing ':') */
3080 p
= etags_strchr (env
, ':');
3081 if (!p
) /* End of environment string. */
3082 p
= env
+ strlen (env
);
3084 { /* Only non-zero strings. */
3085 tab
[i
].name
= savenstr (env
, p
- env
);
3086 tab
[i
].len
= strlen (tab
[i
].name
);
3093 tab
[i
].name
= NULL
; /* Mark end of table. */
3101 /* Record a tag defined by a TeX command of length LEN and starting at NAME.
3102 The name being defined actually starts at (NAME + LEN + 1).
3103 But we seem to include the TeX command in the tag name. */
3105 TEX_getit (name
, len
)
3109 char *p
= name
+ len
;
3114 /* Let tag name extend to next group close (or end of line) */
3115 while (*p
&& *p
!= TEX_clgrp
)
3117 pfnote (savenstr (name
, p
-name
), TRUE
, FALSE
, lb
.buffer
,
3118 strlen (lb
.buffer
), lineno
, linecharno
);
3121 /* If the text at CP matches one of the tag-defining TeX command names,
3122 return the pointer to the first occurrence of that command in TEX_toktab.
3123 Otherwise return -1.
3124 Keep the capital `T' in `Token' for dumb truncating compilers
3125 (this distinguishes it from `TEX_toktab' */
3132 for (i
= 0; TEX_toktab
[i
].len
> 0; i
++)
3133 if (strneq (TEX_toktab
[i
].name
, cp
, TEX_toktab
[i
].len
))
3138 /* Support for Prolog. */
3140 /* Whole head (not only functor, but also arguments)
3141 is gotten in compound term. */
3154 if (s
[0] == '\0') /* syntax error. */
3156 else if (insquote
&& s
[0] == '\'' && s
[1] == '\'')
3158 else if (s
[0] == '\'')
3160 insquote
= !insquote
;
3163 else if (!insquote
&& s
[0] == '(')
3168 else if (!insquote
&& s
[0] == ')')
3174 else if (npar
< 0) /* syntax error. */
3177 else if (!insquote
&& s
[0] == '.'
3178 && (isspace (s
[1]) || s
[1] == '\0'))
3180 if (npar
!= 0) /* syntax error. */
3188 pfnote (savenstr (save_s
, s
-save_s
), TRUE
, FALSE
,
3189 save_s
, s
-save_s
, lineno
, linecharno
);
3192 /* It is assumed that prolog predicate starts from column 0. */
3194 Prolog_functions (inf
)
3197 void skip_comment (), prolog_getit ();
3199 lineno
= linecharno
= charno
= 0;
3203 linecharno
+= charno
;
3204 charno
= readline (&lb
, inf
) + 1; /* 1 for newline. */
3206 if (isspace (dbp
[0])) /* not predicate header. */
3208 else if (dbp
[0] == '%') /* comment. */
3210 else if (dbp
[0] == '/' && dbp
[1] == '*') /* comment. */
3211 skip_comment (&lb
, inf
, &lineno
, &linecharno
);
3218 skip_comment (plb
, inf
, plineno
, plinecharno
)
3219 struct linebuffer
*plb
;
3221 int *plineno
; /* result */
3222 long *plinecharno
; /* result */
3228 for (cp
= plb
->buffer
; *cp
!= '\0'; cp
++)
3229 if (cp
[0] == '*' && cp
[1] == '/')
3232 *plinecharno
+= readline (plb
, inf
) + 1; /* 1 for newline. */
3237 #ifdef ETAGS_REGEXPS
3238 /* Take a string like "/blah/" and turn it into "blah", making sure
3239 that the first and last characters are the same, and handling
3240 quoted separator characters. Actually, stops on the occurence of
3241 an unquoted separator. Also turns "\t" into a Tab character.
3242 Returns pointer to terminating separator. Works in place. Null
3243 terminates name string. */
3245 scan_separators (name
)
3249 char *copyto
= name
;
3250 logical quoted
= FALSE
;
3252 for (++name
; *name
!= '\0'; ++name
)
3258 else if (*name
== sep
)
3262 /* Something else is quoted, so preserve the quote. */
3268 else if (*name
== '\\')
3270 else if (*name
== sep
)
3276 /* Terminate copied string. */
3281 /* Turn a name, which is an ed-style (but Emacs syntax) regular
3282 expression, into a real regular expression by compiling it. */
3284 add_regex (regexp_pattern
)
3285 char *regexp_pattern
;
3289 struct re_pattern_buffer
*patbuf
;
3291 if (regexp_pattern
== NULL
)
3293 /* Remove existing regexps. */
3299 if (regexp_pattern
[0] == '\0')
3301 error ("missing regexp", 0);
3304 if (regexp_pattern
[strlen(regexp_pattern
)-1] != regexp_pattern
[0])
3306 error ("%s: unterminated regexp", regexp_pattern
);
3309 name
= scan_separators (regexp_pattern
);
3310 if (regexp_pattern
[0] == '\0')
3312 error ("null regexp", 0);
3315 (void) scan_separators (name
);
3317 patbuf
= xnew (1, struct re_pattern_buffer
);
3318 patbuf
->translate
= NULL
;
3319 patbuf
->fastmap
= NULL
;
3320 patbuf
->buffer
= NULL
;
3321 patbuf
->allocated
= 0;
3323 err
= re_compile_pattern (regexp_pattern
, strlen (regexp_pattern
), patbuf
);
3326 error ("%s while compiling pattern", err
);
3331 if (num_patterns
== 1)
3332 patterns
= xnew (1, struct pattern
);
3334 patterns
= ((struct pattern
*)
3336 (num_patterns
* sizeof (struct pattern
))));
3337 patterns
[num_patterns
- 1].pattern
= patbuf
;
3338 patterns
[num_patterns
- 1].name_pattern
= savestr (name
);
3339 patterns
[num_patterns
- 1].error_signaled
= FALSE
;
3343 * Do the subtitutions indicated by the regular expression and
3347 substitute (in
, out
, regs
)
3349 struct re_registers
*regs
;
3351 char *result
= NULL
, *t
;
3354 /* Pass 1: figure out how much size to allocate. */
3355 for (t
= out
; *t
; ++t
)
3362 fprintf (stderr
, "%s: pattern subtitution ends prematurely\n",
3369 size
+= regs
->end
[dig
] - regs
->start
[dig
];
3374 /* Allocate space and do the substitutions. */
3375 result
= xnew (size
+ 1, char);
3384 /* Using "dig2" satisfies my debugger. Bleah. */
3385 int dig2
= *out
- '0';
3386 strncpy (result
+ size
, in
+ regs
->start
[dig2
],
3387 regs
->end
[dig2
] - regs
->start
[dig2
]);
3388 size
+= regs
->end
[dig2
] - regs
->start
[dig2
];
3395 result
[size
++] = '\t';
3401 result
[size
++] = *out
;
3407 result
[size
++] = *out
;
3409 result
[size
] = '\0';
3414 #endif /* ETAGS_REGEXPS */
3415 /* Initialize a linebuffer for use */
3417 initbuffer (linebuffer
)
3418 struct linebuffer
*linebuffer
;
3420 linebuffer
->size
= 200;
3421 linebuffer
->buffer
= xnew (200, char);
3425 * Read a line of text from `stream' into `linebuffer'.
3426 * Return the number of characters read from `stream',
3427 * which is the length of the line including the newline, if any.
3430 readline_internal (linebuffer
, stream
)
3431 struct linebuffer
*linebuffer
;
3432 register FILE *stream
;
3434 char *buffer
= linebuffer
->buffer
;
3435 register char *p
= linebuffer
->buffer
;
3436 register char *pend
;
3439 pend
= p
+ linebuffer
->size
; /* Separate to avoid 386/IX compiler bug. */
3443 register int c
= getc (stream
);
3446 linebuffer
->size
*= 2;
3447 buffer
= (char *) xrealloc (buffer
, linebuffer
->size
);
3448 p
+= buffer
- linebuffer
->buffer
;
3449 pend
= buffer
+ linebuffer
->size
;
3450 linebuffer
->buffer
= buffer
;
3459 if (p
> buffer
&& p
[-1] == '\r')
3474 return p
- buffer
+ chars_deleted
;
3478 * Like readline_internal, above, but try to match the input
3479 * line against any existing regular expressions.
3482 readline (linebuffer
, stream
)
3483 struct linebuffer
*linebuffer
;
3486 /* Read new line. */
3488 long result
= readline_internal (linebuffer
, stream
);
3490 #ifdef ETAGS_REGEXPS
3491 /* Match against all listed patterns. */
3492 for (i
= 0; i
< num_patterns
; ++i
)
3494 int match
= re_match (patterns
[i
].pattern
, linebuffer
->buffer
,
3495 (int)result
, 0, &patterns
[i
].regs
);
3500 if (!patterns
[i
].error_signaled
)
3502 error ("error while matching pattern %d", i
);
3503 patterns
[i
].error_signaled
= TRUE
;
3510 /* Match occurred. Construct a tag. */
3511 if (patterns
[i
].name_pattern
[0] != '\0')
3513 /* Make a named tag. */
3514 char *name
= substitute (linebuffer
->buffer
,
3515 patterns
[i
].name_pattern
,
3518 pfnote (name
, TRUE
, TRUE
, linebuffer
->buffer
,
3519 match
, lineno
, linecharno
);
3523 /* Make an unnamed tag. */
3524 pfnote (NULL
, TRUE
, FALSE
, linebuffer
->buffer
,
3525 match
, lineno
, linecharno
);
3530 #endif /* ETAGS_REGEXPS */
3536 * Read a file, but do no processing. This is used to do regexp
3537 * matching on files that have no language defined.
3540 just_read_file (inf
)
3546 linecharno
= charno
;
3547 charno
+= readline (&lb
, inf
) + 1;
3553 * Return a pointer to a space of size strlen(cp)+1 allocated
3554 * with xnew where the string CP has been copied.
3560 return savenstr (cp
, strlen (cp
));
3564 * Return a pointer to a space of size LEN+1 allocated with xnew where
3565 * the string CP has been copied for at most the first LEN characters.
3574 dp
= xnew (len
+ 1, char);
3575 strncpy (dp
, cp
, len
);
3581 * Return the ptr in sp at which the character c last
3582 * appears; NULL if not found
3584 * Identical to System V strrchr, included for portability.
3587 etags_strrchr (sp
, c
)
3588 register char *sp
, c
;
3603 * Return the ptr in sp at which the character c first
3604 * appears; NULL if not found
3606 * Identical to System V strchr, included for portability.
3609 etags_strchr (sp
, c
)
3610 register char *sp
, c
;
3620 /* Print error message and exit. */
3637 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
3642 fprintf (stderr
, "%s: ", progname
);
3643 fprintf (stderr
, s1
, s2
);
3644 fprintf (stderr
, "\n");
3647 /* Return a newly-allocated string whose contents
3648 concatenate those of s1, s2, s3. */
3653 int len1
= strlen (s1
), len2
= strlen (s2
), len3
= strlen (s3
);
3654 char *result
= xnew (len1
+ len2
+ len3
+ 1, char);
3656 strcpy (result
, s1
);
3657 strcpy (result
+ len1
, s2
);
3658 strcpy (result
+ len1
+ len2
, s3
);
3659 result
[len1
+ len2
+ len3
] = '\0';
3664 /* Does the same work as the system V getcwd, but does not need to
3665 guess buffer size in advance. */
3670 char *p
, path
[MAXPATHLEN
+ 1]; /* Fixed size is safe on MSDOS. */
3678 *p
++ = tolower (*p
);
3680 return strdup (path
);
3681 #else /* not DOS_NT */
3684 char *path
= xnew (bufsize
, char);
3686 while (getcwd (path
, bufsize
) == NULL
)
3688 if (errno
!= ERANGE
)
3691 path
= xnew (bufsize
, char);
3695 #else /* not DOS_NT and not HAVE_GETCWD */
3696 struct linebuffer path
;
3700 pipe
= (FILE *) popen ("pwd 2>/dev/null", "r");
3701 if (pipe
== NULL
|| readline_internal (&path
, pipe
) == 0)
3706 #endif /* not HAVE_GETCWD */
3707 #endif /* not DOS_NT */
3710 /* Return a newly allocated string containing the filename
3711 of FILE relative to the absolute directory DIR (which
3712 should end with a slash). */
3714 relative_filename (file
, dir
)
3717 char *fp
, *dp
, *res
;
3719 /* Find the common root of file and dir. */
3720 fp
= absolute_filename (file
, cwd
);
3722 while (*fp
++ == *dp
++)
3731 /* Build a sequence of "../" strings for the resulting relative filename. */
3732 for (dp
= etags_strchr (dp
+ 1, '/'), res
= "";
3734 dp
= etags_strchr (dp
+ 1, '/'))
3736 res
= concat (res
, "../", "");
3739 /* Add the filename relative to the common root of file and dir. */
3740 res
= concat (res
, fp
+ 1, "");
3742 return res
; /* temporary stub */
3745 /* Return a newly allocated string containing the
3746 absolute filename of FILE given CWD (which should
3747 end with a slash). */
3749 absolute_filename (file
, cwd
)
3752 char *slashp
, *cp
, *res
;
3755 if (file
[0] == '/' || (isalpha (file
[0]) && file
[1] == ':'))
3759 res
= concat (file
, "", "");
3761 res
= concat (cwd
, file
, "");
3763 /* Delete the "/dirname/.." and "/." substrings. */
3764 slashp
= etags_strchr (res
, '/');
3765 while (slashp
!= NULL
&& slashp
[0] != '\0')
3767 if (slashp
[1] == '.')
3769 if (slashp
[2] == '.'
3770 && (slashp
[3] == '/' || slashp
[3] == '\0'))
3775 while (cp
>= res
&& *cp
!= '/');
3778 strcpy (cp
, slashp
+ 3);
3780 else /* else (cp == res) */
3782 if (slashp
[3] != '\0')
3783 strcpy (cp
, slashp
+ 4);
3790 else if (slashp
[2] == '/' || slashp
[2] == '\0')
3792 strcpy (slashp
, slashp
+ 2);
3797 slashp
= etags_strchr (slashp
+ 1, '/');
3803 /* Return a newly allocated string containing the absolute
3804 filename of dir where FILE resides given CWD (which should
3805 end with a slash). */
3807 absolute_dirname (file
, cwd
)
3813 slashp
= etags_strrchr (file
, '/');
3818 res
= absolute_filename (file
, cwd
);
3824 /* Like malloc but get fatal error if memory is exhausted. */
3829 long *result
= (long *) malloc (size
);
3831 fatal ("virtual memory exhausted", 0);
3836 xrealloc (ptr
, size
)
3840 long *result
= (long *) realloc (ptr
, size
);
3842 fatal ("virtual memory exhausted");