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.
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.
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.
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. */
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.
28 * Regexp tags by Tom Tromey.
31 * Francesco Potorti` (pot@cnuce.cnr.it) is the current maintainer.
34 char pot_etags_version
[] = "@(#) pot revision number is 11.26";
44 #include <sys/param.h>
51 #define MAXPATHLEN _MAX_PATH
56 /* On some systems, Emacs defines static as nothing for the sake
57 of unexec. We don't want that here since we don't use unexec. */
67 #include <sys/types.h>
70 #if !defined (S_ISREG) && defined (S_IFREG)
71 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
78 #endif /* ETAGS_REGEXPS */
80 /* Define CTAGS to make the program "ctags" compatible with the usual one.
81 Let it undefined to make the program "etags", which makes emacs-style
82 tag tables and tags typedefs, #defines and struct/union/enum by default. */
90 /* Exit codes for success and failure. */
100 #define C_PLPL 0x00001 /* C++ */
101 #define C_STAR 0x00003 /* C* */
102 #define YACC 0x10000 /* yacc file */
104 #define streq(s,t) (strcmp (s, t) == 0)
105 #define strneq(s,t,n) (strncmp (s, t, n) == 0)
107 #define iswhite(arg) (_wht[arg]) /* T if char is white */
108 #define begtoken(arg) (_btk[arg]) /* T if char can start token */
109 #define intoken(arg) (_itk[arg]) /* T if char can be in token */
110 #define endtoken(arg) (_etk[arg]) /* T if char ends tokens */
113 * xnew -- allocate storage
115 * SYNOPSIS: Type *xnew (int n, Type);
117 #define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
122 { /* sorting structure */
123 char *name
; /* function or type name */
124 char *file
; /* file name */
125 logical is_func
; /* use pattern or line no */
126 logical named
; /* list name separately */
127 logical been_warned
; /* set if noticed dup */
128 int lno
; /* line number tag is on */
129 long cno
; /* character number line starts on */
130 char *pat
; /* search pattern */
131 struct nd_st
*left
, *right
; /* left and right sons */
134 extern char *getenv ();
137 char *savenstr (), *savestr ();
138 char *etags_strchr (), *etags_strrchr ();
139 char *etags_getcwd ();
140 char *relative_filename (), *absolute_filename (), *absolute_dirname ();
141 char *xmalloc (), *xrealloc ();
143 typedef void Lang_function ();
144 #if FALSE /* many compilers barf on this */
145 Lang_function Asm_labels
;
146 Lang_function default_C_entries
;
147 Lang_function C_entries
;
148 Lang_function Cplusplus_entries
;
149 Lang_function Cstar_entries
;
150 Lang_function Fortran_functions
;
151 Lang_function Yacc_entries
;
152 Lang_function Lisp_functions
;
153 Lang_function Pascal_functions
;
154 Lang_function Prolog_functions
;
155 Lang_function Scheme_functions
;
156 Lang_function TeX_functions
;
157 Lang_function just_read_file
;
158 #else /* so let's write it this way */
160 void default_C_entries ();
162 void Cplusplus_entries ();
163 void Cstar_entries ();
164 void Fortran_functions ();
165 void Yacc_entries ();
166 void Lisp_functions ();
167 void Pascal_functions ();
168 void Prolog_functions ();
169 void Scheme_functions ();
170 void TeX_functions ();
171 void just_read_file ();
174 logical
get_language ();
175 int total_size_of_entries ();
177 long readline_internal ();
183 void fatal (), pfatal ();
184 void find_entries ();
190 void process_file ();
195 char searchar
= '/'; /* use /.../ searches */
197 int lineno
; /* line number of current line */
198 long charno
; /* current character number */
200 long linecharno
; /* charno of start of line; not used by C,
201 but by every other language. */
203 char *curfile
; /* current input file name */
204 char *tagfile
; /* output file */
205 char *progname
; /* name this program was invoked with */
206 char *cwd
; /* current working directory */
207 char *tagfiledir
; /* directory of tagfile */
209 FILE *tagf
; /* ioptr for tags file */
210 NODE
*head
; /* the head of the binary tree of tags */
213 * A `struct linebuffer' is a structure which holds a line of text.
214 * `readline' reads a line from a stream into a linebuffer and works
215 * regardless of the length of the line.
223 struct linebuffer lb
; /* the current line */
224 struct linebuffer token_name
; /* used by C_entries as temporary area */
228 struct linebuffer lb
; /* used by C_entries instead of lb */
231 /* boolean "functions" (see init) */
232 logical _wht
[0177], _etk
[0177], _itk
[0177], _btk
[0177];
234 *white
= " \f\t\n\013", /* white chars */
235 *endtk
= " \t\n\013\"'#()[]{}=-+%*/&|^~!<>;,.:?", /* token ending chars */
236 /* token starting chars */
237 *begtk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~",
238 /* valid in-token chars */
239 *intk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
241 logical append_to_tagfile
; /* -a: append to tags */
242 /* The following three default to TRUE for etags, but to FALSE for ctags. */
243 logical typedefs
; /* -t: create tags for typedefs */
244 logical typedefs_and_cplusplus
; /* -T: create tags for typedefs, level */
245 /* 0 struct/enum/union decls, and C++ */
246 /* member functions. */
247 logical constantypedefs
; /* -d: create tags for C #define and enum */
248 /* constants. Enum consts not implemented. */
249 /* -D: opposite of -d. Default under ctags. */
250 logical update
; /* -u: update tags */
251 logical vgrind_style
; /* -v: create vgrind style index output */
252 logical no_warnings
; /* -w: suppress warnings */
253 logical cxref_style
; /* -x: create cxref style output */
254 logical cplusplus
; /* .[hc] means C++, not C */
255 logical noindentypedefs
; /* -I: ignore indentation in C */
256 #define permit_duplicates TRUE /* allow duplicate tags */
258 struct option longopts
[] =
260 { "append", no_argument
, NULL
, 'a' },
261 { "backward-search", no_argument
, NULL
, 'B' },
262 { "c++", no_argument
, NULL
, 'C' },
263 { "cxref", no_argument
, NULL
, 'x' },
264 { "defines", no_argument
, NULL
, 'd' },
265 { "help", no_argument
, NULL
, 'h' },
266 { "help", no_argument
, NULL
, 'H' },
267 { "ignore-indentation", no_argument
, NULL
, 'I' },
268 { "include", required_argument
, NULL
, 'i' },
269 { "language", required_argument
, NULL
, 'l' },
270 { "no-defines", no_argument
, NULL
, 'D' },
271 { "no-regex", no_argument
, NULL
, 'R' },
272 { "no-warn", no_argument
, NULL
, 'w' },
273 { "output", required_argument
, NULL
, 'o' },
274 { "regex", required_argument
, NULL
, 'r' },
275 { "typedefs", no_argument
, NULL
, 't' },
276 { "typedefs-and-c++", no_argument
, NULL
, 'T' },
277 { "update", no_argument
, NULL
, 'u' },
278 { "version", no_argument
, NULL
, 'V' },
279 { "vgrind", no_argument
, NULL
, 'v' },
284 /* Structure defining a regular expression. Elements are
285 the compiled pattern, and the name string. */
288 struct re_pattern_buffer
*pattern
;
289 struct re_registers regs
;
291 logical error_signaled
;
294 /* Number of regexps found. */
295 int num_patterns
= 0;
297 /* Array of all regexps. */
298 struct pattern
*patterns
= NULL
;
299 #endif /* ETAGS_REGEXPS */
301 /* Language stuff. */
305 Lang_function
*function
;
308 /* Table of language names and corresponding functions. */
309 /* It is ok for a given function to be listed under more than one
310 name. I just didn't. */
311 /* "auto" language reverts to default behavior. */
312 struct lang_entry lang_names
[] =
314 { "asm", Asm_labels
},
315 { "c", default_C_entries
},
316 { "c++", Cplusplus_entries
},
317 { "c*", Cstar_entries
},
318 { "fortran", Fortran_functions
},
319 { "lisp", Lisp_functions
},
320 { "none", just_read_file
},
321 { "pascal", Pascal_functions
},
322 { "scheme" , Scheme_functions
},
323 { "tex", TeX_functions
},
328 /* Table of file extensions and corresponding language functions. */
329 struct lang_entry lang_extensions
[] =
331 /* Assume that ".s" or ".a" is assembly code. -wolfgang.
333 { "a", Asm_labels
}, /* Unix assembler */
334 { "asm", Asm_labels
}, /* Microcontroller assembly */
335 { "def", Asm_labels
}, /* BSO/Tasking definition includes */
336 { "inc", Asm_labels
}, /* Microcontroller include files */
337 { "ins", Asm_labels
}, /* Microcontroller include files */
339 { "sa", Asm_labels
}, /* Unix assembler */
340 { "src", Asm_labels
}, /* BSO/Tasking C compiler output */
342 /* .aux, .bbl, .clo, .cls, .dtx or .tex implies LaTeX source code. */
343 { "aux", TeX_functions
},
344 { "bbl", TeX_functions
},
345 { "clo", TeX_functions
},
346 { "cls", TeX_functions
},
347 { "dtx", TeX_functions
},
348 { "sty", TeX_functions
},
349 { "tex", TeX_functions
},
351 /* .l or .el or .lisp (or .cl or .clisp or ...) implies lisp source code */
352 { "cl", Lisp_functions
},
353 { "clisp", Lisp_functions
},
354 { "el", Lisp_functions
},
355 { "l", Lisp_functions
},
356 { "lisp", Lisp_functions
},
357 { "lsp", Lisp_functions
},
359 /* .scm or .sm or .scheme implies scheme source code */
360 { "SCM", Scheme_functions
},
361 { "SM", Scheme_functions
},
362 { "oak", Scheme_functions
},
363 { "sch", Scheme_functions
},
364 { "scheme", Scheme_functions
},
365 { "scm", Scheme_functions
},
366 { "sm", Scheme_functions
},
367 { "t", Scheme_functions
},
368 /* FIXME Can't do the `SCM' or `scm' prefix with a version number */
370 /* Note that ".c" and ".h" can be considered C++, if the --c++
371 flag was given. That is why default_C_entries is called here. */
372 { "c", default_C_entries
},
373 { "h", default_C_entries
},
375 /* .C or .H or .c++ or .cc or .cpp or .cxx or .h++ or .hh or .hxx:
377 { "C", Cplusplus_entries
},
378 { "H", Cplusplus_entries
},
379 { "c++", Cplusplus_entries
},
380 { "cc", Cplusplus_entries
},
381 { "cpp", Cplusplus_entries
},
382 { "cxx", Cplusplus_entries
},
383 { "h++", Cplusplus_entries
},
384 { "hh", Cplusplus_entries
},
385 { "hxx", Cplusplus_entries
},
387 /* .y: a yacc file */
388 { "y", Yacc_entries
},
390 /* .cs or .hs: a C* file */
391 { "cs", Cstar_entries
},
392 { "hs", Cstar_entries
},
394 /* .f and .for are FORTRAN. */
395 { "F", Fortran_functions
},
396 { "f", Fortran_functions
},
397 { "for", Fortran_functions
},
399 /* .pl implies prolog source code */
400 { "pl", Prolog_functions
},
402 /* .p or .pas: a Pascal file */
403 { "p", Pascal_functions
},
404 { "pas", Pascal_functions
},
409 /* Non-NULL if language fixed. */
410 Lang_function
*lang_func
= NULL
;
414 print_language_names ()
416 struct lang_entry
*name
, *ext
;
418 puts ("\nThese are the currently supported languages, along with the\n\
419 default extensions for files:");
420 for (name
= lang_names
; name
->extension
; ++name
)
422 printf ("\t%s\t", name
->extension
);
423 for (ext
= lang_extensions
; ext
->extension
; ++ext
)
424 if (name
->function
== ext
->function
)
425 printf (" .%s", ext
->extension
);
428 puts ("Where `auto' means use default language for files based on filename\n\
429 extension, and `none' means only do regexp processing on files.\n\
430 If no language is specified and no extension is found for some file,\n\
431 Fortran is tried first; if no tags are found, C is tried next.");
438 printf ("%s for Emacs version %s.\n", (CTAGS
) ? "CTAGS" : "ETAGS", VERSION
);
440 printf ("%s for Emacs version 19.\n", (CTAGS
) ? "CTAGS" : "ETAGS");
449 printf ("These are the options accepted by %s. You may use unambiguous\n\
450 abbreviations for the long option names. A - as file name means read\n\
451 names from stdin.\n\n", progname
);
453 puts ("-a, --append\n\
454 Append tag entries to existing tags file.");
457 puts ("-B, --backward-search\n\
458 Write the search commands for the tag entries using '?', the\n\
459 backward-search command instead of '/', the forward-search command.");
462 Treat files whose extension defaults to C language as C++ files.");
465 puts ("-d, --defines\n\
466 Create tag entries for constant C #defines, too.");
468 puts ("-D, --no-defines\n\
469 Don't create tag entries for constant C #defines. This makes\n\
470 the tags file smaller.");
474 puts ("-i FILE, --include=FILE\n\
475 Include a note in tag file indicating that, when searching for\n\
476 a tag, one should also consult the tags file FILE after\n\
477 checking the current file.");
478 puts ("-l LANG, --language=LANG\n\
479 Force the following files to be considered as written in the\n\
480 named language up to the next --language=LANG option.");
484 puts ("-r /REGEXP/, --regex=/REGEXP/\n\
485 Make a tag for each line matching pattern REGEXP in the\n\
486 following files. REGEXP is anchored (as if preceded by ^).\n\
487 The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
488 named tags can be created with:\n\
489 --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
490 puts ("-R, --no-regex\n\
491 Don't create tags from regexps for the following files.");
492 #endif /* ETAGS_REGEXPS */
493 puts ("-o FILE, --output=FILE\n\
494 Write the tags to FILE.");
495 puts ("-I, --ignore-indentation\n\
496 Don't rely on indentation quite as much as normal. Currently,\n\
497 this means not to assume that a closing brace in the first\n\
498 column is the final brace of a function or structure\n\
499 definition in C and C++.");
503 puts ("-t, --typedefs\n\
504 Generate tag entries for C typedefs.");
505 puts ("-T, --typedefs-and-c++\n\
506 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
507 and C++ member functions.");
508 puts ("-u, --update\n\
509 Update the tag entries for the given files, leaving tag\n\
510 entries for other files in place. Currently, this is\n\
511 implemented by deleting the existing entries for the given\n\
512 files and then rewriting the new entries at the end of the\n\
513 tags file. It is often faster to simply rebuild the entire\n\
514 tag file than to use this.");
515 puts ("-v, --vgrind\n\
516 Generates an index of items intended for human consumption,\n\
517 similar to the output of vgrind. The index is sorted, and\n\
518 gives the page number of each item.");
519 puts ("-w, --no-warn\n\
520 Suppress warning messages about entries defined in multiple\n\
522 puts ("-x, --cxref\n\
523 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
524 The output uses line numbers instead of page numbers, but\n\
525 beyond that the differences are cosmetic; try both to see\n\
529 puts ("-V, --version\n\
530 Print the version of the program.\n\
532 Print this help message.");
534 print_language_names ();
547 /* This structure helps us allow mixing of --lang and filenames. */
550 enum argument_type arg_type
;
552 Lang_function
*function
;
555 #ifdef VMS /* VMS specific functions */
559 /* This is a BUG! ANY arbitrary limit is a BUG!
560 Won't someone please fix this? */
561 #define MAX_FILE_SPEC_LEN 255
564 char body
[MAX_FILE_SPEC_LEN
+ 1];
568 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
569 returning in each successive call the next filename matching the input
570 spec. The function expects that each in_spec passed
571 to it will be processed to completion; in particular, up to and
572 including the call following that in which the last matching name
573 is returned, the function ignores the value of in_spec, and will
574 only start processing a new spec with the following call.
575 If an error occurs, on return out_spec contains the value
576 of in_spec when the error occurred.
578 With each successive filename returned in out_spec, the
579 function's return value is one. When there are no more matching
580 names the function returns zero. If on the first call no file
581 matches in_spec, or there is any other error, -1 is returned.
586 #define OUTSIZE MAX_FILE_SPEC_LEN
592 static long context
= 0;
593 static struct dsc$descriptor_s o
;
594 static struct dsc$descriptor_s i
;
595 static logical pass1
= TRUE
;
602 o
.dsc$a_pointer
= (char *) out
;
603 o
.dsc$w_length
= (short)OUTSIZE
;
604 i
.dsc$a_pointer
= in
;
605 i
.dsc$w_length
= (short)strlen(in
);
606 i
.dsc$b_dtype
= DSC$K_DTYPE_T
;
607 i
.dsc$b_class
= DSC$K_CLASS_S
;
608 o
.dsc$b_dtype
= DSC$K_DTYPE_VT
;
609 o
.dsc$b_class
= DSC$K_CLASS_VS
;
611 if ((status
= lib$
find_file(&i
, &o
, &context
, 0, 0)) == RMS$_NORMAL
)
613 out
->body
[out
->curlen
] = EOS
;
616 else if (status
== RMS$_NMF
)
620 strcpy(out
->body
, in
);
623 lib$
find_file_end(&context
);
629 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
630 name of each file specified by the provided arg expanding wildcards.
633 gfnames (arg
, p_error
)
637 static vspec filename
= {MAX_FILE_SPEC_LEN
, "\0"};
639 switch (fn_exp (&filename
, arg
))
643 return filename
.body
;
649 return filename
.body
;
653 #ifndef OLD /* Newer versions of VMS do provide `system'. */
657 fprintf (stderr
, "system() function not implemented under VMS\n");
661 #define VERSION_DELIM ';'
662 char *massage_name (s
)
668 if (*s
== VERSION_DELIM
)
686 unsigned int nincluded_files
= 0;
687 char **included_files
= xnew (argc
, char *);
690 int current_arg
= 0, file_count
= 0;
691 struct linebuffer filename_lb
;
697 _fmode
= O_BINARY
; /* all of files are treated as binary files */
702 /* Allocate enough no matter what happens. Overkill, but each one
704 argbuffer
= xnew (argc
, ARGUMENT
);
707 /* Set syntax for regular expression routines. */
708 re_set_syntax (RE_SYNTAX_EMACS
);
709 #endif /* ETAGS_REGEXPS */
712 * If etags, always find typedefs and structure tags. Why not?
713 * Also default is to find macro constants.
716 typedefs
= typedefs_and_cplusplus
= constantypedefs
= TRUE
;
720 int opt
= getopt_long (argc
, argv
,
721 "-aCdDf:Il:o:r:RStTi:BuvxwVhH", longopts
, 0);
729 /* If getopt returns 0, then it has already processed a
730 long-named option. We should do nothing. */
734 /* This means that a filename has been seen. Record it. */
735 argbuffer
[current_arg
].arg_type
= at_filename
;
736 argbuffer
[current_arg
].what
= optarg
;
741 /* Common options. */
743 append_to_tagfile
= TRUE
;
749 constantypedefs
= TRUE
;
752 constantypedefs
= FALSE
;
754 case 'f': /* for compatibility with old makefiles */
758 fprintf (stderr
, "%s: -%c option may only be given once.\n",
765 case 'S': /* for backward compatibility */
766 noindentypedefs
= TRUE
;
769 if (!get_language (optarg
, &argbuffer
[current_arg
].function
))
771 fprintf (stderr
, "%s: language \"%s\" not recognized.\n",
775 argbuffer
[current_arg
].arg_type
= at_language
;
780 argbuffer
[current_arg
].arg_type
= at_regexp
;
781 argbuffer
[current_arg
].what
= optarg
;
785 argbuffer
[current_arg
].arg_type
= at_regexp
;
786 argbuffer
[current_arg
].what
= NULL
;
789 #endif /* ETAGS_REGEXPS */
801 typedefs
= typedefs_and_cplusplus
= TRUE
;
806 included_files
[nincluded_files
++] = optarg
;
831 for (; optind
< argc
; ++optind
)
833 argbuffer
[current_arg
].arg_type
= at_filename
;
834 argbuffer
[current_arg
].what
= argv
[optind
];
839 if (nincluded_files
== 0 && file_count
== 0)
841 fprintf (stderr
, "%s: No input files specified.\n", progname
);
844 fprintf (stderr
, "\tTry `%s --help' for a complete list of options.\n",
851 tagfile
= CTAGS
? "tags" : "TAGS";
853 cwd
= etags_getcwd (); /* the current working directory */
855 if (streq (tagfile
, "-"))
861 tagfiledir
= absolute_dirname (tagfile
, cwd
);
864 init (); /* set up boolean "functions" */
867 initbuffer (&token_name
);
868 initbuffer (&lbs
[0].lb
);
869 initbuffer (&lbs
[1].lb
);
870 initbuffer (&filename_lb
);
874 if (streq (tagfile
, "-"))
877 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
883 * Loop through files finding functions.
885 for (i
= 0; i
< current_arg
; ++i
)
887 switch (argbuffer
[i
].arg_type
)
890 lang_func
= argbuffer
[i
].function
;
894 add_regex (argbuffer
[i
].what
);
899 while ((this_file
= gfnames (argbuffer
[i
].what
, &got_err
)) != NULL
)
903 error ("Can't find file %s\n", this_file
);
908 this_file
= massage_name (this_file
);
911 this_file
= argbuffer
[i
].what
;
913 /* Input file named "-" means read file names from stdin
915 if (streq (this_file
, "-"))
916 while (readline_internal (&filename_lb
, stdin
) > 0)
917 process_file (filename_lb
.buffer
);
919 process_file (this_file
);
929 while (nincluded_files
-- > 0)
930 fprintf (tagf
, "\f\n%s,include\n", *included_files
++);
936 /* If CTAGS, we are here. process_file did not write the tags yet,
937 because we want them ordered. Let's do it now. */
940 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
950 for (i
= 0; i
< current_arg
; ++i
)
952 if (argbuffer
[i
].arg_type
!= at_filename
)
955 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
956 tagfile
, argbuffer
[i
].what
, tagfile
);
957 if (system (cmd
) != GOOD
)
958 fatal ("failed to execute shell command");
960 append_to_tagfile
= TRUE
;
963 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
972 sprintf (cmd
, "sort %s -o %s", tagfile
, tagfile
);
980 * Set the language, given the name.
983 get_language (language
, func
)
985 Lang_function
**func
;
987 struct lang_entry
*lang
;
989 for (lang
= lang_names
; lang
->extension
; ++lang
)
991 if (streq (language
, lang
->extension
))
993 *func
= lang
->function
;
1003 * This routine is called on each file argument.
1009 struct stat stat_buf
;
1012 if (stat (file
, &stat_buf
) == 0 && !S_ISREG (stat_buf
.st_mode
))
1014 fprintf (stderr
, "Skipping %s: it is not a regular file.\n", file
);
1017 if (streq (file
, tagfile
) && !streq (tagfile
, "-"))
1019 fprintf (stderr
, "Skipping inclusion of %s in self.\n", file
);
1022 inf
= fopen (file
, "r");
1029 find_entries (file
, inf
);
1037 /* file is an absolute filename. Canonicalise it. */
1038 filename
= absolute_filename (file
, cwd
);
1042 /* file is a filename relative to cwd. Make it relative
1043 to the directory of the tags file. */
1044 filename
= relative_filename (file
, tagfiledir
);
1046 fprintf (tagf
, "\f\n%s,%d\n", filename
, total_size_of_entries (head
));
1055 * This routine sets up the boolean pseudo-functions which work
1056 * by setting boolean flags dependent upon the corresponding character
1057 * Every char which is NOT in that string is not a white char. Therefore,
1058 * all of the array "_wht" is set to FALSE, and then the elements
1059 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
1060 * of a char is TRUE if it is the string "white", else FALSE.
1068 for (i
= 0; i
< 0177; i
++)
1069 _wht
[i
] = _etk
[i
] = _itk
[i
] = _btk
[i
] = FALSE
;
1070 for (sp
= white
; *sp
; sp
++)
1072 for (sp
= endtk
; *sp
; sp
++)
1074 for (sp
= intk
; *sp
; sp
++)
1076 for (sp
= begtk
; *sp
; sp
++)
1078 _wht
[0] = _wht
['\n'];
1079 _etk
[0] = _etk
['\n'];
1080 _btk
[0] = _btk
['\n'];
1081 _itk
[0] = _itk
['\n'];
1085 * This routine opens the specified file and calls the function
1086 * which finds the function and type definitions.
1089 find_entries (file
, inf
)
1094 struct lang_entry
*lang
;
1095 NODE
*old_last_node
;
1096 extern NODE
*last_node
;
1098 curfile
= savestr (file
);
1099 cp
= etags_strrchr (file
, '.');
1101 /* If user specified a language, use it. */
1102 if (lang_func
!= NULL
)
1112 for (lang
= lang_extensions
; lang
->extension
; ++lang
)
1114 if (streq (cp
, lang
->extension
))
1116 lang
->function (inf
);
1124 old_last_node
= last_node
;
1125 Fortran_functions (inf
);
1127 /* No Fortran entries found. Try C. */
1128 if (old_last_node
== last_node
)
1129 default_C_entries (inf
);
1135 pfnote (name
, is_func
, named
, linestart
, linelen
, lno
, cno
)
1136 char *name
; /* tag name */
1137 logical is_func
; /* tag is a function */
1138 logical named
; /* tag different from text of definition */
1139 char *linestart
; /* start of the line where tag is */
1140 int linelen
; /* length of the line where tag is */
1141 int lno
; /* line number */
1142 long cno
; /* character number */
1144 register NODE
*np
= xnew (1, NODE
);
1147 /* If ctags mode, change name "main" to M<thisfilename>. */
1148 if (CTAGS
&& !cxref_style
&& streq (name
, "main"))
1150 fp
= etags_strrchr (curfile
, '/');
1151 np
->name
= concat ("M", fp
== 0 ? curfile
: fp
+ 1, "");
1152 fp
= etags_strrchr (np
->name
, '.');
1153 if (fp
&& fp
[1] != '\0' && fp
[2] == '\0')
1162 np
->been_warned
= FALSE
;
1164 np
->is_func
= is_func
;
1166 /* Our char numbers are 0-base, because of C language tradition?
1167 ctags compatibility? old versions compatibility? I don't know.
1168 Anyway, since emacs's are 1-base we espect etags.el to take care
1169 of the difference. If we wanted to have 1-based numbers, we would
1170 uncomment the +1 below. */
1171 np
->cno
= cno
/* + 1 */ ;
1172 np
->left
= np
->right
= NULL
;
1173 np
->pat
= savenstr (linestart
, ((CTAGS
&& !cxref_style
) ? 50 : linelen
));
1175 add_node (np
, &head
);
1180 * recurse on left children, iterate on right children.
1184 register NODE
*node
;
1188 register NODE
*node_right
= node
->right
;
1189 free_tree (node
->left
);
1193 free ((char *) node
);
1200 * Adds a node to the tree of nodes. In etags mode, we don't keep
1201 * it sorted; we just keep a linear list. In ctags mode, maintain
1202 * an ordered tree, with no attempt at balancing.
1204 * add_node is the only function allowed to add nodes, so it can
1207 NODE
*last_node
= NULL
;
1209 add_node (node
, cur_node_p
)
1210 NODE
*node
, **cur_node_p
;
1213 register NODE
*cur_node
= *cur_node_p
;
1215 if (cur_node
== NULL
)
1225 if (last_node
== NULL
)
1226 fatal ("internal error in add_node", 0);
1227 last_node
->right
= node
;
1233 dif
= strcmp (node
->name
, cur_node
->name
);
1236 * If this tag name matches an existing one, then
1237 * do not add the node, but maybe print a warning.
1241 if (node
->file
== cur_node
->file
)
1245 fprintf (stderr
, "Duplicate entry in file %s, line %d: %s\n",
1246 node
->file
, lineno
, node
->name
);
1247 fprintf (stderr
, "Second entry ignored\n");
1251 if (!cur_node
->been_warned
&& !no_warnings
)
1254 "Duplicate entry in files %s and %s: %s (Warning only)\n",
1255 node
->file
, cur_node
->file
, node
->name
);
1257 cur_node
->been_warned
= TRUE
;
1261 /* Maybe refuse to add duplicate nodes. */
1262 if (!permit_duplicates
)
1264 if (streq (node
->name
, cur_node
->name
)
1265 && streq (node
->file
, cur_node
->file
))
1269 /* Actually add the node */
1270 add_node (node
, dif
< 0 ? &cur_node
->left
: &cur_node
->right
);
1276 register NODE
*node
;
1283 /* Output subentries that precede this one */
1284 put_entries (node
->left
);
1286 /* Output this entry */
1292 fprintf (tagf
, "%s\177%s\001%d,%d\n",
1293 node
->pat
, node
->name
,
1294 node
->lno
, node
->cno
);
1298 fprintf (tagf
, "%s\177%d,%d\n",
1300 node
->lno
, node
->cno
);
1303 else if (!cxref_style
)
1305 fprintf (tagf
, "%s\t%s\t",
1306 node
->name
, node
->file
);
1310 putc (searchar
, tagf
);
1313 for (sp
= node
->pat
; *sp
; sp
++)
1315 if (*sp
== '\\' || *sp
== searchar
)
1319 putc (searchar
, tagf
);
1322 { /* a typedef; text pattern inadequate */
1323 fprintf (tagf
, "%d", node
->lno
);
1327 else if (vgrind_style
)
1328 fprintf (stdout
, "%s %s %d\n",
1329 node
->name
, node
->file
, (node
->lno
+ 63) / 64);
1331 fprintf (stdout
, "%-16s %3d %-16s %s\n",
1332 node
->name
, node
->lno
, node
->file
, node
->pat
);
1334 /* Output subentries that follow this one */
1335 put_entries (node
->right
);
1338 /* Length of a number's decimal representation. */
1346 for (; num
; num
/= 10)
1352 * Return total number of characters that put_entries will output for
1353 * the nodes in the subtree of the specified node. Works only if
1354 * we are not ctags, but called only in that case. This count
1355 * is irrelevant with the new tags.el, but is still supplied for
1356 * backward compatibility.
1359 total_size_of_entries (node
)
1360 register NODE
*node
;
1368 for (; node
; node
= node
->right
)
1370 /* Count left subentries. */
1371 total
+= total_size_of_entries (node
->left
);
1373 /* Count this entry */
1374 total
+= strlen (node
->pat
) + 1;
1375 total
+= number_len ((long) node
->lno
) + 1 + number_len (node
->cno
) + 1;
1377 total
+= 1 + strlen (node
->name
); /* \001name */
1384 * The C symbol tables.
1388 st_none
, st_C_struct
, st_C_enum
, st_C_define
, st_C_typedef
, st_C_typespec
1391 /* Feed stuff between (but not including) %[ and %] lines to:
1392 gperf -c -k1,3 -o -p -r -t
1394 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
1396 class, C_PLPL, st_C_struct
1397 domain, C_STAR, st_C_struct
1398 union, 0, st_C_struct
1399 struct, 0, st_C_struct
1401 typedef, 0, st_C_typedef
1402 define, 0, st_C_define
1403 long, 0, st_C_typespec
1404 short, 0, st_C_typespec
1405 int, 0, st_C_typespec
1406 char, 0, st_C_typespec
1407 float, 0, st_C_typespec
1408 double, 0, st_C_typespec
1409 signed, 0, st_C_typespec
1410 unsigned, 0, st_C_typespec
1411 auto, 0, st_C_typespec
1412 void, 0, st_C_typespec
1413 extern, 0, st_C_typespec
1414 static, 0, st_C_typespec
1415 const, 0, st_C_typespec
1416 volatile, 0, st_C_typespec
1418 and replace lines between %< and %> with its output. */
1420 /* C code produced by gperf version 1.8.1 (K&R C version) */
1421 /* Command-line: gperf -c -k1,3 -o -p -r -t */
1424 struct C_stab_entry
{ char *name
; int c_ext
; enum sym_type type
; };
1426 #define MIN_WORD_LENGTH 3
1427 #define MAX_WORD_LENGTH 8
1428 #define MIN_HASH_VALUE 10
1429 #define MAX_HASH_VALUE 62
1432 53 is the maximum key range
1440 static unsigned char hash_table
[] =
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, 62, 62, 62,
1450 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1451 62, 62, 62, 62, 62, 62, 62, 2, 62, 7,
1452 6, 9, 15, 30, 62, 24, 62, 62, 1, 24,
1453 7, 27, 13, 62, 19, 26, 18, 27, 1, 62,
1454 62, 62, 62, 62, 62, 62, 62, 62,
1456 return len
+ hash_table
[str
[2]] + hash_table
[str
[0]];
1459 struct C_stab_entry
*
1460 in_word_set (str
, len
)
1465 static struct C_stab_entry wordlist
[] =
1467 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
1469 {"volatile", 0, st_C_typespec
},
1471 {"long", 0, st_C_typespec
},
1472 {"char", 0, st_C_typespec
},
1473 {"class", C_PLPL
, st_C_struct
},
1474 {"",}, {"",}, {"",}, {"",},
1475 {"const", 0, st_C_typespec
},
1476 {"",}, {"",}, {"",}, {"",},
1477 {"auto", 0, st_C_typespec
},
1479 {"define", 0, st_C_define
},
1481 {"void", 0, st_C_typespec
},
1482 {"",}, {"",}, {"",},
1483 {"extern", 0, st_C_typespec
},
1484 {"static", 0, st_C_typespec
},
1486 {"domain", C_STAR
, st_C_struct
},
1488 {"typedef", 0, st_C_typedef
},
1489 {"double", 0, st_C_typespec
},
1490 {"enum", 0, st_C_enum
},
1491 {"",}, {"",}, {"",}, {"",},
1492 {"int", 0, st_C_typespec
},
1494 {"float", 0, st_C_typespec
},
1495 {"",}, {"",}, {"",},
1496 {"struct", 0, st_C_struct
},
1497 {"",}, {"",}, {"",}, {"",},
1498 {"union", 0, st_C_struct
},
1500 {"short", 0, st_C_typespec
},
1502 {"unsigned", 0, st_C_typespec
},
1503 {"signed", 0, st_C_typespec
},
1506 if (len
<= MAX_WORD_LENGTH
&& len
>= MIN_WORD_LENGTH
)
1508 register int key
= hash (str
, len
);
1510 if (key
<= MAX_HASH_VALUE
&& key
>= MIN_HASH_VALUE
)
1512 register char *s
= wordlist
[key
].name
;
1514 if (*s
== *str
&& strneq (str
+ 1, s
+ 1, len
- 1))
1515 return &wordlist
[key
];
1523 C_symtype(str
, len
, c_ext
)
1528 register struct C_stab_entry
*se
= in_word_set(str
, len
);
1530 if (se
== NULL
|| (se
->c_ext
&& !(c_ext
& se
->c_ext
)))
1536 * C functions are recognized using a simple finite automaton.
1537 * funcdef is its state variable.
1541 fnone
, /* nothing seen */
1542 ftagseen
, /* function-like tag seen */
1543 fstartlist
, /* just after open parenthesis */
1544 finlist
, /* in parameter list */
1545 flistseen
, /* after parameter list */
1546 fignore
/* before open brace */
1552 * typedefs are recognized using a simple finite automaton.
1553 * typeddef is its state variable.
1557 tnone
, /* nothing seen */
1558 ttypedseen
, /* typedef keyword seen */
1559 tinbody
, /* inside typedef body */
1560 tend
, /* just before typedef tag */
1561 tignore
/* junk after typedef tag */
1567 * struct-like structures (enum, struct and union) are recognized
1568 * using another simple finite automaton. `structdef' is its state
1573 snone
, /* nothing seen yet */
1574 skeyseen
, /* struct-like keyword seen */
1575 stagseen
, /* struct-like tag seen */
1576 scolonseen
, /* colon seen after struct-like tag */
1577 sinbody
/* in struct body: recognize member func defs*/
1582 * When structdef is stagseen, scolonseen, or sinbody, structtag is the
1583 * struct tag, and structtype is the type of the preceding struct-like
1586 char *structtag
= "<uninited>";
1587 enum sym_type structtype
;
1590 * Yet another little state machine to deal with preprocessor lines.
1594 dnone
, /* nothing seen */
1595 dsharpseen
, /* '#' seen as first char on line */
1596 ddefineseen
, /* '#' and 'define' seen */
1597 dignorerest
/* ignore rest of line */
1602 * Set this to TRUE, and the next token considered is called a function.
1603 * Used only for GNU emacs's function-defining macros.
1605 logical next_token_is_func
;
1608 * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
1614 * checks to see if the current token is at the start of a
1615 * function, or corresponds to a typedef, or is a struct/union/enum
1618 * *IS_FUNC gets TRUE iff the token is a function or macro with args.
1619 * C_EXT is which language we are looking at.
1621 * In the future we will need some way to adjust where the end of
1622 * the token is; for instance, implementing the C++ keyword
1623 * `operator' properly will adjust the end of the token to be after
1624 * whatever follows `operator'.
1631 * next_token_is_func IN OUT
1635 consider_token (str
, len
, c
, c_ext
, cblev
, is_func
)
1636 register char *str
; /* IN: token pointer */
1637 register int len
; /* IN: token length */
1638 register char c
; /* IN: first char after the token */
1639 int c_ext
; /* IN: C extensions mask */
1640 int cblev
; /* IN: curly brace level */
1641 logical
*is_func
; /* OUT: function found */
1643 enum sym_type toktype
= C_symtype (str
, len
, c_ext
);
1646 * Advance the definedef state machine.
1651 /* We're not on a preprocessor line. */
1654 if (toktype
== st_C_define
)
1656 definedef
= ddefineseen
;
1660 definedef
= dignorerest
;
1665 * Make a tag for any macro, unless it is a constant
1666 * and constantypedefs is FALSE.
1668 definedef
= dignorerest
;
1669 *is_func
= (c
== '(');
1670 if (!*is_func
&& !constantypedefs
)
1677 error ("internal error: definedef value.", 0);
1686 if (toktype
== st_C_typedef
)
1689 typdef
= ttypedseen
;
1705 /* Do not return here, so the structdef stuff has a chance. */
1719 * This structdef business is currently only invoked when cblev==0.
1720 * It should be recursively invoked whatever the curly brace level,
1721 * and a stack of states kept, to allow for definitions of structs
1724 * This structdef business is NOT invoked when we are ctags and the
1725 * file is plain C. This is because a struct tag may have the same
1726 * name as another tag, and this loses with ctags.
1728 * This if statement deals with the typdef state machine as
1729 * follows: if typdef==ttypedseen and token is struct/union/class/enum,
1730 * return FALSE. All the other code here is for the structdef
1737 if (typdef
== ttypedseen
1738 || (typedefs_and_cplusplus
&& cblev
== 0 && structdef
== snone
))
1740 structdef
= skeyseen
;
1741 structtype
= toktype
;
1745 if (structdef
== skeyseen
)
1747 /* Save the tag for struct/union/class, for functions that may be
1749 if (structtype
== st_C_struct
)
1750 structtag
= savenstr (str
, len
);
1752 structtag
= "<enum>";
1753 structdef
= stagseen
;
1757 /* Avoid entering funcdef stuff if typdef is going on. */
1758 if (typdef
!= tnone
)
1764 /* Detect GNU macros. */
1765 if (definedef
== dnone
)
1766 if (strneq (str
, "DEFUN", 5) /* Used in emacs */
1768 These are defined inside C functions
, so currently they
1770 || strneq (str
, "EXFUN", 5) /* Used in glibc */
1771 || strneq (str
, "DEFVAR_", 7) /* Used in emacs */
1773 || strneq (str
, "SYSCALL", 7) /* Used in glibc (mach) */
1774 || strneq (str
, "ENTRY", 5) /* Used in glibc */
1775 || strneq (str
, "PSEUDO", 6)) /* Used in glibc */
1778 next_token_is_func
= TRUE
;
1781 if (next_token_is_func
)
1783 next_token_is_func
= FALSE
;
1793 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1794 funcdef
= fnone
; /* should be useless */
1797 if (funcdef
== fnone
)
1810 * This routine finds functions, typedefs, #define's and
1811 * struct/union/enum definitions in C syntax and adds them
1825 #define current_lb_is_new (newndx == curndx)
1826 #define switch_line_buffers() (curndx = 1 - curndx)
1828 #define curlb (lbs[curndx].lb)
1829 #define othlb (lbs[1-curndx].lb)
1830 #define newlb (lbs[newndx].lb)
1831 #define curlinepos (lbs[curndx].linepos)
1832 #define othlinepos (lbs[1-curndx].linepos)
1833 #define newlinepos (lbs[newndx].linepos)
1835 #define CNL_SAVE_DEFINEDEF \
1837 curlinepos = charno; \
1839 charno += readline (&curlb, inf); \
1840 lp = curlb.buffer; \
1847 CNL_SAVE_DEFINEDEF; \
1848 if (savetok.valid) \
1851 savetok.valid = FALSE; \
1853 definedef = dnone; \
1856 #define make_tag(isfun) do \
1859 pfnote (savestr (token_name.buffer), isfun, tok.named, \
1860 tok.buffer, tok.linelen, tok.lineno, tok.linepos); \
1861 else if (DEBUG) abort (); \
1862 tok.valid = FALSE; \
1866 C_entries (c_ext
, inf
)
1867 int c_ext
; /* extension of C */
1868 FILE *inf
; /* input file */
1870 register char c
; /* latest char read; '\0' for end of line */
1871 register char *lp
; /* pointer one beyond the character `c' */
1872 int curndx
, newndx
; /* indices for current and new lb */
1873 TOKEN tok
; /* latest token read */
1874 register int tokoff
; /* offset in line of start of current token */
1875 register int toklen
; /* length of current token */
1876 int cblev
; /* current curly brace level */
1877 int parlev
; /* current parenthesis level */
1878 logical incomm
, inquote
, inchar
, quotednl
, midtoken
;
1880 TOKEN savetok
; /* token saved during preprocessor handling */
1883 curndx
= newndx
= 0;
1889 definedef
= dnone
; funcdef
= fnone
; typdef
= tnone
; structdef
= snone
;
1890 next_token_is_func
= yacc_rules
= FALSE
;
1891 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
1892 tok
.valid
= savetok
.valid
= FALSE
;
1895 cplpl
= c_ext
& C_PLPL
;
1902 /* If we're at the end of the line, the next character is a
1903 '\0'; don't skip it, because it's the thing that tells us
1904 to read the next line. */
1925 /* Newlines inside comments do not end macro definitions in
1940 /* Newlines inside strings do not end macro definitions
1941 in traditional cpp, even though compilers don't
1942 usually accept them. */
1953 /* Hmmm, something went wrong. */
1967 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1972 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1982 else if (cplpl
&& *lp
== '/')
1990 if ((c_ext
& YACC
) && *lp
== '%')
1992 /* entering or exiting rules section in yacc file */
1994 definedef
= dnone
; funcdef
= fnone
;
1995 typdef
= tnone
; structdef
= snone
;
1996 next_token_is_func
= FALSE
;
1997 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
1999 yacc_rules
= !yacc_rules
;
2005 if (definedef
== dnone
)
2008 logical cpptoken
= TRUE
;
2010 /* Look back on this line. If all blanks, or nonblanks
2011 followed by an end of comment, this is a preprocessor
2013 for (cp
= newlb
.buffer
; cp
< lp
-1; cp
++)
2016 if (*cp
== '*' && *(cp
+1) == '/')
2025 definedef
= dsharpseen
;
2026 } /* if (definedef == dnone) */
2032 /* Consider token only if some complicated conditions are satisfied. */
2033 if ((definedef
!= dnone
2034 || (cblev
== 0 && structdef
!= scolonseen
)
2035 || (cblev
== 1 && cplpl
&& structdef
== sinbody
))
2036 && typdef
!= tignore
2037 && definedef
!= dignorerest
2038 && funcdef
!= finlist
)
2044 if (cplpl
&& c
== ':' && *lp
== ':' && begtoken(*(lp
+ 1)))
2047 * This handles :: in the middle, but not at the
2048 * beginning of an identifier.
2055 logical is_func
= FALSE
;
2058 || consider_token (newlb
.buffer
+ tokoff
, toklen
,
2059 c
, c_ext
, cblev
, &is_func
))
2061 if (structdef
== sinbody
2062 && definedef
== dnone
2064 /* function defined in C++ class body */
2066 int strsize
= strlen(structtag
) + 2 + toklen
+ 1;
2067 while (token_name
.size
< strsize
)
2069 token_name
.size
*= 2;
2070 token_name
.buffer
=xrealloc(token_name
.buffer
,
2073 strcpy (token_name
.buffer
, structtag
);
2074 strcat (token_name
.buffer
, "::");
2075 strncat (token_name
.buffer
,
2076 newlb
.buffer
+tokoff
, toklen
);
2081 while (token_name
.size
< toklen
+ 1)
2083 token_name
.size
*= 2;
2084 token_name
.buffer
=xrealloc(token_name
.buffer
,
2087 strncpy (token_name
.buffer
,
2088 newlb
.buffer
+tokoff
, toklen
);
2089 token_name
.buffer
[toklen
] = '\0';
2090 if (structdef
== stagseen
2093 && definedef
== dignorerest
)) /* macro */
2098 tok
.lineno
= lineno
;
2099 tok
.linelen
= tokoff
+ toklen
+ 1;
2100 tok
.buffer
= newlb
.buffer
;
2101 tok
.linepos
= newlinepos
;
2104 if (definedef
== dnone
2105 && (funcdef
== ftagseen
2106 || structdef
== stagseen
2109 if (current_lb_is_new
)
2110 switch_line_buffers ();
2117 } /* if (endtoken (c)) */
2118 else if (intoken (c
))
2123 } /* if (midtoken) */
2124 else if (begtoken (c
))
2142 if (structdef
== stagseen
)
2148 if (!yacc_rules
|| lp
== newlb
.buffer
+ 1)
2150 tokoff
= lp
- 1 - newlb
.buffer
;
2155 } /* if (begtoken) */
2156 } /* if must look at token */
2159 /* Detect end of line, colon, comma, semicolon and various braces
2160 after having handled a token.*/
2164 if (definedef
!= dnone
)
2166 if (structdef
== stagseen
)
2167 structdef
= scolonseen
;
2184 if (definedef
!= dnone
)
2195 if (funcdef
!= fignore
)
2197 if (structdef
== stagseen
)
2201 if (definedef
!= dnone
)
2203 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2205 if (structdef
== stagseen
)
2209 if (definedef
!= dnone
)
2211 if (cblev
== 0 && typdef
== tend
)
2217 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2219 if (structdef
== stagseen
)
2223 if (definedef
!= dnone
)
2232 /* Make sure that the next char is not a '*'.
2233 This handles constructs like:
2234 typedef void OperatorFun (int fun); */
2241 } /* switch (typdef) */
2244 funcdef
= fstartlist
;
2253 if (definedef
!= dnone
)
2261 funcdef
= flistseen
;
2264 if (cblev
== 0 && typdef
== tend
)
2270 else if (parlev
< 0) /* can happen due to ill-conceived #if's. */
2274 if (definedef
!= dnone
)
2276 if (typdef
== ttypedseen
)
2280 case skeyseen
: /* unnamed struct */
2281 structtag
= "_anonymous_";
2282 structdef
= sinbody
;
2285 case scolonseen
: /* named struct */
2286 structdef
= sinbody
;
2299 /* Neutralize `extern "C" {' grot and look inside structs. */
2300 if (cblev
== 0 && structdef
== snone
&& typdef
== tnone
)
2306 if (definedef
!= dnone
)
2308 if (funcdef
== fstartlist
)
2309 funcdef
= fnone
; /* avoid tagging `foo' in `foo (*bar()) ()' */
2312 if (definedef
!= dnone
)
2314 if (!noindentypedefs
&& lp
== newlb
.buffer
+ 1)
2316 cblev
= 0; /* reset curly brace level if first column */
2317 parlev
= 0; /* also reset paren level, just in case... */
2323 if (typdef
== tinbody
)
2325 #if FALSE /* too risky */
2326 if (structdef
== sinbody
)
2331 structtag
= "<error>";
2335 case '#': case '+': case '-': case '~': case '&': case '%': case '/':
2336 case '|': case '^': case '!': case '<': case '>': case '.': case '?':
2337 if (definedef
!= dnone
)
2339 /* These surely cannot follow a function tag. */
2340 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2344 /* If a macro spans multiple lines don't reset its state. */
2352 } /* while not eof */
2356 * Process either a C++ file or a C file depending on the setting
2360 default_C_entries (inf
)
2363 C_entries (cplusplus
? C_PLPL
: 0, inf
);
2366 /* Always do C++. */
2368 Cplusplus_entries (inf
)
2371 C_entries (C_PLPL
, inf
);
2379 C_entries (C_STAR
, inf
);
2382 /* Always do Yacc. */
2387 C_entries (YACC
, inf
);
2390 /* Fortran parsing */
2398 register int len
= 0;
2400 while (*cp
&& (*cp
| ' ') == (dbp
[len
] | ' '))
2413 while (isspace (*dbp
))
2418 while (isspace (*dbp
))
2422 if (!isdigit (*dbp
))
2424 --dbp
; /* force failure */
2429 while (isdigit (*dbp
));
2438 while (isspace (*dbp
))
2443 linecharno
= charno
;
2444 charno
+= readline (&lb
, inf
);
2449 while (isspace (*dbp
))
2458 && (isalpha (*cp
) || isdigit (*cp
) || (*cp
== '_') || (*cp
== '$')));
2461 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2462 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2466 Fortran_functions (inf
)
2475 linecharno
= charno
;
2476 charno
+= readline (&lb
, inf
);
2479 dbp
++; /* Ratfor escape to fortran */
2480 while (isspace (*dbp
))
2487 if (tail ("integer"))
2495 if (tail ("logical"))
2499 if (tail ("complex") || tail ("character"))
2503 if (tail ("double"))
2505 while (isspace (*dbp
))
2509 if (tail ("precision"))
2515 while (isspace (*dbp
))
2522 if (tail ("function"))
2526 if (tail ("subroutine"))
2534 if (tail ("program"))
2539 if (tail ("procedure"))
2547 * Bob Weiner, Motorola Inc., 4/3/94
2548 * Unix and microcontroller assembly tag handling
2549 * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
2563 linecharno
= charno
;
2564 charno
+= readline (&lb
, inf
);
2567 /* If first char is alphabetic or one of [_.$], test for colon
2568 following identifier. */
2569 if (isalpha (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2571 /* Read past label. */
2573 while (isalnum (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2575 if (*cp
== ':' || isspace (*cp
))
2577 /* Found end of label, so copy it and add it to the table. */
2578 pfnote (savenstr (lb
.buffer
, cp
-lb
.buffer
), TRUE
, FALSE
,
2579 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2585 /* Added by Mosur Mohan, 4/22/88 */
2586 /* Pascal parsing */
2588 #define GET_NEW_LINE \
2590 linecharno = charno; lineno++; \
2591 charno += 1 + readline (&lb, inf); \
2596 * Locates tags for procedures & functions. Doesn't do any type- or
2597 * var-definitions. It does look for the keyword "extern" or
2598 * "forward" immediately following the procedure statement; if found,
2599 * the tag is skipped.
2602 Pascal_functions (inf
)
2605 struct linebuffer tline
; /* mostly copied from C_entries */
2611 logical
/* each of these flags is TRUE iff: */
2612 incomment
, /* point is inside a comment */
2613 inquote
, /* point is inside '..' string */
2614 get_tagname
, /* point is after PROCEDURE/FUNCTION */
2615 /* keyword, so next item = potential tag */
2616 found_tag
, /* point is after a potential tag */
2617 inparms
, /* point is within parameter-list */
2618 verify_tag
; /* point has passed the parm-list, so the */
2619 /* next token will determine whether */
2620 /* this is a FORWARD/EXTERN to be */
2621 /* ignored, or whether it is a real tag */
2627 initbuffer (&tline
);
2629 incomment
= inquote
= FALSE
;
2630 found_tag
= FALSE
; /* have a proc name; check if extern */
2631 get_tagname
= FALSE
; /* have found "procedure" keyword */
2632 inparms
= FALSE
; /* found '(' after "proc" */
2633 verify_tag
= FALSE
; /* check if "extern" is ahead */
2635 /* long main loop to get next char */
2639 if (c
== '\0') /* if end of line */
2644 if (!((found_tag
&& verify_tag
) ||
2646 c
= *dbp
++; /* only if don't need *dbp pointing */
2647 /* to the beginning of the name of */
2648 /* the procedure or function */
2652 if (c
== '}') /* within { - } comments */
2654 else if (c
== '*' && dbp
[1] == ')') /* within (* - *) comments */
2671 inquote
= TRUE
; /* found first quote */
2673 case '{': /* found open-{-comment */
2677 if (*dbp
== '*') /* found open-(*-comment */
2682 else if (found_tag
) /* found '(' after tag, i.e., parm-list */
2685 case ')': /* end of parms list */
2690 if ((found_tag
) && (!inparms
)) /* end of proc or fn stmt */
2697 if ((found_tag
) && (verify_tag
) && (*dbp
!= ' '))
2699 /* check if this is an "extern" declaration */
2702 if ((*dbp
== 'e') || (*dbp
== 'E'))
2704 if (tail ("extern")) /* superfluous, really! */
2710 else if ((*dbp
== 'f') || (*dbp
== 'F'))
2712 if (tail ("forward")) /* check for forward reference */
2718 if ((found_tag
) && (verify_tag
)) /* not external proc, so make tag */
2722 pfnote (nambuf
, TRUE
, FALSE
, tline
.buffer
,
2723 cp
- tline
.buffer
+ 1, save_lineno
, save_lcno
);
2727 if (get_tagname
) /* grab name of proc or fn */
2732 /* save all values for later tagging */
2733 tline
.size
= lb
.size
;
2734 strcpy (tline
.buffer
, lb
.buffer
);
2735 save_lineno
= lineno
;
2736 save_lcno
= linecharno
;
2738 /* grab block name */
2739 for (cp
= dbp
+ 1; *cp
&& (!endtoken (*cp
)); cp
++)
2741 nambuf
= savenstr (dbp
, cp
-dbp
);
2742 dbp
= cp
; /* restore dbp to e-o-token */
2743 get_tagname
= FALSE
;
2747 /* and proceed to check for "extern" */
2749 else if (!incomment
&& !inquote
&& !found_tag
)
2751 /* check for proc/fn keywords */
2755 if (tail ("rocedure")) /* c = 'p', dbp has advanced */
2759 if (tail ("unction"))
2764 } /* while not eof */
2768 * lisp tag functions
2769 * look for (def or (DEF, quote or QUOTE
2773 register char *strp
;
2775 return ((strp
[1] == 'd' || strp
[1] == 'D')
2776 && (strp
[2] == 'e' || strp
[2] == 'E')
2777 && (strp
[3] == 'f' || strp
[3] == 'F'));
2782 register char *strp
;
2784 return ((*(++strp
) == 'q' || *strp
== 'Q')
2785 && (*(++strp
) == 'u' || *strp
== 'U')
2786 && (*(++strp
) == 'o' || *strp
== 'O')
2787 && (*(++strp
) == 't' || *strp
== 'T')
2788 && (*(++strp
) == 'e' || *strp
== 'E')
2789 && isspace(*(++strp
)));
2797 if (*dbp
== '\'') /* Skip prefix quote */
2799 else if (*dbp
== '(' && L_isquote (dbp
)) /* Skip "(quote " */
2802 while (isspace(*dbp
))
2805 for (cp
= dbp
/*+1*/;
2806 *cp
&& *cp
!= '(' && *cp
!= ' ' && *cp
!= ')';
2812 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2813 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2817 Lisp_functions (inf
)
2826 linecharno
= charno
;
2827 charno
+= readline (&lb
, inf
);
2833 while (!isspace (*dbp
))
2835 while (isspace (*dbp
))
2841 /* Check for (foo::defmumble name-defined ... */
2844 while (*dbp
&& !isspace (*dbp
)
2845 && *dbp
!= ':' && *dbp
!= '(' && *dbp
!= ')');
2850 while (*dbp
== ':');
2852 if (L_isdef (dbp
- 1))
2854 while (!isspace (*dbp
))
2856 while (isspace (*dbp
))
2867 * Scheme tag functions
2868 * look for (def... xyzzy
2869 * look for (def... (xyzzy
2870 * look for (def ... ((...(xyzzy ....
2871 * look for (set! xyzzy
2877 Scheme_functions (inf
)
2886 linecharno
= charno
;
2887 charno
+= readline (&lb
, inf
);
2889 if (dbp
[0] == '(' &&
2890 (dbp
[1] == 'D' || dbp
[1] == 'd') &&
2891 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2892 (dbp
[3] == 'F' || dbp
[3] == 'f'))
2894 while (!isspace (*dbp
))
2896 /* Skip over open parens and white space */
2897 while (*dbp
&& (isspace (*dbp
) || *dbp
== '('))
2901 if (dbp
[0] == '(' &&
2902 (dbp
[1] == 'S' || dbp
[1] == 's') &&
2903 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2904 (dbp
[3] == 'T' || dbp
[3] == 't') &&
2905 (dbp
[4] == '!' || dbp
[4] == '!') &&
2908 while (!isspace (*dbp
))
2910 /* Skip over white space */
2911 while (isspace (*dbp
))
2925 /* Go till you get to white space or a syntactic break */
2927 *cp
&& *cp
!= '(' && *cp
!= ')' && !isspace (*cp
);
2930 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
,
2931 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2934 /* Find tags in TeX and LaTeX input files. */
2936 /* TEX_toktab is a table of TeX control sequences that define tags.
2937 Each TEX_tabent records one such control sequence.
2938 CONVERT THIS TO USE THE Stab TYPE!! */
2945 struct TEX_tabent
*TEX_toktab
= NULL
; /* Table with tag tokens */
2947 /* Default set of control sequences to put into TEX_toktab.
2948 The value of environment var TEXTAGS is prepended to this. */
2950 char *TEX_defenv
= "\
2951 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem:typeout";
2954 struct TEX_tabent
*TEX_decode_env ();
2958 char TEX_esc
= '\\';
2959 char TEX_opgrp
= '{';
2960 char TEX_clgrp
= '}';
2963 * TeX/LaTeX scanning loop.
2974 /* Select either \ or ! as escape character. */
2977 /* Initialize token table once from environment. */
2979 TEX_toktab
= TEX_decode_env ("TEXTAGS", TEX_defenv
);
2982 { /* Scan each line in file */
2984 linecharno
= charno
;
2985 charno
+= readline (&lb
, inf
);
2988 while (dbp
= etags_strchr (dbp
, TEX_esc
)) /* Look at each esc in line */
2994 linecharno
+= dbp
- lasthit
;
2996 i
= TEX_Token (lasthit
);
2999 TEX_getit (lasthit
, TEX_toktab
[i
].len
);
3000 break; /* We only save a line once */
3006 #define TEX_LESC '\\'
3007 #define TEX_SESC '!'
3010 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
3011 chars accordingly. */
3018 while ((c
= getc (inf
)) != EOF
)
3020 /* Skip to next line if we hit the TeX comment char. */
3024 else if (c
== TEX_LESC
|| c
== TEX_SESC
)
3043 /* Read environment and prepend it to the default string.
3044 Build token table. */
3046 TEX_decode_env (evarname
, defenv
)
3050 register char *env
, *p
;
3052 struct TEX_tabent
*tab
;
3055 /* Append default string to environment. */
3056 env
= getenv (evarname
);
3060 env
= concat (env
, defenv
, "");
3062 /* Allocate a token table */
3063 for (size
= 1, p
= env
; p
;)
3064 if ((p
= etags_strchr (p
, ':')) && *(++p
))
3066 /* Add 1 to leave room for null terminator. */
3067 tab
= xnew (size
+ 1, struct TEX_tabent
);
3069 /* Unpack environment string into token table. Be careful about */
3070 /* zero-length strings (leading ':', "::" and trailing ':') */
3073 p
= etags_strchr (env
, ':');
3074 if (!p
) /* End of environment string. */
3075 p
= env
+ strlen (env
);
3077 { /* Only non-zero strings. */
3078 tab
[i
].name
= savenstr (env
, p
- env
);
3079 tab
[i
].len
= strlen (tab
[i
].name
);
3086 tab
[i
].name
= NULL
; /* Mark end of table. */
3094 /* Record a tag defined by a TeX command of length LEN and starting at NAME.
3095 The name being defined actually starts at (NAME + LEN + 1).
3096 But we seem to include the TeX command in the tag name. */
3098 TEX_getit (name
, len
)
3102 char *p
= name
+ len
;
3107 /* Let tag name extend to next group close (or end of line) */
3108 while (*p
&& *p
!= TEX_clgrp
)
3110 pfnote (savenstr (name
, p
-name
), TRUE
, FALSE
, lb
.buffer
,
3111 strlen (lb
.buffer
), lineno
, linecharno
);
3114 /* If the text at CP matches one of the tag-defining TeX command names,
3115 return the pointer to the first occurrence of that command in TEX_toktab.
3116 Otherwise return -1.
3117 Keep the capital `T' in `Token' for dumb truncating compilers
3118 (this distinguishes it from `TEX_toktab' */
3125 for (i
= 0; TEX_toktab
[i
].len
> 0; i
++)
3126 if (strneq (TEX_toktab
[i
].name
, cp
, TEX_toktab
[i
].len
))
3131 /* Support for Prolog. */
3133 /* Whole head (not only functor, but also arguments)
3134 is gotten in compound term. */
3147 if (s
[0] == '\0') /* syntax error. */
3149 else if (insquote
&& s
[0] == '\'' && s
[1] == '\'')
3151 else if (s
[0] == '\'')
3153 insquote
= !insquote
;
3156 else if (!insquote
&& s
[0] == '(')
3161 else if (!insquote
&& s
[0] == ')')
3167 else if (npar
< 0) /* syntax error. */
3170 else if (!insquote
&& s
[0] == '.'
3171 && (isspace (s
[1]) || s
[1] == '\0'))
3173 if (npar
!= 0) /* syntax error. */
3181 pfnote (savenstr (save_s
, s
-save_s
), TRUE
, FALSE
,
3182 save_s
, s
-save_s
, lineno
, linecharno
);
3185 /* It is assumed that prolog predicate starts from column 0. */
3187 Prolog_functions (inf
)
3190 void skip_comment (), prolog_getit ();
3192 lineno
= linecharno
= charno
= 0;
3196 linecharno
+= charno
;
3197 charno
= readline (&lb
, inf
) + 1; /* 1 for newline. */
3199 if (isspace (dbp
[0])) /* not predicate header. */
3201 else if (dbp
[0] == '%') /* comment. */
3203 else if (dbp
[0] == '/' && dbp
[1] == '*') /* comment. */
3204 skip_comment (&lb
, inf
, &lineno
, &linecharno
);
3211 skip_comment (plb
, inf
, plineno
, plinecharno
)
3212 struct linebuffer
*plb
;
3214 int *plineno
; /* result */
3215 long *plinecharno
; /* result */
3221 for (cp
= plb
->buffer
; *cp
!= '\0'; cp
++)
3222 if (cp
[0] == '*' && cp
[1] == '/')
3225 *plinecharno
+= readline (plb
, inf
) + 1; /* 1 for newline. */
3230 #ifdef ETAGS_REGEXPS
3231 /* Take a string like "/blah/" and turn it into "blah", making sure
3232 that the first and last characters are the same, and handling
3233 quoted separator characters. Actually, stops on the occurence of
3234 an unquoted separator. Also turns "\t" into a Tab character.
3235 Returns pointer to terminating separator. Works in place. Null
3236 terminates name string. */
3238 scan_separators (name
)
3242 char *copyto
= name
;
3243 logical quoted
= FALSE
;
3245 for (++name
; *name
!= '\0'; ++name
)
3251 else if (*name
== sep
)
3255 /* Something else is quoted, so preserve the quote. */
3261 else if (*name
== '\\')
3263 else if (*name
== sep
)
3269 /* Terminate copied string. */
3274 /* Turn a name, which is an ed-style (but Emacs syntax) regular
3275 expression, into a real regular expression by compiling it. */
3277 add_regex (regexp_pattern
)
3278 char *regexp_pattern
;
3282 struct re_pattern_buffer
*patbuf
;
3284 if (regexp_pattern
== NULL
)
3286 /* Remove existing regexps. */
3292 if (regexp_pattern
[0] == '\0')
3294 error ("missing regexp", 0);
3297 if (regexp_pattern
[strlen(regexp_pattern
)-1] != regexp_pattern
[0])
3299 error ("%s: unterminated regexp", regexp_pattern
);
3302 name
= scan_separators (regexp_pattern
);
3303 if (regexp_pattern
[0] == '\0')
3305 error ("null regexp", 0);
3308 (void) scan_separators (name
);
3310 patbuf
= xnew (1, struct re_pattern_buffer
);
3311 patbuf
->translate
= NULL
;
3312 patbuf
->fastmap
= NULL
;
3313 patbuf
->buffer
= NULL
;
3314 patbuf
->allocated
= 0;
3316 err
= re_compile_pattern (regexp_pattern
, strlen (regexp_pattern
), patbuf
);
3319 error ("%s while compiling pattern", err
);
3324 if (num_patterns
== 1)
3325 patterns
= xnew (1, struct pattern
);
3327 patterns
= ((struct pattern
*)
3329 (num_patterns
* sizeof (struct pattern
))));
3330 patterns
[num_patterns
- 1].pattern
= patbuf
;
3331 patterns
[num_patterns
- 1].name_pattern
= savestr (name
);
3332 patterns
[num_patterns
- 1].error_signaled
= FALSE
;
3336 * Do the subtitutions indicated by the regular expression and
3340 substitute (in
, out
, regs
)
3342 struct re_registers
*regs
;
3344 char *result
= NULL
, *t
;
3347 /* Pass 1: figure out how much size to allocate. */
3348 for (t
= out
; *t
; ++t
)
3355 fprintf (stderr
, "%s: pattern subtitution ends prematurely\n",
3362 size
+= regs
->end
[dig
] - regs
->start
[dig
];
3367 /* Allocate space and do the substitutions. */
3368 result
= xnew (size
+ 1, char);
3377 /* Using "dig2" satisfies my debugger. Bleah. */
3378 int dig2
= *out
- '0';
3379 strncpy (result
+ size
, in
+ regs
->start
[dig2
],
3380 regs
->end
[dig2
] - regs
->start
[dig2
]);
3381 size
+= regs
->end
[dig2
] - regs
->start
[dig2
];
3388 result
[size
++] = '\t';
3394 result
[size
++] = *out
;
3400 result
[size
++] = *out
;
3402 result
[size
] = '\0';
3407 #endif /* ETAGS_REGEXPS */
3408 /* Initialize a linebuffer for use */
3410 initbuffer (linebuffer
)
3411 struct linebuffer
*linebuffer
;
3413 linebuffer
->size
= 200;
3414 linebuffer
->buffer
= xnew (200, char);
3418 * Read a line of text from `stream' into `linebuffer'.
3419 * Return the number of characters read from `stream',
3420 * which is the length of the line including the newline, if any.
3423 readline_internal (linebuffer
, stream
)
3424 struct linebuffer
*linebuffer
;
3425 register FILE *stream
;
3427 char *buffer
= linebuffer
->buffer
;
3428 register char *p
= linebuffer
->buffer
;
3429 register char *pend
;
3432 pend
= p
+ linebuffer
->size
; /* Separate to avoid 386/IX compiler bug. */
3436 register int c
= getc (stream
);
3439 linebuffer
->size
*= 2;
3440 buffer
= (char *) xrealloc (buffer
, linebuffer
->size
);
3441 p
+= buffer
- linebuffer
->buffer
;
3442 pend
= buffer
+ linebuffer
->size
;
3443 linebuffer
->buffer
= buffer
;
3452 if (p
> buffer
&& p
[-1] == '\r')
3467 return p
- buffer
+ chars_deleted
;
3471 * Like readline_internal, above, but try to match the input
3472 * line against any existing regular expressions.
3475 readline (linebuffer
, stream
)
3476 struct linebuffer
*linebuffer
;
3479 /* Read new line. */
3481 long result
= readline_internal (linebuffer
, stream
);
3483 #ifdef ETAGS_REGEXPS
3484 /* Match against all listed patterns. */
3485 for (i
= 0; i
< num_patterns
; ++i
)
3487 int match
= re_match (patterns
[i
].pattern
, linebuffer
->buffer
,
3488 (int)result
, 0, &patterns
[i
].regs
);
3493 if (!patterns
[i
].error_signaled
)
3495 error ("error while matching pattern %d", i
);
3496 patterns
[i
].error_signaled
= TRUE
;
3503 /* Match occurred. Construct a tag. */
3504 if (patterns
[i
].name_pattern
[0] != '\0')
3506 /* Make a named tag. */
3507 char *name
= substitute (linebuffer
->buffer
,
3508 patterns
[i
].name_pattern
,
3511 pfnote (name
, TRUE
, TRUE
, linebuffer
->buffer
,
3512 match
, lineno
, linecharno
);
3516 /* Make an unnamed tag. */
3517 pfnote (NULL
, TRUE
, FALSE
, linebuffer
->buffer
,
3518 match
, lineno
, linecharno
);
3523 #endif /* ETAGS_REGEXPS */
3529 * Read a file, but do no processing. This is used to do regexp
3530 * matching on files that have no language defined.
3533 just_read_file (inf
)
3539 linecharno
= charno
;
3540 charno
+= readline (&lb
, inf
) + 1;
3546 * Return a pointer to a space of size strlen(cp)+1 allocated
3547 * with xnew where the string CP has been copied.
3553 return savenstr (cp
, strlen (cp
));
3557 * Return a pointer to a space of size LEN+1 allocated with xnew where
3558 * the string CP has been copied for at most the first LEN characters.
3567 dp
= xnew (len
+ 1, char);
3568 strncpy (dp
, cp
, len
);
3574 * Return the ptr in sp at which the character c last
3575 * appears; NULL if not found
3577 * Identical to System V strrchr, included for portability.
3580 etags_strrchr (sp
, c
)
3581 register char *sp
, c
;
3596 * Return the ptr in sp at which the character c first
3597 * appears; NULL if not found
3599 * Identical to System V strchr, included for portability.
3602 etags_strchr (sp
, c
)
3603 register char *sp
, c
;
3613 /* Print error message and exit. */
3630 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
3635 fprintf (stderr
, "%s: ", progname
);
3636 fprintf (stderr
, s1
, s2
);
3637 fprintf (stderr
, "\n");
3640 /* Return a newly-allocated string whose contents
3641 concatenate those of s1, s2, s3. */
3646 int len1
= strlen (s1
), len2
= strlen (s2
), len3
= strlen (s3
);
3647 char *result
= xnew (len1
+ len2
+ len3
+ 1, char);
3649 strcpy (result
, s1
);
3650 strcpy (result
+ len1
, s2
);
3651 strcpy (result
+ len1
+ len2
, s3
);
3652 result
[len1
+ len2
+ len3
] = '\0';
3657 /* Does the same work as the system V getcwd, but does not need to
3658 guess buffer size in advance. */
3663 char *p
, path
[MAXPATHLEN
+ 1]; /* Fixed size is safe on MSDOS. */
3671 *p
++ = tolower (*p
);
3673 return strdup (path
);
3675 #elif HAVE_GETCWD /* not DOS_NT */
3678 char *path
= xnew (bufsize
, char);
3680 while (getcwd (path
, bufsize
) == NULL
)
3682 if (errno
!= ERANGE
)
3685 path
= xnew (bufsize
, char);
3690 #else /* not DOS_NT and not HAVE_GETCWD */
3692 struct linebuffer path
;
3696 pipe
= (FILE *) popen ("pwd 2>/dev/null", "r");
3697 if (pipe
== NULL
|| readline_internal (&path
, pipe
) == 0)
3703 #endif /* not DOS_NT and not HAVE_GETCWD */
3705 /* Return a newly allocated string containing the filename
3706 of FILE relative to the absolute directory DIR (which
3707 should end with a slash). */
3709 relative_filename (file
, dir
)
3712 char *fp
, *dp
, *res
;
3714 /* Find the common root of file and dir. */
3715 fp
= absolute_filename (file
, cwd
);
3717 while (*fp
++ == *dp
++)
3726 /* Build a sequence of "../" strings for the resulting relative filename. */
3727 for (dp
= etags_strchr (dp
+ 1, '/'), res
= "";
3729 dp
= etags_strchr (dp
+ 1, '/'))
3731 res
= concat (res
, "../", "");
3734 /* Add the filename relative to the common root of file and dir. */
3735 res
= concat (res
, fp
+ 1, "");
3737 return res
; /* temporary stub */
3740 /* Return a newly allocated string containing the
3741 absolute filename of FILE given CWD (which should
3742 end with a slash). */
3744 absolute_filename (file
, cwd
)
3747 char *slashp
, *cp
, *res
;
3750 res
= concat (file
, "", "");
3752 res
= concat (cwd
, file
, "");
3754 /* Delete the "/dirname/.." and "/." substrings. */
3755 slashp
= etags_strchr (res
, '/');
3756 while (slashp
!= NULL
&& slashp
[0] != '\0')
3758 if (slashp
[1] == '.')
3760 if (slashp
[2] == '.'
3761 && (slashp
[3] == '/' || slashp
[3] == '\0'))
3766 while (cp
>= res
&& *cp
!= '/');
3769 strcpy (cp
, slashp
+ 3);
3771 else /* else (cp == res) */
3773 if (slashp
[3] != '\0')
3774 strcpy (cp
, slashp
+ 4);
3781 else if (slashp
[2] == '/' || slashp
[2] == '\0')
3783 strcpy (slashp
, slashp
+ 2);
3788 slashp
= etags_strchr (slashp
+ 1, '/');
3794 /* Return a newly allocated string containing the absolute
3795 filename of dir where FILE resides given CWD (which should
3796 end with a slash). */
3798 absolute_dirname (file
, cwd
)
3804 slashp
= etags_strrchr (file
, '/');
3809 res
= absolute_filename (file
, cwd
);
3815 /* Like malloc but get fatal error if memory is exhausted. */
3820 char *result
= (char *) malloc (size
);
3822 fatal ("virtual memory exhausted", 0);
3827 xrealloc (ptr
, size
)
3831 char *result
= (char *) realloc (ptr
, size
);
3833 fatal ("virtual memory exhausted");