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.16";
38 #include <sys/param.h>
45 #define MAXPATHLEN _MAX_PATH
50 /* On some systems, Emacs defines static as nothing for the sake
51 of unexec. We don't want that here since we don't use unexec. */
61 #include <sys/types.h>
64 #if !defined (S_ISREG) && defined (S_IFREG)
65 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
72 #endif /* ETAGS_REGEXPS */
77 /* Define CTAGS to make the program "ctags" compatible with the usual one.
78 Let it undefined to make the program "etags", which makes emacs-style
79 tag tables and tags typedefs, #defines and struct/union/enum by default. */
87 /* Exit codes for success and failure. */
97 #define C_PLPL 0x00001 /* C++ */
98 #define C_STAR 0x00003 /* C* */
99 #define YACC 0x10000 /* yacc file */
101 #define streq(s,t) (strcmp (s, t) == 0)
102 #define strneq(s,t,n) (strncmp (s, t, n) == 0)
104 #define iswhite(arg) (_wht[arg]) /* T if char is white */
105 #define begtoken(arg) (_btk[arg]) /* T if char can start token */
106 #define intoken(arg) (_itk[arg]) /* T if char can be in token */
107 #define endtoken(arg) (_etk[arg]) /* T if char ends tokens */
110 * xnew -- allocate storage
112 * SYNOPSIS: Type *xnew (int n, Type);
114 #define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
119 { /* sorting structure */
120 char *name
; /* function or type name */
121 char *file
; /* file name */
122 logical is_func
; /* use pattern or line no */
123 logical named
; /* list name separately */
124 logical been_warned
; /* set if noticed dup */
125 int lno
; /* line number tag is on */
126 long cno
; /* character number line starts on */
127 char *pat
; /* search pattern */
128 struct nd_st
*left
, *right
; /* left and right sons */
131 extern char *getenv ();
134 char *savenstr (), *savestr ();
135 char *etags_strchr (), *etags_strrchr ();
136 char *etags_getcwd ();
137 char *relative_filename (), *absolute_filename (), *absolute_dirname ();
138 char *xmalloc (), *xrealloc ();
140 typedef void Lang_function ();
141 #if FALSE /* many compilers barf on this */
142 Lang_function Asm_labels
;
143 Lang_function default_C_entries
;
144 Lang_function C_entries
;
145 Lang_function Cplusplus_entries
;
146 Lang_function Cstar_entries
;
147 Lang_function Fortran_functions
;
148 Lang_function Yacc_entries
;
149 Lang_function Lisp_functions
;
150 Lang_function Pascal_functions
;
151 Lang_function Prolog_functions
;
152 Lang_function Scheme_functions
;
153 Lang_function TeX_functions
;
154 Lang_function just_read_file
;
155 #else /* so let's write it this way */
157 void default_C_entries ();
159 void Cplusplus_entries ();
160 void Cstar_entries ();
161 void Fortran_functions ();
162 void Yacc_entries ();
163 void Lisp_functions ();
164 void Pascal_functions ();
165 void Prolog_functions ();
166 void Scheme_functions ();
167 void TeX_functions ();
168 void just_read_file ();
171 logical
get_language ();
172 int total_size_of_entries ();
174 long readline_internal ();
180 void fatal (), pfatal ();
181 void find_entries ();
187 void process_file ();
192 char searchar
= '/'; /* use /.../ searches */
194 int lineno
; /* line number of current line */
195 long charno
; /* current character number */
197 long linecharno
; /* charno of start of line; not used by C,
198 but by every other language. */
200 char *curfile
; /* current input file name */
201 char *tagfile
; /* output file */
202 char *progname
; /* name this program was invoked with */
203 char *cwd
; /* current working directory */
204 char *tagfiledir
; /* directory of tagfile */
206 FILE *tagf
; /* ioptr for tags file */
207 NODE
*head
; /* the head of the binary tree of tags */
210 * A `struct linebuffer' is a structure which holds a line of text.
211 * `readline' reads a line from a stream into a linebuffer and works
212 * regardless of the length of the line.
220 struct linebuffer lb
; /* the current line */
224 struct linebuffer lb
; /* used by C_entries instead of lb */
227 /* boolean "functions" (see init) */
228 logical _wht
[0177], _etk
[0177], _itk
[0177], _btk
[0177];
230 *white
= " \f\t\n\013", /* white chars */
231 *endtk
= " \t\n\013\"'#()[]{}=-+%*/&|^~!<>;,.:?", /* token ending chars */
232 /* token starting chars */
233 *begtk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~",
234 /* valid in-token chars */
235 *intk
= "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
237 logical append_to_tagfile
; /* -a: append to tags */
238 /* The following three default to TRUE for etags, but to FALSE for ctags. */
239 logical typedefs
; /* -t: create tags for typedefs */
240 logical typedefs_and_cplusplus
; /* -T: create tags for typedefs, level */
241 /* 0 struct/enum/union decls, and C++ */
242 /* member functions. */
243 logical constantypedefs
; /* -d: create tags for C #define and enum */
244 /* constants. Enum consts not implemented. */
245 /* -D: opposite of -d. Default under ctags. */
246 logical update
; /* -u: update tags */
247 logical vgrind_style
; /* -v: create vgrind style index output */
248 logical no_warnings
; /* -w: suppress warnings */
249 logical cxref_style
; /* -x: create cxref style output */
250 logical cplusplus
; /* .[hc] means C++, not C */
251 logical noindentypedefs
; /* -I: ignore indentation in C */
252 #define permit_duplicates TRUE /* allow duplicate tags */
254 struct option longopts
[] =
256 { "append", no_argument
, NULL
, 'a' },
257 { "backward-search", no_argument
, NULL
, 'B' },
258 { "c++", no_argument
, NULL
, 'C' },
259 { "cxref", no_argument
, NULL
, 'x' },
260 { "defines", no_argument
, NULL
, 'd' },
261 { "help", no_argument
, NULL
, 'h' },
262 { "help", no_argument
, NULL
, 'H' },
263 { "ignore-indentation", no_argument
, NULL
, 'I' },
264 { "include", required_argument
, NULL
, 'i' },
265 { "language", required_argument
, NULL
, 'l' },
266 { "no-defines", no_argument
, NULL
, 'D' },
267 { "no-regex", no_argument
, NULL
, 'R' },
268 { "no-warn", no_argument
, NULL
, 'w' },
269 { "output", required_argument
, NULL
, 'o' },
270 { "regex", required_argument
, NULL
, 'r' },
271 { "typedefs", no_argument
, NULL
, 't' },
272 { "typedefs-and-c++", no_argument
, NULL
, 'T' },
273 { "update", no_argument
, NULL
, 'u' },
274 { "version", no_argument
, NULL
, 'V' },
275 { "vgrind", no_argument
, NULL
, 'v' },
280 /* Structure defining a regular expression. Elements are
281 the compiled pattern, and the name string. */
284 struct re_pattern_buffer
*pattern
;
285 struct re_registers regs
;
287 logical error_signaled
;
290 /* Number of regexps found. */
291 int num_patterns
= 0;
293 /* Array of all regexps. */
294 struct pattern
*patterns
= NULL
;
295 #endif /* ETAGS_REGEXPS */
297 /* Language stuff. */
301 Lang_function
*function
;
304 /* Table of language names and corresponding functions. */
305 /* It is ok for a given function to be listed under more than one
306 name. I just didn't. */
307 /* "auto" language reverts to default behavior. */
308 struct lang_entry lang_names
[] =
310 { "asm", Asm_labels
},
311 { "c", default_C_entries
},
312 { "c++", Cplusplus_entries
},
313 { "c*", Cstar_entries
},
314 { "fortran", Fortran_functions
},
315 { "lisp", Lisp_functions
},
316 { "none", just_read_file
},
317 { "pascal", Pascal_functions
},
318 { "scheme" , Scheme_functions
},
319 { "tex", TeX_functions
},
324 /* Table of file extensions and corresponding language functions. */
325 struct lang_entry lang_extensions
[] =
327 /* Assume that ".s" or ".a" is assembly code. -wolfgang.
329 { "a", Asm_labels
}, /* Unix assembler */
330 { "asm", Asm_labels
}, /* Microcontroller assembly */
331 { "def", Asm_labels
}, /* BSO/Tasking definition includes */
332 { "inc", Asm_labels
}, /* Microcontroller include files */
333 { "ins", Asm_labels
}, /* Microcontroller include files */
335 { "sa", Asm_labels
}, /* Unix assembler */
336 { "src", Asm_labels
}, /* BSO/Tasking C compiler output */
338 /* .aux, .bbl, .clo, .cls, .dtx or .tex implies LaTeX source code. */
339 { "aux", TeX_functions
},
340 { "bbl", TeX_functions
},
341 { "clo", TeX_functions
},
342 { "cls", TeX_functions
},
343 { "dtx", TeX_functions
},
344 { "sty", TeX_functions
},
345 { "tex", TeX_functions
},
347 /* .l or .el or .lisp (or .cl or .clisp or ...) implies lisp source code */
348 { "cl", Lisp_functions
},
349 { "clisp", Lisp_functions
},
350 { "el", Lisp_functions
},
351 { "l", Lisp_functions
},
352 { "lisp", Lisp_functions
},
353 { "lsp", Lisp_functions
},
355 /* .scm or .sm or .scheme implies scheme source code */
356 { "SCM", Scheme_functions
},
357 { "SM", Scheme_functions
},
358 { "oak", Scheme_functions
},
359 { "sch", Scheme_functions
},
360 { "scheme", Scheme_functions
},
361 { "scm", Scheme_functions
},
362 { "sm", Scheme_functions
},
363 { "t", Scheme_functions
},
364 /* FIXME Can't do the `SCM' or `scm' prefix with a version number */
366 /* Note that ".c" and ".h" can be considered C++, if the --c++
367 flag was given. That is why default_C_entries is called here. */
368 { "c", default_C_entries
},
369 { "h", default_C_entries
},
371 /* .C or .H or .cpp or .cxx or .hxx or .hh or .cc or .cpp: a C++ file */
372 { "C", Cplusplus_entries
},
373 { "H", Cplusplus_entries
},
374 { "cc", Cplusplus_entries
},
375 { "cpp", Cplusplus_entries
},
376 { "cxx", Cplusplus_entries
},
377 { "hh", Cplusplus_entries
},
378 { "hxx", Cplusplus_entries
},
380 /* .y: a yacc file */
381 { "y", Yacc_entries
},
383 /* .cs or .hs: a C* file */
384 { "cs", Cstar_entries
},
385 { "hs", Cstar_entries
},
387 /* .f and .for are FORTRAN. */
388 { "F", Fortran_functions
},
389 { "f", Fortran_functions
},
390 { "for", Fortran_functions
},
392 /* .pl implies prolog source code */
393 { "pl", Prolog_functions
},
395 /* .p or .pas: a Pascal file */
396 { "p", Pascal_functions
},
397 { "pas", Pascal_functions
},
402 /* Non-NULL if language fixed. */
403 Lang_function
*lang_func
= NULL
;
407 print_language_names ()
409 struct lang_entry
*name
, *ext
;
411 puts ("\nThese are the currently supported languages, along with the\n\
412 default extensions for files:");
413 for (name
= lang_names
; name
->extension
; ++name
)
415 printf ("\t%s\t", name
->extension
);
416 for (ext
= lang_extensions
; ext
->extension
; ++ext
)
417 if (name
->function
== ext
->function
)
418 printf (" .%s", ext
->extension
);
421 puts ("Where `auto' means use default language for files based on filename\n\
422 extension, and `none' means only do regexp processing on files.\n\
423 If no language is specified and no extension is found for some file,\n\
424 Fortran is tried first; if no tags are found, C is tried next.");
431 printf ("%s for Emacs version %s.\n", (CTAGS
) ? "CTAGS" : "ETAGS", VERSION
);
433 printf ("%s for Emacs version 19.\n", (CTAGS
) ? "CTAGS" : "ETAGS");
442 printf ("These are the options accepted by %s. You may use unambiguous\n\
443 abbreviations for the long option names. A - as file name means read\n\
444 names from stdin.\n\n", progname
);
446 puts ("-a, --append\n\
447 Append tag entries to existing tags file.");
450 puts ("-B, --backward-search\n\
451 Write the search commands for the tag entries using '?', the\n\
452 backward-search command instead of '/', the forward-search command.");
455 Treat files whose extension defaults to C language as C++ files.");
458 puts ("-d, --defines\n\
459 Create tag entries for constant C #defines, too.");
461 puts ("-D, --no-defines\n\
462 Don't create tag entries for constant C #defines. This makes\n\
463 the tags file smaller.");
467 puts ("-i FILE, --include=FILE\n\
468 Include a note in tag file indicating that, when searching for\n\
469 a tag, one should also consult the tags file FILE after\n\
470 checking the current file.");
471 puts ("-l LANG, --language=LANG\n\
472 Force the following files to be considered as written in the\n\
473 named language up to the next --language=LANG option.");
477 puts ("-r /REGEXP/, --regex=/REGEXP/\n\
478 Make a tag for each line matching pattern REGEXP in the\n\
479 following files. REGEXP is anchored (as if preceded by ^).\n\
480 The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
481 named tags can be created with:\n\
482 --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
483 puts ("-R, --no-regex\n\
484 Don't create tags from regexps for the following files.");
485 #endif /* ETAGS_REGEXPS */
486 puts ("-o FILE, --output=FILE\n\
487 Write the tags to FILE.");
488 puts ("-I, --ignore-indentation\n\
489 Don't rely on indentation quite as much as normal. Currently,\n\
490 this means not to assume that a closing brace in the first\n\
491 column is the final brace of a function or structure\n\
492 definition in C and C++.");
496 puts ("-t, --typedefs\n\
497 Generate tag entries for C typedefs.");
498 puts ("-T, --typedefs-and-c++\n\
499 Generate tag entries for C typedefs, C struct/enum/union tags,\n\
500 and C++ member functions.");
501 puts ("-u, --update\n\
502 Update the tag entries for the given files, leaving tag\n\
503 entries for other files in place. Currently, this is\n\
504 implemented by deleting the existing entries for the given\n\
505 files and then rewriting the new entries at the end of the\n\
506 tags file. It is often faster to simply rebuild the entire\n\
507 tag file than to use this.");
508 puts ("-v, --vgrind\n\
509 Generates an index of items intended for human consumption,\n\
510 similar to the output of vgrind. The index is sorted, and\n\
511 gives the page number of each item.");
512 puts ("-w, --no-warn\n\
513 Suppress warning messages about entries defined in multiple\n\
515 puts ("-x, --cxref\n\
516 Like --vgrind, but in the style of cxref, rather than vgrind.\n\
517 The output uses line numbers instead of page numbers, but\n\
518 beyond that the differences are cosmetic; try both to see\n\
522 puts ("-V, --version\n\
523 Print the version of the program.\n\
525 Print this help message.");
527 print_language_names ();
540 /* This structure helps us allow mixing of --lang and filenames. */
543 enum argument_type arg_type
;
545 Lang_function
*function
;
548 #ifdef VMS /* VMS specific functions */
552 /* This is a BUG! ANY arbitrary limit is a BUG!
553 Won't someone please fix this? */
554 #define MAX_FILE_SPEC_LEN 255
557 char body
[MAX_FILE_SPEC_LEN
+ 1];
561 v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
562 returning in each successive call the next filename matching the input
563 spec. The function expects that each in_spec passed
564 to it will be processed to completion; in particular, up to and
565 including the call following that in which the last matching name
566 is returned, the function ignores the value of in_spec, and will
567 only start processing a new spec with the following call.
568 If an error occurs, on return out_spec contains the value
569 of in_spec when the error occurred.
571 With each successive filename returned in out_spec, the
572 function's return value is one. When there are no more matching
573 names the function returns zero. If on the first call no file
574 matches in_spec, or there is any other error, -1 is returned.
579 #define OUTSIZE MAX_FILE_SPEC_LEN
585 static long context
= 0;
586 static struct dsc$descriptor_s o
;
587 static struct dsc$descriptor_s i
;
588 static logical pass1
= TRUE
;
595 o
.dsc$a_pointer
= (char *) out
;
596 o
.dsc$w_length
= (short)OUTSIZE
;
597 i
.dsc$a_pointer
= in
;
598 i
.dsc$w_length
= (short)strlen(in
);
599 i
.dsc$b_dtype
= DSC$K_DTYPE_T
;
600 i
.dsc$b_class
= DSC$K_CLASS_S
;
601 o
.dsc$b_dtype
= DSC$K_DTYPE_VT
;
602 o
.dsc$b_class
= DSC$K_CLASS_VS
;
604 if ((status
= lib$
find_file(&i
, &o
, &context
, 0, 0)) == RMS$_NORMAL
)
606 out
->body
[out
->curlen
] = EOS
;
609 else if (status
== RMS$_NMF
)
613 strcpy(out
->body
, in
);
616 lib$
find_file_end(&context
);
622 v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
623 name of each file specified by the provided arg expanding wildcards.
626 gfnames (arg
, p_error
)
630 static vspec filename
= {MAX_FILE_SPEC_LEN
, "\0"};
632 switch (fn_exp (&filename
, arg
))
636 return filename
.body
;
642 return filename
.body
;
646 #ifndef OLD /* Newer versions of VMS do provide `system'. */
650 fprintf (stderr
, "system() function not implemented under VMS\n");
654 #define VERSION_DELIM ';'
655 char *massage_name (s
)
661 if (*s
== VERSION_DELIM
)
679 unsigned int nincluded_files
= 0;
680 char **included_files
= xnew (argc
, char *);
683 int current_arg
= 0, file_count
= 0;
684 struct linebuffer filename_lb
;
690 _fmode
= O_BINARY
; /* all of files are treated as binary files */
695 /* Allocate enough no matter what happens. Overkill, but each one
697 argbuffer
= xnew (argc
, ARGUMENT
);
700 /* Set syntax for regular expression routines. */
701 re_set_syntax (RE_SYNTAX_EMACS
);
702 #endif /* ETAGS_REGEXPS */
705 * If etags, always find typedefs and structure tags. Why not?
706 * Also default is to find macro constants.
709 typedefs
= typedefs_and_cplusplus
= constantypedefs
= TRUE
;
713 int opt
= getopt_long (argc
, argv
,
714 "-aCdDf:Il:o:r:RStTi:BuvxwVhH", longopts
, 0);
722 /* If getopt returns 0, then it has already processed a
723 long-named option. We should do nothing. */
727 /* This means that a filename has been seen. Record it. */
728 argbuffer
[current_arg
].arg_type
= at_filename
;
729 argbuffer
[current_arg
].what
= optarg
;
734 /* Common options. */
736 append_to_tagfile
= TRUE
;
742 constantypedefs
= TRUE
;
745 constantypedefs
= FALSE
;
747 case 'f': /* for compatibility with old makefiles */
751 fprintf (stderr
, "%s: -%c option may only be given once.\n",
758 case 'S': /* for backward compatibility */
759 noindentypedefs
= TRUE
;
762 if (!get_language (optarg
, &argbuffer
[current_arg
].function
))
764 fprintf (stderr
, "%s: language \"%s\" not recognized.\n",
768 argbuffer
[current_arg
].arg_type
= at_language
;
773 argbuffer
[current_arg
].arg_type
= at_regexp
;
774 argbuffer
[current_arg
].what
= optarg
;
778 argbuffer
[current_arg
].arg_type
= at_regexp
;
779 argbuffer
[current_arg
].what
= NULL
;
782 #endif /* ETAGS_REGEXPS */
794 typedefs
= typedefs_and_cplusplus
= TRUE
;
799 included_files
[nincluded_files
++] = optarg
;
824 for (; optind
< argc
; ++optind
)
826 argbuffer
[current_arg
].arg_type
= at_filename
;
827 argbuffer
[current_arg
].what
= argv
[optind
];
832 if (nincluded_files
== 0 && file_count
== 0)
834 fprintf (stderr
, "%s: No input files specified.\n", progname
);
837 fprintf (stderr
, "\tTry `%s --help' for a complete list of options.\n",
844 tagfile
= CTAGS
? "tags" : "TAGS";
846 cwd
= etags_getcwd (); /* the current working directory */
848 if (streq (tagfile
, "-"))
854 tagfiledir
= absolute_dirname (tagfile
, cwd
);
857 init (); /* set up boolean "functions" */
860 initbuffer (&lbs
[0].lb
);
861 initbuffer (&lbs
[1].lb
);
862 initbuffer (&filename_lb
);
866 if (streq (tagfile
, "-"))
869 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
875 * Loop through files finding functions.
877 for (i
= 0; i
< current_arg
; ++i
)
879 switch (argbuffer
[i
].arg_type
)
882 lang_func
= argbuffer
[i
].function
;
886 add_regex (argbuffer
[i
].what
);
891 while ((this_file
= gfnames (argbuffer
[i
].what
, &got_err
)) != NULL
)
895 error ("Can't find file %s\n", this_file
);
900 this_file
= massage_name (this_file
);
903 this_file
= argbuffer
[i
].what
;
905 /* Input file named "-" means read file names from stdin
907 if (streq (this_file
, "-"))
909 while (!feof (stdin
))
911 (void) readline_internal (&filename_lb
, stdin
);
912 if (strlen (filename_lb
.buffer
) > 0)
913 process_file (filename_lb
.buffer
);
917 process_file (this_file
);
927 while (nincluded_files
-- > 0)
928 fprintf (tagf
, "\f\n%s,include\n", *included_files
++);
934 /* If CTAGS, we are here. process_file did not write the tags yet,
935 because we want them ordered. Let's do it now. */
938 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
948 for (i
= 0; i
< current_arg
; ++i
)
950 if (argbuffer
[i
].arg_type
!= at_filename
)
953 "mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
954 tagfile
, argbuffer
[i
].what
, tagfile
);
955 if (system (cmd
) != GOOD
)
956 fatal ("failed to execute shell command");
958 append_to_tagfile
= TRUE
;
961 tagf
= fopen (tagfile
, append_to_tagfile
? "a" : "w");
970 sprintf (cmd
, "sort %s -o %s", tagfile
, tagfile
);
978 * Set the language, given the name.
981 get_language (language
, func
)
983 Lang_function
**func
;
985 struct lang_entry
*lang
;
987 for (lang
= lang_names
; lang
->extension
; ++lang
)
989 if (streq (language
, lang
->extension
))
991 *func
= lang
->function
;
1001 * This routine is called on each file argument.
1007 struct stat stat_buf
;
1010 if (stat (file
, &stat_buf
) == 0 && !S_ISREG (stat_buf
.st_mode
))
1012 fprintf (stderr
, "Skipping %s: it is not a regular file.\n", file
);
1015 if (streq (file
, tagfile
) && !streq (tagfile
, "-"))
1017 fprintf (stderr
, "Skipping inclusion of %s in self.\n", file
);
1020 inf
= fopen (file
, "r");
1027 find_entries (file
, inf
);
1035 /* file is an absolute filename. Canonicalise it. */
1036 filename
= absolute_filename (file
, cwd
);
1040 /* file is a filename relative to cwd. Make it relative
1041 to the directory of the tags file. */
1042 filename
= relative_filename (file
, tagfiledir
);
1044 fprintf (tagf
, "\f\n%s,%d\n", filename
, total_size_of_entries (head
));
1052 * This routine sets up the boolean pseudo-functions which work
1053 * by setting boolean flags dependent upon the corresponding character
1054 * Every char which is NOT in that string is not a white char. Therefore,
1055 * all of the array "_wht" is set to FALSE, and then the elements
1056 * subscripted by the chars in "white" are set to TRUE. Thus "_wht"
1057 * of a char is TRUE if it is the string "white", else FALSE.
1065 for (i
= 0; i
< 0177; i
++)
1066 _wht
[i
] = _etk
[i
] = _itk
[i
] = _btk
[i
] = FALSE
;
1067 for (sp
= white
; *sp
; sp
++)
1069 for (sp
= endtk
; *sp
; sp
++)
1071 for (sp
= intk
; *sp
; sp
++)
1073 for (sp
= begtk
; *sp
; sp
++)
1075 _wht
[0] = _wht
['\n'];
1076 _etk
[0] = _etk
['\n'];
1077 _btk
[0] = _btk
['\n'];
1078 _itk
[0] = _itk
['\n'];
1082 * This routine opens the specified file and calls the function
1083 * which finds the function and type definitions.
1086 find_entries (file
, inf
)
1091 struct lang_entry
*lang
;
1092 NODE
*old_last_node
;
1093 extern NODE
*last_node
;
1095 curfile
= savestr (file
);
1096 cp
= etags_strrchr (file
, '.');
1098 /* If user specified a language, use it. */
1099 if (lang_func
!= NULL
)
1109 for (lang
= lang_extensions
; lang
->extension
; ++lang
)
1111 if (streq (cp
, lang
->extension
))
1113 lang
->function (inf
);
1121 old_last_node
= last_node
;
1122 Fortran_functions (inf
);
1124 /* No Fortran entries found. Try C. */
1125 if (old_last_node
== last_node
)
1126 default_C_entries (inf
);
1131 /* Should take a TOKEN* instead!! */
1133 pfnote (name
, is_func
, named
, linestart
, linelen
, lno
, cno
)
1134 char *name
; /* tag name */
1135 logical is_func
; /* tag is a function */
1136 logical named
; /* tag different from text of definition */
1137 char *linestart
; /* start of the line where tag is */
1138 int linelen
; /* length of the line where tag is */
1139 int lno
; /* line number */
1140 long cno
; /* character number */
1142 register NODE
*np
= xnew (1, NODE
);
1145 /* If ctags mode, change name "main" to M<thisfilename>. */
1146 if (CTAGS
&& !cxref_style
&& streq (name
, "main"))
1148 fp
= etags_strrchr (curfile
, '/');
1149 np
->name
= concat ("M", fp
== 0 ? curfile
: fp
+ 1, "");
1150 fp
= etags_strrchr (np
->name
, '.');
1151 if (fp
&& fp
[1] != '\0' && fp
[2] == '\0')
1161 np
->is_func
= is_func
;
1163 /* Our char numbers are 0-base, because of C language tradition?
1164 ctags compatibility? old versions compatibility? I don't know.
1165 Anyway, since emacs's are 1-base we espect etags.el to take care
1166 of the difference. If we wanted to have 1-based numbers, we would
1167 uncomment the +1 below. */
1168 np
->cno
= cno
/* + 1 */ ;
1169 np
->left
= np
->right
= NULL
;
1170 np
->pat
= savenstr (linestart
, ((CTAGS
&& !cxref_style
) ? 50 : linelen
));
1172 add_node (np
, &head
);
1177 * recurse on left children, iterate on right children.
1181 register NODE
*node
;
1185 register NODE
*node_right
= node
->right
;
1186 free_tree (node
->left
);
1190 free ((char *) node
);
1197 * Adds a node to the tree of nodes. In etags mode, we don't keep
1198 * it sorted; we just keep a linear list. In ctags mode, maintain
1199 * an ordered tree, with no attempt at balancing.
1201 * add_node is the only function allowed to add nodes, so it can
1204 NODE
*last_node
= NULL
;
1206 add_node (node
, cur_node_p
)
1207 NODE
*node
, **cur_node_p
;
1210 register NODE
*cur_node
= *cur_node_p
;
1212 if (cur_node
== NULL
)
1222 if (last_node
== NULL
)
1223 fatal ("internal error in add_node", 0);
1224 last_node
->right
= node
;
1230 dif
= strcmp (node
->name
, cur_node
->name
);
1233 * If this tag name matches an existing one, then
1234 * do not add the node, but maybe print a warning.
1238 if (node
->file
== cur_node
->file
)
1242 fprintf (stderr
, "Duplicate entry in file %s, line %d: %s\n",
1243 node
->file
, lineno
, node
->name
);
1244 fprintf (stderr
, "Second entry ignored\n");
1248 if (!cur_node
->been_warned
&& !no_warnings
)
1251 "Duplicate entry in files %s and %s: %s (Warning only)\n",
1252 node
->file
, cur_node
->file
, node
->name
);
1254 cur_node
->been_warned
= TRUE
;
1258 /* Maybe refuse to add duplicate nodes. */
1259 if (!permit_duplicates
)
1261 if (streq (node
->name
, cur_node
->name
)
1262 && streq (node
->file
, cur_node
->file
))
1266 /* Actually add the node */
1267 add_node (node
, dif
< 0 ? &cur_node
->left
: &cur_node
->right
);
1273 register NODE
*node
;
1280 /* Output subentries that precede this one */
1281 put_entries (node
->left
);
1283 /* Output this entry */
1289 fprintf (tagf
, "%s\177%s\001%d,%d\n",
1290 node
->pat
, node
->name
,
1291 node
->lno
, node
->cno
);
1295 fprintf (tagf
, "%s\177%d,%d\n",
1297 node
->lno
, node
->cno
);
1300 else if (!cxref_style
)
1302 fprintf (tagf
, "%s\t%s\t",
1303 node
->name
, node
->file
);
1307 putc (searchar
, tagf
);
1310 for (sp
= node
->pat
; *sp
; sp
++)
1312 if (*sp
== '\\' || *sp
== searchar
)
1316 putc (searchar
, tagf
);
1319 { /* a typedef; text pattern inadequate */
1320 fprintf (tagf
, "%d", node
->lno
);
1324 else if (vgrind_style
)
1325 fprintf (stdout
, "%s %s %d\n",
1326 node
->name
, node
->file
, (node
->lno
+ 63) / 64);
1328 fprintf (stdout
, "%-16s %3d %-16s %s\n",
1329 node
->name
, node
->lno
, node
->file
, node
->pat
);
1331 /* Output subentries that follow this one */
1332 put_entries (node
->right
);
1335 /* Length of a number's decimal representation. */
1343 for (; num
; num
/= 10)
1349 * Return total number of characters that put_entries will output for
1350 * the nodes in the subtree of the specified node. Works only if
1351 * we are not ctags, but called only in that case. This count
1352 * is irrelevant with the new tags.el, but is still supplied for
1353 * backward compatibility.
1356 total_size_of_entries (node
)
1357 register NODE
*node
;
1365 for (; node
; node
= node
->right
)
1367 /* Count left subentries. */
1368 total
+= total_size_of_entries (node
->left
);
1370 /* Count this entry */
1371 total
+= strlen (node
->pat
) + 1;
1372 total
+= number_len ((long) node
->lno
) + 1 + number_len (node
->cno
) + 1;
1374 total
+= 1 + strlen (node
->name
); /* \001name */
1381 * The C symbol tables.
1385 st_none
, st_C_struct
, st_C_enum
, st_C_define
, st_C_typedef
, st_C_typespec
1388 /* Feed stuff between (but not including) %[ and %] lines to:
1389 gperf -c -k1,3 -o -p -r -t
1391 struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
1393 class, C_PLPL, st_C_struct
1394 domain, C_STAR, st_C_struct
1395 union, 0, st_C_struct
1396 struct, 0, st_C_struct
1398 typedef, 0, st_C_typedef
1399 define, 0, st_C_define
1400 long, 0, st_C_typespec
1401 short, 0, st_C_typespec
1402 int, 0, st_C_typespec
1403 char, 0, st_C_typespec
1404 float, 0, st_C_typespec
1405 double, 0, st_C_typespec
1406 signed, 0, st_C_typespec
1407 unsigned, 0, st_C_typespec
1408 auto, 0, st_C_typespec
1409 void, 0, st_C_typespec
1410 extern, 0, st_C_typespec
1411 static, 0, st_C_typespec
1412 const, 0, st_C_typespec
1413 volatile, 0, st_C_typespec
1415 and replace lines between %< and %> with its output. */
1417 /* C code produced by gperf version 1.8.1 (K&R C version) */
1418 /* Command-line: gperf -c -k1,3 -o -p -r -t */
1421 struct C_stab_entry
{ char *name
; int c_ext
; enum sym_type type
; };
1423 #define MIN_WORD_LENGTH 3
1424 #define MAX_WORD_LENGTH 8
1425 #define MIN_HASH_VALUE 10
1426 #define MAX_HASH_VALUE 62
1429 53 is the maximum key range
1437 static unsigned char hash_table
[] =
1439 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1440 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1441 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1442 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1443 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1444 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1445 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1446 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1447 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
1448 62, 62, 62, 62, 62, 62, 62, 2, 62, 7,
1449 6, 9, 15, 30, 62, 24, 62, 62, 1, 24,
1450 7, 27, 13, 62, 19, 26, 18, 27, 1, 62,
1451 62, 62, 62, 62, 62, 62, 62, 62,
1453 return len
+ hash_table
[str
[2]] + hash_table
[str
[0]];
1456 struct C_stab_entry
*
1457 in_word_set (str
, len
)
1462 static struct C_stab_entry wordlist
[] =
1464 {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
1466 {"volatile", 0, st_C_typespec
},
1468 {"long", 0, st_C_typespec
},
1469 {"char", 0, st_C_typespec
},
1470 {"class", C_PLPL
, st_C_struct
},
1471 {"",}, {"",}, {"",}, {"",},
1472 {"const", 0, st_C_typespec
},
1473 {"",}, {"",}, {"",}, {"",},
1474 {"auto", 0, st_C_typespec
},
1476 {"define", 0, st_C_define
},
1478 {"void", 0, st_C_typespec
},
1479 {"",}, {"",}, {"",},
1480 {"extern", 0, st_C_typespec
},
1481 {"static", 0, st_C_typespec
},
1483 {"domain", C_STAR
, st_C_struct
},
1485 {"typedef", 0, st_C_typedef
},
1486 {"double", 0, st_C_typespec
},
1487 {"enum", 0, st_C_enum
},
1488 {"",}, {"",}, {"",}, {"",},
1489 {"int", 0, st_C_typespec
},
1491 {"float", 0, st_C_typespec
},
1492 {"",}, {"",}, {"",},
1493 {"struct", 0, st_C_struct
},
1494 {"",}, {"",}, {"",}, {"",},
1495 {"union", 0, st_C_struct
},
1497 {"short", 0, st_C_typespec
},
1499 {"unsigned", 0, st_C_typespec
},
1500 {"signed", 0, st_C_typespec
},
1503 if (len
<= MAX_WORD_LENGTH
&& len
>= MIN_WORD_LENGTH
)
1505 register int key
= hash (str
, len
);
1507 if (key
<= MAX_HASH_VALUE
&& key
>= MIN_HASH_VALUE
)
1509 register char *s
= wordlist
[key
].name
;
1511 if (*s
== *str
&& strneq (str
+ 1, s
+ 1, len
- 1))
1512 return &wordlist
[key
];
1520 C_symtype(str
, len
, c_ext
)
1525 register struct C_stab_entry
*se
= in_word_set(str
, len
);
1527 if (se
== NULL
|| (se
->c_ext
&& !(c_ext
& se
->c_ext
)))
1533 * C functions are recognized using a simple finite automaton.
1534 * funcdef is its state variable.
1538 fnone
, /* nothing seen */
1539 ftagseen
, /* function-like tag seen */
1540 fstartlist
, /* just after open parenthesis */
1541 finlist
, /* in parameter list */
1542 flistseen
, /* after parameter list */
1543 fignore
/* before open brace */
1549 * typedefs are recognized using a simple finite automaton.
1550 * typeddef is its state variable.
1554 tnone
, /* nothing seen */
1555 ttypedseen
, /* typedef keyword seen */
1556 tinbody
, /* inside typedef body */
1557 tend
, /* just before typedef tag */
1558 tignore
/* junk after typedef tag */
1564 * struct-like structures (enum, struct and union) are recognized
1565 * using another simple finite automaton. `structdef' is its state
1570 snone
, /* nothing seen yet */
1571 skeyseen
, /* struct-like keyword seen */
1572 stagseen
, /* struct-like tag seen */
1573 scolonseen
, /* colon seen after struct-like tag */
1574 sinbody
/* in struct body: recognize member func defs*/
1579 * When structdef is stagseen, scolonseen, or sinbody, structtag is the
1580 * struct tag, and structtype is the type of the preceding struct-like
1583 char *structtag
= "<uninited>";
1584 enum sym_type structtype
;
1587 * Yet another little state machine to deal with preprocessor lines.
1591 dnone
, /* nothing seen */
1592 dsharpseen
, /* '#' seen as first char on line */
1593 ddefineseen
, /* '#' and 'define' seen */
1594 dignorerest
/* ignore rest of line */
1599 * Set this to TRUE, and the next token considered is called a function.
1600 * Used only for GNU emacs's function-defining macros.
1602 logical next_token_is_func
;
1605 * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
1611 * checks to see if the current token is at the start of a
1612 * function, or corresponds to a typedef, or is a struct/union/enum
1615 * *IS_FUNC gets TRUE iff the token is a function or macro with args.
1616 * C_EXT is which language we are looking at.
1618 * In the future we will need some way to adjust where the end of
1619 * the token is; for instance, implementing the C++ keyword
1620 * `operator' properly will adjust the end of the token to be after
1621 * whatever follows `operator'.
1628 * next_token_is_func IN OUT
1632 consider_token (str
, len
, c
, c_ext
, cblev
, is_func
)
1633 register char *str
; /* IN: token pointer */
1634 register int len
; /* IN: token length */
1635 register char c
; /* IN: first char after the token */
1636 int c_ext
; /* IN: C extensions mask */
1637 int cblev
; /* IN: curly brace level */
1638 logical
*is_func
; /* OUT: function found */
1640 enum sym_type toktype
= C_symtype (str
, len
, c_ext
);
1643 * Advance the definedef state machine.
1648 /* We're not on a preprocessor line. */
1651 if (toktype
== st_C_define
)
1653 definedef
= ddefineseen
;
1657 definedef
= dignorerest
;
1662 * Make a tag for any macro, unless it is a constant
1663 * and constantypedefs is FALSE.
1665 definedef
= dignorerest
;
1666 *is_func
= (c
== '(');
1667 if (!*is_func
&& !constantypedefs
)
1674 error ("internal error: definedef value.", 0);
1683 if (toktype
== st_C_typedef
)
1686 typdef
= ttypedseen
;
1702 /* Do not return here, so the structdef stuff has a chance. */
1716 * This structdef business is currently only invoked when cblev==0.
1717 * It should be recursively invoked whatever the curly brace level,
1718 * and a stack of states kept, to allow for definitions of structs
1721 * This structdef business is NOT invoked when we are ctags and the
1722 * file is plain C. This is because a struct tag may have the same
1723 * name as another tag, and this loses with ctags.
1725 * This if statement deals with the typdef state machine as
1726 * follows: if typdef==ttypedseen and token is struct/union/class/enum,
1727 * return FALSE. All the other code here is for the structdef
1734 if (typdef
== ttypedseen
1735 || (typedefs_and_cplusplus
&& cblev
== 0 && structdef
== snone
))
1737 structdef
= skeyseen
;
1738 structtype
= toktype
;
1742 if (structdef
== skeyseen
)
1744 /* Save the tag for struct/union/class, for functions that may be
1746 if (structtype
== st_C_struct
)
1747 structtag
= savenstr (str
, len
);
1749 structtag
= "<enum>";
1750 structdef
= stagseen
;
1754 /* Avoid entering funcdef stuff if typdef is going on. */
1755 if (typdef
!= tnone
)
1761 /* Detect GNU macros. */
1762 if (definedef
== dnone
)
1763 if (strneq (str
, "DEFUN", 5) /* Used in emacs */
1765 These are defined inside C functions
, so currently they
1767 || strneq (str
, "EXFUN", 5) /* Used in glibc */
1768 || strneq (str
, "DEFVAR_", 7) /* Used in emacs */
1770 || strneq (str
, "SYSCALL", 7) /* Used in glibc (mach) */
1771 || strneq (str
, "ENTRY", 5) /* Used in glibc */
1772 || strneq (str
, "PSEUDO", 6)) /* Used in glibc */
1775 next_token_is_func
= TRUE
;
1778 if (next_token_is_func
)
1780 next_token_is_func
= FALSE
;
1790 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1791 funcdef
= fnone
; /* should be useless */
1794 if (funcdef
== fnone
)
1807 * This routine finds functions, typedefs, #define's and
1808 * struct/union/enum definitions in C syntax and adds them
1819 #define current_lb_is_new (newndx == curndx)
1820 #define switch_line_buffers() (curndx = 1 - curndx)
1822 #define curlb (lbs[curndx].lb)
1823 #define othlb (lbs[1-curndx].lb)
1824 #define newlb (lbs[newndx].lb)
1825 #define curlinepos (lbs[curndx].linepos)
1826 #define othlinepos (lbs[1-curndx].linepos)
1827 #define newlinepos (lbs[newndx].linepos)
1829 #define CNL_SAVE_DEFINEDEF \
1831 curlinepos = charno; \
1833 charno += readline (&curlb, inf); \
1834 lp = curlb.buffer; \
1841 CNL_SAVE_DEFINEDEF; \
1845 token_saved = FALSE; \
1847 definedef = dnone; \
1850 #define make_tag_from_new_lb(isfun) pfnote (tok.str, isfun, tok.named, \
1851 newlb.buffer, tok.linelen, tok.lineno, newlinepos)
1852 #define make_tag_from_oth_lb(isfun) pfnote (tok.str, isfun, tok.named, \
1853 othlb.buffer, tok.linelen, tok.lineno, othlinepos)
1856 C_entries (c_ext
, inf
)
1857 int c_ext
; /* extension of C */
1858 FILE *inf
; /* input file */
1860 register char c
; /* latest char read; '\0' for end of line */
1861 register char *lp
; /* pointer one beyond the character `c' */
1862 int curndx
, newndx
; /* indices for current and new lb */
1863 TOKEN tok
; /* latest token read */
1864 register int tokoff
; /* offset in line of start of current token */
1865 register int toklen
; /* length of current token */
1866 int cblev
; /* current curly brace level */
1867 int parlev
; /* current parenthesis level */
1868 logical incomm
, inquote
, inchar
, quotednl
, midtoken
;
1870 logical token_saved
; /* token saved */
1871 TOKEN savetok
; /* token saved during preprocessor handling */
1873 curndx
= newndx
= 0;
1879 definedef
= dnone
; funcdef
= fnone
; typdef
= tnone
; structdef
= snone
;
1880 next_token_is_func
= yacc_rules
= token_saved
= FALSE
;
1881 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
1884 cplpl
= c_ext
& C_PLPL
;
1891 /* If we're at the end of the line, the next character is a
1892 '\0'; don't skip it, because it's the thing that tells us
1893 to read the next line. */
1914 /* Newlines inside comments do not end macro definitions in
1929 /* Newlines inside strings do not end macro definitions
1930 in traditional cpp, even though compilers don't
1931 usually accept them. */
1942 /* Hmmm, something went wrong. */
1956 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1961 if (funcdef
!= finlist
&& funcdef
!= fignore
)
1971 else if (cplpl
&& *lp
== '/')
1979 if ((c_ext
& YACC
) && *lp
== '%')
1981 /* entering or exiting rules section in yacc file */
1983 definedef
= dnone
; funcdef
= fnone
;
1984 typdef
= tnone
; structdef
= snone
;
1985 next_token_is_func
= FALSE
;
1986 midtoken
= inquote
= inchar
= incomm
= quotednl
= FALSE
;
1988 yacc_rules
= !yacc_rules
;
1994 if (definedef
== dnone
)
1997 logical cpptoken
= TRUE
;
1999 /* Look back on this line. If all blanks, or nonblanks
2000 followed by an end of comment, this is a preprocessor
2002 for (cp
= newlb
.buffer
; cp
< lp
-1; cp
++)
2005 if (*cp
== '*' && *(cp
+1) == '/')
2014 definedef
= dsharpseen
;
2015 } /* if (definedef == dnone) */
2021 /* Consider token only if some complicated conditions are satisfied. */
2022 if ((definedef
!= dnone
2023 || (cblev
== 0 && structdef
!= scolonseen
)
2024 || (cblev
== 1 && cplpl
&& structdef
== sinbody
))
2025 && typdef
!= tignore
2026 && definedef
!= dignorerest
2027 && funcdef
!= finlist
)
2033 if (cplpl
&& c
== ':' && *lp
== ':' && begtoken(*(lp
+ 1)))
2036 * This handles :: in the middle, but not at the
2037 * beginning of an identifier.
2044 logical is_func
= FALSE
;
2047 || consider_token (newlb
.buffer
+ tokoff
, toklen
,
2048 c
, c_ext
, cblev
, &is_func
))
2050 if (structdef
== sinbody
2051 && definedef
== dnone
2053 /* function defined in C++ class body */
2055 char *cp
= newlb
.buffer
+ tokoff
+ toklen
;
2058 tok
.str
= concat (structtag
, "::",
2059 newlb
.buffer
+ tokoff
);
2065 tok
.str
= savenstr (newlb
.buffer
+tokoff
, toklen
);
2066 if (structdef
== stagseen
2069 && definedef
== dignorerest
)) /* macro */
2074 tok
.lineno
= lineno
;
2075 tok
.linelen
= tokoff
+ toklen
+ 1;
2077 if (definedef
== dnone
2078 && (funcdef
== ftagseen
2079 || structdef
== stagseen
2082 if (current_lb_is_new
)
2083 switch_line_buffers ();
2086 make_tag_from_new_lb (is_func
);
2090 } /* if (endtoken (c)) */
2091 else if (intoken (c
))
2096 } /* if (midtoken) */
2097 else if (begtoken (c
))
2108 make_tag_from_oth_lb (TRUE
);
2115 if (structdef
== stagseen
)
2119 /* Take a quick peek ahead for a define directive,
2120 so we can avoid saving the token when not absolutely
2121 necessary. [This is a speed hack.] */
2122 if (c
== 'd' && strneq (lp
, "efine", 5)
2123 && iswhite (*(lp
+ 5)))
2127 definedef
= ddefineseen
;
2131 definedef
= dignorerest
;
2134 if (!yacc_rules
|| lp
== newlb
.buffer
+ 1)
2136 tokoff
= lp
- 1 - newlb
.buffer
;
2142 } /* if must look at token */
2145 /* Detect end of line, colon, comma, semicolon and various braces
2146 after having handled a token.*/
2150 if (definedef
!= dnone
)
2152 if (structdef
== stagseen
)
2153 structdef
= scolonseen
;
2160 make_tag_from_oth_lb (FALSE
);
2170 if (definedef
!= dnone
)
2176 make_tag_from_oth_lb (FALSE
);
2181 if (funcdef
!= fignore
)
2183 if (structdef
== stagseen
)
2187 if (definedef
!= dnone
)
2189 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2191 if (structdef
== stagseen
)
2195 if (definedef
!= dnone
)
2197 if (cblev
== 0 && typdef
== tend
)
2200 make_tag_from_oth_lb (FALSE
);
2203 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2205 if (structdef
== stagseen
)
2209 if (definedef
!= dnone
)
2218 /* Make sure that the next char is not a '*'.
2219 This handles constructs like:
2220 typedef void OperatorFun (int fun); */
2224 make_tag_from_oth_lb (FALSE
);
2227 } /* switch (typdef) */
2230 funcdef
= fstartlist
;
2239 if (definedef
!= dnone
)
2247 funcdef
= flistseen
;
2250 if (cblev
== 0 && typdef
== tend
)
2253 make_tag_from_oth_lb (FALSE
);
2256 else if (parlev
< 0) /* can happen due to ill-conceived #if's. */
2260 if (definedef
!= dnone
)
2262 if (typdef
== ttypedseen
)
2266 case skeyseen
: /* unnamed struct */
2267 structtag
= "_anonymous_";
2268 structdef
= sinbody
;
2271 case scolonseen
: /* named struct */
2272 structdef
= sinbody
;
2273 make_tag_from_oth_lb (FALSE
);
2279 make_tag_from_oth_lb (TRUE
);
2285 /* Neutralize `extern "C" {' grot and look inside structs. */
2286 if (cblev
== 0 && structdef
== snone
&& typdef
== tnone
)
2292 if (definedef
!= dnone
)
2294 if (funcdef
== fstartlist
)
2295 funcdef
= fnone
; /* avoid tagging `foo' in `foo (*bar()) ()' */
2298 if (definedef
!= dnone
)
2300 if (!noindentypedefs
&& lp
== newlb
.buffer
+ 1)
2302 cblev
= 0; /* reset curly brace level if first column */
2303 parlev
= 0; /* also reset paren level, just in case... */
2309 if (typdef
== tinbody
)
2311 #if FALSE /* too risky */
2312 if (structdef
== sinbody
)
2316 structtag
= "<error>";
2320 case '#': case '+': case '-': case '~': case '&': case '%': case '/':
2321 case '|': case '^': case '!': case '<': case '>': case '.': case '?':
2322 if (definedef
!= dnone
)
2324 /* These surely cannot follow a function tag. */
2325 if (funcdef
!= finlist
&& funcdef
!= fignore
)
2329 /* If a macro spans multiple lines don't reset its state. */
2337 } /* while not eof */
2341 * Process either a C++ file or a C file depending on the setting
2345 default_C_entries (inf
)
2348 C_entries (cplusplus
? C_PLPL
: 0, inf
);
2351 /* Always do C++. */
2353 Cplusplus_entries (inf
)
2356 C_entries (C_PLPL
, inf
);
2364 C_entries (C_STAR
, inf
);
2367 /* Always do Yacc. */
2372 C_entries (YACC
, inf
);
2375 /* Fortran parsing */
2383 register int len
= 0;
2385 while (*cp
&& (*cp
| ' ') == (dbp
[len
] | ' '))
2398 while (isspace (*dbp
))
2403 while (isspace (*dbp
))
2407 if (!isdigit (*dbp
))
2409 --dbp
; /* force failure */
2414 while (isdigit (*dbp
));
2423 while (isspace (*dbp
))
2428 linecharno
= charno
;
2429 charno
+= readline (&lb
, inf
);
2434 while (isspace (*dbp
))
2443 && (isalpha (*cp
) || isdigit (*cp
) || (*cp
== '_') || (*cp
== '$')));
2446 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2447 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2451 Fortran_functions (inf
)
2460 linecharno
= charno
;
2461 charno
+= readline (&lb
, inf
);
2464 dbp
++; /* Ratfor escape to fortran */
2465 while (isspace (*dbp
))
2472 if (tail ("integer"))
2480 if (tail ("logical"))
2484 if (tail ("complex") || tail ("character"))
2488 if (tail ("double"))
2490 while (isspace (*dbp
))
2494 if (tail ("precision"))
2500 while (isspace (*dbp
))
2507 if (tail ("function"))
2511 if (tail ("subroutine"))
2519 if (tail ("program"))
2524 if (tail ("procedure"))
2532 * Bob Weiner, Motorola Inc., 4/3/94
2533 * Unix and microcontroller assembly tag handling
2534 * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
2548 linecharno
= charno
;
2549 charno
+= readline (&lb
, inf
);
2552 /* If first char is alphabetic or one of [_.$], test for colon
2553 following identifier. */
2554 if (isalpha (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2556 /* Read past label. */
2558 while (isalnum (*cp
) || *cp
== '_' || *cp
== '.' || *cp
== '$')
2560 if (*cp
== ':' || isspace (*cp
))
2562 /* Found end of label, so copy it and add it to the table. */
2563 pfnote (savenstr (lb
.buffer
, cp
-lb
.buffer
), TRUE
, FALSE
,
2564 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2570 /* Added by Mosur Mohan, 4/22/88 */
2571 /* Pascal parsing */
2573 #define GET_NEW_LINE \
2575 linecharno = charno; lineno++; \
2576 charno += 1 + readline (&lb, inf); \
2581 * Locates tags for procedures & functions. Doesn't do any type- or
2582 * var-definitions. It does look for the keyword "extern" or
2583 * "forward" immediately following the procedure statement; if found,
2584 * the tag is skipped.
2587 Pascal_functions (inf
)
2590 struct linebuffer tline
; /* mostly copied from C_entries */
2596 logical
/* each of these flags is TRUE iff: */
2597 incomment
, /* point is inside a comment */
2598 inquote
, /* point is inside '..' string */
2599 get_tagname
, /* point is after PROCEDURE/FUNCTION */
2600 /* keyword, so next item = potential tag */
2601 found_tag
, /* point is after a potential tag */
2602 inparms
, /* point is within parameter-list */
2603 verify_tag
; /* point has passed the parm-list, so the */
2604 /* next token will determine whether */
2605 /* this is a FORWARD/EXTERN to be */
2606 /* ignored, or whether it is a real tag */
2612 initbuffer (&tline
);
2614 incomment
= inquote
= FALSE
;
2615 found_tag
= FALSE
; /* have a proc name; check if extern */
2616 get_tagname
= FALSE
; /* have found "procedure" keyword */
2617 inparms
= FALSE
; /* found '(' after "proc" */
2618 verify_tag
= FALSE
; /* check if "extern" is ahead */
2620 /* long main loop to get next char */
2624 if (c
== '\0') /* if end of line */
2629 if (!((found_tag
&& verify_tag
) ||
2631 c
= *dbp
++; /* only if don't need *dbp pointing */
2632 /* to the beginning of the name of */
2633 /* the procedure or function */
2637 if (c
== '}') /* within { - } comments */
2639 else if (c
== '*' && dbp
[1] == ')') /* within (* - *) comments */
2656 inquote
= TRUE
; /* found first quote */
2658 case '{': /* found open-{-comment */
2662 if (*dbp
== '*') /* found open-(*-comment */
2667 else if (found_tag
) /* found '(' after tag, i.e., parm-list */
2670 case ')': /* end of parms list */
2675 if ((found_tag
) && (!inparms
)) /* end of proc or fn stmt */
2682 if ((found_tag
) && (verify_tag
) && (*dbp
!= ' '))
2684 /* check if this is an "extern" declaration */
2687 if ((*dbp
== 'e') || (*dbp
== 'E'))
2689 if (tail ("extern")) /* superfluous, really! */
2695 else if ((*dbp
== 'f') || (*dbp
== 'F'))
2697 if (tail ("forward")) /* check for forward reference */
2703 if ((found_tag
) && (verify_tag
)) /* not external proc, so make tag */
2707 pfnote (nambuf
, TRUE
, FALSE
, tline
.buffer
,
2708 cp
- tline
.buffer
+ 1, save_lineno
, save_lcno
);
2712 if (get_tagname
) /* grab name of proc or fn */
2717 /* save all values for later tagging */
2718 tline
.size
= lb
.size
;
2719 strcpy (tline
.buffer
, lb
.buffer
);
2720 save_lineno
= lineno
;
2721 save_lcno
= linecharno
;
2723 /* grab block name */
2724 for (cp
= dbp
+ 1; *cp
&& (!endtoken (*cp
)); cp
++)
2726 nambuf
= savenstr (dbp
, cp
-dbp
);
2727 dbp
= cp
; /* restore dbp to e-o-token */
2728 get_tagname
= FALSE
;
2732 /* and proceed to check for "extern" */
2734 else if (!incomment
&& !inquote
&& !found_tag
)
2736 /* check for proc/fn keywords */
2740 if (tail ("rocedure")) /* c = 'p', dbp has advanced */
2744 if (tail ("unction"))
2749 } /* while not eof */
2753 * lisp tag functions
2754 * look for (def or (DEF, quote or QUOTE
2758 register char *strp
;
2760 return ((strp
[1] == 'd' || strp
[1] == 'D')
2761 && (strp
[2] == 'e' || strp
[2] == 'E')
2762 && (strp
[3] == 'f' || strp
[3] == 'F'));
2767 register char *strp
;
2769 return ((*(++strp
) == 'q' || *strp
== 'Q')
2770 && (*(++strp
) == 'u' || *strp
== 'U')
2771 && (*(++strp
) == 'o' || *strp
== 'O')
2772 && (*(++strp
) == 't' || *strp
== 'T')
2773 && (*(++strp
) == 'e' || *strp
== 'E')
2774 && isspace(*(++strp
)));
2782 if (*dbp
== '\'') /* Skip prefix quote */
2784 else if (*dbp
== '(' && L_isquote (dbp
)) /* Skip "(quote " */
2787 while (isspace(*dbp
))
2790 for (cp
= dbp
/*+1*/;
2791 *cp
&& *cp
!= '(' && *cp
!= ' ' && *cp
!= ')';
2797 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
, lb
.buffer
,
2798 cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2802 Lisp_functions (inf
)
2811 linecharno
= charno
;
2812 charno
+= readline (&lb
, inf
);
2818 while (!isspace (*dbp
))
2820 while (isspace (*dbp
))
2826 /* Check for (foo::defmumble name-defined ... */
2829 while (*dbp
&& !isspace (*dbp
)
2830 && *dbp
!= ':' && *dbp
!= '(' && *dbp
!= ')');
2835 while (*dbp
== ':');
2837 if (L_isdef (dbp
- 1))
2839 while (!isspace (*dbp
))
2841 while (isspace (*dbp
))
2852 * Scheme tag functions
2853 * look for (def... xyzzy
2854 * look for (def... (xyzzy
2855 * look for (def ... ((...(xyzzy ....
2856 * look for (set! xyzzy
2862 Scheme_functions (inf
)
2871 linecharno
= charno
;
2872 charno
+= readline (&lb
, inf
);
2874 if (dbp
[0] == '(' &&
2875 (dbp
[1] == 'D' || dbp
[1] == 'd') &&
2876 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2877 (dbp
[3] == 'F' || dbp
[3] == 'f'))
2879 while (!isspace (*dbp
))
2881 /* Skip over open parens and white space */
2882 while (*dbp
&& (isspace (*dbp
) || *dbp
== '('))
2886 if (dbp
[0] == '(' &&
2887 (dbp
[1] == 'S' || dbp
[1] == 's') &&
2888 (dbp
[2] == 'E' || dbp
[2] == 'e') &&
2889 (dbp
[3] == 'T' || dbp
[3] == 't') &&
2890 (dbp
[4] == '!' || dbp
[4] == '!') &&
2893 while (!isspace (*dbp
))
2895 /* Skip over white space */
2896 while (isspace (*dbp
))
2910 /* Go till you get to white space or a syntactic break */
2912 *cp
&& *cp
!= '(' && *cp
!= ')' && !isspace (*cp
);
2915 pfnote (savenstr (dbp
, cp
-dbp
), TRUE
, FALSE
,
2916 lb
.buffer
, cp
- lb
.buffer
+ 1, lineno
, linecharno
);
2919 /* Find tags in TeX and LaTeX input files. */
2921 /* TEX_toktab is a table of TeX control sequences that define tags.
2922 Each TEX_tabent records one such control sequence.
2923 CONVERT THIS TO USE THE Stab TYPE!! */
2930 struct TEX_tabent
*TEX_toktab
= NULL
; /* Table with tag tokens */
2932 /* Default set of control sequences to put into TEX_toktab.
2933 The value of environment var TEXTAGS is prepended to this. */
2935 char *TEX_defenv
= "\
2936 :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem:typeout";
2939 struct TEX_tabent
*TEX_decode_env ();
2943 char TEX_esc
= '\\';
2944 char TEX_opgrp
= '{';
2945 char TEX_clgrp
= '}';
2948 * TeX/LaTeX scanning loop.
2959 /* Select either \ or ! as escape character. */
2962 /* Initialize token table once from environment. */
2964 TEX_toktab
= TEX_decode_env ("TEXTAGS", TEX_defenv
);
2967 { /* Scan each line in file */
2969 linecharno
= charno
;
2970 charno
+= readline (&lb
, inf
);
2973 while (dbp
= etags_strchr (dbp
, TEX_esc
)) /* Look at each esc in line */
2979 linecharno
+= dbp
- lasthit
;
2981 i
= TEX_Token (lasthit
);
2984 TEX_getit (lasthit
, TEX_toktab
[i
].len
);
2985 break; /* We only save a line once */
2991 #define TEX_LESC '\\'
2992 #define TEX_SESC '!'
2995 /* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
2996 chars accordingly. */
3003 while ((c
= getc (inf
)) != EOF
)
3005 /* Skip to next line if we hit the TeX comment char. */
3009 else if (c
== TEX_LESC
|| c
== TEX_SESC
)
3028 /* Read environment and prepend it to the default string.
3029 Build token table. */
3031 TEX_decode_env (evarname
, defenv
)
3035 register char *env
, *p
;
3037 struct TEX_tabent
*tab
;
3040 /* Append default string to environment. */
3041 env
= getenv (evarname
);
3045 env
= concat (env
, defenv
, "");
3047 /* Allocate a token table */
3048 for (size
= 1, p
= env
; p
;)
3049 if ((p
= etags_strchr (p
, ':')) && *(++p
))
3051 /* Add 1 to leave room for null terminator. */
3052 tab
= xnew (size
+ 1, struct TEX_tabent
);
3054 /* Unpack environment string into token table. Be careful about */
3055 /* zero-length strings (leading ':', "::" and trailing ':') */
3058 p
= etags_strchr (env
, ':');
3059 if (!p
) /* End of environment string. */
3060 p
= env
+ strlen (env
);
3062 { /* Only non-zero strings. */
3063 tab
[i
].name
= savenstr (env
, p
- env
);
3064 tab
[i
].len
= strlen (tab
[i
].name
);
3071 tab
[i
].name
= NULL
; /* Mark end of table. */
3079 /* Record a tag defined by a TeX command of length LEN and starting at NAME.
3080 The name being defined actually starts at (NAME + LEN + 1).
3081 But we seem to include the TeX command in the tag name. */
3083 TEX_getit (name
, len
)
3087 char *p
= name
+ len
;
3092 /* Let tag name extend to next group close (or end of line) */
3093 while (*p
&& *p
!= TEX_clgrp
)
3095 pfnote (savenstr (name
, p
-name
), TRUE
, FALSE
, lb
.buffer
,
3096 strlen (lb
.buffer
), lineno
, linecharno
);
3099 /* If the text at CP matches one of the tag-defining TeX command names,
3100 return the pointer to the first occurrence of that command in TEX_toktab.
3101 Otherwise return -1.
3102 Keep the capital `T' in `Token' for dumb truncating compilers
3103 (this distinguishes it from `TEX_toktab' */
3110 for (i
= 0; TEX_toktab
[i
].len
> 0; i
++)
3111 if (strneq (TEX_toktab
[i
].name
, cp
, TEX_toktab
[i
].len
))
3116 /* Support for Prolog. */
3118 /* Whole head (not only functor, but also arguments)
3119 is gotten in compound term. */
3132 if (s
[0] == '\0') /* syntax error. */
3134 else if (insquote
&& s
[0] == '\'' && s
[1] == '\'')
3136 else if (s
[0] == '\'')
3138 insquote
= !insquote
;
3141 else if (!insquote
&& s
[0] == '(')
3146 else if (!insquote
&& s
[0] == ')')
3152 else if (npar
< 0) /* syntax error. */
3155 else if (!insquote
&& s
[0] == '.'
3156 && (isspace (s
[1]) || s
[1] == '\0'))
3158 if (npar
!= 0) /* syntax error. */
3166 pfnote (savenstr (save_s
, s
-save_s
), TRUE
, FALSE
,
3167 save_s
, s
-save_s
, lineno
, linecharno
);
3170 /* It is assumed that prolog predicate starts from column 0. */
3172 Prolog_functions (inf
)
3175 void skip_comment (), prolog_getit ();
3177 lineno
= linecharno
= charno
= 0;
3181 linecharno
+= charno
;
3182 charno
= readline (&lb
, inf
) + 1; /* 1 for newline. */
3184 if (isspace (dbp
[0])) /* not predicate header. */
3186 else if (dbp
[0] == '%') /* comment. */
3188 else if (dbp
[0] == '/' && dbp
[1] == '*') /* comment. */
3189 skip_comment (&lb
, inf
, &lineno
, &linecharno
);
3196 skip_comment (plb
, inf
, plineno
, plinecharno
)
3197 struct linebuffer
*plb
;
3199 int *plineno
; /* result */
3200 long *plinecharno
; /* result */
3206 for (cp
= plb
->buffer
; *cp
!= '\0'; cp
++)
3207 if (cp
[0] == '*' && cp
[1] == '/')
3210 *plinecharno
+= readline (plb
, inf
) + 1; /* 1 for newline. */
3215 #ifdef ETAGS_REGEXPS
3216 /* Take a string like "/blah/" and turn it into "blah", making sure
3217 that the first and last characters are the same, and handling
3218 quoted separator characters. Actually, stops on the occurence of
3219 an unquoted separator. Also turns "\t" into a Tab character.
3220 Returns pointer to terminating separator. Works in place. Null
3221 terminates name string. */
3223 scan_separators (name
)
3227 char *copyto
= name
;
3228 logical quoted
= FALSE
;
3230 for (++name
; *name
!= '\0'; ++name
)
3236 else if (*name
== sep
)
3240 /* Something else is quoted, so preserve the quote. */
3246 else if (*name
== '\\')
3248 else if (*name
== sep
)
3254 /* Terminate copied string. */
3259 /* Turn a name, which is an ed-style (but Emacs syntax) regular
3260 expression, into a real regular expression by compiling it. */
3262 add_regex (regexp_pattern
)
3263 char *regexp_pattern
;
3267 struct re_pattern_buffer
*patbuf
;
3269 if (regexp_pattern
== NULL
)
3271 /* Remove existing regexps. */
3277 if (regexp_pattern
[0] == '\0')
3279 error ("missing regexp", 0);
3282 if (regexp_pattern
[strlen(regexp_pattern
)-1] != regexp_pattern
[0])
3284 error ("%s: unterminated regexp", regexp_pattern
);
3287 name
= scan_separators (regexp_pattern
);
3288 if (regexp_pattern
[0] == '\0')
3290 error ("null regexp", 0);
3293 (void) scan_separators (name
);
3295 patbuf
= xnew (1, struct re_pattern_buffer
);
3296 patbuf
->translate
= NULL
;
3297 patbuf
->fastmap
= NULL
;
3298 patbuf
->buffer
= NULL
;
3299 patbuf
->allocated
= 0;
3301 err
= re_compile_pattern (regexp_pattern
, strlen (regexp_pattern
), patbuf
);
3304 error ("%s while compiling pattern", err
);
3309 if (num_patterns
== 1)
3310 patterns
= xnew (1, struct pattern
);
3312 patterns
= ((struct pattern
*)
3314 (num_patterns
* sizeof (struct pattern
))));
3315 patterns
[num_patterns
- 1].pattern
= patbuf
;
3316 patterns
[num_patterns
- 1].name_pattern
= savestr (name
);
3317 patterns
[num_patterns
- 1].error_signaled
= FALSE
;
3321 * Do the subtitutions indicated by the regular expression and
3325 substitute (in
, out
, regs
)
3327 struct re_registers
*regs
;
3329 char *result
= NULL
, *t
;
3332 /* Pass 1: figure out how much size to allocate. */
3333 for (t
= out
; *t
; ++t
)
3340 fprintf (stderr
, "%s: pattern subtitution ends prematurely\n",
3347 size
+= regs
->end
[dig
] - regs
->start
[dig
];
3352 /* Allocate space and do the substitutions. */
3353 result
= xnew (size
+ 1, char);
3362 /* Using "dig2" satisfies my debugger. Bleah. */
3363 int dig2
= *out
- '0';
3364 strncpy (result
+ size
, in
+ regs
->start
[dig2
],
3365 regs
->end
[dig2
] - regs
->start
[dig2
]);
3366 size
+= regs
->end
[dig2
] - regs
->start
[dig2
];
3373 result
[size
++] = '\t';
3379 result
[size
++] = *out
;
3385 result
[size
++] = *out
;
3387 result
[size
] = '\0';
3392 #endif /* ETAGS_REGEXPS */
3393 /* Initialize a linebuffer for use */
3395 initbuffer (linebuffer
)
3396 struct linebuffer
*linebuffer
;
3398 linebuffer
->size
= 200;
3399 linebuffer
->buffer
= xnew (200, char);
3403 * Read a line of text from `stream' into `linebuffer'.
3404 * Return the number of characters read from `stream',
3405 * which is the length of the line including the newline, if any.
3408 readline_internal (linebuffer
, stream
)
3409 struct linebuffer
*linebuffer
;
3410 register FILE *stream
;
3412 char *buffer
= linebuffer
->buffer
;
3413 register char *p
= linebuffer
->buffer
;
3414 register char *pend
;
3417 pend
= p
+ linebuffer
->size
; /* Separate to avoid 386/IX compiler bug. */
3421 register int c
= getc (stream
);
3424 linebuffer
->size
*= 2;
3425 buffer
= (char *) xrealloc (buffer
, linebuffer
->size
);
3426 p
+= buffer
- linebuffer
->buffer
;
3427 pend
= buffer
+ linebuffer
->size
;
3428 linebuffer
->buffer
= buffer
;
3437 if (p
[-1] == '\r' && p
> buffer
)
3452 return p
- buffer
+ chars_deleted
;
3456 * Like readline_internal, above, but try to match the input
3457 * line against any existing regular expressions.
3460 readline (linebuffer
, stream
)
3461 struct linebuffer
*linebuffer
;
3464 /* Read new line. */
3466 long result
= readline_internal (linebuffer
, stream
);
3468 #ifdef ETAGS_REGEXPS
3469 /* Match against all listed patterns. */
3470 for (i
= 0; i
< num_patterns
; ++i
)
3472 int match
= re_match (patterns
[i
].pattern
, linebuffer
->buffer
,
3473 (int)result
, 0, &patterns
[i
].regs
);
3478 if (!patterns
[i
].error_signaled
)
3480 error ("error while matching pattern %d", i
);
3481 patterns
[i
].error_signaled
= TRUE
;
3488 /* Match occurred. Construct a tag. */
3489 if (patterns
[i
].name_pattern
[0] != '\0')
3491 /* Make a named tag. */
3492 char *name
= substitute (linebuffer
->buffer
,
3493 patterns
[i
].name_pattern
,
3496 pfnote (name
, TRUE
, TRUE
, linebuffer
->buffer
,
3497 match
, lineno
, linecharno
);
3501 /* Make an unnamed tag. */
3502 pfnote (NULL
, TRUE
, FALSE
, linebuffer
->buffer
,
3503 match
, lineno
, linecharno
);
3508 #endif /* ETAGS_REGEXPS */
3514 * Read a file, but do no processing. This is used to do regexp
3515 * matching on files that have no language defined.
3518 just_read_file (inf
)
3524 linecharno
= charno
;
3525 charno
+= readline (&lb
, inf
) + 1;
3531 * Return a pointer to a space of size strlen(cp)+1 allocated
3532 * with xnew where the string CP has been copied.
3538 return savenstr (cp
, strlen (cp
));
3542 * Return a pointer to a space of size LEN+1 allocated with xnew where
3543 * the string CP has been copied for at most the first LEN characters.
3552 dp
= xnew (len
+ 1, char);
3553 strncpy (dp
, cp
, len
);
3559 * Return the ptr in sp at which the character c last
3560 * appears; NULL if not found
3562 * Identical to System V strrchr, included for portability.
3565 etags_strrchr (sp
, c
)
3566 register char *sp
, c
;
3581 * Return the ptr in sp at which the character c first
3582 * appears; NULL if not found
3584 * Identical to System V strchr, included for portability.
3587 etags_strchr (sp
, c
)
3588 register char *sp
, c
;
3598 /* Print error message and exit. */
3615 /* Print error message. `s1' is printf control string, `s2' is arg for it. */
3620 fprintf (stderr
, "%s: ", progname
);
3621 fprintf (stderr
, s1
, s2
);
3622 fprintf (stderr
, "\n");
3625 /* Return a newly-allocated string whose contents
3626 concatenate those of s1, s2, s3. */
3631 int len1
= strlen (s1
), len2
= strlen (s2
), len3
= strlen (s3
);
3632 char *result
= xnew (len1
+ len2
+ len3
+ 1, char);
3634 strcpy (result
, s1
);
3635 strcpy (result
+ len1
, s2
);
3636 strcpy (result
+ len1
+ len2
, s3
);
3637 result
[len1
+ len2
+ len3
] = '\0';
3642 /* Does the same work as the system V getcwd, but does not need to
3643 guess buffer size in advance. */
3648 char *p
, path
[MAXPATHLEN
+ 1]; /* Fixed size is safe on MSDOS. */
3656 *p
++ = tolower (*p
);
3658 return strdup (path
);
3660 #elif HAVE_GETCWD /* not DOS_NT */
3663 char *path
= xnew (bufsize
, char);
3665 while (getcwd (path
, bufsize
) == NULL
)
3667 if (errno
!= ERANGE
)
3670 path
= xnew (bufsize
, char);
3675 #else /* not DOS_NT and not HAVE_GETCWD */
3677 struct linebuffer path
;
3681 pipe
= (FILE *) popen ("pwd 2>/dev/null", "r");
3682 if (pipe
== NULL
|| readline_internal (&path
, pipe
) == 0)
3688 #endif /* not DOS_NT and not HAVE_GETCWD */
3690 /* Return a newly allocated string containing the filename
3691 of FILE relative to the absolute directory DIR (which
3692 should end with a slash). */
3694 relative_filename (file
, dir
)
3697 char *fp
, *dp
, *res
;
3699 /* Find the common root of file and dir. */
3700 fp
= absolute_filename (file
, cwd
);
3702 while (*fp
++ == *dp
++)
3711 /* Build a sequence of "../" strings for the resulting relative filename. */
3712 for (dp
= etags_strchr (dp
+ 1, '/'), res
= "";
3714 dp
= etags_strchr (dp
+ 1, '/'))
3716 res
= concat (res
, "../", "");
3719 /* Add the filename relative to the common root of file and dir. */
3720 res
= concat (res
, fp
+ 1, "");
3722 return res
; /* temporary stub */
3725 /* Return a newly allocated string containing the
3726 absolute filename of FILE given CWD (which should
3727 end with a slash). */
3729 absolute_filename (file
, cwd
)
3732 char *slashp
, *cp
, *res
;
3735 res
= concat (file
, "", "");
3737 res
= concat (cwd
, file
, "");
3739 /* Delete the "/dirname/.." and "/." substrings. */
3740 slashp
= etags_strchr (res
, '/');
3741 while (slashp
!= NULL
&& slashp
[0] != '\0')
3743 if (slashp
[1] == '.')
3745 if (slashp
[2] == '.'
3746 && (slashp
[3] == '/' || slashp
[3] == '\0'))
3751 while (cp
>= res
&& *cp
!= '/');
3754 strcpy (cp
, slashp
+ 3);
3756 else /* else (cp == res) */
3758 if (slashp
[3] != '\0')
3759 strcpy (cp
, slashp
+ 4);
3766 else if (slashp
[2] == '/' || slashp
[2] == '\0')
3768 strcpy (slashp
, slashp
+ 2);
3773 slashp
= etags_strchr (slashp
+ 1, '/');
3779 /* Return a newly allocated string containing the absolute
3780 filename of dir where FILE resides given CWD (which should
3781 end with a slash). */
3783 absolute_dirname (file
, cwd
)
3789 slashp
= etags_strrchr (file
, '/');
3794 res
= absolute_filename (file
, cwd
);
3800 /* Like malloc but get fatal error if memory is exhausted. */
3805 char *result
= (char *) malloc (size
);
3807 fatal ("virtual memory exhausted", 0);
3812 xrealloc (ptr
, size
)
3816 char *result
= (char *) realloc (ptr
, size
);
3818 fatal ("virtual memory exhausted");