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