HCoop / bpt / emacs.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
(next-line): Don't let `newline' expand abbrevs.
[bpt/emacs.git] / lib-src / ebrowse.c
CommitLineData
be0dbdab
GM		 1/* ebrowse.c --- parsing files for the ebrowse C++ browser
2
e6a0814f
GM		 3 Copyright (C) 1992,92,94,95,96,97,98,99,2000,2001
4 Free Software Foundation Inc.
be0dbdab
GM		 5
6 Author: Gerd Moellmann <gerd@gnu.org>
7 Maintainer: FSF
8
9 This file is part of GNU Emacs.
10
11 GNU Emacs is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2, or (at your option)
14 any later version.
15
16 GNU Emacs is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
20
21 You should have received a copy of the GNU General Public License
22 along with GNU Emacs; see the file COPYING. If not, write to
23 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
24
53245ee2
DL		 25#ifdef HAVE_CONFIG_H
26#include <config.h>
27#endif
28
be0dbdab
GM		 29#include <stdio.h>
30#include <stdlib.h>
31#include <string.h>
32#include <ctype.h>
33#include <assert.h>
34#include "getopt.h"
35
be0dbdab
GM		 36/* Conditionalize function prototypes. */
37
38#ifdef PROTOTYPES /* From config.h. */
39#define P_(x) x
40#else
41#define P_(x) ()
42#endif
43
44/* Value is non-zero if strings X and Y compare equal. */
45
46#define streq(X, Y) (*(X) == *(Y) && strcmp ((X) + 1, (Y) + 1) == 0)
47
48/* The ubiquitous `max' and `min' macros. */
49
50#ifndef max
51#define max(X, Y) ((X) > (Y) ? (X) : (Y))
52#define min(X, Y) ((X) < (Y) ? (X) : (Y))
53#endif
54
55/* Files are read in chunks of this number of bytes. */
56
57#define READ_CHUNK_SIZE (100 * 1024)
58
59/* The character used as a separator in path lists (like $PATH). */
60
94549912 61#if defined(__MSDOS__)
fd72561d
EZ		 62#define PATH_LIST_SEPARATOR ';'
63#define FILENAME_EQ(X,Y) (strcasecmp(X,Y) == 0)
64#else
94549912
JR		 65#if defined(WINDOWSNT)
66#define PATH_LIST_SEPARATOR ';'
67#define FILENAME_EQ(X,Y) (stricmp(X,Y) == 0)
68#else
be0dbdab 69#define PATH_LIST_SEPARATOR ':'
fd72561d
EZ		 70#define FILENAME_EQ(X,Y) (streq(X,Y))
71#endif
94549912 72#endif
be0dbdab
GM		 73/* The default output file name. */
74
42eaac21 75#define DEFAULT_OUTFILE "BROWSE"
be0dbdab
GM		 76
77/* A version string written to the output file. Change this whenever
78 the structure of the output file changes. */
79
80#define EBROWSE_FILE_VERSION "ebrowse 5.0"
81
82/* The output file consists of a tree of Lisp objects, with major
83 nodes built out of Lisp structures. These are the heads of the
84 Lisp structs with symbols identifying their type. */
85
86#define TREE_HEADER_STRUCT "[ebrowse-hs "
87#define TREE_STRUCT "[ebrowse-ts "
88#define MEMBER_STRUCT "[ebrowse-ms "
89#define BROWSE_STRUCT "[ebrowse-bs "
90#define CLASS_STRUCT "[ebrowse-cs "
91
92/* The name of the symbol table entry for global functions, variables,
93 defines etc. This name also appears in the browser display. */
94
95#define GLOBALS_NAME "*Globals*"
96
97/* Token definitions. */
98
99enum token
100{
101 YYEOF = 0, /* end of file */
102 CSTRING = 256, /* string constant */
103 CCHAR, /* character constant */
104 CINT, /* integral constant */
105 CFLOAT, /* real constant */
106
107 ELLIPSIS, /* ... */
108 LSHIFTASGN, /* <<= */
109 RSHIFTASGN, /* >>= */
110 ARROWSTAR, /* ->* */
111 IDENT, /* identifier */
112 DIVASGN, /* /= */
113 INC, /* ++ */
114 ADDASGN, /* += */
115 DEC, /* -- */
116 ARROW, /* -> */
117 SUBASGN, /* -= */
118 MULASGN, /* *= */
119 MODASGN, /* %= */
120 LOR, /* || */
121 ORASGN, /* |= */
122 LAND, /* && */
123 ANDASGN, /* &= */
124 XORASGN, /* ^= */
125 POINTSTAR, /* .* */
126 DCOLON, /* :: */
127 EQ, /* == */
128 NE, /* != */
129 LE, /* <= */
130 LSHIFT, /* << */
131 GE, /* >= */
132 RSHIFT, /* >> */
133
134/* Keywords. The undef's are there because these
135 three symbols are very likely to be defined somewhere. */
136#undef BOOL
137#undef TRUE
138#undef FALSE
139
140 ASM, /* asm */
141 AUTO, /* auto */
142 BREAK, /* break */
143 CASE, /* case */
144 CATCH, /* catch */
145 CHAR, /* char */
146 CLASS, /* class */
147 CONST, /* const */
148 CONTINUE, /* continue */
149 DEFAULT, /* default */
150 DELETE, /* delete */
151 DO, /* do */
152 DOUBLE, /* double */
153 ELSE, /* else */
154 ENUM, /* enum */
155 EXTERN, /* extern */
156 FLOAT, /* float */
157 FOR, /* for */
158 FRIEND, /* friend */
159 GOTO, /* goto */
160 IF, /* if */
161 T_INLINE, /* inline */
162 INT, /* int */
163 LONG, /* long */
164 NEW, /* new */
165 OPERATOR, /* operator */
166 PRIVATE, /* private */
167 PROTECTED, /* protected */
168 PUBLIC, /* public */
169 REGISTER, /* register */
170 RETURN, /* return */
171 SHORT, /* short */
172 SIGNED, /* signed */
173 SIZEOF, /* sizeof */
174 STATIC, /* static */
175 STRUCT, /* struct */
176 SWITCH, /* switch */
177 TEMPLATE, /* template */
178 THIS, /* this */
179 THROW, /* throw */
180 TRY, /* try */
181 TYPEDEF, /* typedef */
182 UNION, /* union */
183 UNSIGNED, /* unsigned */
184 VIRTUAL, /* virtual */
185 VOID, /* void */
186 VOLATILE, /* volatile */
187 WHILE, /* while */
188 MUTABLE, /* mutable */
189 BOOL, /* bool */
190 TRUE, /* true */
191 FALSE, /* false */
192 SIGNATURE, /* signature (GNU extension) */
193 NAMESPACE, /* namespace */
194 EXPLICIT, /* explicit */
195 TYPENAME, /* typename */
196 CONST_CAST, /* const_cast */
197 DYNAMIC_CAST, /* dynamic_cast */
198 REINTERPRET_CAST, /* reinterpret_cast */
199 STATIC_CAST, /* static_cast */
200 TYPEID, /* typeid */
201 USING, /* using */
202 WCHAR /* wchar_t */
203};
204
205/* Storage classes, in a wider sense. */
206
207enum sc
208{
209 SC_UNKNOWN,
210 SC_MEMBER, /* Is an instance member. */
211 SC_STATIC, /* Is static member. */
212 SC_FRIEND, /* Is friend function. */
213 SC_TYPE /* Is a type definition. */
214};
215
216/* Member visibility. */
217
218enum visibility
219{
220 V_PUBLIC,
221 V_PROTECTED,
222 V_PRIVATE
223};
224
225/* Member flags. */
226
227#define F_VIRTUAL 1 /* Is virtual function. */
228#define F_INLINE 2 /* Is inline function. */
229#define F_CONST 4 /* Is const. */
230#define F_PURE 8 /* Is pure virtual function. */
231#define F_MUTABLE 16 /* Is mutable. */
232#define F_TEMPLATE 32 /* Is a template. */
233#define F_EXPLICIT 64 /* Is explicit constructor. */
234#define F_THROW 128 /* Has a throw specification. */
235#define F_EXTERNC 256 /* Is declared extern "C". */
236#define F_DEFINE 512 /* Is a #define. */
237
238/* Two macros to set and test a bit in an int. */
239
240#define SET_FLAG(F, FLAG) ((F) |= (FLAG))
241#define HAS_FLAG(F, FLAG) (((F) & (FLAG)) != 0)
242
243/* Structure describing a class member. */
244
245struct member
246{
247 struct member *next; /* Next in list of members. */
248 struct member *anext; /* Collision chain in member_table. */
249 struct member **list; /* Pointer to list in class. */
250 unsigned param_hash; /* Hash value for parameter types. */
251 int vis; /* Visibility (public, ...). */
252 int flags; /* See F_* above. */
253 char *regexp; /* Matching regular expression. */
254 char *filename; /* Don't free this shared string. */
255 int pos; /* Buffer position of occurrence. */
256 char *def_regexp; /* Regular expression matching definition. */
257 char *def_filename; /* File name of definition. */
258 int def_pos; /* Buffer position of definition. */
259 char name[1]; /* Member name. */
260};
261
262/* Structures of this type are used to connect class structures with
263 their super and subclasses. */
264
265struct link
266{
267 struct sym *sym; /* The super or subclass. */
268 struct link *next; /* Next in list or NULL. */
269};
270
271/* Structure used to record namespace aliases. */
272
273struct alias
274{
275 struct alias *next; /* Next in list. */
276 char name[1]; /* Alias name. */
277};
278
279/* The structure used to describe a class in the symbol table,
280 or a namespace in all_namespaces. */
281
282struct sym
283{
284 int flags; /* Is class a template class?. */
285 unsigned char visited; /* Used to find circles. */
286 struct sym *next; /* Hash collision list. */
287 struct link *subs; /* List of subclasses. */
288 struct link *supers; /* List of superclasses. */
289 struct member *vars; /* List of instance variables. */
290 struct member *fns; /* List of instance functions. */
291 struct member *static_vars; /* List of static variables. */
292 struct member *static_fns; /* List of static functions. */
293 struct member *friends; /* List of friend functions. */
294 struct member *types; /* List of local types. */
295 char *regexp; /* Matching regular expression. */
296 int pos; /* Buffer position. */
297 char *filename; /* File in which it can be found. */
298 char *sfilename; /* File in which members can be found. */
299 struct sym *namesp; /* Namespace in which defined. . */
300 struct alias *namesp_aliases; /* List of aliases for namespaces. */
301 char name[1]; /* Name of the class. */
302};
303
304/* Experimental: Print info for `--position-info'. We print
305 '(CLASS-NAME SCOPE MEMBER-NAME). */
306
307#define P_DEFN 1
308#define P_DECL 2
309
310int info_where;
311struct sym *info_cls = NULL;
312struct member *info_member = NULL;
313
314/* Experimental. For option `--position-info', the buffer position we
315 are interested in. When this position is reached, print out
316 information about what we know about that point. */
317
318int info_position = -1;
319
320/* Command line options structure for getopt_long. */
321
322struct option options[] =
323{
324 {"append", no_argument, NULL, 'a'},
325 {"files", required_argument, NULL, 'f'},
326 {"help", no_argument, NULL, -2},
327 {"min-regexp-length", required_argument, NULL, 'm'},
328 {"max-regexp-length", required_argument, NULL, 'M'},
329 {"no-nested-classes", no_argument, NULL, 'n'},
330 {"no-regexps", no_argument, NULL, 'x'},
331 {"no-structs-or-unions", no_argument, NULL, 's'},
332 {"output-file", required_argument, NULL, 'o'},
333 {"position-info", required_argument, NULL, 'p'},
334 {"search-path", required_argument, NULL, 'I'},
335 {"verbose", no_argument, NULL, 'v'},
336 {"version", no_argument, NULL, -3},
337 {"very-verbose", no_argument, NULL, 'V'},
338 {NULL, 0, NULL, 0}
339};
340
341/* Semantic values of tokens. Set by yylex.. */
342
343unsigned yyival; /* Set for token CINT. */
344char *yytext; /* Set for token IDENT. */
345char *yytext_end;
346
347/* Output file. */
348
349FILE *yyout;
350
351/* Current line number. */
352
353int yyline;
354
355/* The name of the current input file. */
356
357char *filename;
358
359/* Three character class vectors, and macros to test membership
360 of characters. */
361
362char is_ident[255];
363char is_digit[255];
364char is_white[255];
365
366#define IDENTP(C) is_ident[(unsigned char) (C)]
367#define DIGITP(C) is_digit[(unsigned char) (C)]
368#define WHITEP(C) is_white[(unsigned char) (C)]
369
370/* Command line flags. */
371
372int f_append;
373int f_verbose;
374int f_very_verbose;
375int f_structs = 1;
376int f_regexps = 1;
377int f_nested_classes = 1;
378
379/* Maximum and minimum lengths of regular expressions matching a
380 member, class etc., for writing them to the output file. These are
381 overridable from the command line. */
382
383int min_regexp = 5;
384int max_regexp = 50;
385
386/* Input buffer. */
387
388char *inbuffer;
389char *in;
390int inbuffer_size;
391
392/* Return the current buffer position in the input file. */
393
394#define BUFFER_POS() (in - inbuffer)
395
396/* If current lookahead is CSTRING, the following points to the
397 first character in the string constant. Used for recognizing
398 extern "C". */
399
400char *string_start;
401
402/* The size of the hash tables for classes.and members. Should be
403 prime. */
404
405#define TABLE_SIZE 1001
406
407/* The hash table for class symbols. */
408
409struct sym *class_table[TABLE_SIZE];
410
411/* Hash table containing all member structures. This is generally
412 faster for member lookup than traversing the member lists of a
413 `struct sym'. */
414
415struct member *member_table[TABLE_SIZE];
416
417/* The special class symbol used to hold global functions,
418 variables etc. */
419
420struct sym *global_symbols;
421
422/* The current namespace. */
423
424struct sym *current_namespace;
425
426/* The list of all known namespaces. */
427
428struct sym *all_namespaces;
429
430/* Stack of namespaces we're currently nested in, during the parse. */
431
432struct sym **namespace_stack;
433int namespace_stack_size;
434int namespace_sp;
435
436/* The current lookahead token. */
437
438int tk = -1;
439
440/* Structure describing a keyword. */
441
442struct kw
443{
444 char *name; /* Spelling. */
445 int tk; /* Token value. */
446 struct kw *next; /* Next in collision chain. */
447};
448
449/* Keywords are lookup up in a hash table of their own. */
450
451#define KEYWORD_TABLE_SIZE 1001
452struct kw *keyword_table[KEYWORD_TABLE_SIZE];
453
454/* Search path. */
455
456struct search_path
457{
458 char *path;
459 struct search_path *next;
460};
461
462struct search_path *search_path;
463struct search_path *search_path_tail;
464
465/* Function prototypes. */
466
467int yylex P_ ((void));
468void yyparse P_ ((void));
469void re_init_parser P_ ((void));
470char *token_string P_ ((int));
471char *matching_regexp P_ ((void));
472void init_sym P_ ((void));
473struct sym *add_sym P_ ((char *, struct sym *));
474void add_link P_ ((struct sym *, struct sym *));
475void add_member_defn P_ ((struct sym *, char *, char *,
476 int, unsigned, int, int, int));
477void add_member_decl P_ ((struct sym *, char *, char *, int,
478 unsigned, int, int, int, int));
479void dump_roots P_ ((FILE *));
c43a1ff6 480void *xmalloc P_ ((int));
57b4c82e 481void xfree P_ ((void *));
be0dbdab
GM		 482void add_global_defn P_ ((char *, char *, int, unsigned, int, int, int));
483void add_global_decl P_ ((char *, char *, int, unsigned, int, int, int));
484void add_define P_ ((char *, char *, int));
485void mark_inherited_virtual P_ ((void));
486void leave_namespace P_ ((void));
487void enter_namespace P_ ((char *));
488void register_namespace_alias P_ ((char *, char *));
489void insert_keyword P_ ((char *, int));
490void re_init_scanner P_ ((void));
491void init_scanner P_ ((void));
492void usage P_ ((int));
493void version P_ ((void));
494void process_file P_ ((char *));
495void add_search_path P_ ((char *));
496FILE *open_file P_ ((char *));
497int process_pp_line P_ ((void));
498int dump_members P_ ((FILE *, struct member *));
499void dump_sym P_ ((FILE *, struct sym *));
500int dump_tree P_ ((FILE *, struct sym *));
501struct member *find_member P_ ((struct sym *, char *, int, int, unsigned));
502struct member *add_member P_ ((struct sym *, char *, int, int, unsigned));
503void mark_virtual P_ ((struct sym *));
504void mark_virtual P_ ((struct sym *));
505struct sym *make_namespace P_ ((char *));
506char *sym_scope P_ ((struct sym *));
507char *sym_scope_1 P_ ((struct sym *));
508int skip_to P_ ((int));
509void skip_matching P_ ((void));
510void member P_ ((struct sym *, int));
511void class_body P_ ((struct sym *, int));
512void class_definition P_ ((struct sym *, int, int, int));
8bef35f2 513void declaration P_ ((int));
be0dbdab
GM		 514unsigned parm_list P_ ((int *));
515char *operator_name P_ ((int *));
516struct sym *parse_classname P_ ((void));
517struct sym *parse_qualified_ident_or_type P_ ((char **));
518void parse_qualified_param_ident_or_type P_ ((char **));
519int globals P_ ((int));
e6a0814f 520void yyerror P_ ((char *, char *));
be0dbdab
GM		 521
522
523\f
524/***********************************************************************
525 Utilities
526 ***********************************************************************/
527
528/* Print an error in a printf-like style with the current input file
529 name and line number. */
530
531void
e6a0814f
GM		 532yyerror (format, s)
533 char *format, *s;
be0dbdab
GM		 534{
535 fprintf (stderr, "%s:%d: ", filename, yyline);
e6a0814f 536 fprintf (stderr, format, s);
be0dbdab
GM		 537 putc ('\n', stderr);
538}
539
540
541/* Like malloc but print an error and exit if not enough memory is
38748aca 542 available. */
be0dbdab
GM		 543
544void *
c43a1ff6 545xmalloc (nbytes)
be0dbdab
GM		 546 int nbytes;
547{
548 void *p = malloc (nbytes);
8bef35f2
GM		 549 if (p == NULL)
550 {
e6a0814f 551 yyerror ("out of memory", NULL);
8bef35f2
GM		 552 exit (1);
553 }
554 return p;
be0dbdab
GM		 555}
556
557
558/* Like realloc but print an error and exit if out of memory. */
559
560void *
c43a1ff6 561xrealloc (p, sz)
be0dbdab
GM		 562 void *p;
563 int sz;
564{
565 p = realloc (p, sz);
8bef35f2
GM		 566 if (p == NULL)
567 {
e6a0814f 568 yyerror ("out of memory", NULL);
8bef35f2
GM		 569 exit (1);
570 }
571 return p;
be0dbdab
GM		 572}
573
574
57b4c82e
GM		 575/* Like free but always check for null pointers.. */
576
577void
578xfree (p)
579 void *p;
580{
581 if (p)
582 free (p);
583}
584
585
be0dbdab
GM		 586/* Like strdup, but print an error and exit if not enough memory is
587 available.. If S is null, return null. */
588
589char *
590xstrdup (s)
591 char *s;
592{
593 if (s)
c43a1ff6 594 s = strcpy (xmalloc (strlen (s) + 1), s);
be0dbdab
GM		 595 return s;
596}
597
598
599\f
600/***********************************************************************
601 Symbols
602 ***********************************************************************/
603
604/* Initialize the symbol table. This currently only sets up the
605 special symbol for globals (`*Globals*'). */
606
607void
608init_sym ()
609{
610 global_symbols = add_sym (GLOBALS_NAME, NULL);
611}
612
613
614/* Add a symbol for class NAME to the symbol table. NESTED_IN_CLASS
615 is the class in which class NAME was found. If it is null,
616 this means the scope of NAME is the current namespace.
617
618 If a symbol for NAME already exists, return that. Otherwise
619 create a new symbol and set it to default values. */
620
621struct sym *
622add_sym (name, nested_in_class)
623 char *name;
624 struct sym *nested_in_class;
625{
626 struct sym *sym;
627 unsigned h;
628 char *s;
629 struct sym *scope = nested_in_class ? nested_in_class : current_namespace;
630
631 for (s = name, h = 0; *s; ++s)
632 h = (h << 1) ^ *s;
633 h %= TABLE_SIZE;
634
635 for (sym = class_table[h]; sym; sym = sym->next)
636 if (streq (name, sym->name) && sym->namesp == scope)
637 break;
638
639 if (sym == NULL)
640 {
641 if (f_very_verbose)
642 {
643 putchar ('\t');
644 puts (name);
645 }
646
c43a1ff6 647 sym = (struct sym *) xmalloc (sizeof *sym + strlen (name));
be0dbdab
GM		 648 bzero (sym, sizeof *sym);
649 strcpy (sym->name, name);
650 sym->namesp = scope;
651 sym->next = class_table[h];
652 class_table[h] = sym;
653 }
654
655 return sym;
656}
657
658
659/* Add links between superclass SUPER and subclass SUB. */
660
661void
662add_link (super, sub)
663 struct sym *super, *sub;
664{
665 struct link *lnk, *lnk2, *p, *prev;
666
667 /* See if a link already exists. */
668 for (p = super->subs, prev = NULL;
669 p && strcmp (sub->name, p->sym->name) > 0;
670 prev = p, p = p->next)
671 ;
672
673 /* Avoid duplicates. */
674 if (p == NULL || p->sym != sub)
675 {
c43a1ff6
GM		 676 lnk = (struct link *) xmalloc (sizeof *lnk);
677 lnk2 = (struct link *) xmalloc (sizeof *lnk2);
be0dbdab
GM		 678
679 lnk->sym = sub;
680 lnk->next = p;
681
682 if (prev)
683 prev->next = lnk;
684 else
685 super->subs = lnk;
686
687 lnk2->sym = super;
688 lnk2->next = sub->supers;
689 sub->supers = lnk2;
690 }
691}
692
693
694/* Find in class CLS member NAME.
695
696 VAR non-zero means look for a member variable; otherwise a function
697 is searched. SC specifies what kind of member is searched---a
698 static, or per-instance member etc. HASH is a hash code for the
699 parameter types of functions. Value is a pointer to the member
700 found or null if not found. */
701
702struct member *
703find_member (cls, name, var, sc, hash)
704 struct sym *cls;
705 char *name;
706 int var, sc;
707 unsigned hash;
708{
709 struct member **list;
710 struct member *p;
711 unsigned name_hash = 0;
712 char *s;
713 int i;
714
715 switch (sc)
716 {
717 case SC_FRIEND:
718 list = &cls->friends;
719 break;
720
721 case SC_TYPE:
722 list = &cls->types;
723 break;
724
725 case SC_STATIC:
726 list = var ? &cls->static_vars : &cls->static_fns;
727 break;
728
729 default:
730 list = var ? &cls->vars : &cls->fns;
731 break;
732 }
733
734 for (s = name; *s; ++s)
735 name_hash = (name_hash << 1) ^ *s;
736 i = name_hash % TABLE_SIZE;
737
738 for (p = member_table[i]; p; p = p->anext)
739 if (p->list == list && p->param_hash == hash && streq (name, p->name))
740 break;
741
742 return p;
743}
744
745
746/* Add to class CLS information for the declaration of member NAME.
747 REGEXP is a regexp matching the declaration, if non-null. POS is
748 the position in the source where the declaration is found. HASH is
749 a hash code for the parameter list of the member, if it's a
750 function. VAR non-zero means member is a variable or type. SC
751 specifies the type of member (instance member, static, ...). VIS
752 is the member's visibility (public, protected, private). FLAGS is
753 a bit set giving additional information about the member (see the
754 F_* defines). */
755
756void
757add_member_decl (cls, name, regexp, pos, hash, var, sc, vis, flags)
758 struct sym *cls;
759 char *name;
760 char *regexp;
761 int pos;
762 unsigned hash;
763 int var;
764 int sc;
765 int vis;
766 int flags;
767{
768 struct member *m;
769
770 m = find_member (cls, name, var, sc, hash);
771 if (m == NULL)
772 m = add_member (cls, name, var, sc, hash);
773
774 /* Have we seen a new filename? If so record that. */
fd72561d 775 if (!cls->filename || !FILENAME_EQ (cls->filename, filename))
be0dbdab
GM		 776 m->filename = filename;
777
778 m->regexp = regexp;
779 m->pos = pos;
780 m->flags = flags;
781
782 switch (vis)
783 {
784 case PRIVATE:
785 m->vis = V_PRIVATE;
786 break;
787
788 case PROTECTED:
789 m->vis = V_PROTECTED;
790 break;
791
792 case PUBLIC:
793 m->vis = V_PUBLIC;
794 break;
795 }
796
797 info_where = P_DECL;
798 info_cls = cls;
799 info_member = m;
800}
801
802
803/* Add to class CLS information for the definition of member NAME.
804 REGEXP is a regexp matching the declaration, if non-null. POS is
805 the position in the source where the declaration is found. HASH is
806 a hash code for the parameter list of the member, if it's a
807 function. VAR non-zero means member is a variable or type. SC
808 specifies the type of member (instance member, static, ...). VIS
809 is the member's visibility (public, protected, private). FLAGS is
810 a bit set giving additional information about the member (see the
811 F_* defines). */
812
813void
814add_member_defn (cls, name, regexp, pos, hash, var, sc, flags)
815 struct sym *cls;
816 char *name;
817 char *regexp;
818 int pos;
819 unsigned hash;
820 int var;
821 int sc;
822 int flags;
823{
824 struct member *m;
825
826 if (sc == SC_UNKNOWN)
827 {
828 m = find_member (cls, name, var, SC_MEMBER, hash);
829 if (m == NULL)
830 {
831 m = find_member (cls, name, var, SC_STATIC, hash);
832 if (m == NULL)
833 m = add_member (cls, name, var, sc, hash);
834 }
835 }
836 else
837 {
838 m = find_member (cls, name, var, sc, hash);
839 if (m == NULL)
840 m = add_member (cls, name, var, sc, hash);
841 }
842
843 if (!cls->sfilename)
844 cls->sfilename = filename;
845
fd72561d 846 if (!FILENAME_EQ (cls->sfilename, filename))
be0dbdab
GM		 847 m->def_filename = filename;
848
849 m->def_regexp = regexp;
850 m->def_pos = pos;
851 m->flags |= flags;
852
853 info_where = P_DEFN;
854 info_cls = cls;
855 info_member = m;
856}
857
858
859/* Add a symbol for a define named NAME to the symbol table.
860 REGEXP is a regular expression matching the define in the source,
861 if it is non-null. POS is the position in the file. */
862
863void
864add_define (name, regexp, pos)
865 char *name, *regexp;
866 int pos;
867{
868 add_global_defn (name, regexp, pos, 0, 1, SC_FRIEND, F_DEFINE);
869 add_global_decl (name, regexp, pos, 0, 1, SC_FRIEND, F_DEFINE);
870}
871
872
873/* Add information for the global definition of NAME.
874 REGEXP is a regexp matching the declaration, if non-null. POS is
875 the position in the source where the declaration is found. HASH is
876 a hash code for the parameter list of the member, if it's a
877 function. VAR non-zero means member is a variable or type. SC
878 specifies the type of member (instance member, static, ...). VIS
879 is the member's visibility (public, protected, private). FLAGS is
880 a bit set giving additional information about the member (see the
881 F_* defines). */
882
883void
884add_global_defn (name, regexp, pos, hash, var, sc, flags)
885 char *name, *regexp;
886 int pos;
887 unsigned hash;
888 int var;
889 int sc;
890 int flags;
891{
892 int i;
893 struct sym *sym;
894
895 /* Try to find out for which classes a function is a friend, and add
896 what we know about it to them. */
897 if (!var)
898 for (i = 0; i < TABLE_SIZE; ++i)
899 for (sym = class_table[i]; sym; sym = sym->next)
900 if (sym != global_symbols && sym->friends)
901 if (find_member (sym, name, 0, SC_FRIEND, hash))
902 add_member_defn (sym, name, regexp, pos, hash, 0,
903 SC_FRIEND, flags);
904
905 /* Add to global symbols. */
906 add_member_defn (global_symbols, name, regexp, pos, hash, var, sc, flags);
907}
908
909
910/* Add information for the global declaration of NAME.
911 REGEXP is a regexp matching the declaration, if non-null. POS is
912 the position in the source where the declaration is found. HASH is
913 a hash code for the parameter list of the member, if it's a
914 function. VAR non-zero means member is a variable or type. SC
915 specifies the type of member (instance member, static, ...). VIS
916 is the member's visibility (public, protected, private). FLAGS is
917 a bit set giving additional information about the member (see the
918 F_* defines). */
919
920void
921add_global_decl (name, regexp, pos, hash, var, sc, flags)
922 char *name, *regexp;
923 int pos;
924 unsigned hash;
925 int var;
926 int sc;
927 int flags;
928{
929 /* Add declaration only if not already declared. Header files must
930 be processed before source files for this to have the right effect.
931 I do not want to handle implicit declarations at the moment. */
932 struct member *m;
933 struct member *found;
934
935 m = found = find_member (global_symbols, name, var, sc, hash);
936 if (m == NULL)
937 m = add_member (global_symbols, name, var, sc, hash);
938
939 /* Definition already seen => probably last declaration implicit.
940 Override. This means that declarations must always be added to
941 the symbol table before definitions. */
942 if (!found)
943 {
944 if (!global_symbols->filename
fd72561d 945 || !FILENAME_EQ (global_symbols->filename, filename))
be0dbdab
GM		 946 m->filename = filename;
947
948 m->regexp = regexp;
949 m->pos = pos;
950 m->vis = V_PUBLIC;
951 m->flags = flags;
952
953 info_where = P_DECL;
954 info_cls = global_symbols;
955 info_member = m;
956 }
957}
958
959
960/* Add a symbol for member NAME to class CLS.
961 VAR non-zero means it's a variable. SC specifies the kind of
962 member. HASH is a hash code for the parameter types of a function.
963 Value is a pointer to the member's structure. */
964
965struct member *
966add_member (cls, name, var, sc, hash)
967 struct sym *cls;
968 char *name;
969 int var;
970 int sc;
971 unsigned hash;
972{
c43a1ff6 973 struct member *m = (struct member *) xmalloc (sizeof *m + strlen (name));
be0dbdab
GM		 974 struct member **list;
975 struct member *p;
976 struct member *prev;
977 unsigned name_hash = 0;
978 int i;
979 char *s;
980
981 strcpy (m->name, name);
982 m->param_hash = hash;
983
984 m->vis = 0;
985 m->flags = 0;
986 m->regexp = NULL;
987 m->filename = NULL;
988 m->pos = 0;
989 m->def_regexp = NULL;
990 m->def_filename = NULL;
991 m->def_pos = 0;
992
993 assert (cls != NULL);
994
995 switch (sc)
996 {
997 case SC_FRIEND:
998 list = &cls->friends;
999 break;
1000
1001 case SC_TYPE:
1002 list = &cls->types;
1003 break;
1004
1005 case SC_STATIC:
1006 list = var ? &cls->static_vars : &cls->static_fns;
1007 break;
1008
1009 default:
1010 list = var ? &cls->vars : &cls->fns;
1011 break;
1012 }
1013
1014 for (s = name; *s; ++s)
1015 name_hash = (name_hash << 1) ^ *s;
1016 i = name_hash % TABLE_SIZE;
1017 m->anext = member_table[i];
1018 member_table[i] = m;
1019 m->list = list;
1020
1021 /* Keep the member list sorted. It's cheaper to do it here than to
1022 sort them in Lisp. */
1023 for (prev = NULL, p = *list;
1024 p && strcmp (name, p->name) > 0;
1025 prev = p, p = p->next)
1026 ;
1027
1028 m->next = p;
1029 if (prev)
1030 prev->next = m;
1031 else
1032 *list = m;
1033 return m;
1034}
1035
1036
1037/* Given the root R of a class tree, step through all subclasses
1038 recursively, marking functions as virtual that are declared virtual
1039 in base classes. */
1040
1041void
1042mark_virtual (r)
1043 struct sym *r;
1044{
1045 struct link *p;
1046 struct member *m, *m2;
1047
1048 for (p = r->subs; p; p = p->next)
1049 {
1050 for (m = r->fns; m; m = m->next)
1051 if (HAS_FLAG (m->flags, F_VIRTUAL))
1052 {
1053 for (m2 = p->sym->fns; m2; m2 = m2->next)
1054 if (m->param_hash == m2->param_hash && streq (m->name, m2->name))
1055 SET_FLAG (m2->flags, F_VIRTUAL);
1056 }
1057
1058 mark_virtual (p->sym);
1059 }
1060}
1061
1062
1063/* For all roots of the class tree, mark functions as virtual that
1064 are virtual because of a virtual declaration in a base class. */
1065
1066void
1067mark_inherited_virtual ()
1068{
1069 struct sym *r;
1070 int i;
1071
1072 for (i = 0; i < TABLE_SIZE; ++i)
1073 for (r = class_table[i]; r; r = r->next)
1074 if (r->supers == NULL)
1075 mark_virtual (r);
1076}
1077
1078
1079/* Create and return a symbol for a namespace with name NAME. */
1080
1081struct sym *
1082make_namespace (name)
1083 char *name;
1084{
c43a1ff6 1085 struct sym *s = (struct sym *) xmalloc (sizeof *s + strlen (name));
be0dbdab
GM		 1086 bzero (s, sizeof *s);
1087 strcpy (s->name, name);
1088 s->next = all_namespaces;
1089 s->namesp = current_namespace;
1090 all_namespaces = s;
1091 return s;
1092}
1093
1094
1095/* Find the symbol for namespace NAME. If not found, add a new symbol
1096 for NAME to all_namespaces. */
1097
1098struct sym *
1099find_namespace (name)
1100 char *name;
1101{
1102 struct sym *p;
1103
1104 for (p = all_namespaces; p; p = p->next)
1105 {
1106 if (streq (p->name, name))
1107 break;
1108 else
1109 {
1110 struct alias *p2;
1111 for (p2 = p->namesp_aliases; p2; p2 = p2->next)
1112 if (streq (p2->name, name))
1113 break;
1114 if (p2)
1115 break;
1116 }
1117 }
1118
1119 if (p == NULL)
1120 p = make_namespace (name);
1121
1122 return p;
1123}
1124
1125
1126/* Register the name NEW_NAME as an alias for namespace OLD_NAME. */
1127
1128void
1129register_namespace_alias (new_name, old_name)
1130 char *new_name, *old_name;
1131{
1132 struct sym *p = find_namespace (old_name);
1133 struct alias *al;
1134
1135 /* Is it already in the list of aliases? */
1136 for (al = p->namesp_aliases; al; al = al->next)
1137 if (streq (new_name, p->name))
1138 return;
1139
c43a1ff6 1140 al = (struct alias *) xmalloc (sizeof *al + strlen (new_name));
be0dbdab
GM		 1141 strcpy (al->name, new_name);
1142 al->next = p->namesp_aliases;
1143 p->namesp_aliases = al;
1144}
1145
1146
1147/* Enter namespace with name NAME. */
1148
1149void
1150enter_namespace (name)
1151 char *name;
1152{
1153 struct sym *p = find_namespace (name);
1154
1155 if (namespace_sp == namespace_stack_size)
1156 {
1157 int size = max (10, 2 * namespace_stack_size);
3a57e866
EZ		 1158 namespace_stack = (struct sym **) xrealloc ((void *)namespace_stack,
1159 size);
be0dbdab
GM		 1160 namespace_stack_size = size;
1161 }
1162
1163 namespace_stack[namespace_sp++] = current_namespace;
1164 current_namespace = p;
1165}
1166
1167
1168/* Leave the current namespace. */
1169
1170void
1171leave_namespace ()
1172{
1173 assert (namespace_sp > 0);
1174 current_namespace = namespace_stack[--namespace_sp];
1175}
1176
1177
1178\f
1179/***********************************************************************
1180 Writing the Output File
1181 ***********************************************************************/
1182
1183/* Write string S to the output file FP in a Lisp-readable form.
1184 If S is null, write out `()'. */
1185
1186#define PUTSTR(s, fp) \
1187 do { \
1188 if (!s) \
1189 { \
1190 putc ('(', fp); \
1191 putc (')', fp); \
1192 putc (' ', fp); \
1193 } \
1194 else \
1195 { \
1196 putc ('"', fp); \
1197 fputs (s, fp); \
1198 putc ('"', fp); \
1199 putc (' ', fp); \
1200 } \
1201 } while (0)
1202
1203/* A dynamically allocated buffer for constructing a scope name. */
1204
1205char *scope_buffer;
1206int scope_buffer_size;
1207int scope_buffer_len;
1208
1209
1210/* Make sure scope_buffer has enough room to add LEN chars to it. */
1211
1212void
1213ensure_scope_buffer_room (len)
1214 int len;
1215{
1216 if (scope_buffer_len + len >= scope_buffer_size)
1217 {
1218 int new_size = max (2 * scope_buffer_size, scope_buffer_len + len);
f94b82d9 1219 scope_buffer = (char *) xrealloc (scope_buffer, new_size);
be0dbdab
GM		 1220 scope_buffer_size = new_size;
1221 }
1222}
1223
1224
1225/* Recursively add the scope names of symbol P and the scopes of its
1226 namespaces to scope_buffer. Value is a pointer to the complete
1227 scope name constructed. */
1228
1229char *
1230sym_scope_1 (p)
1231 struct sym *p;
1232{
1233 int len;
1234
1235 if (p->namesp)
1236 sym_scope_1 (p->namesp);
1237
1238 if (*scope_buffer)
1239 {
1240 ensure_scope_buffer_room (3);
1241 strcat (scope_buffer, "::");
1242 scope_buffer_len += 2;
1243 }
1244
1245 len = strlen (p->name);
1246 ensure_scope_buffer_room (len + 1);
1247 strcat (scope_buffer, p->name);
1248 scope_buffer_len += len;
1249
1250 if (HAS_FLAG (p->flags, F_TEMPLATE))
1251 {
1252 ensure_scope_buffer_room (3);
1253 strcat (scope_buffer, "<>");
1254 scope_buffer_len += 2;
1255 }
1256
1257 return scope_buffer;
1258}
1259
1260
1261/* Return the scope of symbol P in printed representation, i.e.
1262 as it would appear in a C*+ source file. */
1263
1264char *
1265sym_scope (p)
1266 struct sym *p;
1267{
1268 if (!scope_buffer)
1269 {
1270 scope_buffer_size = 1024;
c43a1ff6 1271 scope_buffer = (char *) xmalloc (scope_buffer_size);
be0dbdab
GM		 1272 }
1273
1274 *scope_buffer = '\0';
1275 scope_buffer_len = 0;
1276
1277 if (p->namesp)
1278 sym_scope_1 (p->namesp);
1279
1280 return scope_buffer;
1281}
1282
1283
1284/* Dump the list of members M to file FP. Value is the length of the
1285 list. */
1286
1287int
1288dump_members (fp, m)
1289 FILE *fp;
1290 struct member *m;
1291{
1292 int n;
1293
1294 putc ('(', fp);
1295
1296 for (n = 0; m; m = m->next, ++n)
1297 {
1298 fputs (MEMBER_STRUCT, fp);
1299 PUTSTR (m->name, fp);
1300 PUTSTR (NULL, fp); /* FIXME? scope for globals */
1301 fprintf (fp, "%u ", (unsigned) m->flags);
1302 PUTSTR (m->filename, fp);
1303 PUTSTR (m->regexp, fp);
1304 fprintf (fp, "%u ", (unsigned) m->pos);
1305 fprintf (fp, "%u ", (unsigned) m->vis);
1306 putc (' ', fp);
1307 PUTSTR (m->def_filename, fp);
1308 PUTSTR (m->def_regexp, fp);
1309 fprintf (fp, "%u", (unsigned) m->def_pos);
1310 putc (']', fp);
1311 putc ('\n', fp);
1312 }
1313
1314 putc (')', fp);
1315 putc ('\n', fp);
1316 return n;
1317}
1318
1319
1320/* Dump class ROOT to stream FP. */
1321
1322void
1323dump_sym (fp, root)
1324 FILE *fp;
1325 struct sym *root;
1326{
1327 fputs (CLASS_STRUCT, fp);
1328 PUTSTR (root->name, fp);
1329
1330 /* Print scope, if any. */
1331 if (root->namesp)
1332 PUTSTR (sym_scope (root), fp);
1333 else
1334 PUTSTR (NULL, fp);
1335
1336 /* Print flags. */
1337 fprintf (fp, "%u", root->flags);
1338 PUTSTR (root->filename, fp);
1339 PUTSTR (root->regexp, fp);
1340 fprintf (fp, "%u", (unsigned) root->pos);
1341 PUTSTR (root->sfilename, fp);
1342 putc (']', fp);
1343 putc ('\n', fp);
1344}
1345
1346
1347/* Dump class ROOT and its subclasses to file FP. Value is the
1348 number of classes written. */
1349
1350int
1351dump_tree (fp, root)
1352 FILE *fp;
1353 struct sym *root;
1354{
1355 struct link *lk;
1356 unsigned n = 0;
1357
1358 dump_sym (fp, root);
1359
1360 if (f_verbose)
1361 {
1362 putchar ('+');
1363 fflush (stdout);
1364 }
1365
1366 putc ('(', fp);
1367
1368 for (lk = root->subs; lk; lk = lk->next)
1369 {
1370 fputs (TREE_STRUCT, fp);
1371 n += dump_tree (fp, lk->sym);
1372 putc (']', fp);
1373 }
1374
1375 putc (')', fp);
1376
1377 dump_members (fp, root->vars);
1378 n += dump_members (fp, root->fns);
1379 dump_members (fp, root->static_vars);
1380 n += dump_members (fp, root->static_fns);
1381 n += dump_members (fp, root->friends);
1382 dump_members (fp, root->types);
1383
1384 /* Superclasses. */
1385 putc ('(', fp);
1386 putc (')', fp);
1387
1388 /* Mark slot. */
1389 putc ('(', fp);
1390 putc (')', fp);
1391
1392 putc ('\n', fp);
1393 return n;
1394}
1395
1396
1397/* Dump the entire class tree to file FP. */
1398
1399void
1400dump_roots (fp)
1401 FILE *fp;
1402{
1403 int i, n = 0;
1404 struct sym *r;
1405
1406 /* Output file header containing version string, command line
1407 options etc. */
1408 if (!f_append)
1409 {
1410 fputs (TREE_HEADER_STRUCT, fp);
1411 PUTSTR (EBROWSE_FILE_VERSION, fp);
1412
1413 putc ('\"', fp);
1414 if (!f_structs)
1415 fputs (" -s", fp);
1416 if (f_regexps)
1417 fputs (" -x", fp);
1418 putc ('\"', fp);
1419 fputs (" ()", fp);
1420 fputs (" ()", fp);
1421 putc (']', fp);
1422 }
1423
1424 /* Mark functions as virtual that are so because of functions
1425 declared virtual in base classes. */
1426 mark_inherited_virtual ();
1427
1428 /* Dump the roots of the graph. */
1429 for (i = 0; i < TABLE_SIZE; ++i)
1430 for (r = class_table[i]; r; r = r->next)
1431 if (!r->supers)
1432 {
1433 fputs (TREE_STRUCT, fp);
1434 n += dump_tree (fp, r);
1435 putc (']', fp);
1436 }
1437
1438 if (f_verbose)
1439 putchar ('\n');
1440}
1441
1442
1443\f
1444/***********************************************************************
1445 Scanner
1446 ***********************************************************************/
1447
1448#ifdef DEBUG
1449#define INCREMENT_LINENO \
1450do { \
1451 if (f_very_verbose) \
1452 { \
1453 ++yyline; \
1454 printf ("%d:\n", yyline); \
1455 } \
1456 else \
1457 ++yyline; \
1458} while (0)
1459#else
1460#define INCREMENT_LINENO ++yyline
1461#endif
1462
1463/* Define two macros for accessing the input buffer (current input
1464 file). GET(C) sets C to the next input character and advances the
1465 input pointer. UNGET retracts the input pointer. */
1466
1467#define GET(C) ((C) = *in++)
1468#define UNGET() (--in)
1469
1470
1471/* Process a preprocessor line. Value is the next character from the
1472 input buffer not consumed. */
1473
1474int
1475process_pp_line ()
1476{
d65b0571 1477 int in_comment = 0, in_string = 0;
be0dbdab
GM		 1478 int c;
1479 char *p = yytext;
1480
1481 /* Skip over white space. The `#' has been consumed already. */
1482 while (WHITEP (GET (c)))
1483 ;
1484
1485 /* Read the preprocessor command (if any). */
1486 while (IDENTP (c))
1487 {
1488 *p++ = c;
1489 GET (c);
1490 }
1491
1492 /* Is it a `define'? */
1493 *p = '\0';
1494
1495 if (*yytext && streq (yytext, "define"))
1496 {
1497 p = yytext;
1498 while (WHITEP (c))
1499 GET (c);
1500 while (IDENTP (c))
1501 {
1502 *p++ = c;
1503 GET (c);
1504 }
1505
1506 *p = '\0';
1507
1508 if (*yytext)
1509 {
1510 char *regexp = matching_regexp ();
1511 int pos = BUFFER_POS ();
1512 add_define (yytext, regexp, pos);
1513 }
1514 }
1515
d65b0571 1516 while (c && (c != '\n' || in_comment || in_string))
be0dbdab
GM		 1517 {
1518 if (c == '\\')
1519 GET (c);
1520 else if (c == '/' && !in_comment)
1521 {
1522 if (GET (c) == '*')
1523 in_comment = 1;
1524 }
1525 else if (c == '*' && in_comment)
1526 {
1527 if (GET (c) == '/')
1528 in_comment = 0;
1529 }
d65b0571
GM		 1530 else if (c == '"')
1531 in_string = !in_string;
be0dbdab
GM		 1532
1533 if (c == '\n')
1534 INCREMENT_LINENO;
1535
1536 GET (c);
1537 }
d65b0571 1538
be0dbdab
GM		 1539 return c;
1540}
1541
1542
1543/* Value is the next token from the input buffer. */
1544
1545int
1546yylex ()
1547{
1548 int c;
1549 char end_char;
1550 char *p;
1551
1552 for (;;)
1553 {
1554 while (WHITEP (GET (c)))
1555 ;
1556
1557 switch (c)
1558 {
1559 case '\n':
1560 INCREMENT_LINENO;
1561 break;
1562
1563 case '\r':
1564 break;
1565
1566 case 0:
1567 /* End of file. */
1568 return YYEOF;
1569
1570 case '\\':
1571 GET (c);
1572 break;
1573
1574 case '"':
1575 case '\'':
1576 /* String and character constants. */
1577 end_char = c;
1578 string_start = in;
1579 while (GET (c) && c != end_char)
1580 {
1581 switch (c)
1582 {
1583 case '\\':
1584 /* Escape sequences. */
1585 if (!GET (c))
1586 {
1587 if (end_char == '\'')
e6a0814f 1588 yyerror ("EOF in character constant", NULL);
be0dbdab 1589 else
e6a0814f 1590 yyerror ("EOF in string constant", NULL);
be0dbdab
GM		 1591 goto end_string;
1592 }
1593 else switch (c)
1594 {
1595 case '\n':
d65b0571 1596 INCREMENT_LINENO;
be0dbdab
GM		 1597 case 'a':
1598 case 'b':
1599 case 'f':
1600 case 'n':
1601 case 'r':
1602 case 't':
1603 case 'v':
1604 break;
1605
1606 case 'x':
1607 {
1608 /* Hexadecimal escape sequence. */
1609 int i;
1610 for (i = 0; i < 2; ++i)
1611 {
1612 GET (c);
1613
1614 if (c >= '0' && c <= '7')
1615 ;
1616 else if (c >= 'a' && c <= 'f')
1617 ;
1618 else if (c >= 'A' && c <= 'F')
1619 ;
1620 else
1621 {
1622 UNGET ();
1623 break;
1624 }
1625 }
1626 }
1627 break;
1628
1629 case '0':
1630 {
1631 /* Octal escape sequence. */
1632 int i;
1633 for (i = 0; i < 3; ++i)
1634 {
1635 GET (c);
1636
1637 if (c >= '0' && c <= '7')
1638 ;
1639 else
1640 {
1641 UNGET ();
1642 break;
1643 }
1644 }
1645 }
1646 break;
1647
1648 default:
1649 break;
1650 }
1651 break;
1652
1653 case '\n':
1654 if (end_char == '\'')
e6a0814f 1655 yyerror ("newline in character constant", NULL);
be0dbdab 1656 else
e6a0814f 1657 yyerror ("newline in string constant", NULL);
be0dbdab 1658 INCREMENT_LINENO;
d65b0571 1659 break;
be0dbdab
GM		 1660
1661 default:
1662 break;
1663 }
1664 }
1665
1666 end_string:
1667 return end_char == '\'' ? CCHAR : CSTRING;
1668
1669 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g':
1670 case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n':
1671 case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u':
1672 case 'v': case 'w': case 'x': case 'y': case 'z':
1673 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G':
1674 case 'H': case 'I': case 'J': case 'K': case 'L': case 'M': case 'N':
1675 case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U':
1676 case 'V': case 'W': case 'X': case 'Y': case 'Z': case '_':
1677 {
1678 /* Identifier and keywords. */
1679 unsigned hash;
1680 struct kw *k;
1681
1682 p = yytext;
1683 *p++ = hash = c;
1684
1685 while (IDENTP (GET (*p)))
1686 {
1687 hash = (hash << 1) ^ *p++;
1688 if (p == yytext_end - 1)
1689 {
1690 int size = yytext_end - yytext;
c43a1ff6 1691 yytext = (char *) xrealloc (yytext, 2 * size);
be0dbdab
GM		 1692 yytext_end = yytext + 2 * size;
1693 p = yytext + size - 1;
1694 }
1695 }
1696
1697 UNGET ();
1698 *p = 0;
1699
1700 for (k = keyword_table[hash % KEYWORD_TABLE_SIZE]; k; k = k->next)
1701 if (streq (k->name, yytext))
1702 return k->tk;
1703
1704 return IDENT;
1705 }
1706
1707 case '/':
1708 /* C and C++ comments, '/' and '/='. */
1709 switch (GET (c))
1710 {
1711 case '*':
1712 while (GET (c))
1713 {
1714 switch (c)
1715 {
1716 case '*':
1717 if (GET (c) == '/')
1718 goto comment_end;
1719 UNGET ();
1720 break;
1721 case '\\':
1722 GET (c);
1723 break;
1724 case '\n':
1725 INCREMENT_LINENO;
1726 break;
1727 }
1728 }
1729 comment_end:;
1730 break;
1731
1732 case '=':
1733 return DIVASGN;
1734
1735 case '/':
1736 while (GET (c) && c != '\n')
1737 ;
1738 INCREMENT_LINENO;
1739 break;
1740
1741 default:
1742 UNGET ();
1743 return '/';
1744 }
1745 break;
1746
1747 case '+':
1748 if (GET (c) == '+')
1749 return INC;
1750 else if (c == '=')
1751 return ADDASGN;
1752 UNGET ();
1753 return '+';
1754
1755 case '-':
1756 switch (GET (c))
1757 {
1758 case '-':
1759 return DEC;
1760 case '>':
1761 if (GET (c) == '*')
1762 return ARROWSTAR;
1763 UNGET ();
1764 return ARROW;
1765 case '=':
1766 return SUBASGN;
1767 }
1768 UNGET ();
1769 return '-';
1770
1771 case '*':
1772 if (GET (c) == '=')
1773 return MULASGN;
1774 UNGET ();
1775 return '*';
1776
1777 case '%':
1778 if (GET (c) == '=')
1779 return MODASGN;
1780 UNGET ();
1781 return '%';
1782
1783 case '|':
1784 if (GET (c) == '|')
1785 return LOR;
1786 else if (c == '=')
1787 return ORASGN;
1788 UNGET ();
1789 return '|';
1790
1791 case '&':
1792 if (GET (c) == '&')
1793 return LAND;
1794 else if (c == '=')
1795 return ANDASGN;
1796 UNGET ();
1797 return '&';
1798
1799 case '^':
1800 if (GET (c) == '=')
1801 return XORASGN;
1802 UNGET ();
1803 return '^';
1804
1805 case '.':
1806 if (GET (c) == '*')
1807 return POINTSTAR;
1808 else if (c == '.')
1809 {
1810 if (GET (c) != '.')
e6a0814f 1811 yyerror ("invalid token '..' ('...' assumed)", NULL);
be0dbdab
GM		 1812 UNGET ();
1813 return ELLIPSIS;
1814 }
1815 else if (!DIGITP (c))
1816 {
1817 UNGET ();
1818 return '.';
1819 }
1820 goto mantissa;
1821
1822 case ':':
1823 if (GET (c) == ':')
1824 return DCOLON;
1825 UNGET ();
1826 return ':';
1827
1828 case '=':
1829 if (GET (c) == '=')
1830 return EQ;
1831 UNGET ();
1832 return '=';
1833
1834 case '!':
1835 if (GET (c) == '=')
1836 return NE;
1837 UNGET ();
1838 return '!';
1839
1840 case '<':
1841 switch (GET (c))
1842 {
1843 case '=':
1844 return LE;
1845 case '<':
1846 if (GET (c) == '=')
1847 return LSHIFTASGN;
1848 UNGET ();
1849 return LSHIFT;
1850 }
1851 UNGET ();
1852 return '<';
1853
1854 case '>':
1855 switch (GET (c))
1856 {
1857 case '=':
1858 return GE;
1859 case '>':
1860 if (GET (c) == '=')
1861 return RSHIFTASGN;
1862 UNGET ();
1863 return RSHIFT;
1864 }
1865 UNGET ();
1866 return '>';
1867
1868 case '#':
1869 c = process_pp_line ();
1870 if (c == 0)
1871 return YYEOF;
1872 break;
1873
1874 case '(': case ')': case '[': case ']': case '{': case '}':
1875 case ';': case ',': case '?': case '~':
1876 return c;
1877
1878 case '0':
1879 yyival = 0;
1880
1881 if (GET (c) == 'x' || c == 'X')
1882 {
1883 while (GET (c))
1884 {
1885 if (DIGITP (c))
1886 yyival = yyival * 16 + c - '0';
1887 else if (c >= 'a' && c <= 'f')
1888 yyival = yyival * 16 + c - 'a' + 10;
1889 else if (c >= 'A' && c <= 'F')
1890 yyival = yyival * 16 + c - 'A' + 10;
1891 else
1892 break;
1893 }
1894
1895 goto int_suffixes;
1896 }
1897 else if (c == '.')
1898 goto mantissa;
1899
1900 while (c >= '0' && c <= '7')
1901 {
1902 yyival = (yyival << 3) + c - '0';
1903 GET (c);
1904 }
1905
1906 int_suffixes:
1907 /* Integer suffixes. */
1908 while (isalpha (c))
1909 GET (c);
1910 UNGET ();
1911 return CINT;
1912
1913 case '1': case '2': case '3': case '4': case '5': case '6':
1914 case '7': case '8': case '9':
1915 /* Integer or floating constant, part before '.'. */
1916 yyival = c - '0';
1917
1918 while (GET (c) && DIGITP (c))
1919 yyival = 10 * yyival + c - '0';
1920
1921 if (c != '.')
1922 goto int_suffixes;
1923
1924 mantissa:
1925 /* Digits following '.'. */
1926 while (DIGITP (c))
1927 GET (c);
1928
1929 /* Optional exponent. */
1930 if (c == 'E' || c == 'e')
1931 {
1932 if (GET (c) == '-' || c == '+')
1933 GET (c);
1934
1935 while (DIGITP (c))
1936 GET (c);
1937 }
1938
1939 /* Optional type suffixes. */
1940 while (isalpha (c))
1941 GET (c);
1942 UNGET ();
1943 return CFLOAT;
1944
1945 default:
1946 break;
1947 }
1948 }
1949}
1950
1951
1952/* Value is the string from the start of the line to the current
1953 position in the input buffer, or maybe a bit more if that string is
1954 shorter than min_regexp. */
1955
1956char *
1957matching_regexp ()
1958{
1959 char *p;
1960 char *s;
1961 char *t;
1962 static char *buffer, *end_buf;
1963
1964 if (!f_regexps)
1965 return NULL;
1966
1967 if (buffer == NULL)
1968 {
c43a1ff6 1969 buffer = (char *) xmalloc (max_regexp);
be0dbdab
GM		 1970 end_buf = &buffer[max_regexp] - 1;
1971 }
1972
1973 /* Scan back to previous newline of buffer start. */
1974 for (p = in - 1; p > inbuffer && *p != '\n'; --p)
1975 ;
1976
1977 if (*p == '\n')
1978 {
1979 while (in - p < min_regexp && p > inbuffer)
1980 {
1981 /* Line probably not significant enough */
1982 for (--p; p >= inbuffer && *p != '\n'; --p)
1983 ;
1984 }
1985 if (*p == '\n')
1986 ++p;
1987 }
1988
1989 /* Copy from end to make sure significant portions are included.
1990 This implies that in the browser a regular expressing of the form
1991 `^.*{regexp}' has to be used. */
1992 for (s = end_buf - 1, t = in; s > buffer && t > p;)
1993 {
1994 *--s = *--t;
1995
1996 if (*s == '"')
1997 *--s = '\\';
1998 }
1999
2000 *(end_buf - 1) = '\0';
2001 return xstrdup (s);
2002}
2003
2004
2005/* Return a printable representation of token T. */
2006
2007char *
2008token_string (t)
2009 int t;
2010{
2011 static char b[3];
2012
2013 switch (t)
2014 {
2015 case CSTRING: return "string constant";
2016 case CCHAR: return "char constant";
2017 case CINT: return "int constant";
2018 case CFLOAT: return "floating constant";
2019 case ELLIPSIS: return "...";
2020 case LSHIFTASGN: return "<<=";
2021 case RSHIFTASGN: return ">>=";
2022 case ARROWSTAR: return "->*";
2023 case IDENT: return "identifier";
2024 case DIVASGN: return "/=";
2025 case INC: return "++";
2026 case ADDASGN: return "+=";
2027 case DEC: return "--";
2028 case ARROW: return "->";
2029 case SUBASGN: return "-=";
2030 case MULASGN: return "*=";
2031 case MODASGN: return "%=";
2032 case LOR: return "||";
2033 case ORASGN: return "|=";
2034 case LAND: return "&&";
2035 case ANDASGN: return "&=";
2036 case XORASGN: return "^=";
2037 case POINTSTAR: return ".*";
2038 case DCOLON: return "::";
2039 case EQ: return "==";
2040 case NE: return "!=";
2041 case LE: return "<=";
2042 case LSHIFT: return "<<";
2043 case GE: return ">=";
2044 case RSHIFT: return ">>";
2045 case ASM: return "asm";
2046 case AUTO: return "auto";
2047 case BREAK: return "break";
2048 case CASE: return "case";
2049 case CATCH: return "catch";
2050 case CHAR: return "char";
2051 case CLASS: return "class";
2052 case CONST: return "const";
2053 case CONTINUE: return "continue";
2054 case DEFAULT: return "default";
2055 case DELETE: return "delete";
2056 case DO: return "do";
2057 case DOUBLE: return "double";
2058 case ELSE: return "else";
2059 case ENUM: return "enum";
2060 case EXTERN: return "extern";
2061 case FLOAT: return "float";
2062 case FOR: return "for";
2063 case FRIEND: return "friend";
2064 case GOTO: return "goto";
2065 case IF: return "if";
2066 case T_INLINE: return "inline";
2067 case INT: return "int";
2068 case LONG: return "long";
2069 case NEW: return "new";
2070 case OPERATOR: return "operator";
2071 case PRIVATE: return "private";
2072 case PROTECTED: return "protected";
2073 case PUBLIC: return "public";
2074 case REGISTER: return "register";
2075 case RETURN: return "return";
2076 case SHORT: return "short";
2077 case SIGNED: return "signed";
2078 case SIZEOF: return "sizeof";
2079 case STATIC: return "static";
2080 case STRUCT: return "struct";
2081 case SWITCH: return "switch";
2082 case TEMPLATE: return "template";
2083 case THIS: return "this";
2084 case THROW: return "throw";
2085 case TRY: return "try";
2086 case TYPEDEF: return "typedef";
2087 case UNION: return "union";
2088 case UNSIGNED: return "unsigned";
2089 case VIRTUAL: return "virtual";
2090 case VOID: return "void";
2091 case VOLATILE: return "volatile";
2092 case WHILE: return "while";
2faf048a
GM		 2093 case MUTABLE: return "mutable";
2094 case BOOL: return "bool";
2095 case TRUE: return "true";
2096 case FALSE: return "false";
2097 case SIGNATURE: return "signature";
2098 case NAMESPACE: return "namespace";
2099 case EXPLICIT: return "explicit";
2100 case TYPENAME: return "typename";
2101 case CONST_CAST: return "const_cast";
2102 case DYNAMIC_CAST: return "dynamic_cast";
2103 case REINTERPRET_CAST: return "reinterpret_cast";
2104 case STATIC_CAST: return "static_cast";
2105 case TYPEID: return "typeid";
2106 case USING: return "using";
2107 case WCHAR: return "wchar_t";
be0dbdab 2108 case YYEOF: return "EOF";
be0dbdab 2109
2faf048a
GM		 2110 default:
2111 if (t < 255)
2112 {
2113 b[0] = t;
2114 b[1] = '\0';
2115 return b;
2116 }
2117 else
2118 return "???";
2119 }
be0dbdab
GM		 2120}
2121
2122
2123/* Reinitialize the scanner for a new input file. */
2124
2125void
2126re_init_scanner ()
2127{
2128 in = inbuffer;
2129 yyline = 1;
2130
2131 if (yytext == NULL)
2132 {
2133 int size = 256;
c43a1ff6 2134 yytext = (char *) xmalloc (size * sizeof *yytext);
be0dbdab
GM		 2135 yytext_end = yytext + size;
2136 }
2137}
2138
2139
2140/* Insert a keyword NAME with token value TK into the keyword hash
2141 table. */
2142
2143void
2144insert_keyword (name, tk)
2145 char *name;
2146 int tk;
2147{
2148 char *s;
2149 unsigned h = 0;
c43a1ff6 2150 struct kw *k = (struct kw *) xmalloc (sizeof *k);
be0dbdab
GM		 2151
2152 for (s = name; *s; ++s)
2153 h = (h << 1) ^ *s;
2154
2155 h %= KEYWORD_TABLE_SIZE;
2156 k->name = name;
2157 k->tk = tk;
2158 k->next = keyword_table[h];
2159 keyword_table[h] = k;
2160}
2161
2162
2163/* Initialize the scanner for the first file. This sets up the
2164 character class vectors and fills the keyword hash table. */
2165
2166void
2167init_scanner ()
2168{
2169 int i;
2170
2171 /* Allocate the input buffer */
2172 inbuffer_size = READ_CHUNK_SIZE + 1;
c43a1ff6 2173 inbuffer = in = (char *) xmalloc (inbuffer_size);
be0dbdab
GM		 2174 yyline = 1;
2175
2176 /* Set up character class vectors. */
2177 for (i = 0; i < sizeof is_ident; ++i)
2178 {
2179 if (i == '_' || isalnum (i))
2180 is_ident[i] = 1;
2181
2182 if (i >= '0' && i <= '9')
2183 is_digit[i] = 1;
2184
2185 if (i == ' ' || i == '\t' || i == '\f' || i == '\v')
2186 is_white[i] = 1;
2187 }
2188
2189 /* Fill keyword hash table. */
2190 insert_keyword ("and", LAND);
2191 insert_keyword ("and_eq", ANDASGN);
2192 insert_keyword ("asm", ASM);
2193 insert_keyword ("auto", AUTO);
2194 insert_keyword ("bitand", '&');
2195 insert_keyword ("bitor", '|');
2196 insert_keyword ("bool", BOOL);
2197 insert_keyword ("break", BREAK);
2198 insert_keyword ("case", CASE);
2199 insert_keyword ("catch", CATCH);
2200 insert_keyword ("char", CHAR);
2201 insert_keyword ("class", CLASS);
2202 insert_keyword ("compl", '~');
2203 insert_keyword ("const", CONST);
2204 insert_keyword ("const_cast", CONST_CAST);
2205 insert_keyword ("continue", CONTINUE);
2206 insert_keyword ("default", DEFAULT);
2207 insert_keyword ("delete", DELETE);
2208 insert_keyword ("do", DO);
2209 insert_keyword ("double", DOUBLE);
2210 insert_keyword ("dynamic_cast", DYNAMIC_CAST);
2211 insert_keyword ("else", ELSE);
2212 insert_keyword ("enum", ENUM);
2213 insert_keyword ("explicit", EXPLICIT);
2214 insert_keyword ("extern", EXTERN);
2215 insert_keyword ("false", FALSE);
2216 insert_keyword ("float", FLOAT);
2217 insert_keyword ("for", FOR);
2218 insert_keyword ("friend", FRIEND);
2219 insert_keyword ("goto", GOTO);
2220 insert_keyword ("if", IF);
2221 insert_keyword ("inline", T_INLINE);
2222 insert_keyword ("int", INT);
2223 insert_keyword ("long", LONG);
2224 insert_keyword ("mutable", MUTABLE);
2225 insert_keyword ("namespace", NAMESPACE);
2226 insert_keyword ("new", NEW);
2227 insert_keyword ("not", '!');
2228 insert_keyword ("not_eq", NE);
2229 insert_keyword ("operator", OPERATOR);
2230 insert_keyword ("or", LOR);
2231 insert_keyword ("or_eq", ORASGN);
2232 insert_keyword ("private", PRIVATE);
2233 insert_keyword ("protected", PROTECTED);
2234 insert_keyword ("public", PUBLIC);
2235 insert_keyword ("register", REGISTER);
2236 insert_keyword ("reinterpret_cast", REINTERPRET_CAST);
2237 insert_keyword ("return", RETURN);
2238 insert_keyword ("short", SHORT);
2239 insert_keyword ("signed", SIGNED);
2240 insert_keyword ("sizeof", SIZEOF);
2241 insert_keyword ("static", STATIC);
2242 insert_keyword ("static_cast", STATIC_CAST);
2243 insert_keyword ("struct", STRUCT);
2244 insert_keyword ("switch", SWITCH);
2245 insert_keyword ("template", TEMPLATE);
2246 insert_keyword ("this", THIS);
2247 insert_keyword ("throw", THROW);
2248 insert_keyword ("true", TRUE);
2249 insert_keyword ("try", TRY);
2250 insert_keyword ("typedef", TYPEDEF);
2251 insert_keyword ("typeid", TYPEID);
2252 insert_keyword ("typename", TYPENAME);
2253 insert_keyword ("union", UNION);
2254 insert_keyword ("unsigned", UNSIGNED);
2255 insert_keyword ("using", USING);
2256 insert_keyword ("virtual", VIRTUAL);
2257 insert_keyword ("void", VOID);
2258 insert_keyword ("volatile", VOLATILE);
2259 insert_keyword ("wchar_t", WCHAR);
2260 insert_keyword ("while", WHILE);
2261 insert_keyword ("xor", '^');
2262 insert_keyword ("xor_eq", XORASGN);
2263}
2264
2265
2266\f
2267/***********************************************************************
2268 Parser
2269 ***********************************************************************/
2270
2271/* Match the current lookahead token and set it to the next token. */
2272
2273#define MATCH() (tk = yylex ())
2274
2275/* Return the lookahead token. If current lookahead token is cleared,
2276 read a new token. */
2277
2278#define LA1 (tk == -1 ? (tk = yylex ()) : tk)
2279
2280/* Is the current lookahead equal to the token T? */
2281
2282#define LOOKING_AT(T) (tk == (T))
2283
2284/* Is the current lookahead one of T1 or T2? */
2285
2286#define LOOKING_AT2(T1, T2) (tk == (T1) || tk == (T2))
2287
2288/* Is the current lookahead one of T1, T2 or T3? */
2289
2290#define LOOKING_AT3(T1, T2, T3) (tk == (T1) || tk == (T2) || tk == (T3))
2291
2292/* Is the current lookahead one of T1...T4? */
2293
2294#define LOOKING_AT4(T1, T2, T3, T4) \
2295 (tk == (T1) || tk == (T2) || tk == (T3) || tk == (T4))
2296
2297/* Match token T if current lookahead is T. */
2298
2299#define MATCH_IF(T) if (LOOKING_AT (T)) MATCH (); else ((void) 0)
2300
2301/* Skip to matching token if current token is T. */
2302
2303#define SKIP_MATCHING_IF(T) \
2304 if (LOOKING_AT (T)) skip_matching (); else ((void) 0)
2305
2306
2307/* Skip forward until a given token TOKEN or YYEOF is seen and return
2308 the current lookahead token after skipping. */
2309
2310int
2311skip_to (token)
2312 int token;
2313{
2314 while (!LOOKING_AT2 (YYEOF, token))
2315 MATCH ();
2316 return tk;
2317}
2318
2319
2320/* Skip over pairs of tokens (parentheses, square brackets,
2321 angle brackets, curly brackets) matching the current lookahead. */
2322
2323void
2324skip_matching ()
2325{
2326 int open, close, n;
2327
2328 switch (open = LA1)
2329 {
2330 case '{':
2331 close = '}';
2332 break;
2333
2334 case '(':
2335 close = ')';
2336 break;
2337
2338 case '<':
2339 close = '>';
2340 break;
2341
2342 case '[':
2343 close = ']';
2344 break;
2345
2346 default:
2347 abort ();
2348 }
2349
2350 for (n = 0;;)
2351 {
2352 if (LOOKING_AT (open))
2353 ++n;
2354 else if (LOOKING_AT (close))
2355 --n;
2356 else if (LOOKING_AT (YYEOF))
2357 break;
2358
2359 MATCH ();
2360
2361 if (n == 0)
2362 break;
2363 }
2364}
2365
2366
2367/* Re-initialize the parser by resetting the lookahead token. */
2368
2369void
2370re_init_parser ()
2371{
2372 tk = -1;
2373}
2374
2375
2376/* Parse a parameter list, including the const-specifier,
2377 pure-specifier, and throw-list that may follow a parameter list.
2378 Return in FLAGS what was seen following the parameter list.
2379 Returns a hash code for the parameter types. This value is used to
2380 distinguish between overloaded functions. */
2381
2382unsigned
2383parm_list (flags)
2384 int *flags;
2385{
2386 unsigned hash = 0;
2387 int type_seen = 0;
2388
2389 while (!LOOKING_AT2 (YYEOF, ')'))
2390 {
2391 switch (LA1)
2392 {
2393 /* Skip over grouping parens or parameter lists in parameter
2394 declarations. */
2395 case '(':
2396 skip_matching ();
2397 break;
2398
2399 /* Next parameter. */
2400 case ',':
2401 MATCH ();
2402 type_seen = 0;
2403 break;
2404
2405 /* Ignore the scope part of types, if any. This is because
2406 some types need scopes when defined outside of a class body,
2407 and don't need them inside the class body. This means that
2408 we have to look for the last IDENT in a sequence of
2409 IDENT::IDENT::... */
2410 case IDENT:
2411 if (!type_seen)
2412 {
2faf048a 2413 char *last_id;
be0dbdab
GM		 2414 unsigned ident_type_hash = 0;
2415
2faf048a
GM		 2416 parse_qualified_param_ident_or_type (&last_id);
2417 if (last_id)
2418 {
2419 /* LAST_ID null means something like `X::*'. */
2420 for (; *last_id; ++last_id)
2421 ident_type_hash = (ident_type_hash << 1) ^ *last_id;
2422 hash = (hash << 1) ^ ident_type_hash;
2423 type_seen = 1;
2424 }
be0dbdab
GM		 2425 }
2426 else
2427 MATCH ();
2428 break;
2429
2430 case VOID:
2431 /* This distinction is made to make `func (void)' equivalent
2432 to `func ()'. */
2433 type_seen = 1;
2434 MATCH ();
2435 if (!LOOKING_AT (')'))
2436 hash = (hash << 1) ^ VOID;
2437 break;
2438
2439 case BOOL: case CHAR: case CLASS: case CONST:
2440 case DOUBLE: case ENUM: case FLOAT: case INT:
2441 case LONG: case SHORT: case SIGNED: case STRUCT:
2442 case UNION: case UNSIGNED: case VOLATILE: case WCHAR:
2443 case ELLIPSIS:
2444 type_seen = 1;
2445 hash = (hash << 1) ^ LA1;
2446 MATCH ();
2447 break;
2448
2449 case '*': case '&': case '[': case ']':
2450 hash = (hash << 1) ^ LA1;
2451 MATCH ();
2452 break;
2453
2454 default:
2455 MATCH ();
2456 break;
2457 }
2458 }
2459
2460 if (LOOKING_AT (')'))
2461 {
2462 MATCH ();
2463
2464 if (LOOKING_AT (CONST))
2465 {
2466 /* We can overload the same function on `const' */
2467 hash = (hash << 1) ^ CONST;
2468 SET_FLAG (*flags, F_CONST);
2469 MATCH ();
2470 }
2471
2472 if (LOOKING_AT (THROW))
2473 {
2474 MATCH ();
2475 SKIP_MATCHING_IF ('(');
2476 SET_FLAG (*flags, F_THROW);
2477 }
2478
2479 if (LOOKING_AT ('='))
2480 {
2481 MATCH ();
2482 if (LOOKING_AT (CINT) && yyival == 0)
2483 {
2484 MATCH ();
2485 SET_FLAG (*flags, F_PURE);
2486 }
2487 }
2488 }
2489
2490 return hash;
2491}
2492
2493
2494/* Print position info to stdout. */
2495
2496void
2497print_info ()
2498{
2499 if (info_position >= 0 && BUFFER_POS () <= info_position)
2500 if (info_cls)
2501 printf ("(\"%s\" \"%s\" \"%s\" %d)\n",
2502 info_cls->name, sym_scope (info_cls),
2503 info_member->name, info_where);
2504}
2505
2506
2507/* Parse a member declaration within the class body of CLS. VIS is
2508 the access specifier for the member (private, protected,
2509 public). */
2510
2511void
2512member (cls, vis)
2513 struct sym *cls;
2514 int vis;
2515{
2516 char *id = NULL;
2517 int sc = SC_MEMBER;
2518 char *regexp = NULL;
2519 int pos;
2520 int is_constructor;
2521 int anonymous = 0;
2522 int flags = 0;
2523 int class_tag;
2524 int type_seen = 0;
2525 int paren_seen = 0;
2526 unsigned hash = 0;
2527 int tilde = 0;
2528
2529 while (!LOOKING_AT4 (';', '{', '}', YYEOF))
2530 {
2531 switch (LA1)
2532 {
2533 default:
2534 MATCH ();
2535 break;
2536
2537 /* A function or class may follow. */
2538 case TEMPLATE:
2539 MATCH();
2540 SET_FLAG (flags, F_TEMPLATE);
2541 /* Skip over template argument list */
2542 SKIP_MATCHING_IF ('<');
2543 break;
2544
2545 case EXPLICIT:
2546 SET_FLAG (flags, F_EXPLICIT);
2547 goto typeseen;
2548
2549 case MUTABLE:
2550 SET_FLAG (flags, F_MUTABLE);
2551 goto typeseen;
2552
2553 case T_INLINE:
2554 SET_FLAG (flags, F_INLINE);
2555 goto typeseen;
2556
2557 case VIRTUAL:
2558 SET_FLAG (flags, F_VIRTUAL);
2559 goto typeseen;
2560
2561 case '[':
2562 skip_matching ();
2563 break;
2564
2565 case ENUM:
2566 sc = SC_TYPE;
2567 goto typeseen;
2568
2569 case TYPEDEF:
2570 sc = SC_TYPE;
2571 goto typeseen;
2572
2573 case FRIEND:
2574 sc = SC_FRIEND;
2575 goto typeseen;
2576
2577 case STATIC:
2578 sc = SC_STATIC;
2579 goto typeseen;
2580
2581 case '~':
2582 tilde = 1;
2583 MATCH ();
2584 break;
2585
2586 case IDENT:
57b4c82e
GM		 2587 /* Remember IDENTS seen so far. Among these will be the member
2588 name. */
2589 id = (char *) xrealloc (id, strlen (yytext) + 2);
be0dbdab
GM		 2590 if (tilde)
2591 {
2592 *id = '~';
2593 strcpy (id + 1, yytext);
2594 }
2595 else
2596 strcpy (id, yytext);
2597 MATCH ();
2598 break;
2599
2600 case OPERATOR:
57b4c82e
GM		 2601 {
2602 char *s = operator_name (&sc);
2603 id = (char *) xrealloc (id, strlen (s) + 1);
2604 strcpy (id, s);
2605 }
be0dbdab
GM		 2606 break;
2607
2608 case '(':
2609 /* Most probably the beginning of a parameter list. */
2610 MATCH ();
2611 paren_seen = 1;
2612
2613 if (id && cls)
2614 {
2615 if (!(is_constructor = streq (id, cls->name)))
2616 regexp = matching_regexp ();
2617 }
2618 else
2619 is_constructor = 0;
2620
2621 pos = BUFFER_POS ();
2622 hash = parm_list (&flags);
2623
2624 if (is_constructor)
2625 regexp = matching_regexp ();
2626
2627 if (id && cls != NULL)
2628 add_member_decl (cls, id, regexp, pos, hash, 0, sc, vis, flags);
2629
2630 while (!LOOKING_AT3 (';', '{', YYEOF))
2631 MATCH ();
2632
2633 if (LOOKING_AT ('{') && id && cls)
2634 add_member_defn (cls, id, regexp, pos, hash, 0, sc, flags);
57b4c82e
GM		 2635
2636 xfree (id);
be0dbdab
GM		 2637 id = NULL;
2638 sc = SC_MEMBER;
2639 break;
2640
2641 case STRUCT: case UNION: case CLASS:
2642 /* Nested class */
2643 class_tag = LA1;
2644 type_seen = 1;
2645 MATCH ();
2646 anonymous = 1;
2647
2648 /* More than one ident here to allow for MS-DOS specialties
2649 like `_export class' etc. The last IDENT seen counts
2650 as the class name. */
2651 while (!LOOKING_AT4 (YYEOF, ';', ':', '{'))
2652 {
2653 if (LOOKING_AT (IDENT))
2654 anonymous = 0;
2655 MATCH ();
2656 }
2657
2658 if (LOOKING_AT2 (':', '{'))
2659 class_definition (anonymous ? NULL : cls, class_tag, flags, 1);
2660 else
2661 skip_to (';');
2662 break;
2663
2664 case INT: case CHAR: case LONG: case UNSIGNED:
2665 case SIGNED: case CONST: case DOUBLE: case VOID:
2666 case SHORT: case VOLATILE: case BOOL: case WCHAR:
2667 case TYPENAME:
2668 typeseen:
2669 type_seen = 1;
2670 MATCH ();
2671 break;
2672 }
2673 }
2674
2675 if (LOOKING_AT (';'))
2676 {
2677 /* The end of a member variable, a friend declaration or an access
2678 declaration. We don't want to add friend classes as members. */
2679 if (id && sc != SC_FRIEND && cls)
2680 {
2681 regexp = matching_regexp ();
2682 pos = BUFFER_POS ();
2683
2684 if (cls != NULL)
2685 {
2686 if (type_seen || !paren_seen)
2687 add_member_decl (cls, id, regexp, pos, 0, 1, sc, vis, 0);
2688 else
2689 add_member_decl (cls, id, regexp, pos, hash, 0, sc, vis, 0);
2690 }
2691 }
2692
2693 MATCH ();
2694 print_info ();
2695 }
2696 else if (LOOKING_AT ('{'))
2697 {
2698 /* A named enum. */
2699 if (sc == SC_TYPE && id && cls)
2700 {
2701 regexp = matching_regexp ();
2702 pos = BUFFER_POS ();
2703
2704 if (cls != NULL)
2705 {
2706 add_member_decl (cls, id, regexp, pos, 0, 1, sc, vis, 0);
2707 add_member_defn (cls, id, regexp, pos, 0, 1, sc, 0);
2708 }
2709 }
2710
2711 skip_matching ();
2712 print_info ();
2713 }
57b4c82e
GM		 2714
2715 xfree (id);
be0dbdab
GM		 2716}
2717
2718
2719/* Parse the body of class CLS. TAG is the tag of the class (struct,
2720 union, class). */
2721
2722void
2723class_body (cls, tag)
2724 struct sym *cls;
2725 int tag;
2726{
2727 int vis = tag == CLASS ? PRIVATE : PUBLIC;
2728 int temp;
2729
2730 while (!LOOKING_AT2 (YYEOF, '}'))
2731 {
2732 switch (LA1)
2733 {
2734 case PRIVATE: case PROTECTED: case PUBLIC:
2735 temp = LA1;
2736 MATCH ();
2737
2738 if (LOOKING_AT (':'))
2739 {
2740 vis = temp;
2741 MATCH ();
2742 }
2743 else
2744 {
2745 /* Probably conditional compilation for inheritance list.
2746 We don't known whether there comes more of this.
2747 This is only a crude fix that works most of the time. */
2748 do
2749 {
2750 MATCH ();
2751 }
2752 while (LOOKING_AT2 (IDENT, ',')
2753 || LOOKING_AT3 (PUBLIC, PROTECTED, PRIVATE));
2754 }
2755 break;
2756
2757 case TYPENAME:
2758 case USING:
2759 skip_to (';');
2760 break;
2761
2762 /* Try to synchronize */
2763 case CHAR: case CLASS: case CONST:
2764 case DOUBLE: case ENUM: case FLOAT: case INT:
2765 case LONG: case SHORT: case SIGNED: case STRUCT:
2766 case UNION: case UNSIGNED: case VOID: case VOLATILE:
2767 case TYPEDEF: case STATIC: case T_INLINE: case FRIEND:
2768 case VIRTUAL: case TEMPLATE: case IDENT: case '~':
2769 case BOOL: case WCHAR: case EXPLICIT: case MUTABLE:
2770 member (cls, vis);
2771 break;
2772
2773 default:
2774 MATCH ();
2775 break;
2776 }
2777 }
2778}
2779
2780
2781/* Parse a qualified identifier. Current lookahead is IDENT. A
2782 qualified ident has the form `X<..>::Y<...>::T<...>. Returns a
2783 symbol for that class. */
2784
2785struct sym *
2786parse_classname ()
2787{
2788 struct sym *last_class = NULL;
2789
2790 while (LOOKING_AT (IDENT))
2791 {
2792 last_class = add_sym (yytext, last_class);
2793 MATCH ();
2794
2795 if (LOOKING_AT ('<'))
2796 {
2797 skip_matching ();
2798 SET_FLAG (last_class->flags, F_TEMPLATE);
2799 }
2800
2801 if (!LOOKING_AT (DCOLON))
2802 break;
2803
2804 MATCH ();
2805 }
2806
2807 return last_class;
2808}
2809
2810
2811/* Parse an operator name. Add the `static' flag to *SC if an
2812 implicitly static operator has been parsed. Value is a pointer to
2813 a static buffer holding the constructed operator name string. */
2814
2815char *
2816operator_name (sc)
2817 int *sc;
2818{
2819 static int id_size = 0;
2820 static char *id = NULL;
2821 char *s;
2822 int len;
2823
2824 MATCH ();
2825
2826 if (LOOKING_AT2 (NEW, DELETE))
2827 {
2828 /* `new' and `delete' are implicitly static. */
2829 if (*sc != SC_FRIEND)
2830 *sc = SC_STATIC;
2831
2832 s = token_string (LA1);
2833 MATCH ();
2834
2835 len = strlen (s) + 10;
2836 if (len > id_size)
2837 {
2838 int new_size = max (len, 2 * id_size);
c43a1ff6 2839 id = (char *) xrealloc (id, new_size);
be0dbdab
GM		 2840 id_size = new_size;
2841 }
2842 strcpy (id, s);
2843
2844 /* Vector new or delete? */
2845 if (LOOKING_AT ('['))
2846 {
2847 strcat (id, "[");
2848 MATCH ();
2849
2850 if (LOOKING_AT (']'))
2851 {
2852 strcat (id, "]");
2853 MATCH ();
2854 }
2855 }
2856 }
2857 else
2858 {
2859 int tokens_matched = 0;
2860
2861 len = 20;
2862 if (len > id_size)
2863 {
2864 int new_size = max (len, 2 * id_size);
c43a1ff6 2865 id = (char *) xrealloc (id, new_size);
be0dbdab
GM		 2866 id_size = new_size;
2867 }
2868 strcpy (id, "operator");
2869
2870 /* Beware access declarations of the form "X::f;" Beware of
2871 `operator () ()'. Yet another difficulty is found in
2872 GCC 2.95's STL: `operator == __STL_NULL_TMPL_ARGS (...'. */
2873 while (!(LOOKING_AT ('(') && tokens_matched)
2874 && !LOOKING_AT2 (';', YYEOF))
2875 {
2876 s = token_string (LA1);
2877 len += strlen (s) + 2;
2878 if (len > id_size)
2879 {
2880 int new_size = max (len, 2 * id_size);
c43a1ff6 2881 id = (char *) xrealloc (id, new_size);
be0dbdab
GM		 2882 id_size = new_size;
2883 }
2884
2885 if (*s != ')' && *s != ']')
2886 strcat (id, " ");
2887 strcat (id, s);
2888 MATCH ();
2889
2890 /* If this is a simple operator like `+', stop now. */
db3a495e 2891 if (!isalpha ((unsigned char) *s) && *s != '(' && *s != '[')
be0dbdab
GM		 2892 break;
2893
2894 ++tokens_matched;
2895 }
2896 }
2897
2898 return id;
2899}
2900
2901
2902/* This one consumes the last IDENT of a qualified member name like
2903 `X::Y::z'. This IDENT is returned in LAST_ID. Value if the
2904 symbol structure for the ident. */
2905
2906struct sym *
2907parse_qualified_ident_or_type (last_id)
2908 char **last_id;
2909{
2910 struct sym *cls = NULL;
2911 static char *id = NULL;
2912 static int id_size = 0;
2913
2914 while (LOOKING_AT (IDENT))
2915 {
2916 int len = strlen (yytext) + 1;
2917 if (len > id_size)
2918 {
c43a1ff6 2919 id = (char *) xrealloc (id, len);
be0dbdab
GM		 2920 id_size = len;
2921 }
2922 strcpy (id, yytext);
2923 *last_id = id;
2924 MATCH ();
2925
2926 SKIP_MATCHING_IF ('<');
2927
2928 if (LOOKING_AT (DCOLON))
2929 {
2930 cls = add_sym (id, cls);
2931 *last_id = NULL;
2932 MATCH ();
2933 }
2934 else
2935 break;
2936 }
2937
2938 return cls;
2939}
2940
2941
2942/* This one consumes the last IDENT of a qualified member name like
2943 `X::Y::z'. This IDENT is returned in LAST_ID. Value if the
2944 symbol structure for the ident. */
2945
2946void
2947parse_qualified_param_ident_or_type (last_id)
2948 char **last_id;
2949{
2950 struct sym *cls = NULL;
2951 static char *id = NULL;
2952 static int id_size = 0;
2faf048a 2953
be0dbdab
GM		 2954 while (LOOKING_AT (IDENT))
2955 {
2956 int len = strlen (yytext) + 1;
2957 if (len > id_size)
2958 {
c43a1ff6 2959 id = (char *) xrealloc (id, len);
be0dbdab
GM		 2960 id_size = len;
2961 }
2962 strcpy (id, yytext);
2963 *last_id = id;
2964 MATCH ();
2965
2966 SKIP_MATCHING_IF ('<');
2967
2968 if (LOOKING_AT (DCOLON))
2969 {
2970 cls = add_sym (id, cls);
2971 *last_id = NULL;
2972 MATCH ();
2973 }
2974 else
2975 break;
2976 }
2977}
2978
2979
2980/* Parse a class definition.
2981
2982 CONTAINING is the class containing the class being parsed or null.
2983 This may also be null if NESTED != 0 if the containing class is
2984 anonymous. TAG is the tag of the class (struct, union, class).
2985 NESTED is non-zero if we are parsing a nested class.
2986
2987 Current lookahead is the class name. */
2988
2989void
2990class_definition (containing, tag, flags, nested)
2991 struct sym *containing;
2992 int tag;
2993 int flags;
2994 int nested;
2995{
be0dbdab
GM		 2996 struct sym *current;
2997 struct sym *base_class;
2998
2999 /* Set CURRENT to null if no entry has to be made for the class
3000 parsed. This is the case for certain command line flag
3001 settings. */
3002 if ((tag != CLASS && !f_structs) || (nested && !f_nested_classes))
3003 current = NULL;
3004 else
3005 {
3006 current = add_sym (yytext, containing);
3007 current->pos = BUFFER_POS ();
3008 current->regexp = matching_regexp ();
3009 current->filename = filename;
3010 current->flags = flags;
3011 }
3012
3013 /* If at ':', base class list follows. */
3014 if (LOOKING_AT (':'))
3015 {
3016 int done = 0;
3017 MATCH ();
3018
3019 while (!done)
3020 {
8bef35f2 3021 switch (LA1)
be0dbdab
GM		 3022 {
3023 case VIRTUAL: case PUBLIC: case PROTECTED: case PRIVATE:
3024 MATCH ();
3025 break;
3026
3027 case IDENT:
3028 base_class = parse_classname ();
3029 if (base_class && current && base_class != current)
3030 add_link (base_class, current);
3031 break;
3032
3033 /* The `,' between base classes or the end of the base
3034 class list. Add the previously found base class.
3035 It's done this way to skip over sequences of
3036 `A::B::C' until we reach the end.
3037
3038 FIXME: it is now possible to handle `class X : public B::X'
3039 because we have enough information. */
3040 case ',':
3041 MATCH ();
3042 break;
3043
3044 default:
3045 /* A syntax error, possibly due to preprocessor constructs
3046 like
3047
3048 #ifdef SOMETHING
3049 class A : public B
3050 #else
3051 class A : private B.
3052
3053 MATCH until we see something like `;' or `{'. */
3054 while (!LOOKING_AT3 (';', YYEOF, '{'))
3055 MATCH ();
3056 done = 1;
3057
3058 case '{':
3059 done = 1;
3060 break;
3061 }
3062 }
3063 }
3064
3065 /* Parse the class body if there is one. */
3066 if (LOOKING_AT ('{'))
3067 {
3068 if (tag != CLASS && !f_structs)
3069 skip_matching ();
3070 else
3071 {
3072 MATCH ();
3073 class_body (current, tag);
3074
3075 if (LOOKING_AT ('}'))
3076 {
3077 MATCH ();
3078 if (LOOKING_AT (';') && !nested)
3079 MATCH ();
3080 }
3081 }
3082 }
3083}
3084
3085
3086/* Parse a declaration. */
3087
3088void
8bef35f2 3089declaration (flags)
be0dbdab
GM		 3090 int flags;
3091{
3092 char *id = NULL;
3093 struct sym *cls = NULL;
3094 char *regexp = NULL;
3095 int pos = 0;
3096 unsigned hash = 0;
3097 int is_constructor;
3098 int sc = 0;
3099
3100 while (!LOOKING_AT3 (';', '{', YYEOF))
3101 {
3102 switch (LA1)
3103 {
3104 default:
3105 MATCH ();
3106 break;
3107
3108 case '[':
3109 skip_matching ();
3110 break;
3111
3112 case ENUM:
3113 case TYPEDEF:
3114 sc = SC_TYPE;
3115 MATCH ();
3116 break;
3117
3118 case STATIC:
3119 sc = SC_STATIC;
3120 MATCH ();
3121 break;
3122
3123 case INT: case CHAR: case LONG: case UNSIGNED:
3124 case SIGNED: case CONST: case DOUBLE: case VOID:
3125 case SHORT: case VOLATILE: case BOOL: case WCHAR:
3126 MATCH ();
3127 break;
3128
3129 case CLASS: case STRUCT: case UNION:
3130 /* This is for the case `STARTWRAP class X : ...' or
3131 `declare (X, Y)\n class A : ...'. */
3132 if (id)
57b4c82e
GM		 3133 {
3134 xfree (id);
3135 return;
3136 }
be0dbdab
GM		 3137
3138 case '=':
3139 /* Assumed to be the start of an initialization in this context.
3140 Skip over everything up to ';'. */
3141 skip_to (';');
3142 break;
3143
3144 case OPERATOR:
57b4c82e
GM		 3145 {
3146 char *s = operator_name (&sc);
3147 id = (char *) xrealloc (id, strlen (s) + 1);
3148 strcpy (id, s);
3149 }
be0dbdab
GM		 3150 break;
3151
3152 case T_INLINE:
3153 SET_FLAG (flags, F_INLINE);
3154 MATCH ();
3155 break;
3156
3157 case '~':
3158 MATCH ();
3159 if (LOOKING_AT (IDENT))
3160 {
57b4c82e 3161 id = (char *) xrealloc (id, strlen (yytext) + 2);
be0dbdab
GM		 3162 *id = '~';
3163 strcpy (id + 1, yytext);
3164 MATCH ();
3165 }
3166 break;
3167
3168 case IDENT:
3169 cls = parse_qualified_ident_or_type (&id);
3170 break;
3171
3172 case '(':
3173 /* Most probably the beginning of a parameter list. */
3174 if (cls)
3175 {
3176 MATCH ();
3177
3178 if (id && cls)
3179 {
3180 if (!(is_constructor = streq (id, cls->name)))
3181 regexp = matching_regexp ();
3182 }
3183 else
3184 is_constructor = 0;
3185
3186 pos = BUFFER_POS ();
3187 hash = parm_list (&flags);
3188
3189 if (is_constructor)
3190 regexp = matching_regexp ();
3191
3192 if (id && cls)
3193 add_member_defn (cls, id, regexp, pos, hash, 0,
3194 SC_UNKNOWN, flags);
3195 }
3196 else
3197 {
3198 /* This may be a C functions, but also a macro
3199 call of the form `declare (A, B)' --- such macros
3200 can be found in some class libraries. */
3201 MATCH ();
3202
3203 if (id)
3204 {
3205 regexp = matching_regexp ();
3206 pos = BUFFER_POS ();
3207 hash = parm_list (&flags);
3208 add_global_decl (id, regexp, pos, hash, 0, sc, flags);
3209 }
3210
3211 /* This is for the case that the function really is
3212 a macro with no `;' following it. If a CLASS directly
3213 follows, we would miss it otherwise. */
3214 if (LOOKING_AT3 (CLASS, STRUCT, UNION))
3215 return;
3216 }
3217
3218 while (!LOOKING_AT3 (';', '{', YYEOF))
3219 MATCH ();
3220
3221 if (!cls && id && LOOKING_AT ('{'))
3222 add_global_defn (id, regexp, pos, hash, 0, sc, flags);
57b4c82e
GM		 3223
3224 xfree (id);
be0dbdab
GM		 3225 id = NULL;
3226 break;
3227 }
3228 }
3229
3230 if (LOOKING_AT (';'))
3231 {
3232 /* The end of a member variable or of an access declaration
3233 `X::f'. To distinguish between them we have to know whether
3234 type information has been seen. */
3235 if (id)
3236 {
3237 char *regexp = matching_regexp ();
3238 int pos = BUFFER_POS ();
3239
3240 if (cls)
3241 add_member_defn (cls, id, regexp, pos, 0, 1, SC_UNKNOWN, flags);
3242 else
3243 add_global_defn (id, regexp, pos, 0, 1, sc, flags);
3244 }
3245
3246 MATCH ();
3247 print_info ();
3248 }
3249 else if (LOOKING_AT ('{'))
3250 {
3251 if (sc == SC_TYPE && id)
3252 {
3253 /* A named enumeration. */
3254 regexp = matching_regexp ();
3255 pos = BUFFER_POS ();
3256 add_global_defn (id, regexp, pos, 0, 1, sc, flags);
3257 }
3258
3259 skip_matching ();
3260 print_info ();
3261 }
57b4c82e
GM		 3262
3263 xfree (id);
be0dbdab
GM		 3264}
3265
3266
3267/* Parse a list of top-level declarations/definitions. START_FLAGS
3268 says in which context we are parsing. If it is F_EXTERNC, we are
3269 parsing in an `extern "C"' block. Value is 1 if EOF is reached, 0
3270 otherwise. */
3271
3272int
3273globals (start_flags)
3274 int start_flags;
3275{
3276 int anonymous;
3277 int class_tk;
3278 int flags = start_flags;
3279
3280 for (;;)
3281 {
3282 char *prev_in = in;
3283
3284 switch (LA1)
3285 {
3286 case NAMESPACE:
3287 {
3288 MATCH ();
3289
3290 if (LOOKING_AT (IDENT))
3291 {
57b4c82e 3292 char *namespace_name = xstrdup (yytext);
be0dbdab
GM		 3293 MATCH ();
3294
3295 if (LOOKING_AT ('='))
3296 {
3297 if (skip_to (';') == ';')
3298 MATCH ();
3299 register_namespace_alias (namespace_name, yytext);
3300 }
3301 else if (LOOKING_AT ('{'))
3302 {
3303 MATCH ();
3304 enter_namespace (namespace_name);
3305 globals (0);
3306 leave_namespace ();
3307 MATCH_IF ('}');
3308 }
57b4c82e
GM		 3309
3310 xfree (namespace_name);
be0dbdab
GM		 3311 }
3312 }
3313 break;
3314
3315 case EXTERN:
3316 MATCH ();
3317 if (LOOKING_AT (CSTRING) && *string_start == 'C'
3318 && *(string_start + 1) == '"')
3319 {
3320 /* This is `extern "C"'. */
3321 MATCH ();
3322
3323 if (LOOKING_AT ('{'))
3324 {
3325 MATCH ();
3326 globals (F_EXTERNC);
3327 MATCH_IF ('}');
3328 }
3329 else
3330 SET_FLAG (flags, F_EXTERNC);
3331 }
3332 break;
3333
3334 case TEMPLATE:
3335 MATCH ();
3336 SKIP_MATCHING_IF ('<');
3337 SET_FLAG (flags, F_TEMPLATE);
3338 break;
3339
3340 case CLASS: case STRUCT: case UNION:
3341 class_tk = LA1;
3342 MATCH ();
3343 anonymous = 1;
3344
3345 /* More than one ident here to allow for MS-DOS and OS/2
3346 specialties like `far', `_Export' etc. Some C++ libs
3347 have constructs like `_OS_DLLIMPORT(_OS_CLIENT)' in front
3348 of the class name. */
3349 while (!LOOKING_AT4 (YYEOF, ';', ':', '{'))
3350 {
3351 if (LOOKING_AT (IDENT))
3352 anonymous = 0;
3353 MATCH ();
3354 }
3355
3356 /* Don't add anonymous unions. */
3357 if (LOOKING_AT2 (':', '{') && !anonymous)
3358 class_definition (NULL, class_tk, flags, 0);
3359 else
3360 {
3361 if (skip_to (';') == ';')
3362 MATCH ();
3363 }
3364
3365 flags = start_flags;
3366 break;
3367
3368 case YYEOF:
3369 return 1;
3370
3371 case '}':
3372 return 0;
3373
3374 default:
8bef35f2 3375 declaration (flags);
be0dbdab
GM		 3376 flags = start_flags;
3377 break;
3378 }
3379
3380 if (prev_in == in)
e6a0814f 3381 yyerror ("parse error", NULL);
be0dbdab
GM		 3382 }
3383}
3384
3385
3386/* Parse the current input file. */
3387
3388void
3389yyparse ()
3390{
3391 while (globals (0) == 0)
3392 MATCH_IF ('}');
3393}
3394
3395
3396\f
3397/***********************************************************************
3398 Main Program
3399 ***********************************************************************/
3400
3401/* Add the list of paths PATH_LIST to the current search path for
3402 input files. */
3403
3404void
3405add_search_path (path_list)
3406 char *path_list;
3407{
3408 while (*path_list)
3409 {
3410 char *start = path_list;
3411 struct search_path *p;
3412
3413 while (*path_list && *path_list != PATH_LIST_SEPARATOR)
3414 ++path_list;
3415
c43a1ff6
GM		 3416 p = (struct search_path *) xmalloc (sizeof *p);
3417 p->path = (char *) xmalloc (path_list - start + 1);
be0dbdab
GM		 3418 memcpy (p->path, start, path_list - start);
3419 p->path[path_list - start] = '\0';
3420 p->next = NULL;
3421
3422 if (search_path_tail)
3423 {
3424 search_path_tail->next = p;
3425 search_path_tail = p;
3426 }
3427 else
3428 search_path = search_path_tail = p;
3429
3430 while (*path_list == PATH_LIST_SEPARATOR)
3431 ++path_list;
3432 }
3433}
3434
3435
3436/* Open FILE and return a file handle for it, or -1 if FILE cannot be
3437 opened. Try to find FILE in search_path first, then try the
3438 unchanged file name. */
3439
3440FILE *
3441open_file (file)
3442 char *file;
3443{
3444 FILE *fp = NULL;
3445 static char *buffer;
3446 static int buffer_size;
3447 struct search_path *path;
fd72561d 3448 int flen = strlen (file) + 1; /* +1 for the slash */
be0dbdab
GM		 3449
3450 filename = xstrdup (file);
3451
3452 for (path = search_path; path && fp == NULL; path = path->next)
3453 {
fd72561d 3454 int len = strlen (path->path) + flen;
be0dbdab
GM		 3455
3456 if (len + 1 >= buffer_size)
3457 {
3458 buffer_size = max (len + 1, 2 * buffer_size);
c43a1ff6 3459 buffer = (char *) xrealloc (buffer, buffer_size);
be0dbdab
GM		 3460 }
3461
3462 strcpy (buffer, path->path);
3463 strcat (buffer, "/");
3464 strcat (buffer, file);
3465 fp = fopen (buffer, "r");
3466 }
3467
3468 /* Try the original file name. */
3469 if (fp == NULL)
3470 fp = fopen (file, "r");
3471
3472 if (fp == NULL)
e6a0814f 3473 yyerror ("cannot open", NULL);
be0dbdab
GM		 3474
3475 return fp;
3476}
3477
3478
3479/* Display usage information and exit program. */
3480
3481#define USAGE "\
3482Usage: ebrowse [options] {files}\n\
3483\n\
3484 -a, --append append output\n\
3485 -f, --files=FILES read input file names from FILE\n\
3486 -I, --search-path=LIST set search path for input files\n\
3487 -m, --min-regexp-length=N set minimum regexp length to N\n\
3488 -M, --max-regexp-length=N set maximum regexp length to N\n\
3489 -n, --no-nested-classes exclude nested classes\n\
3490 -o, --output-file=FILE set output file name to FILE\n\
3491 -p, --position-info print info about position in file\n\
3492 -s, --no-structs-or-unions don't record structs or unions\n\
3493 -v, --verbose be verbose\n\
3494 -V, --very-verbose be very verbose\n\
3495 -x, --no-regexps don't record regular expressions\n\
3496 --help display this help\n\
3497 --version display version info\n\
3498"
3499
3500void
3501usage (error)
3502 int error;
3503{
3504 puts (USAGE);
3505 exit (error ? 1 : 0);
3506}
3507
3508
3509/* Display version and copyright info. The VERSION macro is set
3510 from the Makefile and contains the Emacs version. */
3511
2fe9a71c
AI		 3512#ifndef VERSION
3513# define VERSION "21"
3514#endif
3515
be0dbdab
GM		 3516void
3517version ()
3518{
3519 printf ("ebrowse %s\n", VERSION);
3520 puts ("Copyright (C) 1992-1999, 2000 Free Software Foundation, Inc.");
3521 puts ("This program is distributed under the same terms as Emacs.");
3522 exit (0);
3523}
3524
3525
3526/* Parse one input file FILE, adding classes and members to the symbol
3527 table. */
3528
3529void
3530process_file (file)
3531 char *file;
3532{
3533 FILE *fp;
3534
3535 fp = open_file (file);
3536 if (fp)
3537 {
3538 int nread, nbytes;
3539
3540 /* Give a progress indication if needed. */
3541 if (f_very_verbose)
3542 {
3543 puts (filename);
3544 fflush (stdout);
3545 }
3546 else if (f_verbose)
3547 {
3548 putchar ('.');
3549 fflush (stdout);
3550 }
3551
3552 /* Read file to inbuffer. */
3553 for (nread = 0;;)
3554 {
3555 if (nread + READ_CHUNK_SIZE >= inbuffer_size)
3556 {
3557 inbuffer_size = nread + READ_CHUNK_SIZE + 1;
c43a1ff6 3558 inbuffer = (char *) xrealloc (inbuffer, inbuffer_size);
be0dbdab
GM		 3559 }
3560
3561 nbytes = fread (inbuffer + nread, 1, READ_CHUNK_SIZE, fp);
fd72561d 3562 if (nbytes <= 0)
be0dbdab 3563 break;
fd72561d 3564 nread += nbytes;
be0dbdab 3565 }
fd72561d
EZ		 3566 if (nread < 0)
3567 nread = 0;
be0dbdab
GM		 3568 inbuffer[nread] = '\0';
3569
3570 /* Reinitialize scanner and parser for the new input file. */
3571 re_init_scanner ();
3572 re_init_parser ();
3573
3574 /* Parse it and close the file. */
3575 yyparse ();
3576 fclose (fp);
3577 }
3578}
3579
3580
3581/* Read a line from stream FP and return a pointer to a static buffer
3582 containing its contents without the terminating newline. Value
3583 is null when EOF is reached. */
3584
3585char *
3586read_line (fp)
3587 FILE *fp;
3588{
3589 static char *buffer;
3590 static int buffer_size;
3591 int i = 0, c;
3592
3593 while ((c = getc (fp)) != EOF && c != '\n')
3594 {
3595 if (i >= buffer_size)
3596 {
3597 buffer_size = max (100, buffer_size * 2);
c43a1ff6 3598 buffer = (char *) xrealloc (buffer, buffer_size);
be0dbdab
GM		 3599 }
3600
3601 buffer[i++] = c;
3602 }
3603
3604 if (c == EOF && i == 0)
3605 return NULL;
3606
3607 if (i == buffer_size)
3608 {
3609 buffer_size = max (100, buffer_size * 2);
c43a1ff6 3610 buffer = (char *) xrealloc (buffer, buffer_size);
be0dbdab
GM		 3611 }
3612
3613 buffer[i] = '\0';
3614 return buffer;
3615}
3616
3617
3618/* Main entry point. */
3619
3620int
3621main (argc, argv)
3622 int argc;
3623 char **argv;
3624{
3625 int i;
3626 int any_inputfiles = 0;
3627 static char *out_filename = DEFAULT_OUTFILE;
3628 static char **input_filenames = NULL;
3629 static int input_filenames_size = 0;
3630 static int n_input_files;
3631
3632 filename = "command line";
3633 yyout = stdout;
3634
3635 while ((i = getopt_long (argc, argv, "af:I:m:M:no:p:svVx",
3636 options, NULL)) != EOF)
3637 {
3638 switch (i)
3639 {
3640 /* Experimental. */
3641 case 'p':
3642 info_position = atoi (optarg);
3643 break;
3644
3645 case 'n':
3646 f_nested_classes = 0;
3647 break;
3648
3649 case 'x':
3650 f_regexps = 0;
3651 break;
3652
3653 /* Add the name of a file containing more input files. */
3654 case 'f':
3655 if (n_input_files == input_filenames_size)
3656 {
3657 input_filenames_size = max (10, 2 * input_filenames_size);
3a57e866 3658 input_filenames = (char **) xrealloc ((void *)input_filenames,
be0dbdab
GM		 3659 input_filenames_size);
3660 }
3661 input_filenames[n_input_files++] = xstrdup (optarg);
3662 break;
3663
3664 /* Append new output to output file instead of truncating it. */
3665 case 'a':
3666 f_append = 1;
3667 break;
3668
3669 /* Include structs in the output */
3670 case 's':
3671 f_structs = 0;
3672 break;
3673
3674 /* Be verbose (give a progress indication). */
3675 case 'v':
3676 f_verbose = 1;
3677 break;
3678
3679 /* Be very verbose (print file names as they are processed). */
3680 case 'V':
3681 f_verbose = 1;
3682 f_very_verbose = 1;
3683 break;
3684
3685 /* Change the name of the output file. */
3686 case 'o':
3687 out_filename = optarg;
3688 break;
3689
3690 /* Set minimum length for regular expression strings
3691 when recorded in the output file. */
3692 case 'm':
3693 min_regexp = atoi (optarg);
3694 break;
3695
3696 /* Set maximum length for regular expression strings
3697 when recorded in the output file. */
3698 case 'M':
3699 max_regexp = atoi (optarg);
3700 break;
3701
3702 /* Add to search path. */
3703 case 'I':
3704 add_search_path (optarg);
3705 break;
3706
3707 /* Display help */
3708 case -2:
3709 usage (0);
3710 break;
3711
3712 case -3:
3713 version ();
3714 break;
3715 }
3716 }
3717
3718 /* Call init_scanner after command line flags have been processed to be
3719 able to add keywords depending on command line (not yet
3720 implemented). */
3721 init_scanner ();
3722 init_sym ();
3723
3724 /* Open output file */
3725 if (*out_filename)
3726 {
3727 yyout = fopen (out_filename, f_append ? "a" : "w");
3728 if (yyout == NULL)
3729 {
e6a0814f 3730 yyerror ("cannot open output file `%s'", out_filename);
be0dbdab
GM		 3731 exit (1);
3732 }
3733 }
3734
3735 /* Process input files specified on the command line. */
3736 while (optind < argc)
3737 {
3738 process_file (argv[optind++]);
3739 any_inputfiles = 1;
3740 }
3741
3742 /* Process files given on stdin if no files specified. */
3743 if (!any_inputfiles && n_input_files == 0)
3744 {
3745 char *file;
3746 while ((file = read_line (stdin)) != NULL)
3747 process_file (file);
3748 }
3749 else
3750 {
3751 /* Process files from `--files=FILE'. Every line in FILE names
3752 one input file to process. */
3753 for (i = 0; i < n_input_files; ++i)
3754 {
3755 FILE *fp = fopen (input_filenames[i], "r");
3756
3757 if (fp == NULL)
e6a0814f 3758 yyerror ("cannot open input file `%s'", input_filenames[i]);
be0dbdab
GM		 3759 else
3760 {
3761 char *file;
3762 while ((file = read_line (fp)) != NULL)
3763 process_file (file);
3764 fclose (fp);
3765 }
3766 }
3767 }
3768
3769 /* Write output file. */
3770 dump_roots (yyout);
3771
3772 /* Close output file. */
3773 if (yyout != stdout)
3774 fclose (yyout);
3775
3776 return 0;
3777}
3778
3779
3780/* ebrowse.c ends here. */
Unnamed repository; edit this file 'description' to name the repository.