/* Tags file maker to go with GNU Emacs
- Copyright (C) 1984, 1987, 1988, 1989, 1992 Free Software Foundation, Inc. and Ken Arnold
+ Copyright (C) 1984, 87, 88, 89, 93, 94, 95
+ Free Software Foundation, Inc. and Ken Arnold
-This file is part of GNU Emacs.
+This file is not considered part of GNU Emacs.
-GNU Emacs is free software; you can redistribute it and/or modify
+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 1, or (at your option)
-any later version.
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
-GNU Emacs is distributed in the hope that it will be useful,
+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 GNU Emacs; see the file COPYING. If not, write to
-the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
+along with this program; if not, write to the Free Software Foundation,
+Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/*
* Authors:
* Ctags originally by Ken Arnold.
- * FORTRAN added by Jim Kleckner.
+ * Fortran added by Jim Kleckner.
* Ed Pelegri-Llopart added C typedefs.
* Gnu Emacs TAGS format and modifications by RMS?
* Sam Kendall added C++.
+ * Francesco Potorti` reorganised C and C++ based on work by Joe Wells.
+ * Regexp tags by Tom Tromey.
+ *
+ * Francesco Potorti` (F.Potorti@cnuce.cnr.it) is the current maintainer.
*/
-#include <stdio.h>
-#include <ctype.h>
-#include <sys/types.h>
-#include <sys/stat.h>
+char pot_etags_version[] = "@(#) pot revision number is 11.66";
-#include "getopt.h"
+#define TRUE 1
+#define FALSE 0
-#ifdef __GNUC__
-#define alloca __builtin_alloca
-#else
-#ifdef sparc
-#include <alloca.h>
-#else
-extern char *alloca ();
-#endif
+#ifndef DEBUG
+# define DEBUG FALSE
#endif
-extern char *malloc (), *realloc ();
-extern char *getenv ();
-extern char *index (), *rindex ();
-extern char *strcpy (), *strncpy ();
-extern int strcmp ();
-
-#ifdef hpux
-#define NEED_INDEX 1
-#define NEED_RINDEX 1
+#ifdef MSDOS
+# include <string.h>
+# include <fcntl.h>
+# include <sys/param.h>
+#endif /* MSDOS */
+
+#ifdef WINDOWSNT
+# include <stdlib.h>
+# include <fcntl.h>
+# include <string.h>
+# include <io.h>
+# define MAXPATHLEN _MAX_PATH
#endif
-/* Define the symbol ETAGS to make the program "etags",
- which makes emacs-style tag tables by default.
- Define CTAGS to make the program "ctags" compatible with the usual one.
- Define neither one to get behavior that depends
- on the name with which the program is invoked
- (but we don't normally compile it that way). */
-
-#if !defined(ETAGS) && !defined(CTAGS)
-/* If neither is defined, program can be run as either. */
-#define ETAGS
-#define CTAGS
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+ /* On some systems, Emacs defines static as nothing for the sake
+ of unexec. We don't want that here since we don't use unexec. */
+# undef static
#endif
-/* On VMS, CTAGS is not useful, so always do ETAGS. */
-#ifdef VMS
-#ifndef ETAGS
-#define ETAGS
+#include <stdio.h>
+#include <ctype.h>
+#include <errno.h>
+#ifndef errno
+extern int errno;
#endif
+#include <sys/types.h>
+#include <sys/stat.h>
+
+#if !defined (S_ISREG) && defined (S_IFREG)
+# define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
#endif
-/* Exit codes for success and failure. */
-#ifdef VMS
-#define GOOD (1)
-#define BAD (0)
+#include <getopt.h>
+
+#ifdef ETAGS_REGEXPS
+# include <regex.h>
+#endif /* ETAGS_REGEXPS */
+
+/* Define CTAGS to make the program "ctags" compatible with the usual one.
+ Let 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 GOOD (0)
-#define BAD (1)
+# define CTAGS FALSE
#endif
-/*
- * The FILEPOS abstract type, which represents a position in a file,
- * plus the following accessor functions:
- *
- * long GET_CHARNO (pos)
- * returns absolute char number.
- * long GET_COOKIE (pos)
- * returns ftell () cookie.
- * void SET_FILEPOS (pos, fp, charno)
- * FILE *fp; long charno;
- * sets `pos' from the current file
- * position of `fp' and from `charno',
- * which must be the absolute character
- * number corresponding to the current
- * position of `fp'.
- *
- * The `pos' parameter is an lvalue expression of type FILEPOS.
- * Parameters to the accessor functions are evaluated 0 or more times,
- * and so must have no side effects.
- *
- * FILEPOS objects can also be assigned and passed to and from
- * functions in the normal C manner.
- *
- * Implementation notes: the `+ 0' is to enforce rvalue-ness.
- */
+/* Exit codes for success and failure. */
#ifdef VMS
-typedef struct
-{
- long cookie;
- long charno;
-} FILEPOS;
-
-#define GET_CHARNO(pos) ((pos).charno + 0)
-#define GET_COOKIE(pos) ((pos).cookie + 0)
-#define SET_FILEPOS(pos, fp, cno) \
- ((void) ((pos).cookie = ftell (fp), (pos).charno = (cno)))
-#else
-#ifndef DEBUG
- /* UNIX real implementation */
-typedef long FILEPOS;
-#define GET_CHARNO(pos) ((pos) + 0)
-#define GET_COOKIE(pos) GET_CHARNO (pos)
-#define SET_FILEPOS(pos, fp, cno) ((void) ((pos) = (cno)))
+# define GOOD 1
+# define BAD 0
#else
- /* UNIX debugging implementation */
-typedef struct
-{
- long charno;
-} FILEPOS;
-
-#define GET_CHARNO(pos) ((pos).charno + 0)
-#define GET_COOKIE(pos) GET_CHARNO (pos)
-#define SET_FILEPOS(pos, fp, cno) \
- ((void) ((pos).charno = (cno), \
- (cno) != ftell (fp) ? (error ("SET_FILEPOS inconsistency"), 0) \
- : 0))
-#endif
+# define GOOD 0
+# define BAD 1
#endif
-#define streq(s, t) (strcmp (s, t) == 0)
-#define strneq(s, t, n) (strncmp (s, t, n) == 0)
-#define reg register
-#define logical char
+/* C extensions. */
+#define C_PLPL 0x00001 /* C++ */
+#define C_STAR 0x00003 /* C* */
+#define YACC 0x10000 /* yacc file */
-#define TRUE 1
-#define FALSE 0
+#define streq(s,t) ((DEBUG &&!(s)&&!(t)&&(abort(),1)) || !strcmp(s,t))
+#define strneq(s,t,n) ((DEBUG &&!(s)&&!(t)&&(abort(),1)) || !strncmp(s,t,n))
+
+#define lowcase(c) tolower ((unsigned char)c)
#define iswhite(arg) (_wht[arg]) /* T if char is white */
#define begtoken(arg) (_btk[arg]) /* T if char can start token */
#define intoken(arg) (_itk[arg]) /* T if char can be in token */
#define endtoken(arg) (_etk[arg]) /* T if char ends tokens */
-#define isgood(arg) (_gd[arg]) /* T if char can be after ')' */
-#define max(I1,I2) ((I1) > (I2) ? (I1) : (I2))
+#ifdef DOS_NT
+# define absolutefn(fn) (fn[0] == '/' \
+ || (fn[1] == ':' && fn[2] == '/'))
+#else
+# define absolutefn(fn) (fn[0] == '/')
+#endif
+
+
+/*
+ * xnew -- allocate storage
+ *
+ * SYNOPSIS: Type *xnew (int n, Type);
+ */
+#define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
+
+typedef int logical;
-struct nd_st
-{ /* sorting structure */
+typedef struct nd_st
+{ /* sorting structure */
char *name; /* function or type name */
char *file; /* file name */
logical is_func; /* use pattern or line no */
- logical rewritten; /* list name separately */
logical been_warned; /* set if noticed dup */
int lno; /* line number tag is on */
long cno; /* character number line starts on */
char *pat; /* search pattern */
struct nd_st *left, *right; /* left and right sons */
-};
-
-long ftell ();
-typedef struct nd_st NODE;
-
-logical gotone, /* found a func already on line */
- /* boolean "func" (see init) */
- header_file, /* TRUE if .h file, FALSE o.w. */
- _wht[0177], _etk[0177], _itk[0177], _btk[0177], _gd[0177];
+} NODE;
+extern char *getenv ();
char *concat ();
-char *savenstr ();
-char *savestr ();
-char *xmalloc ();
-char *xrealloc ();
-int L_isdef ();
-int PF_funcs ();
+char *savenstr (), *savestr ();
+char *etags_strchr (), *etags_strrchr ();
+char *etags_getcwd ();
+char *relative_filename (), *absolute_filename (), *absolute_dirname ();
+long *xmalloc (), *xrealloc ();
+
+typedef void Lang_function ();
+#if FALSE /* many compilers barf on this */
+Lang_function Asm_labels;
+Lang_function default_C_entries;
+Lang_function C_entries;
+Lang_function Cplusplus_entries;
+Lang_function Cstar_entries;
+Lang_function Erlang_functions;
+Lang_function Fortran_functions;
+Lang_function Yacc_entries;
+Lang_function Lisp_functions;
+Lang_function Pascal_functions;
+Lang_function Perl_functions;
+Lang_function Prolog_functions;
+Lang_function Scheme_functions;
+Lang_function TeX_functions;
+Lang_function just_read_file;
+#else /* so let's write it this way */
+void Asm_labels ();
+void C_entries ();
+void default_C_entries ();
+void plain_C_entries ();
+void Cplusplus_entries ();
+void Cstar_entries ();
+void Erlang_functions ();
+void Fortran_functions ();
+void Yacc_entries ();
+void Lisp_functions ();
+void Pascal_functions ();
+void Perl_functions ();
+void Prolog_functions ();
+void Scheme_functions ();
+void TeX_functions ();
+void just_read_file ();
+#endif
+
+Lang_function *get_language_from_name ();
+Lang_function *get_language_from_interpreter ();
+Lang_function *get_language_from_suffix ();
int total_size_of_entries ();
-logical consider_token ();
-logical tail ();
long readline ();
-void Asm_funcs ();
-void C_entries ();
-void L_funcs ();
-void L_getit ();
-void PAS_funcs ();
-void Scheme_funcs ();
-void TEX_funcs ();
+long readline_internal ();
+#ifdef ETAGS_REGEXPS
+void add_regex ();
+#endif
void add_node ();
void error ();
-void fatal ();
+void suggest_asking_for_help ();
+void fatal (), pfatal ();
void find_entries ();
void free_tree ();
void getit ();
-void getline ();
void init ();
void initbuffer ();
-void initbuffer ();
void pfnote ();
void process_file ();
void put_entries ();
void takeprec ();
-/*
- * MACRO
- * xnew -- allocate storage
- *
- * SYNOPSIS
- * Type *xnew (int n, Type);
- */
-#define xnew(n, Type) ((Type *) xmalloc ((n) * sizeof (Type)))
\f
+char searchar = '/'; /* use /.../ searches */
+int lineno; /* line number of current line */
+long charno; /* current character number */
+long linecharno; /* charno of start of line */
-/*
- * Symbol table stuff.
- *
- * Should probably be implemented with hash table; linked list for now.
- */
-
-enum sym_type
-{
- st_none, st_C_struct, st_C_enum, st_C_define, st_C_typedef, st_C_typespec
-};
-
-struct stab_entry
-{
- char *sym;
- int symlen;
- enum sym_type type;
- struct stab_entry *next;
-};
-
-typedef struct stab_entry Stab_entry;
-typedef Stab_entry *Stab;
-
-/*
- * NAME
- * Stab, Stab_entry, stab_create, stab_search, stab_find -- symbol table
- *
- * SYNOPSIS
- * Types: Stab, Stab_entry, enum sym_type
- *
- * Stab * stab_create ()
- *
- * Stab_entry * stab_find (stab, sym)
- * Stab *stab;
- * char *sym;
- *
- * Stab_entry * stab_search (stab, sym)
- * Stab *stab;
- * char *sym;
- *
- * DESCRIPTION
- * stab_create creates a Stab, a symbol table object, and returns a
- * pointer to it. stab_find finds a symbol in a Stab; it returns a
- * pointer to the Stab_entry if found, otherwise NULL. stab_search
- * is like stab_find, except that it creates a new Stab_entry,
- * initialized with type = st_none, if one did not exist already
- * (it never returns NULL).
- *
- * A Stab_entry is a structure that contains at least the following
- * members:
- *
- * char *name; // must not be modified
- * enum sym_type type; // should be set
- *
- * The type field is initially set to st_none; it should be set to
- * something else by the caller of stab_search. Other possible values
- * of an enum sym_type can be added.
- */
-
-Stab *
-stab_create ()
-{
- Stab *sp;
- sp = xnew (1, Stab);
- *sp = NULL; /* a Stab starts out as a null Stab_entry* */
- return sp;
-}
-
-Stab_entry *
-stab_find (stab, sym, symlen)
- Stab *stab;
- register char *sym;
- register int symlen;
-{
- register Stab_entry *se;
- for (se = *stab; se != NULL; se = se->next)
- {
- if (se->symlen == symlen && strneq (se->sym, sym, symlen))
- return se;
- }
-
- return NULL;
-}
-
-Stab_entry *
-stab_search (stab, sym, symlen)
- register Stab *stab;
- char *sym;
- int symlen;
-{
- register Stab_entry *se;
- se = stab_find (stab, sym, symlen);
-
- if (se == NULL)
- {
- /* make a new one */
- se = xnew (1, Stab_entry);
- se->sym = savenstr (sym, symlen);
- se->symlen = symlen;
- se->type = st_none;
- se->next = *stab;
- *stab = se;
- }
+char *curfile; /* current input file name */
+char *tagfile; /* output file */
+char *progname; /* name this program was invoked with */
+char *cwd; /* current working directory */
+char *tagfiledir; /* directory of tagfile */
- return se;
-}
+FILE *tagf; /* ioptr for tags file */
+NODE *head; /* the head of the binary tree of tags */
/*
- * NAME
- * stab_type -- type of a symbol table entry
- *
- * SYNOPSIS
- * enum sym_type stab_type (Stab_entry *se);
- *
- * WARNING
- * May evaluate its argument more than once.
+ * A `struct linebuffer' is a structure which holds a line of text.
+ * `readline' reads a line from a stream into a linebuffer and works
+ * regardless of the length of the line.
*/
-
-#define stab_type(se) ((se)==NULL ? st_none : (se)->type)
-\f
-
-
-typedef int LINENO;
-
-typedef struct
-{
- char *p;
- int len;
- FILEPOS linestart;
- LINENO lineno;
- logical rewritten;
-} TOKEN;
-\f
-
- /* typedefs are recognized using a simple finite automaton.
- * tydef is its state variable.
- */
-typedef enum
-{
- none, begin, middle, end
-} TYST;
-
-TYST tydef = none;
-
-
- /* struct tags for C++ are recognized using another simple
- * finite automaton. `structdef' is its state variable.
- * This machinery is only invoked for C++; otherwise structdef
- * should remain snone. However, this machinery can easily be
- * adapted to find structure tags in normal C code.
- */
-typedef enum
+#define GROW_LINEBUFFER(buf,toksize) \
+while (buf.size < toksize) \
+ buf.buffer = (char *) xrealloc (buf.buffer, buf.size *= 2)
+struct linebuffer
{
- snone, /* nothing seen yet */
- skeyseen, /* struct-like keyword seen */
- stagseen, /* struct-like tag seen */
- scolonseen, /* colon seen after struct-like tag */
- sinbody /* in a class body: recognize member func defs */
-} STRUCTST;
-STRUCTST structdef = snone;
-/*
- * When structdef is stagseen, scolonseen, or sinbody, structtag is the
- * struct tag, and structkey is the preceding struct-like keyword.
- */
-char structtag[512];
-Stab_entry *structkey;
+ long size;
+ char *buffer;
+};
-/*
- * Yet another little state machine to deal with preprocessor lines.
- */
-typedef enum
+struct linebuffer lb; /* the current line */
+struct linebuffer token_name; /* used by C_entries as a temporary area */
+struct
{
- dnone, /* nothing seen */
- dsharpseen, /* '#' seen as first char on line */
- ddefineseen, /* '#' and 'define' seen */
- dignorerest /* ignore rest of line */
-} DEFINEST;
-DEFINEST definedef;
-
-/*
- * LEVEL_OK_FOR_FUNCDEF allows C++ function definition within class body.
- * Currently tydef and structdef stuff (typedefs and struct definitions) are
- * only noticed when level==0, but that may change.
- *
- * Note that this macro may only be evaluated inside C_entries(). It is
- * for self-documentation only.
- */
-#define LEVEL_OK_FOR_FUNCDEF() \
- (level==0 || (c_ext && level==1 && structdef==sinbody))
-
-/*
- * next_token_is_func
- * set this to TRUE, and the next token considered is called a function.
- */
-logical next_token_is_func;
-
-/* C extensions. Currently all listed extensions are C++ dialects, so
- * `c_ext' is used as an abbreviation for `c_ext&C_PLPL'. If a non-C++
- * dialect is added, this must change.
- */
-#define C_PLPL 0x1 /* C++ */
-#define C_STAR 0x3 /* C* */
-
-char searchar = '/'; /* use /.../ searches */
-
-LINENO lineno; /* line number of current line */
-long charno; /* current character number */
-FILEPOS linepos; /* start of line (C only) */
-FILEPOS prev_linepos; /* start of previous line (C only) */
-
-long linecharno; /* charno of start of line; not used by C, but
- * by every other language.
- */
-
-char *curfile, /* current input file name */
- *outfile, /* output file */
- *white = " \f\t\n", /* white chars */
- *endtk = " \t\n\"'#()[]{}=-+%*/&|^~!<>;,.:?", /* token ending chars */
- *begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$", /* token starting chars */
- *intk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789", /* valid in-token chars */
- *notgd = ",;"; /* non-valid after-function chars */
-
-int append_to_tagfile; /* -a: append to tags */
-int emacs_tags_format; /* emacs style output (no -e option any more) */
-/* The following three default to 1 for etags, but to 0 for ctags. */
-int typedefs; /* -t: create tags for typedefs */
-int typedefs_and_cplusplus; /* -T: create tags for typedefs, level */
+ long linepos;
+ struct linebuffer lb; /* used by C_entries instead of lb */
+} lbs[2];
+
+/* boolean "functions" (see init) */
+logical _wht[0177], _etk[0177], _itk[0177], _btk[0177];
+char
+ /* white chars */
+ *white = " \f\t\n\013",
+ /* token ending chars */
+ *endtk = " \t\n\013\"'#()[]{}=-+%*/&|^~!<>;,.:?",
+ /* token starting chars */
+ *begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~@",
+ /* valid in-token chars */
+ *intk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
+
+logical append_to_tagfile; /* -a: append to tags */
+/* The following three default to TRUE for etags, but to FALSE for ctags. */
+logical typedefs; /* -t: create tags for typedefs */
+logical typedefs_and_cplusplus; /* -T: create tags for typedefs, level */
/* 0 struct/enum/union decls, and C++ */
- /* member functions */
-int constantypedefs; /* -d: create tags for C #define and enum */
- /* constants. Default under etags. Enum */
- /* constants not implemented. */
+ /* member functions. */
+logical constantypedefs; /* -d: create tags for C #define and enum */
+ /* constants. Enum consts not implemented. */
/* -D: opposite of -d. Default under ctags. */
-int update; /* -u: update tags */
-int vgrind_style; /* -v: create vgrind style index output */
-int no_warnings; /* -w: suppress warnings */
-int cxref_style; /* -x: create cxref style output */
-int cplusplus; /* .[hc] means C++, not C */
-int noindentypedefs; /* -S: ignore indentation in C */
-
-/* Name this program was invoked with. */
-char *progname;
-
-struct option longopts[] = {
+logical update; /* -u: update tags */
+logical vgrind_style; /* -v: create vgrind style index output */
+logical no_warnings; /* -w: suppress warnings */
+logical cxref_style; /* -x: create cxref style output */
+logical cplusplus; /* .[hc] means C++, not C */
+logical noindentypedefs; /* -I: ignore indentation in C */
+
+struct option longopts[] =
+{
{ "append", no_argument, NULL, 'a' },
- { "backward-search", no_argument, NULL, 'B' },
+ { "backward-search", no_argument, NULL, 'B' },
{ "c++", no_argument, NULL, 'C' },
{ "cxref", no_argument, NULL, 'x' },
{ "defines", no_argument, NULL, 'd' },
- { "forward-search", no_argument, NULL, 'F' },
+ { "help", no_argument, NULL, 'h' },
{ "help", no_argument, NULL, 'H' },
- { "ignore-indentation", no_argument, NULL, 'S' },
+ { "ignore-indentation", no_argument, NULL, 'I' },
{ "include", required_argument, NULL, 'i' },
+ { "language", required_argument, NULL, 'l' },
{ "no-defines", no_argument, NULL, 'D' },
+ { "no-regex", no_argument, NULL, 'R' },
{ "no-warn", no_argument, NULL, 'w' },
{ "output", required_argument, NULL, 'o' },
+ { "regex", required_argument, NULL, 'r' },
{ "typedefs", no_argument, NULL, 't' },
{ "typedefs-and-c++", no_argument, NULL, 'T' },
- { "update", no_argument, NULL, 'u' },
+ { "update", no_argument, NULL, 'u' },
{ "version", no_argument, NULL, 'V' },
- { "vgrind", no_argument, NULL, 'v' },
+ { "vgrind", no_argument, NULL, 'v' },
{ 0 }
};
-FILE *inf, /* ioptr for current input file */
- *outf; /* ioptr for tags file */
+#ifdef ETAGS_REGEXPS
+/* Structure defining a regular expression. Elements are
+ the compiled pattern, and the name string. */
+struct pattern
+{
+ struct re_pattern_buffer *pattern;
+ struct re_registers regs;
+ char *name_pattern;
+ logical error_signaled;
+};
-NODE *head; /* the head of the binary tree of tags */
+/* Number of regexps found. */
+int num_patterns = 0;
-int permit_duplicates = 1; /* Nonzero means allow duplicate tags. */
+/* Array of all regexps. */
+struct pattern *patterns = NULL;
+#endif /* ETAGS_REGEXPS */
-/* A `struct linebuffer' is a structure which holds a line of text.
- `readline' reads a line from a stream into a linebuffer
- and works regardless of the length of the line. */
+/*
+ * Language stuff.
+ */
-struct linebuffer
+/* Non-NULL if language fixed. */
+Lang_function *lang_func = NULL;
+
+/* Assembly code */
+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 */
+ "src", /* BSO/Tasking C compiler output */
+ NULL
+ };
+
+/* Note that .c and .h can be considered C++, if the --c++ flag was
+ given. That is why default_C_entries is called here. */
+char *default_C_suffixes [] =
+ { "c", "h", NULL };
+
+/* .M is for Objective C++ files. */
+char *Cplusplus_suffixes [] =
+ { "C", "H", "c++", "cc", "cpp", "cxx", "h++", "hh", "hpp", "hxx", "M", NULL};
+
+char *Cstar_suffixes [] =
+ { "cs", "hs", NULL };
+
+char *Erlang_suffixes [] =
+ { "erl", "hrl", NULL };
+
+char *Fortran_suffixes [] =
+ { "F", "f", "f90", "for", NULL };
+
+char *Lisp_suffixes [] =
+ { "cl", "clisp", "el", "l", "lisp", "lsp", "ml", NULL };
+
+char *Pascal_suffixes [] =
+ { "p", "pas", NULL };
+
+char *Perl_suffixes [] =
+ { "pl", "pm", NULL };
+char *Perl_interpreters [] =
+ { "perl", "@PERL@", NULL };
+
+char *plain_C_suffixes [] =
+ { "pc", /* Pro*C file */
+ "m", /* Objective C file */
+ "lm", /* Objective lex file */
+ NULL };
+
+char *Prolog_suffixes [] =
+ { "prolog", NULL };
+
+/* Can't do the `SCM' or `scm' prefix with a version number. */
+char *Scheme_suffixes [] =
+ { "SCM", "SM", "oak", "sch", "scheme", "scm", "sm", "t", NULL };
+
+char *TeX_suffixes [] =
+ { "TeX", "bib", "clo", "cls", "ltx", "sty", "tex", NULL };
+
+char *Yacc_suffixes [] =
+ { "y", "ym", NULL }; /* .ym is Objective yacc file */
+
+/* Table of language names and corresponding functions, file suffixes
+ and interpreter names.
+ It is ok for a given function to be listed under more than one
+ name. I just didn't. */
+struct lang_entry
{
- long size;
- char *buffer;
+ char *name;
+ Lang_function *function;
+ char **suffixes;
+ char **interpreters;
+};
+
+struct lang_entry lang_names [] =
+{
+ { "asm", Asm_labels, Asm_suffixes, NULL },
+ { "c", default_C_entries, default_C_suffixes, NULL },
+ { "c++", Cplusplus_entries, Cplusplus_suffixes, NULL },
+ { "c*", Cstar_entries, Cstar_suffixes, NULL },
+ { "erlang", Erlang_functions, Erlang_suffixes, NULL },
+ { "fortran", Fortran_functions, Fortran_suffixes, NULL },
+ { "lisp", Lisp_functions, Lisp_suffixes, NULL },
+ { "pascal", Pascal_functions, Pascal_suffixes, NULL },
+ { "perl", Perl_functions, Perl_suffixes, Perl_interpreters },
+ { "proc", plain_C_entries, plain_C_suffixes, NULL },
+ { "prolog", Prolog_functions, Prolog_suffixes, NULL },
+ { "scheme", Scheme_functions, Scheme_suffixes, NULL },
+ { "tex", TeX_functions, TeX_suffixes, NULL },
+ { "yacc", Yacc_entries, Yacc_suffixes, NULL },
+ { "auto", NULL }, /* default guessing scheme */
+ { "none", just_read_file }, /* regexp matching only */
+ { NULL, NULL } /* end of list */
};
-struct linebuffer lb; /* the current line */
-struct linebuffer lb1; /* sometimes, a previous line in which a token lies */
-struct linebuffer filename_lb; /* used to read in filenames */
\f
+void
+print_language_names ()
+{
+ struct lang_entry *lang;
+ char **ext;
+
+ puts ("\nThese are the currently supported languages, along with the\n\
+default file name suffixes:");
+ for (lang = lang_names; lang->name != NULL; lang++)
+ {
+ printf ("\t%s\t", lang->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.");
+}
+#ifndef VERSION
+# define VERSION "19"
+#endif
void
print_version ()
{
-#ifdef CTAGS
- printf ("CTAGS ");
-#ifdef ETAGS
- printf ("and ");
-#endif
-#endif
-#ifdef ETAGS
- printf ("ETAGS ");
-#endif
- printf ("for Emacs version 19.0.\n");
+ printf ("%s for Emacs version %s\n", (CTAGS) ? "ctags" : "etags", VERSION);
- exit (0);
+ exit (GOOD);
}
void
print_help ()
{
printf ("These are the options accepted by %s. You may use unambiguous\n\
-abbreviations for the long option names.\n\n", progname);
-
- fputs ("\
--a, --append\n\
- Append tag entries to existing tags file.\n\
--C, --c++\n\
- Treat files with `.c' and `.h' extensions as C++ code, not C\n\
- code. Files with `.C', `.H', `.cxx', `.hxx', or `.cc'\n\
- extensions are always assumed to be C++ code.\n\
--d, --defines\n\
- Create tag entries for #defines, too.", stdout);
-
-#ifdef ETAGS
- fputs (" This is the default\n\
- behavior.", stdout);
-#endif
+abbreviations for the long option names. A - as file name means read\n\
+names from stdin.", progname);
+ if (!CTAGS)
+ printf (" Absolute names are stored in the output file as they\n\
+are. Relative ones are stored relative to the output file's directory.");
+ puts ("\n");
+
+ puts ("-a, --append\n\
+ Append tag entries to existing tags file.");
+
+ 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.");
- fputs ("\n\
--D, --no-defines\n\
- Don't create tag entries for #defines.", stdout);
+ puts ("-C, --c++\n\
+ Treat files whose name suffix defaults to C language as C++ files.");
-#ifdef CTAGS
- fputs (" This is the default\n\
- behavior.", stdout);
-#endif
+ if (CTAGS)
+ puts ("-d, --defines\n\
+ Create tag entries for constant C #defines, too.");
+ else
+ puts ("-D, --no-defines\n\
+ Don't create tag entries for constant C #defines. This makes\n\
+ the tags file smaller.");
- puts ("\n\
--o FILE, --output=FILE\n\
- Write the tags to FILE.\n\
--S, --ignore-indentation\n\
- Don't rely on indentation quite as much as normal. Currently,\n\
- this means not to assume that a closing brace in the first\n\
- column is the final brace of a function or structure\n\
- definition.\n\
--t, --typedefs\n\
- Generate tag entries for typedefs. This is the default\n\
- behavior.\n\
--T, --typedefs-and-c++\n\
- Generate tag entries for typedefs, struct/enum/union tags, and\n\
- C++ member functions.");
-
-#ifdef ETAGS
- puts ("-i FILE, --include=FILE\n\
+ 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.");
-#endif
+ 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.");
+ }
-#ifdef CTAGS
- puts ("-B, --backward-search\n\
- Write the search commands for the tag entries using '?', the\n\
- backward-search command.\n\
--F, --forward-search\n\
- Write the search commands for the tag entries using '/', the\n\
- forward-search command.\n\
--u, --update\n\
+#ifdef ETAGS_REGEXPS
+ puts ("-r /REGEXP/, --regex=/REGEXP/\n\
+ Make a tag for each line matching pattern REGEXP in the\n\
+ following files. REGEXP is anchored (as if preceded by ^).\n\
+ The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
+ named tags can be created with:\n\
+ --regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
+ puts ("-R, --no-regex\n\
+ Don't create tags from regexps for the following files.");
+#endif /* ETAGS_REGEXPS */
+ puts ("-o FILE, --output=FILE\n\
+ Write the tags to FILE.");
+ puts ("-I, --ignore-indentation\n\
+ Don't rely on indentation quite as much as normal. Currently,\n\
+ this means not to assume that a closing brace in the first\n\
+ column is the final brace of a function or structure\n\
+ definition in C and C++.");
+
+ if (CTAGS)
+ {
+ puts ("-t, --typedefs\n\
+ Generate tag entries for C typedefs.");
+ puts ("-T, --typedefs-and-c++\n\
+ Generate tag entries for C typedefs, C struct/enum/union tags,\n\
+ and C++ member functions.");
+ 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.\n\
--v, --vgrind\n\
+ tag file than to use this.");
+ puts ("-v, --vgrind\n\
Generates an index of items intended for human consumption,\n\
similar to the output of vgrind. The index is sorted, and\n\
- gives the page number of each item.\n\
--x, --cxref\n\
+ gives the page number of each item.");
+ puts ("-w, --no-warn\n\
+ Suppress warning messages about entries defined in multiple\n\
+ files.");
+ 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.\n\
--w, --no-warn\n\
- Suppress warning messages about entries defined in multiple\n\
- files.");
-#endif
+ which you like.");
+ }
puts ("-V, --version\n\
Print the version of the program.\n\
--H, --help\n\
+-h, --help\n\
Print this help message.");
- exit (0);
+ print_language_names ();
+
+ exit (GOOD);
}
\f
-void
+enum argument_type
+{
+ at_language,
+ at_regexp,
+ at_filename
+};
+
+/* This structure helps us allow mixing of --lang and filenames. */
+typedef struct
+{
+ enum argument_type arg_type;
+ char *what;
+ Lang_function *function;
+} argument;
+
+#ifdef VMS /* VMS specific functions */
+
+#define EOS '\0'
+
+/* This is a BUG! ANY arbitrary limit is a BUG!
+ Won't someone please fix this? */
+#define MAX_FILE_SPEC_LEN 255
+typedef struct {
+ short curlen;
+ char body[MAX_FILE_SPEC_LEN + 1];
+} vspec;
+
+/*
+ v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
+ returning in each successive call the next filename matching the input
+ spec. The function expects that each in_spec passed
+ to it will be processed to completion; in particular, up to and
+ including the call following that in which the last matching name
+ is returned, the function ignores the value of in_spec, and will
+ only start processing a new spec with the following call.
+ If an error occurs, on return out_spec contains the value
+ of in_spec when the error occurred.
+
+ With each successive filename returned in out_spec, the
+ function's return value is one. When there are no more matching
+ names the function returns zero. If on the first call no file
+ matches in_spec, or there is any other error, -1 is returned.
+*/
+
+#include <rmsdef.h>
+#include <descrip.h>
+#define OUTSIZE MAX_FILE_SPEC_LEN
+short
+fn_exp (out, in)
+ vspec *out;
+ char *in;
+{
+ static long context = 0;
+ static struct dsc$descriptor_s o;
+ static struct dsc$descriptor_s i;
+ static logical pass1 = TRUE;
+ long status;
+ short retval;
+
+ if (pass1)
+ {
+ pass1 = FALSE;
+ o.dsc$a_pointer = (char *) out;
+ o.dsc$w_length = (short)OUTSIZE;
+ i.dsc$a_pointer = in;
+ i.dsc$w_length = (short)strlen(in);
+ i.dsc$b_dtype = DSC$K_DTYPE_T;
+ i.dsc$b_class = DSC$K_CLASS_S;
+ o.dsc$b_dtype = DSC$K_DTYPE_VT;
+ o.dsc$b_class = DSC$K_CLASS_VS;
+ }
+ if ((status = lib$find_file(&i, &o, &context, 0, 0)) == RMS$_NORMAL)
+ {
+ out->body[out->curlen] = EOS;
+ return 1;
+ }
+ else if (status == RMS$_NMF)
+ retval = 0;
+ else
+ {
+ strcpy(out->body, in);
+ retval = -1;
+ }
+ lib$find_file_end(&context);
+ pass1 = TRUE;
+ return retval;
+}
+
+/*
+ v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
+ name of each file specified by the provided arg expanding wildcards.
+*/
+char *
+gfnames (arg, p_error)
+ char *arg;
+ logical *p_error;
+{
+ static vspec filename = {MAX_FILE_SPEC_LEN, "\0"};
+
+ switch (fn_exp (&filename, arg))
+ {
+ case 1:
+ *p_error = FALSE;
+ return filename.body;
+ case 0:
+ *p_error = FALSE;
+ return NULL;
+ default:
+ *p_error = TRUE;
+ return filename.body;
+ }
+}
+
+#ifndef OLD /* Newer versions of VMS do provide `system'. */
+system (cmd)
+ char *cmd;
+{
+ fprintf (stderr, "system() function not implemented under VMS\n");
+}
+#endif
+
+#define VERSION_DELIM ';'
+char *massage_name (s)
+ char *s;
+{
+ char *start = s;
+
+ for ( ; *s; s++)
+ if (*s == VERSION_DELIM)
+ {
+ *s = EOS;
+ break;
+ }
+ else
+ *s = lowcase (*s);
+ return start;
+}
+#endif /* VMS */
+
+\f
+int
main (argc, argv)
int argc;
char *argv[];
{
- char cmd[100];
int i;
unsigned int nincluded_files = 0;
- char **included_files = (char **) alloca (argc * sizeof (char *));
+ char **included_files = xnew (argc, char *);
char *this_file;
+ argument *argbuffer;
+ int current_arg = 0, file_count = 0;
+ struct linebuffer filename_lb;
#ifdef VMS
- char got_err;
-
- extern char *gfnames ();
- extern char *massage_name ();
+ logical got_err;
#endif
+#ifdef DOS_NT
+ _fmode = O_BINARY; /* all of files are treated as binary files */
+#endif /* DOS_NT */
+
progname = argv[0];
-#ifndef CTAGS
- emacs_tags_format = 1;
-#else
- emacs_tags_format = 0;
-#endif
+ /* Allocate enough no matter what happens. Overkill, but each one
+ is small. */
+ argbuffer = xnew (argc, argument);
+
+#ifdef ETAGS_REGEXPS
+ /* Set syntax for regular expression routines. */
+ re_set_syntax (RE_SYNTAX_EMACS);
+#endif /* ETAGS_REGEXPS */
/*
* If etags, always find typedefs and structure tags. Why not?
* Also default is to find macro constants.
*/
- if (emacs_tags_format)
- typedefs = typedefs_and_cplusplus = constantypedefs = 1;
+ if (!CTAGS)
+ typedefs = typedefs_and_cplusplus = constantypedefs = TRUE;
- for (;;)
+ while (1)
{
- int opt;
- opt = getopt_long (argc, argv, "aCdDo:StTi:BFuvxwVH", longopts, 0);
+ int opt = getopt_long (argc, argv,
+ "-aCdDf:Il:o:r:RStTi:BuvxwVhH", longopts, 0);
if (opt == EOF)
break;
switch (opt)
{
- case '\0':
- /* If getopt returns '\0', then it has already processed a
+ 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 filename has been seen. Record it. */
+ argbuffer[current_arg].arg_type = at_filename;
+ argbuffer[current_arg].what = optarg;
+ ++current_arg;
+ ++file_count;
+ break;
+
/* Common options. */
case 'a':
- append_to_tagfile++;
+ append_to_tagfile = TRUE;
break;
case 'C':
- cplusplus = 1;
+ cplusplus = TRUE;
break;
case 'd':
- constantypedefs = 1;
+ constantypedefs = TRUE;
break;
case 'D':
- constantypedefs = 0;
+ constantypedefs = FALSE;
break;
+ case 'f': /* for compatibility with old makefiles */
case 'o':
- if (outfile)
+ if (tagfile)
{
- fprintf (stderr,
- "%s: -o flag may only be given once\n", progname);
- goto usage;
+ fprintf (stderr, "%s: -%c option may only be given once.\n",
+ progname, opt);
+ suggest_asking_for_help ();
}
- outfile = optarg;
+ tagfile = optarg;
break;
- case 'S':
- noindentypedefs++;
+ case 'I':
+ case 'S': /* for backward compatibility */
+ noindentypedefs = TRUE;
break;
- case 't':
- typedefs++;
+ case 'l':
+ argbuffer[current_arg].function = get_language_from_name (optarg);
+ argbuffer[current_arg].arg_type = at_language;
+ ++current_arg;
break;
- case 'T':
- typedefs++;
- typedefs_and_cplusplus++;
+#ifdef ETAGS_REGEXPS
+ case 'r':
+ argbuffer[current_arg].arg_type = at_regexp;
+ argbuffer[current_arg].what = optarg;
+ ++current_arg;
break;
+ case 'R':
+ argbuffer[current_arg].arg_type = at_regexp;
+ argbuffer[current_arg].what = NULL;
+ ++current_arg;
+ break;
+#endif /* ETAGS_REGEXPS */
case 'V':
print_version ();
break;
+ case 'h':
case 'H':
print_help ();
break;
-
+ case 't':
+ typedefs = TRUE;
+ break;
+ case 'T':
+ typedefs = typedefs_and_cplusplus = TRUE;
+ break;
+#if (!CTAGS)
/* Etags options */
case 'i':
- if (!emacs_tags_format)
- goto usage;
included_files[nincluded_files++] = optarg;
break;
-
+#else /* CTAGS */
/* Ctags options. */
case 'B':
searchar = '?';
- if (emacs_tags_format)
- goto usage;
- break;
- case 'F':
- searchar = '/';
- if (emacs_tags_format)
- goto usage;
break;
case 'u':
- update++;
- if (emacs_tags_format)
- goto usage;
+ update = TRUE;
break;
case 'v':
- vgrind_style++;
+ vgrind_style = TRUE;
/*FALLTHRU*/
case 'x':
- cxref_style++;
- if (emacs_tags_format)
- goto usage;
+ cxref_style = TRUE;
break;
case 'w':
- no_warnings++;
- if (emacs_tags_format)
- goto usage;
+ no_warnings = TRUE;
break;
-
+#endif /* CTAGS */
default:
- goto usage;
+ suggest_asking_for_help ();
}
}
- if (optind == argc)
+ for (; optind < argc; ++optind)
{
- fprintf (stderr, "%s: No input files specified.\n", progname);
-
- usage:
- fprintf (stderr, "%s: Try '%s --help' for a complete list of options.\n",
- progname, progname);
- exit (BAD);
+ argbuffer[current_arg].arg_type = at_filename;
+ argbuffer[current_arg].what = argv[optind];
+ ++current_arg;
+ ++file_count;
}
- if (outfile == 0)
+ if (nincluded_files == 0 && file_count == 0)
{
- outfile = emacs_tags_format ? "TAGS" : "tags";
+ fprintf (stderr, "%s: No input files specified.\n", progname);
+ suggest_asking_for_help ();
}
- init (); /* set up boolean "functions" */
+ if (tagfile == NULL)
+ tagfile = CTAGS ? "tags" : "TAGS";
+ cwd = etags_getcwd (); /* the current working directory */
+ if (cwd[strlen (cwd) - 1] != '/')
+ cwd = concat (cwd, "/", "");
+ if (streq (tagfile, "-"))
+ tagfiledir = cwd;
+ else
+ tagfiledir = absolute_dirname (tagfile, cwd);
+
+ init (); /* set up boolean "functions" */
initbuffer (&lb);
- initbuffer (&lb1);
+ initbuffer (&token_name);
+ initbuffer (&lbs[0].lb);
+ initbuffer (&lbs[1].lb);
initbuffer (&filename_lb);
- /*
- * loop through files finding functions
- */
- if (emacs_tags_format)
- {
- if (streq (outfile, "-"))
- outf = stdout;
- else
- outf = fopen (outfile, append_to_tagfile ? "a" : "w");
- if (!outf)
- {
- perror (outfile);
- exit (1);
- }
- }
-#ifdef VMS
- argc -= optind;
- argv += optind;
- while (gfnames (&argc, &argv, &got_err) != NULL)
+ if (!CTAGS)
{
- if (got_err)
+ if (streq (tagfile, "-"))
{
- error ("Can't find file %s\n", this_file);
- argc--, argv++;
+ tagf = stdout;
+#ifdef DOS_NT
+ /* Switch redirected `stdout' to binary mode (setting `_fmode'
+ doesn't take effect until after `stdout' is already open). */
+ if (!isatty (fileno (stdout)))
+ setmode (fileno (stdout), O_BINARY);
+#endif /* DOS_NT */
}
else
- {
- this_file = massage_name (this_file);
-#if 0
- }
- } /* solely to balance out the ifdef'd parens above */
-#endif
-#else
- for (; optind < argc; optind++)
+ tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
+ if (tagf == NULL)
+ pfatal (tagfile);
+ }
+
+ /*
+ * Loop through files finding functions.
+ */
+ for (i = 0; i < current_arg; ++i)
{
- this_file = argv[optind];
- if (1)
+ switch (argbuffer[i].arg_type)
{
+ case at_language:
+ lang_func = argbuffer[i].function;
+ break;
+#ifdef ETAGS_REGEXPS
+ case at_regexp:
+ add_regex (argbuffer[i].what);
+ break;
#endif
- /* Input file named "-" means read file names from stdin
- and use them. */
- if (streq (this_file, "-"))
+ case at_filename:
+#ifdef VMS
+ while ((this_file = gfnames (argbuffer[i].what, &got_err)) != NULL)
{
- while (!feof (stdin))
+ if (got_err)
+ {
+ error ("Can't find file %s\n", this_file);
+ argc--, argv++;
+ }
+ else
{
- (void) readline (&filename_lb, stdin);
- if (strlen (filename_lb.buffer) > 0)
- process_file (filename_lb.buffer);
+ this_file = massage_name (this_file);
}
+#else
+ this_file = argbuffer[i].what;
+#endif
+ /* Input file named "-" means read file names from stdin
+ and use them. */
+ if (streq (this_file, "-"))
+ while (readline_internal (&filename_lb, stdin) > 0)
+ process_file (filename_lb.buffer);
+ else
+ process_file (this_file);
+#ifdef VMS
}
- else
- process_file (this_file);
+#endif
+ break;
}
}
- if (emacs_tags_format)
+ if (!CTAGS)
{
while (nincluded_files-- > 0)
- fprintf (outf, "\f\n%s,include\n", *included_files++);
+ fprintf (tagf, "\f\n%s,include\n", *included_files++);
- (void) fclose (outf);
- exit (0);
+ fclose (tagf);
+ exit (GOOD);
}
+ /* If CTAGS, we are here. process_file did not write the tags yet,
+ because we want them ordered. Let's do it now. */
if (cxref_style)
{
+ tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
+ if (tagf == NULL)
+ pfatal (tagfile);
put_entries (head);
exit (GOOD);
}
+
if (update)
{
- /* update cannot be set under VMS, so we may assume that argc
- and argv have not been munged. */
- for (i = optind; i < argc; i++)
+ char cmd[BUFSIZ];
+ for (i = 0; i < current_arg; ++i)
{
+ if (argbuffer[i].arg_type != at_filename)
+ continue;
sprintf (cmd,
"mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
- outfile, argv[i], outfile);
- (void) system (cmd);
+ tagfile, argbuffer[i].what, tagfile);
+ if (system (cmd) != GOOD)
+ fatal ("failed to execute shell command");
}
- append_to_tagfile++;
- }
- outf = fopen (outfile, append_to_tagfile ? "a" : "w");
- if (outf == NULL)
- {
- perror (outfile);
- exit (GOOD);
+ append_to_tagfile = TRUE;
}
+
+ tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
+ if (tagf == NULL)
+ pfatal (tagfile);
put_entries (head);
- (void) fclose (outf);
+ fclose (tagf);
+
if (update)
{
- sprintf (cmd, "sort %s -o %s", outfile, outfile);
- (void) system (cmd);
+ char cmd[BUFSIZ];
+ sprintf (cmd, "sort %s -o %s", tagfile, tagfile);
+ exit (system (cmd));
}
exit (GOOD);
}
+/*
+ * Return a Lang_function given the name.
+ */
+Lang_function *
+get_language_from_name (name)
+ char *name;
+{
+ struct lang_entry *lang;
+
+ if (name != NULL)
+ for (lang = lang_names; lang->name != NULL; lang++)
+ {
+ if (streq (name, lang->name))
+ return lang->function;
+ }
+
+ fprintf (stderr, "%s: language \"%s\" not recognized.\n",
+ progname, optarg);
+ suggest_asking_for_help ();
+
+ /* This point should never be reached. The function should either
+ return a function pointer or never return. Note that a NULL
+ pointer cannot be considered as an error, as it means that the
+ language has not been explicitely imposed by the user ("auto"). */
+ return NULL; /* avoid warnings from compiler */
+}
+
+
+/*
+ * Return a Lang_function given the interpreter name.
+ */
+Lang_function *
+get_language_from_interpreter (interpreter)
+ char *interpreter;
+{
+ struct lang_entry *lang;
+ 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->function;
+
+ return NULL;
+}
+
+
+
+/*
+ * Return a Lang_function given the file suffix.
+ */
+Lang_function *
+get_language_from_suffix (suffix)
+ char *suffix;
+{
+ struct lang_entry *lang;
+ char **ext;
+
+ if (suffix == NULL)
+ return NULL;
+ for (lang = lang_names; lang->name != NULL; lang++)
+ if (lang->suffixes != NULL)
+ for (ext = lang->suffixes; *ext != NULL; ext++)
+ if (streq (*ext, suffix))
+ return lang->function;
+
+ return NULL;
+}
+
+
/*
* This routine is called on each file argument.
*/
char *file;
{
struct stat stat_buf;
+ FILE *inf;
+#ifdef DOS_NT
+ char *p;
+
+ for (p = file; *p != '\0'; p++)
+ if (*p == '\\')
+ *p = '/';
+#endif
- stat (file, &stat_buf);
- if (!(stat_buf.st_mode & S_IFREG) || !(stat_buf.st_mode & S_IFLNK))
+ if (stat (file, &stat_buf) == 0 && !S_ISREG (stat_buf.st_mode))
{
fprintf (stderr, "Skipping %s: it is not a regular file.\n", file);
return;
}
-
- if (streq (file, outfile) && !streq (outfile, "-"))
+ if (streq (file, tagfile) && !streq (tagfile, "-"))
{
fprintf (stderr, "Skipping inclusion of %s in self.\n", file);
return;
}
- if (emacs_tags_format)
+ inf = fopen (file, "r");
+ if (inf == NULL)
{
- char *cp = rindex (file, '/');
- if (cp)
- ++cp;
- else
- cp = file;
+ perror (file);
+ return;
}
- find_entries (file);
- if (emacs_tags_format)
+
+ find_entries (file, inf);
+
+ if (!CTAGS)
{
- fprintf (outf, "\f\n%s,%d\n",
- file, total_size_of_entries (head));
+ char *filename;
+
+ if (absolutefn (file))
+ {
+ /* file is an absolute filename. Canonicalise it. */
+ filename = absolute_filename (file, cwd);
+ }
+ else
+ {
+ /* file is a filename relative to cwd. Make it relative
+ to the directory of the tags file. */
+ filename = relative_filename (file, tagfiledir);
+ }
+ fprintf (tagf, "\f\n%s,%d\n", filename, total_size_of_entries (head));
+ free (filename);
put_entries (head);
free_tree (head);
head = NULL;
}
/*
- * This routine sets up the boolean psuedo-functions which work
- * by seting boolean flags dependent upon the corresponding character
+ * This routine sets up the boolean pseudo-functions which work
+ * by setting boolean flags dependent upon the corresponding character
* Every char which is NOT in that string is not a white char. Therefore,
* all of the array "_wht" is set to FALSE, and then the elements
* subscripted by the chars in "white" are set to TRUE. Thus "_wht"
void
init ()
{
- reg char *sp;
- reg int i;
+ register char *sp;
+ register int i;
for (i = 0; i < 0177; i++)
- {
- _wht[i] = _etk[i] = _itk[i] = _btk[i] = FALSE;
- _gd[i] = TRUE;
- }
+ _wht[i] = _etk[i] = _itk[i] = _btk[i] = FALSE;
for (sp = white; *sp; sp++)
_wht[*sp] = TRUE;
for (sp = endtk; *sp; sp++)
_itk[*sp] = TRUE;
for (sp = begtk; *sp; sp++)
_btk[*sp] = TRUE;
- for (sp = notgd; *sp; sp++)
- _gd[*sp] = FALSE;
_wht[0] = _wht['\n'];
_etk[0] = _etk['\n'];
_btk[0] = _btk['\n'];
_itk[0] = _itk['\n'];
- _gd[0] = _gd['\n'];
}
/*
* which finds the function and type definitions.
*/
void
-find_entries (file)
+find_entries (file, inf)
char *file;
+ FILE *inf;
{
char *cp;
- void prolog_funcs ();
+ Lang_function *function;
+ NODE *old_last_node;
+ extern NODE *last_node;
- inf = fopen (file, "r");
- if (inf == NULL)
- {
- perror (file);
- return;
- }
+
+ /* Memory leakage here: the memory block pointed by curfile is never
+ released. The amount of memory leaked here is the sum of the
+ lengths of the input file names. */
curfile = savestr (file);
- cp = rindex (file, '.');
-
- header_file = (cp && (streq (cp + 1, "h")));
-
- /* .tex, .aux or .bbl implies LaTeX source code */
- if (cp && (streq (cp + 1, "tex") || streq (cp + 1, "aux")
- || streq (cp + 1, "bbl")))
- {
- TEX_funcs (inf);
- goto close_and_return;
- }
- /* .l or .el or .lisp (or .cl or .clisp or ...) implies lisp source code */
- if (cp && (streq (cp + 1, "l")
- || streq (cp + 1, "el")
- || streq (cp + 1, "lsp")
- || streq (cp + 1, "lisp")
- || streq (cp + 1, "cl")
- || streq (cp + 1, "clisp")))
- {
- L_funcs (inf);
- goto close_and_return;
- }
- /* .scm or .sm or .scheme or ... implies scheme source code */
- if (cp && (streq (cp + 1, "sm")
- || streq (cp + 1, "scm")
- || streq (cp + 1, "scheme")
- || streq (cp + 1, "t")
- || streq (cp + 1, "sch")
- || streq (cp + 1, "SM")
- || streq (cp + 1, "SCM")
- /* The `SCM' or `scm' prefix with a version number */
- || (cp[-1] == 'm' && cp[-2] == 'c' && cp[-3] == 's'
- && string_numeric_p (cp + 1))
- || (cp[-1] == 'M' && cp[-2] == 'C' && cp[-3] == 'S'
- && string_numeric_p (cp + 1))))
- {
- Scheme_funcs (inf);
- fclose (inf);
- return;
- }
- /* Assume that ".s" or ".a" is assembly code. -wolfgang. */
- if (cp && (cp[1] == 's' || cp[1] == 'a') && cp[2] == '\0')
+
+ /* If user specified a language, use it. */
+ function = lang_func;
+ if (function != NULL)
{
- Asm_funcs (inf);
+ function (inf);
fclose (inf);
return;
}
- /* .C or .H or .cxx or .hxx or .cc: a C++ file */
- if (cp && (streq (cp + 1, "C")
- || streq (cp + 1, "H")
- || streq (cp + 1, "cxx")
- || streq (cp + 1, "hxx")
- || streq (cp + 1, "cc")))
- {
- C_entries (C_PLPL); /* C++ */
- goto close_and_return;
- }
- /* .cs or .hs: a C* file */
- if (cp && (cp[1] == 'c' || cp[1] == 'h') && cp[2] == 's' && cp[3] == '\0')
- {
- C_entries (C_STAR);
- goto close_and_return;
- }
- /* .pl implies prolog source code */
- if (cp && !strcmp (cp + 1, "pl"))
- {
- prolog_funcs (inf);
- goto close_and_return;
- }
- /* .p or .pas: a Pascal file */
- if (cp && (streq (cp + 1, "p")
- || streq (cp + 1, "pas")))
+
+ cp = etags_strrchr (file, '.');
+ if (cp != NULL)
{
- PAS_funcs (inf);
- goto close_and_return;
+ cp += 1;
+ function = get_language_from_suffix (cp);
+ if (function != NULL)
+ {
+ function (inf);
+ fclose (inf);
+ return;
+ }
}
- /* if not a .c or .h or .y file, try fortran */
- else if (cp && ((cp[1] != 'c'
- && cp[1] != 'h'
- && cp[1] != 'y')
- || (cp[1] != 0 && cp[2] != 0)))
+
+ /* Look for sharp-bang as the first two characters. */
+ if (readline_internal (&lb, inf) > 2
+ && lb.buffer[0] == '#'
+ && lb.buffer[1] == '!')
{
- if (PF_funcs (inf) != 0)
- goto close_and_return;
- rewind (inf); /* no fortran tags found, try C */
- }
- C_entries (cplusplus ? C_PLPL : 0);
+ 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 = etags_strrchr (lb.buffer+2, '/');
+ if (lp != NULL)
+ lp += 1;
+ else
+ for (lp = lb.buffer+2; *lp != '\0' && isspace (*lp); lp++)
+ continue;
+ for (cp = lp; *cp != '\0' && !isspace (*cp); cp++)
+ continue;
+ *cp = '\0';
-close_and_return:
- (void) fclose (inf);
-}
+ if (strlen (lp) > 0)
+ {
+ function = get_language_from_interpreter (lp);
+ if (function != NULL)
+ {
+ function (inf);
+ fclose (inf);
+ return;
+ }
+ }
+ }
+ rewind (inf);
-/* Nonzero if string STR is composed of digits. */
+ /* Try Fortran. */
+ old_last_node = last_node;
+ Fortran_functions (inf);
-int
-string_numeric_p (str)
- char *str;
-{
- while (*str)
+ /* No Fortran entries found. Try C. */
+ if (old_last_node == last_node)
{
- if (*str < '0' || *str > '9')
- return 0;
+ rewind (inf);
+ default_C_entries (inf);
}
- return 1;
+ fclose (inf);
+ return;
}
\f
/* Record a tag. */
-/* Should take a TOKEN* instead!! */
-
void
-pfnote (name, is_func, rewritten, linestart, linelen, lno, cno)
- char *name; /* tag name */
- logical is_func; /* function or type name? */
- logical rewritten; /* tag different from text of definition? */
- char *linestart;
- int linelen;
- int lno;
- long cno;
-{
- register char *fp;
+pfnote (name, is_func, linestart, linelen, lno, cno)
+ char *name; /* tag name, or NULL if unnamed */
+ logical is_func; /* tag is a function */
+ char *linestart; /* start of the line where tag is */
+ int linelen; /* length of the line where tag is */
+ int lno; /* line number */
+ long cno; /* character number */
+{
register NODE *np;
- char tem[51];
- char c;
- np = (NODE *) malloc (sizeof (NODE));
- if (np == NULL)
- {
- if (!emacs_tags_format)
- {
- /* It's okay to output early in etags -- it only disrupts the
- * character count of the tag entries, which is no longer used
- * by tags.el anyway.
- */
- error ("too many entries to sort");
- }
- put_entries (head);
- free_tree (head);
- head = NULL;
- np = xnew (1, NODE);
- }
+ if (CTAGS && name == NULL)
+ return;
+
+ np = xnew (1, NODE);
+
/* If ctags mode, change name "main" to M<thisfilename>. */
- if (!emacs_tags_format && !cxref_style && streq (name, "main"))
+ if (CTAGS && !cxref_style && streq (name, "main"))
{
- fp = rindex (curfile, '/');
- name = concat ("M", fp == 0 ? curfile : fp + 1, "");
- fp = rindex (name, '.');
+ register char *fp = etags_strrchr (curfile, '/');
+ np->name = concat ("M", fp == 0 ? curfile : fp + 1, "");
+ fp = etags_strrchr (np->name, '.');
if (fp && fp[1] != '\0' && fp[2] == '\0')
- *fp = 0;
- rewritten = TRUE;
+ fp[0] = 0;
}
- np->name = savestr (name);
+ else
+ np->name = name;
+ np->been_warned = FALSE;
np->file = curfile;
np->is_func = is_func;
- np->rewritten = rewritten;
np->lno = lno;
- /* UNCOMMENT THE +1 HERE: */
- np->cno = cno /* + 1 */ ; /* our char numbers are 0-base; emacs's are 1-base */
- np->left = np->right = 0;
- if (emacs_tags_format)
- {
- c = linestart[linelen];
- linestart[linelen] = 0;
- }
- else if (cxref_style == 0)
+ /* 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 */ ;
+ np->left = np->right = NULL;
+ if (CTAGS && !cxref_style)
{
- sprintf (tem, strlen (linestart) < 50 ? "%s$" : "%.50s", linestart);
- linestart = tem;
- }
- np->pat = savestr (linestart);
- if (emacs_tags_format)
- {
- linestart[linelen] = c;
+ if (strlen (linestart) < 50)
+ np->pat = concat (linestart, "$", "");
+ else
+ np->pat = savenstr (linestart, 50);
}
+ else
+ np->pat = savenstr (linestart, linelen);
add_node (np, &head);
}
{
register NODE *node_right = node->right;
free_tree (node->left);
- free (node->name);
+ if (node->name != NULL)
+ free (node->name);
free (node->pat);
free ((char *) node);
node = node_right;
* add_node is the only function allowed to add nodes, so it can
* maintain state.
*/
+NODE *last_node = NULL;
void
add_node (node, cur_node_p)
NODE *node, **cur_node_p;
{
register int dif;
register NODE *cur_node = *cur_node_p;
- static NODE *last_node = NULL;/* careful */
if (cur_node == NULL)
{
return;
}
- if (emacs_tags_format)
+ if (!CTAGS)
{
/* Etags Mode */
- if (!last_node)
- fatal ("internal error in add_node");
+ if (last_node == NULL)
+ fatal ("internal error in add_node", 0);
last_node->right = node;
last_node = node;
}
*/
if (!dif)
{
- if (node->file == cur_node->file)
+ if (streq (node->file, cur_node->file))
{
if (!no_warnings)
{
node->file, lineno, node->name);
fprintf (stderr, "Second entry ignored\n");
}
- return;
}
- if (!cur_node->been_warned && !no_warnings)
+ else if (!cur_node->been_warned && !no_warnings)
{
- fprintf (stderr,
- "Duplicate entry in files %s and %s: %s (Warning only)\n",
- node->file, cur_node->file, node->name);
+ fprintf
+ (stderr,
+ "Duplicate entry in files %s and %s: %s (Warning only)\n",
+ node->file, cur_node->file, node->name);
+ cur_node->been_warned = TRUE;
}
- cur_node->been_warned = TRUE;
return;
}
- /* Maybe refuse to add duplicate nodes. */
- if (!permit_duplicates)
- {
- if (!strcmp (node->name, cur_node->name)
- && !strcmp (node->file, cur_node->file))
- return;
- }
-
/* Actually add the node */
add_node (node, dif < 0 ? &cur_node->left : &cur_node->right);
}
\f
void
put_entries (node)
- reg NODE *node;
+ register NODE *node;
{
- reg char *sp;
+ register char *sp;
if (node == NULL)
return;
/* Output this entry */
- if (emacs_tags_format)
+ if (!CTAGS)
+ {
+ if (node->name != NULL)
+ fprintf (tagf, "%s\177%s\001%d,%d\n",
+ node->pat, node->name, node->lno, node->cno);
+ else
+ fprintf (tagf, "%s\177%d,%d\n",
+ node->pat, node->lno, node->cno);
+ }
+ else
{
- if (node->rewritten)
+ if (node->name == NULL)
+ error ("internal error: NULL name in ctags mode.", 0);
+
+ if (cxref_style)
{
- fprintf (outf, "%s\177%s\001%d,%d\n",
- node->name, node->pat, node->lno, node->cno);
+ if (vgrind_style)
+ fprintf (stdout, "%s %s %d\n",
+ node->name, node->file, (node->lno + 63) / 64);
+ else
+ fprintf (stdout, "%-16s %3d %-16s %s\n",
+ node->name, node->lno, node->file, node->pat);
}
else
{
- fprintf (outf, "%s\177%d,%d\n",
- node->pat, node->lno, node->cno);
- }
- }
- else if (!cxref_style)
- {
- fprintf (outf, "%s\t%s\t",
- node->name, node->file);
+ fprintf (tagf, "%s\t%s\t", node->name, node->file);
- if (node->is_func)
- { /* a function */
- putc (searchar, outf);
- putc ('^', outf);
+ if (node->is_func)
+ { /* a function */
+ putc (searchar, tagf);
+ putc ('^', tagf);
- for (sp = node->pat; *sp; sp++)
- {
- if (*sp == '\\' || *sp == searchar)
- putc ('\\', outf);
- putc (*sp, outf);
+ for (sp = node->pat; *sp; sp++)
+ {
+ if (*sp == '\\' || *sp == searchar)
+ putc ('\\', tagf);
+ putc (*sp, tagf);
+ }
+ putc (searchar, tagf);
}
- putc (searchar, outf);
- }
- else
- { /* a typedef; text pattern inadequate */
- fprintf (outf, "%d", node->lno);
+ else
+ { /* a typedef; text pattern inadequate */
+ fprintf (tagf, "%d", node->lno);
+ }
+ putc ('\n', tagf);
}
- putc ('\n', outf);
}
- else if (vgrind_style)
- fprintf (stdout, "%s %s %d\n",
- node->name, node->file, (node->lno + 63) / 64);
- else
- fprintf (stdout, "%-16s %3d %-16s %s\n",
- node->name, node->lno, node->file, node->pat);
/* Output subentries that follow this one */
put_entries (node->right);
/*
* Return total number of characters that put_entries will output for
- * the nodes in the subtree of the specified node. Works only if emacs_tags_format
- * is set, but called only in that case. This count is irrelevant with
- * the new tags.el, but is still supplied for backward compatibility.
+ * the nodes in the subtree of the specified node. Works only if
+ * we are not ctags, but called only in that case. This count
+ * is irrelevant with the new tags.el, but is still supplied for
+ * backward compatibility.
*/
int
total_size_of_entries (node)
- reg NODE *node;
+ register NODE *node;
{
- reg int total;
+ register int total;
if (node == NULL)
return 0;
/* Count this entry */
total += strlen (node->pat) + 1;
total += number_len ((long) node->lno) + 1 + number_len (node->cno) + 1;
- if (node->rewritten)
+ if (node->name != NULL)
total += 1 + strlen (node->name); /* \001name */
}
/*
* The C symbol tables.
*/
+enum sym_type
+{
+ st_none, st_C_objprot, st_C_objimpl, st_C_objend, st_C_gnumacro,
+ st_C_struct, st_C_enum, st_C_define, st_C_typedef, st_C_typespec
+};
-Stab *C_stab, *C_PLPL_stab, *C_STAR_stab;
-
+/* Feed stuff between (but not including) %[ and %] lines to:
+ gperf -c -k 1,3 -o -p -r -t
+%[
+struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
+%%
+@interface, 0, st_C_objprot
+@protocol, 0, st_C_objprot
+@implementation,0, st_C_objimpl
+@end, 0, st_C_objend
+class, C_PLPL, st_C_struct
+namespace, C_PLPL, st_C_struct
+domain, C_STAR, st_C_struct
+union, 0, st_C_struct
+struct, 0, st_C_struct
+enum, 0, st_C_enum
+typedef, 0, st_C_typedef
+define, 0, st_C_define
+bool, C_PLPL, st_C_typespec
+long, 0, st_C_typespec
+short, 0, st_C_typespec
+int, 0, st_C_typespec
+char, 0, st_C_typespec
+float, 0, st_C_typespec
+double, 0, st_C_typespec
+signed, 0, st_C_typespec
+unsigned, 0, st_C_typespec
+auto, 0, st_C_typespec
+void, 0, st_C_typespec
+extern, 0, st_C_typespec
+static, 0, st_C_typespec
+const, 0, st_C_typespec
+volatile, 0, st_C_typespec
+explicit, C_PLPL, st_C_typespec
+mutable, C_PLPL, st_C_typespec
+typename, C_PLPL, st_C_typespec
+# 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
+# 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. */
+/*%<*/
+/* C code produced by gperf version 2.1 (K&R C version) */
+/* Command-line: gperf -c -k 1,3 -o -p -r -t */
+
+
+struct C_stab_entry { char *name; int c_ext; enum sym_type type; };
+
+#define MIN_WORD_LENGTH 3
+#define MAX_WORD_LENGTH 15
+#define MIN_HASH_VALUE 34
+#define MAX_HASH_VALUE 121
/*
- * SYNOPSIS
- * Stab *get_C_stab (int c_ext);
- */
-#define get_C_stab(c_ext) ((c_ext&C_STAR) ? C_STAR_stab : \
- c_ext ? C_PLPL_stab : \
- C_stab)
-
-void
-add_keyword (stab, sym, type)
- Stab *stab;
- char *sym;
- enum sym_type type;
+ 34 keywords
+ 88 is the maximum key range
+*/
+
+static int
+hash (str, len)
+ register char *str;
+ register unsigned int len;
{
- stab_search (stab, sym, strlen (sym))->type = type;
+ static unsigned char hash_table[] =
+ {
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 45, 121, 121, 121, 16, 19,
+ 61, 121, 121, 121, 121, 121, 121, 121, 121, 121,
+ 10, 121, 121, 20, 53, 121, 121, 121, 121, 121,
+ 121, 121, 121, 121, 121, 121, 121, 41, 45, 22,
+ 60, 47, 37, 28, 121, 55, 121, 121, 20, 14,
+ 29, 30, 5, 121, 50, 59, 30, 54, 6, 121,
+ 121, 121, 121, 121, 121, 121, 121, 121,
+ };
+ return len + hash_table[str[2]] + hash_table[str[0]];
}
-Stab *
-C_create_stab (c_ext)
- int c_ext;
+struct C_stab_entry *
+in_word_set (str, len)
+ register char *str;
+ register unsigned int len;
{
- Stab *stab;
-
- stab = stab_create ();
-
- /* C, C++ and C* */
- if (c_ext & C_PLPL)
- add_keyword (stab, "class", st_C_struct);
- if (c_ext & C_STAR)
- add_keyword (stab, "domain", st_C_struct);
- add_keyword (stab, "union", st_C_struct);
- add_keyword (stab, "struct", st_C_struct);
- add_keyword (stab, "enum", st_C_enum);
- add_keyword (stab, "typedef", st_C_typedef);
- add_keyword (stab, "define", st_C_define);
- add_keyword (stab, "long", st_C_typespec);
- add_keyword (stab, "short", st_C_typespec);
- add_keyword (stab, "int", st_C_typespec);
- add_keyword (stab, "char", st_C_typespec);
- add_keyword (stab, "float", st_C_typespec);
- add_keyword (stab, "double", st_C_typespec);
- add_keyword (stab, "signed", st_C_typespec);
- add_keyword (stab, "unsigned", st_C_typespec);
- add_keyword (stab, "const", st_C_typespec);
- add_keyword (stab, "volatile", st_C_typespec);
-
- return stab;
+
+ static struct C_stab_entry wordlist[] =
+ {
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"volatile", 0, st_C_typespec},
+ {"PSEUDO", 0, st_C_gnumacro},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"typedef", 0, st_C_typedef},
+ {"typename", C_PLPL, st_C_typespec},
+ {"",}, {"",}, {"",},
+ {"SYSCALL", 0, st_C_gnumacro},
+ {"",}, {"",}, {"",},
+ {"mutable", C_PLPL, st_C_typespec},
+ {"namespace", C_PLPL, st_C_struct},
+ {"long", 0, st_C_typespec},
+ {"",}, {"",},
+ {"const", 0, st_C_typespec},
+ {"",}, {"",}, {"",},
+ {"explicit", C_PLPL, st_C_typespec},
+ {"",}, {"",}, {"",}, {"",},
+ {"void", 0, st_C_typespec},
+ {"",},
+ {"char", 0, st_C_typespec},
+ {"class", C_PLPL, st_C_struct},
+ {"",}, {"",}, {"",},
+ {"float", 0, st_C_typespec},
+ {"",},
+ {"@implementation", 0, st_C_objimpl},
+ {"auto", 0, st_C_typespec},
+ {"",},
+ {"ENTRY", 0, st_C_gnumacro},
+ {"@end", 0, st_C_objend},
+ {"bool", C_PLPL, st_C_typespec},
+ {"domain", C_STAR, st_C_struct},
+ {"",},
+ {"DEFUN", 0, st_C_gnumacro},
+ {"extern", 0, st_C_typespec},
+ {"@interface", 0, st_C_objprot},
+ {"",}, {"",}, {"",},
+ {"int", 0, st_C_typespec},
+ {"",}, {"",}, {"",}, {"",},
+ {"signed", 0, st_C_typespec},
+ {"short", 0, st_C_typespec},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"define", 0, st_C_define},
+ {"@protocol", 0, st_C_objprot},
+ {"enum", 0, st_C_enum},
+ {"static", 0, st_C_typespec},
+ {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
+ {"union", 0, st_C_struct},
+ {"struct", 0, st_C_struct},
+ {"",}, {"",}, {"",}, {"",},
+ {"double", 0, st_C_typespec},
+ {"unsigned", 0, st_C_typespec},
+ };
+
+ if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+ {
+ register int key = hash (str, len);
+
+ if (key <= MAX_HASH_VALUE && key >= MIN_HASH_VALUE)
+ {
+ register char *s = wordlist[key].name;
+
+ if (*s == *str && !strncmp (str + 1, s + 1, len - 1))
+ return &wordlist[key];
+ }
+ }
+ return 0;
}
+/*%>*/
-void
-C_create_stabs ()
+enum sym_type
+C_symtype(str, len, c_ext)
+ char *str;
+ int len;
+ int c_ext;
{
- C_stab = C_create_stab (0);
- C_PLPL_stab = C_create_stab (C_PLPL);
- C_STAR_stab = C_create_stab (C_STAR | C_PLPL);
+ register 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;
}
\f
+ /*
+ * C functions are recognized using a simple finite automaton.
+ * funcdef is its state variable.
+ */
+enum
+{
+ fnone, /* nothing seen */
+ ftagseen, /* function-like tag seen */
+ fstartlist, /* just after open parenthesis */
+ finlist, /* in parameter list */
+ flistseen, /* after parameter list */
+ fignore /* before open brace */
+} funcdef;
+
+
+ /*
+ * typedefs are recognized using a simple finite automaton.
+ * typdef is its state variable.
+ */
+enum
+{
+ tnone, /* nothing seen */
+ ttypedseen, /* typedef keyword 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.
+ */
+enum
+{
+ snone, /* nothing seen yet */
+ skeyseen, /* struct-like keyword seen */
+ stagseen, /* struct-like tag seen */
+ scolonseen, /* colon seen after struct-like tag */
+ sinbody /* in struct body: recognize member func defs*/
+} structdef;
+
/*
- * C_entries ()
- * This routine finds functions and typedefs in C syntax and adds them
- * to the list.
+ * When structdef is stagseen, scolonseen, or sinbody, structtag is the
+ * struct tag, and structtype is the type of the preceding struct-like
+ * keyword.
*/
+char *structtag = "<uninited>";
+enum sym_type structtype;
-#define CNL_SAVE_DEFINEDEF \
-{ \
- prev_linepos = linepos; \
- SET_FILEPOS (linepos, inf, charno); \
- lineno++; \
- charno += readline (&lb, inf); \
- lp = lb.buffer; \
-}
+/*
+ * When objdef is different from onone, objtag is the name of the class.
+ */
+char *objtag = "<uninited>";
-#define CNL \
-{ \
- CNL_SAVE_DEFINEDEF; \
- definedef = dnone; \
-}
+/*
+ * Yet another little state machine to deal with preprocessor lines.
+ */
+enum
+{
+ dnone, /* nothing seen */
+ dsharpseen, /* '#' seen as first char on line */
+ ddefineseen, /* '#' and 'define' seen */
+ dignorerest /* ignore rest of line */
+} definedef;
-void
-C_entries (c_ext)
- int c_ext; /* extension of C? */
+/*
+ * State machine for Objective C protocols and implementations.
+ */
+enum
{
- register int c; /* latest char read; '\0' for end of line */
- register int tokoff; /* offset in line of beginning of latest token */
- register int toklen; /* length of latest token */
- register char *lp; /* pointer one beyond the character `c' */
- logical incomm, inquote, inchar, midtoken;
- int level; /* current curly brace level */
- char tokb[BUFSIZ];
+ 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;
- lineno = 0;
- charno = 0;
- lp = lb.buffer;
- *lp = 0;
+/*
+ * Set this to TRUE, and the next token considered is called a function.
+ * Used only for GNU emacs's function-defining macros.
+ */
+logical next_token_is_func;
- definedef = dnone;
- gotone = midtoken = inquote = inchar = incomm = FALSE;
- level = 0;
- tydef = none;
- next_token_is_func = 0;
+/*
+ * TRUE in the rules part of a yacc file, FALSE outside (parse as C).
+ */
+logical yacc_rules;
- C_create_stabs ();
-
- while (!feof (inf))
- {
- c = *lp++;
- if (c == '\\')
- {
- /* If we're at the end of the line, the next character is a
- '\0'; don't skip it, because it's the thing that tells us
- to read the next line. */
- if (*lp == 0)
- continue;
- lp++;
- c = ' ';
- }
- else if (incomm)
- {
- if (c == '*' && *lp == '/')
- {
- c = *lp++;
- incomm = FALSE;
- }
- }
- else if (inquote)
- {
- if (c == '"')
- inquote = FALSE;
- else if (c == '\\')
- c = *lp++;
- }
- else if (inchar)
- {
- if (c == '\'')
- inchar = FALSE;
- continue;
- }
- else
- switch (c)
- {
- case '"':
- inquote = TRUE;
- continue;
- case '\'':
- inchar = TRUE;
- continue;
- case '/':
- if (*lp == '*')
- {
- lp++;
- incomm = TRUE;
- }
- else if (c_ext && *lp == '/')
- {
- c = 0;
- break;
- }
- continue;
- case '#':
- if (lp == lb.buffer + 1 && definedef == dnone)
- definedef = dsharpseen;
- continue;
-
- /*
- * The next two are to help the strucdef state machine.
- * They break when they are finished, so they don't interfere
- * with anything else that is going on.
- */
- case ':':
- if (structdef == stagseen)
- structdef = scolonseen;
- break;
- /* Not a struct definition when semicolon seen in non-sinbody context. */
- case ';':
- if (structdef != snone && structdef != sinbody)
- {
- structdef = snone;
- (void) strcpy (structtag, "<error 1>");
- }
- break;
-
- case '{':
- if (tydef == begin)
- {
- tydef = middle;
- }
- switch (structdef)
- {
- case skeyseen: /* unnamed struct */
- structtag[0] = '\0';
- /* FALLTHRU */
- case stagseen:
- case scolonseen: /* named struct */
- structdef = sinbody;
- break;
- }
- level++;
- continue;
- case '}':
- if (!noindentypedefs && lp == lb.buffer + 1)
- level = 0; /* reset level if first column */
- else if (level > 0)
- level--;
- if (level == 0 && tydef == middle)
- {
- tydef = end;
- }
- if (level == 0)
- {
- structdef = snone;
- (void) strcpy (structtag, "<error 2>");
- }
- continue;
- }
- if (LEVEL_OK_FOR_FUNCDEF () && !inquote && !incomm && gotone == FALSE)
- {
- if (midtoken)
- {
- if (endtoken (c))
- {
- if (c_ext && c == ':' && *lp == ':' && intoken (*(lp + 1)))
- {
- /*
- * This handles :: in the middle, but not at beginning
- * of an identifier.
- */
- lp += 2;
- toklen += 3;
- }
- else
- {
- /* The following is no longer true,
- now that we advance to the next line
- at the end of processing the character. */
- /*
- * We've just finished lexing an identifier.
- * Note that if `c' is '\0', `lb' is the NEXT
- * line, `lp' points to the beginning of it, and
- * old pointers into `lb.buffer' may no longer be
- * valid, since `lb.buffer' may have been
- * reallocated. In this case (which corresponds
- * to an identifier followed immediately by a
- * newline), we re-read the line into lb1.
- *
- * This would be faster if the previous line's
- * buffer were always saved.
- */
- logical is_func;
- char *tok_linebuf;
- TOKEN tok;
- logical bingo, tok_at_end_of_line;
- char *lp_tmp; /* addressable */
-
-#if 0
- if (c == '\0')
- {
- getline (GET_COOKIE (prev_linepos));
- tok_linebuf = lb1.buffer;
- tok_at_end_of_line = TRUE;
- tok.linestart = prev_linepos;
- tok.lineno = lineno - 1;
- }
- else
-#endif
- {
- tok_linebuf = lb.buffer;
- tok_at_end_of_line = FALSE;
- tok.linestart = linepos;
- tok.lineno = lineno;
- }
- tok.p = tok_linebuf + tokoff;
- tok.len = toklen;
- tok.rewritten = FALSE;
- lp_tmp = lp;
- bingo = consider_token (c, &lp_tmp, &tok,
- &is_func, c_ext, level);
- lp = lp_tmp;
- if (bingo)
- {
- if (GET_CHARNO (tok.linestart) != GET_CHARNO (linepos)
- && !tok_at_end_of_line)
- {
- /*
- * Resynchronize tok.p to point into the right
- * linebuffer.
- */
- getline (GET_COOKIE (tok.linestart));
- if (!tok.rewritten)
- tok.p = lb1.buffer + (tok.p - tok_linebuf);
- tok_linebuf = lb1.buffer;
- }
- if (structdef == sinbody && definedef == dnone && is_func)
- { /* function defined in C++ class body */
- sprintf (tokb, "%s::%.*s",
- structtag[0] == '\0' ? "_anonymous_"
- : structtag,
- tok.len, tok.p);
- tok.rewritten = TRUE;
- }
- else
- {
- sprintf (tokb, "%.*s", tok.len, tok.p);
- }
- pfnote (tokb, is_func, tok.rewritten, tok_linebuf,
- tokoff + toklen + (tok_at_end_of_line ? 0 : 1),
- tok.lineno, GET_CHARNO (tok.linestart));
- gotone = is_func; /* function */
- }
- midtoken = FALSE;
- }
- }
- else if (intoken (c))
- toklen++;
- }
- else if (begtoken (c))
- {
- tokoff = lp - 1 - lb.buffer;
- toklen = 1;
- midtoken = TRUE;
- }
- }
- /* Detect end of line, after having handled the last token on the line. */
- if (c == 0)
- {
- CNL;
- gotone = FALSE;
- }
- if (c == ';' && tydef == end) /* clean with typedefs */
- tydef = none;
- }
-}
+/*
+ * methodlen is the length of the method name stored in token_name.
+ */
+int methodlen;
/*
* consider_token ()
* checks to see if the current token is at the start of a
- * function, or corresponds to a typedef. It updates the input
- * line pointer *LPP so that the '(' will be in it when it returns.
+ * function, or corresponds to a typedef, or is a struct/union/enum
+ * tag.
*
- * *IS_FUNC gets TRUE iff the token is a function.
+ * *IS_FUNC gets TRUE iff the token is a function or macro with args.
* C_EXT is which language we are looking at.
*
* In the future we will need some way to adjust where the end of
* whatever follows `operator'.
*
* Globals
- * structdef IN OUT
- * definedef IN OUT
- * tydef IN OUT
+ * funcdef IN OUT
+ * structdef IN OUT
+ * definedef IN OUT
+ * typdef IN OUT
+ * objdef IN OUT
+ * next_token_is_func IN OUT
*/
logical
-consider_token (c, lpp, tokp, is_func, c_ext, level)
- reg char c; /* IN: first char after the token */
- char **lpp; /* IN OUT: *lpp points to 2nd char after the token */
- reg TOKEN *tokp; /* IN */
- logical *is_func; /* OUT */
- int c_ext; /* IN */
- int level; /* IN */
+consider_token (str, len, c, c_ext, cblev, parlev, is_func)
+ register char *str; /* IN: token pointer */
+ register int len; /* IN: token length */
+ register char c; /* IN: first char after the token */
+ int c_ext; /* IN: C extensions mask */
+ int cblev; /* IN: curly brace level */
+ int parlev; /* IN: parenthesis level */
+ logical *is_func; /* OUT: function found */
{
- reg char *lp = *lpp;
- logical firsttok; /* TRUE if have seen first token in ()'s */
- Stab_entry *tokse = stab_find (get_C_stab (c_ext), tokp->p, tokp->len);
- enum sym_type toktype = stab_type (tokse);
-
- *is_func = TRUE; /* a function */
+ enum sym_type toktype = C_symtype (str, len, c_ext);
/*
- * Advance the definedef state machine. We set `gotone' for good measure;
- * it's redundant.
+ * Advance the definedef state machine.
*/
switch (definedef)
{
if (toktype == st_C_define)
{
definedef = ddefineseen;
- gotone = FALSE;
}
else
{
definedef = dignorerest;
- gotone = TRUE;
}
- goto badone;
+ return FALSE;
case ddefineseen:
/*
- * Make a tag for any macro.
- * This will flub up if there is a newline immediately following
- * the macro name.
+ * Make a tag for any macro, unless it is a constant
+ * and constantypedefs is FALSE.
*/
- *is_func = (c == '(');
definedef = dignorerest;
- gotone = TRUE;
+ *is_func = (c == '(');
if (!*is_func && !constantypedefs)
- goto badone;
- goto goodone;
+ return FALSE;
+ else
+ return TRUE;
case dignorerest:
- goto badone;
+ return FALSE;
default:
- error ("internal error: definedef value");
+ error ("internal error: definedef value.", 0);
}
/*
- * Skip whitespace and comments after the token. This loop should
- * also skip C++ comments.
+ * Now typedefs
*/
- while (1)
+ switch (typdef)
{
- /* At whitespace => skip it. */
- if (iswhite (c))
- {
- c = *lp++;
- }
- /* At a comment => skip to end of comment. */
- else if (c == '/' && *lp == '*')
+ case tnone:
+ if (toktype == st_C_typedef)
{
- /* If we find a comment, skip it. */
- while (!(c == '*' && *lp == '/'))
- {
- c = *lp++;
- if (c == 0)
- {
- lp--;
- break;
- }
- }
- if (c == '*' && *lp == '/')
- {
- lp++; /* lp now points past the '/' */
- c = *lp++; /* c is now the --whatever-- after the '/' */
- }
+ if (typedefs)
+ typdef = ttypedseen;
+ funcdef = fnone;
+ return FALSE;
}
- else
- break;
-
- /* If we arrived at eof or eol, decide which one it is.
- If it's eol, advance to the next line. */
-
- if (c == 0)
+ break;
+ case ttypedseen:
+ switch (toktype)
{
- lp--;
+ case st_none:
+ case st_C_typespec:
+ typdef = tend;
+ break;
+ case st_C_struct:
+ case st_C_enum:
break;
}
- }
-
- /*
- * If you have custom token types, or when configuration files can
- * define custom token types, this switch will be larger.
- */
- switch (toktype)
- {
- case st_C_typedef:
- if (typedefs)
- {
- tydef = begin;
- goto badone;
- }
+ /* Do not return here, so the structdef stuff has a chance. */
break;
- case st_C_typespec:
- if (tydef == begin || tydef == end)
+ case tend:
+ switch (toktype)
{
- tydef = end;
- goto badone;
+ case st_C_typespec:
+ case st_C_struct:
+ case st_C_enum:
+ return FALSE;
}
- break;
+ return TRUE;
}
/*
- * This structdef business is currently only invoked when level==0.
- * It should be recursively invoked whatever the level, and a stack of
- * states kept, to allow for definitions of structs within structs.
+ * This structdef business is currently only invoked when cblev==0.
+ * It should be recursively invoked whatever the curly brace level,
+ * and a stack of states kept, to allow for definitions of structs
+ * within structs.
*
* This structdef business is NOT invoked when we are ctags and the
* file is plain C. This is because a struct tag may have the same
* name as another tag, and this loses with ctags.
*
- * This if statement deals with the tydef state machine as follows: if
- * tydef==begin and token is struct/union/class/enum, goto badone.
- * All the other code here is for the structdef state machine.
+ * This if statement deals with the typdef state machine as
+ * follows: if typdef==ttypedseen and token is struct/union/class/enum,
+ * return FALSE. All the other code here is for the structdef
+ * state machine.
*/
switch (toktype)
{
case st_C_struct:
case st_C_enum:
- if (tydef == begin || (typedefs_and_cplusplus && level == 0 && structdef == snone))
+ if (typdef == ttypedseen
+ || (typedefs_and_cplusplus && cblev == 0 && structdef == snone))
{
structdef = skeyseen;
- structkey = tokse;
+ structtype = toktype;
}
- goto badone;
+ return FALSE;
}
-
if (structdef == skeyseen)
{
- /* If next char is '{' or (for C++) ':', found a structure tag. */
- if (c == '{' || (c_ext && c == ':'))
- {
- /*
- * We should do this slightly differently for straight C:
- * instead of defining `tag', as we now do, we should define
- * `struct tag'. (Do this only if the find-tag defaulting is
- * done on a sophisticated per-mode basis, so that if the user
- * says meta-. anywhere in `struct foo', the default comes out
- * `struct foo', not `struct' or `foo'.) This will require
- * remembering which keyword (struct/union/class/enum) we saw, as a
- * Stab_entry* -- this will also make it possible to merge the
- * skeyseen and senumseen states, if we want.
- */
- if (stab_type (structkey) == st_C_struct)
- {
- (void) strncpy (structtag, tokp->p, tokp->len);
- structtag[tokp->len] = '\0'; /* for struct/union/class */
- structdef = stagseen;
- }
- else
- {
- structtag[0] = '\0'; /* for enum */
- }
- *is_func = FALSE; /* not a function */
- goto goodone;
- }
+ /* Save the tag for struct/union/class, for functions that may be
+ defined inside. */
+ if (structtype == st_C_struct)
+ structtag = savenstr (str, len);
else
- {
- /* Not a definition: reset structdef */
- structdef = snone;
- (void) strcpy (structtag, "<error 3>");
- }
- /* Now what? And how does/should this stuff interact with tydef?? */
- /* Also maybe reset lp to *lpp for benefit of the function finding code. */
- }
- if (tydef == begin)
- {
- tydef = end;
- goto badone;
+ structtag = "<enum>";
+ structdef = stagseen;
+ return TRUE;
}
- if (tydef == end)
+
+ /* Avoid entering funcdef stuff if typdef is going on. */
+ if (typdef != tnone)
{
- *is_func = 0;
- goto goodone;
+ definedef = dnone;
+ return FALSE;
}
- /* Detect GNUmacs's function-defining macros. */
- if (definedef == dnone)
+
+ /* Detect GNU macros. */
+ if (definedef == dnone && toktype == st_C_gnumacro)
{
- if (strneq (tokp->p, "DEF", 3)
- || strneq (tokp->p, "ENTRY", 5)
- || strneq (tokp->p, "SYSCALL", 7)
- || strneq (tokp->p, "PSEUDO", 6))
- {
- next_token_is_func = TRUE;
- goto badone;
- }
- else if (strneq (tokp->p, "EXFUN", 5))
- {
- next_token_is_func = FALSE;
- goto badone;
- }
+ next_token_is_func = TRUE;
+ return FALSE;
}
if (next_token_is_func)
{
next_token_is_func = FALSE;
- goto goodone;
+ funcdef = fignore;
+ *is_func = TRUE;
+ return TRUE;
}
- if (c != '(')
- goto badone;
- firsttok = FALSE;
- while ((c = *lp++) != ')')
+
+ /*
+ * Detecting Objective C constructs.
+ */
+ switch (objdef)
{
- if (c == 0)
+ case onone:
+ switch (toktype)
{
- lp--;
- break;
+ case st_C_objprot:
+ objdef = oprotocol;
+ return FALSE;
+ case st_C_objimpl:
+ objdef = oimplementation;
+ return FALSE;
}
- /*
- * This line used to confuse ctags:
- * int (*oldhup)();
- * This fixes it. A nonwhite char before the first
- * token, other than a / (in case of a comment in there)
- * makes this not a declaration.
- */
- if (begtoken (c) || c == '/')
- firsttok++;
- else if (!iswhite (c) && !firsttok)
- goto badone;
- }
- while (iswhite (c = *lp++))
- {
- if (c == 0)
+ break;
+ case oimplementation:
+ /* Save the class tag for functions that may be 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 = TRUE;
+ return TRUE;
+ case oparenseen:
+ objdef = ocatseen;
+ *is_func = TRUE;
+ return TRUE;
+ case oinbody:
+ break;
+ case omethodsign:
+ if (parlev == 0)
{
- lp--;
- break;
+ objdef = omethodtag;
+ methodlen = len;
+ GROW_LINEBUFFER (token_name, methodlen+1);
+ strncpy (token_name.buffer, str, len);
+ token_name.buffer[methodlen] = '\0';
+ return TRUE;
+ }
+ return FALSE;
+ case omethodcolon:
+ if (parlev == 0)
+ objdef = omethodparm;
+ return FALSE;
+ case omethodparm:
+ if (parlev == 0)
+ {
+ objdef = omethodtag;
+ methodlen += len;
+ GROW_LINEBUFFER (token_name, methodlen+1);
+ strncat (token_name.buffer, 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;
}
- if (!isgood (c))
- goto badone;
-goodone:
- *lpp = lp - 1;
- return TRUE;
+ /* A function? */
+ switch (toktype)
+ {
+ case st_C_typespec:
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone; /* should be useless */
+ return FALSE;
+ default:
+ if (funcdef == fnone)
+ {
+ funcdef = ftagseen;
+ *is_func = TRUE;
+ return TRUE;
+ }
+ }
-badone:
- *lpp = lp - 1;
return FALSE;
}
-void
-getline (atcookie)
- long atcookie;
+/*
+ * C_entries ()
+ * This routine finds functions, typedefs, #define's and
+ * struct/union/enum definitions in C syntax and adds them
+ * to the list.
+ */
+typedef struct
{
- long saveftell = ftell (inf);
+ logical valid;
+ char *str;
+ logical named;
+ int linelen;
+ int lineno;
+ long linepos;
+ char *buffer;
+} TOKEN;
- (void) fseek (inf, atcookie, 0);
- (void) readline (&lb1, inf);
- (void) fseek (inf, saveftell, 0);
-}
-\f
-/* Fortran parsing */
+#define current_lb_is_new (newndx == curndx)
+#define switch_line_buffers() (curndx = 1 - curndx)
-char *dbp;
-int pfcnt;
+#define curlb (lbs[curndx].lb)
+#define othlb (lbs[1-curndx].lb)
+#define newlb (lbs[newndx].lb)
+#define curlinepos (lbs[curndx].linepos)
+#define othlinepos (lbs[1-curndx].linepos)
+#define newlinepos (lbs[newndx].linepos)
-int
-PF_funcs (fi)
- FILE *fi;
+#define CNL_SAVE_DEFINEDEF \
+do { \
+ curlinepos = charno; \
+ lineno++; \
+ linecharno = charno; \
+ charno += readline (&curlb, inf); \
+ lp = curlb.buffer; \
+ quotednl = FALSE; \
+ newndx = curndx; \
+} while (0)
+
+#define CNL \
+do { \
+ CNL_SAVE_DEFINEDEF; \
+ if (savetok.valid) \
+ { \
+ tok = savetok; \
+ savetok.valid = FALSE; \
+ } \
+ definedef = dnone; \
+} while (0)
+
+/* Ideally this macro should never be called wihen tok.valid is FALSE,
+ but this would mean that the state machines always guess right. */
+#define make_tag(isfun) do \
+if (tok.valid) { \
+ char *name = NULL; \
+ if (CTAGS || tok.named) \
+ name = savestr (token_name.buffer); \
+ pfnote (name, isfun, tok.buffer, tok.linelen, tok.lineno, tok.linepos); \
+ tok.valid = FALSE; \
+} while (0)
+
+void
+C_entries (c_ext, inf)
+ int c_ext; /* extension of C */
+ FILE *inf; /* input file */
{
+ register char c; /* latest char read; '\0' for end of line */
+ register char *lp; /* pointer one beyond the character `c' */
+ int curndx, newndx; /* indices for current and new lb */
+ TOKEN tok; /* latest token read */
+ register int tokoff; /* offset in line of start of current token */
+ register int toklen; /* length of current token */
+ int cblev; /* current curly brace level */
+ int parlev; /* current parenthesis level */
+ logical incomm, inquote, inchar, quotednl, midtoken;
+ logical cplpl;
+ TOKEN savetok; /* token saved during preprocessor handling */
+
+
+ curndx = newndx = 0;
lineno = 0;
charno = 0;
- pfcnt = 0;
+ lp = curlb.buffer;
+ *lp = 0;
+
+ funcdef = fnone; typdef = tnone; structdef = snone;
+ definedef = dnone; objdef = onone;
+ next_token_is_func = yacc_rules = FALSE;
+ midtoken = inquote = inchar = incomm = quotednl = FALSE;
+ tok.valid = savetok.valid = FALSE;
+ cblev = 0;
+ parlev = 0;
+ cplpl = c_ext & C_PLPL;
- while (!feof (fi))
+ while (!feof (inf))
{
- lineno++;
- linecharno = charno;
- charno += readline (&lb, fi);
- dbp = lb.buffer;
- if (*dbp == '%')
- dbp++; /* Ratfor escape to fortran */
- while (isspace (*dbp))
- dbp++;
- if (*dbp == 0)
- continue;
- switch (*dbp | ' ')
+ c = *lp++;
+ if (c == '\\')
{
- case 'i':
- if (tail ("integer"))
- takeprec ();
- break;
- case 'r':
- if (tail ("real"))
- takeprec ();
- break;
- case 'l':
- if (tail ("logical"))
- takeprec ();
- break;
- case 'c':
- if (tail ("complex") || tail ("character"))
- takeprec ();
- break;
- case 'd':
- if (tail ("double"))
+ /* If we're at the end of the line, the next character is a
+ '\0'; don't skip it, because it's the thing that tells us
+ to read the next line. */
+ if (*lp == '\0')
{
- while (isspace (*dbp))
- dbp++;
- if (*dbp == 0)
- continue;
- if (tail ("precision"))
- break;
+ quotednl = TRUE;
continue;
}
- break;
+ lp++;
+ c = ' ';
}
- while (isspace (*dbp))
- dbp++;
- if (*dbp == 0)
- continue;
- switch (*dbp | ' ')
+ else if (incomm)
{
- case 'f':
- if (tail ("function"))
- getit ();
- continue;
- case 's':
- if (tail ("subroutine"))
- getit ();
+ 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;
- case 'p':
- if (tail ("program"))
+ }
+ else if (inquote)
+ {
+ switch (c)
{
- getit ();
- continue;
+ 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;
}
- if (tail ("procedure"))
- getit ();
continue;
}
- }
- return (pfcnt);
+ else if (inchar)
+ {
+ switch (c)
+ {
+ case '\0':
+ /* Hmmm, something went wrong. */
+ CNL;
+ /* FALLTHRU */
+ case '\'':
+ inchar = FALSE;
+ break;
+ }
+ continue;
+ }
+ else
+ switch (c)
+ {
+ case '"':
+ inquote = TRUE;
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone;
+ continue;
+ case '\'':
+ inchar = TRUE;
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone;
+ continue;
+ case '/':
+ if (*lp == '*')
+ {
+ lp++;
+ incomm = TRUE;
+ continue;
+ }
+ else if (/* cplpl && */ *lp == '/')
+ {
+ c = '\0';
+ break;
+ }
+ else
+ break;
+ case '%':
+ if ((c_ext & YACC) && *lp == '%')
+ {
+ /* entering or exiting rules section in yacc file */
+ lp++;
+ definedef = dnone; funcdef = fnone;
+ typdef = tnone; structdef = snone;
+ next_token_is_func = FALSE;
+ midtoken = inquote = inchar = incomm = quotednl = FALSE;
+ cblev = 0;
+ yacc_rules = !yacc_rules;
+ continue;
+ }
+ else
+ break;
+ case '#':
+ if (definedef == dnone)
+ {
+ char *cp;
+ logical 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 (!iswhite (*cp))
+ {
+ if (*cp == '*' && *(cp+1) == '/')
+ {
+ cp++;
+ cpptoken = TRUE;
+ }
+ else
+ cpptoken = FALSE;
+ }
+ if (cpptoken)
+ definedef = dsharpseen;
+ } /* if (definedef == dnone) */
+
+ continue;
+ } /* switch (c) */
+
+
+ /* Consider token only if some complicated conditions are satisfied. */
+ if ((definedef != dnone
+ || (cblev == 0 && structdef != scolonseen)
+ || (cblev == 1 && cplpl && structdef == sinbody))
+ && typdef != tignore
+ && definedef != dignorerest
+ && funcdef != finlist)
+ {
+ if (midtoken)
+ {
+ if (endtoken (c))
+ {
+ if (c == ':' && cplpl && *lp == ':' && begtoken(*(lp + 1)))
+ {
+ /*
+ * This handles :: in the middle, but not at the
+ * beginning of an identifier.
+ */
+ lp += 2;
+ toklen += 3;
+ }
+ else
+ {
+ logical is_func = FALSE;
+
+ if (yacc_rules
+ || consider_token (newlb.buffer + tokoff, toklen, c,
+ c_ext, cblev, parlev, &is_func))
+ {
+ if (structdef == sinbody
+ && definedef == dnone
+ && is_func)
+ /* function defined in C++ class body */
+ {
+ GROW_LINEBUFFER (token_name,
+ strlen(structtag)+2+toklen+1);
+ strcpy (token_name.buffer, structtag);
+ strcat (token_name.buffer, "::");
+ strncat (token_name.buffer,
+ newlb.buffer+tokoff, toklen);
+ tok.named = TRUE;
+ }
+ else if (objdef == ocatseen)
+ /* Objective C category */
+ {
+ GROW_LINEBUFFER (token_name,
+ strlen(objtag)+2+toklen+1);
+ strcpy (token_name.buffer, objtag);
+ strcat (token_name.buffer, "(");
+ strncat (token_name.buffer,
+ newlb.buffer+tokoff, toklen);
+ strcat (token_name.buffer, ")");
+ tok.named = TRUE;
+ }
+ else if (objdef == omethodtag
+ || objdef == omethodparm)
+ /* Objective C method */
+ {
+ tok.named = TRUE;
+ }
+ else
+ {
+ GROW_LINEBUFFER (token_name, toklen+1);
+ strncpy (token_name.buffer,
+ newlb.buffer+tokoff, toklen);
+ token_name.buffer[toklen] = '\0';
+ if (structdef == stagseen
+ || typdef == tend
+ || (is_func
+ && definedef == dignorerest)) /* macro */
+ tok.named = TRUE;
+ else
+ tok.named = FALSE;
+ }
+ tok.lineno = lineno;
+ tok.linelen = tokoff + toklen + 1;
+ tok.buffer = newlb.buffer;
+ tok.linepos = newlinepos;
+ tok.valid = TRUE;
+
+ if (definedef == dnone
+ && (funcdef == ftagseen
+ || structdef == stagseen
+ || typdef == tend
+ || objdef != onone))
+ {
+ if (current_lb_is_new)
+ switch_line_buffers ();
+ }
+ else
+ make_tag (is_func);
+ }
+ midtoken = FALSE;
+ }
+ } /* if (endtoken (c)) */
+ else if (intoken (c))
+ {
+ toklen++;
+ continue;
+ }
+ } /* if (midtoken) */
+ else if (begtoken (c))
+ {
+ switch (definedef)
+ {
+ case dnone:
+ switch (funcdef)
+ {
+ case fstartlist:
+ funcdef = finlist;
+ continue;
+ case flistseen:
+ make_tag (TRUE);
+ funcdef = fignore;
+ break;
+ case ftagseen:
+ funcdef = fnone;
+ break;
+ }
+ if (structdef == stagseen)
+ structdef = snone;
+ break;
+ case dsharpseen:
+ savetok = tok;
+ }
+ 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 (definedef != dnone)
+ break;
+ switch (objdef)
+ {
+ case otagseen:
+ objdef = oignore;
+ make_tag (TRUE);
+ break;
+ case omethodtag:
+ case omethodparm:
+ objdef = omethodcolon;
+ methodlen += 1;
+ GROW_LINEBUFFER (token_name, methodlen+1);
+ strcat (token_name.buffer, ":");
+ break;
+ }
+ if (structdef == stagseen)
+ structdef = scolonseen;
+ else
+ switch (funcdef)
+ {
+ case ftagseen:
+ if (yacc_rules)
+ {
+ make_tag (FALSE);
+ funcdef = fignore;
+ }
+ break;
+ case fstartlist:
+ funcdef = fnone;
+ break;
+ }
+ break;
+ case ';':
+ if (definedef != dnone)
+ break;
+ if (cblev == 0)
+ switch (typdef)
+ {
+ case tend:
+ make_tag (FALSE);
+ /* FALLTHRU */
+ default:
+ typdef = tnone;
+ }
+ if (funcdef != fignore)
+ {
+ funcdef = fnone;
+ /* The following instruction invalidates the token.
+ Probably the token should be invalidated in all
+ other cases where some state machine is reset. */
+ tok.valid = FALSE;
+ }
+ if (structdef == stagseen)
+ structdef = snone;
+ break;
+ case ',':
+ if (definedef != dnone)
+ break;
+ switch (objdef)
+ {
+ case omethodtag:
+ case omethodparm:
+ make_tag (TRUE);
+ objdef = oinbody;
+ break;
+ }
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone;
+ if (structdef == stagseen)
+ structdef = snone;
+ break;
+ case '[':
+ if (definedef != dnone)
+ break;
+ if (cblev == 0 && typdef == tend)
+ {
+ typdef = tignore;
+ make_tag (FALSE);
+ break;
+ }
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone;
+ if (structdef == stagseen)
+ structdef = snone;
+ break;
+ case '(':
+ if (definedef != dnone)
+ break;
+ if (objdef == otagseen && parlev == 0)
+ objdef = oparenseen;
+ switch (funcdef)
+ {
+ case fnone:
+ switch (typdef)
+ {
+ case ttypedseen:
+ case tend:
+ /* Make sure that the next char is not a '*'.
+ This handles constructs like:
+ typedef void OperatorFun (int fun); */
+ if (*lp != '*')
+ {
+ typdef = tignore;
+ make_tag (FALSE);
+ }
+ break;
+ } /* switch (typdef) */
+ break;
+ case ftagseen:
+ funcdef = fstartlist;
+ break;
+ case flistseen:
+ funcdef = finlist;
+ break;
+ }
+ parlev++;
+ break;
+ case ')':
+ if (definedef != dnone)
+ break;
+ if (objdef == ocatseen && parlev == 1)
+ {
+ make_tag (TRUE);
+ objdef = oignore;
+ }
+ if (--parlev == 0)
+ {
+ switch (funcdef)
+ {
+ case fstartlist:
+ case finlist:
+ funcdef = flistseen;
+ break;
+ }
+ if (cblev == 0 && typdef == tend)
+ {
+ typdef = tignore;
+ make_tag (FALSE);
+ }
+ }
+ else if (parlev < 0) /* can happen due to ill-conceived #if's. */
+ parlev = 0;
+ break;
+ case '{':
+ if (definedef != dnone)
+ break;
+ if (typdef == ttypedseen)
+ typdef = tinbody;
+ switch (structdef)
+ {
+ case skeyseen: /* unnamed struct */
+ structtag = "_anonymous_";
+ structdef = sinbody;
+ break;
+ case stagseen:
+ case scolonseen: /* named struct */
+ structdef = sinbody;
+ make_tag (FALSE);
+ break;
+ }
+ switch (funcdef)
+ {
+ case flistseen:
+ make_tag (TRUE);
+ /* FALLTHRU */
+ case fignore:
+ funcdef = fnone;
+ break;
+ case fnone:
+ switch (objdef)
+ {
+ case otagseen:
+ make_tag (TRUE);
+ objdef = oignore;
+ break;
+ case omethodtag:
+ case omethodparm:
+ make_tag (TRUE);
+ objdef = oinbody;
+ break;
+ default:
+ /* Neutralize `extern "C" {' grot and look inside structs. */
+ if (cblev == 0 && structdef == snone && typdef == tnone)
+ cblev = -1;
+ }
+ }
+ cblev++;
+ break;
+ case '*':
+ if (definedef != dnone)
+ break;
+ if (funcdef == fstartlist)
+ funcdef = fnone; /* avoid tagging `foo' in `foo (*bar()) ()' */
+ break;
+ case '}':
+ if (definedef != dnone)
+ break;
+ if (!noindentypedefs && lp == newlb.buffer + 1)
+ {
+ cblev = 0; /* reset curly brace level if first column */
+ parlev = 0; /* also reset paren level, just in case... */
+ }
+ else if (cblev > 0)
+ cblev--;
+ if (cblev == 0)
+ {
+ if (typdef == tinbody)
+ typdef = tend;
+ /* Memory leakage here: the string pointed by structtag is
+ never released, because I fear to miss something and
+ break things while freeing the area. The amount of
+ memory leaked here is the sum of the lengths of the
+ struct tags.
+ if (structdef == sinbody)
+ free (structtag); */
+
+ structdef = snone;
+ structtag = "<error>";
+ }
+ break;
+ case '+':
+ case '-':
+ if (objdef == oinbody && cblev == 0)
+ {
+ objdef = omethodsign;
+ break;
+ }
+ /* FALLTHRU */
+ case '=': case '#': case '~': case '&': case '%': case '/':
+ case '|': case '^': case '!': case '<': case '>': case '.': case '?':
+ if (definedef != dnone)
+ break;
+ /* These surely cannot follow a function tag. */
+ if (funcdef != finlist && funcdef != fignore)
+ funcdef = fnone;
+ break;
+ case '\0':
+ if (objdef == otagseen)
+ {
+ make_tag (TRUE);
+ 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 */
+}
+
+/*
+ * Process either a C++ file or a C file depending on the setting
+ * of a global flag.
+ */
+void
+default_C_entries (inf)
+ FILE *inf;
+{
+ C_entries (cplusplus ? C_PLPL : 0, inf);
+}
+
+/* Always do plain ANSI C. */
+void
+plain_C_entries (inf)
+ FILE *inf;
+{
+ C_entries (0, inf);
+}
+
+/* Always do C++. */
+void
+Cplusplus_entries (inf)
+ FILE *inf;
+{
+ C_entries (C_PLPL, inf);
+}
+
+/* Always do C*. */
+void
+Cstar_entries (inf)
+ FILE *inf;
+{
+ C_entries (C_STAR, inf);
+}
+
+/* Always do Yacc. */
+void
+Yacc_entries (inf)
+ FILE *inf;
+{
+ C_entries (YACC, inf);
}
+\f
+/* Fortran parsing */
+
+char *dbp;
logical
tail (cp)
{
register int len = 0;
- while (*cp && (*cp & ~' ') == ((*(dbp + len)) & ~' '))
+ while (*cp && lowcase(*cp) == lowcase(dbp[len]))
cp++, len++;
- if (*cp == 0)
+ if (*cp == '\0' && !intoken(dbp[len]))
{
dbp += len;
- return (1);
+ return TRUE;
}
- return (0);
+ return FALSE;
}
void
dbp++;
while (isspace (*dbp))
dbp++;
+ if (strneq (dbp, "(*)", 3))
+ {
+ dbp += 3;
+ return;
+ }
if (!isdigit (*dbp))
{
--dbp; /* force failure */
}
void
-getit ()
+getit (inf)
+ FILE *inf;
{
register char *cp;
- char c;
- char nambuf[BUFSIZ];
while (isspace (*dbp))
dbp++;
- if (*dbp == 0
- || (!isalpha (*dbp)
- && *dbp != '_'
- && *dbp != '$'))
+ if (*dbp == '\0')
+ {
+ lineno++;
+ linecharno = charno;
+ charno += readline (&lb, inf);
+ dbp = lb.buffer;
+ if (dbp[5] != '&')
+ return;
+ dbp += 6;
+ while (isspace (*dbp))
+ dbp++;
+ }
+ if (!isalpha (*dbp)
+ && *dbp != '_'
+ && *dbp != '$')
return;
- for (cp = dbp + 1; *cp && (isalpha (*cp) || isdigit (*cp)
- || (*cp == '_') || (*cp == '$')); cp++)
+ for (cp = dbp + 1;
+ (*cp
+ && (isalpha (*cp) || isdigit (*cp) || (*cp == '_') || (*cp == '$')));
+ cp++)
continue;
- c = cp[0];
- cp[0] = 0;
- (void) strcpy (nambuf, dbp);
- cp[0] = c;
- pfnote (nambuf, TRUE, FALSE, lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
- pfcnt++;
+ pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
+ lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
-/* Handle a file of assembler code. */
-
void
-Asm_funcs (fi)
- FILE *fi;
+Fortran_functions (inf)
+ FILE *inf;
{
- int i;
- register char c;
-
lineno = 0;
charno = 0;
- pfcnt = 0;
- while (!feof (fi))
+ while (!feof (inf))
{
lineno++;
linecharno = charno;
- charno += readline (&lb, fi);
+ charno += readline (&lb, inf);
dbp = lb.buffer;
+ if (*dbp == '%')
+ dbp++; /* Ratfor escape to fortran */
+ while (isspace (*dbp))
+ dbp++;
+ if (*dbp == '\0')
+ continue;
+ switch (lowcase (*dbp))
+ {
+ case 'i':
+ if (tail ("integer"))
+ takeprec ();
+ break;
+ case 'r':
+ if (tail ("real"))
+ takeprec ();
+ break;
+ case 'l':
+ if (tail ("logical"))
+ takeprec ();
+ break;
+ case 'c':
+ if (tail ("complex") || tail ("character"))
+ takeprec ();
+ break;
+ case 'd':
+ if (tail ("double"))
+ {
+ while (isspace (*dbp))
+ dbp++;
+ if (*dbp == '\0')
+ continue;
+ if (tail ("precision"))
+ break;
+ continue;
+ }
+ break;
+ }
+ while (isspace (*dbp))
+ dbp++;
+ if (*dbp == '\0')
+ continue;
+ switch (lowcase (*dbp))
+ {
+ case 'f':
+ if (tail ("function"))
+ getit (inf);
+ continue;
+ case 's':
+ if (tail ("subroutine"))
+ getit (inf);
+ continue;
+ case 'e':
+ if (tail ("entry"))
+ getit (inf);
+ continue;
+ case 'p':
+ if (tail ("program"))
+ {
+ getit (inf);
+ continue;
+ }
+ if (tail ("procedure"))
+ getit (inf);
+ continue;
+ }
+ }
+}
+\f
+/*
+ * Bob Weiner, Motorola Inc., 4/3/94
+ * Unix and microcontroller assembly tag handling
+ * look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
+ */
+void
+Asm_labels (inf)
+ FILE *inf;
+{
+ register char *cp;
- for (i = 0; ((c = dbp[i]) && !isspace (c)) && (c != ':'); i++)
- ;
+ lineno = 0;
+ charno = 0;
- if ((i > 0) && (c == ':'))
- getit ();
+ while (!feof (inf))
+ {
+ lineno++;
+ linecharno = charno;
+ charno += readline (&lb, inf);
+ cp = lb.buffer;
+
+ /* If first char is alphabetic or one of [_.$], test for colon
+ following identifier. */
+ if (isalpha (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
+ {
+ /* Read past label. */
+ cp++;
+ while (isalnum (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
+ cp++;
+ if (*cp == ':' || isspace (*cp))
+ {
+ /* Found end of label, so copy it and add it to the table. */
+ pfnote ((CTAGS) ? savenstr(lb.buffer, cp-lb.buffer) : NULL, TRUE,
+ lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
+ }
+ }
}
}
\f
-/* Added by Mosur Mohan, 4/22/88 */
-/* Pascal parsing */
+/*
+ * Perl support by Bart Robinson <lomew@cs.utah.edu>
+ * Perl sub names: look for /^sub[ \t\n]+[^ \t\n{]+/
+ */
+void
+Perl_functions (inf)
+ FILE *inf;
+{
+ register char *cp;
-#define GET_NEW_LINE \
-{ \
- linecharno = charno; lineno++; \
- charno += 1 + readline (&lb, inf); \
- dbp = lb.buffer; \
+ lineno = 0;
+ charno = 0;
+
+ while (!feof (inf))
+ {
+ lineno++;
+ linecharno = charno;
+ charno += readline (&lb, inf);
+ cp = lb.buffer;
+
+ if (*cp++ == 's' && *cp++ == 'u' && *cp++ == 'b' && isspace(*cp++))
+ {
+ while (*cp && isspace(*cp))
+ cp++;
+ while (*cp && ! isspace(*cp) && *cp != '{')
+ cp++;
+ pfnote ((CTAGS) ? savenstr (lb.buffer, cp-lb.buffer) : NULL, TRUE,
+ lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
+ }
+ }
}
+\f
+/* Added by Mosur Mohan, 4/22/88 */
+/* Pascal parsing */
-/* 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.
+/*
+ * 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.
*/
-
void
-PAS_funcs (fi)
- FILE *fi;
+Pascal_functions (inf)
+ FILE *inf;
{
struct linebuffer tline; /* mostly copied from C_entries */
long save_lcno;
- int save_lineno;
- char c, *cp;
- char nambuf[BUFSIZ];
+ int save_lineno, save_len;
+ char c, *cp, *namebuf;
logical /* each of these flags is TRUE iff: */
- incomm1, /* point is inside {..} comment */
- incomm2, /* point is inside (*..*) comment */
+ incomment, /* point is inside a comment */
inquote, /* point is inside '..' string */
- get_tagname, /* point is after PROCEDURE/FUNCTION */
- /* keyword, so next item = potential tag */
+ 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 */
+ 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 */
lineno = 0;
charno = 0;
dbp = lb.buffer;
- *dbp = 0;
+ *dbp = '\0';
+ save_len = 0;
initbuffer (&tline);
- incomm1 = incomm2 = inquote = FALSE;
+ incomment = inquote = FALSE;
found_tag = FALSE; /* have a proc name; check if extern */
get_tagname = FALSE; /* have found "procedure" keyword */
inparms = FALSE; /* found '(' after "proc" */
verify_tag = FALSE; /* check if "extern" is ahead */
/* long main loop to get next char */
- while (!feof (fi))
+ while (!feof (inf))
{
c = *dbp++;
- if (c == 0) /* if end of line */
+ if (c == '\0') /* if end of line */
{
- GET_NEW_LINE;
- if (*dbp == 0)
+ lineno++;
+ linecharno = charno;
+ charno += 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 (incomm1) /* within { - } comments */
- {
- if (c == '}')
- incomm1 = FALSE;
- continue;
+ c = *dbp++; /* only if don't need *dbp pointing
+ to the beginning of the name of
+ the procedure or function */
}
- else if (incomm2) /* within (* - *) comments */
+ if (incomment)
{
- if (c == '*')
+ if (c == '}') /* within { } comments */
+ incomment = FALSE;
+ else if (c == '*' && *dbp == ')') /* within (* *) comments */
{
- while ((c = *dbp++) == '*')
- continue;
- if (c == 0)
- GET_NEW_LINE;
- if (c == ')')
- incomm2 = FALSE;
+ dbp++;
+ incomment = FALSE;
}
continue;
}
case '\'':
inquote = TRUE; /* found first quote */
continue;
- case '{': /* found open-{-comment */
- incomm1 = TRUE;
+ case '{': /* found open { comment */
+ incomment = TRUE;
continue;
case '(':
- if (*dbp == '*') /* found open-(*-comment */
+ if (*dbp == '*') /* found open (* comment */
{
- incomm2 = TRUE;
+ incomment = TRUE;
dbp++;
}
else if (found_tag) /* found '(' after tag, i.e., parm-list */
inparms = FALSE;
continue;
case ';':
- if ((found_tag) && (!inparms)) /* end of proc or fn stmt */
+ if (found_tag && !inparms) /* end of proc or fn stmt */
{
verify_tag = TRUE;
break;
}
continue;
}
- if ((found_tag) && (verify_tag) && (*dbp != ' '))
+ if (found_tag && verify_tag && (*dbp != ' '))
{
/* check if this is an "extern" declaration */
- if (*dbp == 0)
+ if (*dbp == '\0')
continue;
- if ((*dbp == 'e') || (*dbp == 'E'))
+ if (lowcase (*dbp == 'e'))
{
if (tail ("extern")) /* superfluous, really! */
{
verify_tag = FALSE;
}
}
- else if ((*dbp == 'f') || (*dbp == 'F'))
+ else if (lowcase (*dbp) == 'f')
{
if (tail ("forward")) /* check for forward reference */
{
verify_tag = FALSE;
}
}
- if ((found_tag) && (verify_tag)) /* not external proc, so make tag */
+ if (found_tag && verify_tag) /* not external proc, so make tag */
{
found_tag = FALSE;
verify_tag = FALSE;
- pfnote (nambuf, TRUE, FALSE,
- tline.buffer, cp - tline.buffer + 1,
- save_lineno, save_lcno);
+ pfnote (namebuf, TRUE,
+ tline.buffer, save_len, save_lineno, save_lcno);
continue;
}
}
if (get_tagname) /* grab name of proc or fn */
{
- if (*dbp == 0)
+ if (*dbp == '\0')
continue;
/* save all values for later tagging */
- tline.size = lb.size;
+ GROW_LINEBUFFER (tline, strlen (lb.buffer) + 1);
strcpy (tline.buffer, lb.buffer);
save_lineno = lineno;
save_lcno = linecharno;
/* grab block name */
for (cp = dbp + 1; *cp && (!endtoken (*cp)); cp++)
continue;
- c = cp[0];
- cp[0] = 0;
- strcpy (nambuf, dbp);
- cp[0] = c;
- dbp = cp; /* restore dbp to e-o-token */
+ namebuf = (CTAGS) ? savenstr (dbp, cp-dbp) : NULL;
+ dbp = cp; /* set dbp to e-o-token */
+ save_len = dbp - lb.buffer + 1;
get_tagname = FALSE;
found_tag = TRUE;
continue;
/* and proceed to check for "extern" */
}
- if ((!incomm1) && (!incomm2) && (!inquote) &&
- (!found_tag) && (!get_tagname))
+ else if (!incomment && !inquote && !found_tag)
{
/* check for proc/fn keywords */
- switch (c | ' ')
+ switch (lowcase (c))
{
case 'p':
if (tail ("rocedure")) /* c = 'p', dbp has advanced */
continue;
}
}
- } /* while not e-o-f */
+ } /* while not eof */
+
+ free (tline.buffer);
}
\f
/*
* lisp tag functions
- * just look for (def or (DEF
+ * look for (def or (DEF, quote or QUOTE
*/
+int
+L_isdef (strp)
+ register char *strp;
+{
+ return ((strp[1] == 'd' || strp[1] == 'D')
+ && (strp[2] == 'e' || strp[2] == 'E')
+ && (strp[3] == 'f' || strp[3] == 'F'));
+}
+
+int
+L_isquote (strp)
+ register char *strp;
+{
+ return ((*(++strp) == 'q' || *strp == 'Q')
+ && (*(++strp) == 'u' || *strp == 'U')
+ && (*(++strp) == 'o' || *strp == 'O')
+ && (*(++strp) == 't' || *strp == 'T')
+ && (*(++strp) == 'e' || *strp == 'E')
+ && isspace(*(++strp)));
+}
+
+void
+L_getit ()
+{
+ register char *cp;
+
+ if (*dbp == '\'') /* Skip prefix quote */
+ dbp++;
+ else if (*dbp == '(' && L_isquote (dbp)) /* Skip "(quote " */
+ {
+ dbp += 7;
+ while (isspace(*dbp))
+ dbp++;
+ }
+ for (cp = dbp /*+1*/;
+ *cp && *cp != '(' && *cp != ' ' && *cp != ')';
+ cp++)
+ continue;
+ if (cp == dbp)
+ return;
+
+ pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
+ lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
+}
void
-L_funcs (fi)
- FILE *fi;
+Lisp_functions (inf)
+ FILE *inf;
{
lineno = 0;
charno = 0;
- pfcnt = 0;
- while (!feof (fi))
+ while (!feof (inf))
{
lineno++;
linecharno = charno;
- charno += readline (&lb, fi);
+ charno += readline (&lb, inf);
dbp = lb.buffer;
if (dbp[0] == '(')
{
else
{
/* Check for (foo::defmumble name-defined ... */
- while (*dbp && *dbp != ':' && !isspace (*dbp)
- && *dbp != '(' && *dbp != ')')
+ do
dbp++;
+ while (*dbp && !isspace (*dbp)
+ && *dbp != ':' && *dbp != '(' && *dbp != ')');
if (*dbp == ':')
{
- while (*dbp == ':')
+ do
dbp++;
+ while (*dbp == ':');
- if (L_isdef (dbp))
+ if (L_isdef (dbp - 1))
{
while (!isspace (*dbp))
dbp++;
}
}
}
-
-int
-L_isdef (dbp)
- char *dbp;
-{
- return ((dbp[1] == 'D' || dbp[1] == 'd') &&
- (dbp[2] == 'E' || dbp[2] == 'e') &&
- (dbp[3] == 'F' || dbp[3] == 'f'));
-}
-
-void
-L_getit ()
-{
- register char *cp;
- char c;
- char nambuf[BUFSIZ];
-
- if (*dbp == 0)
- return;
- for (cp = dbp + 1; *cp && *cp != '(' && *cp != ' '; cp++)
- continue;
- c = cp[0];
- cp[0] = 0;
- (void) strcpy (nambuf, dbp);
- cp[0] = c;
- pfnote (nambuf, TRUE, FALSE, lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
- pfcnt++;
-}
\f
/*
* Scheme tag functions
* look for (set! xyzzy
*/
-static void get_scheme ();
+void get_scheme ();
void
-Scheme_funcs (fi)
- FILE *fi;
+Scheme_functions (inf)
+ FILE *inf;
{
lineno = 0;
charno = 0;
- pfcnt = 0;
- while (!feof (fi))
+ while (!feof (inf))
{
lineno++;
linecharno = charno;
- charno += readline (&lb, fi);
+ charno += readline (&lb, inf);
dbp = lb.buffer;
if (dbp[0] == '(' &&
(dbp[1] == 'D' || dbp[1] == 'd') &&
}
}
-static void
+void
get_scheme ()
{
register char *cp;
- char c;
- char nambuf[BUFSIZ];
- if (*dbp == 0)
+ if (*dbp == '\0')
return;
/* Go till you get to white space or a syntactic break */
- for (cp = dbp + 1; *cp && *cp != '(' && *cp != ')' && !isspace (*cp); cp++)
+ for (cp = dbp + 1;
+ *cp && *cp != '(' && *cp != ')' && !isspace (*cp);
+ cp++)
continue;
- /* Null terminate the string there. */
- c = cp[0];
- cp[0] = 0;
- /* Copy the string */
- strcpy (nambuf, dbp);
- /* Unterminate the string */
- cp[0] = c;
- /* Announce the change */
- pfnote (nambuf, TRUE, FALSE, lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
- pfcnt++;
+ pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
+ lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
\f
/* Find tags in TeX and LaTeX input files. */
/* TEX_toktab is a table of TeX control sequences that define tags.
Each TEX_tabent records one such control sequence.
CONVERT THIS TO USE THE Stab TYPE!! */
-
struct TEX_tabent
{
char *name;
/* Default set of control sequences to put into TEX_toktab.
The value of environment var TEXTAGS is prepended to this. */
-static char *TEX_defenv =
-":chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem:typeout";
+char *TEX_defenv = "\
+:chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem\
+:part:appendix:entry:index";
void TEX_mode ();
struct TEX_tabent *TEX_decode_env ();
-void TEX_getit ();
int TEX_Token ();
+#if TeX_named_tokens
+void TEX_getit ();
+#endif
-static char TEX_esc = '\\';
-static char TEX_opgrp = '{';
-static char TEX_clgrp = '}';
+char TEX_esc = '\\';
+char TEX_opgrp = '{';
+char TEX_clgrp = '}';
/*
* TeX/LaTeX scanning loop.
*/
-
void
-TEX_funcs (fi)
- FILE *fi;
+TeX_functions (inf)
+ FILE *inf;
{
char *lasthit;
lineno = 0;
charno = 0;
- pfcnt = 0;
/* Select either \ or ! as escape character. */
- TEX_mode (fi);
+ TEX_mode (inf);
/* Initialize token table once from environment. */
if (!TEX_toktab)
TEX_toktab = TEX_decode_env ("TEXTAGS", TEX_defenv);
- while (!feof (fi))
- {
+ while (!feof (inf))
+ { /* Scan each line in file */
lineno++;
linecharno = charno;
- charno += readline (&lb, fi);
+ charno += readline (&lb, inf);
dbp = lb.buffer;
lasthit = dbp;
+ while (dbp = etags_strchr (dbp, TEX_esc)) /* Look at each esc in line */
+ {
+ register int i;
- while (!feof (fi))
- { /* Scan each line in file */
- lineno++;
- linecharno = charno;
- charno += readline (&lb, fi);
- dbp = lb.buffer;
+ if (!*(++dbp))
+ break;
+ linecharno += dbp - lasthit;
lasthit = dbp;
- while (dbp = index (dbp, TEX_esc)) /* Look at each escape in line */
+ i = TEX_Token (lasthit);
+ if (0 <= i)
{
- register int i;
-
- if (!*(++dbp))
- break;
- linecharno += dbp - lasthit;
- lasthit = dbp;
- i = TEX_Token (lasthit);
- if (0 <= i)
- {
- TEX_getit (lasthit, TEX_toktab[i].len);
- break; /* We only save a line once */
- }
+ pfnote (NULL, TRUE,
+ lb.buffer, strlen (lb.buffer), lineno, linecharno);
+#if TeX_named_tokens
+ TEX_getit (lasthit, TEX_toktab[i].len);
+#endif
+ break; /* We only save a line once */
}
}
}
#define TEX_SESC '!'
#define TEX_cmt '%'
-/* Figure out whether TeX's escapechar is '\\' or '!' and set grouping */
-/* chars accordingly. */
-
+/* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
+ chars accordingly. */
void
-TEX_mode (f)
- FILE *f;
+TEX_mode (inf)
+ FILE *inf;
{
int c;
- while ((c = getc (f)) != EOF)
+ while ((c = getc (inf)) != EOF)
{
/* Skip to next line if we hit the TeX comment char. */
if (c == TEX_cmt)
while (c != '\n')
- c = getc (f);
+ c = getc (inf);
else if (c == TEX_LESC || c == TEX_SESC )
break;
}
TEX_opgrp = '<';
TEX_clgrp = '>';
}
- rewind (f);
+ rewind (inf);
}
-/* Read environment and prepend it to the default string. */
-/* Build token table. */
-
+/* Read environment and prepend it to the default string.
+ Build token table. */
struct TEX_tabent *
TEX_decode_env (evarname, defenv)
char *evarname;
char *defenv;
{
register char *env, *p;
- extern char *savenstr (), *index ();
struct TEX_tabent *tab;
int size, i;
/* Allocate a token table */
for (size = 1, p = env; p;)
- if ((p = index (p, ':')) && *(++p))
+ if ((p = etags_strchr (p, ':')) && *(++p))
size++;
- tab = xnew (size, struct TEX_tabent);
+ /* Add 1 to leave room for null terminator. */
+ tab = xnew (size + 1, struct TEX_tabent);
/* Unpack environment string into token table. Be careful about */
/* zero-length strings (leading ':', "::" and trailing ':') */
for (i = 0; *env;)
{
- p = index (env, ':');
+ p = etags_strchr (env, ':');
if (!p) /* End of environment string. */
p = env + strlen (env);
if (p - env > 0)
break;
}
}
- return tab;
+ return tab;
+}
+
+#if TeX_named_tokens
+/* Record a tag defined by a TeX command of length LEN and starting at NAME.
+ The name being defined actually starts at (NAME + LEN + 1).
+ But we seem to include the TeX command in the tag name. */
+void
+TEX_getit (name, len)
+ char *name;
+ int len;
+{
+ char *p = name + len;
+
+ if (*name == '\0')
+ return;
+
+ /* Let tag name extend to next group close (or end of line) */
+ while (*p && *p != TEX_clgrp)
+ p++;
+ pfnote (savenstr (name, p-name), TRUE,
+ lb.buffer, strlen (lb.buffer), lineno, linecharno);
+}
+#endif
+
+/* If the text at CP matches one of the tag-defining TeX command names,
+ return the pointer to the first occurrence of that command in TEX_toktab.
+ Otherwise return -1.
+ Keep the capital `T' in `Token' for dumb truncating compilers
+ (this distinguishes it from `TEX_toktab' */
+int
+TEX_Token (cp)
+ char *cp;
+{
+ int i;
+
+ for (i = 0; TEX_toktab[i].len > 0; i++)
+ if (strneq (TEX_toktab[i].name, cp, TEX_toktab[i].len))
+ return i;
+ return -1;
+}
+\f
+/*
+ * Prolog support (rewritten) by Anders Lindgren, Mar. 96
+ *
+ * Assumes that the predicate starts at column 0.
+ * Only the first clause of a predicate is added.
+ */
+void
+Prolog_functions (inf)
+ FILE *inf;
+{
+ int prolog_pred ();
+ void prolog_skip_comment ();
+
+ char * last;
+ int len;
+ int allocated;
+
+ allocated = 0;
+ len = 0;
+ last = NULL;
+
+ lineno = 0;
+ linecharno = 0;
+ charno = 0;
+
+ while (!feof (inf))
+ {
+ lineno++;
+ linecharno += charno;
+ charno = readline (&lb, inf);
+ dbp = lb.buffer;
+ if (dbp[0] == '\0') /* Empty line */
+ continue;
+ else if (isspace (dbp[0])) /* Not a predicate */
+ continue;
+ else if (dbp[0] == '/' && dbp[1] == '*') /* comment. */
+ prolog_skip_comment (&lb, inf, &lineno, &linecharno);
+ else if (len = prolog_pred (dbp, last))
+ {
+ /* Predicate. Store the function name so that we only
+ * generates a tag for the first clause. */
+ if (last == NULL)
+ last = xnew(len + 1, char);
+ else if (len + 1 > allocated)
+ last = (char *) xrealloc(last, len + 1);
+ allocated = len + 1;
+ strncpy (last, dbp, len);
+ last[len] = '\0';
+ }
+ }
+}
+
+
+void
+prolog_skip_comment (plb, inf)
+ struct linebuffer *plb;
+ FILE *inf;
+{
+ char *cp;
+
+ do
+ {
+ for (cp = plb->buffer; *cp != '\0'; cp++)
+ if (cp[0] == '*' && cp[1] == '/')
+ return;
+ lineno++;
+ linecharno += readline (plb, inf);
+ }
+ while (!feof(inf));
+}
+
+/*
+ * A predicate definition is added if it matches:
+ * <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 0 if no header
+ * was found.
+ */
+int
+prolog_pred (s, last)
+ char *s;
+ char *last; /* Name of last clause. */
+{
+ int prolog_atom();
+ int prolog_white();
+
+ int pos;
+ int len;
+
+ pos = prolog_atom(s, 0);
+ if (pos < 1)
+ return 0;
+
+ len = pos;
+ pos += prolog_white(s, pos);
+
+ if ((s[pos] == '(') || (s[pos] == '.'))
+ {
+ if (s[pos] == '(')
+ pos++;
+
+ /* Save only the first clause. */
+ if ((last == NULL) ||
+ (len != strlen(last)) ||
+ (strncmp(s, last, len) != 0))
+ {
+ pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
+ s, pos, lineno, linecharno);
+ return len;
+ }
+ }
+ return 0;
+}
+
+/*
+ * Consume a Prolog atom.
+ * Return the number of bytes consumed, or -1 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.
+ */
+int
+prolog_atom (s, pos)
+ char *s;
+ int pos;
+{
+ int origpos;
+
+ origpos = pos;
+
+ if (islower(s[pos]) || (s[pos] == '_'))
+ {
+ /* The atom is unquoted. */
+ pos++;
+ while (isalnum(s[pos]) || (s[pos] == '_'))
+ {
+ pos++;
+ }
+ return pos - origpos;
+ }
+ else if (s[pos] == '\'')
+ {
+ pos++;
+
+ while (1)
+ {
+ if (s[pos] == '\'')
+ {
+ pos++;
+ if (s[pos] != '\'')
+ break;
+ pos++; /* A double quote */
+ }
+ else if (s[pos] == '\0')
+ /* Multiline quoted atoms are ignored. */
+ return -1;
+ else if (s[pos] == '\\')
+ {
+ if (s[pos+1] == '\0')
+ return -1;
+ pos += 2;
+ }
+ else
+ pos++;
+ }
+ return pos - origpos;
+ }
+ else
+ return -1;
+}
+
+/* Consume whitespace. Return the number of bytes eaten. */
+int
+prolog_white (s, pos)
+ char *s;
+ int pos;
+{
+ int origpos;
+
+ origpos = pos;
+
+ while (isspace(s[pos]))
+ pos++;
+
+ return pos - origpos;
+}
+\f
+/*
+ * Support for Erlang -- Anders Lindgren, Feb 1996.
+ *
+ * Generates tags for functions, defines, and records.
+ *
+ * Assumes that Erlang functions start at column 0.
+ */
+void
+Erlang_functions (inf)
+ FILE *inf;
+{
+ int erlang_func ();
+ void erlang_attribute ();
+
+ char * last;
+ int len;
+ int allocated;
+
+ allocated = 0;
+ len = 0;
+ last = NULL;
+
+ lineno = 0;
+ linecharno = 0;
+ charno = 0;
+
+ while (!feof (inf))
+ {
+ lineno++;
+ linecharno += charno;
+ charno = readline (&lb, inf);
+ dbp = lb.buffer;
+ if (dbp[0] == '\0') /* Empty line */
+ continue;
+ else if (isspace (dbp[0])) /* Not function nor attribute */
+ continue;
+ else if (dbp[0] == '%') /* comment */
+ continue;
+ else if (dbp[0] == '"') /* Sometimes, strings start in column one */
+ continue;
+ else if (dbp[0] == '-') /* attribute, e.g. "-define" */
+ {
+ erlang_attribute(dbp);
+ last = NULL;
+ }
+ else if (len = erlang_func (dbp, last))
+ {
+ /*
+ * Function. Store the function name so that we only
+ * generates a tag for the first clause.
+ */
+ if (last == NULL)
+ last = xnew(len + 1, char);
+ else if (len + 1 > allocated)
+ last = (char *) xrealloc(last, len + 1);
+ allocated = len + 1;
+ strncpy (last, dbp, len);
+ last[len] = '\0';
+ }
+ }
+}
+
+
+/*
+ * 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.
+ */
+int
+erlang_func (s, last)
+ char *s;
+ char *last; /* Name of last clause. */
+{
+ int erlang_atom ();
+ int erlang_white ();
+
+ int pos;
+ int len;
+
+ pos = erlang_atom(s, 0);
+ if (pos < 1)
+ return 0;
+
+ len = pos;
+ pos += erlang_white(s, pos);
+
+ if (s[pos++] == '(')
+ {
+ /* Save only the first clause. */
+ if ((last == NULL) ||
+ (len != strlen(last)) ||
+ (strncmp(s, last, len) != 0))
+ {
+ pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
+ s, pos, lineno, linecharno);
+ 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}).
+ */
+void
+erlang_attribute (s)
+ char *s;
+{
+ int erlang_atom ();
+ int erlang_white ();
+
+ int pos;
+ int len;
+
+ if ((strncmp(s, "-define", 7) == 0) ||
+ (strncmp(s, "-record", 7) == 0))
+ {
+ pos = 7;
+ pos += erlang_white(s, pos);
+
+ if (s[pos++] == '(')
+ {
+ pos += erlang_white(s, pos);
+
+ if (len = erlang_atom(s, pos))
+ {
+ pfnote ((CTAGS) ? savenstr (& s[pos], len) : NULL, TRUE,
+ s, pos + len, lineno, linecharno);
+ }
+ }
+ }
+ return;
}
-/* Record a tag defined by a TeX command of length LEN and starting at NAME.
- The name being defined actually starts at (NAME + LEN + 1).
- But we seem to include the TeX command in the tag name. */
-void
-TEX_getit (name, len)
- char *name;
- int len;
+/*
+ * Consume an Erlang atom (or variable).
+ * Return the number of bytes consumed, or -1 if there was an error.
+ */
+int
+erlang_atom (s, pos)
+ char *s;
+ int pos;
{
- char *p = name + len;
- char nambuf[BUFSIZ];
+ int origpos;
- if (*name == 0)
- return;
+ origpos = pos;
- /* Let tag name extend to next group close (or end of line) */
- while (*p && *p != TEX_clgrp)
- p++;
- (void) strncpy (nambuf, name, p - name);
- nambuf[p - name] = 0;
+ if (isalpha (s[pos]) || s[pos] == '_')
+ {
+ /* The atom is unquoted. */
+ pos++;
+ while (isalnum (s[pos]) || s[pos] == '_')
+ pos++;
+ return pos - origpos;
+ }
+ else if (s[pos] == '\'')
+ {
+ pos++;
- pfnote (nambuf, TRUE, FALSE, lb.buffer, strlen (lb.buffer), lineno, linecharno);
- pfcnt++;
+ while (1)
+ {
+ if (s[pos] == '\'')
+ {
+ pos++;
+ break;
+ }
+ else if (s[pos] == '\0')
+ /* Multiline quoted atoms are ignored. */
+ return -1;
+ else if (s[pos] == '\\')
+ {
+ if (s[pos+1] == '\0')
+ return -1;
+ pos += 2;
+ }
+ else
+ pos++;
+ }
+ return pos - origpos;
+ }
+ else
+ return -1;
}
-/* If the text at CP matches one of the tag-defining TeX command names,
- return the index of that command in TEX_toktab.
- Otherwise return -1. */
-
-/* Keep the capital `T' in `Token' for dumb truncating compilers
- (this distinguishes it from `TEX_toktab' */
+/* Consume whitespace. Return the number of bytes eaten */
int
-TEX_Token (cp)
- char *cp;
+erlang_white (s, pos)
+ char *s;
+ int pos;
{
- int i;
+ int origpos;
- for (i = 0; TEX_toktab[i].len > 0; i++)
- if (strncmp (TEX_toktab[i].name, cp, TEX_toktab[i].len) == 0)
- return i;
- return -1;
-}
-\f
-/* Support for Prolog. */
+ origpos = pos;
-/* whole head (not only functor, but also arguments)
- is gotten in compound term. */
+ while (isspace (s[pos]))
+ pos++;
-void
-prolog_getit (s, lineno, linecharno)
- char *s;
- int lineno;
- long linecharno;
+ return pos - origpos;
+}
+\f
+#ifdef ETAGS_REGEXPS
+/* Take a string like "/blah/" and turn it into "blah", making sure
+ that the first and last characters are the same, and handling
+ quoted separator characters. Actually, stops on the occurrence of
+ an unquoted separator. Also turns "\t" into a Tab character.
+ Returns pointer to terminating separator. Works in place. Null
+ terminates name string. */
+char *
+scan_separators (name)
+ char *name;
{
- char nambuf[BUFSIZ], *save_s, tmpc;
- int insquote, npar;
+ char sep = name[0];
+ char *copyto = name;
+ logical quoted = FALSE;
- save_s = s;
- insquote = FALSE;
- npar = 0;
- while (1)
+ for (++name; *name != '\0'; ++name)
{
- if (*s == '\0') /* syntax error. */
- return;
- else if (insquote && *s == '\'' && *(s + 1) == '\'')
- s += 2;
- else if (*s == '\'')
- {
- insquote = !insquote;
- s++;
- }
- else if (!insquote && *s == '(')
- {
- npar++;
- s++;
- }
- else if (!insquote && *s == ')')
+ if (quoted)
{
- npar--;
- s++;
- if (npar == 0)
- break;
- else if (npar < 0) /* syntax error. */
- return;
- }
- else if (!insquote && *s == '.' && (isspace (*(s + 1)) || *(s + 1) == '\0'))
- { /* fullstop. */
- if (npar != 0) /* syntax error. */
- return;
- s++;
- break;
+ if (*name == 't')
+ *copyto++ = '\t';
+ else if (*name == sep)
+ *copyto++ = sep;
+ else
+ {
+ /* Something else is quoted, so preserve the quote. */
+ *copyto++ = '\\';
+ *copyto++ = *name;
+ }
+ quoted = FALSE;
}
+ else if (*name == '\\')
+ quoted = TRUE;
+ else if (*name == sep)
+ break;
else
- s++;
+ *copyto++ = *name;
}
- tmpc = *s;
- *s = '\0';
- strcpy (nambuf, save_s);
- *s = tmpc;
- pfnote (nambuf, TRUE, save_s, strlen (nambuf), lineno, linecharno);
-}
-/* It is assumed that prolog predicate starts from column 0. */
+ /* Terminate copied string. */
+ *copyto = '\0';
+ return name;
+}
+/* Turn a name, which is an ed-style (but Emacs syntax) regular
+ expression, into a real regular expression by compiling it. */
void
-prolog_funcs (fi)
- FILE *fi;
+add_regex (regexp_pattern)
+ char *regexp_pattern;
{
- void skip_comment (), prolog_getit ();
+ char *name;
+ const char *err;
+ struct re_pattern_buffer *patbuf;
- lineno = linecharno = charno = 0;
- while (!feof (fi))
+ if (regexp_pattern == NULL)
{
- lineno++;
- linecharno += charno;
- charno = readline (&lb, fi) + 1; /* 1 for newline. */
- dbp = lb.buffer;
- if (isspace (dbp[0])) /* not predicate header. */
- continue;
- else if (dbp[0] == '%') /* comment. */
- continue;
- else if (dbp[0] == '/' && dbp[1] == '*') /* comment. */
- skip_comment (&lb, fi, &lineno, &linecharno);
- else /* found. */
- prolog_getit (dbp, lineno, linecharno);
+ /* Remove existing regexps. */
+ num_patterns = 0;
+ patterns = NULL;
+ return;
}
-}
-void
-skip_comment (plb, fi, plineno, plinecharno)
- struct linebuffer *plb;
- FILE *fi;
- int *plineno; /* result */
- long *plinecharno; /* result */
-{
- while (!substr ("*/", plb->buffer))
+ if (regexp_pattern[0] == '\0')
{
- (*plineno)++;
- *plinecharno += readline (plb, fi) + 1;
- } /* 1 for newline. */
-}
+ error ("missing regexp", 0);
+ return;
+ }
+ if (regexp_pattern[strlen(regexp_pattern)-1] != regexp_pattern[0])
+ {
+ error ("%s: unterminated regexp", regexp_pattern);
+ return;
+ }
+ name = scan_separators (regexp_pattern);
+ if (regexp_pattern[0] == '\0')
+ {
+ error ("null regexp", 0);
+ return;
+ }
+ (void) scan_separators (name);
-/* Return TRUE if 'sub' exists somewhere in 's'. */
+ patbuf = xnew (1, struct re_pattern_buffer);
+ patbuf->translate = NULL;
+ patbuf->fastmap = NULL;
+ patbuf->buffer = NULL;
+ patbuf->allocated = 0;
-int
-substr (sub, s)
- char *sub;
- char *s;
-{
- while (*s && (s = index (s, *sub)))
- if (prestr (sub, s))
- return (TRUE);
- else
- s++;
- return (FALSE);
-}
+ err = re_compile_pattern (regexp_pattern, strlen (regexp_pattern), patbuf);
+ if (err != NULL)
+ {
+ error ("%s while compiling pattern", err);
+ return;
+ }
-/* Return TRUE if 'pre' is prefix of string 's'. */
+ num_patterns += 1;
+ if (num_patterns == 1)
+ patterns = xnew (1, struct pattern);
+ else
+ patterns = ((struct pattern *)
+ xrealloc (patterns,
+ (num_patterns * sizeof (struct pattern))));
+ patterns[num_patterns - 1].pattern = patbuf;
+ patterns[num_patterns - 1].name_pattern = savestr (name);
+ patterns[num_patterns - 1].error_signaled = FALSE;
+}
-int
-prestr (pre, s)
- char *pre;
- char *s;
+/*
+ * Do the substitutions indicated by the regular expression and
+ * arguments.
+ */
+char *
+substitute (in, out, regs)
+ char *in, *out;
+ struct re_registers *regs;
{
- if (*pre == '\0')
- return (TRUE);
- else if (*pre == *s)
- return (prestr (pre + 1, s + 1));
- else
- return (FALSE);
+ char *result = NULL, *t;
+ int size = 0;
+
+ /* Pass 1: figure out how much size to allocate. */
+ for (t = out; *t; ++t)
+ {
+ if (*t == '\\')
+ {
+ ++t;
+ if (!*t)
+ {
+ fprintf (stderr, "%s: pattern substitution ends prematurely\n",
+ progname);
+ return NULL;
+ }
+ if (isdigit (*t))
+ {
+ int dig = *t - '0';
+ size += regs->end[dig] - regs->start[dig];
+ }
+ }
+ }
+
+ /* Allocate space and do the substitutions. */
+ result = xnew (size + 1, char);
+ size = 0;
+ for (; *out; ++out)
+ {
+ if (*out == '\\')
+ {
+ ++out;
+ if (isdigit (*out))
+ {
+ /* Using "dig2" satisfies my debugger. Bleah. */
+ int dig2 = *out - '0';
+ strncpy (result + size, in + regs->start[dig2],
+ regs->end[dig2] - regs->start[dig2]);
+ size += regs->end[dig2] - regs->start[dig2];
+ }
+ else
+ result[size++] = *out;
+ }
+ else
+ result[size++] = *out;
+ }
+ result[size] = '\0';
+
+ return result;
}
\f
+#endif /* ETAGS_REGEXPS */
/* Initialize a linebuffer for use */
-
void
initbuffer (linebuffer)
struct linebuffer *linebuffer;
* which is the length of the line including the newline, if any.
*/
long
-readline (linebuffer, stream)
+readline_internal (linebuffer, stream)
struct linebuffer *linebuffer;
register FILE *stream;
{
char *buffer = linebuffer->buffer;
register char *p = linebuffer->buffer;
register char *pend;
- int newline; /* 1 if ended with newline, 0 if ended with EOF */
+ int chars_deleted;
- pend = p + linebuffer->size; /* Separate to avoind 386/IX compiler bug. */
+ pend = p + linebuffer->size; /* Separate to avoid 386/IX compiler bug. */
while (1)
{
pend = buffer + linebuffer->size;
linebuffer->buffer = buffer;
}
- if (c < 0 || c == '\n')
+ if (c == EOF)
+ {
+ *p = '\0';
+ chars_deleted = 0;
+ break;
+ }
+ if (c == '\n')
{
- *p = 0;
- newline = (c == '\n' ? 1 : 0);
+ if (p > buffer && p[-1] == '\r')
+ {
+ *--p = '\0';
+#ifdef DOS_NT
+ /* Assume CRLF->LF translation will be performed by Emacs
+ when loading this file, so CRs won't appear in the buffer.
+ It would be cleaner to compensate within Emacs;
+ however, Emacs does not know how many CRs were deleted
+ before any given point in the file. */
+ chars_deleted = 1;
+#else
+ chars_deleted = 2;
+#endif
+ }
+ else
+ {
+ *p = '\0';
+ chars_deleted = 1;
+ }
break;
}
*p++ = c;
}
- return p - buffer + newline;
+ return p - buffer + chars_deleted;
+}
+
+/*
+ * Like readline_internal, above, but try to match the input
+ * line against any existing regular expressions.
+ */
+long
+readline (linebuffer, stream)
+ struct linebuffer *linebuffer;
+ FILE *stream;
+{
+ /* Read new line. */
+ long result = readline_internal (linebuffer, stream);
+#ifdef ETAGS_REGEXPS
+ int i;
+
+ /* Match against all listed patterns. */
+ for (i = 0; i < num_patterns; ++i)
+ {
+ int match = re_match (patterns[i].pattern, linebuffer->buffer,
+ (int)result, 0, &patterns[i].regs);
+ switch (match)
+ {
+ case -2:
+ /* Some error. */
+ if (!patterns[i].error_signaled)
+ {
+ error ("error while matching pattern %d", i);
+ patterns[i].error_signaled = TRUE;
+ }
+ break;
+ case -1:
+ /* No match. */
+ break;
+ default:
+ /* Match occurred. Construct a tag. */
+ if (patterns[i].name_pattern[0] != '\0')
+ {
+ /* Make a named tag. */
+ char *name = substitute (linebuffer->buffer,
+ patterns[i].name_pattern,
+ &patterns[i].regs);
+ if (name != NULL)
+ pfnote (name, TRUE,
+ linebuffer->buffer, match, lineno, linecharno);
+ }
+ else
+ {
+ /* Make an unnamed tag. */
+ pfnote (NULL, TRUE,
+ linebuffer->buffer, match, lineno, linecharno);
+ }
+ break;
+ }
+ }
+#endif /* ETAGS_REGEXPS */
+
+ return result;
+}
+
+/*
+ * Read a file, but do no processing. This is used to do regexp
+ * matching on files that have no language defined.
+ */
+void
+just_read_file (inf)
+ FILE *inf;
+{
+ lineno = 0;
+ charno = 0;
+
+ while (!feof (inf))
+ {
+ ++lineno;
+ linecharno = charno;
+ charno += readline (&lb, inf) + 1;
+ }
}
+
\f
+/*
+ * Return a pointer to a space of size strlen(cp)+1 allocated
+ * with xnew where the string CP has been copied.
+ */
char *
savestr (cp)
char *cp;
return savenstr (cp, strlen (cp));
}
+/*
+ * Return a pointer to a space of size LEN+1 allocated with xnew where
+ * the string CP has been copied for at most the first LEN characters.
+ */
char *
savenstr (cp, len)
char *cp;
register char *dp;
dp = xnew (len + 1, char);
- (void) strncpy (dp, cp, len);
+ strncpy (dp, cp, len);
dp[len] = '\0';
return dp;
}
-#ifdef NEED_RINDEX
/*
* Return the ptr in sp at which the character c last
* appears; NULL if not found
*
- * Identical to v7 rindex, included for portability.
+ * Identical to System V strrchr, included for portability.
*/
-
char *
-rindex (sp, c)
+etags_strrchr (sp, c)
register char *sp, c;
{
register char *r;
if (*sp == c)
r = sp;
} while (*sp++);
- return (r);
+ return r;
}
-#endif /* not NEED_RINDEX */
-#ifdef NEED_INDEX
/*
* Return the ptr in sp at which the character c first
* appears; NULL if not found
*
- * Identical to v7 index, included for portability.
+ * Identical to System V strchr, included for portability.
*/
-
char *
-index (sp, c)
+etags_strchr (sp, c)
register char *sp, c;
{
do
{
if (*sp == c)
- return (sp);
- } while (*sp++);
- return (NULL);
+ return sp;
+ } while (*sp++);
+ return NULL;
}
-#endif /* not NEED_INDEX */
-
/* Print error message and exit. */
-
-/* VARARGS1 */
void
fatal (s1, s2)
char *s1, *s2;
{
error (s1, s2);
- exit (1);
+ exit (BAD);
}
-/* Print error message. `s1' is printf control string, `s2' is arg for it. */
+void
+pfatal (s1)
+ char *s1;
+{
+ perror (s1);
+ exit (BAD);
+}
+
+void
+suggest_asking_for_help ()
+{
+ fprintf (stderr, "\tTry `%s --help' for a complete list of options.\n",
+ progname);
+ exit (BAD);
+}
-/* VARARGS1 */
+/* Print error message. `s1' is printf control string, `s2' is arg for it. */
void
error (s1, s2)
char *s1, *s2;
fprintf (stderr, "\n");
}
-/* Return a newly-allocated string whose contents concatenate those of s1, s2, s3. */
-
+/* Return a newly-allocated string whose contents
+ concatenate those of s1, s2, s3. */
char *
concat (s1, s2, s3)
char *s1, *s2, *s3;
int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3);
char *result = xnew (len1 + len2 + len3 + 1, char);
- (void) strcpy (result, s1);
- (void) strcpy (result + len1, s2);
- (void) strcpy (result + len1 + len2, s3);
- *(result + len1 + len2 + len3) = 0;
+ strcpy (result, s1);
+ strcpy (result + len1, s2);
+ strcpy (result + len1 + len2, s3);
+ result[len1 + len2 + len3] = '\0';
return result;
}
+\f
+/* Does the same work as the system V getcwd, but does not need to
+ guess the buffer size in advance. */
+char *
+etags_getcwd ()
+{
+#ifdef MSDOS
+ char *p, path[MAXPATHLEN + 1]; /* Fixed size is safe on MSDOS. */
-/* Like malloc but get fatal error if memory is exhausted. */
+ getwd (path);
+ for (p = path; *p != '\0'; p++)
+ if (*p == '\\')
+ *p = '/';
+ else
+ *p = lowcase (*p);
+
+ return strdup (path);
+#else /* not MSDOS */
+#if HAVE_GETCWD
+ int bufsize = 200;
+ char *path = xnew (bufsize, char);
+
+ while (getcwd (path, bufsize) == NULL)
+ {
+ if (errno != ERANGE)
+ pfatal ("getcwd");
+ bufsize *= 2;
+ path = xnew (bufsize, char);
+ }
+
+ return path;
+#else /* not MSDOS and not HAVE_GETCWD */
+ struct linebuffer path;
+ FILE *pipe;
+
+ initbuffer (&path);
+ pipe = (FILE *) popen ("pwd 2>/dev/null", "r");
+ if (pipe == NULL || readline_internal (&path, pipe) == 0)
+ pfatal ("pwd");
+ pclose (pipe);
+
+ return path.buffer;
+#endif /* not HAVE_GETCWD */
+#endif /* not MSDOS */
+}
+
+/* Return a newly allocated string containing the filename
+ of FILE relative to the absolute directory DIR (which
+ should end with a slash). */
+char *
+relative_filename (file, dir)
+ char *file, *dir;
+{
+ char *fp, *dp, *abs, *res;
+
+ /* Find the common root of file and dir. */
+ abs = absolute_filename (file, cwd);
+ fp = abs;
+ dp = dir;
+ while (*fp++ == *dp++)
+ continue;
+ do
+ {
+ fp--;
+ dp--;
+ }
+ while (*fp != '/');
+
+ /* Build a sequence of "../" strings for the resulting relative filename. */
+ for (dp = etags_strchr (dp + 1, '/'), res = "";
+ dp != NULL;
+ dp = etags_strchr (dp + 1, '/'))
+ {
+ res = concat (res, "../", "");
+ }
+
+ /* Add the filename relative to the common root of file and dir. */
+ res = concat (res, fp + 1, "");
+ free (abs);
+
+ return res;
+}
+
+/* Return a newly allocated string containing the
+ absolute filename of FILE given CWD (which should
+ end with a slash). */
+char *
+absolute_filename (file, cwd)
+ char *file, *cwd;
+{
+ char *slashp, *cp, *res;
+
+ if (absolutefn (file))
+ res = concat (file, "", "");
+#ifdef DOS_NT
+ /* We don't support non-absolute filenames with a drive
+ letter, like `d:NAME' (it's too much hassle). */
+ else if (file[1] == ':')
+ fatal ("%s: relative filenames with drive letters not supported", file);
+#endif
+ else
+ res = concat (cwd, file, "");
+
+ /* Delete the "/dirname/.." and "/." substrings. */
+ slashp = etags_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 && !absolutefn (cp));
+ if (*cp == '/')
+ {
+ strcpy (cp, slashp + 3);
+ }
+#ifdef DOS_NT
+ /* Under MSDOS and NT we get `d:/NAME' as absolute
+ filename, so the luser could say `d:/../NAME'.
+ We silently treat this as `d:/NAME'. */
+ else if (cp[1] == ':')
+ strcpy (cp + 3, slashp + 4);
+#endif
+ else /* else (cp == res) */
+ {
+ if (slashp[3] != '\0')
+ strcpy (cp, slashp + 4);
+ else
+ return ".";
+ }
+ slashp = cp;
+ continue;
+ }
+ else if (slashp[2] == '/' || slashp[2] == '\0')
+ {
+ strcpy (slashp, slashp + 2);
+ continue;
+ }
+ }
+
+ slashp = etags_strchr (slashp + 1, '/');
+ }
+ return res;
+}
+
+/* Return a newly allocated string containing the absolute
+ filename of dir where FILE resides given CWD (which should
+ end with a slash). */
char *
+absolute_dirname (file, cwd)
+ char *file, *cwd;
+{
+ char *slashp, *res;
+ char save;
+#ifdef DOS_NT
+ char *p;
+
+ for (p = file; *p != '\0'; p++)
+ if (*p == '\\')
+ *p = '/';
+#endif
+
+ slashp = etags_strrchr (file, '/');
+ if (slashp == NULL)
+ return cwd;
+ save = slashp[1];
+ slashp[1] = '\0';
+ res = absolute_filename (file, cwd);
+ slashp[1] = save;
+
+ return res;
+}
+
+/* Like malloc but get fatal error if memory is exhausted. */
+long *
xmalloc (size)
- int size;
+ unsigned int size;
{
- char *result = malloc (size);
- if (!result)
+ long *result = (long *) malloc (size);
+ if (result == NULL)
fatal ("virtual memory exhausted", 0);
return result;
}
-char *
+long *
xrealloc (ptr, size)
char *ptr;
- int size;
+ unsigned int size;
{
- char *result = realloc (ptr, size);
- if (!result)
+ long *result = (long *) realloc (ptr, size);
+ if (result == NULL)
fatal ("virtual memory exhausted");
return result;
}