usr.bin/ctags/ctags.h

   1 /*
   2  * Copyright (c) 1987, 1993, 1994
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  *      @(#)ctags.h     8.3 (Berkeley) 4/2/94
  34  *
  35  * $FreeBSD: src/usr.bin/ctags/ctags.h,v 1.4.2.2 2002/07/30 00:55:07 tjr Exp $
  36  * $DragonFly: src/usr.bin/ctags/ctags.h,v 1.2 2003/06/17 04:29:25 dillon Exp $
  37  *
  38  */
  39
  40 #define bool    char
  41
  42 #define YES             1
  43 #define NO              0
  44 #define EOS             '\0'
  45
  46 #define ENDLINE         50              /* max length of pattern */
  47 #define MAXTOKEN        250             /* max size of single token */
  48
  49 #define SETLINE         {++lineno;lineftell = ftell(inf);}
  50 #define GETC(op,exp)    ((c = getc(inf)) op (int)exp)
  51
  52 /*
  53  * These character classification macros assume that the (EOF & 0xff) element
  54  * of the arrays is always 'NO', as the EOF return from getc() gets masked
  55  * to that value.  Masking with 0xff has no effect for normal characters
  56  * returned by getc() provided chars have 8 bits.
  57  */
  58
  59 #define iswhite(arg)    _wht[arg & 0xff]        /* T if char is white */
  60 #define begtoken(arg)   _btk[arg & 0xff]        /* T if char can start token */
  61 #define intoken(arg)    _itk[arg & 0xff]        /* T if char can be in token */
  62 #define endtoken(arg)   _etk[arg & 0xff]        /* T if char ends tokens */
  63 #define isgood(arg)     _gd[arg & 0xff] /* T if char can be after ')' */
  64
  65 typedef struct nd_st {                  /* sorting structure */
  66         struct nd_st    *left,
  67                         *right;         /* left and right sons */
  68         char    *entry,                 /* function or type name */
  69                 *file,                  /* file name */
  70                 *pat;                   /* search pattern */
  71         int     lno;                    /* for -x option */
  72         bool    been_warned;            /* set if noticed dup */
  73 } NODE;
  74
  75 extern char     *curfile;               /* current input file name */
  76 extern NODE     *head;                  /* head of the sorted binary tree */
  77 extern FILE    *inf;                    /* ioptr for current input file */
  78 extern FILE    *outf;                   /* ioptr for current output file */
  79 extern long     lineftell;              /* ftell after getc( inf ) == '\n' */
  80 extern int      lineno;                 /* line number of current line */
  81 extern int      dflag;                  /* -d: non-macro defines */
  82 extern int      tflag;                  /* -t: create tags for typedefs */
  83 extern int      vflag;                  /* -v: vgrind style index output */
  84 extern int      wflag;                  /* -w: suppress warnings */
  85 extern int      xflag;                  /* -x: cxref style output */
  86 extern bool     _wht[], _etk[], _itk[], _btk[], _gd[];
  87 extern char     lbuf[LINE_MAX];
  88 extern char    *lbp;
  89 extern char     searchar;               /* ex search character */
  90
  91 extern int      cicmp(const char *);
  92 extern void     getline(void);
  93 extern void     pfnote(const char *, int);
  94 extern int      skip_key(int);
  95 extern void     put_entries(NODE *);
  96 extern void     toss_yysec(void);
  97 extern void     l_entries(void);
  98 extern void     y_entries(void);
  99 extern int      PF_funcs(void);
 100 extern void     c_entries(void);
 101 extern void     skip_comment(int);