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