* ipa-devirt.c: Include gimple-pretty-print.h
[official-gcc.git] / gcc / cp / lex.c
blob57b779d77e18828cbe756f8117b58d514ee99935
1 /* Separate lexical analyzer for GNU C++.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This file is the lexical analyzer for GNU C++. */
24 #include "config.h"
25 #include "system.h"
26 #include "coretypes.h"
27 #include "tm.h"
28 #include "input.h"
29 #include "tree.h"
30 #include "stringpool.h"
31 #include "cp-tree.h"
32 #include "cpplib.h"
33 #include "flags.h"
34 #include "c-family/c-pragma.h"
35 #include "c-family/c-objc.h"
36 #include "tm_p.h"
37 #include "timevar.h"
39 static int interface_strcmp (const char *);
40 static void init_cp_pragma (void);
42 static tree parse_strconst_pragma (const char *, int);
43 static void handle_pragma_vtable (cpp_reader *);
44 static void handle_pragma_unit (cpp_reader *);
45 static void handle_pragma_interface (cpp_reader *);
46 static void handle_pragma_implementation (cpp_reader *);
47 static void handle_pragma_java_exceptions (cpp_reader *);
49 static void init_operators (void);
50 static void copy_lang_type (tree);
52 /* A constraint that can be tested at compile time. */
53 #define CONSTRAINT(name, expr) extern int constraint_##name [(expr) ? 1 : -1]
55 /* Functions and data structures for #pragma interface.
57 `#pragma implementation' means that the main file being compiled
58 is considered to implement (provide) the classes that appear in
59 its main body. I.e., if this is file "foo.cc", and class `bar'
60 is defined in "foo.cc", then we say that "foo.cc implements bar".
62 All main input files "implement" themselves automagically.
64 `#pragma interface' means that unless this file (of the form "foo.h"
65 is not presently being included by file "foo.cc", the
66 CLASSTYPE_INTERFACE_ONLY bit gets set. The effect is that none
67 of the vtables nor any of the inline functions defined in foo.h
68 will ever be output.
70 There are cases when we want to link files such as "defs.h" and
71 "main.cc". In this case, we give "defs.h" a `#pragma interface',
72 and "main.cc" has `#pragma implementation "defs.h"'. */
74 struct impl_files
76 const char *filename;
77 struct impl_files *next;
80 static struct impl_files *impl_file_chain;
82 /* True if we saw "#pragma GCC java_exceptions". */
83 bool pragma_java_exceptions;
85 void
86 cxx_finish (void)
88 c_common_finish ();
91 /* A mapping from tree codes to operator name information. */
92 operator_name_info_t operator_name_info[(int) MAX_TREE_CODES];
93 /* Similar, but for assignment operators. */
94 operator_name_info_t assignment_operator_name_info[(int) MAX_TREE_CODES];
96 /* Initialize data structures that keep track of operator names. */
98 #define DEF_OPERATOR(NAME, C, M, AR, AP) \
99 CONSTRAINT (C, sizeof "operator " + sizeof NAME <= 256);
100 #include "operators.def"
101 #undef DEF_OPERATOR
103 static void
104 init_operators (void)
106 tree identifier;
107 char buffer[256];
108 struct operator_name_info_t *oni;
110 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
111 sprintf (buffer, ISALPHA (NAME[0]) ? "operator %s" : "operator%s", NAME); \
112 identifier = get_identifier (buffer); \
113 IDENTIFIER_OPNAME_P (identifier) = 1; \
115 oni = (ASSN_P \
116 ? &assignment_operator_name_info[(int) CODE] \
117 : &operator_name_info[(int) CODE]); \
118 oni->identifier = identifier; \
119 oni->name = NAME; \
120 oni->mangled_name = MANGLING; \
121 oni->arity = ARITY;
123 #include "operators.def"
124 #undef DEF_OPERATOR
126 operator_name_info[(int) ERROR_MARK].identifier
127 = get_identifier ("<invalid operator>");
129 /* Handle some special cases. These operators are not defined in
130 the language, but can be produced internally. We may need them
131 for error-reporting. (Eventually, we should ensure that this
132 does not happen. Error messages involving these operators will
133 be confusing to users.) */
135 operator_name_info [(int) INIT_EXPR].name
136 = operator_name_info [(int) MODIFY_EXPR].name;
137 operator_name_info [(int) EXACT_DIV_EXPR].name = "(ceiling /)";
138 operator_name_info [(int) CEIL_DIV_EXPR].name = "(ceiling /)";
139 operator_name_info [(int) FLOOR_DIV_EXPR].name = "(floor /)";
140 operator_name_info [(int) ROUND_DIV_EXPR].name = "(round /)";
141 operator_name_info [(int) CEIL_MOD_EXPR].name = "(ceiling %)";
142 operator_name_info [(int) FLOOR_MOD_EXPR].name = "(floor %)";
143 operator_name_info [(int) ROUND_MOD_EXPR].name = "(round %)";
144 operator_name_info [(int) ABS_EXPR].name = "abs";
145 operator_name_info [(int) TRUTH_AND_EXPR].name = "strict &&";
146 operator_name_info [(int) TRUTH_OR_EXPR].name = "strict ||";
147 operator_name_info [(int) RANGE_EXPR].name = "...";
148 operator_name_info [(int) UNARY_PLUS_EXPR].name = "+";
150 assignment_operator_name_info [(int) EXACT_DIV_EXPR].name
151 = "(exact /=)";
152 assignment_operator_name_info [(int) CEIL_DIV_EXPR].name
153 = "(ceiling /=)";
154 assignment_operator_name_info [(int) FLOOR_DIV_EXPR].name
155 = "(floor /=)";
156 assignment_operator_name_info [(int) ROUND_DIV_EXPR].name
157 = "(round /=)";
158 assignment_operator_name_info [(int) CEIL_MOD_EXPR].name
159 = "(ceiling %=)";
160 assignment_operator_name_info [(int) FLOOR_MOD_EXPR].name
161 = "(floor %=)";
162 assignment_operator_name_info [(int) ROUND_MOD_EXPR].name
163 = "(round %=)";
166 /* Initialize the reserved words. */
168 void
169 init_reswords (void)
171 unsigned int i;
172 tree id;
173 int mask = 0;
175 if (cxx_dialect < cxx11)
176 mask |= D_CXX0X;
177 if (flag_no_asm)
178 mask |= D_ASM | D_EXT;
179 if (flag_no_gnu_keywords)
180 mask |= D_EXT;
182 /* The Objective-C keywords are all context-dependent. */
183 mask |= D_OBJC;
185 ridpointers = ggc_cleared_vec_alloc<tree> ((int) RID_MAX);
186 for (i = 0; i < num_c_common_reswords; i++)
188 if (c_common_reswords[i].disable & D_CONLY)
189 continue;
190 id = get_identifier (c_common_reswords[i].word);
191 C_SET_RID_CODE (id, c_common_reswords[i].rid);
192 ridpointers [(int) c_common_reswords[i].rid] = id;
193 if (! (c_common_reswords[i].disable & mask))
194 C_IS_RESERVED_WORD (id) = 1;
198 static void
199 init_cp_pragma (void)
201 c_register_pragma (0, "vtable", handle_pragma_vtable);
202 c_register_pragma (0, "unit", handle_pragma_unit);
203 c_register_pragma (0, "interface", handle_pragma_interface);
204 c_register_pragma (0, "implementation", handle_pragma_implementation);
205 c_register_pragma ("GCC", "interface", handle_pragma_interface);
206 c_register_pragma ("GCC", "implementation", handle_pragma_implementation);
207 c_register_pragma ("GCC", "java_exceptions", handle_pragma_java_exceptions);
210 /* TRUE if a code represents a statement. */
212 bool statement_code_p[MAX_TREE_CODES];
214 /* Initialize the C++ front end. This function is very sensitive to
215 the exact order that things are done here. It would be nice if the
216 initialization done by this routine were moved to its subroutines,
217 and the ordering dependencies clarified and reduced. */
218 bool
219 cxx_init (void)
221 location_t saved_loc;
222 unsigned int i;
223 static const enum tree_code stmt_codes[] = {
224 CTOR_INITIALIZER, TRY_BLOCK, HANDLER,
225 EH_SPEC_BLOCK, USING_STMT, TAG_DEFN,
226 IF_STMT, CLEANUP_STMT, FOR_STMT,
227 RANGE_FOR_STMT, WHILE_STMT, DO_STMT,
228 BREAK_STMT, CONTINUE_STMT, SWITCH_STMT,
229 EXPR_STMT
232 memset (&statement_code_p, 0, sizeof (statement_code_p));
233 for (i = 0; i < ARRAY_SIZE (stmt_codes); i++)
234 statement_code_p[stmt_codes[i]] = true;
236 saved_loc = input_location;
237 input_location = BUILTINS_LOCATION;
239 init_reswords ();
240 init_tree ();
241 init_cp_semantics ();
242 init_operators ();
243 init_method ();
244 init_error ();
246 current_function_decl = NULL;
248 class_type_node = ridpointers[(int) RID_CLASS];
250 cxx_init_decl_processing ();
252 if (c_common_init () == false)
254 input_location = saved_loc;
255 return false;
258 init_cp_pragma ();
260 init_repo ();
262 input_location = saved_loc;
263 return true;
266 /* Return nonzero if S is not considered part of an
267 INTERFACE/IMPLEMENTATION pair. Otherwise, return 0. */
269 static int
270 interface_strcmp (const char* s)
272 /* Set the interface/implementation bits for this scope. */
273 struct impl_files *ifiles;
274 const char *s1;
276 for (ifiles = impl_file_chain; ifiles; ifiles = ifiles->next)
278 const char *t1 = ifiles->filename;
279 s1 = s;
281 if (*s1 == 0 || filename_ncmp (s1, t1, 1) != 0)
282 continue;
284 while (*s1 != 0 && filename_ncmp (s1, t1, 1) == 0)
285 s1++, t1++;
287 /* A match. */
288 if (*s1 == *t1)
289 return 0;
291 /* Don't get faked out by xxx.yyy.cc vs xxx.zzz.cc. */
292 if (strchr (s1, '.') || strchr (t1, '.'))
293 continue;
295 if (*s1 == '\0' || s1[-1] != '.' || t1[-1] != '.')
296 continue;
298 /* A match. */
299 return 0;
302 /* No matches. */
303 return 1;
308 /* Parse a #pragma whose sole argument is a string constant.
309 If OPT is true, the argument is optional. */
310 static tree
311 parse_strconst_pragma (const char* name, int opt)
313 tree result, x;
314 enum cpp_ttype t;
316 t = pragma_lex (&result);
317 if (t == CPP_STRING)
319 if (pragma_lex (&x) != CPP_EOF)
320 warning (0, "junk at end of #pragma %s", name);
321 return result;
324 if (t == CPP_EOF && opt)
325 return NULL_TREE;
327 error ("invalid #pragma %s", name);
328 return error_mark_node;
331 static void
332 handle_pragma_vtable (cpp_reader* /*dfile*/)
334 parse_strconst_pragma ("vtable", 0);
335 sorry ("#pragma vtable no longer supported");
338 static void
339 handle_pragma_unit (cpp_reader* /*dfile*/)
341 /* Validate syntax, but don't do anything. */
342 parse_strconst_pragma ("unit", 0);
345 static void
346 handle_pragma_interface (cpp_reader* /*dfile*/)
348 tree fname = parse_strconst_pragma ("interface", 1);
349 struct c_fileinfo *finfo;
350 const char *filename;
352 if (fname == error_mark_node)
353 return;
354 else if (fname == 0)
355 filename = lbasename (LOCATION_FILE (input_location));
356 else
357 filename = TREE_STRING_POINTER (fname);
359 finfo = get_fileinfo (LOCATION_FILE (input_location));
361 if (impl_file_chain == 0)
363 /* If this is zero at this point, then we are
364 auto-implementing. */
365 if (main_input_filename == 0)
366 main_input_filename = LOCATION_FILE (input_location);
369 finfo->interface_only = interface_strcmp (filename);
370 /* If MULTIPLE_SYMBOL_SPACES is set, we cannot assume that we can see
371 a definition in another file. */
372 if (!MULTIPLE_SYMBOL_SPACES || !finfo->interface_only)
373 finfo->interface_unknown = 0;
376 /* Note that we have seen a #pragma implementation for the key MAIN_FILENAME.
377 We used to only allow this at toplevel, but that restriction was buggy
378 in older compilers and it seems reasonable to allow it in the headers
379 themselves, too. It only needs to precede the matching #p interface.
381 We don't touch finfo->interface_only or finfo->interface_unknown;
382 the user must specify a matching #p interface for this to have
383 any effect. */
385 static void
386 handle_pragma_implementation (cpp_reader* /*dfile*/)
388 tree fname = parse_strconst_pragma ("implementation", 1);
389 const char *filename;
390 struct impl_files *ifiles = impl_file_chain;
392 if (fname == error_mark_node)
393 return;
395 if (fname == 0)
397 if (main_input_filename)
398 filename = main_input_filename;
399 else
400 filename = LOCATION_FILE (input_location);
401 filename = lbasename (filename);
403 else
405 filename = TREE_STRING_POINTER (fname);
406 if (cpp_included_before (parse_in, filename, input_location))
407 warning (0, "#pragma implementation for %qs appears after "
408 "file is included", filename);
411 for (; ifiles; ifiles = ifiles->next)
413 if (! filename_cmp (ifiles->filename, filename))
414 break;
416 if (ifiles == 0)
418 ifiles = XNEW (struct impl_files);
419 ifiles->filename = xstrdup (filename);
420 ifiles->next = impl_file_chain;
421 impl_file_chain = ifiles;
425 /* Indicate that this file uses Java-personality exception handling. */
426 static void
427 handle_pragma_java_exceptions (cpp_reader* /*dfile*/)
429 tree x;
430 if (pragma_lex (&x) != CPP_EOF)
431 warning (0, "junk at end of #pragma GCC java_exceptions");
433 choose_personality_routine (lang_java);
434 pragma_java_exceptions = true;
437 /* Issue an error message indicating that the lookup of NAME (an
438 IDENTIFIER_NODE) failed. Returns the ERROR_MARK_NODE. */
440 tree
441 unqualified_name_lookup_error (tree name)
443 if (IDENTIFIER_OPNAME_P (name))
445 if (name != ansi_opname (ERROR_MARK))
446 error ("%qD not defined", name);
448 else
450 if (!objc_diagnose_private_ivar (name))
452 error ("%qD was not declared in this scope", name);
453 suggest_alternatives_for (location_of (name), name);
455 /* Prevent repeated error messages by creating a VAR_DECL with
456 this NAME in the innermost block scope. */
457 if (local_bindings_p ())
459 tree decl;
460 decl = build_decl (input_location,
461 VAR_DECL, name, error_mark_node);
462 DECL_CONTEXT (decl) = current_function_decl;
463 push_local_binding (name, decl, 0);
464 /* Mark the variable as used so that we do not get warnings
465 about it being unused later. */
466 TREE_USED (decl) = 1;
470 return error_mark_node;
473 /* Like unqualified_name_lookup_error, but NAME is an unqualified-id
474 used as a function. Returns an appropriate expression for
475 NAME. */
477 tree
478 unqualified_fn_lookup_error (tree name)
480 if (processing_template_decl)
482 /* In a template, it is invalid to write "f()" or "f(3)" if no
483 declaration of "f" is available. Historically, G++ and most
484 other compilers accepted that usage since they deferred all name
485 lookup until instantiation time rather than doing unqualified
486 name lookup at template definition time; explain to the user what
487 is going wrong.
489 Note that we have the exact wording of the following message in
490 the manual (trouble.texi, node "Name lookup"), so they need to
491 be kept in synch. */
492 permerror (input_location, "there are no arguments to %qD that depend on a template "
493 "parameter, so a declaration of %qD must be available",
494 name, name);
496 if (!flag_permissive)
498 static bool hint;
499 if (!hint)
501 inform (input_location, "(if you use %<-fpermissive%>, G++ will accept your "
502 "code, but allowing the use of an undeclared name is "
503 "deprecated)");
504 hint = true;
507 return name;
510 return unqualified_name_lookup_error (name);
513 /* Wrapper around build_lang_decl_loc(). Should gradually move to
514 build_lang_decl_loc() and then rename build_lang_decl_loc() back to
515 build_lang_decl(). */
517 tree
518 build_lang_decl (enum tree_code code, tree name, tree type)
520 return build_lang_decl_loc (input_location, code, name, type);
523 /* Build a decl from CODE, NAME, TYPE declared at LOC, and then add
524 DECL_LANG_SPECIFIC info to the result. */
526 tree
527 build_lang_decl_loc (location_t loc, enum tree_code code, tree name, tree type)
529 tree t;
531 t = build_decl (loc, code, name, type);
532 retrofit_lang_decl (t);
534 return t;
537 /* Add DECL_LANG_SPECIFIC info to T. Called from build_lang_decl
538 and pushdecl (for functions generated by the back end). */
540 void
541 retrofit_lang_decl (tree t)
543 struct lang_decl *ld;
544 size_t size;
545 int sel;
547 if (TREE_CODE (t) == FUNCTION_DECL)
548 sel = 1, size = sizeof (struct lang_decl_fn);
549 else if (TREE_CODE (t) == NAMESPACE_DECL)
550 sel = 2, size = sizeof (struct lang_decl_ns);
551 else if (TREE_CODE (t) == PARM_DECL)
552 sel = 3, size = sizeof (struct lang_decl_parm);
553 else if (LANG_DECL_HAS_MIN (t))
554 sel = 0, size = sizeof (struct lang_decl_min);
555 else
556 gcc_unreachable ();
558 ld = (struct lang_decl *) ggc_internal_cleared_alloc (size);
560 ld->u.base.selector = sel;
562 DECL_LANG_SPECIFIC (t) = ld;
563 if (current_lang_name == lang_name_cplusplus
564 || decl_linkage (t) == lk_none)
565 SET_DECL_LANGUAGE (t, lang_cplusplus);
566 else if (current_lang_name == lang_name_c)
567 SET_DECL_LANGUAGE (t, lang_c);
568 else if (current_lang_name == lang_name_java)
569 SET_DECL_LANGUAGE (t, lang_java);
570 else
571 gcc_unreachable ();
573 if (GATHER_STATISTICS)
575 tree_node_counts[(int)lang_decl] += 1;
576 tree_node_sizes[(int)lang_decl] += size;
580 void
581 cxx_dup_lang_specific_decl (tree node)
583 int size;
584 struct lang_decl *ld;
586 if (! DECL_LANG_SPECIFIC (node))
587 return;
589 if (TREE_CODE (node) == FUNCTION_DECL)
590 size = sizeof (struct lang_decl_fn);
591 else if (TREE_CODE (node) == NAMESPACE_DECL)
592 size = sizeof (struct lang_decl_ns);
593 else if (TREE_CODE (node) == PARM_DECL)
594 size = sizeof (struct lang_decl_parm);
595 else if (LANG_DECL_HAS_MIN (node))
596 size = sizeof (struct lang_decl_min);
597 else
598 gcc_unreachable ();
600 ld = (struct lang_decl *) ggc_internal_alloc (size);
601 memcpy (ld, DECL_LANG_SPECIFIC (node), size);
602 DECL_LANG_SPECIFIC (node) = ld;
604 if (GATHER_STATISTICS)
606 tree_node_counts[(int)lang_decl] += 1;
607 tree_node_sizes[(int)lang_decl] += size;
611 /* Copy DECL, including any language-specific parts. */
613 tree
614 copy_decl (tree decl)
616 tree copy;
618 copy = copy_node (decl);
619 cxx_dup_lang_specific_decl (copy);
620 return copy;
623 /* Replace the shared language-specific parts of NODE with a new copy. */
625 static void
626 copy_lang_type (tree node)
628 int size;
629 struct lang_type *lt;
631 if (! TYPE_LANG_SPECIFIC (node))
632 return;
634 if (TYPE_LANG_SPECIFIC (node)->u.h.is_lang_type_class)
635 size = sizeof (struct lang_type);
636 else
637 size = sizeof (struct lang_type_ptrmem);
638 lt = (struct lang_type *) ggc_internal_alloc (size);
639 memcpy (lt, TYPE_LANG_SPECIFIC (node), size);
640 TYPE_LANG_SPECIFIC (node) = lt;
642 if (GATHER_STATISTICS)
644 tree_node_counts[(int)lang_type] += 1;
645 tree_node_sizes[(int)lang_type] += size;
649 /* Copy TYPE, including any language-specific parts. */
651 tree
652 copy_type (tree type)
654 tree copy;
656 copy = copy_node (type);
657 copy_lang_type (copy);
658 return copy;
661 tree
662 cxx_make_type (enum tree_code code)
664 tree t = make_node (code);
666 /* Create lang_type structure. */
667 if (RECORD_OR_UNION_CODE_P (code)
668 || code == BOUND_TEMPLATE_TEMPLATE_PARM)
670 struct lang_type *pi
671 = (struct lang_type *) ggc_internal_cleared_alloc
672 (sizeof (struct lang_type));
674 TYPE_LANG_SPECIFIC (t) = pi;
675 pi->u.c.h.is_lang_type_class = 1;
677 if (GATHER_STATISTICS)
679 tree_node_counts[(int)lang_type] += 1;
680 tree_node_sizes[(int)lang_type] += sizeof (struct lang_type);
684 /* Set up some flags that give proper default behavior. */
685 if (RECORD_OR_UNION_CODE_P (code))
687 struct c_fileinfo *finfo = \
688 get_fileinfo (LOCATION_FILE (input_location));
689 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, finfo->interface_unknown);
690 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
693 return t;
696 tree
697 make_class_type (enum tree_code code)
699 tree t = cxx_make_type (code);
700 SET_CLASS_TYPE_P (t, 1);
701 return t;
704 /* Returns true if we are currently in the main source file, or in a
705 template instantiation started from the main source file. */
707 bool
708 in_main_input_context (void)
710 struct tinst_level *tl = outermost_tinst_level();
712 if (tl)
713 return filename_cmp (main_input_filename,
714 LOCATION_FILE (tl->locus)) == 0;
715 else
716 return filename_cmp (main_input_filename, LOCATION_FILE (input_location)) == 0;