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