/* Tags file maker to go with GNU Emacs -*- coding: utf-8 -*- Copyright (C) 1984 The Regents of the University of California Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the University nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Copyright (C) 1984, 1987-1989, 1993-1995, 1998-2022 Free Software Foundation, Inc. This file is not considered part of GNU Emacs. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ /* NB To comply with the above BSD license, copyright information is reproduced in etc/ETAGS.README. That file should be updated when the above notices are. To the best of our knowledge, this code was originally based on the ctags.c distributed with BSD4.2, which was copyrighted by the University of California, as described above. */ /* * Authors: * 1983 Ctags originally by Ken Arnold. * 1984 Fortran added by Jim Kleckner. * 1984 Ed Pelegri-Llopart added C typedefs. * 1985 Emacs TAGS format by Richard Stallman. * 1989 Sam Kendall added C++. * 1992 Joseph B. Wells improved C and C++ parsing. * 1993 Francesco Potortì reorganized C and C++. * 1994 Line-by-line regexp tags by Tom Tromey. * 2001 Nested classes by Francesco Potortì (concept by Mykola Dzyuba). * 2002 #line directives by Francesco Potortì. * Francesco Potortì maintained and improved it for many years starting in 1993. */ /* * If you want to add support for a new language, start by looking at the LUA * language, which is the simplest. Alternatively, consider distributing etags * together with a configuration file containing regexp definitions for etags. */ #ifdef DEBUG # undef DEBUG # define DEBUG true #else # define DEBUG false #endif #include /* WIN32_NATIVE is for XEmacs. MSDOS, WINDOWSNT, DOS_NT are for Emacs. */ #ifdef WIN32_NATIVE # undef MSDOS # undef WINDOWSNT # define WINDOWSNT #endif /* WIN32_NATIVE */ #ifdef MSDOS # undef MSDOS # define MSDOS true # include #else # define MSDOS false #endif /* MSDOS */ #ifdef WINDOWSNT # include # undef HAVE_NTGUI # undef DOS_NT # define DOS_NT /* The WINDOWSNT build doesn't use Gnulib's fcntl.h. */ # define O_CLOEXEC O_NOINHERIT #endif /* WINDOWSNT */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* Define CTAGS to make the program "ctags" compatible with the usual one. Leave it undefined to make the program "etags", which makes emacs-style tag tables and tags typedefs, #defines and struct/union/enum by default. */ #ifdef CTAGS # undef CTAGS # define CTAGS true #else # define CTAGS false #endif /* Define MERCURY_HEURISTICS_RATIO as it was necessary to disambiguate Mercury from Objective C, which have same file extensions .m See comments before function test_objc_is_mercury for details. */ #ifndef MERCURY_HEURISTICS_RATIO # define MERCURY_HEURISTICS_RATIO 0.5 #endif /* COPY to DEST from SRC (containing LEN bytes), and append a NUL byte. */ static void memcpyz (void *dest, void const *src, ptrdiff_t len) { char *e = mempcpy (dest, src, len); *e = '\0'; } static bool filename_has_shell_str(char *s) { if (!s) return false; char *p = s; while (*p != '\0') { switch (*p) { case '\'': case '"': case '&': case '|': case ';': case '`': case '$': return true; } p++; } return false; } static bool streq (char const *s, char const *t) { return strcmp (s, t) == 0; } static bool strcaseeq (char const *s, char const *t) { return c_strcasecmp (s, t) == 0; } static bool strneq (char const *s, char const *t, size_t n) { return strncmp (s, t, n) == 0; } static bool strncaseeq (char const *s, char const *t, size_t n) { return c_strncasecmp (s, t, n) == 0; } /* C is not in a name. */ static bool notinname (unsigned char c) { /* Look at make_tag before modifying! */ static bool const table[UCHAR_MAX + 1] = { ['\0']=1, ['\t']=1, ['\n']=1, ['\f']=1, ['\r']=1, [' ']=1, ['(']=1, [')']=1, [',']=1, [';']=1, ['=']=1 }; return table[c]; } /* C can start a token. */ static bool begtoken (unsigned char c) { static bool const table[UCHAR_MAX + 1] = { ['$']=1, ['@']=1, ['A']=1, ['B']=1, ['C']=1, ['D']=1, ['E']=1, ['F']=1, ['G']=1, ['H']=1, ['I']=1, ['J']=1, ['K']=1, ['L']=1, ['M']=1, ['N']=1, ['O']=1, ['P']=1, ['Q']=1, ['R']=1, ['S']=1, ['T']=1, ['U']=1, ['V']=1, ['W']=1, ['X']=1, ['Y']=1, ['Z']=1, ['_']=1, ['a']=1, ['b']=1, ['c']=1, ['d']=1, ['e']=1, ['f']=1, ['g']=1, ['h']=1, ['i']=1, ['j']=1, ['k']=1, ['l']=1, ['m']=1, ['n']=1, ['o']=1, ['p']=1, ['q']=1, ['r']=1, ['s']=1, ['t']=1, ['u']=1, ['v']=1, ['w']=1, ['x']=1, ['y']=1, ['z']=1, ['~']=1 }; return table[c]; } /* C can be in the middle of a token. */ static bool intoken (unsigned char c) { static bool const table[UCHAR_MAX + 1] = { ['$']=1, ['0']=1, ['1']=1, ['2']=1, ['3']=1, ['4']=1, ['5']=1, ['6']=1, ['7']=1, ['8']=1, ['9']=1, ['A']=1, ['B']=1, ['C']=1, ['D']=1, ['E']=1, ['F']=1, ['G']=1, ['H']=1, ['I']=1, ['J']=1, ['K']=1, ['L']=1, ['M']=1, ['N']=1, ['O']=1, ['P']=1, ['Q']=1, ['R']=1, ['S']=1, ['T']=1, ['U']=1, ['V']=1, ['W']=1, ['X']=1, ['Y']=1, ['Z']=1, ['_']=1, ['a']=1, ['b']=1, ['c']=1, ['d']=1, ['e']=1, ['f']=1, ['g']=1, ['h']=1, ['i']=1, ['j']=1, ['k']=1, ['l']=1, ['m']=1, ['n']=1, ['o']=1, ['p']=1, ['q']=1, ['r']=1, ['s']=1, ['t']=1, ['u']=1, ['v']=1, ['w']=1, ['x']=1, ['y']=1, ['z']=1 }; return table[c]; } /* C can end a token. */ static bool endtoken (unsigned char c) { static bool const table[UCHAR_MAX + 1] = { ['\0']=1, ['\t']=1, ['\n']=1, ['\r']=1, [' ']=1, ['!']=1, ['"']=1, ['#']=1, ['%']=1, ['&']=1, ['\'']=1, ['(']=1, [')']=1, ['*']=1, ['+']=1, [',']=1, ['-']=1, ['.']=1, ['/']=1, [':']=1, [';']=1, ['<']=1, ['=']=1, ['>']=1, ['?']=1, ['[']=1, [']']=1, ['^']=1, ['{']=1, ['|']=1, ['}']=1, ['~']=1 }; return table[c]; } /* * xnew, xrnew -- allocate, reallocate storage * * SYNOPSIS: Type *xnew (ptrdiff_t n, Type); * void xrnew (OldPointer, ptrdiff_t n, int multiplier); */ #define xnew(n, Type) ((Type *) xnmalloc (n, sizeof (Type))) #define xrnew(op, n, m) ((op) = xnrealloc (op, n, (m) * sizeof *(op))) typedef void Lang_function (FILE *); typedef struct { const char *suffix; /* file name suffix for this compressor */ const char *command; /* takes one arg and decompresses to stdout */ } compressor; typedef struct { const char *name; /* language name */ const char *help; /* detailed help for the language */ Lang_function *function; /* parse function */ const char **suffixes; /* name suffixes of this language's files */ const char **filenames; /* names of this language's files */ const char **interpreters; /* interpreters for this language */ bool metasource; /* source used to generate other sources */ } language; typedef struct fdesc { struct fdesc *next; /* for the linked list */ char *infname; /* uncompressed input file name */ char *infabsname; /* absolute uncompressed input file name */ char *infabsdir; /* absolute dir of input file */ char *taggedfname; /* file name to write in tagfile */ language *lang; /* language of file */ char *prop; /* file properties to write in tagfile */ bool usecharno; /* etags tags shall contain char number */ bool written; /* entry written in the tags file */ } fdesc; typedef struct node_st { /* sorting structure */ struct node_st *left, *right; /* left and right sons */ fdesc *fdp; /* description of file to whom tag belongs */ char *name; /* tag name */ char *regex; /* search regexp */ bool valid; /* write this tag on the tag file */ bool is_func; /* function tag: use regexp in CTAGS mode */ bool been_warned; /* warning already given for duplicated tag */ intmax_t lno; /* line number tag is on */ intmax_t cno; /* character number line starts on */ } node; /* * A `linebuffer' is a structure which holds a line of text. * `readline_internal' reads a line from a stream into a linebuffer * and works regardless of the length of the line. * SIZE is the size of BUFFER, LEN is the length of the string in * BUFFER after readline reads it. */ typedef struct { ptrdiff_t size; ptrdiff_t len; char *buffer; } linebuffer; /* Used to support mixing of --lang and file names. */ typedef struct { enum { at_language, /* a language specification */ at_regexp, /* a regular expression */ at_filename, /* a file name */ at_stdin, /* read from stdin here */ at_end /* stop parsing the list */ } arg_type; /* argument type */ language *lang; /* language associated with the argument */ char *what; /* the argument itself */ } argument; /* Structure defining a regular expression. */ typedef struct regexp { struct regexp *p_next; /* pointer to next in list */ language *lang; /* if set, use only for this language */ char *pattern; /* the regexp pattern */ char *name; /* tag name */ struct re_pattern_buffer *pat; /* the compiled pattern */ struct re_registers regs; /* re registers */ bool error_signaled; /* already signaled for this regexp */ bool ignore_case; /* ignore case when matching */ bool multi_line; /* do a multi-line match on the whole file */ } regexp; /* Many compilers barf on this: Lang_function Ada_funcs; so let's write it this way */ static void Ada_funcs (FILE *); static void Asm_labels (FILE *); static void C_entries (int c_ext, FILE *); static void default_C_entries (FILE *); static void plain_C_entries (FILE *); static void Cjava_entries (FILE *); static void Cobol_paragraphs (FILE *); static void Cplusplus_entries (FILE *); static void Cstar_entries (FILE *); static void Erlang_functions (FILE *); static void Forth_words (FILE *); static void Fortran_functions (FILE *); static void Go_functions (FILE *); static void HTML_labels (FILE *); static void Lisp_functions (FILE *); static void Lua_functions (FILE *); static void Makefile_targets (FILE *); static void Mercury_functions (FILE *); static void Pascal_functions (FILE *); static void Perl_functions (FILE *); static void PHP_functions (FILE *); static void PS_functions (FILE *); static void Prolog_functions (FILE *); static void Python_functions (FILE *); static void Ruby_functions (FILE *); static void Rust_entries (FILE *); static void Scheme_functions (FILE *); static void TeX_commands (FILE *); static void Texinfo_nodes (FILE *); static void Yacc_entries (FILE *); static void just_read_file (FILE *); static language *get_language_from_langname (const char *); static void readline (linebuffer *, FILE *); static ptrdiff_t readline_internal (linebuffer *, FILE *, char const *); static bool nocase_tail (const char *); static void get_tag (char *, char **); static void get_lispy_tag (char *); static void test_objc_is_mercury (char *, language **); static void analyze_regex (char *); static void free_regexps (void); static void regex_tag_multiline (void); static void error (const char *, ...) ATTRIBUTE_FORMAT_PRINTF (1, 2); static void verror (char const *, va_list) ATTRIBUTE_FORMAT_PRINTF (1, 0); static _Noreturn void suggest_asking_for_help (void); static _Noreturn void fatal (char const *, ...) ATTRIBUTE_FORMAT_PRINTF (1, 2); static _Noreturn void pfatal (const char *); static void add_node (node *, node **); static void process_file_name (char *, language *); static void process_file (FILE *, char *, language *); static void find_entries (FILE *); static void free_tree (node *); static void free_fdesc (fdesc *); static void pfnote (char *, bool, char *, ptrdiff_t, intmax_t, intmax_t); static void invalidate_nodes (fdesc *, node **); static void put_entries (node *); static char *concat (const char *, const char *, const char *); static char *skip_spaces (char *); static char *skip_non_spaces (char *); static char *skip_name (char *); static char *savenstr (const char *, ptrdiff_t); static char *savestr (const char *); static char *etags_getcwd (void); static char *relative_filename (char *, char *); static char *absolute_filename (char *, char *); static char *absolute_dirname (char *, char *); static bool filename_is_absolute (char *f); static void canonicalize_filename (char *); static char *etags_mktmp (void); static void linebuffer_init (linebuffer *); static void linebuffer_setlen (linebuffer *, ptrdiff_t); static void *xmalloc (ptrdiff_t) ATTRIBUTE_MALLOC_SIZE ((1)); static void *xnmalloc (ptrdiff_t, ptrdiff_t) ATTRIBUTE_MALLOC_SIZE ((1,2)); static void *xnrealloc (void *, ptrdiff_t, ptrdiff_t) ATTRIBUTE_ALLOC_SIZE ((2,3)); static char searchar = '/'; /* use /.../ searches */ static char *tagfile; /* output file */ static char *progname; /* name this program was invoked with */ static char *cwd; /* current working directory */ static char *tagfiledir; /* directory of tagfile */ static FILE *tagf; /* ioptr for tags file */ static ptrdiff_t whatlen_max; /* maximum length of any 'what' member */ static fdesc *fdhead; /* head of file description list */ static fdesc *curfdp; /* current file description */ static char *infilename; /* current input file name */ static intmax_t lineno; /* line number of current line */ static intmax_t charno; /* current character number */ static intmax_t linecharno; /* charno of start of current line */ static char *dbp; /* pointer to start of current tag */ static intmax_t const invalidcharno = -1; static node *nodehead; /* the head of the binary tree of tags */ static node *last_node; /* the last node created */ static linebuffer lb; /* the current line */ static linebuffer filebuf; /* a buffer containing the whole file */ static linebuffer token_name; /* a buffer containing a tag name */ static bool append_to_tagfile; /* -a: append to tags */ /* The next five default to true in C and derived languages. */ static bool typedefs; /* -t: create tags for C and Ada typedefs */ static bool typedefs_or_cplusplus; /* -T: create tags for C typedefs, level */ /* 0 struct/enum/union decls, and C++ */ /* member functions. */ static bool constantypedefs; /* -d: create tags for C #define, enum */ /* constants and variables. */ /* -D: opposite of -d. Default under ctags. */ static int globals; /* create tags for global variables */ static int members; /* create tags for C member variables */ static int declarations; /* --declarations: tag them and extern in C&Co*/ static int no_line_directive; /* ignore #line directives (undocumented) */ static int no_duplicates; /* no duplicate tags for ctags (undocumented) */ static bool update; /* -u: update tags */ static bool vgrind_style; /* -v: create vgrind style index output */ static bool no_warnings; /* -w: suppress warnings (undocumented) */ static bool cxref_style; /* -x: create cxref style output */ static bool cplusplus; /* .[hc] means C++, not C (undocumented) */ static bool ignoreindent; /* -I: ignore indentation in C */ static int packages_only; /* --packages-only: in Ada, only tag packages*/ static int class_qualify; /* -Q: produce class-qualified tags in C++/Java */ static int debug; /* --debug */ /* STDIN is defined in LynxOS system headers */ #ifdef STDIN # undef STDIN #endif #define STDIN 0x1001 /* returned by getopt_long on --parse-stdin */ static bool parsing_stdin; /* --parse-stdin used */ static regexp *p_head; /* list of all regexps */ static bool need_filebuf; /* some regexes are multi-line */ static struct option longopts[] = { { "append", no_argument, NULL, 'a' }, { "packages-only", no_argument, &packages_only, 1 }, { "c++", no_argument, NULL, 'C' }, { "debug", no_argument, &debug, 1 }, { "declarations", no_argument, &declarations, 1 }, { "no-line-directive", no_argument, &no_line_directive, 1 }, { "no-duplicates", no_argument, &no_duplicates, 1 }, { "help", no_argument, NULL, 'h' }, { "help", no_argument, NULL, 'H' }, { "ignore-indentation", no_argument, NULL, 'I' }, { "language", required_argument, NULL, 'l' }, { "members", no_argument, &members, 1 }, { "no-members", no_argument, &members, 0 }, { "output", required_argument, NULL, 'o' }, { "class-qualify", no_argument, &class_qualify, 'Q' }, { "regex", required_argument, NULL, 'r' }, { "no-regex", no_argument, NULL, 'R' }, { "ignore-case-regex", required_argument, NULL, 'c' }, { "parse-stdin", required_argument, NULL, STDIN }, { "version", no_argument, NULL, 'V' }, #if CTAGS /* Ctags options */ { "backward-search", no_argument, NULL, 'B' }, { "cxref", no_argument, NULL, 'x' }, { "defines", no_argument, NULL, 'd' }, { "globals", no_argument, &globals, 1 }, { "typedefs", no_argument, NULL, 't' }, { "typedefs-and-c++", no_argument, NULL, 'T' }, { "update", no_argument, NULL, 'u' }, { "vgrind", no_argument, NULL, 'v' }, { "no-warn", no_argument, NULL, 'w' }, #else /* Etags options */ { "no-defines", no_argument, NULL, 'D' }, { "no-globals", no_argument, &globals, 0 }, { "include", required_argument, NULL, 'i' }, #endif { NULL } }; static compressor compressors[] = { { "z", "gzip -d -c"}, { "Z", "gzip -d -c"}, { "gz", "gzip -d -c"}, { "GZ", "gzip -d -c"}, { "bz2", "bzip2 -d -c" }, { "xz", "xz -d -c" }, { "zst", "zstd -d -c" }, { NULL } }; /* * Language stuff. */ /* Ada code */ static const char *Ada_suffixes [] = { "ads", "adb", "ada", NULL }; static const char Ada_help [] = "In Ada code, functions, procedures, packages, tasks and types are\n\ tags. Use the '--packages-only' option to create tags for\n\ packages only.\n\ Ada tag names have suffixes indicating the type of entity:\n\ Entity type: Qualifier:\n\ ------------ ----------\n\ function /f\n\ procedure /p\n\ package spec /s\n\ package body /b\n\ type /t\n\ task /k\n\ Thus, 'M-x find-tag bidule/b ' will go directly to the\n\ body of the package 'bidule', while 'M-x find-tag bidule '\n\ will just search for any tag 'bidule'."; /* Assembly code */ static const char *Asm_suffixes [] = { "a", /* Unix assembler */ "asm", /* Microcontroller assembly */ "def", /* BSO/Tasking definition includes */ "inc", /* Microcontroller include files */ "ins", /* Microcontroller include files */ "s", "sa", /* Unix assembler */ "S", /* cpp-processed Unix assembler */ "src", /* BSO/Tasking C compiler output */ NULL }; static const char Asm_help [] = "In assembler code, labels appearing at the beginning of a line,\n\ followed by a colon, are tags."; /* Note that .c and .h can be considered C++, if the --c++ flag was given, or if the `class' or `template' keywords are met inside the file. That is why default_C_entries is called for these. */ static const char *default_C_suffixes [] = { "c", "h", NULL }; #if CTAGS /* C help for Ctags */ static const char default_C_help [] = "In C code, any C function is a tag. Use -t to tag typedefs.\n\ Use -T to tag definitions of 'struct', 'union' and 'enum'.\n\ Use -d to tag '#define' macro definitions and 'enum' constants.\n\ Use --globals to tag global variables.\n\ You can tag function declarations and external variables by\n\ using '--declarations', and struct members by using '--members'."; #else /* C help for Etags */ static const char default_C_help [] = "In C code, any C function or typedef is a tag, and so are\n\ definitions of 'struct', 'union' and 'enum'. '#define' macro\n\ definitions and 'enum' constants are tags unless you specify\n\ '--no-defines'. Global variables are tags unless you specify\n\ '--no-globals' and so are struct members unless you specify\n\ '--no-members'. Use of '--no-globals', '--no-defines' and\n\ '--no-members' can make the tags table file much smaller.\n\ You can tag function declarations and external variables by\n\ using '--declarations'."; #endif /* C help for Ctags and Etags */ static const char *Cplusplus_suffixes [] = { "C", "c++", "cc", "cpp", "cxx", "H", "h++", "hh", "hpp", "hxx", "M", /* Objective C++ */ "pdb", /* PostScript with C syntax */ NULL }; static const char Cplusplus_help [] = "In C++ code, all the tag constructs of C code are tagged. (Use\n\ --help --lang=c --lang=c++ for full help.)\n\ In addition to C tags, member functions are also recognized. Member\n\ variables are recognized unless you use the '--no-members' option.\n\ Tags for variables and functions in classes are named 'CLASS::VARIABLE'\n\ and 'CLASS::FUNCTION'. 'operator' definitions have tag names like\n\ 'operator+'."; static const char *Cjava_suffixes [] = { "java", NULL }; static char Cjava_help [] = "In Java code, all the tags constructs of C and C++ code are\n\ tagged. (Use --help --lang=c --lang=c++ --lang=java for full help.)"; static const char *Cobol_suffixes [] = { "COB", "cob", NULL }; static char Cobol_help [] = "In Cobol code, tags are paragraph names; that is, any word\n\ starting in column 8 and followed by a period."; static const char *Cstar_suffixes [] = { "cs", "hs", NULL }; static const char *Erlang_suffixes [] = { "erl", "hrl", NULL }; static const char Erlang_help [] = "In Erlang code, the tags are the functions, records and macros\n\ defined in the file."; static const char *Erlang_interpreters [] = { "escript", NULL }; static const char *Forth_suffixes [] = { "fth", "tok", NULL }; static const char Forth_help [] = "In Forth code, tags are words defined by ':',\n\ constant, code, create, defer, value, variable, buffer:, field."; static const char *Fortran_suffixes [] = { "F", "f", "f90", "for", NULL }; static const char Fortran_help [] = "In Fortran code, functions, subroutines and block data are tags."; static const char *Go_suffixes [] = {"go", NULL}; static const char Go_help [] = "In Go code, functions, interfaces and packages are tags."; static const char *HTML_suffixes [] = { "htm", "html", "shtml", NULL }; static const char HTML_help [] = "In HTML input files, the tags are the 'title' and the 'h1', 'h2',\n\ 'h3' headers. Also, tags are 'name=' in anchors and all\n\ occurrences of 'id='."; static const char *Lisp_suffixes [] = { "cl", "clisp", "el", "l", "lisp", "LSP", "lsp", "ml", NULL }; static const char Lisp_help [] = "In Lisp code, any function defined with 'defun', any variable\n\ defined with 'defvar' or 'defconst', and in general the first\n\ argument of any expression that starts with '(def' in column zero\n\ is a tag.\n\ The '--declarations' option tags \"(defvar foo)\" constructs too."; static const char *Lua_suffixes [] = { "lua", "LUA", NULL }; static const char Lua_help [] = "In Lua scripts, all functions are tags."; static const char *Lua_interpreters [] = { "lua", NULL }; static const char *Makefile_filenames [] = { "Makefile", "makefile", "GNUMakefile", "Makefile.in", "Makefile.am", NULL}; static const char Makefile_help [] = "In makefiles, targets are tags; additionally, variables are tags\n\ unless you specify '--no-globals'."; /* Mercury and Objective C share the same .m file extensions. */ static const char *Mercury_suffixes [] = {"m", NULL}; static const char Mercury_help [] = "In Mercury code, tags are all declarations beginning a line with ':-'\n\ and optionally Prolog-like definitions (first rule for a predicate or \ function).\n\ To enable this behavior, run etags using --declarations."; static bool with_mercury_definitions = false; float mercury_heuristics_ratio = MERCURY_HEURISTICS_RATIO; static const char *Objc_suffixes [] = { "lm", /* Objective lex file */ "m", /* By default, Objective C file will be assumed. */ NULL}; static const char Objc_help [] = "In Objective C code, tags include Objective C definitions for classes,\n\ class categories, methods and protocols. Tags for variables and\n\ functions in classes are named 'CLASS::VARIABLE' and 'CLASS::FUNCTION'.\ \n(Use --help --lang=c --lang=objc --lang=java for full help.)"; static const char *Pascal_suffixes [] = { "p", "pas", NULL }; static const char Pascal_help [] = "In Pascal code, the tags are the functions and procedures defined\n\ in the file."; /* " // this is for working around an Emacs highlighting bug... */ static const char *Perl_suffixes [] = { "pl", "pm", NULL }; static const char *Perl_interpreters [] = { "perl", "@PERL@", NULL }; static const char Perl_help [] = "In Perl code, the tags are the packages, subroutines and variables\n\ defined by the 'package', 'sub', 'my' and 'local' keywords. Use\n\ '--globals' if you want to tag global variables. Tags for\n\ subroutines are named 'PACKAGE::SUB'. The name for subroutines\n\ defined in the default package is 'main::SUB'."; static const char *PHP_suffixes [] = { "php", "php3", "php4", NULL }; static const char PHP_help [] = "In PHP code, tags are functions, classes and defines. Unless you use\n\ the '--no-members' option, vars are tags too."; static const char *plain_C_suffixes [] = { "pc", /* Pro*C file */ NULL }; static const char *PS_suffixes [] = { "ps", "psw", NULL }; /* .psw is for PSWrap */ static const char PS_help [] = "In PostScript code, the tags are the functions."; static const char *Prolog_suffixes [] = { "prolog", NULL }; static const char Prolog_help [] = "In Prolog code, tags are predicates and rules at the beginning of\n\ line."; static const char *Prolog_interpreters [] = { "gprolog", "pl", "yap", "swipl", "prolog", NULL }; static const char *Python_suffixes [] = { "py", NULL }; static const char Python_help [] = "In Python code, 'def' or 'class' at the beginning of a line\n\ generate a tag."; static const char *Python_interpreters [] = { "python", NULL }; static const char *Ruby_suffixes [] = { "rb", "ru", "rbw", NULL }; static const char *Ruby_filenames [] = { "Rakefile", "Thorfile", NULL }; static const char Ruby_help [] = "In Ruby code, 'def' or 'class' or 'module' at the beginning of\n\ a line generate a tag. Constants also generate a tag."; static const char *Ruby_interpreters [] = { "ruby", NULL }; static const char *Rust_suffixes [] = { "rs", NULL }; static const char Rust_help [] = "In Rust code, tags anything defined with 'fn', 'enum', \n\ 'struct' or 'macro_rules!'."; /* Can't do the `SCM' or `scm' prefix with a version number. */ static const char *Scheme_suffixes [] = { "oak", "sch", "scheme", "SCM", "scm", "SM", "sm", "ss", "t", NULL }; static const char Scheme_help [] = "In Scheme code, tags include anything defined with 'def' or with a\n\ construct whose name starts with 'def'. They also include\n\ variables set with 'set!' at top level in the file."; static const char *TeX_suffixes [] = { "bib", "clo", "cls", "ltx", "sty", "TeX", "tex", NULL }; static const char TeX_help [] = "In LaTeX text, the argument of any of the commands '\\chapter',\n\ '\\section', '\\subsection', '\\subsubsection', '\\eqno', '\\label',\n\ '\\ref', '\\cite', '\\bibitem', '\\part', '\\appendix', '\\entry',\n\ '\\index', '\\def', '\\newcommand', '\\renewcommand',\n\ '\\newenvironment' or '\\renewenvironment' is a tag.\n\ \n\ Other commands can be specified by setting the environment variable\n\ 'TEXTAGS' to a colon-separated list like, for example,\n\ TEXTAGS=\"mycommand:myothercommand\"."; static const char *Texinfo_suffixes [] = { "texi", "texinfo", "txi", NULL }; static const char Texinfo_help [] = "for texinfo files, lines starting with @node are tagged."; static const char *Yacc_suffixes [] = { "y", "y++", "ym", "yxx", "yy", NULL }; /* .ym is Objective yacc file */ static const char Yacc_help [] = "In Bison or Yacc input files, each rule defines as a tag the\n\ nonterminal it constructs. The portions of the file that contain\n\ C code are parsed as C code (use --help --lang=c --lang=yacc\n\ for full help)."; static const char auto_help [] = "'auto' is not a real language, it indicates to use\n\ a default language for files base on file name suffix and file contents."; static const char none_help [] = "'none' is not a real language, it indicates to only do\n\ regexp processing on files."; static const char no_lang_help [] = "No detailed help available for this language."; /* * Table of languages. * * It is ok for a given function to be listed under more than one * name. I just didn't. */ static language lang_names [] = { { "ada", Ada_help, Ada_funcs, Ada_suffixes }, { "asm", Asm_help, Asm_labels, Asm_suffixes }, { "c", default_C_help, default_C_entries, default_C_suffixes }, { "c++", Cplusplus_help, Cplusplus_entries, Cplusplus_suffixes }, { "c*", no_lang_help, Cstar_entries, Cstar_suffixes }, { "cobol", Cobol_help, Cobol_paragraphs, Cobol_suffixes }, { "erlang", Erlang_help, Erlang_functions, Erlang_suffixes, NULL, Erlang_interpreters }, { "forth", Forth_help, Forth_words, Forth_suffixes }, { "fortran", Fortran_help, Fortran_functions, Fortran_suffixes }, { "go", Go_help, Go_functions, Go_suffixes }, { "html", HTML_help, HTML_labels, HTML_suffixes }, { "java", Cjava_help, Cjava_entries, Cjava_suffixes }, { "lisp", Lisp_help, Lisp_functions, Lisp_suffixes }, { "lua", Lua_help,Lua_functions,Lua_suffixes,NULL,Lua_interpreters}, { "makefile", Makefile_help,Makefile_targets,NULL,Makefile_filenames}, /* objc listed before mercury as it is a better default for .m extensions. */ { "objc", Objc_help, plain_C_entries, Objc_suffixes }, { "mercury", Mercury_help, Mercury_functions, Mercury_suffixes }, { "pascal", Pascal_help, Pascal_functions, Pascal_suffixes }, { "perl",Perl_help,Perl_functions,Perl_suffixes,NULL,Perl_interpreters}, { "php", PHP_help, PHP_functions, PHP_suffixes }, { "postscript",PS_help, PS_functions, PS_suffixes }, { "proc", no_lang_help, plain_C_entries, plain_C_suffixes }, { "prolog", Prolog_help, Prolog_functions, Prolog_suffixes, NULL, Prolog_interpreters }, { "python", Python_help, Python_functions, Python_suffixes, NULL, Python_interpreters }, { "ruby", Ruby_help, Ruby_functions, Ruby_suffixes, Ruby_filenames, Ruby_interpreters }, { "rust", Rust_help, Rust_entries, Rust_suffixes }, { "scheme", Scheme_help, Scheme_functions, Scheme_suffixes }, { "tex", TeX_help, TeX_commands, TeX_suffixes }, { "texinfo", Texinfo_help, Texinfo_nodes, Texinfo_suffixes }, { "yacc", Yacc_help,Yacc_entries,Yacc_suffixes,NULL,NULL,true}, { "auto", auto_help }, /* default guessing scheme */ { "none", none_help, just_read_file }, /* regexp matching only */ { NULL } /* end of list */ }; static void print_language_names (void) { language *lang; const char **name, **ext; puts ("\nThese are the currently supported languages, along with the\n\ default file names and dot suffixes:"); for (lang = lang_names; lang->name != NULL; lang++) { printf (" %-*s", 10, lang->name); if (lang->filenames != NULL) for (name = lang->filenames; *name != NULL; name++) printf (" %s", *name); if (lang->suffixes != NULL) for (ext = lang->suffixes; *ext != NULL; ext++) printf (" .%s", *ext); puts (""); } puts ("where 'auto' means use default language for files based on file\n\ name suffix, and 'none' means only do regexp processing on files.\n\ If no language is specified and no matching suffix is found,\n\ the first line of the file is read for a sharp-bang (#!) sequence\n\ followed by the name of an interpreter. If no such sequence is found,\n\ Fortran is tried first; if no tags are found, C is tried next.\n\ When parsing any C file, a \"class\" or \"template\" keyword\n\ switches to C++."); puts ("Compressed files are supported using gzip, bzip2, xz, and zstd.\n\ \n\ For detailed help on a given language use, for example,\n\ etags --help --lang=ada."); } #if CTAGS # define PROGRAM_NAME "ctags" #else # define PROGRAM_NAME "etags" #endif static _Noreturn void print_version (void) { fputs ((PROGRAM_NAME " (" PACKAGE_NAME " " PACKAGE_VERSION ")\n" COPYRIGHT "\n" "This program is distributed under the terms in ETAGS.README\n"), stdout); exit (EXIT_SUCCESS); } #ifndef PRINT_UNDOCUMENTED_OPTIONS_HELP # define PRINT_UNDOCUMENTED_OPTIONS_HELP false #endif static _Noreturn void print_help (argument *argbuffer) { bool help_for_lang = false; for (; argbuffer->arg_type != at_end; argbuffer++) if (argbuffer->arg_type == at_language) { if (help_for_lang) puts (""); puts (argbuffer->lang->help); help_for_lang = true; } if (help_for_lang) exit (EXIT_SUCCESS); printf ("Usage: %s [options] [[regex-option ...] file-name] ...\n\ \n\ These are the options accepted by %s.\n", progname, progname); puts ("You may use unambiguous abbreviations for the long option names."); puts (" A - as file name means read names from stdin (one per line).\n\ Absolute names are stored in the output file as they are.\n\ Relative ones are stored relative to the output file's directory.\n"); puts ("-a, --append\n\ Append tag entries to existing tags file."); puts ("--packages-only\n\ For Ada files, only generate tags for packages."); if (CTAGS) puts ("-B, --backward-search\n\ Write the search commands for the tag entries using '?', the\n\ backward-search command instead of '/', the forward-search command."); /* This option is mostly obsolete, because etags can now automatically detect C++. Retained for backward compatibility and for debugging and experimentation. In principle, we could want to tag as C++ even before any "class" or "template" keyword. puts ("-C, --c++\n\ Treat files whose name suffix defaults to C language as C++ files."); */ puts ("--declarations\n\ In C and derived languages, create tags for function declarations,"); if (CTAGS) puts ("\tand create tags for extern variables if --globals is used."); else puts ("\tand create tags for extern variables unless --no-globals is used."); puts ("In Mercury, tag both declarations starting a line with ':-' and first\n\ predicates or functions in clauses."); if (CTAGS) puts ("-d, --defines\n\ Create tag entries for C #define constants and enum constants, too."); else puts ("-D, --no-defines\n\ Don't create tag entries for C #define constants and enum constants.\n\ This makes the tags file smaller."); if (!CTAGS) puts ("-i FILE, --include=FILE\n\ Include a note in tag file indicating that, when searching for\n\ a tag, one should also consult the tags file FILE after\n\ checking the current file."); puts ("-l LANG, --language=LANG\n\ Force the following files to be considered as written in the\n\ named language up to the next --language=LANG option."); if (CTAGS) puts ("--globals\n\ Create tag entries for global variables in some languages."); else puts ("--no-globals\n\ Do not create tag entries for global variables in some\n\ languages. This makes the tags file smaller."); puts ("--no-line-directive\n\ Ignore #line preprocessor directives in C and derived languages."); if (CTAGS) puts ("--members\n\ Create tag entries for members of structures in some languages."); else puts ("--no-members\n\ Do not create tag entries for members of structures\n\ in some languages."); puts ("-Q, --class-qualify\n\ Qualify tag names with their class name in C++, ObjC, Java, and Perl.\n\ This produces tag names of the form \"class::member\" for C++,\n\ \"class(category)\" for Objective C, and \"class.member\" for Java.\n\ For Objective C, this also produces class methods qualified with\n\ their arguments, as in \"foo:bar:baz:more\".\n\ For Perl, this produces \"package::member\"."); puts ("-r REGEXP, --regex=REGEXP or --regex=@regexfile\n\ Make a tag for each line matching a regular expression pattern\n\ in the following files. {LANGUAGE}REGEXP uses REGEXP for LANGUAGE\n\ files only. REGEXFILE is a file containing one REGEXP per line.\n\ REGEXP takes the form /TAGREGEXP/TAGNAME/MODS, where TAGNAME/ is\n\ optional. The TAGREGEXP pattern is anchored (as if preceded by ^)."); puts (" If TAGNAME/ is present, the tags created are named.\n\ For example Tcl named tags can be created with:\n\ --regex=\"/proc[ \\t]+\\([^ \\t]+\\)/\\1/.\".\n\ MODS are optional one-letter modifiers: 'i' means to ignore case,\n\ 'm' means to allow multi-line matches, 's' implies 'm' and\n\ causes dot to match any character, including newline."); puts ("-R, --no-regex\n\ Don't create tags from regexps for the following files."); puts ("-I, --ignore-indentation\n\ In C and C++ do not assume that a closing brace in the first\n\ column is the final brace of a function or structure definition."); puts ("-o FILE, --output=FILE\n\ Write the tags to FILE."); puts ("--parse-stdin=NAME\n\ Read from standard input and record tags as belonging to file NAME."); if (CTAGS) { puts ("-t, --typedefs\n\ Generate tag entries for C and Ada typedefs."); puts ("-T, --typedefs-and-c++\n\ Generate tag entries for C typedefs, C struct/enum/union tags,\n\ and C++ member functions."); } if (CTAGS) puts ("-u, --update\n\ Update the tag entries for the given files, leaving tag\n\ entries for other files in place. Currently, this is\n\ implemented by deleting the existing entries for the given\n\ files and then rewriting the new entries at the end of the\n\ tags file. It is often faster to simply rebuild the entire\n\ tag file than to use this."); if (CTAGS) { puts ("-v, --vgrind\n\ Print on the standard output an index of items intended for\n\ human consumption, similar to the output of vgrind. The index\n\ is sorted, and gives the page number of each item."); if (PRINT_UNDOCUMENTED_OPTIONS_HELP) puts ("-w, --no-duplicates\n\ Do not create duplicate tag entries, for compatibility with\n\ traditional ctags."); if (PRINT_UNDOCUMENTED_OPTIONS_HELP) puts ("-w, --no-warn\n\ Suppress warning messages about duplicate tag entries."); puts ("-x, --cxref\n\ Like --vgrind, but in the style of cxref, rather than vgrind.\n\ The output uses line numbers instead of page numbers, but\n\ beyond that the differences are cosmetic; try both to see\n\ which you like."); } puts ("-V, --version\n\ Print the version of the program.\n\ -h, --help\n\ Print this help message.\n\ Followed by one or more '--language' options prints detailed\n\ help about tag generation for the specified languages."); print_language_names (); puts (""); puts ("Report bugs to bug-gnu-emacs@gnu.org"); exit (EXIT_SUCCESS); } int main (int argc, char **argv) { int i; int nincluded_files; char **included_files; argument *argbuffer; int current_arg, file_count; linebuffer filename_lb; bool help_asked = false; ptrdiff_t len; char *optstring; int opt; progname = argv[0]; nincluded_files = 0; included_files = xnew (argc, char *); current_arg = 0; file_count = 0; /* Allocate enough no matter what happens. Overkill, but each one is small. */ argbuffer = xnew (argc, argument); /* * Always find typedefs and structure tags. * Also default to find macro constants, enum constants, struct * members and global variables. Do it for both etags and ctags. */ typedefs = typedefs_or_cplusplus = constantypedefs = true; globals = members = true; /* When the optstring begins with a '-' getopt_long does not rearrange the non-options arguments to be at the end, but leaves them alone. */ optstring = concat ("-ac:Cf:Il:o:Qr:RSVhH", (CTAGS) ? "BxdtTuvw" : "Di:", ""); while ((opt = getopt_long (argc, argv, optstring, longopts, NULL)) != EOF) switch (opt) { case 0: /* If getopt returns 0, then it has already processed a long-named option. We should do nothing. */ break; case 1: /* This means that a file name has been seen. Record it. */ argbuffer[current_arg].arg_type = at_filename; argbuffer[current_arg].what = optarg; len = strlen (optarg); if (whatlen_max < len) whatlen_max = len; ++current_arg; ++file_count; break; case STDIN: /* Parse standard input. Idea by Vivek . */ argbuffer[current_arg].arg_type = at_stdin; argbuffer[current_arg].what = optarg; len = strlen (optarg); if (whatlen_max < len) whatlen_max = len; ++current_arg; ++file_count; if (parsing_stdin) fatal ("cannot parse standard input more than once"); parsing_stdin = true; break; /* Common options. */ case 'a': append_to_tagfile = true; break; case 'C': cplusplus = true; break; case 'f': /* for compatibility with old makefiles */ case 'o': if (tagfile) { error ("-o option may only be given once."); suggest_asking_for_help (); } tagfile = optarg; break; case 'I': case 'S': /* for backward compatibility */ ignoreindent = true; break; case 'l': { language *lang = get_language_from_langname (optarg); if (lang != NULL) { argbuffer[current_arg].lang = lang; argbuffer[current_arg].arg_type = at_language; ++current_arg; } } break; case 'c': /* Backward compatibility: support obsolete --ignore-case-regexp. */ optarg = concat (optarg, "i", ""); /* memory leak here */ FALLTHROUGH; case 'r': argbuffer[current_arg].arg_type = at_regexp; argbuffer[current_arg].what = optarg; len = strlen (optarg); if (whatlen_max < len) whatlen_max = len; ++current_arg; break; case 'R': argbuffer[current_arg].arg_type = at_regexp; argbuffer[current_arg].what = NULL; ++current_arg; break; case 'V': print_version (); break; case 'h': case 'H': help_asked = true; break; case 'Q': class_qualify = 1; break; /* Etags options */ case 'D': constantypedefs = false; break; case 'i': included_files[nincluded_files++] = optarg; break; /* Ctags options. */ case 'B': searchar = '?'; break; case 'd': constantypedefs = true; break; case 't': typedefs = true; break; case 'T': typedefs = typedefs_or_cplusplus = true; break; case 'u': update = true; break; case 'v': vgrind_style = true; FALLTHROUGH; case 'x': cxref_style = true; break; case 'w': no_warnings = true; break; default: suggest_asking_for_help (); } /* No more options. Store the rest of arguments. */ for (; optind < argc; optind++) { argbuffer[current_arg].arg_type = at_filename; argbuffer[current_arg].what = argv[optind]; len = strlen (argv[optind]); if (whatlen_max < len) whatlen_max = len; ++current_arg; ++file_count; } argbuffer[current_arg].arg_type = at_end; if (help_asked) print_help (argbuffer); if (nincluded_files == 0 && file_count == 0) { error ("no input files specified."); suggest_asking_for_help (); } if (tagfile == NULL) tagfile = savestr (CTAGS ? "tags" : "TAGS"); cwd = etags_getcwd (); /* the current working directory */ if (cwd[strlen (cwd) - 1] != '/') { char *oldcwd = cwd; cwd = concat (oldcwd, "/", ""); free (oldcwd); } /* Compute base directory for relative file names. */ if (streq (tagfile, "-") || strneq (tagfile, "/dev/", 5)) tagfiledir = cwd; /* relative file names are relative to cwd */ else { canonicalize_filename (tagfile); tagfiledir = absolute_dirname (tagfile, cwd); } linebuffer_init (&lb); linebuffer_init (&filename_lb); linebuffer_init (&filebuf); linebuffer_init (&token_name); if (!CTAGS) { if (streq (tagfile, "-")) { tagf = stdout; set_binary_mode (STDOUT_FILENO, O_BINARY); } else tagf = fopen (tagfile, append_to_tagfile ? "ab" : "wb"); if (tagf == NULL) pfatal (tagfile); } /* * Loop through files finding functions. */ for (i = 0; i < current_arg; i++) { static language *lang; /* non-NULL if language is forced */ char *this_file; switch (argbuffer[i].arg_type) { case at_language: lang = argbuffer[i].lang; break; case at_regexp: analyze_regex (argbuffer[i].what); break; case at_filename: this_file = argbuffer[i].what; /* Input file named "-" means read file names from stdin (one per line) and use them. */ if (streq (this_file, "-")) { if (parsing_stdin) fatal ("cannot parse standard input " "AND read file names from it"); while (readline_internal (&filename_lb, stdin, "-") > 0) process_file_name (filename_lb.buffer, lang); } else process_file_name (this_file, lang); break; case at_stdin: this_file = argbuffer[i].what; process_file (stdin, this_file, lang); break; default: error ("internal error: arg_type"); } } free_regexps (); free (lb.buffer); free (filebuf.buffer); free (token_name.buffer); if (!CTAGS || cxref_style) { /* Write the remaining tags to tagf (ETAGS) or stdout (CXREF). */ put_entries (nodehead); free_tree (nodehead); nodehead = NULL; if (!CTAGS) { fdesc *fdp; /* Output file entries that have no tags. */ for (fdp = fdhead; fdp != NULL; fdp = fdp->next) if (!fdp->written) fprintf (tagf, "\f\n%s,0\n", fdp->taggedfname); while (nincluded_files-- > 0) fprintf (tagf, "\f\n%s,include\n", *included_files++); if (fclose (tagf) == EOF) pfatal (tagfile); } return EXIT_SUCCESS; } /* From here on, we are in (CTAGS && !cxref_style) */ if (update) { char *cmd = xmalloc (strlen (tagfile) + whatlen_max + sizeof "mv..OTAGS;grep -Fv '\t\t' OTAGS >;rm OTAGS"); for (i = 0; i < current_arg; ++i) { switch (argbuffer[i].arg_type) { case at_filename: case at_stdin: break; default: continue; /* the for loop */ } if ( filename_has_shell_str (argbuffer[i].what) ) { printf ("Warning, ignore this file: %s\n", argbuffer[i].what); continue; } char *z = stpcpy (cmd, "mv "); z = stpcpy (z, tagfile); z = stpcpy (z, " OTAGS;grep -Fv '\t"); z = stpcpy (z, argbuffer[i].what); z = stpcpy (z, "\t' OTAGS >"); z = stpcpy (z, tagfile); strcpy (z, ";rm OTAGS"); if (system (cmd) != EXIT_SUCCESS) fatal ("failed to execute shell command"); } free (cmd); append_to_tagfile = true; } tagf = fopen (tagfile, append_to_tagfile ? "ab" : "wb"); if (tagf == NULL) pfatal (tagfile); put_entries (nodehead); /* write all the tags (CTAGS) */ free_tree (nodehead); nodehead = NULL; if (fclose (tagf) == EOF) pfatal (tagfile); if (CTAGS) if (append_to_tagfile || update) { char *cmd = xmalloc (2 * strlen (tagfile) + sizeof "sort -u -o.."); /* Maybe these should be used: setenv ("LC_COLLATE", "C", 1); setenv ("LC_ALL", "C", 1); */ char *z = stpcpy (cmd, "sort -u -o "); z = stpcpy (z, tagfile); *z++ = ' '; strcpy (z, tagfile); return system (cmd); } return EXIT_SUCCESS; } /* * Return a compressor given the file name. If EXTPTR is non-zero, * return a pointer into FILE where the compressor-specific * extension begins. If no compressor is found, NULL is returned * and EXTPTR is not significant. * Idea by Vladimir Alexiev (1998) */ static compressor * get_compressor_from_suffix (char *file, char **extptr) { compressor *compr; char *slash, *suffix; /* File has been processed by canonicalize_filename, so we don't need to consider backslashes on DOS_NT. */ slash = strrchr (file, '/'); suffix = strrchr (file, '.'); if (suffix == NULL || suffix < slash) return NULL; if (extptr != NULL) *extptr = suffix; suffix += 1; /* Let those poor souls who live with DOS 8+3 file name limits get some solace by treating foo.cgz as if it were foo.c.gz, etc. Only the first do loop is run if not MSDOS */ do { for (compr = compressors; compr->suffix != NULL; compr++) if (streq (compr->suffix, suffix)) return compr; if (!MSDOS) break; /* do it only once: not really a loop */ if (extptr != NULL) *extptr = ++suffix; } while (*suffix != '\0'); return NULL; } /* * Return a language given the name. */ static language * get_language_from_langname (const char *name) { language *lang; if (name == NULL) error ("empty language name"); else { for (lang = lang_names; lang->name != NULL; lang++) if (streq (name, lang->name)) return lang; error ("unknown language \"%s\"", name); } return NULL; } /* * Return a language given the interpreter name. */ static language * get_language_from_interpreter (char *interpreter) { language *lang; const char **iname; if (interpreter == NULL) return NULL; for (lang = lang_names; lang->name != NULL; lang++) if (lang->interpreters != NULL) for (iname = lang->interpreters; *iname != NULL; iname++) if (streq (*iname, interpreter)) return lang; return NULL; } /* * Return a language given the file name. */ static language * get_language_from_filename (char *file, bool case_sensitive) { language *lang; const char **name, **ext, *suffix; char *slash; /* Try whole file name first. */ slash = strrchr (file, '/'); if (slash != NULL) file = slash + 1; #ifdef DOS_NT else if (file[0] && file[1] == ':') file += 2; #endif for (lang = lang_names; lang->name != NULL; lang++) if (lang->filenames != NULL) for (name = lang->filenames; *name != NULL; name++) if ((case_sensitive) ? streq (*name, file) : strcaseeq (*name, file)) return lang; /* If not found, try suffix after last dot. */ suffix = strrchr (file, '.'); if (suffix == NULL) return NULL; suffix += 1; for (lang = lang_names; lang->name != NULL; lang++) if (lang->suffixes != NULL) for (ext = lang->suffixes; *ext != NULL; ext++) if ((case_sensitive) ? streq (*ext, suffix) : strcaseeq (*ext, suffix)) return lang; return NULL; } /* * This routine is called on each file argument. */ static void process_file_name (char *file, language *lang) { FILE *inf; fdesc *fdp; compressor *compr; char *compressed_name, *uncompressed_name; char *ext, *real_name UNINIT, *tmp_name UNINIT; int retval; canonicalize_filename (file); if (streq (file, tagfile) && !streq (tagfile, "-")) { error ("skipping inclusion of %s in self.", file); return; } compr = get_compressor_from_suffix (file, &ext); if (compr) { compressed_name = file; uncompressed_name = savenstr (file, ext - file); } else { compressed_name = NULL; uncompressed_name = file; } /* If the canonicalized uncompressed name has already been dealt with, skip it silently. */ for (fdp = fdhead; fdp != NULL; fdp = fdp->next) { assert (fdp->infname != NULL); if (streq (uncompressed_name, fdp->infname)) goto cleanup; } inf = fopen (file, "r" FOPEN_BINARY); if (inf) real_name = file; else { int file_errno = errno; if (compressed_name) { /* Try with the given suffix. */ inf = fopen (uncompressed_name, "r" FOPEN_BINARY); if (inf) real_name = uncompressed_name; } else { /* Try all possible suffixes. */ for (compr = compressors; compr->suffix != NULL; compr++) { compressed_name = concat (file, ".", compr->suffix); inf = fopen (compressed_name, "r" FOPEN_BINARY); if (inf) { real_name = compressed_name; break; } if (MSDOS) { char *suf = compressed_name + strlen (file); size_t suflen = strlen (compr->suffix) + 1; for ( ; suf[1]; suf++, suflen--) { memmove (suf, suf + 1, suflen); inf = fopen (compressed_name, "r" FOPEN_BINARY); if (inf) { real_name = compressed_name; break; } } if (inf) break; } free (compressed_name); compressed_name = NULL; } } if (! inf) { errno = file_errno; perror (file); goto cleanup; } } if (real_name == compressed_name) { fclose (inf); tmp_name = etags_mktmp (); if (!tmp_name) inf = NULL; else { #if MSDOS || defined (DOS_NT) char *cmd1 = concat (compr->command, " \"", real_name); char *cmd = concat (cmd1, "\" > ", tmp_name); #else char *cmd1 = concat (compr->command, " '", real_name); char *cmd = concat (cmd1, "' > ", tmp_name); #endif free (cmd1); inf = (system (cmd) == -1 ? NULL : fopen (tmp_name, "r" FOPEN_BINARY)); free (cmd); } if (!inf) { perror (real_name); goto cleanup; } } process_file (inf, uncompressed_name, lang); retval = fclose (inf); if (real_name == compressed_name) { remove (tmp_name); free (tmp_name); } if (retval < 0) pfatal (file); cleanup: if (compressed_name != file) free (compressed_name); if (uncompressed_name != file) free (uncompressed_name); last_node = NULL; curfdp = NULL; return; } static void process_file (FILE *fh, char *fn, language *lang) { static const fdesc emptyfdesc; fdesc *fdp; infilename = fn; /* Create a new input file description entry. */ fdp = xnew (1, fdesc); *fdp = emptyfdesc; fdp->next = fdhead; fdp->infname = savestr (fn); fdp->lang = lang; fdp->infabsname = absolute_filename (fn, cwd); fdp->infabsdir = absolute_dirname (fn, cwd); if (filename_is_absolute (fn)) { /* An absolute file name. Canonicalize it. */ fdp->taggedfname = absolute_filename (fn, NULL); } else { /* A file name relative to cwd. Make it relative to the directory of the tags file. */ fdp->taggedfname = relative_filename (fn, tagfiledir); } fdp->usecharno = true; /* use char position when making tags */ fdp->prop = NULL; fdp->written = false; /* not written on tags file yet */ fdhead = fdp; curfdp = fdhead; /* the current file description */ find_entries (fh); /* If not Ctags, and if this is not metasource and if it contained no #line directives, we can write the tags and free all nodes pointing to curfdp. */ if (!CTAGS && curfdp->usecharno /* no #line directives in this file */ && !curfdp->lang->metasource) { node *np, *prev; /* Look for the head of the sublist relative to this file. See add_node for the structure of the node tree. */ prev = NULL; for (np = nodehead; np != NULL; prev = np, np = np->left) if (np->fdp == curfdp) break; /* If we generated tags for this file, write and delete them. */ if (np != NULL) { /* This is the head of the last sublist, if any. The following instructions depend on this being true. */ assert (np->left == NULL); assert (fdhead == curfdp); assert (last_node->fdp == curfdp); put_entries (np); /* write tags for file curfdp->taggedfname */ free_tree (np); /* remove the written nodes */ if (prev == NULL) nodehead = NULL; /* no nodes left */ else prev->left = NULL; /* delete the pointer to the sublist */ } } } static void reset_input (FILE *inf) { if (fseek (inf, 0, SEEK_SET) != 0) perror (infilename); } /* * This routine opens the specified file and calls the function * which finds the function and type definitions. */ static void find_entries (FILE *inf) { char *cp; language *lang = curfdp->lang; Lang_function *parser = NULL; /* If user specified a language, use it. */ if (lang != NULL && lang->function != NULL) { parser = lang->function; } /* Else try to guess the language given the file name. */ if (parser == NULL) { lang = get_language_from_filename (curfdp->infname, true); /* Disambiguate file names between Objc and Mercury. */ if (lang != NULL && strcmp (lang->name, "objc") == 0) test_objc_is_mercury (curfdp->infname, &lang); if (lang != NULL && lang->function != NULL) { curfdp->lang = lang; parser = lang->function; } } /* Else look for sharp-bang as the first two characters. */ if (parser == NULL && readline_internal (&lb, inf, infilename) > 0 && lb.len >= 2 && lb.buffer[0] == '#' && lb.buffer[1] == '!') { char *lp; /* Set lp to point at the first char after the last slash in the line or, if no slashes, at the first nonblank. Then set cp to the first successive blank and terminate the string. */ lp = strrchr (lb.buffer+2, '/'); if (lp != NULL) lp += 1; else lp = skip_spaces (lb.buffer + 2); cp = skip_non_spaces (lp); /* If the "interpreter" turns out to be "env", the real interpreter is the next word. */ if (cp > lp && strneq (lp, "env", cp - lp)) { lp = skip_spaces (cp); cp = skip_non_spaces (lp); } *cp = '\0'; if (*lp) { lang = get_language_from_interpreter (lp); if (lang != NULL && lang->function != NULL) { curfdp->lang = lang; parser = lang->function; } } } reset_input (inf); /* Else try to guess the language given the case insensitive file name. */ if (parser == NULL) { lang = get_language_from_filename (curfdp->infname, false); if (lang != NULL && lang->function != NULL) { curfdp->lang = lang; parser = lang->function; } } /* Else try Fortran or C. */ if (parser == NULL) { node *old_last_node = last_node; curfdp->lang = get_language_from_langname ("fortran"); find_entries (inf); if (old_last_node == last_node) /* No Fortran entries found. Try C. */ { reset_input (inf); curfdp->lang = get_language_from_langname (cplusplus ? "c++" : "c"); find_entries (inf); } return; } if (!no_line_directive && curfdp->lang != NULL && curfdp->lang->metasource) /* It may be that this is a bingo.y file, and we already parsed a bingo.c file, or anyway we parsed a file that is automatically generated from this one. If this is the case, the bingo.c file contained #line directives that generated tags pointing to this file. Let's delete them all before parsing this file, which is the real source. */ { fdesc **fdpp = &fdhead; while (*fdpp != NULL) if (*fdpp != curfdp && streq ((*fdpp)->taggedfname, curfdp->taggedfname)) /* We found one of those! We must delete both the file description and all tags referring to it. */ { fdesc *badfdp = *fdpp; /* Delete the tags referring to badfdp->taggedfname that were obtained from badfdp->infname. */ invalidate_nodes (badfdp, &nodehead); *fdpp = badfdp->next; /* remove the bad description from the list */ free_fdesc (badfdp); } else fdpp = &(*fdpp)->next; /* advance the list pointer */ } assert (parser != NULL); /* Generic initializations before reading from file. */ linebuffer_setlen (&filebuf, 0); /* reset the file buffer */ /* Generic initializations before parsing file with readline. */ lineno = 0; /* reset global line number */ charno = 0; /* reset global char number */ linecharno = 0; /* reset global char number of line start */ parser (inf); regex_tag_multiline (); } /* * Check whether an implicitly named tag should be created, * then call `pfnote'. * NAME is a string that is internally copied by this function. * * TAGS format specification * Idea by Sam Kendall (1997) * The following is explained in some more detail in etc/ETAGS.EBNF. * * make_tag creates tags with "implicit tag names" (unnamed tags) * if the following are all true, assuming NONAM=" \f\t\n\r()=,;": * 1. NAME does not contain any of the characters in NONAM; * 2. LINESTART contains name as either a rightmost, or rightmost but * one character, substring; * 3. the character, if any, immediately before NAME in LINESTART must * be a character in NONAM; * 4. the character, if any, immediately after NAME in LINESTART must * also be a character in NONAM. * * The implementation uses the notinname() macro, which recognizes the * characters stored in the string `nonam'. * etags.el needs to use the same characters that are in NONAM. */ static void make_tag (const char *name, /* tag name, or NULL if unnamed */ ptrdiff_t namelen, /* tag length */ bool is_func, /* tag is a function */ char *linestart, /* start of the line where tag is */ ptrdiff_t linelen, /* length of the line where tag is */ intmax_t lno, /* line number */ intmax_t cno) /* character number */ { bool named = (name != NULL && namelen > 0); char *nname = NULL; if (debug) fprintf (stderr, "%s on %s:%"PRIdMAX": %s\n", named ? name : "(unnamed)", curfdp->taggedfname, lno, linestart); if (!CTAGS && named) /* maybe set named to false */ /* Let's try to make an implicit tag name, that is, create an unnamed tag such that etags.el can guess a name from it. */ { ptrdiff_t i; const char *cp = name; for (i = 0; i < namelen; i++) if (notinname (*cp++)) break; if (i == namelen) /* rule #1 */ { cp = linestart + linelen - namelen; if (notinname (linestart[linelen-1])) cp -= 1; /* rule #4 */ if (cp >= linestart /* rule #2 */ && (cp == linestart || notinname (cp[-1])) /* rule #3 */ && strneq (name, cp, namelen)) /* rule #2 */ named = false; /* use implicit tag name */ } } if (named) nname = savenstr (name, namelen); pfnote (nname, is_func, linestart, linelen, lno, cno); } /* Record a tag. */ static void pfnote (char *name, /* tag name, or NULL if unnamed */ bool is_func, /* tag is a function */ char *linestart, /* start of the line where tag is */ ptrdiff_t linelen, /* length of the line where tag is */ intmax_t lno, /* line number */ intmax_t cno) /* character number */ { register node *np; if ((CTAGS && name == NULL) /* We used to have an assertion here for the case below, but if we hit that case, it just means our parser got confused, and there's nothing to do about such empty "tags". */ || (!CTAGS && name && name[0] == '\0')) return; np = xnew (1, node); /* If ctags mode, change name "main" to M. */ if (CTAGS && !cxref_style && streq (name, "main")) { char *fp = strrchr (curfdp->taggedfname, '/'); np->name = concat ("M", fp == NULL ? curfdp->taggedfname : fp + 1, ""); fp = strrchr (np->name, '.'); if (fp != NULL && fp[1] != '\0' && fp[2] == '\0') fp[0] = '\0'; } else np->name = name; np->valid = true; np->been_warned = false; np->fdp = curfdp; np->is_func = is_func; np->lno = lno; if (np->fdp->usecharno) /* Our char numbers are 0-base, because of C language tradition? ctags compatibility? old versions compatibility? I don't know. Anyway, since emacs's are 1-base we expect etags.el to take care of the difference. If we wanted to have 1-based numbers, we would uncomment the +1 below. */ np->cno = cno /* + 1 */ ; else np->cno = invalidcharno; np->left = np->right = NULL; if (CTAGS && !cxref_style) { if (strnlen (linestart, 50) < 50) np->regex = concat (linestart, "$", ""); else np->regex = savenstr (linestart, 50); } else np->regex = savenstr (linestart, linelen); add_node (np, &nodehead); } /* * Utility functions and data to avoid recursion. */ typedef struct stack_entry { node *np; struct stack_entry *next; } stkentry; static void push_node (node *np, stkentry **stack_top) { if (np) { stkentry *new = xnew (1, stkentry); new->np = np; new->next = *stack_top; *stack_top = new; } } static node * pop_node (stkentry **stack_top) { node *ret = NULL; if (*stack_top) { stkentry *old_start = *stack_top; ret = (*stack_top)->np; *stack_top = (*stack_top)->next; free (old_start); } return ret; } /* * free_tree () * emulate recursion on left children, iterate on right children. */ static void free_tree (register node *np) { stkentry *stack = NULL; while (np) { /* Descent on left children. */ while (np->left) { push_node (np, &stack); np = np->left; } /* Free node without left children. */ node *node_right = np->right; free (np->name); free (np->regex); free (np); if (!node_right) { /* Backtrack to find a node with right children, while freeing nodes that don't have right children. */ while (node_right == NULL && (np = pop_node (&stack)) != NULL) { node_right = np->right; free (np->name); free (np->regex); free (np); } } /* Free right children. */ np = node_right; } } /* * free_fdesc () * delete a file description */ static void free_fdesc (register fdesc *fdp) { free (fdp->infname); free (fdp->infabsname); free (fdp->infabsdir); free (fdp->taggedfname); free (fdp->prop); free (fdp); } /* * add_node () * Adds a node to the tree of nodes. In etags mode, sort by file * name. In ctags mode, sort by tag name. Make no attempt at * balancing. * * add_node is the only function allowed to add nodes, so it can * maintain state. */ static void add_node (node *np, node **cur_node_p) { node *cur_node = *cur_node_p; /* Make the first node. */ if (cur_node == NULL) { *cur_node_p = np; last_node = np; return; } if (!CTAGS) /* Etags Mode */ { /* For each file name, tags are in a linked sublist on the right pointer. The first tags of different files are a linked list on the left pointer. last_node points to the end of the last used sublist. */ if (last_node != NULL && last_node->fdp == np->fdp) { /* Let's use the same sublist as the last added node. */ assert (last_node->right == NULL); last_node->right = np; last_node = np; } else { while (cur_node->fdp != np->fdp) { if (cur_node->left == NULL) break; /* The head of this sublist is not good for us. Let's try the next one. */ cur_node = cur_node->left; } if (cur_node->left) { /* Scanning the list we found the head of a sublist which is good for us. Let's scan this sublist. */ if (cur_node->right) { cur_node = cur_node->right; while (cur_node->right) cur_node = cur_node->right; } /* Make a new node in this sublist. */ cur_node->right = np; } else { /* Make a new sublist. */ cur_node->left = np; } last_node = np; } } /* if ETAGS mode */ else { /* Ctags Mode */ node **next_node = &cur_node; while ((cur_node = *next_node) != NULL) { int dif = strcmp (np->name, cur_node->name); /* * If this tag name matches an existing one, then * do not add the node, but maybe print a warning. */ if (!dif && no_duplicates) { if (np->fdp == cur_node->fdp) { if (!no_warnings) { fprintf (stderr, ("Duplicate entry in file %s, " "line %"PRIdMAX": %s\n"), np->fdp->infname, lineno, np->name); fprintf (stderr, "Second entry ignored\n"); } } else if (!cur_node->been_warned && !no_warnings) { fprintf (stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", np->fdp->infname, cur_node->fdp->infname, np->name); cur_node->been_warned = true; } return; } else next_node = dif < 0 ? &cur_node->left : &cur_node->right; } *next_node = np; last_node = np; } /* if CTAGS mode */ } /* * invalidate_nodes () * Scan the node tree and invalidate all nodes pointing to the * given file description (CTAGS case) or free them (ETAGS case). */ static void invalidate_nodes (fdesc *badfdp, node **npp) { node *np = *npp; stkentry *stack = NULL; if (CTAGS) { while (np) { /* Push all the left children on the stack. */ while (np->left != NULL) { push_node (np, &stack); np = np->left; } /* Invalidate this node. */ if (np->fdp == badfdp) np->valid = false; if (!np->right) { /* Pop nodes from stack, invalidating them, until we find one with a right child. */ while ((np = pop_node (&stack)) != NULL) { if (np->fdp == badfdp) np->valid = false; if (np->right != NULL) break; } } /* Process the right child, if any. */ if (np) np = np->right; } } else { node super_root, *np_parent = NULL; super_root.left = np; super_root.fdp = (fdesc *) -1; np = &super_root; while (np) { /* Descent on left children until node with BADFP. */ while (np && np->fdp != badfdp) { assert (np->fdp != NULL); np_parent = np; np = np->left; } if (np) { np_parent->left = np->left; /* detach subtree from the tree */ np->left = NULL; /* isolate it */ free_tree (np); /* free it */ /* Continue with rest of tree. */ np = np_parent->left; } } *npp = super_root.left; } } static ptrdiff_t total_size_of_entries (node *); static int number_len (intmax_t) ATTRIBUTE_CONST; /* Length of a non-negative number's decimal representation. */ static int number_len (intmax_t num) { int len = 1; while ((num /= 10) > 0) len += 1; return len; } /* * Return total number of characters that put_entries will output for * the nodes in the linked list at the right of the specified node. * This count is irrelevant with etags.el since emacs 19.34 at least, * but is still supplied for backward compatibility. */ static ptrdiff_t total_size_of_entries (node *np) { ptrdiff_t total = 0; for (; np != NULL; np = np->right) if (np->valid) { total += strlen (np->regex) + 1; /* pat\177 */ if (np->name != NULL) total += strlen (np->name) + 1; /* name\001 */ total += number_len (np->lno) + 1; /* lno, */ if (np->cno != invalidcharno) /* cno */ total += number_len (np->cno); total += 1; /* newline */ } return total; } static void put_entry (node *np) { register char *sp; static fdesc *fdp = NULL; /* Output this entry */ if (np->valid) { if (!CTAGS) { /* Etags mode */ if (fdp != np->fdp) { fdp = np->fdp; fprintf (tagf, "\f\n%s,%"PRIdPTR"\n", fdp->taggedfname, total_size_of_entries (np)); fdp->written = true; } fputs (np->regex, tagf); fputc ('\177', tagf); if (np->name != NULL) { fputs (np->name, tagf); fputc ('\001', tagf); } fprintf (tagf, "%"PRIdMAX",", np->lno); if (np->cno != invalidcharno) fprintf (tagf, "%"PRIdMAX, np->cno); fputs ("\n", tagf); } else { /* Ctags mode */ if (np->name == NULL) error ("internal error: NULL name in ctags mode."); if (cxref_style) { if (vgrind_style) fprintf (stdout, "%s %s %"PRIdMAX"\n", np->name, np->fdp->taggedfname, (np->lno + 63) / 64); else fprintf (stdout, "%-16s %3"PRIdMAX" %-16s %s\n", np->name, np->lno, np->fdp->taggedfname, np->regex); } else { fprintf (tagf, "%s\t%s\t", np->name, np->fdp->taggedfname); if (np->is_func) { /* function or #define macro with args */ putc (searchar, tagf); putc ('^', tagf); for (sp = np->regex; *sp; sp++) { if (*sp == '\\' || *sp == searchar) putc ('\\', tagf); putc (*sp, tagf); } putc (searchar, tagf); } else { /* anything else; text pattern inadequate */ fprintf (tagf, "%"PRIdMAX, np->lno); } putc ('\n', tagf); } } } /* if this node contains a valid tag */ } static void put_entries (node *np) { stkentry *stack = NULL; if (np == NULL) return; if (CTAGS) { while (np) { /* Stack subentries that precede this one. */ while (np->left) { push_node (np, &stack); np = np->left; } /* Output this subentry. */ put_entry (np); /* Stack subentries that follow this one. */ while (!np->right) { /* Output subentries that precede the next one. */ np = pop_node (&stack); if (!np) break; put_entry (np); } if (np) np = np->right; } } else { push_node (np, &stack); while ((np = pop_node (&stack)) != NULL) { /* Output this subentry. */ put_entry (np); while (np->right) { /* Output subentries that follow this one. */ put_entry (np->right); /* Stack subentries from the following files. */ push_node (np->left, &stack); np = np->right; } push_node (np->left, &stack); } } } /* C extensions. */ #define C_EXT 0x00fff /* C extensions */ #define C_PLAIN 0x00000 /* C */ #define C_PLPL 0x00001 /* C++ */ #define C_STAR 0x00003 /* C* */ #define C_JAVA 0x00005 /* JAVA */ #define C_AUTO 0x01000 /* C, but switch to C++ if `class' is met */ #define YACC 0x10000 /* yacc file */ /* * The C symbol tables. */ enum sym_type { st_none, st_C_objprot, st_C_objimpl, st_C_objend, st_C_gnumacro, st_C_ignore, st_C_attribute, st_C_enum_bf, st_C_javastruct, st_C_operator, st_C_class, st_C_template, st_C_struct, st_C_extern, st_C_enum, st_C_define, st_C_typedef }; /* Feed stuff between (but not including) %[ and %] lines to: gperf -m 5 %[ %compare-strncmp %enum %struct-type struct C_stab_entry { char *name; int c_ext; enum sym_type type; } %% if, 0, st_C_ignore for, 0, st_C_ignore while, 0, st_C_ignore switch, 0, st_C_ignore return, 0, st_C_ignore __attribute__, 0, st_C_attribute GTY, 0, st_C_attribute @interface, 0, st_C_objprot @protocol, 0, st_C_objprot @implementation,0, st_C_objimpl @end, 0, st_C_objend import, (C_JAVA & ~C_PLPL), st_C_ignore package, (C_JAVA & ~C_PLPL), st_C_ignore friend, C_PLPL, st_C_ignore extends, (C_JAVA & ~C_PLPL), st_C_javastruct implements, (C_JAVA & ~C_PLPL), st_C_javastruct interface, (C_JAVA & ~C_PLPL), st_C_struct class, 0, st_C_class namespace, C_PLPL, st_C_struct domain, C_STAR, st_C_struct union, 0, st_C_struct struct, 0, st_C_struct extern, 0, st_C_extern enum, 0, st_C_enum typedef, 0, st_C_typedef define, 0, st_C_define undef, 0, st_C_define operator, C_PLPL, st_C_operator template, 0, st_C_template # DEFUN used in emacs, the next three used in glibc (SYSCALL only for mach). DEFUN, 0, st_C_gnumacro SYSCALL, 0, st_C_gnumacro ENTRY, 0, st_C_gnumacro PSEUDO, 0, st_C_gnumacro ENUM_BF, 0, st_C_enum_bf # These are defined inside C functions, so currently they are not met. # EXFUN used in glibc, DEFVAR_* in emacs. #EXFUN, 0, st_C_gnumacro #DEFVAR_, 0, st_C_gnumacro %] and replace lines between %< and %> with its output, then: - remove the #if characterset check - remove any #line directives - make in_word_set static and not inline - remove any 'register' qualifications from variable decls. */ /*%<*/ /* C code produced by gperf version 3.0.1 */ /* Command-line: gperf -m 5 */ /* Computed positions: -k'2-3' */ struct C_stab_entry { const char *name; int c_ext; enum sym_type type; }; /* maximum key range = 34, duplicates = 0 */ static int hash (const char *str, int len) { static char const asso_values[] = { 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 3, 27, 36, 36, 36, 36, 36, 36, 36, 26, 36, 36, 36, 36, 25, 0, 0, 36, 36, 36, 0, 36, 36, 36, 36, 36, 1, 36, 16, 36, 6, 23, 0, 0, 36, 22, 0, 36, 36, 5, 0, 0, 15, 1, 36, 6, 36, 8, 19, 36, 16, 4, 5, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36 }; int hval = len; switch (hval) { default: hval += asso_values[(unsigned char) str[2]]; FALLTHROUGH; case 2: hval += asso_values[(unsigned char) str[1]]; break; } return hval; } static struct C_stab_entry * in_word_set (const char *str, ptrdiff_t len) { enum { TOTAL_KEYWORDS = 34, MIN_WORD_LENGTH = 2, MAX_WORD_LENGTH = 15, MIN_HASH_VALUE = 2, MAX_HASH_VALUE = 35 }; static struct C_stab_entry wordlist[] = { {""}, {""}, {"if", 0, st_C_ignore}, {"GTY", 0, st_C_attribute}, {"@end", 0, st_C_objend}, {"union", 0, st_C_struct}, {"define", 0, st_C_define}, {"import", (C_JAVA & ~C_PLPL), st_C_ignore}, {"template", 0, st_C_template}, {"operator", C_PLPL, st_C_operator}, {"@interface", 0, st_C_objprot}, {"implements", (C_JAVA & ~C_PLPL), st_C_javastruct}, {"friend", C_PLPL, st_C_ignore}, {"typedef", 0, st_C_typedef}, {"return", 0, st_C_ignore}, {"@implementation",0, st_C_objimpl}, {"@protocol", 0, st_C_objprot}, {"interface", (C_JAVA & ~C_PLPL), st_C_struct}, {"extern", 0, st_C_extern}, {"extends", (C_JAVA & ~C_PLPL), st_C_javastruct}, {"struct", 0, st_C_struct}, {"domain", C_STAR, st_C_struct}, {"switch", 0, st_C_ignore}, {"enum", 0, st_C_enum}, {"for", 0, st_C_ignore}, {"namespace", C_PLPL, st_C_struct}, {"class", 0, st_C_class}, {"while", 0, st_C_ignore}, {"undef", 0, st_C_define}, {"package", (C_JAVA & ~C_PLPL), st_C_ignore}, {"__attribute__", 0, st_C_attribute}, {"ENTRY", 0, st_C_gnumacro}, {"SYSCALL", 0, st_C_gnumacro}, {"ENUM_BF", 0, st_C_enum_bf}, {"PSEUDO", 0, st_C_gnumacro}, {"DEFUN", 0, st_C_gnumacro} }; if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) { int key = hash (str, len); if (key <= MAX_HASH_VALUE && key >= 0) { const char *s = wordlist[key].name; if (*str == *s && !strncmp (str + 1, s + 1, len - 1) && s[len] == '\0') return &wordlist[key]; } } return 0; } /*%>*/ static enum sym_type C_symtype (char *str, ptrdiff_t len, int c_ext) { struct C_stab_entry *se = in_word_set (str, len); if (se == NULL || (se->c_ext && !(c_ext & se->c_ext))) return st_none; return se->type; } /* * Ignoring __attribute__ ((list)) */ static bool inattribute; /* looking at an __attribute__ construct */ /* Ignoring ENUM_BF (type) * */ static bool in_enum_bf; /* inside parentheses following ENUM_BF */ /* * C functions and variables are recognized using a simple * finite automaton. fvdef is its state variable. */ static enum { fvnone, /* nothing seen */ fdefunkey, /* Emacs DEFUN keyword seen */ fdefunname, /* Emacs DEFUN name seen */ foperator, /* func: operator keyword seen (cplpl) */ fvnameseen, /* function or variable name seen */ fstartlist, /* func: just after open parenthesis */ finlist, /* func: in parameter list */ flistseen, /* func: after parameter list */ fignore, /* func: before open brace */ vignore /* var-like: ignore until ';' */ } fvdef; static bool fvextern; /* func or var: extern keyword seen; */ /* * typedefs are recognized using a simple finite automaton. * typdef is its state variable. */ static enum { tnone, /* nothing seen */ tkeyseen, /* typedef keyword seen */ ttypeseen, /* defined type seen */ tinbody, /* inside typedef body */ tend, /* just before typedef tag */ tignore /* junk after typedef tag */ } typdef; /* * struct-like structures (enum, struct and union) are recognized * using another simple finite automaton. `structdef' is its state * variable. */ static enum { snone, /* nothing seen yet, or in struct body if bracelev > 0 */ skeyseen, /* struct-like keyword seen */ stagseen, /* struct-like tag seen */ scolonseen /* colon seen after struct-like tag */ } structdef; /* * When objdef is different from onone, objtag is the name of the class. */ static const char *objtag = ""; /* * Yet another little state machine to deal with preprocessor lines. */ static enum { dnone, /* nothing seen */ dsharpseen, /* '#' seen as first char on line */ ddefineseen, /* '#' and 'define' seen */ dignorerest /* ignore rest of line */ } definedef; /* * State machine for Objective C protocols and implementations. * Idea by Tom R.Hageman (1995) */ static enum { onone, /* nothing seen */ oprotocol, /* @interface or @protocol seen */ oimplementation, /* @implementations seen */ otagseen, /* class name seen */ oparenseen, /* parenthesis before category seen */ ocatseen, /* category name seen */ oinbody, /* in @implementation body */ omethodsign, /* in @implementation body, after +/- */ omethodtag, /* after method name */ omethodcolon, /* after method colon */ omethodparm, /* after method parameter */ oignore /* wait for @end */ } objdef; /* * Use this structure to keep info about the token read, and how it * should be tagged. Used by the make_C_tag function to build a tag. */ static struct tok { char *line; /* string containing the token */ ptrdiff_t offset; /* where the token starts in LINE */ ptrdiff_t length; /* token length */ /* The previous members can be used to pass strings around for generic purposes. The following ones specifically refer to creating tags. In this case the token contained here is the pattern that will be used to create a tag. */ bool valid; /* do not create a tag; the token should be invalidated whenever a state machine is reset prematurely */ bool named; /* create a named tag */ intmax_t lineno; /* source line number of tag */ intmax_t linepos; /* source char number of tag */ } token; /* latest token read */ /* * Variables and functions for dealing with nested structures. * Idea by Mykola Dzyuba (2001) */ static void pushclass_above (ptrdiff_t, char *, ptrdiff_t); static void popclass_above (ptrdiff_t); static void write_classname (linebuffer *, const char *qualifier); static struct { char **cname; /* nested class names */ ptrdiff_t *bracelev; /* nested class brace level */ ptrdiff_t nl; /* class nesting level (elements used) */ ptrdiff_t size; /* length of the array */ } cstack; /* stack for nested declaration tags */ /* Current struct nesting depth (namespace, class, struct, union, enum). */ #define nestlev (cstack.nl) /* After struct keyword or in struct body, not inside a nested function. */ #define instruct (structdef == snone && nestlev > 0 \ && bracelev == cstack.bracelev[nestlev-1] + 1) static void pushclass_above (ptrdiff_t bracelev, char *str, ptrdiff_t len) { ptrdiff_t nl; popclass_above (bracelev); nl = cstack.nl; if (nl >= cstack.size) { xrnew (cstack.cname, cstack.size, 2); xrnew (cstack.bracelev, cstack.size, 2); cstack.size *= 2; } assert (nl == 0 || cstack.bracelev[nl-1] < bracelev); cstack.cname[nl] = (str == NULL) ? NULL : savenstr (str, len); cstack.bracelev[nl] = bracelev; cstack.nl = nl + 1; } static void popclass_above (ptrdiff_t bracelev) { for (ptrdiff_t nl = cstack.nl - 1; nl >= 0 && cstack.bracelev[nl] >= bracelev; nl--) { free (cstack.cname[nl]); cstack.nl = nl; } } static void write_classname (linebuffer *cn, const char *qualifier) { ptrdiff_t len; if (cstack.nl == 0 || cstack.cname[0] == NULL) { len = 0; cn->len = 0; cn->buffer[0] = '\0'; } else { len = strlen (cstack.cname[0]); linebuffer_setlen (cn, len); strcpy (cn->buffer, cstack.cname[0]); } for (ptrdiff_t i = 1; i < cstack.nl; i++) { char *s = cstack.cname[i]; if (s == NULL) continue; int qlen = strlen (qualifier); ptrdiff_t slen = strlen (s); linebuffer_setlen (cn, len + qlen + slen); memcpyz (stpcpy (cn->buffer + len, qualifier), s, slen); len += qlen + slen; } } static bool consider_token (char *, ptrdiff_t, int, int *, ptrdiff_t, ptrdiff_t, bool *); static void make_C_tag (bool); /* * consider_token () * checks to see if the current token is at the start of a * function or variable, or corresponds to a typedef, or * is a struct/union/enum tag, or #define, or an enum constant. * * *IS_FUNC_OR_VAR gets true if the token is a function or #define macro * with args. C_EXTP points to which language we are looking at. * * Globals * fvdef IN OUT * structdef IN OUT * definedef IN OUT * typdef IN OUT * objdef IN OUT */ static bool consider_token (char *str, /* IN: token pointer */ ptrdiff_t len, /* IN: token length */ int c, /* IN: first char after the token */ int *c_extp, /* IN, OUT: C extensions mask */ ptrdiff_t bracelev, /* IN: brace level */ ptrdiff_t parlev, /* IN: parenthesis level */ bool *is_func_or_var) /* OUT: function or variable found */ { /* When structdef is stagseen, scolonseen, or snone with bracelev > 0, structtype is the type of the preceding struct-like keyword, and structbracelev is the brace level where it has been seen. */ static enum sym_type structtype; static ptrdiff_t structbracelev; static enum sym_type toktype; toktype = C_symtype (str, len, *c_extp); /* * Skip __attribute__ */ if (toktype == st_C_attribute) { inattribute = true; return false; } /* * Skip ENUM_BF */ if (toktype == st_C_enum_bf && definedef == dnone) { in_enum_bf = true; return false; } /* * Advance the definedef state machine. */ switch (definedef) { case dnone: /* We're not on a preprocessor line. */ if (toktype == st_C_gnumacro) { fvdef = fdefunkey; return false; } break; case dsharpseen: if (toktype == st_C_define) { definedef = ddefineseen; } else { definedef = dignorerest; } return false; case ddefineseen: /* * Make a tag for any macro, unless it is a constant * and constantypedefs is false. */ definedef = dignorerest; *is_func_or_var = (c == '('); if (!*is_func_or_var && !constantypedefs) return false; else return true; case dignorerest: return false; default: error ("internal error: definedef value."); } /* * Now typedefs */ switch (typdef) { case tnone: if (toktype == st_C_typedef) { if (typedefs) typdef = tkeyseen; fvextern = false; fvdef = fvnone; return false; } break; case tkeyseen: switch (toktype) { case st_none: case st_C_class: case st_C_struct: case st_C_enum: typdef = ttypeseen; break; default: break; } break; case ttypeseen: if (structdef == snone && fvdef == fvnone) { fvdef = fvnameseen; return true; } break; case tend: switch (toktype) { case st_C_class: case st_C_struct: case st_C_enum: return false; default: return true; } default: break; } switch (toktype) { case st_C_javastruct: if (structdef == stagseen) structdef = scolonseen; return false; case st_C_template: case st_C_class: if ((*c_extp & C_AUTO) /* automatic detection of C++ language */ && bracelev == 0 && definedef == dnone && structdef == snone && typdef == tnone && fvdef == fvnone) *c_extp = (*c_extp | C_PLPL) & ~C_AUTO; if (toktype == st_C_template) break; FALLTHROUGH; case st_C_struct: case st_C_enum: if (parlev == 0 && fvdef != vignore && (typdef == tkeyseen || (typedefs_or_cplusplus && structdef == snone))) { structdef = skeyseen; structtype = toktype; structbracelev = bracelev; if (fvdef == fvnameseen) fvdef = fvnone; } return false; default: break; } if (structdef == skeyseen) { structdef = stagseen; return true; } if (typdef != tnone) definedef = dnone; /* Detect Objective C constructs. */ switch (objdef) { case onone: switch (toktype) { case st_C_objprot: objdef = oprotocol; return false; case st_C_objimpl: objdef = oimplementation; return false; default: break; } break; case oimplementation: /* Save the class tag for functions or variables defined inside. */ objtag = savenstr (str, len); objdef = oinbody; return false; case oprotocol: /* Save the class tag for categories. */ objtag = savenstr (str, len); objdef = otagseen; *is_func_or_var = true; return true; case oparenseen: objdef = ocatseen; *is_func_or_var = true; return true; case oinbody: break; case omethodsign: if (parlev == 0) { fvdef = fvnone; objdef = omethodtag; linebuffer_setlen (&token_name, len); memcpyz (token_name.buffer, str, len); return true; } return false; case omethodcolon: if (parlev == 0) objdef = omethodparm; return false; case omethodparm: if (parlev == 0) { objdef = omethodtag; if (class_qualify) { ptrdiff_t oldlen = token_name.len; fvdef = fvnone; linebuffer_setlen (&token_name, oldlen + len); memcpyz (token_name.buffer + oldlen, str, len); } return true; } return false; case oignore: if (toktype == st_C_objend) { /* Memory leakage here: the string pointed by objtag is never released, because many tests would be needed to avoid breaking on incorrect input code. The amount of memory leaked here is the sum of the lengths of the class tags. free (objtag); */ objdef = onone; } return false; default: break; } /* A function, variable or enum constant? */ switch (toktype) { case st_C_extern: fvextern = true; switch (fvdef) { case finlist: case flistseen: case fignore: case vignore: break; default: fvdef = fvnone; } return false; case st_C_ignore: fvextern = false; fvdef = vignore; return false; case st_C_operator: fvdef = foperator; *is_func_or_var = true; return true; case st_none: if (constantypedefs && structdef == snone && structtype == st_C_enum && bracelev > structbracelev /* Don't tag tokens in expressions that assign values to enum constants. */ && fvdef != vignore) return true; /* enum constant */ switch (fvdef) { case fdefunkey: if (bracelev > 0) break; fvdef = fdefunname; /* GNU macro */ *is_func_or_var = true; return true; case fvnone: switch (typdef) { case ttypeseen: return false; case tnone: if ((strneq (str, "asm", 3) && endtoken (str[3])) || (strneq (str, "__asm__", 7) && endtoken (str[7]))) { fvdef = vignore; return false; } break; default: break; } FALLTHROUGH; case fvnameseen: if (len >= 10 && strneq (str+len-10, "::operator", 10)) { if (*c_extp & C_AUTO) /* automatic detection of C++ */ *c_extp = (*c_extp | C_PLPL) & ~C_AUTO; fvdef = foperator; *is_func_or_var = true; return true; } if (bracelev > 0 && !instruct) break; fvdef = fvnameseen; /* function or variable */ *is_func_or_var = true; return true; default: break; } break; default: break; } return false; } /* * C_entries often keeps pointers to tokens or lines which are older than * the line currently read. By keeping two line buffers, and switching * them at end of line, it is possible to use those pointers. */ static struct { intmax_t linepos; linebuffer lb; } lbs[2]; #define current_lb_is_new (newndx == curndx) #define switch_line_buffers() (curndx = 1 - curndx) #define curlb (lbs[curndx].lb) #define newlb (lbs[newndx].lb) #define curlinepos (lbs[curndx].linepos) #define newlinepos (lbs[newndx].linepos) #define plainc ((c_ext & C_EXT) == C_PLAIN) #define cplpl (c_ext & C_PLPL) #define cjava ((c_ext & C_JAVA) == C_JAVA) #define CNL_SAVE_DEFINEDEF() \ do { \ curlinepos = charno; \ readline (&curlb, inf); \ lp = curlb.buffer; \ quotednl = false; \ newndx = curndx; \ } while (0) #define CNL() \ do { \ CNL_SAVE_DEFINEDEF (); \ if (savetoken.valid) \ { \ token = savetoken; \ savetoken.valid = false; \ } \ definedef = dnone; \ } while (0) static void make_C_tag (bool isfun) { /* This function is never called when token.valid is false, but we must protect against invalid input or internal errors. */ if (token.valid) make_tag (token_name.buffer, token_name.len, isfun, token.line, token.offset+token.length+1, token.lineno, token.linepos); else if (DEBUG) { /* this branch is optimized away if !DEBUG */ make_tag (concat ("INVALID TOKEN:-->", token_name.buffer, ""), token_name.len + 17, isfun, token.line, token.offset+token.length+1, token.lineno, token.linepos); error ("INVALID TOKEN"); } token.valid = false; } static bool perhaps_more_input (FILE *inf) { return !feof (inf) && !ferror (inf); } /* * C_entries () * This routine finds functions, variables, typedefs, * #define's, enum constants and struct/union/enum definitions in * C syntax and adds them to the list. */ static void C_entries (int c_ext, /* extension of C */ FILE *inf) /* input file */ { char c; /* latest char read; '\0' for end of line */ char *lp; /* pointer one beyond the character `c' */ bool curndx, newndx; /* indices for current and new lb */ ptrdiff_t tokoff; /* offset in line of start of current token */ ptrdiff_t toklen; /* length of current token */ const char *qualifier; /* string used to qualify names */ int qlen; /* length of qualifier */ ptrdiff_t bracelev; /* current brace level */ ptrdiff_t bracketlev; /* current bracket level */ ptrdiff_t parlev; /* current parenthesis level */ ptrdiff_t attrparlev; /* __attribute__ parenthesis level */ ptrdiff_t templatelev; /* current template level */ ptrdiff_t typdefbracelev; /* bracelev where a typedef struct body begun */ bool incomm, inquote, inchar, quotednl, midtoken; bool yacc_rules; /* in the rules part of a yacc file */ struct tok savetoken = {0}; /* token saved during preprocessor handling */ linebuffer_init (&lbs[0].lb); linebuffer_init (&lbs[1].lb); if (cstack.size == 0) { cstack.size = (DEBUG) ? 1 : 4; cstack.nl = 0; cstack.cname = xnew (cstack.size, char *); cstack.bracelev = xnew (cstack.size, ptrdiff_t); } tokoff = toklen = typdefbracelev = 0; /* keep compiler quiet */ curndx = newndx = 0; lp = curlb.buffer; *lp = 0; fvdef = fvnone; fvextern = false; typdef = tnone; structdef = snone; definedef = dnone; objdef = onone; yacc_rules = false; midtoken = inquote = inchar = incomm = quotednl = false; token.valid = savetoken.valid = false; bracelev = bracketlev = parlev = attrparlev = templatelev = 0; if (cjava) { qualifier = "."; qlen = 1; } else { qualifier = "::"; qlen = 2; } while (perhaps_more_input (inf)) { c = *lp++; if (c == '\\') { /* If we are at the end of the line, the next character is a '\0'; do not skip it, because it is what tells us to read the next line. */ if (*lp == '\0') { quotednl = true; continue; } lp++; c = ' '; } else if (incomm) { switch (c) { case '*': if (*lp == '/') { c = *lp++; incomm = false; } break; case '\0': /* Newlines inside comments do not end macro definitions in traditional cpp. */ CNL_SAVE_DEFINEDEF (); break; } continue; } else if (inquote) { switch (c) { case '"': inquote = false; break; case '\0': /* Newlines inside strings do not end macro definitions in traditional cpp, even though compilers don't usually accept them. */ CNL_SAVE_DEFINEDEF (); break; } continue; } else if (inchar) { switch (c) { case '\0': /* Hmmm, something went wrong. */ CNL (); FALLTHROUGH; case '\'': inchar = false; break; } continue; } else switch (c) { case '"': inquote = true; if (bracketlev > 0) continue; if (inattribute) break; switch (fvdef) { case fdefunkey: case fstartlist: case finlist: case fignore: case vignore: break; default: fvextern = false; fvdef = fvnone; } continue; case '\'': inchar = true; if (bracketlev > 0) continue; if (inattribute) break; if (fvdef != finlist && fvdef != fignore && fvdef != vignore) { fvextern = false; fvdef = fvnone; } continue; case '/': if (*lp == '*') { incomm = true; lp++; c = ' '; if (bracketlev > 0) continue; } else if (/* cplpl && */ *lp == '/') { c = '\0'; } break; case '%': if ((c_ext & YACC) && *lp == '%') { /* Entering or exiting rules section in yacc file. */ lp++; definedef = dnone; fvdef = fvnone; fvextern = false; typdef = tnone; structdef = snone; midtoken = inquote = inchar = incomm = quotednl = false; bracelev = 0; yacc_rules = !yacc_rules; continue; } else break; case '#': if (definedef == dnone) { char *cp; bool cpptoken = true; /* Look back on this line. If all blanks, or nonblanks followed by an end of comment, this is a preprocessor token. */ for (cp = newlb.buffer; cp < lp-1; cp++) if (!c_isspace (*cp)) { if (*cp == '*' && cp[1] == '/') { cp++; cpptoken = true; } else cpptoken = false; } if (cpptoken) { definedef = dsharpseen; /* This is needed for tagging enum values: when there are preprocessor conditionals inside the enum, we need to reset the value of fvdef so that the next enum value is tagged even though the one before it did not end in a comma. */ if (fvdef == vignore && instruct && parlev == 0) { if (strneq (cp, "#if", 3) || strneq (cp, "#el", 3)) fvdef = fvnone; } } } /* if (definedef == dnone) */ continue; case '[': bracketlev++; continue; default: if (bracketlev > 0) { if (c == ']') --bracketlev; else if (c == '\0') CNL_SAVE_DEFINEDEF (); continue; } break; } /* switch (c) */ /* Consider token only if some involved conditions are satisfied. */ if (typdef != tignore && definedef != dignorerest && fvdef != finlist && templatelev == 0 && (definedef != dnone || structdef != scolonseen) && !inattribute && !in_enum_bf) { if (midtoken) { if (endtoken (c)) { if (c == ':' && *lp == ':' && begtoken (lp[1])) /* This handles :: in the middle, but not at the beginning of an identifier. Also, space-separated :: is not recognized. */ { if (c_ext & C_AUTO) /* automatic detection of C++ */ c_ext = (c_ext | C_PLPL) & ~C_AUTO; lp += 2; toklen += 2; c = lp[-1]; goto still_in_token; } else { bool funorvar = false; if (yacc_rules || consider_token (newlb.buffer + tokoff, toklen, c, &c_ext, bracelev, parlev, &funorvar)) { if (fvdef == foperator) { char *oldlp = lp; lp = skip_spaces (lp-1); if (*lp != '\0') lp += 1; while (*lp != '\0' && !c_isspace (*lp) && *lp != '(') lp += 1; c = *lp++; toklen += lp - oldlp; } token.named = false; if (!plainc && nestlev > 0 && definedef == dnone) /* in struct body */ { if (class_qualify) { write_classname (&token_name, qualifier); ptrdiff_t len = token_name.len; linebuffer_setlen (&token_name, len + qlen + toklen); memcpyz (stpcpy (token_name.buffer + len, qualifier), newlb.buffer + tokoff, toklen); } else { linebuffer_setlen (&token_name, toklen); memcpyz (token_name.buffer, newlb.buffer + tokoff, toklen); } token.named = true; } else if (objdef == ocatseen) /* Objective C category */ { if (class_qualify) { ptrdiff_t len = strlen (objtag) + 2 + toklen; linebuffer_setlen (&token_name, len); char *p1 = stpcpy (token_name.buffer, objtag); char *p2 = stpcpy (p1, "("); char *p3 = mempcpy (p2, newlb.buffer + tokoff, toklen); strcpy (p3, ")"); } else { linebuffer_setlen (&token_name, toklen); memcpyz (token_name.buffer, newlb.buffer + tokoff, toklen); } token.named = true; } else if (objdef == omethodtag || objdef == omethodparm) /* Objective C method */ { token.named = true; } else if (fvdef == fdefunname) /* GNU DEFUN and similar macros */ { bool defun = (newlb.buffer[tokoff] == 'F'); ptrdiff_t off = tokoff; ptrdiff_t len = toklen; if (defun) { off += 1; len -= 1; /* First, tag it as its C name */ linebuffer_setlen (&token_name, toklen); memcpyz (token_name.buffer, newlb.buffer + tokoff, toklen); token.named = true; token.lineno = lineno; token.offset = tokoff; token.length = toklen; token.line = newlb.buffer; token.linepos = newlinepos; token.valid = true; make_C_tag (funorvar); } /* Rewrite the tag so that emacs lisp DEFUNs can be found also by their elisp name */ linebuffer_setlen (&token_name, len); memcpyz (token_name.buffer, newlb.buffer + off, len); if (defun) while (--len >= 0) if (token_name.buffer[len] == '_') token_name.buffer[len] = '-'; token.named = defun; } else { linebuffer_setlen (&token_name, toklen); memcpyz (token_name.buffer, newlb.buffer + tokoff, toklen); /* Name macros and members. */ token.named = (structdef == stagseen || typdef == ttypeseen || typdef == tend || (funorvar && definedef == dignorerest) || (funorvar && definedef == dnone && structdef == snone && bracelev > 0)); } token.lineno = lineno; token.offset = tokoff; token.length = toklen; token.line = newlb.buffer; token.linepos = newlinepos; token.valid = true; if (definedef == dnone && (fvdef == fvnameseen || fvdef == foperator || structdef == stagseen || typdef == tend || typdef == ttypeseen || objdef != onone)) { if (current_lb_is_new) switch_line_buffers (); } else if (definedef != dnone || fvdef == fdefunname || instruct) make_C_tag (funorvar); } else /* not yacc and consider_token failed */ { if (inattribute && fvdef == fignore) { /* We have just met __attribute__ after a function parameter list: do not tag the function again. */ fvdef = fvnone; } } midtoken = false; } } /* if (endtoken (c)) */ else if (intoken (c)) still_in_token: { toklen++; continue; } } /* if (midtoken) */ else if (begtoken (c)) { switch (definedef) { case dnone: switch (fvdef) { case fstartlist: /* This prevents tagging fb in void (__attribute__((noreturn)) *fb) (void); Fixing this is not easy and not very important. */ fvdef = finlist; continue; case flistseen: if (plainc || declarations) { make_C_tag (true); /* a function */ fvdef = fignore; } break; default: break; } if (structdef == stagseen && !cjava) { popclass_above (bracelev); structdef = snone; } break; case dsharpseen: savetoken = token; break; default: break; } if (!yacc_rules || lp == newlb.buffer + 1) { tokoff = lp - 1 - newlb.buffer; toklen = 1; midtoken = true; } continue; } /* if (begtoken) */ } /* if must look at token */ /* Detect end of line, colon, comma, semicolon and various braces after having handled a token.*/ switch (c) { case ':': if (inattribute) break; if (yacc_rules && token.offset == 0 && token.valid) { make_C_tag (false); /* a yacc function */ break; } if (definedef != dnone) break; switch (objdef) { case otagseen: objdef = oignore; make_C_tag (true); /* an Objective C class */ break; case omethodtag: case omethodparm: objdef = omethodcolon; if (class_qualify) { ptrdiff_t toklen = token_name.len; linebuffer_setlen (&token_name, toklen + 1); strcpy (token_name.buffer + toklen, ":"); } break; default: break; } if (structdef == stagseen) { structdef = scolonseen; break; } /* Should be useless, but may be work as a safety net. */ if (cplpl && fvdef == flistseen) { make_C_tag (true); /* a function */ fvdef = fignore; break; } break; case ';': if (definedef != dnone || inattribute) break; switch (typdef) { case tend: case ttypeseen: make_C_tag (false); /* a typedef */ typdef = tnone; fvdef = fvnone; break; case tnone: case tinbody: case tignore: switch (fvdef) { case fignore: if (typdef == tignore || cplpl) fvdef = fvnone; break; case fvnameseen: if ((globals && bracelev == 0 && (!fvextern || declarations)) || (members && instruct)) make_C_tag (false); /* a variable */ fvextern = false; fvdef = fvnone; token.valid = false; break; case flistseen: if ((declarations && (cplpl || !instruct) && (typdef == tnone || (typdef != tignore && instruct))) || (members && plainc && instruct)) make_C_tag (true); /* a function */ FALLTHROUGH; default: fvextern = false; fvdef = fvnone; if (declarations && cplpl && structdef == stagseen) make_C_tag (false); /* forward declaration */ else token.valid = false; } /* switch (fvdef) */ FALLTHROUGH; default: if (!instruct) typdef = tnone; } if (structdef == stagseen) structdef = snone; break; case ',': if (definedef != dnone || inattribute) break; switch (objdef) { case omethodtag: case omethodparm: make_C_tag (true); /* an Objective C method */ objdef = oinbody; break; default: break; } switch (fvdef) { case fdefunkey: case foperator: case fstartlist: case finlist: case fignore: break; case vignore: if (instruct && parlev == 0) fvdef = fvnone; break; case fdefunname: fvdef = fignore; break; case fvnameseen: if (parlev == 0 && ((globals && bracelev == 0 && templatelev == 0 && (!fvextern || declarations)) || (members && instruct))) make_C_tag (false); /* a variable */ break; case flistseen: if ((declarations && typdef == tnone && !instruct) || (members && typdef != tignore && instruct)) { make_C_tag (true); /* a function */ fvdef = fvnameseen; } else if (!declarations) fvdef = fvnone; token.valid = false; break; default: fvdef = fvnone; } if (structdef == stagseen) structdef = snone; break; case ']': if (definedef != dnone || inattribute) break; if (structdef == stagseen) structdef = snone; switch (typdef) { case ttypeseen: case tend: typdef = tignore; make_C_tag (false); /* a typedef */ break; case tnone: case tinbody: switch (fvdef) { case foperator: case finlist: case fignore: case vignore: break; case fvnameseen: if ((members && bracelev == 1) || (globals && bracelev == 0 && (!fvextern || declarations))) make_C_tag (false); /* a variable */ FALLTHROUGH; default: fvdef = fvnone; } break; default: break; } break; case '(': if (inattribute) { attrparlev++; break; } if (definedef != dnone) break; if (objdef == otagseen && parlev == 0) objdef = oparenseen; switch (fvdef) { case fvnameseen: if (typdef == ttypeseen && *lp != '*' && !instruct) { /* This handles constructs like: typedef void OperatorFun (int fun); */ make_C_tag (false); typdef = tignore; fvdef = fignore; break; } FALLTHROUGH; case foperator: fvdef = fstartlist; break; case flistseen: fvdef = finlist; break; default: break; } parlev++; break; case ')': if (inattribute) { if (--attrparlev == 0) inattribute = false; break; } if (in_enum_bf) { if (--parlev == 0) in_enum_bf = false; break; } if (definedef != dnone) break; if (objdef == ocatseen && parlev == 1) { make_C_tag (true); /* an Objective C category */ objdef = oignore; } if (--parlev == 0) { switch (fvdef) { case fstartlist: case finlist: fvdef = flistseen; break; default: break; } if (!instruct && (typdef == tend || typdef == ttypeseen)) { typdef = tignore; make_C_tag (false); /* a typedef */ } } else if (parlev < 0) /* can happen due to ill-conceived #if's. */ parlev = 0; break; case '{': if (definedef != dnone) break; if (typdef == ttypeseen) { /* Whenever typdef is set to tinbody (currently only here), typdefbracelev should be set to bracelev. */ typdef = tinbody; typdefbracelev = bracelev; } switch (fvdef) { case flistseen: if (cplpl && !class_qualify) { /* Remove class and namespace qualifiers from the token, leaving only the method/member name. */ char *cc, *uqname = token_name.buffer; char *tok_end = token_name.buffer + token_name.len; for (cc = token_name.buffer; cc < tok_end; cc++) { if (*cc == ':' && cc[1] == ':') { uqname = cc + 2; cc++; } } if (uqname > token_name.buffer) { ptrdiff_t uqlen = strlen (uqname); linebuffer_setlen (&token_name, uqlen); memmove (token_name.buffer, uqname, uqlen + 1); } } make_C_tag (true); /* a function */ FALLTHROUGH; case fignore: fvdef = fvnone; break; case fvnone: switch (objdef) { case otagseen: make_C_tag (true); /* an Objective C class */ objdef = oignore; break; case omethodtag: case omethodparm: make_C_tag (true); /* an Objective C method */ objdef = oinbody; break; default: /* Neutralize `extern "C" {' grot. */ if (bracelev == 0 && structdef == snone && nestlev == 0 && typdef == tnone) bracelev = -1; } break; default: break; } switch (structdef) { case skeyseen: /* unnamed struct */ pushclass_above (bracelev, NULL, 0); structdef = snone; break; case stagseen: /* named struct or enum */ case scolonseen: /* a class */ pushclass_above (bracelev,token.line+token.offset, token.length); structdef = snone; make_C_tag (false); /* a struct or enum */ break; default: break; } bracelev += 1; break; case '*': if (definedef != dnone) break; if (fvdef == fstartlist) { fvdef = fvnone; /* avoid tagging `foo' in `foo (*bar()) ()' */ token.valid = false; } break; case '}': if (definedef != dnone) break; bracelev -= 1; if (!ignoreindent && lp == newlb.buffer + 1) { if (bracelev != 0) token.valid = false; /* unexpected value, token unreliable */ bracelev = 0; /* reset brace level if first column */ parlev = 0; /* also reset paren level, just in case... */ } else if (bracelev < 0) { token.valid = false; /* something gone amiss, token unreliable */ bracelev = 0; } if (bracelev == 0 && fvdef == vignore) fvdef = fvnone; /* end of function */ popclass_above (bracelev); structdef = snone; /* Only if typdef == tinbody is typdefbracelev significant. */ if (typdef == tinbody && bracelev <= typdefbracelev) { assert (bracelev == typdefbracelev); typdef = tend; } break; case '=': if (definedef != dnone) break; switch (fvdef) { case foperator: case finlist: case fignore: case vignore: break; case fvnameseen: if ((members && bracelev == 1) || (globals && bracelev == 0 && (!fvextern || declarations))) make_C_tag (false); /* a variable */ FALLTHROUGH; default: fvdef = vignore; } break; case '<': if (cplpl && (structdef == stagseen || fvdef == fvnameseen)) { templatelev++; break; } goto resetfvdef; case '>': if (templatelev > 0) { templatelev--; break; } goto resetfvdef; case '+': case '-': if (objdef == oinbody && bracelev == 0) { objdef = omethodsign; break; } FALLTHROUGH; case '#': case '~': case '&': case '%': case '/': case '|': case '^': case '!': case '.': case '?': resetfvdef: if (definedef != dnone) break; /* These surely cannot follow a function tag in C. */ switch (fvdef) { case foperator: case finlist: case fignore: case vignore: break; default: fvdef = fvnone; } break; case '\0': if (objdef == otagseen) { make_C_tag (true); /* an Objective C class */ objdef = oignore; } /* If a macro spans multiple lines don't reset its state. */ if (quotednl) CNL_SAVE_DEFINEDEF (); else CNL (); break; } /* switch (c) */ } /* while not eof */ free (lbs[0].lb.buffer); free (lbs[1].lb.buffer); } /* * Process either a C++ file or a C file depending on the setting * of a global flag. */ static void default_C_entries (FILE *inf) { C_entries (cplusplus ? C_PLPL : C_AUTO, inf); } /* Always do plain C. */ static void plain_C_entries (FILE *inf) { C_entries (0, inf); } /* Always do C++. */ static void Cplusplus_entries (FILE *inf) { C_entries (C_PLPL, inf); } /* Always do Java. */ static void Cjava_entries (FILE *inf) { C_entries (C_JAVA, inf); } /* Always do C*. */ static void Cstar_entries (FILE *inf) { C_entries (C_STAR, inf); } /* Always do Yacc. */ static void Yacc_entries (FILE *inf) { C_entries (YACC, inf); } /* Useful macros. */ #define LOOP_ON_INPUT_LINES(file_pointer, line_buffer, char_pointer) \ while (perhaps_more_input (file_pointer) \ && (readline (&(line_buffer), file_pointer), \ (char_pointer) = (line_buffer).buffer, \ true)) #define LOOKING_AT(cp, kw) /* kw is the keyword, a literal string */ \ ((assert ("" kw), true) /* syntax error if not a literal string */ \ && strneq ((cp), kw, sizeof (kw)-1) /* cp points at kw */ \ && notinname ((cp)[sizeof (kw)-1]) /* end of kw */ \ && ((cp) = skip_spaces ((cp) + sizeof (kw) - 1), true)) /* skip spaces */ /* Similar to LOOKING_AT but does not use notinname, does not skip */ #define LOOKING_AT_NOCASE(cp, kw) /* the keyword is a literal string */ \ ((assert ("" kw), true) /* syntax error if not a literal string */ \ && strncaseeq ((cp), kw, sizeof (kw)-1) /* cp points at kw */ \ && ((cp) += sizeof (kw) - 1, true)) /* skip spaces */ /* * Read a file, but do no processing. This is used to do regexp * matching on files that have no language defined. */ static void just_read_file (FILE *inf) { while (perhaps_more_input (inf)) readline (&lb, inf); } /* Fortran parsing */ static void F_takeprec (void); static void F_getit (FILE *); static void F_takeprec (void) { dbp = skip_spaces (dbp); if (*dbp != '*') return; dbp++; dbp = skip_spaces (dbp); if (strneq (dbp, "(*)", 3)) { dbp += 3; return; } if (!c_isdigit (*dbp)) { --dbp; /* force failure */ return; } do dbp++; while (c_isdigit (*dbp)); } static void F_getit (FILE *inf) { register char *cp; dbp = skip_spaces (dbp); if (*dbp == '\0') { readline (&lb, inf); dbp = lb.buffer; if (dbp[5] != '&') return; dbp += 6; dbp = skip_spaces (dbp); } if (!c_isalpha (*dbp) && *dbp != '_' && *dbp != '$') return; for (cp = dbp + 1; *cp != '\0' && intoken (*cp); cp++) continue; make_tag (dbp, cp-dbp, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } static void Fortran_functions (FILE *inf) { LOOP_ON_INPUT_LINES (inf, lb, dbp) { if (*dbp == '%') dbp++; /* Ratfor escape to fortran */ dbp = skip_spaces (dbp); if (*dbp == '\0') continue; if (LOOKING_AT_NOCASE (dbp, "recursive")) dbp = skip_spaces (dbp); if (LOOKING_AT_NOCASE (dbp, "pure")) dbp = skip_spaces (dbp); if (LOOKING_AT_NOCASE (dbp, "elemental")) dbp = skip_spaces (dbp); switch (c_tolower (*dbp)) { case 'i': if (nocase_tail ("integer")) F_takeprec (); break; case 'r': if (nocase_tail ("real")) F_takeprec (); break; case 'l': if (nocase_tail ("logical")) F_takeprec (); break; case 'c': if (nocase_tail ("complex") || nocase_tail ("character")) F_takeprec (); break; case 'd': if (nocase_tail ("double")) { dbp = skip_spaces (dbp); if (*dbp == '\0') continue; if (nocase_tail ("precision")) break; continue; } break; } dbp = skip_spaces (dbp); if (*dbp == '\0') continue; switch (c_tolower (*dbp)) { case 'f': if (nocase_tail ("function")) F_getit (inf); continue; case 's': if (nocase_tail ("subroutine")) F_getit (inf); continue; case 'e': if (nocase_tail ("entry")) F_getit (inf); continue; case 'b': if (nocase_tail ("blockdata") || nocase_tail ("block data")) { dbp = skip_spaces (dbp); if (*dbp == '\0') /* assume un-named */ make_tag ("blockdata", 9, true, lb.buffer, dbp - lb.buffer, lineno, linecharno); else F_getit (inf); /* look for name */ } continue; } } } /* * Go language support * Original code by Xi Lu (2016) */ static void Go_functions(FILE *inf) { char *cp, *name; LOOP_ON_INPUT_LINES(inf, lb, cp) { cp = skip_spaces (cp); if (LOOKING_AT (cp, "package")) { name = cp; while (!notinname (*cp) && *cp != '\0') cp++; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else if (LOOKING_AT (cp, "func")) { /* Go implementation of interface, such as: func (n *Integer) Add(m Integer) ... skip `(n *Integer)` part. */ if (*cp == '(') { while (*cp != ')') cp++; cp = skip_spaces (cp+1); } if (*cp) { name = cp; while (!notinname (*cp)) cp++; make_tag (name, cp - name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } else if (members && LOOKING_AT (cp, "type")) { name = cp; /* Ignore the likes of the following: type ( A ) */ if (*cp == '(') return; while (!notinname (*cp) && *cp != '\0') cp++; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } } /* * Ada parsing * Original code by * Philippe Waroquiers (1998) */ /* Once we are positioned after an "interesting" keyword, let's get the real tag value necessary. */ static void Ada_getit (FILE *inf, const char *name_qualifier) { register char *cp; char *name; char c; while (perhaps_more_input (inf)) { dbp = skip_spaces (dbp); if (*dbp == '\0' || (dbp[0] == '-' && dbp[1] == '-')) { readline (&lb, inf); dbp = lb.buffer; } switch (c_tolower (*dbp)) { case 'b': if (nocase_tail ("body")) { /* Skipping body of procedure body or package body or .... resetting qualifier to body instead of spec. */ name_qualifier = "/b"; continue; } break; case 't': /* Skipping type of task type or protected type ... */ if (nocase_tail ("type")) continue; break; } if (*dbp == '"') { dbp += 1; for (cp = dbp; *cp != '\0' && *cp != '"'; cp++) continue; } else { dbp = skip_spaces (dbp); for (cp = dbp; c_isalnum (*cp) || *cp == '_' || *cp == '.'; cp++) continue; if (cp == dbp) return; } c = *cp; *cp = '\0'; name = concat (dbp, name_qualifier, ""); *cp = c; make_tag (name, strlen (name), true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); free (name); if (c == '"') dbp = cp + 1; return; } } static void Ada_funcs (FILE *inf) { bool inquote = false; bool skip_till_semicolumn = false; LOOP_ON_INPUT_LINES (inf, lb, dbp) { while (*dbp != '\0') { /* Skip a string i.e. "abcd". */ if (inquote || (*dbp == '"')) { dbp = strchr (dbp + !inquote, '"'); if (dbp != NULL) { inquote = false; dbp += 1; continue; /* advance char */ } else { inquote = true; break; /* advance line */ } } /* Skip comments. */ if (dbp[0] == '-' && dbp[1] == '-') break; /* advance line */ /* Skip character enclosed in single quote i.e. 'a' and skip single quote starting an attribute i.e. 'Image. */ if (*dbp == '\'') { dbp++ ; if (*dbp != '\0') dbp++; continue; } if (skip_till_semicolumn) { if (*dbp == ';') skip_till_semicolumn = false; dbp++; continue; /* advance char */ } /* Search for beginning of a token. */ if (!begtoken (*dbp)) { dbp++; continue; /* advance char */ } /* We are at the beginning of a token. */ switch (c_tolower (*dbp)) { case 'f': if (!packages_only && nocase_tail ("function")) Ada_getit (inf, "/f"); else break; /* from switch */ continue; /* advance char */ case 'p': if (!packages_only && nocase_tail ("procedure")) Ada_getit (inf, "/p"); else if (nocase_tail ("package")) Ada_getit (inf, "/s"); else if (nocase_tail ("protected")) /* protected type */ Ada_getit (inf, "/t"); else break; /* from switch */ continue; /* advance char */ case 'u': if (typedefs && !packages_only && nocase_tail ("use")) { /* when tagging types, avoid tagging use type Pack.Typename; for this, we will skip everything till a ; */ skip_till_semicolumn = true; continue; /* advance char */ } case 't': if (!packages_only && nocase_tail ("task")) Ada_getit (inf, "/k"); else if (typedefs && !packages_only && nocase_tail ("type")) { Ada_getit (inf, "/t"); while (*dbp != '\0') dbp += 1; } else break; /* from switch */ continue; /* advance char */ } /* Look for the end of the token. */ while (!endtoken (*dbp)) dbp++; } /* advance char */ } /* advance line */ } /* * Unix and microcontroller assembly tag handling * Labels: /^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]/ * Idea by Bob Weiner, Motorola Inc. (1994) */ static void Asm_labels (FILE *inf) { register char *cp; LOOP_ON_INPUT_LINES (inf, lb, cp) { /* If first char is alphabetic or one of [_.$], test for colon following identifier. */ if (c_isalpha (*cp) || *cp == '_' || *cp == '.' || *cp == '$') { /* Read past label. */ cp++; while (c_isalnum (*cp) || *cp == '_' || *cp == '.' || *cp == '$') cp++; if (*cp == ':' || c_isspace (*cp)) /* Found end of label, so copy it and add it to the table. */ make_tag (lb.buffer, cp - lb.buffer, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } } /* * Perl support * Perl sub names: /^sub[ \t\n]+[^ \t\n{]+/ * /^use constant[ \t\n]+[^ \t\n{=,;]+/ * Perl variable names: /^(my|local).../ * Original code by Bart Robinson (1995) * Additions by Michael Ernst (1997) * Ideas by Kai Großjohann (2001) */ static void Perl_functions (FILE *inf) { char *package = savestr ("main"); /* current package name */ register char *cp; LOOP_ON_INPUT_LINES (inf, lb, cp) { cp = skip_spaces (cp); if (LOOKING_AT (cp, "package")) { free (package); get_tag (cp, &package); } else if (LOOKING_AT (cp, "sub")) { char *pos, *sp; subr: sp = cp; while (!notinname (*cp)) cp++; if (cp == sp) continue; /* nothing found */ pos = strchr (sp, ':'); if (pos && pos < cp && pos[1] == ':') { /* The name is already qualified. */ if (!class_qualify) { char *q = pos + 2, *qpos; while ((qpos = strchr (q, ':')) != NULL && qpos < cp && qpos[1] == ':') q = qpos + 2; sp = q; } make_tag (sp, cp - sp, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else if (class_qualify) /* Qualify it. */ { char savechar, *name; savechar = *cp; *cp = '\0'; name = concat (package, "::", sp); *cp = savechar; make_tag (name, strlen (name), true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); free (name); } else make_tag (sp, cp - sp, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else if (LOOKING_AT (cp, "use constant") || LOOKING_AT (cp, "use constant::defer")) { /* For hash style multi-constant like use constant { FOO => 123, BAR => 456 }; only the first FOO is picked up. Parsing across the value expressions would be difficult in general, due to possible nested hashes, here-documents, etc. */ if (*cp == '{') cp = skip_spaces (cp+1); goto subr; } else if (globals) /* only if we are tagging global vars */ { /* Skip a qualifier, if any. */ bool qual = LOOKING_AT (cp, "my") || LOOKING_AT (cp, "local"); /* After "my" or "local", but before any following paren or space. */ char *varstart = cp; if (qual /* should this be removed? If yes, how? */ && (*cp == '$' || *cp == '@' || *cp == '%')) { varstart += 1; do cp++; while (c_isalnum (*cp) || *cp == '_'); } else if (qual) { /* Should be examining a variable list at this point; could insist on seeing an open parenthesis. */ while (*cp != '\0' && *cp != ';' && *cp != '=' && *cp != ')') cp++; } else continue; make_tag (varstart, cp - varstart, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } free (package); } /* * Python support * Look for /^[\t]*def[ \t\n]+[^ \t\n(:]+/ or /^class[ \t\n]+[^ \t\n(:]+/ * Idea by Eric S. Raymond (1997) * More ideas by seb bacon (2002) */ static void Python_functions (FILE *inf) { register char *cp; LOOP_ON_INPUT_LINES (inf, lb, cp) { cp = skip_spaces (cp); if (LOOKING_AT (cp, "def") || LOOKING_AT (cp, "class")) { char *name = cp; while (!notinname (*cp) && *cp != ':') cp++; make_tag (name, cp - name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } } /* * Ruby support * Original code by Xi Lu (2015) */ static void Ruby_functions (FILE *inf) { char *cp = NULL; bool reader = false, writer = false, alias = false, continuation = false; LOOP_ON_INPUT_LINES (inf, lb, cp) { bool is_class = false; bool is_method = false; char *name; cp = skip_spaces (cp); if (!continuation /* Constants. */ && c_isalpha (*cp) && c_isupper (*cp)) { char *bp, *colon = NULL; name = cp; for (cp++; c_isalnum (*cp) || *cp == '_' || *cp == ':'; cp++) { if (*cp == ':') colon = cp; } if (cp > name + 1) { bp = skip_spaces (cp); if (*bp == '=' && !(bp[1] == '=' || bp[1] == '>')) { if (colon && !c_isspace (colon[1])) name = colon + 1; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } } else if (!continuation /* Modules, classes, methods. */ && ((is_method = LOOKING_AT (cp, "def")) || (is_class = LOOKING_AT (cp, "class")) || LOOKING_AT (cp, "module"))) { const char self_name[] = "self."; const size_t self_size1 = sizeof (self_name) - 1; name = cp; /* Ruby method names can end in a '='. Also, operator overloading can define operators whose names include '='. */ while (!notinname (*cp) || *cp == '=') cp++; /* Remove "self." from the method name. */ if (cp - name > self_size1 && strneq (name, self_name, self_size1)) name += self_size1; /* Remove the class/module qualifiers from method names. */ if (is_method) { char *q; for (q = name; q < cp && *q != '.'; q++) ; if (q < cp - 1) /* punt if we see just "FOO." */ name = q + 1; } /* Don't tag singleton classes. */ if (is_class && strneq (name, "<<", 2) && cp == name + 2) continue; make_tag (name, cp - name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else { /* Tag accessors and aliases. */ if (!continuation) reader = writer = alias = false; while (*cp && *cp != '#') { if (!continuation) { reader = writer = alias = false; if (LOOKING_AT (cp, "attr_reader")) reader = true; else if (LOOKING_AT (cp, "attr_writer")) writer = true; else if (LOOKING_AT (cp, "attr_accessor")) { reader = true; writer = true; } else if (LOOKING_AT (cp, "alias_method")) alias = true; } if (reader || writer || alias) { do { char *np; cp = skip_spaces (cp); if (*cp == '(') cp = skip_spaces (cp + 1); np = cp; cp = skip_name (cp); if (*np != ':') continue; np++; if (reader) { make_tag (np, cp - np, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); continuation = false; } if (writer) { size_t name_len = cp - np + 1; char *wr_name = xnew (name_len + 1, char); strcpy (mempcpy (wr_name, np, name_len - 1), "="); pfnote (wr_name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); if (debug) fprintf (stderr, "%s on %s:%"PRIdMAX": %s\n", wr_name, curfdp->taggedfname, lineno, lb.buffer); continuation = false; } if (alias) { if (!continuation) make_tag (np, cp - np, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); continuation = false; while (*cp && *cp != '#' && *cp != ';') { if (*cp == ',') continuation = true; else if (!c_isspace (*cp)) continuation = false; cp++; } if (*cp == ';') continuation = false; } cp = skip_spaces (cp); } while ((alias ? (*cp == ',') : (continuation = (*cp == ','))) && (cp = skip_spaces (cp + 1), *cp && *cp != '#')); } if (*cp != '#') cp = skip_name (cp); while (*cp && *cp != '#' && notinname (*cp)) cp++; } } } } /* * Rust support * Look for: * - fn: Function * - struct: Structure * - enum: Enumeration * - macro_rules!: Macro */ static void Rust_entries (FILE *inf) { char *cp, *name; bool is_func = false; LOOP_ON_INPUT_LINES(inf, lb, cp) { cp = skip_spaces(cp); name = cp; // Skip 'pub' keyworld (void)LOOKING_AT (cp, "pub"); // Look for define if ((is_func = LOOKING_AT (cp, "fn")) || LOOKING_AT (cp, "enum") || LOOKING_AT (cp, "struct") || (is_func = LOOKING_AT (cp, "macro_rules!"))) { cp = skip_spaces (cp); name = cp; while (!notinname (*cp)) cp++; make_tag (name, cp - name, is_func, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); is_func = false; } } } /* * PHP support * Look for: * - /^[ \t]*function[ \t\n]+[^ \t\n(]+/ * - /^[ \t]*class[ \t\n]+[^ \t\n]+/ * - /^[ \t]*define\(\"[^\"]+/ * Only with --members: * - /^[ \t]*var[ \t\n]+\$[^ \t\n=;]/ * Idea by Diez B. Roggisch (2001) */ static void PHP_functions (FILE *inf) { char *cp, *name; bool search_identifier = false; LOOP_ON_INPUT_LINES (inf, lb, cp) { cp = skip_spaces (cp); name = cp; if (search_identifier && *cp != '\0') { while (!notinname (*cp)) cp++; make_tag (name, cp - name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); search_identifier = false; } else if (LOOKING_AT (cp, "function")) { if (*cp == '&') cp = skip_spaces (cp+1); if (*cp != '\0') { name = cp; while (!notinname (*cp)) cp++; make_tag (name, cp - name, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else search_identifier = true; } else if (LOOKING_AT (cp, "class")) { if (*cp != '\0') { name = cp; while (*cp != '\0' && !c_isspace (*cp)) cp++; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else search_identifier = true; } else if (strneq (cp, "define", 6) && (cp = skip_spaces (cp+6)) && *cp++ == '(' && (*cp == '"' || *cp == '\'')) { char quote = *cp++; name = cp; while (*cp != quote && *cp != '\0') cp++; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } else if (members && LOOKING_AT (cp, "var") && *cp == '$') { name = cp; while (!notinname (*cp)) cp++; make_tag (name, cp - name, false, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } } /* * Cobol tag functions * We could look for anything that could be a paragraph name. * i.e. anything that starts in column 8 is one word and ends in a full stop. * Idea by Corny de Souza (1993) */ static void Cobol_paragraphs (FILE *inf) { register char *bp, *ep; LOOP_ON_INPUT_LINES (inf, lb, bp) { if (lb.len < 9) continue; bp += 8; /* If eoln, compiler option or comment ignore whole line. */ if (bp[-1] != ' ' || !c_isalnum (bp[0])) continue; for (ep = bp; c_isalnum (*ep) || *ep == '-'; ep++) continue; if (*ep++ == '.') make_tag (bp, ep - bp, true, lb.buffer, ep - lb.buffer + 1, lineno, linecharno); } } /* * Makefile support * Ideas by Assar Westerlund (2001) */ static void Makefile_targets (FILE *inf) { register char *bp; LOOP_ON_INPUT_LINES (inf, lb, bp) { if (*bp == '\t' || *bp == '#') continue; while (*bp != '\0' && *bp != '=' && *bp != ':') bp++; if (*bp == ':' || (globals && *bp == '=')) { /* We should detect if there is more than one tag, but we do not. We just skip initial and final spaces. */ char * namestart = skip_spaces (lb.buffer); while (--bp > namestart) if (!notinname (*bp)) break; make_tag (namestart, bp - namestart + 1, true, lb.buffer, bp - lb.buffer + 2, lineno, linecharno); } } } /* * Pascal parsing * Original code by Mosur K. Mohan (1989) * * Locates tags for procedures & functions. Doesn't do any type- or * var-definitions. It does look for the keyword "extern" or * "forward" immediately following the procedure statement; if found, * the tag is skipped. */ static void Pascal_functions (FILE *inf) { linebuffer tline; /* mostly copied from C_entries */ intmax_t save_lcno, save_lineno; ptrdiff_t namelen, taglen; char c, *name; bool /* each of these flags is true if: */ incomment, /* point is inside a comment */ inquote, /* point is inside '..' string */ get_tagname, /* point is after PROCEDURE/FUNCTION keyword, so next item = potential tag */ found_tag, /* point is after a potential tag */ inparms, /* point is within parameter-list */ verify_tag; /* point has passed the parm-list, so the next token will determine whether this is a FORWARD/EXTERN to be ignored, or whether it is a real tag */ save_lcno = save_lineno = namelen = taglen = 0; /* keep compiler quiet */ name = NULL; /* keep compiler quiet */ dbp = lb.buffer; *dbp = '\0'; linebuffer_init (&tline); incomment = inquote = false; found_tag = false; /* have a proc name; check if extern */ get_tagname = false; /* found "procedure" keyword */ inparms = false; /* found '(' after "proc" */ verify_tag = false; /* check if "extern" is ahead */ while (perhaps_more_input (inf)) /* long main loop to get next char */ { c = *dbp++; if (c == '\0') /* if end of line */ { readline (&lb, inf); dbp = lb.buffer; if (*dbp == '\0') continue; if (!((found_tag && verify_tag) || get_tagname)) c = *dbp++; /* only if don't need *dbp pointing to the beginning of the name of the procedure or function */ } if (incomment) { if (c == '}') /* within { } comments */ incomment = false; else if (c == '*' && *dbp == ')') /* within (* *) comments */ { dbp++; incomment = false; } continue; } else if (inquote) { if (c == '\'') inquote = false; continue; } else switch (c) { case '\'': inquote = true; /* found first quote */ continue; case '{': /* found open { comment */ incomment = true; continue; case '(': if (*dbp == '*') /* found open (* comment */ { incomment = true; dbp++; } else if (found_tag) /* found '(' after tag, i.e., parm-list */ inparms = true; continue; case ')': /* end of parms list */ if (inparms) inparms = false; continue; case ';': if (found_tag && !inparms) /* end of proc or fn stmt */ { verify_tag = true; break; } continue; } if (found_tag && verify_tag && (*dbp != ' ')) { /* Check if this is an "extern" declaration. */ if (*dbp == '\0') continue; if (c_tolower (*dbp) == 'e') { if (nocase_tail ("extern")) /* superfluous, really! */ { found_tag = false; verify_tag = false; } } else if (c_tolower (*dbp) == 'f') { if (nocase_tail ("forward")) /* check for forward reference */ { found_tag = false; verify_tag = false; } } if (found_tag && verify_tag) /* not external proc, so make tag */ { found_tag = false; verify_tag = false; make_tag (name, namelen, true, tline.buffer, taglen, save_lineno, save_lcno); continue; } } if (get_tagname) /* grab name of proc or fn */ { char *cp; if (*dbp == '\0') continue; /* Find block name. */ for (cp = dbp + 1; *cp != '\0' && !endtoken (*cp); cp++) continue; /* Save all values for later tagging. */ linebuffer_setlen (&tline, lb.len); strcpy (tline.buffer, lb.buffer); save_lineno = lineno; save_lcno = linecharno; name = tline.buffer + (dbp - lb.buffer); namelen = cp - dbp; taglen = cp - lb.buffer + 1; dbp = cp; /* set dbp to e-o-token */ get_tagname = false; found_tag = true; continue; /* And proceed to check for "extern". */ } else if (!incomment && !inquote && !found_tag) { /* Check for proc/fn keywords. */ switch (c_tolower (c)) { case 'p': if (nocase_tail ("rocedure")) /* c = 'p', dbp has advanced */ get_tagname = true; continue; case 'f': if (nocase_tail ("unction")) get_tagname = true; continue; } } } /* while not eof */ free (tline.buffer); } /* * Lisp tag functions * look for (def or (DEF, quote or QUOTE */ static void L_getit (void); static void L_getit (void) { if (*dbp == '\'') /* Skip prefix quote */ dbp++; else if (*dbp == '(') { dbp++; /* Try to skip "(quote " */ if (!LOOKING_AT (dbp, "quote") && !LOOKING_AT (dbp, "QUOTE")) /* Ok, then skip "(" before name in (defstruct (foo)) */ dbp = skip_spaces (dbp); } get_lispy_tag (dbp); } static void Lisp_functions (FILE *inf) { LOOP_ON_INPUT_LINES (inf, lb, dbp) { if (dbp[0] != '(') continue; /* "(defvar foo)" is a declaration rather than a definition. */ if (! declarations) { char *p = dbp + 1; if (LOOKING_AT (p, "defvar")) { p = skip_name (p); /* past var name */ p = skip_spaces (p); if (*p == ')') continue; } } if (strneq (dbp + 1, "cl-", 3) || strneq (dbp + 1, "CL-", 3)) dbp += 3; if (strneq (dbp+1, "def", 3) || strneq (dbp+1, "DEF", 3)) { dbp = skip_non_spaces (dbp); dbp = skip_spaces (dbp); L_getit (); } else { /* Check for (foo::defmumble name-defined ... */ do dbp++; while (!notinname (*dbp) && *dbp != ':'); if (*dbp == ':') { do dbp++; while (*dbp == ':'); if (strneq (dbp, "def", 3) || strneq (dbp, "DEF", 3)) { dbp = skip_non_spaces (dbp); dbp = skip_spaces (dbp); L_getit (); } } } } } /* * Lua script language parsing * Original code by David A. Capello (2004) * * "function" and "local function" are tags if they start at column 1. */ static void Lua_functions (FILE *inf) { register char *bp; LOOP_ON_INPUT_LINES (inf, lb, bp) { bp = skip_spaces (bp); if (bp[0] != 'f' && bp[0] != 'l') continue; (void)LOOKING_AT (bp, "local"); /* skip possible "local" */ if (LOOKING_AT (bp, "function")) { char *tag_name, *tp_dot, *tp_colon; get_tag (bp, &tag_name); /* If the tag ends with ".foo" or ":foo", make an additional tag for "foo". */ tp_dot = strrchr (tag_name, '.'); tp_colon = strrchr (tag_name, ':'); if (tp_dot || tp_colon) { char *p = tp_dot > tp_colon ? tp_dot : tp_colon; ptrdiff_t len_add = p - tag_name + 1; get_tag (bp + len_add, NULL); } } } } /* * PostScript tags * Just look for lines where the first character is '/' * Also look at "defineps" for PSWrap * Ideas by: * Richard Mlynarik (1997) * Masatake Yamato (1999) */ static void PS_functions (FILE *inf) { register char *bp, *ep; LOOP_ON_INPUT_LINES (inf, lb, bp) { if (bp[0] == '/') { for (ep = bp+1; *ep != '\0' && *ep != ' ' && *ep != '{'; ep++) continue; make_tag (bp, ep - bp, true, lb.buffer, ep - lb.buffer + 1, lineno, linecharno); } else if (LOOKING_AT (bp, "defineps")) get_tag (bp, NULL); } } /* * Forth tags * Ignore anything after \ followed by space or in ( ) * Look for words defined by : * Look for constant, code, create, defer, value, and variable * OBP extensions: Look for buffer:, field, * Ideas by Eduardo Horvath (2004) */ static void Forth_words (FILE *inf) { register char *bp; LOOP_ON_INPUT_LINES (inf, lb, bp) while ((bp = skip_spaces (bp))[0] != '\0') if (bp[0] == '\\' && c_isspace (bp[1])) break; /* read next line */ else if (bp[0] == '(' && c_isspace (bp[1])) do /* skip to ) or eol */ bp++; while (*bp != ')' && *bp != '\0'); else if (((bp[0] == ':' && c_isspace (bp[1]) && bp++) || LOOKING_AT_NOCASE (bp, "constant") || LOOKING_AT_NOCASE (bp, "2constant") || LOOKING_AT_NOCASE (bp, "fconstant") || LOOKING_AT_NOCASE (bp, "code") || LOOKING_AT_NOCASE (bp, "create") || LOOKING_AT_NOCASE (bp, "defer") || LOOKING_AT_NOCASE (bp, "value") || LOOKING_AT_NOCASE (bp, "2value") || LOOKING_AT_NOCASE (bp, "fvalue") || LOOKING_AT_NOCASE (bp, "variable") || LOOKING_AT_NOCASE (bp, "2variable") || LOOKING_AT_NOCASE (bp, "fvariable") || LOOKING_AT_NOCASE (bp, "buffer:") || LOOKING_AT_NOCASE (bp, "field:") || LOOKING_AT_NOCASE (bp, "+field") || LOOKING_AT_NOCASE (bp, "field") /* not standard? */ || LOOKING_AT_NOCASE (bp, "begin-structure") || LOOKING_AT_NOCASE (bp, "synonym") ) && c_isspace (bp[0])) { /* Yay! A definition! */ char* name_start = skip_spaces (bp); char* name_end = skip_non_spaces (name_start); if (name_start < name_end) make_tag (name_start, name_end - name_start, true, lb.buffer, name_end - lb.buffer, lineno, linecharno); bp = name_end; } else bp = skip_non_spaces (bp); } /* * Scheme tag functions * look for (def... xyzzy * (def... (xyzzy * (def ... ((...(xyzzy .... * (set! xyzzy * Original code by Ken Haase (1985?) */ static void Scheme_functions (FILE *inf) { register char *bp; LOOP_ON_INPUT_LINES (inf, lb, bp) { if (strneq (bp, "(def", 4) || strneq (bp, "(DEF", 4)) { bp = skip_non_spaces (bp+4); /* Skip over open parens and white space. Don't continue past '\0' or '='. */ while (*bp && notinname (*bp) && *bp != '=') bp++; get_lispy_tag (bp); } if (LOOKING_AT (bp, "(SET!") || LOOKING_AT (bp, "(set!")) get_lispy_tag (bp); } } /* Find tags in TeX and LaTeX input files. */ /* TEX_toktab is a table of TeX control sequences that define tags. * Each entry records one such control sequence. * * Original code from who knows whom. * Ideas by: * Stefan Monnier (2002) */ static linebuffer *TEX_toktab = NULL; /* Table with tag tokens */ /* Default set of control sequences to put into TEX_toktab. The value of environment var TEXTAGS is prepended to this. */ static const char *TEX_defenv = "\ :chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem\ :part:appendix:entry:index:def\ :newcommand:renewcommand:newenvironment:renewenvironment"; static void TEX_decode_env (const char *, const char *); /* * TeX/LaTeX scanning loop. */ static void TeX_commands (FILE *inf) { char *cp; linebuffer *key; char TEX_esc = '\0'; char TEX_opgrp UNINIT, TEX_clgrp UNINIT; /* Initialize token table once from environment. */ if (TEX_toktab == NULL) TEX_decode_env ("TEXTAGS", TEX_defenv); LOOP_ON_INPUT_LINES (inf, lb, cp) { /* Look at each TEX keyword in line. */ for (;;) { /* Look for a TEX escape. */ while (true) { char c = *cp++; if (c == '\0' || c == '%') goto tex_next_line; /* Select either \ or ! as escape character, whichever comes first outside a comment. */ if (!TEX_esc) switch (c) { case '\\': TEX_esc = c; TEX_opgrp = '{'; TEX_clgrp = '}'; break; case '!': TEX_esc = c; TEX_opgrp = '<'; TEX_clgrp = '>'; break; } if (c == TEX_esc) break; } for (key = TEX_toktab; key->buffer != NULL; key++) if (strneq (cp, key->buffer, key->len)) { char *p; ptrdiff_t namelen, linelen; bool opgrp = false; cp = skip_spaces (cp + key->len); if (*cp == TEX_opgrp) { opgrp = true; cp++; } for (p = cp; (!c_isspace (*p) && *p != '#' && *p != TEX_opgrp && *p != TEX_clgrp); p++) continue; namelen = p - cp; linelen = lb.len; if (!opgrp || *p == TEX_clgrp) { while (*p != '\0' && *p != TEX_opgrp && *p != TEX_clgrp) p++; linelen = p - lb.buffer + 1; } make_tag (cp, namelen, true, lb.buffer, linelen, lineno, linecharno); goto tex_next_line; /* We only tag a line once */ } } tex_next_line: ; } } /* Read environment and prepend it to the default string. Build token table. */ static void TEX_decode_env (const char *evarname, const char *defenv) { const char *env, *p; ptrdiff_t len; /* Append default string to environment. */ env = getenv (evarname); if (!env) env = defenv; else env = concat (env, defenv, ""); /* Allocate a token table */ for (len = 1, p = env; (p = strchr (p, ':')); ) if (*++p) len++; TEX_toktab = xnew (len, linebuffer); /* Unpack environment string into token table. Be careful about */ /* zero-length strings (leading ':', "::" and trailing ':') */ for (ptrdiff_t i = 0; *env != '\0'; ) { p = strchr (env, ':'); if (!p) /* End of environment string. */ p = env + strlen (env); if (p - env > 0) { /* Only non-zero strings. */ TEX_toktab[i].buffer = savenstr (env, p - env); TEX_toktab[i].len = p - env; i++; } if (*p) env = p + 1; else { TEX_toktab[i].buffer = NULL; /* Mark end of table. */ TEX_toktab[i].len = 0; break; } } } /* Texinfo support. Dave Love, Mar. 2000. */ static void Texinfo_nodes (FILE *inf) { char *cp, *start; LOOP_ON_INPUT_LINES (inf, lb, cp) if (LOOKING_AT (cp, "@node")) { start = cp; while (*cp != '\0' && *cp != ',') cp++; make_tag (start, cp - start, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } /* * HTML support. * Contents of , <h1>, <h2>, <h3> are tags. * Contents of <a name=xxx> are tags with name xxx. * * Francesco Potortì, 2002. */ static void HTML_labels (FILE *inf) { bool getnext = false; /* next text outside of HTML tags is a tag */ bool skiptag = false; /* skip to the end of the current HTML tag */ bool intag = false; /* inside an html tag, looking for ID= */ bool inanchor = false; /* when INTAG, is an anchor, look for NAME= */ char *end; linebuffer_setlen (&token_name, 0); /* no name in buffer */ LOOP_ON_INPUT_LINES (inf, lb, dbp) for (;;) /* loop on the same line */ { if (skiptag) /* skip HTML tag */ { while (*dbp != '\0' && *dbp != '>') dbp++; if (*dbp == '>') { dbp += 1; skiptag = false; continue; /* look on the same line */ } break; /* go to next line */ } else if (intag) /* look for "name=" or "id=" */ { while (*dbp != '\0' && *dbp != '>' && c_tolower (*dbp) != 'n' && c_tolower (*dbp) != 'i') dbp++; if (*dbp == '\0') break; /* go to next line */ if (*dbp == '>') { dbp += 1; intag = false; continue; /* look on the same line */ } if ((inanchor && LOOKING_AT_NOCASE (dbp, "name=")) || LOOKING_AT_NOCASE (dbp, "id=")) { bool quoted = (dbp[0] == '"'); if (quoted) for (end = ++dbp; *end != '\0' && *end != '"'; end++) continue; else for (end = dbp; *end != '\0' && intoken (*end); end++) continue; linebuffer_setlen (&token_name, end - dbp); memcpyz (token_name.buffer, dbp, end - dbp); dbp = end; intag = false; /* we found what we looked for */ skiptag = true; /* skip to the end of the tag */ getnext = true; /* then grab the text */ continue; /* look on the same line */ } dbp += 1; } else if (getnext) /* grab next tokens and tag them */ { dbp = skip_spaces (dbp); if (*dbp == '\0') break; /* go to next line */ if (*dbp == '<') { intag = true; inanchor = (c_tolower (dbp[1]) == 'a' && !intoken (dbp[2])); continue; /* look on the same line */ } for (end = dbp + 1; *end != '\0' && *end != '<'; end++) continue; make_tag (token_name.buffer, token_name.len, true, dbp, end - dbp, lineno, linecharno); linebuffer_setlen (&token_name, 0); /* no name in buffer */ getnext = false; break; /* go to next line */ } else /* look for an interesting HTML tag */ { while (*dbp != '\0' && *dbp != '<') dbp++; if (*dbp == '\0') break; /* go to next line */ intag = true; if (c_tolower (dbp[1]) == 'a' && !intoken (dbp[2])) { inanchor = true; continue; /* look on the same line */ } else if (LOOKING_AT_NOCASE (dbp, "<title>") || LOOKING_AT_NOCASE (dbp, "<h1>") || LOOKING_AT_NOCASE (dbp, "<h2>") || LOOKING_AT_NOCASE (dbp, "<h3>")) { intag = false; getnext = true; continue; /* look on the same line */ } dbp += 1; } } } /* * Prolog support * * Assumes that the predicate or rule starts at column 0. * Only the first clause of a predicate or rule is added. * Original code by Sunichirou Sugou (1989) * Rewritten by Anders Lindgren (1996) */ static ptrdiff_t prolog_pr (char *, char *, ptrdiff_t); static void prolog_skip_comment (linebuffer *, FILE *); static size_t prolog_atom (char *, size_t); static void Prolog_functions (FILE *inf) { char *cp, *last = NULL; ptrdiff_t lastlen = 0, allocated = 0; LOOP_ON_INPUT_LINES (inf, lb, cp) { if (cp[0] == '\0') /* Empty line */ continue; else if (c_isspace (cp[0])) /* Not a predicate */ continue; else if (cp[0] == '/' && cp[1] == '*') /* comment. */ prolog_skip_comment (&lb, inf); else { ptrdiff_t len = prolog_pr (cp, last, lastlen); if (0 < len) { /* Store the predicate name to avoid generating duplicate tags later. */ if (allocated <= len) { xrnew (last, len + 1, 1); allocated = len + 1; } memcpyz (last, cp, len); lastlen = len; } } } free (last); } static void prolog_skip_comment (linebuffer *plb, FILE *inf) { char *cp; do { for (cp = plb->buffer; *cp != '\0'; cp++) if (cp[0] == '*' && cp[1] == '/') return; readline (plb, inf); } while (perhaps_more_input (inf)); } /* * A predicate or rule definition is added if it matches: * <beginning of line><Prolog Atom><whitespace>( * or <beginning of line><Prolog Atom><whitespace>:- * * It is added to the tags database if it doesn't match the * name of the previous clause header. * * Return the size of the name of the predicate or rule, or 0 if no * header was found. */ static ptrdiff_t prolog_pr (char *s, char *last, ptrdiff_t lastlen) { ptrdiff_t len = prolog_atom (s, 0); if (len == 0) return 0; ptrdiff_t pos = skip_spaces (s + len) - s; /* Save only the first clause. */ if ((s[pos] == '.' || (s[pos] == '(' && (pos += 1)) || (s[pos] == ':' && s[pos + 1] == '-' && (pos += 2))) && ! (lastlen == len && memcmp (s, last, len) == 0)) { make_tag (s, len, true, s, pos, lineno, linecharno); return len; } return 0; } /* * Consume a Prolog atom. * Return the number of bytes consumed, or 0 if there was an error. * * A prolog atom, in this context, could be one of: * - An alphanumeric sequence, starting with a lower case letter. * - A quoted arbitrary string. Single quotes can escape themselves. * Backslash quotes everything. */ static size_t prolog_atom (char *s, size_t pos) { size_t origpos; origpos = pos; if (c_islower (s[pos]) || s[pos] == '_') { /* The atom is unquoted. */ pos++; while (c_isalnum (s[pos]) || s[pos] == '_') { pos++; } return pos - origpos; } else if (s[pos] == '\'') { pos++; for (;;) { if (s[pos] == '\'') { pos++; if (s[pos] != '\'') break; pos++; /* A double quote */ } else if (s[pos] == '\0') /* Multiline quoted atoms are ignored. */ return 0; else if (s[pos] == '\\') { if (s[pos+1] == '\0') return 0; pos += 2; } else pos++; } return pos - origpos; } else return 0; } /* * Support for Mercury * * Assumes that the declarations start at column 0. * Original code by Sunichirou Sugou (1989) for Prolog. * Rewritten by Anders Lindgren (1996) for Prolog. * Adapted by Fabrice Nicol (2021) for Mercury. * Note: Prolog-support behavior is preserved if * --declarations is used, corresponding to * with_mercury_definitions=true. */ static ptrdiff_t mercury_pr (char *, char *, ptrdiff_t); static void mercury_skip_comment (linebuffer *, FILE *); static bool is_mercury_type = false; static bool is_mercury_quantifier = false; static bool is_mercury_declaration = false; typedef struct { size_t pos; /* Position reached in parsing tag name. */ size_t namelength; /* Length of tag name */ size_t totlength; /* Total length of parsed tag: this field is currently reserved for control and debugging. */ } mercury_pos_t; /* * Objective-C and Mercury have identical file extension .m. * To disambiguate between Objective C and Mercury, parse file * with the following heuristics hook: * - if line starts with :-, choose Mercury unconditionally; * - if line starts with #, @, choose Objective-C; * - otherwise compute the following ratio: * * r = (number of lines with :- * or % in non-commented parts or . at trimmed EOL) * / (number of lines - number of lines starting by any amount * of whitespace, optionally followed by comment(s)) * * Note: strings are neglected in counts. * * If r > mercury_heuristics_ratio, choose Mercury. * Experimental tests show that a possibly optimal default value for * this floor value is around 0.5. This is the default value for * MERCURY_HEURISTICS_RATIO, defined in the first lines of this file. * The closer r is to 0.5, the closer the source code to pure Prolog. * Idiomatic Mercury is scored either with r = 1.0 or higher. * Objective-C is scored with r = 0.0. When this fails, the r-score * never rose above 0.1 in Objective-C tests. */ static void test_objc_is_mercury (char *this_file, language **lang) { if (this_file == NULL) return; FILE* fp = fopen (this_file, "r"); if (fp == NULL) pfatal (this_file); bool blank_line = false; /* Line starting with any amount of white space followed by optional comment(s). */ bool commented_line = false; bool found_dot = false; bool only_space_before = true; bool start_of_line = true; int c; intmax_t lines = 1; intmax_t mercury_dots = 0; intmax_t percentage_signs = 0; intmax_t rule_signs = 0; float ratio = 0; while ((c = fgetc (fp)) != EOF) { switch (c) { case '\n': if (! blank_line) ++lines; blank_line = true; commented_line = false; start_of_line = true; if (found_dot) ++mercury_dots; found_dot = false; only_space_before = true; break; case '.': found_dot = ! commented_line; only_space_before = false; break; case '%': /* More frequent in Mercury. May be modulo in Obj.-C. */ if (! commented_line) { ++percentage_signs; /* Cannot tell if it is a comment or modulo yet for sure. Yet works for heuristic purposes. */ commented_line = true; } found_dot = false; start_of_line = false; only_space_before = false; break; case '/': { int d = fgetc (fp); found_dot = false; only_space_before = false; if (! commented_line) { if (d == '*') commented_line = true; else /* If d == '/', cannot tell if it is an Obj.-C comment: may be Mercury integ. division. */ blank_line = false; } } FALLTHROUGH; case ' ': case '\t': start_of_line = false; break; case ':': c = fgetc (fp); if (start_of_line) { if (c == '-') { ratio = 1.0; /* Failsafe, not an operator in Obj.-C. */ goto out; } start_of_line = false; } else { /* p :- q. Frequent in Mercury. Rare or in quoted exprs in Obj.-C. */ if (c == '-' && ! commented_line) ++rule_signs; } blank_line = false; found_dot = false; only_space_before = false; break; case '@': case '#': if (start_of_line || only_space_before) { ratio = 0.0; goto out; } FALLTHROUGH; default: start_of_line = false; blank_line = false; found_dot = false; only_space_before = false; } } /* Fallback heuristic test. Not failsafe but errless in practice. */ ratio = ((float) rule_signs + percentage_signs + mercury_dots) / lines; out: if (fclose (fp) == EOF) pfatal (this_file); if (ratio > mercury_heuristics_ratio) { /* Change the language from Objective-C to Mercury. */ static language lang0 = { "mercury", Mercury_help, Mercury_functions, Mercury_suffixes }; *lang = &lang0; } } static void Mercury_functions (FILE *inf) { char *cp, *last = NULL; ptrdiff_t lastlen = 0, allocated = 0; if (declarations) with_mercury_definitions = true; LOOP_ON_INPUT_LINES (inf, lb, cp) { if (cp[0] == '\0') /* Empty line. */ continue; else if (c_isspace (cp[0]) || cp[0] == '%') /* A Prolog-type comment or anything other than a declaration. */ continue; else if (cp[0] == '/' && cp[1] == '*') /* Mercury C-type comment. */ mercury_skip_comment (&lb, inf); else { is_mercury_declaration = (cp[0] == ':' && cp[1] == '-'); if (is_mercury_declaration || with_mercury_definitions) { ptrdiff_t len = mercury_pr (cp, last, lastlen); if (0 < len) { /* Store the declaration to avoid generating duplicate tags later. */ if (allocated <= len) { xrnew (last, len + 1, 1); allocated = len + 1; } memcpyz (last, cp, len); lastlen = len; } } } } free (last); } static void mercury_skip_comment (linebuffer *plb, FILE *inf) { char *cp; do { for (cp = plb->buffer; *cp != '\0'; ++cp) if (cp[0] == '*' && cp[1] == '/') return; readline (plb, inf); } while (perhaps_more_input (inf)); } /* * A declaration is added if it matches: * <beginning of line>:-<whitespace><Mercury Term><whitespace>( * If with_mercury_definitions == true, we also add: * <beginning of line><Mercury item><whitespace>( * or <beginning of line><Mercury item><whitespace>:- * As for Prolog support, different arities and types are not taken into * consideration. * Item is added to the tags database if it doesn't match the * name of the previous declaration. * * Consume a Mercury declaration. * Return the number of bytes consumed, or 0 if there was an error. * * A Mercury declaration must be one of: * :- type * :- solver type * :- pred * :- func * :- inst * :- mode * :- typeclass * :- instance * :- pragma * :- promise * :- initialise * :- finalise * :- mutable * :- module * :- interface * :- implementation * :- import_module * :- use_module * :- include_module * :- end_module * followed on the same line by an alphanumeric sequence, starting with a lower * case letter or by a single-quoted arbitrary string. * Single quotes can escape themselves. Backslash quotes everything. * * Return the size of the name of the declaration or 0 if no header was found. * As quantifiers may precede functions or predicates, we must list them too. */ static const char *Mercury_decl_tags[] = {"type", "solver type", "pred", "func", "inst", "mode", "typeclass", "instance", "pragma", "promise", "initialise", "finalise", "mutable", "module", "interface", "implementation", "import_module", "use_module", "include_module", "end_module", "some", "all"}; static mercury_pos_t mercury_decl (char *s, size_t pos) { mercury_pos_t null_pos = {0, 0, 0}; if (s == NULL) return null_pos; size_t origpos; origpos = pos; while (s + pos != NULL && (c_isalnum (s[pos]) || s[pos] == '_')) ++pos; unsigned char decl_type_length = pos - origpos; char buf[decl_type_length + 1]; memset (buf, 0, decl_type_length + 1); /* Mercury declaration tags. Consume them, then check the declaration item following :- is legitimate, then go on as in the prolog case. */ memcpy (buf, &s[origpos], decl_type_length); bool found_decl_tag = false; if (is_mercury_quantifier) { if (strcmp (buf, "pred") != 0 && strcmp (buf, "func") != 0) /* Bad syntax. */ return null_pos; is_mercury_quantifier = false; /* Reset to base value. */ found_decl_tag = true; } else { for (int j = 0; j < sizeof (Mercury_decl_tags) / sizeof (char*); ++j) { if (strcmp (buf, Mercury_decl_tags[j]) == 0) { found_decl_tag = true; if (strcmp (buf, "type") == 0) is_mercury_type = true; if (strcmp (buf, "some") == 0 || strcmp (buf, "all") == 0) { is_mercury_quantifier = true; } break; /* Found declaration tag of rank j. */ } else /* 'solver type' has a blank in the middle, so this is the hard case. */ if (strcmp (buf, "solver") == 0) { ++pos; while (s + pos != NULL && (c_isalnum (s[pos]) || s[pos] == '_')) ++pos; decl_type_length = pos - origpos; char buf2[decl_type_length + 1]; memset (buf2, 0, decl_type_length + 1); memcpy (buf2, &s[origpos], decl_type_length); if (strcmp (buf2, "solver type") == 0) { found_decl_tag = false; break; /* Found declaration tag of rank j. */ } } } } /* If with_mercury_definitions == false * this is a Mercury syntax error, ignoring... */ if (with_mercury_definitions) { if (found_decl_tag) pos = skip_spaces (s + pos) - s; /* Skip len blanks again. */ else /* Prolog-like behavior * we have parsed the predicate once, yet inappropriately * so restarting again the parsing step. */ pos = 0; } else { if (found_decl_tag) pos = skip_spaces (s + pos) - s; /* Skip len blanks again. */ else return null_pos; } /* From now on it is the same as for Prolog except for module dots. */ size_t start_of_name = pos; if (c_islower (s[pos]) || s[pos] == '_' ) { /* The name is unquoted. Do not confuse module dots with end-of-declaration dots. */ int module_dot_pos = 0; while (c_isalnum (s[pos]) || s[pos] == '_' || (s[pos] == '.' /* A module dot. */ && s + pos + 1 != NULL && (c_isalnum (s[pos + 1]) || s[pos + 1] == '_') && (module_dot_pos = pos))) /* Record module dot position. Erase module from name. */ ++pos; if (module_dot_pos) { start_of_name = module_dot_pos + 2; ++pos; } mercury_pos_t position = {pos, pos - start_of_name + 1, pos - origpos}; return position; } else if (s[pos] == '\'') { ++pos; for (;;) { if (s[pos] == '\'') { ++pos; if (s[pos] != '\'') break; ++pos; /* A double quote. */ } else if (s[pos] == '\0') /* Multiline quoted atoms are ignored. */ return null_pos; else if (s[pos] == '\\') { if (s[pos+1] == '\0') return null_pos; pos += 2; } else ++pos; } mercury_pos_t position = {pos, pos - start_of_name + 1, pos - origpos}; return position; } else if (is_mercury_quantifier && s[pos] == '[') /* :- some [T] pred/func. */ { for (++pos; s + pos != NULL && s[pos] != ']'; ++pos) {} if (s + pos == NULL) return null_pos; ++pos; pos = skip_spaces (s + pos) - s; mercury_pos_t position = mercury_decl (s, pos); position.totlength += pos - origpos; return position; } else if (s[pos] == '.') /* as in ':- interface.' */ { mercury_pos_t position = {pos, pos - origpos + 1, pos - origpos}; return position; } else return null_pos; } static ptrdiff_t mercury_pr (char *s, char *last, ptrdiff_t lastlen) { size_t len0 = 0; is_mercury_type = false; is_mercury_quantifier = false; bool stop_at_rule = false; if (is_mercury_declaration) { /* Skip len0 blanks only for declarations. */ len0 = skip_spaces (s + 2) - s; } mercury_pos_t position = mercury_decl (s, len0); size_t pos = position.pos; int offset = 0; /* may be < 0 */ if (pos == 0) return 0; /* Skip white space for: a. rules in definitions before :- b. 0-arity predicates with inlined modes. c. possibly multiline type definitions */ while (c_isspace (s[pos])) { ++pos; ++offset; } if (( ((s[pos] == '.' && (pos += 1)) /* case 1 This is a statement dot, not a module dot. */ || c_isalnum(s[pos]) /* 0-arity procedures */ || (s[pos] == '(' && (pos += 1)) /* case 2: arity > 0 */ || ((s[pos] == ':') /* case 3: rules */ && s[pos + 1] == '-' && (stop_at_rule = true))) && (lastlen != pos || memcmp (s, last, pos) != 0) ) /* Types are often declared on several lines so keeping just the first line. */ || is_mercury_type) /* When types are implemented. */ { size_t namelength = position.namelength; if (stop_at_rule && offset) --offset; /* Left-trim type definitions. */ while (pos > namelength + offset && c_isspace (s[pos - namelength - offset])) --offset; make_tag (s + pos - namelength - offset, namelength - 1, true, s, pos - offset - 1, lineno, linecharno); return pos; } return 0; } /* * Support for Erlang * * Generates tags for functions, defines, and records. * Assumes that Erlang functions start at column 0. * Original code by Anders Lindgren (1996) */ static ptrdiff_t erlang_func (char *, char *, ptrdiff_t, ptrdiff_t *); static void erlang_attribute (char *); static ptrdiff_t erlang_atom (char *); static void Erlang_functions (FILE *inf) { char *cp, *last = NULL; ptrdiff_t lastlen = 0, allocated = 0; LOOP_ON_INPUT_LINES (inf, lb, cp) { if (cp[0] == '\0') /* Empty line */ continue; else if (c_isspace (cp[0])) /* Not function nor attribute */ continue; else if (cp[0] == '%') /* comment */ continue; else if (cp[0] == '"') /* Sometimes, strings start in column one */ continue; else if (cp[0] == '-') /* attribute, e.g. "-define" */ { erlang_attribute (cp); if (last != NULL) { free (last); last = NULL; allocated = lastlen = 0; } } else { ptrdiff_t name_offset; ptrdiff_t len = erlang_func (cp, last, lastlen, &name_offset); if (0 < len) { /* Store the function name to avoid generating duplicate tags later. */ if (allocated <= len) { xrnew (last, len + 1, 1); allocated = len + 1; } memcpyz (last, cp + name_offset, len); lastlen = len; } } } free (last); } /* * A function definition is added if it matches: * <beginning of line><Erlang Atom><whitespace>( * * It is added to the tags database if it doesn't match the * name of the previous clause header. * * Return the size of the name of the function, or 0 if no function * was found. */ static ptrdiff_t erlang_func (char *s, char *last, ptrdiff_t lastlen, ptrdiff_t *name_offset) { char *name = s; ptrdiff_t len = erlang_atom (s); if (len == 0) return 0; ptrdiff_t pos = skip_spaces (s + len) - s; /* If the name is quoted, the quotes are not part of the name. */ bool quoted = 2 < len && name[0] == '\'' && name[len - 1] == '\''; name += quoted; len -= 2 * quoted; /* Save only the first clause. */ if (s[pos++] == '(' && ! (lastlen == len && memcmp (name, last, len) == 0)) { make_tag (s, len, true, s, pos, lineno, linecharno); *name_offset = quoted; return len; } return 0; } /* * Handle attributes. Currently, tags are generated for defines * and records. * * They are on the form: * -define(foo, bar). * -define(Foo(M, N), M+N). * -record(graph, {vtab = notable, cyclic = true}). */ static void erlang_attribute (char *s) { char *cp = s; if ((LOOKING_AT (cp, "-define") || LOOKING_AT (cp, "-record")) && *cp++ == '(') { cp = skip_spaces (cp); ptrdiff_t len = erlang_atom (cp); ptrdiff_t pos = cp + len - s; if (len > 0) { /* If the name is quoted, the quotes are not part of the name. */ if (len > 2 && cp[0] == '\'' && cp[len - 1] == '\'') { cp++; len -= 2; } make_tag (cp, len, true, s, pos, lineno, linecharno); } } return; } /* * Consume an Erlang atom (or variable). * Return the number of bytes consumed, or -1 if there was an error. */ static ptrdiff_t erlang_atom (char *s) { ptrdiff_t pos = 0; if (c_isalpha (s[pos]) || s[pos] == '_') { /* The atom is unquoted. */ do pos++; while (c_isalnum (s[pos]) || s[pos] == '_'); } else if (s[pos] == '\'') { for (pos++; s[pos] != '\''; pos++) if (s[pos] == '\0' /* multiline quoted atoms are ignored */ || (s[pos] == '\\' && s[++pos] == '\0')) return 0; pos++; } return pos; } static char *scan_separators (char *); static void add_regex (char *, language *); static char *substitute (char *, char *, struct re_registers *); /* * Take a string like "/blah/" and turn it into "blah", verifying * that the first and last characters are the same, and handling * quoted separator characters. Actually, stops on the occurrence of * an unquoted separator. Also process \t, \n, etc. and turn into * appropriate characters. Works in place. Null terminates name string. * Returns pointer to terminating separator, or NULL for * unterminated regexps. */ static char * scan_separators (char *name) { char sep = name[0]; char *copyto = name; bool quoted = false; for (++name; *name != '\0'; ++name) { if (quoted) { switch (*name) { case 'a': *copyto++ = '\007'; break; /* BEL (bell) */ case 'b': *copyto++ = '\b'; break; /* BS (back space) */ case 'd': *copyto++ = 0177; break; /* DEL (delete) */ case 'e': *copyto++ = 033; break; /* ESC (delete) */ case 'f': *copyto++ = '\f'; break; /* FF (form feed) */ case 'n': *copyto++ = '\n'; break; /* NL (new line) */ case 'r': *copyto++ = '\r'; break; /* CR (carriage return) */ case 't': *copyto++ = '\t'; break; /* TAB (horizontal tab) */ case 'v': *copyto++ = '\v'; break; /* VT (vertical tab) */ default: if (*name == sep) *copyto++ = sep; else { /* Something else is quoted, so preserve the quote. */ *copyto++ = '\\'; *copyto++ = *name; } break; } quoted = false; } else if (*name == '\\') quoted = true; else if (*name == sep) break; else *copyto++ = *name; } if (*name != sep) name = NULL; /* signal unterminated regexp */ /* Terminate copied string. */ *copyto = '\0'; return name; } /* Look at the argument of --regex or --no-regex and do the right thing. Same for each line of a regexp file. */ static void analyze_regex (char *regex_arg) { if (regex_arg == NULL) { free_regexps (); /* --no-regex: remove existing regexps */ return; } /* A real --regexp option or a line in a regexp file. */ switch (regex_arg[0]) { /* Comments in regexp file or null arg to --regex. */ case '\0': case ' ': case '\t': break; /* Read a regex file. This is recursive and may result in a loop, which will stop when the file descriptors are exhausted. */ case '@': { FILE *regexfp; linebuffer regexbuf; char *regexfile = regex_arg + 1; /* regexfile is a file containing regexps, one per line. */ regexfp = fopen (regexfile, "r" FOPEN_BINARY); if (regexfp == NULL) pfatal (regexfile); linebuffer_init (®exbuf); while (readline_internal (®exbuf, regexfp, regexfile) > 0) analyze_regex (regexbuf.buffer); free (regexbuf.buffer); if (fclose (regexfp) != 0) pfatal (regexfile); } break; /* Regexp to be used for a specific language only. */ case '{': { language *lang; char *lang_name = regex_arg + 1; char *cp; for (cp = lang_name; *cp != '}'; cp++) if (*cp == '\0') { error ("unterminated language name in regex: %s", regex_arg); return; } *cp++ = '\0'; lang = get_language_from_langname (lang_name); if (lang == NULL) return; add_regex (cp, lang); } break; /* Regexp to be used for any language. */ default: add_regex (regex_arg, NULL); break; } } /* Separate the regexp pattern, compile it, and care for optional name and modifiers. */ static void add_regex (char *regexp_pattern, language *lang) { static struct re_pattern_buffer zeropattern; char sep, *pat, *name, *modifiers; char empty = '\0'; const char *err; struct re_pattern_buffer *patbuf; regexp *rp; bool ignore_case = false, /* case is significant */ multi_line = false, /* matches are done one line at a time */ single_line = false; /* dot does not match newline */ if (strnlen (regexp_pattern, 3) < 3) { error ("null regexp"); return; } sep = regexp_pattern[0]; name = scan_separators (regexp_pattern); if (name == NULL) { error ("%s: unterminated regexp", regexp_pattern); return; } if (name[1] == sep) { error ("null name for regexp \"%s\"", regexp_pattern); return; } modifiers = scan_separators (name); if (modifiers == NULL) /* no terminating separator --> no name */ { modifiers = name; name = ∅ } else modifiers += 1; /* skip separator */ /* Parse regex modifiers. */ for (; modifiers[0] != '\0'; modifiers++) switch (modifiers[0]) { case 'N': if (modifiers == name) error ("forcing explicit tag name but no name, ignoring"); /* This option has no effect and is present only for backward compatibility. */ break; case 'i': ignore_case = true; break; case 's': single_line = true; FALLTHROUGH; case 'm': multi_line = true; need_filebuf = true; break; default: error ("invalid regexp modifier '%c', ignoring", modifiers[0]); break; } patbuf = xnew (1, struct re_pattern_buffer); *patbuf = zeropattern; if (ignore_case) { static unsigned char lc_trans[UCHAR_MAX + 1]; int i; for (i = 0; i < UCHAR_MAX + 1; i++) lc_trans[i] = c_tolower (i); patbuf->translate = lc_trans; /* translation table to fold case */ } if (multi_line) pat = concat ("^", regexp_pattern, ""); /* anchor to beginning of line */ else pat = regexp_pattern; if (single_line) re_set_syntax (RE_SYNTAX_EMACS | RE_DOT_NEWLINE); else re_set_syntax (RE_SYNTAX_EMACS); err = re_compile_pattern (pat, strlen (pat), patbuf); if (multi_line) free (pat); if (err != NULL) { error ("%s while compiling pattern", err); return; } rp = p_head; p_head = xnew (1, regexp); p_head->pattern = savestr (regexp_pattern); p_head->p_next = rp; p_head->lang = lang; p_head->pat = patbuf; p_head->name = savestr (name); p_head->error_signaled = false; p_head->ignore_case = ignore_case; p_head->multi_line = multi_line; } /* * Do the substitutions indicated by the regular expression and * arguments. */ static char * substitute (char *in, char *out, struct re_registers *regs) { char *result, *t; result = NULL; ptrdiff_t size = strlen (out); /* Pass 1: figure out how much to allocate by finding all \N strings. */ if (out[size - 1] == '\\') fatal ("pattern error in \"%s\"", out); for (t = strchr (out, '\\'); t != NULL; t = strchr (t + 2, '\\')) if (c_isdigit (t[1])) { int dig = t[1] - '0'; ptrdiff_t diglen = regs->end[dig] - regs->start[dig]; size += diglen - 2; } else size -= 1; /* Allocate space and do the substitutions. */ assert (size >= 0); result = xnew (size + 1, char); for (t = result; *out != '\0'; out++) if (*out == '\\' && c_isdigit (*++out)) { int dig = *out - '0'; ptrdiff_t diglen = regs->end[dig] - regs->start[dig]; memcpy (t, in + regs->start[dig], diglen); t += diglen; } else *t++ = *out; *t = '\0'; assert (t <= result + size); assert (t == result + strlen (result)); return result; } /* Deallocate all regexps. */ static void free_regexps (void) { regexp *rp; while (p_head != NULL) { rp = p_head->p_next; free (p_head->pattern); free (p_head->name); free (p_head); p_head = rp; } return; } /* * Reads the whole file as a single string from `filebuf' and looks for * multi-line regular expressions, creating tags on matches. * readline already dealt with normal regexps. * * Idea by Ben Wing <ben@666.com> (2002). */ static void regex_tag_multiline (void) { char *buffer = filebuf.buffer; regexp *rp; char *name; for (rp = p_head; rp != NULL; rp = rp->p_next) { ptrdiff_t match = 0; if (!rp->multi_line) continue; /* skip normal regexps */ /* Generic initializations before parsing file from memory. */ lineno = 1; /* reset global line number */ charno = 0; /* reset global char number */ linecharno = 0; /* reset global char number of line start */ /* Only use generic regexps or those for the current language. */ if (rp->lang != NULL && rp->lang != curfdp->lang) continue; while (match >= 0 && match < filebuf.len) { match = re_search (rp->pat, buffer, filebuf.len, charno, filebuf.len - match, &rp->regs); switch (match) { case -2: /* Some error. */ if (!rp->error_signaled) { error ("regexp stack overflow while matching \"%s\"", rp->pattern); rp->error_signaled = true; } break; case -1: /* No match. */ break; default: if (match == rp->regs.end[0]) { if (!rp->error_signaled) { error ("regexp matches the empty string: \"%s\"", rp->pattern); rp->error_signaled = true; } match = -3; /* exit from while loop */ break; } /* Match occurred. Construct a tag. */ while (charno < rp->regs.end[0]) if (buffer[charno++] == '\n') lineno++, linecharno = charno; name = rp->name; if (name[0] == '\0') name = NULL; else /* make a named tag */ name = substitute (buffer, rp->name, &rp->regs); /* Force explicit tag name, if a name is there. */ pfnote (name, true, buffer + linecharno, charno - linecharno + 1, lineno, linecharno); if (debug) fprintf (stderr, "%s on %s:%"PRIdMAX": %s\n", name ? name : "(unnamed)", curfdp->taggedfname, lineno, buffer + linecharno); break; } } } } static bool nocase_tail (const char *cp) { ptrdiff_t len = 0; while (*cp != '\0' && c_tolower (*cp) == c_tolower (dbp[len])) cp++, len++; if (*cp == '\0' && !intoken (dbp[len])) { dbp += len; return true; } return false; } static void get_tag (register char *bp, char **namepp) { register char *cp = bp; if (*bp != '\0') { /* Go till you get to white space or a syntactic break */ for (cp = bp + 1; !notinname (*cp); cp++) continue; make_tag (bp, cp - bp, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } if (namepp != NULL) *namepp = savenstr (bp, cp - bp); } /* Similar to get_tag, but include '=' as part of the tag. */ static void get_lispy_tag (register char *bp) { register char *cp = bp; if (*bp != '\0') { /* Go till you get to white space or a syntactic break */ for (cp = bp + 1; !notinname (*cp) || *cp == '='; cp++) continue; make_tag (bp, cp - bp, true, lb.buffer, cp - lb.buffer + 1, lineno, linecharno); } } /* * Read a line of text from `stream' into `lbp', excluding the * newline or CR-NL, if any. Return the number of characters read from * `stream', which is the length of the line including the newline. * * On DOS or Windows we do not count the CR character, if any before the * NL, in the returned length; this mirrors the behavior of Emacs on those * platforms (for text files, it translates CR-NL to NL as it reads in the * file). * * If multi-line regular expressions are requested, each line read is * appended to `filebuf'. */ static ptrdiff_t readline_internal (linebuffer *lbp, FILE *stream, char const *filename) { char *buffer = lbp->buffer; char *p = lbp->buffer; char *pend; int chars_deleted; pend = p + lbp->size; /* Separate to avoid 386/IX compiler bug. */ for (;;) { register int c = getc (stream); if (p == pend) { /* We're at the end of linebuffer: expand it. */ xrnew (buffer, lbp->size, 2); lbp->size *= 2; p += buffer - lbp->buffer; pend = buffer + lbp->size; lbp->buffer = buffer; } if (c == EOF) { if (ferror (stream)) perror (filename); *p = '\0'; chars_deleted = 0; break; } if (c == '\n') { if (p > buffer && p[-1] == '\r') { p -= 1; chars_deleted = 2; } else { chars_deleted = 1; } *p = '\0'; break; } *p++ = c; } lbp->len = p - buffer; if (need_filebuf /* we need filebuf for multi-line regexps */ && chars_deleted > 0) /* not at EOF */ { while (filebuf.size <= filebuf.len + lbp->len + 1) /* +1 for \n */ { /* Expand filebuf. */ xrnew (filebuf.buffer, filebuf.size, 2); filebuf.size *= 2; } strcpy (mempcpy (filebuf.buffer + filebuf.len, lbp->buffer, lbp->len), "\n"); filebuf.len += lbp->len + 1; } return lbp->len + chars_deleted; } /* * Like readline_internal, above, but in addition try to match the * input line against relevant regular expressions and manage #line * directives. */ static void readline (linebuffer *lbp, FILE *stream) { linecharno = charno; /* update global char number of line start */ ptrdiff_t result = readline_internal (lbp, stream, infilename); lineno += 1; /* increment global line number */ charno += result; /* increment global char number */ /* Honor #line directives. */ if (!no_line_directive) { static bool discard_until_line_directive; /* Check whether this is a #line directive. */ if (result > 12 && strneq (lbp->buffer, "#line ", 6)) { intmax_t lno; int start = 0; if (sscanf (lbp->buffer, "#line %"SCNdMAX" \"%n", &lno, &start) >= 1 && start > 0) /* double quote character found */ { char *endp = lbp->buffer + start; while ((endp = strchr (endp, '"')) != NULL && endp[-1] == '\\') endp++; if (endp != NULL) /* Ok, this is a real #line directive. Let's deal with it. */ { char *taggedabsname; /* absolute name of original file */ char *taggedfname; /* name of original file as given */ char *name; /* temp var */ discard_until_line_directive = false; /* found it */ name = lbp->buffer + start; *endp = '\0'; canonicalize_filename (name); taggedabsname = absolute_filename (name, tagfiledir); if (filename_is_absolute (name) || filename_is_absolute (curfdp->infname)) taggedfname = savestr (taggedabsname); else taggedfname = relative_filename (taggedabsname,tagfiledir); if (streq (curfdp->taggedfname, taggedfname)) /* The #line directive is only a line number change. We deal with this afterwards. */ free (taggedfname); else /* The tags following this #line directive should be attributed to taggedfname. In order to do this, set curfdp accordingly. */ { fdesc *fdp; /* file description pointer */ /* Go look for a file description already set up for the file indicated in the #line directive. If there is one, use it from now until the next #line directive. */ for (fdp = fdhead; fdp != NULL; fdp = fdp->next) if (streq (fdp->infname, curfdp->infname) && streq (fdp->taggedfname, taggedfname)) /* If we remove the second test above (after the &&) then all entries pertaining to the same file are coalesced in the tags file. If we use it, then entries pertaining to the same file but generated from different files (via #line directives) will go into separate sections in the tags file. These alternatives look equivalent. The first one destroys some apparently useless information. */ { curfdp = fdp; free (taggedfname); break; } /* Else, if we already tagged the real file, skip all input lines until the next #line directive. */ if (fdp == NULL) /* not found */ for (fdp = fdhead; fdp != NULL; fdp = fdp->next) if (streq (fdp->infabsname, taggedabsname)) { discard_until_line_directive = true; free (taggedfname); break; } /* Else create a new file description and use that from now on, until the next #line directive. */ if (fdp == NULL) /* not found */ { fdp = fdhead; fdhead = xnew (1, fdesc); *fdhead = *curfdp; /* copy curr. file description */ fdhead->next = fdp; fdhead->infname = savestr (curfdp->infname); fdhead->infabsname = savestr (curfdp->infabsname); fdhead->infabsdir = savestr (curfdp->infabsdir); fdhead->taggedfname = taggedfname; fdhead->usecharno = false; fdhead->prop = NULL; fdhead->written = false; curfdp = fdhead; } } free (taggedabsname); lineno = lno - 1; readline (lbp, stream); return; } /* if a real #line directive */ } /* if #line is followed by a number */ } /* if line begins with "#line " */ /* If we are here, no #line directive was found. */ if (discard_until_line_directive) { if (result > 0) { /* Do a tail recursion on ourselves, thus discarding the contents of the line buffer. */ readline (lbp, stream); return; } /* End of file. */ discard_until_line_directive = false; return; } } /* if #line directives should be considered */ { ptrdiff_t match; regexp *rp; char *name; /* Match against relevant regexps. */ if (lbp->len > 0) for (rp = p_head; rp != NULL; rp = rp->p_next) { /* Only use generic regexps or those for the current language. Also do not use multiline regexps, which is the job of regex_tag_multiline. */ if ((rp->lang != NULL && rp->lang != fdhead->lang) || rp->multi_line) continue; match = re_match (rp->pat, lbp->buffer, lbp->len, 0, &rp->regs); switch (match) { case -2: /* Some error. */ if (!rp->error_signaled) { error ("regexp stack overflow while matching \"%s\"", rp->pattern); rp->error_signaled = true; } break; case -1: /* No match. */ break; case 0: /* Empty string matched. */ if (!rp->error_signaled) { error ("regexp matches the empty string: \"%s\"", rp->pattern); rp->error_signaled = true; } break; default: /* Match occurred. Construct a tag. */ name = rp->name; if (name[0] == '\0') name = NULL; else /* make a named tag */ name = substitute (lbp->buffer, rp->name, &rp->regs); /* Force explicit tag name, if a name is there. */ pfnote (name, true, lbp->buffer, match, lineno, linecharno); if (debug) fprintf (stderr, "%s on %s:%"PRIdMAX": %s\n", name ? name : "(unnamed)", curfdp->taggedfname, lineno, lbp->buffer); break; } } } } /* * Return a pointer to a space of size strlen(cp)+1 allocated * with xnew where the string CP has been copied. */ static char * savestr (const char *cp) { return savenstr (cp, strlen (cp)); } /* * Return a pointer to a space of size LEN+1 allocated with xnew * with a copy of CP (containing LEN bytes) followed by a NUL byte. */ static char * savenstr (const char *cp, ptrdiff_t len) { char *dp = xnew (len + 1, char); dp[len] = '\0'; return memcpy (dp, cp, len); } /* Skip spaces (end of string is not space), return new pointer. */ static char * skip_spaces (char *cp) { while (c_isspace (*cp)) cp++; return cp; } /* Skip non spaces, except end of string, return new pointer. */ static char * skip_non_spaces (char *cp) { while (*cp != '\0' && !c_isspace (*cp)) cp++; return cp; } /* Skip any chars in the "name" class.*/ static char * skip_name (char *cp) { /* '\0' is a notinname() so loop stops there too */ while (! notinname (*cp)) cp++; return cp; } /* Print error message and exit. */ static void fatal (char const *format, ...) { va_list ap; va_start (ap, format); verror (format, ap); va_end (ap); exit (EXIT_FAILURE); } static void pfatal (const char *s1) { perror (s1); exit (EXIT_FAILURE); } static void suggest_asking_for_help (void) { fprintf (stderr, "\tTry '%s --help' for a complete list of options.\n", progname); exit (EXIT_FAILURE); } /* Output a diagnostic with printf-style FORMAT and args. */ static void error (const char *format, ...) { va_list ap; va_start (ap, format); verror (format, ap); va_end (ap); } static void verror (char const *format, va_list ap) { fprintf (stderr, "%s: ", progname); vfprintf (stderr, format, ap); fprintf (stderr, "\n"); } /* Return a newly-allocated string whose contents concatenate those of s1, s2, s3. */ static char * concat (const char *s1, const char *s2, const char *s3) { ptrdiff_t len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); char *result = xnew (len1 + len2 + len3 + 1, char); strcpy (stpcpy (stpcpy (result, s1), s2), s3); return result; } /* Does the same work as the system V getcwd, but does not need to guess the buffer size in advance. */ static char * etags_getcwd (void) { ptrdiff_t bufsize = 200; char *path = xnew (bufsize, char); while (getcwd (path, bufsize) == NULL) { if (errno != ERANGE) pfatal ("getcwd"); free (path); path = xnmalloc (bufsize, 2 * sizeof *path); bufsize *= 2; } canonicalize_filename (path); return path; } /* Return a newly allocated string containing a name of a temporary file. */ static char * etags_mktmp (void) { const char *tmpdir = getenv ("TMPDIR"); const char *slash = "/"; #if MSDOS || defined (DOS_NT) if (!tmpdir) tmpdir = getenv ("TEMP"); if (!tmpdir) tmpdir = getenv ("TMP"); if (!tmpdir) tmpdir = "."; if (tmpdir[strlen (tmpdir) - 1] == '/' || tmpdir[strlen (tmpdir) - 1] == '\\') slash = ""; #else if (!tmpdir) tmpdir = "/tmp"; if (tmpdir[strlen (tmpdir) - 1] == '/') slash = ""; #endif char *templt = concat (tmpdir, slash, "etXXXXXX"); int fd = mkostemp (templt, O_CLOEXEC); if (fd < 0 || close (fd) != 0) { free (templt); templt = NULL; } #if defined (DOS_NT) else { /* The file name will be used in shell redirection, so it needs to have DOS-style backslashes, or else the Windows shell will barf. */ char *p; for (p = templt; *p; p++) if (*p == '/') *p = '\\'; } #endif return templt; } /* Return a newly allocated string containing the file name of FILE relative to the absolute directory DIR (which should end with a slash). */ static char * relative_filename (char *file, char *dir) { char *fp, *dp, *afn, *res; ptrdiff_t i; /* Find the common root of file and dir (with a trailing slash). */ afn = absolute_filename (file, cwd); fp = afn; dp = dir; while (*fp++ == *dp++) continue; fp--, dp--; /* back to the first differing char */ #ifdef DOS_NT if (fp == afn && afn[0] != '/') /* cannot build a relative name */ return afn; #endif do /* look at the equal chars until '/' */ fp--, dp--; while (*fp != '/'); /* Build a sequence of "../" strings for the resulting relative file name. */ i = 0; while ((dp = strchr (dp + 1, '/')) != NULL) i += 1; res = xnew (3*i + strlen (fp + 1) + 1, char); char *z = res; while (i-- > 0) z = stpcpy (z, "../"); /* Add the file name relative to the common root of file and dir. */ strcpy (z, fp + 1); free (afn); return res; } /* Return a newly allocated string containing the absolute file name of FILE given DIR (which should end with a slash). */ static char * absolute_filename (char *file, char *dir) { char *slashp, *cp, *res; if (filename_is_absolute (file)) res = savestr (file); #ifdef DOS_NT /* We don't support non-absolute file names with a drive letter, like `d:NAME' (it's too much hassle). */ else if (file[1] == ':') fatal ("%s: relative file names with drive letters not supported", file); #endif else res = concat (dir, file, ""); /* Delete the "/dirname/.." and "/." substrings. */ slashp = strchr (res, '/'); while (slashp != NULL && slashp[0] != '\0') { if (slashp[1] == '.') { if (slashp[2] == '.' && (slashp[3] == '/' || slashp[3] == '\0')) { cp = slashp; do cp--; while (cp >= res && !filename_is_absolute (cp)); if (cp < res) cp = slashp; /* the absolute name begins with "/.." */ #ifdef DOS_NT /* Under MSDOS and NT we get `d:/NAME' as absolute file name, so the luser could say `d:/../NAME'. We silently treat this as `d:/NAME'. */ else if (cp[0] != '/') cp = slashp; #endif memmove (cp, slashp + 3, strlen (slashp + 2)); slashp = cp; continue; } else if (slashp[2] == '/' || slashp[2] == '\0') { memmove (slashp, slashp + 2, strlen (slashp + 1)); continue; } } slashp = strchr (slashp + 1, '/'); } if (res[0] == '\0') /* just a safety net: should never happen */ { free (res); return savestr ("/"); } else return res; } /* Return a newly allocated string containing the absolute file name of dir where FILE resides given DIR (which should end with a slash). */ static char * absolute_dirname (char *file, char *dir) { char *slashp, *res; char save; slashp = strrchr (file, '/'); if (slashp == NULL) return savestr (dir); save = slashp[1]; slashp[1] = '\0'; res = absolute_filename (file, dir); slashp[1] = save; return res; } /* Whether the argument string is an absolute file name. The argument string must have been canonicalized with canonicalize_filename. */ static bool filename_is_absolute (char *fn) { return (fn[0] == '/' #ifdef DOS_NT || (c_isalpha (fn[0]) && fn[1] == ':' && fn[2] == '/') #endif ); } /* Downcase DOS drive letter and collapse separators into single slashes. Works in place. */ static void canonicalize_filename (register char *fn) { register char* cp; #ifdef DOS_NT /* Canonicalize drive letter case. */ if (c_isupper (fn[0]) && fn[1] == ':') fn[0] = c_tolower (fn[0]); /* Collapse multiple forward- and back-slashes into a single forward slash. */ for (cp = fn; *cp != '\0'; cp++, fn++) if (*cp == '/' || *cp == '\\') { *fn = '/'; while (cp[1] == '/' || cp[1] == '\\') cp++; } else *fn = *cp; #else /* !DOS_NT */ /* Collapse multiple slashes into a single slash. */ for (cp = fn; *cp != '\0'; cp++, fn++) if (*cp == '/') { *fn = '/'; while (cp[1] == '/') cp++; } else *fn = *cp; #endif /* !DOS_NT */ *fn = '\0'; } /* Initialize a linebuffer for use. */ static void linebuffer_init (linebuffer *lbp) { lbp->size = (DEBUG) ? 3 : 200; lbp->buffer = xnew (lbp->size, char); lbp->buffer[0] = '\0'; lbp->len = 0; } /* Set the minimum size of a string contained in a linebuffer. */ static void linebuffer_setlen (linebuffer *lbp, ptrdiff_t toksize) { if (lbp->size <= toksize) { ptrdiff_t multiplier = toksize / lbp->size + 1; xrnew (lbp->buffer, lbp->size, multiplier); lbp->size *= multiplier; } lbp->len = toksize; } /* Memory allocators with a fatal error if memory is exhausted. */ static void memory_full (void) { fatal ("virtual memory exhausted"); } static void * xmalloc (ptrdiff_t size) { if (SIZE_MAX < size) memory_full (); void *result = malloc (size); if (result == NULL) memory_full (); return result; } static void * xnmalloc (ptrdiff_t nitems, ptrdiff_t item_size) { ptrdiff_t nbytes; assume (0 <= nitems); assume (0 < item_size); if (INT_MULTIPLY_WRAPV (nitems, item_size, &nbytes)) memory_full (); return xmalloc (nbytes); } static void * xnrealloc (void *pa, ptrdiff_t nitems, ptrdiff_t item_size) { ptrdiff_t nbytes; assume (0 <= nitems); assume (0 < item_size); if (INT_MULTIPLY_WRAPV (nitems, item_size, &nbytes) || SIZE_MAX < nbytes) memory_full (); void *result = realloc (pa, nbytes); if (!result) memory_full (); return result; } /* * Local Variables: * indent-tabs-mode: t * tab-width: 8 * fill-column: 79 * c-font-lock-extra-types: ("FILE" "bool" "language" "linebuffer" "fdesc" "node" "regexp") * c-file-style: "gnu" * End: */ /* etags.c ends here */