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