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