Add stdint.h for MS-Windows.
[emacs.git] / lib-src / ebrowse.c
blob59a1dde76347a3b625d431b6c2ffd7dc932cc30b
1 /* ebrowse.c --- parsing files for the ebrowse C++ browser
3 Copyright (C) 1992-2011 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
21 #include <config.h>
22 #include <stdio.h>
24 #ifdef HAVE_STDLIB_H
25 #include <stdlib.h>
26 #endif
28 #include <string.h>
29 #include <ctype.h>
30 #include <assert.h>
31 #include <getopt.h>
33 /* The SunOS compiler doesn't have SEEK_END. */
34 #ifndef SEEK_END
35 #define SEEK_END 2
36 #endif
38 /* Conditionalize function prototypes. */
40 /* Value is non-zero if strings X and Y compare equal. */
42 #define streq(X, Y) (*(X) == *(Y) && strcmp ((X) + 1, (Y) + 1) == 0)
44 /* The ubiquitous `max' and `min' macros. */
46 #ifndef max
47 #define max(X, Y) ((X) > (Y) ? (X) : (Y))
48 #define min(X, Y) ((X) < (Y) ? (X) : (Y))
49 #endif
51 /* Files are read in chunks of this number of bytes. */
53 #define READ_CHUNK_SIZE (100 * 1024)
55 /* The character used as a separator in path lists (like $PATH). */
57 #if defined(__MSDOS__)
58 #define PATH_LIST_SEPARATOR ';'
59 #define FILENAME_EQ(X,Y) (strcasecmp(X,Y) == 0)
60 #else
61 #if defined(WINDOWSNT)
62 #define PATH_LIST_SEPARATOR ';'
63 #define FILENAME_EQ(X,Y) (stricmp(X,Y) == 0)
64 #else
65 #define PATH_LIST_SEPARATOR ':'
66 #define FILENAME_EQ(X,Y) (streq(X,Y))
67 #endif
68 #endif
69 /* The default output file name. */
71 #define DEFAULT_OUTFILE "BROWSE"
73 /* A version string written to the output file. Change this whenever
74 the structure of the output file changes. */
76 #define EBROWSE_FILE_VERSION "ebrowse 5.0"
78 /* The output file consists of a tree of Lisp objects, with major
79 nodes built out of Lisp structures. These are the heads of the
80 Lisp structs with symbols identifying their type. */
82 #define TREE_HEADER_STRUCT "[ebrowse-hs "
83 #define TREE_STRUCT "[ebrowse-ts "
84 #define MEMBER_STRUCT "[ebrowse-ms "
85 #define BROWSE_STRUCT "[ebrowse-bs "
86 #define CLASS_STRUCT "[ebrowse-cs "
88 /* The name of the symbol table entry for global functions, variables,
89 defines etc. This name also appears in the browser display. */
91 #define GLOBALS_NAME "*Globals*"
93 /* Token definitions. */
95 enum token
97 YYEOF = 0, /* end of file */
98 CSTRING = 256, /* string constant */
99 CCHAR, /* character constant */
100 CINT, /* integral constant */
101 CFLOAT, /* real constant */
103 ELLIPSIS, /* ... */
104 LSHIFTASGN, /* <<= */
105 RSHIFTASGN, /* >>= */
106 ARROWSTAR, /* ->* */
107 IDENT, /* identifier */
108 DIVASGN, /* /= */
109 INC, /* ++ */
110 ADDASGN, /* += */
111 DEC, /* -- */
112 ARROW, /* -> */
113 SUBASGN, /* -= */
114 MULASGN, /* *= */
115 MODASGN, /* %= */
116 LOR, /* || */
117 ORASGN, /* |= */
118 LAND, /* && */
119 ANDASGN, /* &= */
120 XORASGN, /* ^= */
121 POINTSTAR, /* .* */
122 DCOLON, /* :: */
123 EQ, /* == */
124 NE, /* != */
125 LE, /* <= */
126 LSHIFT, /* << */
127 GE, /* >= */
128 RSHIFT, /* >> */
130 /* Keywords. The undef's are there because these
131 three symbols are very likely to be defined somewhere. */
132 #undef BOOL
133 #undef TRUE
134 #undef FALSE
136 ASM, /* asm */
137 AUTO, /* auto */
138 BREAK, /* break */
139 CASE, /* case */
140 CATCH, /* catch */
141 CHAR, /* char */
142 CLASS, /* class */
143 CONST, /* const */
144 CONTINUE, /* continue */
145 DEFAULT, /* default */
146 DELETE, /* delete */
147 DO, /* do */
148 DOUBLE, /* double */
149 ELSE, /* else */
150 ENUM, /* enum */
151 EXTERN, /* extern */
152 FLOAT, /* float */
153 FOR, /* for */
154 FRIEND, /* friend */
155 GOTO, /* goto */
156 IF, /* if */
157 T_INLINE, /* inline */
158 INT, /* int */
159 LONG, /* long */
160 NEW, /* new */
161 OPERATOR, /* operator */
162 PRIVATE, /* private */
163 PROTECTED, /* protected */
164 PUBLIC, /* public */
165 REGISTER, /* register */
166 RETURN, /* return */
167 SHORT, /* short */
168 SIGNED, /* signed */
169 SIZEOF, /* sizeof */
170 STATIC, /* static */
171 STRUCT, /* struct */
172 SWITCH, /* switch */
173 TEMPLATE, /* template */
174 THIS, /* this */
175 THROW, /* throw */
176 TRY, /* try */
177 TYPEDEF, /* typedef */
178 UNION, /* union */
179 UNSIGNED, /* unsigned */
180 VIRTUAL, /* virtual */
181 VOID, /* void */
182 VOLATILE, /* volatile */
183 WHILE, /* while */
184 MUTABLE, /* mutable */
185 BOOL, /* bool */
186 TRUE, /* true */
187 FALSE, /* false */
188 SIGNATURE, /* signature (GNU extension) */
189 NAMESPACE, /* namespace */
190 EXPLICIT, /* explicit */
191 TYPENAME, /* typename */
192 CONST_CAST, /* const_cast */
193 DYNAMIC_CAST, /* dynamic_cast */
194 REINTERPRET_CAST, /* reinterpret_cast */
195 STATIC_CAST, /* static_cast */
196 TYPEID, /* typeid */
197 USING, /* using */
198 WCHAR /* wchar_t */
201 /* Storage classes, in a wider sense. */
203 enum sc
205 SC_UNKNOWN,
206 SC_MEMBER, /* Is an instance member. */
207 SC_STATIC, /* Is static member. */
208 SC_FRIEND, /* Is friend function. */
209 SC_TYPE /* Is a type definition. */
212 /* Member visibility. */
214 enum visibility
216 V_PUBLIC,
217 V_PROTECTED,
218 V_PRIVATE
221 /* Member flags. */
223 #define F_VIRTUAL 1 /* Is virtual function. */
224 #define F_INLINE 2 /* Is inline function. */
225 #define F_CONST 4 /* Is const. */
226 #define F_PURE 8 /* Is pure virtual function. */
227 #define F_MUTABLE 16 /* Is mutable. */
228 #define F_TEMPLATE 32 /* Is a template. */
229 #define F_EXPLICIT 64 /* Is explicit constructor. */
230 #define F_THROW 128 /* Has a throw specification. */
231 #define F_EXTERNC 256 /* Is declared extern "C". */
232 #define F_DEFINE 512 /* Is a #define. */
234 /* Two macros to set and test a bit in an int. */
236 #define SET_FLAG(F, FLAG) ((F) |= (FLAG))
237 #define HAS_FLAG(F, FLAG) (((F) & (FLAG)) != 0)
239 /* Structure describing a class member. */
241 struct member
243 struct member *next; /* Next in list of members. */
244 struct member *anext; /* Collision chain in member_table. */
245 struct member **list; /* Pointer to list in class. */
246 unsigned param_hash; /* Hash value for parameter types. */
247 int vis; /* Visibility (public, ...). */
248 int flags; /* See F_* above. */
249 char *regexp; /* Matching regular expression. */
250 const char *filename; /* Don't free this shared string. */
251 int pos; /* Buffer position of occurrence. */
252 char *def_regexp; /* Regular expression matching definition. */
253 const char *def_filename; /* File name of definition. */
254 int def_pos; /* Buffer position of definition. */
255 char name[1]; /* Member name. */
258 /* Structures of this type are used to connect class structures with
259 their super and subclasses. */
261 struct link
263 struct sym *sym; /* The super or subclass. */
264 struct link *next; /* Next in list or NULL. */
267 /* Structure used to record namespace aliases. */
269 struct alias
271 struct alias *next; /* Next in list. */
272 struct sym *namesp; /* Namespace in which defined. */
273 struct link *aliasee; /* List of aliased namespaces (A::B::C...). */
274 char name[1]; /* Alias name. */
277 /* The structure used to describe a class in the symbol table,
278 or a namespace in all_namespaces. */
280 struct sym
282 int flags; /* Is class a template class?. */
283 unsigned char visited; /* Used to find circles. */
284 struct sym *next; /* Hash collision list. */
285 struct link *subs; /* List of subclasses. */
286 struct link *supers; /* List of superclasses. */
287 struct member *vars; /* List of instance variables. */
288 struct member *fns; /* List of instance functions. */
289 struct member *static_vars; /* List of static variables. */
290 struct member *static_fns; /* List of static functions. */
291 struct member *friends; /* List of friend functions. */
292 struct member *types; /* List of local types. */
293 char *regexp; /* Matching regular expression. */
294 int pos; /* Buffer position. */
295 const char *filename; /* File in which it can be found. */
296 const char *sfilename; /* File in which members can be found. */
297 struct sym *namesp; /* Namespace in which defined. . */
298 char name[1]; /* Name of the class. */
301 /* Experimental: Print info for `--position-info'. We print
302 '(CLASS-NAME SCOPE MEMBER-NAME). */
304 #define P_DEFN 1
305 #define P_DECL 2
307 int info_where;
308 struct sym *info_cls = NULL;
309 struct member *info_member = NULL;
311 /* Experimental. For option `--position-info', the buffer position we
312 are interested in. When this position is reached, print out
313 information about what we know about that point. */
315 int info_position = -1;
317 /* Command line options structure for getopt_long. */
319 struct option options[] =
321 {"append", no_argument, NULL, 'a'},
322 {"files", required_argument, NULL, 'f'},
323 {"help", no_argument, NULL, -2},
324 {"min-regexp-length", required_argument, NULL, 'm'},
325 {"max-regexp-length", required_argument, NULL, 'M'},
326 {"no-nested-classes", no_argument, NULL, 'n'},
327 {"no-regexps", no_argument, NULL, 'x'},
328 {"no-structs-or-unions", no_argument, NULL, 's'},
329 {"output-file", required_argument, NULL, 'o'},
330 {"position-info", required_argument, NULL, 'p'},
331 {"search-path", required_argument, NULL, 'I'},
332 {"verbose", no_argument, NULL, 'v'},
333 {"version", no_argument, NULL, -3},
334 {"very-verbose", no_argument, NULL, 'V'},
335 {NULL, 0, NULL, 0}
338 /* Semantic values of tokens. Set by yylex.. */
340 unsigned yyival; /* Set for token CINT. */
341 char *yytext; /* Set for token IDENT. */
342 char *yytext_end;
344 /* Output file. */
346 FILE *yyout;
348 /* Current line number. */
350 int yyline;
352 /* The name of the current input file. */
354 const char *filename;
356 /* Three character class vectors, and macros to test membership
357 of characters. */
359 char is_ident[255];
360 char is_digit[255];
361 char is_white[255];
363 #define IDENTP(C) is_ident[(unsigned char) (C)]
364 #define DIGITP(C) is_digit[(unsigned char) (C)]
365 #define WHITEP(C) is_white[(unsigned char) (C)]
367 /* Command line flags. */
369 int f_append;
370 int f_verbose;
371 int f_very_verbose;
372 int f_structs = 1;
373 int f_regexps = 1;
374 int f_nested_classes = 1;
376 /* Maximum and minimum lengths of regular expressions matching a
377 member, class etc., for writing them to the output file. These are
378 overridable from the command line. */
380 int min_regexp = 5;
381 int max_regexp = 50;
383 /* Input buffer. */
385 char *inbuffer;
386 char *in;
387 int inbuffer_size;
389 /* Return the current buffer position in the input file. */
391 #define BUFFER_POS() (in - inbuffer)
393 /* If current lookahead is CSTRING, the following points to the
394 first character in the string constant. Used for recognizing
395 extern "C". */
397 char *string_start;
399 /* The size of the hash tables for classes.and members. Should be
400 prime. */
402 #define TABLE_SIZE 1001
404 /* The hash table for class symbols. */
406 struct sym *class_table[TABLE_SIZE];
408 /* Hash table containing all member structures. This is generally
409 faster for member lookup than traversing the member lists of a
410 `struct sym'. */
412 struct member *member_table[TABLE_SIZE];
414 /* Hash table for namespace aliases */
416 struct alias *namespace_alias_table[TABLE_SIZE];
418 /* The special class symbol used to hold global functions,
419 variables etc. */
421 struct sym *global_symbols;
423 /* The current namespace. */
425 struct sym *current_namespace;
427 /* The list of all known namespaces. */
429 struct sym *all_namespaces;
431 /* Stack of namespaces we're currently nested in, during the parse. */
433 struct sym **namespace_stack;
434 int namespace_stack_size;
435 int namespace_sp;
437 /* The current lookahead token. */
439 int tk = -1;
441 /* Structure describing a keyword. */
443 struct kw
445 const char *name; /* Spelling. */
446 int tk; /* Token value. */
447 struct kw *next; /* Next in collision chain. */
450 /* Keywords are lookup up in a hash table of their own. */
452 #define KEYWORD_TABLE_SIZE 1001
453 struct kw *keyword_table[KEYWORD_TABLE_SIZE];
455 /* Search path. */
457 struct search_path
459 char *path;
460 struct search_path *next;
463 struct search_path *search_path;
464 struct search_path *search_path_tail;
466 /* Function prototypes. */
468 int yylex (void);
469 void yyparse (void);
470 void re_init_parser (void);
471 const char *token_string (int);
472 char *matching_regexp (void);
473 void init_sym (void);
474 struct sym *add_sym (const char *, struct sym *);
475 void add_link (struct sym *, struct sym *);
476 void add_member_defn (struct sym *, char *, char *,
477 int, unsigned, int, int, int);
478 void add_member_decl (struct sym *, char *, char *, int,
479 unsigned, int, int, int, int);
480 void dump_roots (FILE *);
481 void *xmalloc (int);
482 void xfree (void *);
483 void add_global_defn (char *, char *, int, unsigned, int, int, int);
484 void add_global_decl (char *, char *, int, unsigned, int, int, int);
485 void add_define (char *, char *, int);
486 void mark_inherited_virtual (void);
487 void leave_namespace (void);
488 void enter_namespace (char *);
489 void register_namespace_alias (char *, struct link *);
490 void insert_keyword (const char *, int);
491 void re_init_scanner (void);
492 void init_scanner (void);
493 void process_file (char *);
494 void add_search_path (char *);
495 FILE *open_file (char *);
496 int process_pp_line (void);
497 int dump_members (FILE *, struct member *);
498 void dump_sym (FILE *, struct sym *);
499 int dump_tree (FILE *, struct sym *);
500 struct member *find_member (struct sym *, char *, int, int, unsigned);
501 struct member *add_member (struct sym *, char *, int, int, unsigned);
502 void mark_virtual (struct sym *);
503 struct sym *make_namespace (char *, struct sym *);
504 char *sym_scope (struct sym *);
505 char *sym_scope_1 (struct sym *);
506 int skip_to (int);
507 void skip_matching (void);
508 void member (struct sym *, int);
509 void class_body (struct sym *, int);
510 void class_definition (struct sym *, int, int, int);
511 void declaration (int);
512 unsigned parm_list (int *);
513 char *operator_name (int *);
514 struct sym *parse_classname (void);
515 struct sym *parse_qualified_ident_or_type (char **);
516 void parse_qualified_param_ident_or_type (char **);
517 int globals (int);
518 void yyerror (const char *, const char *);
519 void usage (int) NO_RETURN;
520 void version (void) NO_RETURN;
524 /***********************************************************************
525 Utilities
526 ***********************************************************************/
528 /* Print an error in a printf-like style with the current input file
529 name and line number. */
531 void
532 yyerror (const char *format, const char *s)
534 fprintf (stderr, "%s:%d: ", filename, yyline);
535 fprintf (stderr, format, s);
536 putc ('\n', stderr);
540 /* Like malloc but print an error and exit if not enough memory is
541 available. */
543 void *
544 xmalloc (int nbytes)
546 void *p = malloc (nbytes);
547 if (p == NULL)
549 yyerror ("out of memory", NULL);
550 exit (EXIT_FAILURE);
552 return p;
556 /* Like realloc but print an error and exit if out of memory. */
558 void *
559 xrealloc (void *p, int sz)
561 p = realloc (p, sz);
562 if (p == NULL)
564 yyerror ("out of memory", NULL);
565 exit (EXIT_FAILURE);
567 return p;
571 /* Like strdup, but print an error and exit if not enough memory is
572 available.. If S is null, return null. */
574 char *
575 xstrdup (char *s)
577 if (s)
578 s = strcpy (xmalloc (strlen (s) + 1), s);
579 return s;
584 /***********************************************************************
585 Symbols
586 ***********************************************************************/
588 /* Initialize the symbol table. This currently only sets up the
589 special symbol for globals (`*Globals*'). */
591 void
592 init_sym (void)
594 global_symbols = add_sym (GLOBALS_NAME, NULL);
598 /* Add a symbol for class NAME to the symbol table. NESTED_IN_CLASS
599 is the class in which class NAME was found. If it is null,
600 this means the scope of NAME is the current namespace.
602 If a symbol for NAME already exists, return that. Otherwise
603 create a new symbol and set it to default values. */
605 struct sym *
606 add_sym (const char *name, struct sym *nested_in_class)
608 struct sym *sym;
609 unsigned h;
610 const char *s;
611 struct sym *scope = nested_in_class ? nested_in_class : current_namespace;
613 for (s = name, h = 0; *s; ++s)
614 h = (h << 1) ^ *s;
615 h %= TABLE_SIZE;
617 for (sym = class_table[h]; sym; sym = sym->next)
618 if (streq (name, sym->name)
619 && ((!sym->namesp && !scope)
620 || (sym->namesp && scope
621 && streq (sym->namesp->name, scope->name))))
622 break;
624 if (sym == NULL)
626 if (f_very_verbose)
628 putchar ('\t');
629 puts (name);
632 sym = (struct sym *) xmalloc (sizeof *sym + strlen (name));
633 memset (sym, 0, sizeof *sym);
634 strcpy (sym->name, name);
635 sym->namesp = scope;
636 sym->next = class_table[h];
637 class_table[h] = sym;
640 return sym;
644 /* Add links between superclass SUPER and subclass SUB. */
646 void
647 add_link (struct sym *super, struct sym *sub)
649 struct link *lnk, *lnk2, *p, *prev;
651 /* See if a link already exists. */
652 for (p = super->subs, prev = NULL;
653 p && strcmp (sub->name, p->sym->name) > 0;
654 prev = p, p = p->next)
657 /* Avoid duplicates. */
658 if (p == NULL || p->sym != sub)
660 lnk = (struct link *) xmalloc (sizeof *lnk);
661 lnk2 = (struct link *) xmalloc (sizeof *lnk2);
663 lnk->sym = sub;
664 lnk->next = p;
666 if (prev)
667 prev->next = lnk;
668 else
669 super->subs = lnk;
671 lnk2->sym = super;
672 lnk2->next = sub->supers;
673 sub->supers = lnk2;
678 /* Find in class CLS member NAME.
680 VAR non-zero means look for a member variable; otherwise a function
681 is searched. SC specifies what kind of member is searched---a
682 static, or per-instance member etc. HASH is a hash code for the
683 parameter types of functions. Value is a pointer to the member
684 found or null if not found. */
686 struct member *
687 find_member (struct sym *cls, char *name, int var, int sc, unsigned int hash)
689 struct member **list;
690 struct member *p;
691 unsigned name_hash = 0;
692 char *s;
693 int i;
695 switch (sc)
697 case SC_FRIEND:
698 list = &cls->friends;
699 break;
701 case SC_TYPE:
702 list = &cls->types;
703 break;
705 case SC_STATIC:
706 list = var ? &cls->static_vars : &cls->static_fns;
707 break;
709 default:
710 list = var ? &cls->vars : &cls->fns;
711 break;
714 for (s = name; *s; ++s)
715 name_hash = (name_hash << 1) ^ *s;
716 i = name_hash % TABLE_SIZE;
718 for (p = member_table[i]; p; p = p->anext)
719 if (p->list == list && p->param_hash == hash && streq (name, p->name))
720 break;
722 return p;
726 /* Add to class CLS information for the declaration of member NAME.
727 REGEXP is a regexp matching the declaration, if non-null. POS is
728 the position in the source where the declaration is found. HASH is
729 a hash code for the parameter list of the member, if it's a
730 function. VAR non-zero means member is a variable or type. SC
731 specifies the type of member (instance member, static, ...). VIS
732 is the member's visibility (public, protected, private). FLAGS is
733 a bit set giving additional information about the member (see the
734 F_* defines). */
736 void
737 add_member_decl (struct sym *cls, char *name, char *regexp, int pos, unsigned int hash, int var, int sc, int vis, int flags)
739 struct member *m;
741 m = find_member (cls, name, var, sc, hash);
742 if (m == NULL)
743 m = add_member (cls, name, var, sc, hash);
745 /* Have we seen a new filename? If so record that. */
746 if (!cls->filename || !FILENAME_EQ (cls->filename, filename))
747 m->filename = filename;
749 m->regexp = regexp;
750 m->pos = pos;
751 m->flags = flags;
753 switch (vis)
755 case PRIVATE:
756 m->vis = V_PRIVATE;
757 break;
759 case PROTECTED:
760 m->vis = V_PROTECTED;
761 break;
763 case PUBLIC:
764 m->vis = V_PUBLIC;
765 break;
768 info_where = P_DECL;
769 info_cls = cls;
770 info_member = m;
774 /* Add to class CLS information for the definition of member NAME.
775 REGEXP is a regexp matching the declaration, if non-null. POS is
776 the position in the source where the declaration is found. HASH is
777 a hash code for the parameter list of the member, if it's a
778 function. VAR non-zero means member is a variable or type. SC
779 specifies the type of member (instance member, static, ...). VIS
780 is the member's visibility (public, protected, private). FLAGS is
781 a bit set giving additional information about the member (see the
782 F_* defines). */
784 void
785 add_member_defn (struct sym *cls, char *name, char *regexp, int pos, unsigned int hash, int var, int sc, int flags)
787 struct member *m;
789 if (sc == SC_UNKNOWN)
791 m = find_member (cls, name, var, SC_MEMBER, hash);
792 if (m == NULL)
794 m = find_member (cls, name, var, SC_STATIC, hash);
795 if (m == NULL)
796 m = add_member (cls, name, var, sc, hash);
799 else
801 m = find_member (cls, name, var, sc, hash);
802 if (m == NULL)
803 m = add_member (cls, name, var, sc, hash);
806 if (!cls->sfilename)
807 cls->sfilename = filename;
809 if (!FILENAME_EQ (cls->sfilename, filename))
810 m->def_filename = filename;
812 m->def_regexp = regexp;
813 m->def_pos = pos;
814 m->flags |= flags;
816 info_where = P_DEFN;
817 info_cls = cls;
818 info_member = m;
822 /* Add a symbol for a define named NAME to the symbol table.
823 REGEXP is a regular expression matching the define in the source,
824 if it is non-null. POS is the position in the file. */
826 void
827 add_define (char *name, char *regexp, int pos)
829 add_global_defn (name, regexp, pos, 0, 1, SC_FRIEND, F_DEFINE);
830 add_global_decl (name, regexp, pos, 0, 1, SC_FRIEND, F_DEFINE);
834 /* Add information for the global definition of NAME.
835 REGEXP is a regexp matching the declaration, if non-null. POS is
836 the position in the source where the declaration is found. HASH is
837 a hash code for the parameter list of the member, if it's a
838 function. VAR non-zero means member is a variable or type. SC
839 specifies the type of member (instance member, static, ...). VIS
840 is the member's visibility (public, protected, private). FLAGS is
841 a bit set giving additional information about the member (see the
842 F_* defines). */
844 void
845 add_global_defn (char *name, char *regexp, int pos, unsigned int hash, int var, int sc, int flags)
847 int i;
848 struct sym *sym;
850 /* Try to find out for which classes a function is a friend, and add
851 what we know about it to them. */
852 if (!var)
853 for (i = 0; i < TABLE_SIZE; ++i)
854 for (sym = class_table[i]; sym; sym = sym->next)
855 if (sym != global_symbols && sym->friends)
856 if (find_member (sym, name, 0, SC_FRIEND, hash))
857 add_member_defn (sym, name, regexp, pos, hash, 0,
858 SC_FRIEND, flags);
860 /* Add to global symbols. */
861 add_member_defn (global_symbols, name, regexp, pos, hash, var, sc, flags);
865 /* Add information for the global declaration of NAME.
866 REGEXP is a regexp matching the declaration, if non-null. POS is
867 the position in the source where the declaration is found. HASH is
868 a hash code for the parameter list of the member, if it's a
869 function. VAR non-zero means member is a variable or type. SC
870 specifies the type of member (instance member, static, ...). VIS
871 is the member's visibility (public, protected, private). FLAGS is
872 a bit set giving additional information about the member (see the
873 F_* defines). */
875 void
876 add_global_decl (char *name, char *regexp, int pos, unsigned int hash, int var, int sc, int flags)
878 /* Add declaration only if not already declared. Header files must
879 be processed before source files for this to have the right effect.
880 I do not want to handle implicit declarations at the moment. */
881 struct member *m;
882 struct member *found;
884 m = found = find_member (global_symbols, name, var, sc, hash);
885 if (m == NULL)
886 m = add_member (global_symbols, name, var, sc, hash);
888 /* Definition already seen => probably last declaration implicit.
889 Override. This means that declarations must always be added to
890 the symbol table before definitions. */
891 if (!found)
893 if (!global_symbols->filename
894 || !FILENAME_EQ (global_symbols->filename, filename))
895 m->filename = filename;
897 m->regexp = regexp;
898 m->pos = pos;
899 m->vis = V_PUBLIC;
900 m->flags = flags;
902 info_where = P_DECL;
903 info_cls = global_symbols;
904 info_member = m;
909 /* Add a symbol for member NAME to class CLS.
910 VAR non-zero means it's a variable. SC specifies the kind of
911 member. HASH is a hash code for the parameter types of a function.
912 Value is a pointer to the member's structure. */
914 struct member *
915 add_member (struct sym *cls, char *name, int var, int sc, unsigned int hash)
917 struct member *m = (struct member *) xmalloc (sizeof *m + strlen (name));
918 struct member **list;
919 struct member *p;
920 struct member *prev;
921 unsigned name_hash = 0;
922 int i;
923 char *s;
925 strcpy (m->name, name);
926 m->param_hash = hash;
928 m->vis = 0;
929 m->flags = 0;
930 m->regexp = NULL;
931 m->filename = NULL;
932 m->pos = 0;
933 m->def_regexp = NULL;
934 m->def_filename = NULL;
935 m->def_pos = 0;
937 assert (cls != NULL);
939 switch (sc)
941 case SC_FRIEND:
942 list = &cls->friends;
943 break;
945 case SC_TYPE:
946 list = &cls->types;
947 break;
949 case SC_STATIC:
950 list = var ? &cls->static_vars : &cls->static_fns;
951 break;
953 default:
954 list = var ? &cls->vars : &cls->fns;
955 break;
958 for (s = name; *s; ++s)
959 name_hash = (name_hash << 1) ^ *s;
960 i = name_hash % TABLE_SIZE;
961 m->anext = member_table[i];
962 member_table[i] = m;
963 m->list = list;
965 /* Keep the member list sorted. It's cheaper to do it here than to
966 sort them in Lisp. */
967 for (prev = NULL, p = *list;
968 p && strcmp (name, p->name) > 0;
969 prev = p, p = p->next)
972 m->next = p;
973 if (prev)
974 prev->next = m;
975 else
976 *list = m;
977 return m;
981 /* Given the root R of a class tree, step through all subclasses
982 recursively, marking functions as virtual that are declared virtual
983 in base classes. */
985 void
986 mark_virtual (struct sym *r)
988 struct link *p;
989 struct member *m, *m2;
991 for (p = r->subs; p; p = p->next)
993 for (m = r->fns; m; m = m->next)
994 if (HAS_FLAG (m->flags, F_VIRTUAL))
996 for (m2 = p->sym->fns; m2; m2 = m2->next)
997 if (m->param_hash == m2->param_hash && streq (m->name, m2->name))
998 SET_FLAG (m2->flags, F_VIRTUAL);
1001 mark_virtual (p->sym);
1006 /* For all roots of the class tree, mark functions as virtual that
1007 are virtual because of a virtual declaration in a base class. */
1009 void
1010 mark_inherited_virtual (void)
1012 struct sym *r;
1013 int i;
1015 for (i = 0; i < TABLE_SIZE; ++i)
1016 for (r = class_table[i]; r; r = r->next)
1017 if (r->supers == NULL)
1018 mark_virtual (r);
1022 /* Create and return a symbol for a namespace with name NAME. */
1024 struct sym *
1025 make_namespace (char *name, struct sym *context)
1027 struct sym *s = (struct sym *) xmalloc (sizeof *s + strlen (name));
1028 memset (s, 0, sizeof *s);
1029 strcpy (s->name, name);
1030 s->next = all_namespaces;
1031 s->namesp = context;
1032 all_namespaces = s;
1033 return s;
1037 /* Find the symbol for namespace NAME. If not found, retrun NULL */
1039 struct sym *
1040 check_namespace (char *name, struct sym *context)
1042 struct sym *p = NULL;
1044 for (p = all_namespaces; p; p = p->next)
1046 if (streq (p->name, name) && (p->namesp == context))
1047 break;
1050 return p;
1053 /* Find the symbol for namespace NAME. If not found, add a new symbol
1054 for NAME to all_namespaces. */
1056 struct sym *
1057 find_namespace (char *name, struct sym *context)
1059 struct sym *p = check_namespace (name, context);
1061 if (p == NULL)
1062 p = make_namespace (name, context);
1064 return p;
1068 /* Find namespace alias with name NAME. If not found return NULL. */
1070 struct link *
1071 check_namespace_alias (char *name)
1073 struct link *p = NULL;
1074 struct alias *al;
1075 unsigned h;
1076 char *s;
1078 for (s = name, h = 0; *s; ++s)
1079 h = (h << 1) ^ *s;
1080 h %= TABLE_SIZE;
1082 for (al = namespace_alias_table[h]; al; al = al->next)
1083 if (streq (name, al->name) && (al->namesp == current_namespace))
1085 p = al->aliasee;
1086 break;
1089 return p;
1092 /* Register the name NEW_NAME as an alias for namespace list OLD_NAME. */
1094 void
1095 register_namespace_alias (char *new_name, struct link *old_name)
1097 unsigned h;
1098 char *s;
1099 struct alias *al;
1101 for (s = new_name, h = 0; *s; ++s)
1102 h = (h << 1) ^ *s;
1103 h %= TABLE_SIZE;
1106 /* Is it already in the table of aliases? */
1107 for (al = namespace_alias_table[h]; al; al = al->next)
1108 if (streq (new_name, al->name) && (al->namesp == current_namespace))
1109 return;
1111 al = (struct alias *) xmalloc (sizeof *al + strlen (new_name));
1112 strcpy (al->name, new_name);
1113 al->next = namespace_alias_table[h];
1114 al->namesp = current_namespace;
1115 al->aliasee = old_name;
1116 namespace_alias_table[h] = al;
1120 /* Enter namespace with name NAME. */
1122 void
1123 enter_namespace (char *name)
1125 struct sym *p = find_namespace (name, current_namespace);
1127 if (namespace_sp == namespace_stack_size)
1129 int size = max (10, 2 * namespace_stack_size);
1130 namespace_stack
1131 = (struct sym **) xrealloc ((void *)namespace_stack,
1132 size * sizeof *namespace_stack);
1133 namespace_stack_size = size;
1136 namespace_stack[namespace_sp++] = current_namespace;
1137 current_namespace = p;
1141 /* Leave the current namespace. */
1143 void
1144 leave_namespace (void)
1146 assert (namespace_sp > 0);
1147 current_namespace = namespace_stack[--namespace_sp];
1152 /***********************************************************************
1153 Writing the Output File
1154 ***********************************************************************/
1156 /* Write string S to the output file FP in a Lisp-readable form.
1157 If S is null, write out `()'. */
1159 #define PUTSTR(s, fp) \
1160 do { \
1161 if (!s) \
1163 putc ('(', fp); \
1164 putc (')', fp); \
1165 putc (' ', fp); \
1167 else \
1169 putc ('"', fp); \
1170 fputs (s, fp); \
1171 putc ('"', fp); \
1172 putc (' ', fp); \
1174 } while (0)
1176 /* A dynamically allocated buffer for constructing a scope name. */
1178 char *scope_buffer;
1179 int scope_buffer_size;
1180 int scope_buffer_len;
1183 /* Make sure scope_buffer has enough room to add LEN chars to it. */
1185 void
1186 ensure_scope_buffer_room (int len)
1188 if (scope_buffer_len + len >= scope_buffer_size)
1190 int new_size = max (2 * scope_buffer_size, scope_buffer_len + len);
1191 scope_buffer = (char *) xrealloc (scope_buffer, new_size);
1192 scope_buffer_size = new_size;
1197 /* Recursively add the scope names of symbol P and the scopes of its
1198 namespaces to scope_buffer. Value is a pointer to the complete
1199 scope name constructed. */
1201 char *
1202 sym_scope_1 (struct sym *p)
1204 int len;
1206 if (p->namesp)
1207 sym_scope_1 (p->namesp);
1209 if (*scope_buffer)
1211 ensure_scope_buffer_room (3);
1212 strcat (scope_buffer, "::");
1213 scope_buffer_len += 2;
1216 len = strlen (p->name);
1217 ensure_scope_buffer_room (len + 1);
1218 strcat (scope_buffer, p->name);
1219 scope_buffer_len += len;
1221 if (HAS_FLAG (p->flags, F_TEMPLATE))
1223 ensure_scope_buffer_room (3);
1224 strcat (scope_buffer, "<>");
1225 scope_buffer_len += 2;
1228 return scope_buffer;
1232 /* Return the scope of symbol P in printed representation, i.e.
1233 as it would appear in a C*+ source file. */
1235 char *
1236 sym_scope (struct sym *p)
1238 if (!scope_buffer)
1240 scope_buffer_size = 1024;
1241 scope_buffer = (char *) xmalloc (scope_buffer_size);
1244 *scope_buffer = '\0';
1245 scope_buffer_len = 0;
1247 if (p->namesp)
1248 sym_scope_1 (p->namesp);
1250 return scope_buffer;
1254 /* Dump the list of members M to file FP. Value is the length of the
1255 list. */
1258 dump_members (FILE *fp, struct member *m)
1260 int n;
1262 putc ('(', fp);
1264 for (n = 0; m; m = m->next, ++n)
1266 fputs (MEMBER_STRUCT, fp);
1267 PUTSTR (m->name, fp);
1268 PUTSTR (NULL, fp); /* FIXME? scope for globals */
1269 fprintf (fp, "%u ", (unsigned) m->flags);
1270 PUTSTR (m->filename, fp);
1271 PUTSTR (m->regexp, fp);
1272 fprintf (fp, "%u ", (unsigned) m->pos);
1273 fprintf (fp, "%u ", (unsigned) m->vis);
1274 putc (' ', fp);
1275 PUTSTR (m->def_filename, fp);
1276 PUTSTR (m->def_regexp, fp);
1277 fprintf (fp, "%u", (unsigned) m->def_pos);
1278 putc (']', fp);
1279 putc ('\n', fp);
1282 putc (')', fp);
1283 putc ('\n', fp);
1284 return n;
1288 /* Dump class ROOT to stream FP. */
1290 void
1291 dump_sym (FILE *fp, struct sym *root)
1293 fputs (CLASS_STRUCT, fp);
1294 PUTSTR (root->name, fp);
1296 /* Print scope, if any. */
1297 if (root->namesp)
1298 PUTSTR (sym_scope (root), fp);
1299 else
1300 PUTSTR (NULL, fp);
1302 /* Print flags. */
1303 fprintf (fp, "%u", root->flags);
1304 PUTSTR (root->filename, fp);
1305 PUTSTR (root->regexp, fp);
1306 fprintf (fp, "%u", (unsigned) root->pos);
1307 PUTSTR (root->sfilename, fp);
1308 putc (']', fp);
1309 putc ('\n', fp);
1313 /* Dump class ROOT and its subclasses to file FP. Value is the
1314 number of classes written. */
1317 dump_tree (FILE *fp, struct sym *root)
1319 struct link *lk;
1320 unsigned n = 0;
1322 dump_sym (fp, root);
1324 if (f_verbose)
1326 putchar ('+');
1327 fflush (stdout);
1330 putc ('(', fp);
1332 for (lk = root->subs; lk; lk = lk->next)
1334 fputs (TREE_STRUCT, fp);
1335 n += dump_tree (fp, lk->sym);
1336 putc (']', fp);
1339 putc (')', fp);
1341 dump_members (fp, root->vars);
1342 n += dump_members (fp, root->fns);
1343 dump_members (fp, root->static_vars);
1344 n += dump_members (fp, root->static_fns);
1345 n += dump_members (fp, root->friends);
1346 dump_members (fp, root->types);
1348 /* Superclasses. */
1349 putc ('(', fp);
1350 putc (')', fp);
1352 /* Mark slot. */
1353 putc ('(', fp);
1354 putc (')', fp);
1356 putc ('\n', fp);
1357 return n;
1361 /* Dump the entire class tree to file FP. */
1363 void
1364 dump_roots (FILE *fp)
1366 int i, n = 0;
1367 struct sym *r;
1369 /* Output file header containing version string, command line
1370 options etc. */
1371 if (!f_append)
1373 fputs (TREE_HEADER_STRUCT, fp);
1374 PUTSTR (EBROWSE_FILE_VERSION, fp);
1376 putc ('\"', fp);
1377 if (!f_structs)
1378 fputs (" -s", fp);
1379 if (f_regexps)
1380 fputs (" -x", fp);
1381 putc ('\"', fp);
1382 fputs (" ()", fp);
1383 fputs (" ()", fp);
1384 putc (']', fp);
1387 /* Mark functions as virtual that are so because of functions
1388 declared virtual in base classes. */
1389 mark_inherited_virtual ();
1391 /* Dump the roots of the graph. */
1392 for (i = 0; i < TABLE_SIZE; ++i)
1393 for (r = class_table[i]; r; r = r->next)
1394 if (!r->supers)
1396 fputs (TREE_STRUCT, fp);
1397 n += dump_tree (fp, r);
1398 putc (']', fp);
1401 if (f_verbose)
1402 putchar ('\n');
1407 /***********************************************************************
1408 Scanner
1409 ***********************************************************************/
1411 #ifdef DEBUG
1412 #define INCREMENT_LINENO \
1413 do { \
1414 if (f_very_verbose) \
1416 ++yyline; \
1417 printf ("%d:\n", yyline); \
1419 else \
1420 ++yyline; \
1421 } while (0)
1422 #else
1423 #define INCREMENT_LINENO ++yyline
1424 #endif
1426 /* Define two macros for accessing the input buffer (current input
1427 file). GET(C) sets C to the next input character and advances the
1428 input pointer. UNGET retracts the input pointer. */
1430 #define GET(C) ((C) = *in++)
1431 #define UNGET() (--in)
1434 /* Process a preprocessor line. Value is the next character from the
1435 input buffer not consumed. */
1438 process_pp_line (void)
1440 int in_comment = 0, in_string = 0;
1441 int c;
1442 char *p = yytext;
1444 /* Skip over white space. The `#' has been consumed already. */
1445 while (WHITEP (GET (c)))
1448 /* Read the preprocessor command (if any). */
1449 while (IDENTP (c))
1451 *p++ = c;
1452 GET (c);
1455 /* Is it a `define'? */
1456 *p = '\0';
1458 if (*yytext && streq (yytext, "define"))
1460 p = yytext;
1461 while (WHITEP (c))
1462 GET (c);
1463 while (IDENTP (c))
1465 *p++ = c;
1466 GET (c);
1469 *p = '\0';
1471 if (*yytext)
1473 char *regexp = matching_regexp ();
1474 int pos = BUFFER_POS ();
1475 add_define (yytext, regexp, pos);
1479 while (c && (c != '\n' || in_comment || in_string))
1481 if (c == '\\')
1482 GET (c);
1483 else if (c == '/' && !in_comment)
1485 if (GET (c) == '*')
1486 in_comment = 1;
1488 else if (c == '*' && in_comment)
1490 if (GET (c) == '/')
1491 in_comment = 0;
1493 else if (c == '"')
1494 in_string = !in_string;
1496 if (c == '\n')
1497 INCREMENT_LINENO;
1499 GET (c);
1502 return c;
1506 /* Value is the next token from the input buffer. */
1509 yylex (void)
1511 int c;
1512 char end_char;
1513 char *p;
1515 for (;;)
1517 while (WHITEP (GET (c)))
1520 switch (c)
1522 case '\n':
1523 INCREMENT_LINENO;
1524 break;
1526 case '\r':
1527 break;
1529 case 0:
1530 /* End of file. */
1531 return YYEOF;
1533 case '\\':
1534 GET (c);
1535 break;
1537 case '"':
1538 case '\'':
1539 /* String and character constants. */
1540 end_char = c;
1541 string_start = in;
1542 while (GET (c) && c != end_char)
1544 switch (c)
1546 case '\\':
1547 /* Escape sequences. */
1548 if (!GET (c))
1550 if (end_char == '\'')
1551 yyerror ("EOF in character constant", NULL);
1552 else
1553 yyerror ("EOF in string constant", NULL);
1554 goto end_string;
1556 else switch (c)
1558 case '\n':
1559 INCREMENT_LINENO;
1560 case 'a':
1561 case 'b':
1562 case 'f':
1563 case 'n':
1564 case 'r':
1565 case 't':
1566 case 'v':
1567 break;
1569 case 'x':
1571 /* Hexadecimal escape sequence. */
1572 int i;
1573 for (i = 0; i < 2; ++i)
1575 GET (c);
1577 if (c >= '0' && c <= '7')
1579 else if (c >= 'a' && c <= 'f')
1581 else if (c >= 'A' && c <= 'F')
1583 else
1585 UNGET ();
1586 break;
1590 break;
1592 case '0':
1594 /* Octal escape sequence. */
1595 int i;
1596 for (i = 0; i < 3; ++i)
1598 GET (c);
1600 if (c >= '0' && c <= '7')
1602 else
1604 UNGET ();
1605 break;
1609 break;
1611 default:
1612 break;
1614 break;
1616 case '\n':
1617 if (end_char == '\'')
1618 yyerror ("newline in character constant", NULL);
1619 else
1620 yyerror ("newline in string constant", NULL);
1621 INCREMENT_LINENO;
1622 break;
1624 default:
1625 break;
1629 end_string:
1630 return end_char == '\'' ? CCHAR : CSTRING;
1632 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g':
1633 case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n':
1634 case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u':
1635 case 'v': case 'w': case 'x': case 'y': case 'z':
1636 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G':
1637 case 'H': case 'I': case 'J': case 'K': case 'L': case 'M': case 'N':
1638 case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U':
1639 case 'V': case 'W': case 'X': case 'Y': case 'Z': case '_':
1641 /* Identifier and keywords. */
1642 unsigned hash;
1643 struct kw *k;
1645 p = yytext;
1646 *p++ = hash = c;
1648 while (IDENTP (GET (*p)))
1650 hash = (hash << 1) ^ *p++;
1651 if (p == yytext_end - 1)
1653 int size = yytext_end - yytext;
1654 yytext = (char *) xrealloc (yytext, 2 * size);
1655 yytext_end = yytext + 2 * size;
1656 p = yytext + size - 1;
1660 UNGET ();
1661 *p = 0;
1663 for (k = keyword_table[hash % KEYWORD_TABLE_SIZE]; k; k = k->next)
1664 if (streq (k->name, yytext))
1665 return k->tk;
1667 return IDENT;
1670 case '/':
1671 /* C and C++ comments, '/' and '/='. */
1672 switch (GET (c))
1674 case '*':
1675 while (GET (c))
1677 switch (c)
1679 case '*':
1680 if (GET (c) == '/')
1681 goto comment_end;
1682 UNGET ();
1683 break;
1684 case '\\':
1685 GET (c);
1686 break;
1687 case '\n':
1688 INCREMENT_LINENO;
1689 break;
1692 comment_end:;
1693 break;
1695 case '=':
1696 return DIVASGN;
1698 case '/':
1699 while (GET (c) && c != '\n')
1701 /* Don't try to read past the end of the input buffer if
1702 the file ends in a C++ comment without a newline. */
1703 if (c == 0)
1704 return YYEOF;
1706 INCREMENT_LINENO;
1707 break;
1709 default:
1710 UNGET ();
1711 return '/';
1713 break;
1715 case '+':
1716 if (GET (c) == '+')
1717 return INC;
1718 else if (c == '=')
1719 return ADDASGN;
1720 UNGET ();
1721 return '+';
1723 case '-':
1724 switch (GET (c))
1726 case '-':
1727 return DEC;
1728 case '>':
1729 if (GET (c) == '*')
1730 return ARROWSTAR;
1731 UNGET ();
1732 return ARROW;
1733 case '=':
1734 return SUBASGN;
1736 UNGET ();
1737 return '-';
1739 case '*':
1740 if (GET (c) == '=')
1741 return MULASGN;
1742 UNGET ();
1743 return '*';
1745 case '%':
1746 if (GET (c) == '=')
1747 return MODASGN;
1748 UNGET ();
1749 return '%';
1751 case '|':
1752 if (GET (c) == '|')
1753 return LOR;
1754 else if (c == '=')
1755 return ORASGN;
1756 UNGET ();
1757 return '|';
1759 case '&':
1760 if (GET (c) == '&')
1761 return LAND;
1762 else if (c == '=')
1763 return ANDASGN;
1764 UNGET ();
1765 return '&';
1767 case '^':
1768 if (GET (c) == '=')
1769 return XORASGN;
1770 UNGET ();
1771 return '^';
1773 case '.':
1774 if (GET (c) == '*')
1775 return POINTSTAR;
1776 else if (c == '.')
1778 if (GET (c) != '.')
1779 yyerror ("invalid token '..' ('...' assumed)", NULL);
1780 UNGET ();
1781 return ELLIPSIS;
1783 else if (!DIGITP (c))
1785 UNGET ();
1786 return '.';
1788 goto mantissa;
1790 case ':':
1791 if (GET (c) == ':')
1792 return DCOLON;
1793 UNGET ();
1794 return ':';
1796 case '=':
1797 if (GET (c) == '=')
1798 return EQ;
1799 UNGET ();
1800 return '=';
1802 case '!':
1803 if (GET (c) == '=')
1804 return NE;
1805 UNGET ();
1806 return '!';
1808 case '<':
1809 switch (GET (c))
1811 case '=':
1812 return LE;
1813 case '<':
1814 if (GET (c) == '=')
1815 return LSHIFTASGN;
1816 UNGET ();
1817 return LSHIFT;
1819 UNGET ();
1820 return '<';
1822 case '>':
1823 switch (GET (c))
1825 case '=':
1826 return GE;
1827 case '>':
1828 if (GET (c) == '=')
1829 return RSHIFTASGN;
1830 UNGET ();
1831 return RSHIFT;
1833 UNGET ();
1834 return '>';
1836 case '#':
1837 c = process_pp_line ();
1838 if (c == 0)
1839 return YYEOF;
1840 break;
1842 case '(': case ')': case '[': case ']': case '{': case '}':
1843 case ';': case ',': case '?': case '~':
1844 return c;
1846 case '0':
1847 yyival = 0;
1849 if (GET (c) == 'x' || c == 'X')
1851 while (GET (c))
1853 if (DIGITP (c))
1854 yyival = yyival * 16 + c - '0';
1855 else if (c >= 'a' && c <= 'f')
1856 yyival = yyival * 16 + c - 'a' + 10;
1857 else if (c >= 'A' && c <= 'F')
1858 yyival = yyival * 16 + c - 'A' + 10;
1859 else
1860 break;
1863 goto int_suffixes;
1865 else if (c == '.')
1866 goto mantissa;
1868 while (c >= '0' && c <= '7')
1870 yyival = (yyival << 3) + c - '0';
1871 GET (c);
1874 int_suffixes:
1875 /* Integer suffixes. */
1876 while (isalpha (c))
1877 GET (c);
1878 UNGET ();
1879 return CINT;
1881 case '1': case '2': case '3': case '4': case '5': case '6':
1882 case '7': case '8': case '9':
1883 /* Integer or floating constant, part before '.'. */
1884 yyival = c - '0';
1886 while (GET (c) && DIGITP (c))
1887 yyival = 10 * yyival + c - '0';
1889 if (c != '.')
1890 goto int_suffixes;
1892 mantissa:
1893 /* Digits following '.'. */
1894 while (DIGITP (c))
1895 GET (c);
1897 /* Optional exponent. */
1898 if (c == 'E' || c == 'e')
1900 if (GET (c) == '-' || c == '+')
1901 GET (c);
1903 while (DIGITP (c))
1904 GET (c);
1907 /* Optional type suffixes. */
1908 while (isalpha (c))
1909 GET (c);
1910 UNGET ();
1911 return CFLOAT;
1913 default:
1914 break;
1920 /* Actually local to matching_regexp. These variables must be in
1921 global scope for the case that `static' get's defined away. */
1923 static char *matching_regexp_buffer, *matching_regexp_end_buf;
1926 /* Value is the string from the start of the line to the current
1927 position in the input buffer, or maybe a bit more if that string is
1928 shorter than min_regexp. */
1930 char *
1931 matching_regexp (void)
1933 char *p;
1934 char *s;
1935 char *t;
1937 if (!f_regexps)
1938 return NULL;
1940 if (matching_regexp_buffer == NULL)
1942 matching_regexp_buffer = (char *) xmalloc (max_regexp);
1943 matching_regexp_end_buf = &matching_regexp_buffer[max_regexp] - 1;
1946 /* Scan back to previous newline of buffer start. */
1947 for (p = in - 1; p > inbuffer && *p != '\n'; --p)
1950 if (*p == '\n')
1952 while (in - p < min_regexp && p > inbuffer)
1954 /* Line probably not significant enough */
1955 for (--p; p > inbuffer && *p != '\n'; --p)
1958 if (*p == '\n')
1959 ++p;
1962 /* Copy from end to make sure significant portions are included.
1963 This implies that in the browser a regular expressing of the form
1964 `^.*{regexp}' has to be used. */
1965 for (s = matching_regexp_end_buf - 1, t = in;
1966 s > matching_regexp_buffer && t > p;)
1968 *--s = *--t;
1970 if (*s == '"' || *s == '\\')
1971 *--s = '\\';
1974 *(matching_regexp_end_buf - 1) = '\0';
1975 return xstrdup (s);
1979 /* Return a printable representation of token T. */
1981 const char *
1982 token_string (int t)
1984 static char b[3];
1986 switch (t)
1988 case CSTRING: return "string constant";
1989 case CCHAR: return "char constant";
1990 case CINT: return "int constant";
1991 case CFLOAT: return "floating constant";
1992 case ELLIPSIS: return "...";
1993 case LSHIFTASGN: return "<<=";
1994 case RSHIFTASGN: return ">>=";
1995 case ARROWSTAR: return "->*";
1996 case IDENT: return "identifier";
1997 case DIVASGN: return "/=";
1998 case INC: return "++";
1999 case ADDASGN: return "+=";
2000 case DEC: return "--";
2001 case ARROW: return "->";
2002 case SUBASGN: return "-=";
2003 case MULASGN: return "*=";
2004 case MODASGN: return "%=";
2005 case LOR: return "||";
2006 case ORASGN: return "|=";
2007 case LAND: return "&&";
2008 case ANDASGN: return "&=";
2009 case XORASGN: return "^=";
2010 case POINTSTAR: return ".*";
2011 case DCOLON: return "::";
2012 case EQ: return "==";
2013 case NE: return "!=";
2014 case LE: return "<=";
2015 case LSHIFT: return "<<";
2016 case GE: return ">=";
2017 case RSHIFT: return ">>";
2018 case ASM: return "asm";
2019 case AUTO: return "auto";
2020 case BREAK: return "break";
2021 case CASE: return "case";
2022 case CATCH: return "catch";
2023 case CHAR: return "char";
2024 case CLASS: return "class";
2025 case CONST: return "const";
2026 case CONTINUE: return "continue";
2027 case DEFAULT: return "default";
2028 case DELETE: return "delete";
2029 case DO: return "do";
2030 case DOUBLE: return "double";
2031 case ELSE: return "else";
2032 case ENUM: return "enum";
2033 case EXTERN: return "extern";
2034 case FLOAT: return "float";
2035 case FOR: return "for";
2036 case FRIEND: return "friend";
2037 case GOTO: return "goto";
2038 case IF: return "if";
2039 case T_INLINE: return "inline";
2040 case INT: return "int";
2041 case LONG: return "long";
2042 case NEW: return "new";
2043 case OPERATOR: return "operator";
2044 case PRIVATE: return "private";
2045 case PROTECTED: return "protected";
2046 case PUBLIC: return "public";
2047 case REGISTER: return "register";
2048 case RETURN: return "return";
2049 case SHORT: return "short";
2050 case SIGNED: return "signed";
2051 case SIZEOF: return "sizeof";
2052 case STATIC: return "static";
2053 case STRUCT: return "struct";
2054 case SWITCH: return "switch";
2055 case TEMPLATE: return "template";
2056 case THIS: return "this";
2057 case THROW: return "throw";
2058 case TRY: return "try";
2059 case TYPEDEF: return "typedef";
2060 case UNION: return "union";
2061 case UNSIGNED: return "unsigned";
2062 case VIRTUAL: return "virtual";
2063 case VOID: return "void";
2064 case VOLATILE: return "volatile";
2065 case WHILE: return "while";
2066 case MUTABLE: return "mutable";
2067 case BOOL: return "bool";
2068 case TRUE: return "true";
2069 case FALSE: return "false";
2070 case SIGNATURE: return "signature";
2071 case NAMESPACE: return "namespace";
2072 case EXPLICIT: return "explicit";
2073 case TYPENAME: return "typename";
2074 case CONST_CAST: return "const_cast";
2075 case DYNAMIC_CAST: return "dynamic_cast";
2076 case REINTERPRET_CAST: return "reinterpret_cast";
2077 case STATIC_CAST: return "static_cast";
2078 case TYPEID: return "typeid";
2079 case USING: return "using";
2080 case WCHAR: return "wchar_t";
2081 case YYEOF: return "EOF";
2083 default:
2084 if (t < 255)
2086 b[0] = t;
2087 b[1] = '\0';
2088 return b;
2090 else
2091 return "???";
2096 /* Reinitialize the scanner for a new input file. */
2098 void
2099 re_init_scanner (void)
2101 in = inbuffer;
2102 yyline = 1;
2104 if (yytext == NULL)
2106 int size = 256;
2107 yytext = (char *) xmalloc (size * sizeof *yytext);
2108 yytext_end = yytext + size;
2113 /* Insert a keyword NAME with token value TK into the keyword hash
2114 table. */
2116 void
2117 insert_keyword (const char *name, int tk)
2119 const char *s;
2120 unsigned h = 0;
2121 struct kw *k = (struct kw *) xmalloc (sizeof *k);
2123 for (s = name; *s; ++s)
2124 h = (h << 1) ^ *s;
2126 h %= KEYWORD_TABLE_SIZE;
2127 k->name = name;
2128 k->tk = tk;
2129 k->next = keyword_table[h];
2130 keyword_table[h] = k;
2134 /* Initialize the scanner for the first file. This sets up the
2135 character class vectors and fills the keyword hash table. */
2137 void
2138 init_scanner (void)
2140 int i;
2142 /* Allocate the input buffer */
2143 inbuffer_size = READ_CHUNK_SIZE + 1;
2144 inbuffer = in = (char *) xmalloc (inbuffer_size);
2145 yyline = 1;
2147 /* Set up character class vectors. */
2148 for (i = 0; i < sizeof is_ident; ++i)
2150 if (i == '_' || isalnum (i))
2151 is_ident[i] = 1;
2153 if (i >= '0' && i <= '9')
2154 is_digit[i] = 1;
2156 if (i == ' ' || i == '\t' || i == '\f' || i == '\v')
2157 is_white[i] = 1;
2160 /* Fill keyword hash table. */
2161 insert_keyword ("and", LAND);
2162 insert_keyword ("and_eq", ANDASGN);
2163 insert_keyword ("asm", ASM);
2164 insert_keyword ("auto", AUTO);
2165 insert_keyword ("bitand", '&');
2166 insert_keyword ("bitor", '|');
2167 insert_keyword ("bool", BOOL);
2168 insert_keyword ("break", BREAK);
2169 insert_keyword ("case", CASE);
2170 insert_keyword ("catch", CATCH);
2171 insert_keyword ("char", CHAR);
2172 insert_keyword ("class", CLASS);
2173 insert_keyword ("compl", '~');
2174 insert_keyword ("const", CONST);
2175 insert_keyword ("const_cast", CONST_CAST);
2176 insert_keyword ("continue", CONTINUE);
2177 insert_keyword ("default", DEFAULT);
2178 insert_keyword ("delete", DELETE);
2179 insert_keyword ("do", DO);
2180 insert_keyword ("double", DOUBLE);
2181 insert_keyword ("dynamic_cast", DYNAMIC_CAST);
2182 insert_keyword ("else", ELSE);
2183 insert_keyword ("enum", ENUM);
2184 insert_keyword ("explicit", EXPLICIT);
2185 insert_keyword ("extern", EXTERN);
2186 insert_keyword ("false", FALSE);
2187 insert_keyword ("float", FLOAT);
2188 insert_keyword ("for", FOR);
2189 insert_keyword ("friend", FRIEND);
2190 insert_keyword ("goto", GOTO);
2191 insert_keyword ("if", IF);
2192 insert_keyword ("inline", T_INLINE);
2193 insert_keyword ("int", INT);
2194 insert_keyword ("long", LONG);
2195 insert_keyword ("mutable", MUTABLE);
2196 insert_keyword ("namespace", NAMESPACE);
2197 insert_keyword ("new", NEW);
2198 insert_keyword ("not", '!');
2199 insert_keyword ("not_eq", NE);
2200 insert_keyword ("operator", OPERATOR);
2201 insert_keyword ("or", LOR);
2202 insert_keyword ("or_eq", ORASGN);
2203 insert_keyword ("private", PRIVATE);
2204 insert_keyword ("protected", PROTECTED);
2205 insert_keyword ("public", PUBLIC);
2206 insert_keyword ("register", REGISTER);
2207 insert_keyword ("reinterpret_cast", REINTERPRET_CAST);
2208 insert_keyword ("return", RETURN);
2209 insert_keyword ("short", SHORT);
2210 insert_keyword ("signed", SIGNED);
2211 insert_keyword ("sizeof", SIZEOF);
2212 insert_keyword ("static", STATIC);
2213 insert_keyword ("static_cast", STATIC_CAST);
2214 insert_keyword ("struct", STRUCT);
2215 insert_keyword ("switch", SWITCH);
2216 insert_keyword ("template", TEMPLATE);
2217 insert_keyword ("this", THIS);
2218 insert_keyword ("throw", THROW);
2219 insert_keyword ("true", TRUE);
2220 insert_keyword ("try", TRY);
2221 insert_keyword ("typedef", TYPEDEF);
2222 insert_keyword ("typeid", TYPEID);
2223 insert_keyword ("typename", TYPENAME);
2224 insert_keyword ("union", UNION);
2225 insert_keyword ("unsigned", UNSIGNED);
2226 insert_keyword ("using", USING);
2227 insert_keyword ("virtual", VIRTUAL);
2228 insert_keyword ("void", VOID);
2229 insert_keyword ("volatile", VOLATILE);
2230 insert_keyword ("wchar_t", WCHAR);
2231 insert_keyword ("while", WHILE);
2232 insert_keyword ("xor", '^');
2233 insert_keyword ("xor_eq", XORASGN);
2238 /***********************************************************************
2239 Parser
2240 ***********************************************************************/
2242 /* Match the current lookahead token and set it to the next token. */
2244 #define MATCH() (tk = yylex ())
2246 /* Return the lookahead token. If current lookahead token is cleared,
2247 read a new token. */
2249 #define LA1 (tk == -1 ? (tk = yylex ()) : tk)
2251 /* Is the current lookahead equal to the token T? */
2253 #define LOOKING_AT(T) (tk == (T))
2255 /* Is the current lookahead one of T1 or T2? */
2257 #define LOOKING_AT2(T1, T2) (tk == (T1) || tk == (T2))
2259 /* Is the current lookahead one of T1, T2 or T3? */
2261 #define LOOKING_AT3(T1, T2, T3) (tk == (T1) || tk == (T2) || tk == (T3))
2263 /* Is the current lookahead one of T1...T4? */
2265 #define LOOKING_AT4(T1, T2, T3, T4) \
2266 (tk == (T1) || tk == (T2) || tk == (T3) || tk == (T4))
2268 /* Match token T if current lookahead is T. */
2270 #define MATCH_IF(T) if (LOOKING_AT (T)) MATCH (); else ((void) 0)
2272 /* Skip to matching token if current token is T. */
2274 #define SKIP_MATCHING_IF(T) \
2275 if (LOOKING_AT (T)) skip_matching (); else ((void) 0)
2278 /* Skip forward until a given token TOKEN or YYEOF is seen and return
2279 the current lookahead token after skipping. */
2282 skip_to (int token)
2284 while (!LOOKING_AT2 (YYEOF, token))
2285 MATCH ();
2286 return tk;
2289 /* Skip over pairs of tokens (parentheses, square brackets,
2290 angle brackets, curly brackets) matching the current lookahead. */
2292 void
2293 skip_matching (void)
2295 int open, close, n;
2297 switch (open = LA1)
2299 case '{':
2300 close = '}';
2301 break;
2303 case '(':
2304 close = ')';
2305 break;
2307 case '<':
2308 close = '>';
2309 break;
2311 case '[':
2312 close = ']';
2313 break;
2315 default:
2316 abort ();
2319 for (n = 0;;)
2321 if (LOOKING_AT (open))
2322 ++n;
2323 else if (LOOKING_AT (close))
2324 --n;
2325 else if (LOOKING_AT (YYEOF))
2326 break;
2328 MATCH ();
2330 if (n == 0)
2331 break;
2335 void
2336 skip_initializer (void)
2338 for (;;)
2340 switch (LA1)
2342 case ';':
2343 case ',':
2344 case YYEOF:
2345 return;
2347 case '{':
2348 case '[':
2349 case '(':
2350 skip_matching ();
2351 break;
2353 default:
2354 MATCH ();
2355 break;
2360 /* Build qualified namespace alias (A::B::c) and return it. */
2362 struct link *
2363 match_qualified_namespace_alias (void)
2365 struct link *head = NULL;
2366 struct link *cur = NULL;
2367 struct link *tmp = NULL;
2369 for (;;)
2371 MATCH ();
2372 switch (LA1)
2374 case IDENT:
2375 tmp = (struct link *) xmalloc (sizeof *cur);
2376 tmp->sym = find_namespace (yytext, cur ? cur->sym : NULL);
2377 tmp->next = NULL;
2378 if (head)
2380 cur = cur->next = tmp;
2382 else
2384 head = cur = tmp;
2386 break;
2387 case DCOLON:
2388 /* Just skip */
2389 break;
2390 default:
2391 return head;
2392 break;
2397 /* Re-initialize the parser by resetting the lookahead token. */
2399 void
2400 re_init_parser (void)
2402 tk = -1;
2406 /* Parse a parameter list, including the const-specifier,
2407 pure-specifier, and throw-list that may follow a parameter list.
2408 Return in FLAGS what was seen following the parameter list.
2409 Returns a hash code for the parameter types. This value is used to
2410 distinguish between overloaded functions. */
2412 unsigned
2413 parm_list (int *flags)
2415 unsigned hash = 0;
2416 int type_seen = 0;
2418 while (!LOOKING_AT2 (YYEOF, ')'))
2420 switch (LA1)
2422 /* Skip over grouping parens or parameter lists in parameter
2423 declarations. */
2424 case '(':
2425 skip_matching ();
2426 break;
2428 /* Next parameter. */
2429 case ',':
2430 MATCH ();
2431 type_seen = 0;
2432 break;
2434 /* Ignore the scope part of types, if any. This is because
2435 some types need scopes when defined outside of a class body,
2436 and don't need them inside the class body. This means that
2437 we have to look for the last IDENT in a sequence of
2438 IDENT::IDENT::... */
2439 case IDENT:
2440 if (!type_seen)
2442 char *last_id;
2443 unsigned ident_type_hash = 0;
2445 parse_qualified_param_ident_or_type (&last_id);
2446 if (last_id)
2448 /* LAST_ID null means something like `X::*'. */
2449 for (; *last_id; ++last_id)
2450 ident_type_hash = (ident_type_hash << 1) ^ *last_id;
2451 hash = (hash << 1) ^ ident_type_hash;
2452 type_seen = 1;
2455 else
2456 MATCH ();
2457 break;
2459 case VOID:
2460 /* This distinction is made to make `func (void)' equivalent
2461 to `func ()'. */
2462 type_seen = 1;
2463 MATCH ();
2464 if (!LOOKING_AT (')'))
2465 hash = (hash << 1) ^ VOID;
2466 break;
2468 case BOOL: case CHAR: case CLASS: case CONST:
2469 case DOUBLE: case ENUM: case FLOAT: case INT:
2470 case LONG: case SHORT: case SIGNED: case STRUCT:
2471 case UNION: case UNSIGNED: case VOLATILE: case WCHAR:
2472 case ELLIPSIS:
2473 type_seen = 1;
2474 hash = (hash << 1) ^ LA1;
2475 MATCH ();
2476 break;
2478 case '*': case '&': case '[': case ']':
2479 hash = (hash << 1) ^ LA1;
2480 MATCH ();
2481 break;
2483 default:
2484 MATCH ();
2485 break;
2489 if (LOOKING_AT (')'))
2491 MATCH ();
2493 if (LOOKING_AT (CONST))
2495 /* We can overload the same function on `const' */
2496 hash = (hash << 1) ^ CONST;
2497 SET_FLAG (*flags, F_CONST);
2498 MATCH ();
2501 if (LOOKING_AT (THROW))
2503 MATCH ();
2504 SKIP_MATCHING_IF ('(');
2505 SET_FLAG (*flags, F_THROW);
2508 if (LOOKING_AT ('='))
2510 MATCH ();
2511 if (LOOKING_AT (CINT) && yyival == 0)
2513 MATCH ();
2514 SET_FLAG (*flags, F_PURE);
2519 return hash;
2523 /* Print position info to stdout. */
2525 void
2526 print_info (void)
2528 if (info_position >= 0 && BUFFER_POS () <= info_position)
2529 if (info_cls)
2530 printf ("(\"%s\" \"%s\" \"%s\" %d)\n",
2531 info_cls->name, sym_scope (info_cls),
2532 info_member->name, info_where);
2536 /* Parse a member declaration within the class body of CLS. VIS is
2537 the access specifier for the member (private, protected,
2538 public). */
2540 void
2541 member (struct sym *cls, int vis)
2543 char *id = NULL;
2544 int sc = SC_MEMBER;
2545 char *regexp = NULL;
2546 int pos;
2547 int is_constructor;
2548 int anonymous = 0;
2549 int flags = 0;
2550 int class_tag;
2551 int type_seen = 0;
2552 int paren_seen = 0;
2553 unsigned hash = 0;
2554 int tilde = 0;
2556 while (!LOOKING_AT4 (';', '{', '}', YYEOF))
2558 switch (LA1)
2560 default:
2561 MATCH ();
2562 break;
2564 /* A function or class may follow. */
2565 case TEMPLATE:
2566 MATCH();
2567 SET_FLAG (flags, F_TEMPLATE);
2568 /* Skip over template argument list */
2569 SKIP_MATCHING_IF ('<');
2570 break;
2572 case EXPLICIT:
2573 SET_FLAG (flags, F_EXPLICIT);
2574 goto typeseen;
2576 case MUTABLE:
2577 SET_FLAG (flags, F_MUTABLE);
2578 goto typeseen;
2580 case T_INLINE:
2581 SET_FLAG (flags, F_INLINE);
2582 goto typeseen;
2584 case VIRTUAL:
2585 SET_FLAG (flags, F_VIRTUAL);
2586 goto typeseen;
2588 case '[':
2589 skip_matching ();
2590 break;
2592 case ENUM:
2593 sc = SC_TYPE;
2594 goto typeseen;
2596 case TYPEDEF:
2597 sc = SC_TYPE;
2598 goto typeseen;
2600 case FRIEND:
2601 sc = SC_FRIEND;
2602 goto typeseen;
2604 case STATIC:
2605 sc = SC_STATIC;
2606 goto typeseen;
2608 case '~':
2609 tilde = 1;
2610 MATCH ();
2611 break;
2613 case IDENT:
2614 /* Remember IDENTS seen so far. Among these will be the member
2615 name. */
2616 id = (char *) xrealloc (id, strlen (yytext) + 2);
2617 if (tilde)
2619 *id = '~';
2620 strcpy (id + 1, yytext);
2622 else
2623 strcpy (id, yytext);
2624 MATCH ();
2625 break;
2627 case OPERATOR:
2629 char *s = operator_name (&sc);
2630 id = (char *) xrealloc (id, strlen (s) + 1);
2631 strcpy (id, s);
2633 break;
2635 case '(':
2636 /* Most probably the beginning of a parameter list. */
2637 MATCH ();
2638 paren_seen = 1;
2640 if (id && cls)
2642 if (!(is_constructor = streq (id, cls->name)))
2643 regexp = matching_regexp ();
2645 else
2646 is_constructor = 0;
2648 pos = BUFFER_POS ();
2649 hash = parm_list (&flags);
2651 if (is_constructor)
2652 regexp = matching_regexp ();
2654 if (id && cls != NULL)
2655 add_member_decl (cls, id, regexp, pos, hash, 0, sc, vis, flags);
2657 while (!LOOKING_AT3 (';', '{', YYEOF))
2658 MATCH ();
2660 if (LOOKING_AT ('{') && id && cls)
2661 add_member_defn (cls, id, regexp, pos, hash, 0, sc, flags);
2663 free (id);
2664 id = NULL;
2665 sc = SC_MEMBER;
2666 break;
2668 case STRUCT: case UNION: case CLASS:
2669 /* Nested class */
2670 class_tag = LA1;
2671 type_seen = 1;
2672 MATCH ();
2673 anonymous = 1;
2675 /* More than one ident here to allow for MS-DOS specialties
2676 like `_export class' etc. The last IDENT seen counts
2677 as the class name. */
2678 while (!LOOKING_AT4 (YYEOF, ';', ':', '{'))
2680 if (LOOKING_AT (IDENT))
2681 anonymous = 0;
2682 MATCH ();
2685 if (LOOKING_AT2 (':', '{'))
2686 class_definition (anonymous ? NULL : cls, class_tag, flags, 1);
2687 else
2688 skip_to (';');
2689 break;
2691 case INT: case CHAR: case LONG: case UNSIGNED:
2692 case SIGNED: case CONST: case DOUBLE: case VOID:
2693 case SHORT: case VOLATILE: case BOOL: case WCHAR:
2694 case TYPENAME:
2695 typeseen:
2696 type_seen = 1;
2697 MATCH ();
2698 break;
2702 if (LOOKING_AT (';'))
2704 /* The end of a member variable, a friend declaration or an access
2705 declaration. We don't want to add friend classes as members. */
2706 if (id && sc != SC_FRIEND && cls)
2708 regexp = matching_regexp ();
2709 pos = BUFFER_POS ();
2711 if (cls != NULL)
2713 if (type_seen || !paren_seen)
2714 add_member_decl (cls, id, regexp, pos, 0, 1, sc, vis, 0);
2715 else
2716 add_member_decl (cls, id, regexp, pos, hash, 0, sc, vis, 0);
2720 MATCH ();
2721 print_info ();
2723 else if (LOOKING_AT ('{'))
2725 /* A named enum. */
2726 if (sc == SC_TYPE && id && cls)
2728 regexp = matching_regexp ();
2729 pos = BUFFER_POS ();
2731 if (cls != NULL)
2733 add_member_decl (cls, id, regexp, pos, 0, 1, sc, vis, 0);
2734 add_member_defn (cls, id, regexp, pos, 0, 1, sc, 0);
2738 skip_matching ();
2739 print_info ();
2742 free (id);
2746 /* Parse the body of class CLS. TAG is the tag of the class (struct,
2747 union, class). */
2749 void
2750 class_body (struct sym *cls, int tag)
2752 int vis = tag == CLASS ? PRIVATE : PUBLIC;
2753 int temp;
2755 while (!LOOKING_AT2 (YYEOF, '}'))
2757 switch (LA1)
2759 case PRIVATE: case PROTECTED: case PUBLIC:
2760 temp = LA1;
2761 MATCH ();
2763 if (LOOKING_AT (':'))
2765 vis = temp;
2766 MATCH ();
2768 else
2770 /* Probably conditional compilation for inheritance list.
2771 We don't known whether there comes more of this.
2772 This is only a crude fix that works most of the time. */
2775 MATCH ();
2777 while (LOOKING_AT2 (IDENT, ',')
2778 || LOOKING_AT3 (PUBLIC, PROTECTED, PRIVATE));
2780 break;
2782 case TYPENAME:
2783 case USING:
2784 skip_to (';');
2785 break;
2787 /* Try to synchronize */
2788 case CHAR: case CLASS: case CONST:
2789 case DOUBLE: case ENUM: case FLOAT: case INT:
2790 case LONG: case SHORT: case SIGNED: case STRUCT:
2791 case UNION: case UNSIGNED: case VOID: case VOLATILE:
2792 case TYPEDEF: case STATIC: case T_INLINE: case FRIEND:
2793 case VIRTUAL: case TEMPLATE: case IDENT: case '~':
2794 case BOOL: case WCHAR: case EXPLICIT: case MUTABLE:
2795 member (cls, vis);
2796 break;
2798 default:
2799 MATCH ();
2800 break;
2806 /* Parse a qualified identifier. Current lookahead is IDENT. A
2807 qualified ident has the form `X<..>::Y<...>::T<...>. Returns a
2808 symbol for that class. */
2810 struct sym *
2811 parse_classname (void)
2813 struct sym *last_class = NULL;
2815 while (LOOKING_AT (IDENT))
2817 last_class = add_sym (yytext, last_class);
2818 MATCH ();
2820 if (LOOKING_AT ('<'))
2822 skip_matching ();
2823 SET_FLAG (last_class->flags, F_TEMPLATE);
2826 if (!LOOKING_AT (DCOLON))
2827 break;
2829 MATCH ();
2832 return last_class;
2836 /* Parse an operator name. Add the `static' flag to *SC if an
2837 implicitly static operator has been parsed. Value is a pointer to
2838 a static buffer holding the constructed operator name string. */
2840 char *
2841 operator_name (int *sc)
2843 static int id_size = 0;
2844 static char *id = NULL;
2845 const char *s;
2846 int len;
2848 MATCH ();
2850 if (LOOKING_AT2 (NEW, DELETE))
2852 /* `new' and `delete' are implicitly static. */
2853 if (*sc != SC_FRIEND)
2854 *sc = SC_STATIC;
2856 s = token_string (LA1);
2857 MATCH ();
2859 len = strlen (s) + 10;
2860 if (len > id_size)
2862 int new_size = max (len, 2 * id_size);
2863 id = (char *) xrealloc (id, new_size);
2864 id_size = new_size;
2866 strcpy (id, s);
2868 /* Vector new or delete? */
2869 if (LOOKING_AT ('['))
2871 strcat (id, "[");
2872 MATCH ();
2874 if (LOOKING_AT (']'))
2876 strcat (id, "]");
2877 MATCH ();
2881 else
2883 int tokens_matched = 0;
2885 len = 20;
2886 if (len > id_size)
2888 int new_size = max (len, 2 * id_size);
2889 id = (char *) xrealloc (id, new_size);
2890 id_size = new_size;
2892 strcpy (id, "operator");
2894 /* Beware access declarations of the form "X::f;" Beware of
2895 `operator () ()'. Yet another difficulty is found in
2896 GCC 2.95's STL: `operator == __STL_NULL_TMPL_ARGS (...'. */
2897 while (!(LOOKING_AT ('(') && tokens_matched)
2898 && !LOOKING_AT2 (';', YYEOF))
2900 s = token_string (LA1);
2901 len += strlen (s) + 2;
2902 if (len > id_size)
2904 int new_size = max (len, 2 * id_size);
2905 id = (char *) xrealloc (id, new_size);
2906 id_size = new_size;
2909 if (*s != ')' && *s != ']')
2910 strcat (id, " ");
2911 strcat (id, s);
2912 MATCH ();
2914 /* If this is a simple operator like `+', stop now. */
2915 if (!isalpha ((unsigned char) *s) && *s != '(' && *s != '[')
2916 break;
2918 ++tokens_matched;
2922 return id;
2926 /* This one consumes the last IDENT of a qualified member name like
2927 `X::Y::z'. This IDENT is returned in LAST_ID. Value is the
2928 symbol structure for the ident. */
2930 struct sym *
2931 parse_qualified_ident_or_type (char **last_id)
2933 struct sym *cls = NULL;
2934 char *id = NULL;
2935 size_t id_size = 0;
2936 int enter = 0;
2938 while (LOOKING_AT (IDENT))
2940 int len = strlen (yytext) + 1;
2941 if (len > id_size)
2943 id = (char *) xrealloc (id, len);
2944 id_size = len;
2946 strcpy (id, yytext);
2947 *last_id = id;
2948 MATCH ();
2950 SKIP_MATCHING_IF ('<');
2952 if (LOOKING_AT (DCOLON))
2954 struct sym *pcn = NULL;
2955 struct link *pna = check_namespace_alias (id);
2956 if (pna)
2960 enter_namespace (pna->sym->name);
2961 enter++;
2962 pna = pna->next;
2964 while (pna);
2966 else if ((pcn = check_namespace (id, current_namespace)))
2968 enter_namespace (pcn->name);
2969 enter++;
2971 else
2972 cls = add_sym (id, cls);
2974 *last_id = NULL;
2975 free (id);
2976 id = NULL;
2977 id_size = 0;
2978 MATCH ();
2980 else
2981 break;
2984 while (enter--)
2985 leave_namespace();
2987 return cls;
2991 /* This one consumes the last IDENT of a qualified member name like
2992 `X::Y::z'. This IDENT is returned in LAST_ID. Value is the
2993 symbol structure for the ident. */
2995 void
2996 parse_qualified_param_ident_or_type (char **last_id)
2998 struct sym *cls = NULL;
2999 static char *id = NULL;
3000 static int id_size = 0;
3002 while (LOOKING_AT (IDENT))
3004 int len = strlen (yytext) + 1;
3005 if (len > id_size)
3007 id = (char *) xrealloc (id, len);
3008 id_size = len;
3010 strcpy (id, yytext);
3011 *last_id = id;
3012 MATCH ();
3014 SKIP_MATCHING_IF ('<');
3016 if (LOOKING_AT (DCOLON))
3018 cls = add_sym (id, cls);
3019 *last_id = NULL;
3020 MATCH ();
3022 else
3023 break;
3028 /* Parse a class definition.
3030 CONTAINING is the class containing the class being parsed or null.
3031 This may also be null if NESTED != 0 if the containing class is
3032 anonymous. TAG is the tag of the class (struct, union, class).
3033 NESTED is non-zero if we are parsing a nested class.
3035 Current lookahead is the class name. */
3037 void
3038 class_definition (struct sym *containing, int tag, int flags, int nested)
3040 struct sym *current;
3041 struct sym *base_class;
3043 /* Set CURRENT to null if no entry has to be made for the class
3044 parsed. This is the case for certain command line flag
3045 settings. */
3046 if ((tag != CLASS && !f_structs) || (nested && !f_nested_classes))
3047 current = NULL;
3048 else
3050 current = add_sym (yytext, containing);
3051 current->pos = BUFFER_POS ();
3052 current->regexp = matching_regexp ();
3053 current->filename = filename;
3054 current->flags = flags;
3057 /* If at ':', base class list follows. */
3058 if (LOOKING_AT (':'))
3060 int done = 0;
3061 MATCH ();
3063 while (!done)
3065 switch (LA1)
3067 case VIRTUAL: case PUBLIC: case PROTECTED: case PRIVATE:
3068 MATCH ();
3069 break;
3071 case IDENT:
3072 base_class = parse_classname ();
3073 if (base_class && current && base_class != current)
3074 add_link (base_class, current);
3075 break;
3077 /* The `,' between base classes or the end of the base
3078 class list. Add the previously found base class.
3079 It's done this way to skip over sequences of
3080 `A::B::C' until we reach the end.
3082 FIXME: it is now possible to handle `class X : public B::X'
3083 because we have enough information. */
3084 case ',':
3085 MATCH ();
3086 break;
3088 default:
3089 /* A syntax error, possibly due to preprocessor constructs
3090 like
3092 #ifdef SOMETHING
3093 class A : public B
3094 #else
3095 class A : private B.
3097 MATCH until we see something like `;' or `{'. */
3098 while (!LOOKING_AT3 (';', YYEOF, '{'))
3099 MATCH ();
3100 done = 1;
3102 case '{':
3103 done = 1;
3104 break;
3109 /* Parse the class body if there is one. */
3110 if (LOOKING_AT ('{'))
3112 if (tag != CLASS && !f_structs)
3113 skip_matching ();
3114 else
3116 MATCH ();
3117 class_body (current, tag);
3119 if (LOOKING_AT ('}'))
3121 MATCH ();
3122 if (LOOKING_AT (';') && !nested)
3123 MATCH ();
3129 /* Add to class *CLS information for the declaration of variable or
3130 type *ID. If *CLS is null, this means a global declaration. SC is
3131 the storage class of *ID. FLAGS is a bit set giving additional
3132 information about the member (see the F_* defines). */
3134 void
3135 add_declarator (struct sym **cls, char **id, int flags, int sc)
3137 if (LOOKING_AT2 (';', ','))
3139 /* The end of a member variable or of an access declaration
3140 `X::f'. To distinguish between them we have to know whether
3141 type information has been seen. */
3142 if (*id)
3144 char *regexp = matching_regexp ();
3145 int pos = BUFFER_POS ();
3147 if (*cls)
3148 add_member_defn (*cls, *id, regexp, pos, 0, 1, SC_UNKNOWN, flags);
3149 else
3150 add_global_defn (*id, regexp, pos, 0, 1, sc, flags);
3153 MATCH ();
3154 print_info ();
3156 else if (LOOKING_AT ('{'))
3158 if (sc == SC_TYPE && *id)
3160 /* A named enumeration. */
3161 char *regexp = matching_regexp ();
3162 int pos = BUFFER_POS ();
3163 add_global_defn (*id, regexp, pos, 0, 1, sc, flags);
3166 skip_matching ();
3167 print_info ();
3170 free (*id);
3171 *id = NULL;
3172 *cls = NULL;
3175 /* Parse a declaration. */
3177 void
3178 declaration (int flags)
3180 char *id = NULL;
3181 struct sym *cls = NULL;
3182 char *regexp = NULL;
3183 int pos = 0;
3184 unsigned hash = 0;
3185 int is_constructor;
3186 int sc = 0;
3188 while (!LOOKING_AT3 (';', '{', YYEOF))
3190 switch (LA1)
3192 default:
3193 MATCH ();
3194 break;
3196 case '[':
3197 skip_matching ();
3198 break;
3200 case ENUM:
3201 case TYPEDEF:
3202 sc = SC_TYPE;
3203 MATCH ();
3204 break;
3206 case STATIC:
3207 sc = SC_STATIC;
3208 MATCH ();
3209 break;
3211 case INT: case CHAR: case LONG: case UNSIGNED:
3212 case SIGNED: case CONST: case DOUBLE: case VOID:
3213 case SHORT: case VOLATILE: case BOOL: case WCHAR:
3214 MATCH ();
3215 break;
3217 case CLASS: case STRUCT: case UNION:
3218 /* This is for the case `STARTWRAP class X : ...' or
3219 `declare (X, Y)\n class A : ...'. */
3220 if (id)
3222 free (id);
3223 return;
3226 case '=':
3227 /* Assumed to be the start of an initialization in this
3228 context. */
3229 skip_initializer ();
3230 break;
3232 case ',':
3233 add_declarator (&cls, &id, flags, sc);
3234 break;
3236 case OPERATOR:
3238 char *s = operator_name (&sc);
3239 id = (char *) xrealloc (id, strlen (s) + 1);
3240 strcpy (id, s);
3242 break;
3244 case T_INLINE:
3245 SET_FLAG (flags, F_INLINE);
3246 MATCH ();
3247 break;
3249 case '~':
3250 MATCH ();
3251 if (LOOKING_AT (IDENT))
3253 id = (char *) xrealloc (id, strlen (yytext) + 2);
3254 *id = '~';
3255 strcpy (id + 1, yytext);
3256 MATCH ();
3258 break;
3260 case IDENT:
3261 cls = parse_qualified_ident_or_type (&id);
3262 break;
3264 case '(':
3265 /* Most probably the beginning of a parameter list. */
3266 if (cls)
3268 MATCH ();
3270 if (id && cls)
3272 if (!(is_constructor = streq (id, cls->name)))
3273 regexp = matching_regexp ();
3275 else
3276 is_constructor = 0;
3278 pos = BUFFER_POS ();
3279 hash = parm_list (&flags);
3281 if (is_constructor)
3282 regexp = matching_regexp ();
3284 if (id && cls)
3285 add_member_defn (cls, id, regexp, pos, hash, 0,
3286 SC_UNKNOWN, flags);
3288 else
3290 /* This may be a C functions, but also a macro
3291 call of the form `declare (A, B)' --- such macros
3292 can be found in some class libraries. */
3293 MATCH ();
3295 if (id)
3297 regexp = matching_regexp ();
3298 pos = BUFFER_POS ();
3299 hash = parm_list (&flags);
3300 add_global_decl (id, regexp, pos, hash, 0, sc, flags);
3303 /* This is for the case that the function really is
3304 a macro with no `;' following it. If a CLASS directly
3305 follows, we would miss it otherwise. */
3306 if (LOOKING_AT3 (CLASS, STRUCT, UNION))
3307 return;
3310 while (!LOOKING_AT3 (';', '{', YYEOF))
3311 MATCH ();
3313 if (!cls && id && LOOKING_AT ('{'))
3314 add_global_defn (id, regexp, pos, hash, 0, sc, flags);
3316 free (id);
3317 id = NULL;
3318 break;
3322 add_declarator (&cls, &id, flags, sc);
3326 /* Parse a list of top-level declarations/definitions. START_FLAGS
3327 says in which context we are parsing. If it is F_EXTERNC, we are
3328 parsing in an `extern "C"' block. Value is 1 if EOF is reached, 0
3329 otherwise. */
3332 globals (int start_flags)
3334 int anonymous;
3335 int class_tk;
3336 int flags = start_flags;
3338 for (;;)
3340 char *prev_in = in;
3342 switch (LA1)
3344 case NAMESPACE:
3346 MATCH ();
3348 if (LOOKING_AT (IDENT))
3350 char *namespace_name = xstrdup (yytext);
3351 MATCH ();
3353 if (LOOKING_AT ('='))
3355 struct link *qna = match_qualified_namespace_alias ();
3356 if (qna)
3357 register_namespace_alias (namespace_name, qna);
3359 if (skip_to (';') == ';')
3360 MATCH ();
3362 else if (LOOKING_AT ('{'))
3364 MATCH ();
3365 enter_namespace (namespace_name);
3366 globals (0);
3367 leave_namespace ();
3368 MATCH_IF ('}');
3371 free (namespace_name);
3374 break;
3376 case EXTERN:
3377 MATCH ();
3378 if (LOOKING_AT (CSTRING) && *string_start == 'C'
3379 && *(string_start + 1) == '"')
3381 /* This is `extern "C"'. */
3382 MATCH ();
3384 if (LOOKING_AT ('{'))
3386 MATCH ();
3387 globals (F_EXTERNC);
3388 MATCH_IF ('}');
3390 else
3391 SET_FLAG (flags, F_EXTERNC);
3393 break;
3395 case TEMPLATE:
3396 MATCH ();
3397 SKIP_MATCHING_IF ('<');
3398 SET_FLAG (flags, F_TEMPLATE);
3399 break;
3401 case CLASS: case STRUCT: case UNION:
3402 class_tk = LA1;
3403 MATCH ();
3404 anonymous = 1;
3406 /* More than one ident here to allow for MS-DOS and OS/2
3407 specialties like `far', `_Export' etc. Some C++ libs
3408 have constructs like `_OS_DLLIMPORT(_OS_CLIENT)' in front
3409 of the class name. */
3410 while (!LOOKING_AT4 (YYEOF, ';', ':', '{'))
3412 if (LOOKING_AT (IDENT))
3413 anonymous = 0;
3414 MATCH ();
3417 /* Don't add anonymous unions. */
3418 if (LOOKING_AT2 (':', '{') && !anonymous)
3419 class_definition (NULL, class_tk, flags, 0);
3420 else
3422 if (skip_to (';') == ';')
3423 MATCH ();
3426 flags = start_flags;
3427 break;
3429 case YYEOF:
3430 return 1;
3432 case '}':
3433 return 0;
3435 default:
3436 declaration (flags);
3437 flags = start_flags;
3438 break;
3441 if (prev_in == in)
3442 yyerror ("parse error", NULL);
3447 /* Parse the current input file. */
3449 void
3450 yyparse (void)
3452 while (globals (0) == 0)
3453 MATCH_IF ('}');
3458 /***********************************************************************
3459 Main Program
3460 ***********************************************************************/
3462 /* Add the list of paths PATH_LIST to the current search path for
3463 input files. */
3465 void
3466 add_search_path (char *path_list)
3468 while (*path_list)
3470 char *start = path_list;
3471 struct search_path *p;
3473 while (*path_list && *path_list != PATH_LIST_SEPARATOR)
3474 ++path_list;
3476 p = (struct search_path *) xmalloc (sizeof *p);
3477 p->path = (char *) xmalloc (path_list - start + 1);
3478 memcpy (p->path, start, path_list - start);
3479 p->path[path_list - start] = '\0';
3480 p->next = NULL;
3482 if (search_path_tail)
3484 search_path_tail->next = p;
3485 search_path_tail = p;
3487 else
3488 search_path = search_path_tail = p;
3490 while (*path_list == PATH_LIST_SEPARATOR)
3491 ++path_list;
3496 /* Open FILE and return a file handle for it, or -1 if FILE cannot be
3497 opened. Try to find FILE in search_path first, then try the
3498 unchanged file name. */
3500 FILE *
3501 open_file (char *file)
3503 FILE *fp = NULL;
3504 static char *buffer;
3505 static int buffer_size;
3506 struct search_path *path;
3507 int flen = strlen (file) + 1; /* +1 for the slash */
3509 filename = xstrdup (file);
3511 for (path = search_path; path && fp == NULL; path = path->next)
3513 int len = strlen (path->path) + flen;
3515 if (len + 1 >= buffer_size)
3517 buffer_size = max (len + 1, 2 * buffer_size);
3518 buffer = (char *) xrealloc (buffer, buffer_size);
3521 strcpy (buffer, path->path);
3522 strcat (buffer, "/");
3523 strcat (buffer, file);
3524 fp = fopen (buffer, "r");
3527 /* Try the original file name. */
3528 if (fp == NULL)
3529 fp = fopen (file, "r");
3531 if (fp == NULL)
3532 yyerror ("cannot open", NULL);
3534 return fp;
3538 /* Display usage information and exit program. */
3540 #define USAGE "\
3541 Usage: ebrowse [options] {files}\n\
3543 -a, --append append output to existing file\n\
3544 -f, --files=FILES read input file names from FILE\n\
3545 -I, --search-path=LIST set search path for input files\n\
3546 -m, --min-regexp-length=N set minimum regexp length to N\n\
3547 -M, --max-regexp-length=N set maximum regexp length to N\n\
3548 -n, --no-nested-classes exclude nested classes\n\
3549 -o, --output-file=FILE set output file name to FILE\n\
3550 -p, --position-info print info about position in file\n\
3551 -s, --no-structs-or-unions don't record structs or unions\n\
3552 -v, --verbose be verbose\n\
3553 -V, --very-verbose be very verbose\n\
3554 -x, --no-regexps don't record regular expressions\n\
3555 --help display this help\n\
3556 --version display version info\n\
3559 void
3560 usage (int error)
3562 puts (USAGE);
3563 exit (error ? EXIT_FAILURE : EXIT_SUCCESS);
3567 /* Display version and copyright info. The VERSION macro is set
3568 from config.h and contains the Emacs version. */
3570 #ifndef VERSION
3571 # define VERSION "21"
3572 #endif
3574 void
3575 version (void)
3577 /* Makes it easier to update automatically. */
3578 char emacs_copyright[] = "Copyright (C) 2011 Free Software Foundation, Inc.";
3580 printf ("ebrowse %s\n", VERSION);
3581 puts (emacs_copyright);
3582 puts ("This program is distributed under the same terms as Emacs.");
3583 exit (EXIT_SUCCESS);
3587 /* Parse one input file FILE, adding classes and members to the symbol
3588 table. */
3590 void
3591 process_file (char *file)
3593 FILE *fp;
3595 fp = open_file (file);
3596 if (fp)
3598 int nread, nbytes;
3600 /* Give a progress indication if needed. */
3601 if (f_very_verbose)
3603 puts (filename);
3604 fflush (stdout);
3606 else if (f_verbose)
3608 putchar ('.');
3609 fflush (stdout);
3612 /* Read file to inbuffer. */
3613 for (nread = 0;;)
3615 if (nread + READ_CHUNK_SIZE >= inbuffer_size)
3617 inbuffer_size = nread + READ_CHUNK_SIZE + 1;
3618 inbuffer = (char *) xrealloc (inbuffer, inbuffer_size);
3621 nbytes = fread (inbuffer + nread, 1, READ_CHUNK_SIZE, fp);
3622 if (nbytes <= 0)
3623 break;
3624 nread += nbytes;
3626 if (nread < 0)
3627 nread = 0;
3628 inbuffer[nread] = '\0';
3630 /* Reinitialize scanner and parser for the new input file. */
3631 re_init_scanner ();
3632 re_init_parser ();
3634 /* Parse it and close the file. */
3635 yyparse ();
3636 fclose (fp);
3641 /* Read a line from stream FP and return a pointer to a static buffer
3642 containing its contents without the terminating newline. Value
3643 is null when EOF is reached. */
3645 char *
3646 read_line (FILE *fp)
3648 static char *buffer;
3649 static int buffer_size;
3650 int i = 0, c;
3652 while ((c = getc (fp)) != EOF && c != '\n')
3654 if (i >= buffer_size)
3656 buffer_size = max (100, buffer_size * 2);
3657 buffer = (char *) xrealloc (buffer, buffer_size);
3660 buffer[i++] = c;
3663 if (c == EOF && i == 0)
3664 return NULL;
3666 if (i == buffer_size)
3668 buffer_size = max (100, buffer_size * 2);
3669 buffer = (char *) xrealloc (buffer, buffer_size);
3672 buffer[i] = '\0';
3673 if (i > 0 && buffer[i - 1] == '\r')
3674 buffer[i - 1] = '\0';
3675 return buffer;
3679 /* Main entry point. */
3682 main (int argc, char **argv)
3684 int i;
3685 int any_inputfiles = 0;
3686 static const char *out_filename = DEFAULT_OUTFILE;
3687 static char **input_filenames = NULL;
3688 static int input_filenames_size = 0;
3689 static int n_input_files;
3691 filename = "command line";
3692 yyout = stdout;
3694 while ((i = getopt_long (argc, argv, "af:I:m:M:no:p:svVx",
3695 options, NULL)) != EOF)
3697 switch (i)
3699 /* Experimental. */
3700 case 'p':
3701 info_position = atoi (optarg);
3702 break;
3704 case 'n':
3705 f_nested_classes = 0;
3706 break;
3708 case 'x':
3709 f_regexps = 0;
3710 break;
3712 /* Add the name of a file containing more input files. */
3713 case 'f':
3714 if (n_input_files == input_filenames_size)
3716 input_filenames_size = max (10, 2 * input_filenames_size);
3717 input_filenames = (char **) xrealloc ((void *)input_filenames,
3718 input_filenames_size);
3720 input_filenames[n_input_files++] = xstrdup (optarg);
3721 break;
3723 /* Append new output to output file instead of truncating it. */
3724 case 'a':
3725 f_append = 1;
3726 break;
3728 /* Include structs in the output */
3729 case 's':
3730 f_structs = 0;
3731 break;
3733 /* Be verbose (give a progress indication). */
3734 case 'v':
3735 f_verbose = 1;
3736 break;
3738 /* Be very verbose (print file names as they are processed). */
3739 case 'V':
3740 f_verbose = 1;
3741 f_very_verbose = 1;
3742 break;
3744 /* Change the name of the output file. */
3745 case 'o':
3746 out_filename = optarg;
3747 break;
3749 /* Set minimum length for regular expression strings
3750 when recorded in the output file. */
3751 case 'm':
3752 min_regexp = atoi (optarg);
3753 break;
3755 /* Set maximum length for regular expression strings
3756 when recorded in the output file. */
3757 case 'M':
3758 max_regexp = atoi (optarg);
3759 break;
3761 /* Add to search path. */
3762 case 'I':
3763 add_search_path (optarg);
3764 break;
3766 /* Display help */
3767 case -2:
3768 usage (0);
3769 break;
3771 case -3:
3772 version ();
3773 break;
3777 /* Call init_scanner after command line flags have been processed to be
3778 able to add keywords depending on command line (not yet
3779 implemented). */
3780 init_scanner ();
3781 init_sym ();
3783 /* Open output file */
3784 if (*out_filename)
3786 if (f_append)
3788 /* Check that the file to append to exists, and is not
3789 empty. More specifically, it should be a valid file
3790 produced by a previous run of ebrowse, but that's too
3791 difficult to check. */
3792 FILE *fp;
3793 int rc;
3795 fp = fopen (out_filename, "r");
3796 if (fp == NULL)
3798 yyerror ("file `%s' must exist for --append", out_filename);
3799 exit (EXIT_FAILURE);
3802 rc = fseek (fp, 0, SEEK_END);
3803 if (rc == -1)
3805 yyerror ("error seeking in file `%s'", out_filename);
3806 exit (EXIT_FAILURE);
3809 rc = ftell (fp);
3810 if (rc == -1)
3812 yyerror ("error getting size of file `%s'", out_filename);
3813 exit (EXIT_FAILURE);
3816 else if (rc == 0)
3818 yyerror ("file `%s' is empty", out_filename);
3819 /* It may be ok to use an empty file for appending.
3820 exit (EXIT_FAILURE); */
3823 fclose (fp);
3826 yyout = fopen (out_filename, f_append ? "a" : "w");
3827 if (yyout == NULL)
3829 yyerror ("cannot open output file `%s'", out_filename);
3830 exit (EXIT_FAILURE);
3834 /* Process input files specified on the command line. */
3835 while (optind < argc)
3837 process_file (argv[optind++]);
3838 any_inputfiles = 1;
3841 /* Process files given on stdin if no files specified. */
3842 if (!any_inputfiles && n_input_files == 0)
3844 char *file;
3845 while ((file = read_line (stdin)) != NULL)
3846 process_file (file);
3848 else
3850 /* Process files from `--files=FILE'. Every line in FILE names
3851 one input file to process. */
3852 for (i = 0; i < n_input_files; ++i)
3854 FILE *fp = fopen (input_filenames[i], "r");
3856 if (fp == NULL)
3857 yyerror ("cannot open input file `%s'", input_filenames[i]);
3858 else
3860 char *file;
3861 while ((file = read_line (fp)) != NULL)
3862 process_file (file);
3863 fclose (fp);
3868 /* Write output file. */
3869 dump_roots (yyout);
3871 /* Close output file. */
3872 if (yyout != stdout)
3873 fclose (yyout);
3875 return EXIT_SUCCESS;
3878 /* ebrowse.c ends here */