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