Merge from mainline (165734:167278).
[official-gcc/graphite-test-results.git] / gcc / cp / lex.c
blobc583d7d307e80bc3e1a0091c2fd1628c9e9fa73a
1 /* Separate lexical analyzer for GNU C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC 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, or (at your option)
12 any later version.
14 GCC 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.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is the lexical analyzer for GNU C++. */
26 #include "config.h"
27 #include "system.h"
28 #include "coretypes.h"
29 #include "tm.h"
30 #include "input.h"
31 #include "tree.h"
32 #include "cp-tree.h"
33 #include "cpplib.h"
34 #include "flags.h"
35 #include "c-family/c-pragma.h"
36 #include "toplev.h"
37 #include "output.h"
38 #include "tm_p.h"
39 #include "timevar.h"
41 static int interface_strcmp (const char *);
42 static void init_cp_pragma (void);
44 static tree parse_strconst_pragma (const char *, int);
45 static void handle_pragma_vtable (cpp_reader *);
46 static void handle_pragma_unit (cpp_reader *);
47 static void handle_pragma_interface (cpp_reader *);
48 static void handle_pragma_implementation (cpp_reader *);
49 static void handle_pragma_java_exceptions (cpp_reader *);
51 static void init_operators (void);
52 static void copy_lang_type (tree);
54 /* A constraint that can be tested at compile time. */
55 #define CONSTRAINT(name, expr) extern int constraint_##name [(expr) ? 1 : -1]
57 /* Functions and data structures for #pragma interface.
59 `#pragma implementation' means that the main file being compiled
60 is considered to implement (provide) the classes that appear in
61 its main body. I.e., if this is file "foo.cc", and class `bar'
62 is defined in "foo.cc", then we say that "foo.cc implements bar".
64 All main input files "implement" themselves automagically.
66 `#pragma interface' means that unless this file (of the form "foo.h"
67 is not presently being included by file "foo.cc", the
68 CLASSTYPE_INTERFACE_ONLY bit gets set. The effect is that none
69 of the vtables nor any of the inline functions defined in foo.h
70 will ever be output.
72 There are cases when we want to link files such as "defs.h" and
73 "main.cc". In this case, we give "defs.h" a `#pragma interface',
74 and "main.cc" has `#pragma implementation "defs.h"'. */
76 struct impl_files
78 const char *filename;
79 struct impl_files *next;
82 static struct impl_files *impl_file_chain;
84 /* True if we saw "#pragma GCC java_exceptions". */
85 bool pragma_java_exceptions;
87 void
88 cxx_finish (void)
90 c_common_finish ();
93 /* A mapping from tree codes to operator name information. */
94 operator_name_info_t operator_name_info[(int) MAX_TREE_CODES];
95 /* Similar, but for assignment operators. */
96 operator_name_info_t assignment_operator_name_info[(int) MAX_TREE_CODES];
98 /* Initialize data structures that keep track of operator names. */
100 #define DEF_OPERATOR(NAME, C, M, AR, AP) \
101 CONSTRAINT (C, sizeof "operator " + sizeof NAME <= 256);
102 #include "operators.def"
103 #undef DEF_OPERATOR
105 static void
106 init_operators (void)
108 tree identifier;
109 char buffer[256];
110 struct operator_name_info_t *oni;
112 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
113 sprintf (buffer, ISALPHA (NAME[0]) ? "operator %s" : "operator%s", NAME); \
114 identifier = get_identifier (buffer); \
115 IDENTIFIER_OPNAME_P (identifier) = 1; \
117 oni = (ASSN_P \
118 ? &assignment_operator_name_info[(int) CODE] \
119 : &operator_name_info[(int) CODE]); \
120 oni->identifier = identifier; \
121 oni->name = NAME; \
122 oni->mangled_name = MANGLING; \
123 oni->arity = ARITY;
125 #include "operators.def"
126 #undef DEF_OPERATOR
128 operator_name_info[(int) ERROR_MARK].identifier
129 = get_identifier ("<invalid operator>");
131 /* Handle some special cases. These operators are not defined in
132 the language, but can be produced internally. We may need them
133 for error-reporting. (Eventually, we should ensure that this
134 does not happen. Error messages involving these operators will
135 be confusing to users.) */
137 operator_name_info [(int) INIT_EXPR].name
138 = operator_name_info [(int) MODIFY_EXPR].name;
139 operator_name_info [(int) EXACT_DIV_EXPR].name = "(ceiling /)";
140 operator_name_info [(int) CEIL_DIV_EXPR].name = "(ceiling /)";
141 operator_name_info [(int) FLOOR_DIV_EXPR].name = "(floor /)";
142 operator_name_info [(int) ROUND_DIV_EXPR].name = "(round /)";
143 operator_name_info [(int) CEIL_MOD_EXPR].name = "(ceiling %)";
144 operator_name_info [(int) FLOOR_MOD_EXPR].name = "(floor %)";
145 operator_name_info [(int) ROUND_MOD_EXPR].name = "(round %)";
146 operator_name_info [(int) ABS_EXPR].name = "abs";
147 operator_name_info [(int) TRUTH_AND_EXPR].name = "strict &&";
148 operator_name_info [(int) TRUTH_OR_EXPR].name = "strict ||";
149 operator_name_info [(int) RANGE_EXPR].name = "...";
150 operator_name_info [(int) UNARY_PLUS_EXPR].name = "+";
152 assignment_operator_name_info [(int) EXACT_DIV_EXPR].name
153 = "(exact /=)";
154 assignment_operator_name_info [(int) CEIL_DIV_EXPR].name
155 = "(ceiling /=)";
156 assignment_operator_name_info [(int) FLOOR_DIV_EXPR].name
157 = "(floor /=)";
158 assignment_operator_name_info [(int) ROUND_DIV_EXPR].name
159 = "(round /=)";
160 assignment_operator_name_info [(int) CEIL_MOD_EXPR].name
161 = "(ceiling %=)";
162 assignment_operator_name_info [(int) FLOOR_MOD_EXPR].name
163 = "(floor %=)";
164 assignment_operator_name_info [(int) ROUND_MOD_EXPR].name
165 = "(round %=)";
168 /* Initialize the reserved words. */
170 void
171 init_reswords (void)
173 unsigned int i;
174 tree id;
175 int mask = 0;
177 if (cxx_dialect != cxx0x)
178 mask |= D_CXX0X;
179 if (flag_no_asm)
180 mask |= D_ASM | D_EXT;
181 if (flag_no_gnu_keywords)
182 mask |= D_EXT;
184 /* The Objective-C keywords are all context-dependent. */
185 mask |= D_OBJC;
187 ridpointers = ggc_alloc_cleared_vec_tree ((int) RID_MAX);
188 for (i = 0; i < num_c_common_reswords; i++)
190 if (c_common_reswords[i].disable & D_CONLY)
191 continue;
192 id = get_identifier (c_common_reswords[i].word);
193 C_SET_RID_CODE (id, c_common_reswords[i].rid);
194 ridpointers [(int) c_common_reswords[i].rid] = id;
195 if (! (c_common_reswords[i].disable & mask))
196 C_IS_RESERVED_WORD (id) = 1;
200 static void
201 init_cp_pragma (void)
203 c_register_pragma (0, "vtable", handle_pragma_vtable);
204 c_register_pragma (0, "unit", handle_pragma_unit);
205 c_register_pragma (0, "interface", handle_pragma_interface);
206 c_register_pragma (0, "implementation", handle_pragma_implementation);
207 c_register_pragma ("GCC", "interface", handle_pragma_interface);
208 c_register_pragma ("GCC", "implementation", handle_pragma_implementation);
209 c_register_pragma ("GCC", "java_exceptions", handle_pragma_java_exceptions);
212 /* TRUE if a code represents a statement. */
214 bool statement_code_p[MAX_TREE_CODES];
216 /* Initialize the C++ front end. This function is very sensitive to
217 the exact order that things are done here. It would be nice if the
218 initialization done by this routine were moved to its subroutines,
219 and the ordering dependencies clarified and reduced. */
220 bool
221 cxx_init (void)
223 location_t saved_loc;
224 unsigned int i;
225 static const enum tree_code stmt_codes[] = {
226 CTOR_INITIALIZER, TRY_BLOCK, HANDLER,
227 EH_SPEC_BLOCK, USING_STMT, TAG_DEFN,
228 IF_STMT, CLEANUP_STMT, FOR_STMT,
229 RANGE_FOR_STMT, WHILE_STMT, DO_STMT,
230 BREAK_STMT, CONTINUE_STMT, SWITCH_STMT,
231 EXPR_STMT
234 memset (&statement_code_p, 0, sizeof (statement_code_p));
235 for (i = 0; i < ARRAY_SIZE (stmt_codes); i++)
236 statement_code_p[stmt_codes[i]] = true;
238 saved_loc = input_location;
239 input_location = BUILTINS_LOCATION;
241 init_reswords ();
242 init_tree ();
243 init_cp_semantics ();
244 init_operators ();
245 init_method ();
246 init_error ();
248 current_function_decl = NULL;
250 class_type_node = ridpointers[(int) RID_CLASS];
252 cxx_init_decl_processing ();
254 if (c_common_init () == false)
256 input_location = saved_loc;
257 return false;
260 init_cp_pragma ();
262 init_repo ();
264 input_location = saved_loc;
265 return true;
268 /* Return nonzero if S is not considered part of an
269 INTERFACE/IMPLEMENTATION pair. Otherwise, return 0. */
271 static int
272 interface_strcmp (const char* s)
274 /* Set the interface/implementation bits for this scope. */
275 struct impl_files *ifiles;
276 const char *s1;
278 for (ifiles = impl_file_chain; ifiles; ifiles = ifiles->next)
280 const char *t1 = ifiles->filename;
281 s1 = s;
283 if (*s1 != *t1 || *s1 == 0)
284 continue;
286 while (*s1 == *t1 && *s1 != 0)
287 s1++, t1++;
289 /* A match. */
290 if (*s1 == *t1)
291 return 0;
293 /* Don't get faked out by xxx.yyy.cc vs xxx.zzz.cc. */
294 if (strchr (s1, '.') || strchr (t1, '.'))
295 continue;
297 if (*s1 == '\0' || s1[-1] != '.' || t1[-1] != '.')
298 continue;
300 /* A match. */
301 return 0;
304 /* No matches. */
305 return 1;
310 /* Parse a #pragma whose sole argument is a string constant.
311 If OPT is true, the argument is optional. */
312 static tree
313 parse_strconst_pragma (const char* name, int opt)
315 tree result, x;
316 enum cpp_ttype t;
318 t = pragma_lex (&result);
319 if (t == CPP_STRING)
321 if (pragma_lex (&x) != CPP_EOF)
322 warning (0, "junk at end of #pragma %s", name);
323 return result;
326 if (t == CPP_EOF && opt)
327 return NULL_TREE;
329 error ("invalid #pragma %s", name);
330 return error_mark_node;
333 static void
334 handle_pragma_vtable (cpp_reader* dfile ATTRIBUTE_UNUSED )
336 parse_strconst_pragma ("vtable", 0);
337 sorry ("#pragma vtable no longer supported");
340 static void
341 handle_pragma_unit (cpp_reader* dfile ATTRIBUTE_UNUSED )
343 /* Validate syntax, but don't do anything. */
344 parse_strconst_pragma ("unit", 0);
347 static void
348 handle_pragma_interface (cpp_reader* dfile ATTRIBUTE_UNUSED )
350 tree fname = parse_strconst_pragma ("interface", 1);
351 struct c_fileinfo *finfo;
352 const char *filename;
354 if (fname == error_mark_node)
355 return;
356 else if (fname == 0)
357 filename = lbasename (input_filename);
358 else
359 filename = TREE_STRING_POINTER (fname);
361 finfo = get_fileinfo (input_filename);
363 if (impl_file_chain == 0)
365 /* If this is zero at this point, then we are
366 auto-implementing. */
367 if (main_input_filename == 0)
368 main_input_filename = input_filename;
371 finfo->interface_only = interface_strcmp (filename);
372 /* If MULTIPLE_SYMBOL_SPACES is set, we cannot assume that we can see
373 a definition in another file. */
374 if (!MULTIPLE_SYMBOL_SPACES || !finfo->interface_only)
375 finfo->interface_unknown = 0;
378 /* Note that we have seen a #pragma implementation for the key MAIN_FILENAME.
379 We used to only allow this at toplevel, but that restriction was buggy
380 in older compilers and it seems reasonable to allow it in the headers
381 themselves, too. It only needs to precede the matching #p interface.
383 We don't touch finfo->interface_only or finfo->interface_unknown;
384 the user must specify a matching #p interface for this to have
385 any effect. */
387 static void
388 handle_pragma_implementation (cpp_reader* dfile ATTRIBUTE_UNUSED )
390 tree fname = parse_strconst_pragma ("implementation", 1);
391 const char *filename;
392 struct impl_files *ifiles = impl_file_chain;
394 if (fname == error_mark_node)
395 return;
397 if (fname == 0)
399 if (main_input_filename)
400 filename = main_input_filename;
401 else
402 filename = input_filename;
403 filename = lbasename (filename);
405 else
407 filename = TREE_STRING_POINTER (fname);
408 if (cpp_included_before (parse_in, filename, input_location))
409 warning (0, "#pragma implementation for %qs appears after "
410 "file is included", filename);
413 for (; ifiles; ifiles = ifiles->next)
415 if (! strcmp (ifiles->filename, filename))
416 break;
418 if (ifiles == 0)
420 ifiles = XNEW (struct impl_files);
421 ifiles->filename = xstrdup (filename);
422 ifiles->next = impl_file_chain;
423 impl_file_chain = ifiles;
427 /* Indicate that this file uses Java-personality exception handling. */
428 static void
429 handle_pragma_java_exceptions (cpp_reader* dfile ATTRIBUTE_UNUSED)
431 tree x;
432 if (pragma_lex (&x) != CPP_EOF)
433 warning (0, "junk at end of #pragma GCC java_exceptions");
435 choose_personality_routine (lang_java);
436 pragma_java_exceptions = true;
439 /* Issue an error message indicating that the lookup of NAME (an
440 IDENTIFIER_NODE) failed. Returns the ERROR_MARK_NODE. */
442 tree
443 unqualified_name_lookup_error (tree name)
445 if (IDENTIFIER_OPNAME_P (name))
447 if (name != ansi_opname (ERROR_MARK))
448 error ("%qD not defined", name);
450 else
452 if (!objc_diagnose_private_ivar (name))
453 error ("%qD was not declared in this scope", name);
454 /* Prevent repeated error messages by creating a VAR_DECL with
455 this NAME in the innermost block scope. */
456 if (current_function_decl)
458 tree decl;
459 decl = build_decl (input_location,
460 VAR_DECL, name, error_mark_node);
461 DECL_CONTEXT (decl) = current_function_decl;
462 push_local_binding (name, decl, 0);
463 /* Mark the variable as used so that we do not get warnings
464 about it being unused later. */
465 TREE_USED (decl) = 1;
469 return error_mark_node;
472 /* Like unqualified_name_lookup_error, but NAME is an unqualified-id
473 used as a function. Returns an appropriate expression for
474 NAME. */
476 tree
477 unqualified_fn_lookup_error (tree name)
479 if (processing_template_decl)
481 /* In a template, it is invalid to write "f()" or "f(3)" if no
482 declaration of "f" is available. Historically, G++ and most
483 other compilers accepted that usage since they deferred all name
484 lookup until instantiation time rather than doing unqualified
485 name lookup at template definition time; explain to the user what
486 is going wrong.
488 Note that we have the exact wording of the following message in
489 the manual (trouble.texi, node "Name lookup"), so they need to
490 be kept in synch. */
491 permerror (input_location, "there are no arguments to %qD that depend on a template "
492 "parameter, so a declaration of %qD must be available",
493 name, name);
495 if (!flag_permissive)
497 static bool hint;
498 if (!hint)
500 inform (input_location, "(if you use %<-fpermissive%>, G++ will accept your "
501 "code, but allowing the use of an undeclared name is "
502 "deprecated)");
503 hint = true;
506 return name;
509 return unqualified_name_lookup_error (name);
512 /* Wrapper around build_lang_decl_loc(). Should gradually move to
513 build_lang_decl_loc() and then rename build_lang_decl_loc() back to
514 build_lang_decl(). */
516 tree
517 build_lang_decl (enum tree_code code, tree name, tree type)
519 return build_lang_decl_loc (input_location, code, name, type);
522 /* Build a decl from CODE, NAME, TYPE declared at LOC, and then add
523 DECL_LANG_SPECIFIC info to the result. */
525 tree
526 build_lang_decl_loc (location_t loc, enum tree_code code, tree name, tree type)
528 tree t;
530 t = build_decl (loc, code, name, type);
531 retrofit_lang_decl (t);
533 return t;
536 /* Add DECL_LANG_SPECIFIC info to T. Called from build_lang_decl
537 and pushdecl (for functions generated by the back end). */
539 void
540 retrofit_lang_decl (tree t)
542 struct lang_decl *ld;
543 size_t size;
544 int sel;
546 if (TREE_CODE (t) == FUNCTION_DECL)
547 sel = 1, size = sizeof (struct lang_decl_fn);
548 else if (TREE_CODE (t) == NAMESPACE_DECL)
549 sel = 2, size = sizeof (struct lang_decl_ns);
550 else if (TREE_CODE (t) == PARM_DECL)
551 sel = 3, size = sizeof (struct lang_decl_parm);
552 else if (LANG_DECL_HAS_MIN (t))
553 sel = 0, size = sizeof (struct lang_decl_min);
554 else
555 gcc_unreachable ();
557 ld = ggc_alloc_cleared_lang_decl (size);
559 ld->u.base.selector = sel;
561 DECL_LANG_SPECIFIC (t) = ld;
562 if (current_lang_name == lang_name_cplusplus
563 || decl_linkage (t) == lk_none)
564 SET_DECL_LANGUAGE (t, lang_cplusplus);
565 else if (current_lang_name == lang_name_c)
566 SET_DECL_LANGUAGE (t, lang_c);
567 else if (current_lang_name == lang_name_java)
568 SET_DECL_LANGUAGE (t, lang_java);
569 else
570 gcc_unreachable ();
572 #ifdef GATHER_STATISTICS
573 tree_node_counts[(int)lang_decl] += 1;
574 tree_node_sizes[(int)lang_decl] += size;
575 #endif
578 void
579 cxx_dup_lang_specific_decl (tree node)
581 int size;
582 struct lang_decl *ld;
584 if (! DECL_LANG_SPECIFIC (node))
585 return;
587 if (TREE_CODE (node) == FUNCTION_DECL)
588 size = sizeof (struct lang_decl_fn);
589 else if (TREE_CODE (node) == NAMESPACE_DECL)
590 size = sizeof (struct lang_decl_ns);
591 else if (TREE_CODE (node) == PARM_DECL)
592 size = sizeof (struct lang_decl_parm);
593 else if (LANG_DECL_HAS_MIN (node))
594 size = sizeof (struct lang_decl_min);
595 else
596 gcc_unreachable ();
598 ld = ggc_alloc_lang_decl (size);
599 memcpy (ld, DECL_LANG_SPECIFIC (node), size);
600 DECL_LANG_SPECIFIC (node) = ld;
602 #ifdef GATHER_STATISTICS
603 tree_node_counts[(int)lang_decl] += 1;
604 tree_node_sizes[(int)lang_decl] += size;
605 #endif
608 /* Copy DECL, including any language-specific parts. */
610 tree
611 copy_decl (tree decl)
613 tree copy;
615 copy = copy_node (decl);
616 cxx_dup_lang_specific_decl (copy);
617 return copy;
620 /* Replace the shared language-specific parts of NODE with a new copy. */
622 static void
623 copy_lang_type (tree node)
625 int size;
626 struct lang_type *lt;
628 if (! TYPE_LANG_SPECIFIC (node))
629 return;
631 if (TYPE_LANG_SPECIFIC (node)->u.h.is_lang_type_class)
632 size = sizeof (struct lang_type);
633 else
634 size = sizeof (struct lang_type_ptrmem);
635 lt = ggc_alloc_lang_type (size);
636 memcpy (lt, TYPE_LANG_SPECIFIC (node), size);
637 TYPE_LANG_SPECIFIC (node) = lt;
639 #ifdef GATHER_STATISTICS
640 tree_node_counts[(int)lang_type] += 1;
641 tree_node_sizes[(int)lang_type] += size;
642 #endif
645 /* Copy TYPE, including any language-specific parts. */
647 tree
648 copy_type (tree type)
650 tree copy;
652 copy = copy_node (type);
653 copy_lang_type (copy);
654 return copy;
657 tree
658 cxx_make_type (enum tree_code code)
660 tree t = make_node (code);
662 /* Create lang_type structure. */
663 if (RECORD_OR_UNION_CODE_P (code)
664 || code == BOUND_TEMPLATE_TEMPLATE_PARM)
666 struct lang_type *pi
667 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type));
669 TYPE_LANG_SPECIFIC (t) = pi;
670 pi->u.c.h.is_lang_type_class = 1;
672 #ifdef GATHER_STATISTICS
673 tree_node_counts[(int)lang_type] += 1;
674 tree_node_sizes[(int)lang_type] += sizeof (struct lang_type);
675 #endif
678 /* Set up some flags that give proper default behavior. */
679 if (RECORD_OR_UNION_CODE_P (code))
681 struct c_fileinfo *finfo = get_fileinfo (input_filename);
682 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, finfo->interface_unknown);
683 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
686 return t;
689 tree
690 make_class_type (enum tree_code code)
692 tree t = cxx_make_type (code);
693 SET_CLASS_TYPE_P (t, 1);
694 return t;
697 /* Returns true if we are currently in the main source file, or in a
698 template instantiation started from the main source file. */
700 bool
701 in_main_input_context (void)
703 struct tinst_level *tl = outermost_tinst_level();
705 if (tl)
706 return strcmp (main_input_filename,
707 LOCATION_FILE (tl->locus)) == 0;
708 else
709 return strcmp (main_input_filename, input_filename) == 0;