1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
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/>. */
23 #include "coretypes.h"
35 #include "diagnostic.h"
40 #include "langhooks.h"
41 #include "tree-inline.h"
44 #include "tree-iterator.h"
46 #include "tree-mudflap.h"
50 #include "target-def.h"
51 #include "fixed-value.h"
53 cpp_reader *parse_in; /* Declared in c-pragma.h. */
55 /* We let tm.h override the types used here, to handle trivial differences
56 such as the choice of unsigned int or long unsigned int for size_t.
57 When machines start needing nontrivial differences in the size type,
58 it would be best to do something here to figure out automatically
59 from other information what type to use. */
62 #define SIZE_TYPE "long unsigned int"
66 #define PID_TYPE "int"
70 #define WCHAR_TYPE "int"
73 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
74 #define MODIFIED_WCHAR_TYPE \
75 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
78 #define PTRDIFF_TYPE "long int"
82 #define WINT_TYPE "unsigned int"
86 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
88 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
97 ? "long unsigned int" \
98 : "long long unsigned int"))
101 /* The following symbols are subsumed in the c_global_trees array, and
102 listed here individually for documentation purposes.
104 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
106 tree short_integer_type_node;
107 tree long_integer_type_node;
108 tree long_long_integer_type_node;
110 tree short_unsigned_type_node;
111 tree long_unsigned_type_node;
112 tree long_long_unsigned_type_node;
114 tree truthvalue_type_node;
115 tree truthvalue_false_node;
116 tree truthvalue_true_node;
118 tree ptrdiff_type_node;
120 tree unsigned_char_type_node;
121 tree signed_char_type_node;
122 tree wchar_type_node;
123 tree signed_wchar_type_node;
124 tree unsigned_wchar_type_node;
126 tree float_type_node;
127 tree double_type_node;
128 tree long_double_type_node;
130 tree complex_integer_type_node;
131 tree complex_float_type_node;
132 tree complex_double_type_node;
133 tree complex_long_double_type_node;
135 tree dfloat32_type_node;
136 tree dfloat64_type_node;
137 tree_dfloat128_type_node;
139 tree intQI_type_node;
140 tree intHI_type_node;
141 tree intSI_type_node;
142 tree intDI_type_node;
143 tree intTI_type_node;
145 tree unsigned_intQI_type_node;
146 tree unsigned_intHI_type_node;
147 tree unsigned_intSI_type_node;
148 tree unsigned_intDI_type_node;
149 tree unsigned_intTI_type_node;
151 tree widest_integer_literal_type_node;
152 tree widest_unsigned_literal_type_node;
154 Nodes for types `void *' and `const void *'.
156 tree ptr_type_node, const_ptr_type_node;
158 Nodes for types `char *' and `const char *'.
160 tree string_type_node, const_string_type_node;
162 Type `char[SOMENUMBER]'.
163 Used when an array of char is needed and the size is irrelevant.
165 tree char_array_type_node;
167 Type `int[SOMENUMBER]' or something like it.
168 Used when an array of int needed and the size is irrelevant.
170 tree int_array_type_node;
172 Type `wchar_t[SOMENUMBER]' or something like it.
173 Used when a wide string literal is created.
175 tree wchar_array_type_node;
177 Type `int ()' -- used for implicit declaration of functions.
179 tree default_function_type;
181 A VOID_TYPE node, packaged in a TREE_LIST.
185 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
186 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
187 VAR_DECLS, but C++ does.)
189 tree function_name_decl_node;
190 tree pretty_function_name_decl_node;
191 tree c99_function_name_decl_node;
193 Stack of nested function name VAR_DECLs.
195 tree saved_function_name_decls;
199 tree c_global_trees[CTI_MAX];
201 /* Switches common to the C front ends. */
203 /* Nonzero if prepreprocessing only. */
205 int flag_preprocess_only;
207 /* Nonzero means don't output line number information. */
209 char flag_no_line_commands;
211 /* Nonzero causes -E output not to be done, but directives such as
212 #define that have side effects are still obeyed. */
216 /* Nonzero means dump macros in some fashion. */
218 char flag_dump_macros;
220 /* Nonzero means pass #include lines through to the output. */
222 char flag_dump_includes;
224 /* Nonzero means process PCH files while preprocessing. */
226 bool flag_pch_preprocess;
228 /* The file name to which we should write a precompiled header, or
229 NULL if no header will be written in this compile. */
231 const char *pch_file;
233 /* Nonzero if an ISO standard was selected. It rejects macros in the
237 /* Nonzero if -undef was given. It suppresses target built-in macros
241 /* Nonzero means don't recognize the non-ANSI builtin functions. */
245 /* Nonzero means don't recognize the non-ANSI builtin functions.
248 int flag_no_nonansi_builtin;
250 /* Nonzero means give `double' the same size as `float'. */
252 int flag_short_double;
254 /* Nonzero means give `wchar_t' the same size as `short'. */
256 int flag_short_wchar;
258 /* Nonzero means allow implicit conversions between vectors with
259 differing numbers of subparts and/or differing element types. */
260 int flag_lax_vector_conversions;
262 /* Nonzero means allow Microsoft extensions without warnings or errors. */
263 int flag_ms_extensions;
265 /* Nonzero means don't recognize the keyword `asm'. */
269 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
271 int flag_signed_bitfields = 1;
273 /* Warn about #pragma directives that are not recognized. */
275 int warn_unknown_pragmas; /* Tri state variable. */
277 /* Warn about format/argument anomalies in calls to formatted I/O functions
278 (*printf, *scanf, strftime, strfmon, etc.). */
282 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
283 with GCC this doesn't matter as __null is guaranteed to have the right
286 int warn_strict_null_sentinel;
288 /* Zero means that faster, ...NonNil variants of objc_msgSend...
289 calls will be used in ObjC; passing nil receivers to such calls
290 will most likely result in crashes. */
291 int flag_nil_receivers = 1;
293 /* Nonzero means that code generation will be altered to support
294 "zero-link" execution. This currently affects ObjC only, but may
295 affect other languages in the future. */
296 int flag_zero_link = 0;
298 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
299 unit. It will inform the ObjC runtime that class definition(s) herein
300 contained are to replace one(s) previously loaded. */
301 int flag_replace_objc_classes = 0;
303 /* C/ObjC language option variables. */
306 /* Nonzero means allow type mismatches in conditional expressions;
307 just make their values `void'. */
309 int flag_cond_mismatch;
311 /* Nonzero means enable C89 Amendment 1 features. */
315 /* Nonzero means use the ISO C99 dialect of C. */
319 /* Nonzero means that we have builtin functions, and main is an int. */
323 /* Warn if main is suspicious. */
328 /* ObjC language option variables. */
331 /* Open and close the file for outputting class declarations, if
334 int flag_gen_declaration;
336 /* Tells the compiler that this is a special run. Do not perform any
337 compiling, instead we are to test some platform dependent features
338 and output a C header file with appropriate definitions. */
340 int print_struct_values;
342 /* Tells the compiler what is the constant string class for Objc. */
344 const char *constant_string_class_name;
347 /* C++ language option variables. */
350 /* Nonzero means don't recognize any extension keywords. */
352 int flag_no_gnu_keywords;
354 /* Nonzero means do emit exported implementations of functions even if
355 they can be inlined. */
357 int flag_implement_inlines = 1;
359 /* Nonzero means that implicit instantiations will be emitted if needed. */
361 int flag_implicit_templates = 1;
363 /* Nonzero means that implicit instantiations of inline templates will be
364 emitted if needed, even if instantiations of non-inline templates
367 int flag_implicit_inline_templates = 1;
369 /* Nonzero means generate separate instantiation control files and
370 juggle them at link time. */
372 int flag_use_repository;
374 /* Nonzero if we want to issue diagnostics that the standard says are not
377 int flag_optional_diags = 1;
379 /* Nonzero means we should attempt to elide constructors when possible. */
381 int flag_elide_constructors = 1;
383 /* Nonzero means that member functions defined in class scope are
384 inline by default. */
386 int flag_default_inline = 1;
388 /* Controls whether compiler generates 'type descriptor' that give
389 run-time type information. */
393 /* Nonzero if we want to conserve space in the .o files. We do this
394 by putting uninitialized data and runtime initialized data into
395 .common instead of .data at the expense of not flagging multiple
398 int flag_conserve_space;
400 /* Nonzero if we want to obey access control semantics. */
402 int flag_access_control = 1;
404 /* Nonzero if we want to check the return value of new and avoid calling
405 constructors if it is a null pointer. */
409 /* The C++ dialect being used. C++98 is the default. */
411 enum cxx_dialect cxx_dialect = cxx98;
413 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
414 initialization variables.
415 0: Old rules, set by -fno-for-scope.
416 2: New ISO rules, set by -ffor-scope.
417 1: Try to implement new ISO rules, but with backup compatibility
418 (and warnings). This is the default, for now. */
420 int flag_new_for_scope = 1;
422 /* Nonzero if we want to emit defined symbols with common-like linkage as
423 weak symbols where possible, in order to conform to C++ semantics.
424 Otherwise, emit them as local symbols. */
428 /* 0 means we want the preprocessor to not emit line directives for
429 the current working directory. 1 means we want it to do it. -1
430 means we should decide depending on whether debugging information
431 is being emitted or not. */
433 int flag_working_directory = -1;
435 /* Nonzero to use __cxa_atexit, rather than atexit, to register
436 destructors for local statics and global objects. '2' means it has been
437 set nonzero as a default, not by a command-line flag. */
439 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
441 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
442 code. '2' means it has not been set explicitly on the command line. */
444 int flag_use_cxa_get_exception_ptr = 2;
446 /* Nonzero means make the default pedwarns warnings instead of errors.
447 The value of this flag is ignored if -pedantic is specified. */
451 /* Nonzero means to implement standard semantics for exception
452 specifications, calling unexpected if an exception is thrown that
453 doesn't match the specification. Zero means to treat them as
454 assertions and optimize accordingly, but not check them. */
456 int flag_enforce_eh_specs = 1;
458 /* Nonzero means to generate thread-safe code for initializing local
461 int flag_threadsafe_statics = 1;
463 /* Nonzero means warn about implicit declarations. */
465 int warn_implicit = 1;
467 /* Maximum template instantiation depth. This limit is rather
468 arbitrary, but it exists to limit the time it takes to notice
469 infinite template instantiations. */
471 int max_tinst_depth = 500;
475 /* The elements of `ridpointers' are identifier nodes for the reserved
476 type names and storage classes. It is indexed by a RID_... value. */
479 tree (*make_fname_decl) (tree, int);
481 /* Nonzero means the expression being parsed will never be evaluated.
482 This is a count, since unevaluated expressions can nest. */
485 /* Information about how a function name is generated. */
488 tree *const decl; /* pointer to the VAR_DECL. */
489 const unsigned rid; /* RID number for the identifier. */
490 const int pretty; /* How pretty is it? */
493 /* The three ways of getting then name of the current function. */
495 const struct fname_var_t fname_vars[] =
497 /* C99 compliant __func__, must be first. */
498 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
499 /* GCC __FUNCTION__ compliant. */
500 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
501 /* GCC __PRETTY_FUNCTION__ compliant. */
502 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
506 static tree check_case_value (tree);
507 static bool check_case_bounds (tree, tree, tree *, tree *);
509 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
510 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
511 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
512 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
513 static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
514 static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
516 static tree handle_always_inline_attribute (tree *, tree, tree, int,
518 static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
519 static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
520 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
521 static tree handle_error_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
526 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_transparent_union_attribute (tree *, tree, tree,
529 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
534 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
535 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
537 static tree handle_visibility_attribute (tree *, tree, tree, int,
539 static tree handle_tls_model_attribute (tree *, tree, tree, int,
541 static tree handle_no_instrument_function_attribute (tree *, tree,
543 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
544 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
545 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
547 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
548 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
549 static tree handle_deprecated_attribute (tree *, tree, tree, int,
551 static tree handle_vector_size_attribute (tree *, tree, tree, int,
553 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
554 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
555 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
556 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
558 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
559 static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
560 static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
562 static void check_function_nonnull (tree, int, tree *);
563 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
564 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
565 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
566 static int resort_field_decl_cmp (const void *, const void *);
568 /* Table of machine-independent attributes common to all C-like languages. */
569 const struct attribute_spec c_common_attribute_table[] =
571 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
572 { "packed", 0, 0, false, false, false,
573 handle_packed_attribute },
574 { "nocommon", 0, 0, true, false, false,
575 handle_nocommon_attribute },
576 { "common", 0, 0, true, false, false,
577 handle_common_attribute },
578 /* FIXME: logically, noreturn attributes should be listed as
579 "false, true, true" and apply to function types. But implementing this
580 would require all the places in the compiler that use TREE_THIS_VOLATILE
581 on a decl to identify non-returning functions to be located and fixed
582 to check the function type instead. */
583 { "noreturn", 0, 0, true, false, false,
584 handle_noreturn_attribute },
585 { "volatile", 0, 0, true, false, false,
586 handle_noreturn_attribute },
587 { "noinline", 0, 0, true, false, false,
588 handle_noinline_attribute },
589 { "always_inline", 0, 0, true, false, false,
590 handle_always_inline_attribute },
591 { "gnu_inline", 0, 0, true, false, false,
592 handle_gnu_inline_attribute },
593 { "artificial", 0, 0, true, false, false,
594 handle_artificial_attribute },
595 { "flatten", 0, 0, true, false, false,
596 handle_flatten_attribute },
597 { "used", 0, 0, true, false, false,
598 handle_used_attribute },
599 { "unused", 0, 0, false, false, false,
600 handle_unused_attribute },
601 { "externally_visible", 0, 0, true, false, false,
602 handle_externally_visible_attribute },
603 /* The same comments as for noreturn attributes apply to const ones. */
604 { "const", 0, 0, true, false, false,
605 handle_const_attribute },
606 { "transparent_union", 0, 0, false, false, false,
607 handle_transparent_union_attribute },
608 { "constructor", 0, 1, true, false, false,
609 handle_constructor_attribute },
610 { "destructor", 0, 1, true, false, false,
611 handle_destructor_attribute },
612 { "mode", 1, 1, false, true, false,
613 handle_mode_attribute },
614 { "section", 1, 1, true, false, false,
615 handle_section_attribute },
616 { "aligned", 0, 1, false, false, false,
617 handle_aligned_attribute },
618 { "weak", 0, 0, true, false, false,
619 handle_weak_attribute },
620 { "alias", 1, 1, true, false, false,
621 handle_alias_attribute },
622 { "weakref", 0, 1, true, false, false,
623 handle_weakref_attribute },
624 { "no_instrument_function", 0, 0, true, false, false,
625 handle_no_instrument_function_attribute },
626 { "malloc", 0, 0, true, false, false,
627 handle_malloc_attribute },
628 { "returns_twice", 0, 0, true, false, false,
629 handle_returns_twice_attribute },
630 { "no_stack_limit", 0, 0, true, false, false,
631 handle_no_limit_stack_attribute },
632 { "pure", 0, 0, true, false, false,
633 handle_pure_attribute },
634 /* For internal use (marking of builtins) only. The name contains space
635 to prevent its usage in source code. */
636 { "no vops", 0, 0, true, false, false,
637 handle_novops_attribute },
638 { "deprecated", 0, 0, false, false, false,
639 handle_deprecated_attribute },
640 { "vector_size", 1, 1, false, true, false,
641 handle_vector_size_attribute },
642 { "visibility", 1, 1, false, false, false,
643 handle_visibility_attribute },
644 { "tls_model", 1, 1, true, false, false,
645 handle_tls_model_attribute },
646 { "nonnull", 0, -1, false, true, true,
647 handle_nonnull_attribute },
648 { "nothrow", 0, 0, true, false, false,
649 handle_nothrow_attribute },
650 { "may_alias", 0, 0, false, true, false, NULL },
651 { "cleanup", 1, 1, true, false, false,
652 handle_cleanup_attribute },
653 { "warn_unused_result", 0, 0, false, true, true,
654 handle_warn_unused_result_attribute },
655 { "sentinel", 0, 1, false, true, true,
656 handle_sentinel_attribute },
657 /* For internal use (marking of builtins) only. The name contains space
658 to prevent its usage in source code. */
659 { "type generic", 0, 0, false, true, true,
660 handle_type_generic_attribute },
661 { "alloc_size", 1, 2, false, true, true,
662 handle_alloc_size_attribute },
663 { "cold", 0, 0, true, false, false,
664 handle_cold_attribute },
665 { "hot", 0, 0, true, false, false,
666 handle_hot_attribute },
667 { "warning", 1, 1, true, false, false,
668 handle_error_attribute },
669 { "error", 1, 1, true, false, false,
670 handle_error_attribute },
671 { NULL, 0, 0, false, false, false, NULL }
674 /* Give the specifications for the format attributes, used by C and all
677 const struct attribute_spec c_common_format_attribute_table[] =
679 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
680 { "format", 3, 3, false, true, true,
681 handle_format_attribute },
682 { "format_arg", 1, 1, false, true, true,
683 handle_format_arg_attribute },
684 { NULL, 0, 0, false, false, false, NULL }
687 /* Push current bindings for the function name VAR_DECLS. */
690 start_fname_decls (void)
693 tree saved = NULL_TREE;
695 for (ix = 0; fname_vars[ix].decl; ix++)
697 tree decl = *fname_vars[ix].decl;
701 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
702 *fname_vars[ix].decl = NULL_TREE;
705 if (saved || saved_function_name_decls)
706 /* Normally they'll have been NULL, so only push if we've got a
707 stack, or they are non-NULL. */
708 saved_function_name_decls = tree_cons (saved, NULL_TREE,
709 saved_function_name_decls);
712 /* Finish up the current bindings, adding them into the current function's
713 statement tree. This must be done _before_ finish_stmt_tree is called.
714 If there is no current function, we must be at file scope and no statements
715 are involved. Pop the previous bindings. */
718 finish_fname_decls (void)
721 tree stmts = NULL_TREE;
722 tree stack = saved_function_name_decls;
724 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
725 append_to_statement_list (TREE_VALUE (stack), &stmts);
729 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
731 if (TREE_CODE (*bodyp) == BIND_EXPR)
732 bodyp = &BIND_EXPR_BODY (*bodyp);
734 append_to_statement_list_force (*bodyp, &stmts);
738 for (ix = 0; fname_vars[ix].decl; ix++)
739 *fname_vars[ix].decl = NULL_TREE;
743 /* We had saved values, restore them. */
746 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
748 tree decl = TREE_PURPOSE (saved);
749 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
751 *fname_vars[ix].decl = decl;
753 stack = TREE_CHAIN (stack);
755 saved_function_name_decls = stack;
758 /* Return the text name of the current function, suitably prettified
759 by PRETTY_P. Return string must be freed by caller. */
762 fname_as_string (int pretty_p)
764 const char *name = "top level";
767 cpp_string cstr = { 0, 0 }, strname;
775 if (current_function_decl)
776 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
778 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
780 namep = XNEWVEC (char, len);
781 snprintf (namep, len, "\"%s\"", name);
782 strname.text = (unsigned char *) namep;
783 strname.len = len - 1;
785 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
788 return (const char *) cstr.text;
794 /* Expand DECL if it declares an entity not handled by the
798 c_expand_decl (tree decl)
800 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
802 /* Let the back-end know about this variable. */
803 if (!anon_aggr_type_p (TREE_TYPE (decl)))
804 emit_local_var (decl);
806 expand_anon_union_decl (decl, NULL_TREE,
807 DECL_ANON_UNION_ELEMS (decl));
816 /* Return the VAR_DECL for a const char array naming the current
817 function. If the VAR_DECL has not yet been created, create it
818 now. RID indicates how it should be formatted and IDENTIFIER_NODE
819 ID is its name (unfortunately C and C++ hold the RID values of
820 keywords in different places, so we can't derive RID from ID in
821 this language independent code. */
824 fname_decl (unsigned int rid, tree id)
827 tree decl = NULL_TREE;
829 for (ix = 0; fname_vars[ix].decl; ix++)
830 if (fname_vars[ix].rid == rid)
833 decl = *fname_vars[ix].decl;
836 /* If a tree is built here, it would normally have the lineno of
837 the current statement. Later this tree will be moved to the
838 beginning of the function and this line number will be wrong.
839 To avoid this problem set the lineno to 0 here; that prevents
840 it from appearing in the RTL. */
842 location_t saved_location = input_location;
843 #ifdef USE_MAPPED_LOCATION
844 input_location = UNKNOWN_LOCATION;
849 stmts = push_stmt_list ();
850 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
851 stmts = pop_stmt_list (stmts);
852 if (!IS_EMPTY_STMT (stmts))
853 saved_function_name_decls
854 = tree_cons (decl, stmts, saved_function_name_decls);
855 *fname_vars[ix].decl = decl;
856 input_location = saved_location;
858 if (!ix && !current_function_decl)
859 pedwarn ("%qD is not defined outside of function scope", decl);
864 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
867 fix_string_type (tree value)
869 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
870 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
871 int length = TREE_STRING_LENGTH (value);
873 tree e_type, i_type, a_type;
875 /* Compute the number of elements, for the array type. */
876 nchars = wide_flag ? length / wchar_bytes : length;
878 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
879 limit in C++98 Annex B is very large (65536) and is not normative,
880 so we do not diagnose it (warn_overlength_strings is forced off
881 in c_common_post_options). */
882 if (warn_overlength_strings)
884 const int nchars_max = flag_isoc99 ? 4095 : 509;
885 const int relevant_std = flag_isoc99 ? 99 : 90;
886 if (nchars - 1 > nchars_max)
887 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
888 separate the %d from the 'C'. 'ISO' should not be
889 translated, but it may be moved after 'C%d' in languages
890 where modifiers follow nouns. */
891 pedwarn ("string length %qd is greater than the length %qd "
892 "ISO C%d compilers are required to support",
893 nchars - 1, nchars_max, relevant_std);
896 /* Create the array type for the string constant. The ISO C++
897 standard says that a string literal has type `const char[N]' or
898 `const wchar_t[N]'. We use the same logic when invoked as a C
899 front-end with -Wwrite-strings.
900 ??? We should change the type of an expression depending on the
901 state of a warning flag. We should just be warning -- see how
902 this is handled in the C++ front-end for the deprecated implicit
903 conversion from string literals to `char*' or `wchar_t*'.
905 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
906 array type being the unqualified version of that type.
907 Therefore, if we are constructing an array of const char, we must
908 construct the matching unqualified array type first. The C front
909 end does not require this, but it does no harm, so we do it
911 e_type = wide_flag ? wchar_type_node : char_type_node;
912 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
913 a_type = build_array_type (e_type, i_type);
914 if (c_dialect_cxx() || warn_write_strings)
915 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
917 TREE_TYPE (value) = a_type;
918 TREE_CONSTANT (value) = 1;
919 TREE_INVARIANT (value) = 1;
920 TREE_READONLY (value) = 1;
921 TREE_STATIC (value) = 1;
925 /* Print a warning if a constant expression had overflow in folding.
926 Invoke this function on every expression that the language
927 requires to be a constant expression.
928 Note the ANSI C standard says it is erroneous for a
929 constant expression to overflow. */
932 constant_expression_warning (tree value)
934 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
935 || TREE_CODE (value) == FIXED_CST
936 || TREE_CODE (value) == VECTOR_CST
937 || TREE_CODE (value) == COMPLEX_CST)
938 && TREE_OVERFLOW (value)
941 pedwarn ("overflow in constant expression");
944 /* Print a warning if an expression had overflow in folding and its
947 Invoke this function on every expression that
948 (1) appears in the source code, and
949 (2) is a constant expression that overflowed, and
950 (3) is not already checked by convert_and_check;
951 however, do not invoke this function on operands of explicit casts
952 or when the expression is the result of an operator and any operand
953 already overflowed. */
956 overflow_warning (tree value)
958 if (skip_evaluation) return;
960 switch (TREE_CODE (value))
963 warning (OPT_Woverflow, "integer overflow in expression");
967 warning (OPT_Woverflow, "floating point overflow in expression");
971 warning (OPT_Woverflow, "fixed-point overflow in expression");
975 warning (OPT_Woverflow, "vector overflow in expression");
979 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
980 warning (OPT_Woverflow, "complex integer overflow in expression");
981 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
982 warning (OPT_Woverflow, "complex floating point overflow in expression");
991 /* Warn about use of a logical || / && operator being used in a
992 context where it is likely that the bitwise equivalent was intended
993 by the programmer. CODE is the TREE_CODE of the operator, ARG1
994 and ARG2 the arguments. */
997 warn_logical_operator (enum tree_code code, tree arg1, tree
1002 case TRUTH_ANDIF_EXPR:
1003 case TRUTH_ORIF_EXPR:
1005 case TRUTH_AND_EXPR:
1006 if (!TREE_NO_WARNING (arg1)
1007 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
1008 && !CONSTANT_CLASS_P (arg1)
1009 && TREE_CODE (arg2) == INTEGER_CST
1010 && !integer_zerop (arg2))
1012 warning (OPT_Wlogical_op,
1013 "logical %<%s%> with non-zero constant "
1014 "will always evaluate as true",
1015 ((code == TRUTH_ANDIF_EXPR)
1016 || (code == TRUTH_AND_EXPR)) ? "&&" : "||");
1017 TREE_NO_WARNING (arg1) = true;
1026 /* Print a warning about casts that might indicate violation
1027 of strict aliasing rules if -Wstrict-aliasing is used and
1028 strict aliasing mode is in effect. OTYPE is the original
1029 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1032 strict_aliasing_warning (tree otype, tree type, tree expr)
1034 if (!(flag_strict_aliasing && POINTER_TYPE_P (type)
1035 && POINTER_TYPE_P (otype) && !VOID_TYPE_P (TREE_TYPE (type))))
1038 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
1039 && (DECL_P (TREE_OPERAND (expr, 0))
1040 || handled_component_p (TREE_OPERAND (expr, 0))))
1042 /* Casting the address of an object to non void pointer. Warn
1043 if the cast breaks type based aliasing. */
1044 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1046 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1047 "might break strict-aliasing rules");
1052 /* warn_strict_aliasing >= 3. This includes the default (3).
1053 Only warn if the cast is dereferenced immediately. */
1054 alias_set_type set1 =
1055 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
1056 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1058 if (!alias_sets_conflict_p (set1, set2))
1060 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1061 "pointer will break strict-aliasing rules");
1064 else if (warn_strict_aliasing == 2
1065 && !alias_sets_must_conflict_p (set1, set2))
1067 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1068 "pointer might break strict-aliasing rules");
1074 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
1076 /* At this level, warn for any conversions, even if an address is
1077 not taken in the same statement. This will likely produce many
1078 false positives, but could be useful to pinpoint problems that
1079 are not revealed at higher levels. */
1080 alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
1081 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1082 if (!COMPLETE_TYPE_P (type)
1083 || !alias_sets_must_conflict_p (set1, set2))
1085 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1086 "pointer might break strict-aliasing rules");
1094 /* Print a warning about if (); or if () .. else; constructs
1095 via the special empty statement node that we create. INNER_THEN
1096 and INNER_ELSE are the statement lists of the if and the else
1100 empty_if_body_warning (tree inner_then, tree inner_else)
1102 if (TREE_CODE (inner_then) == STATEMENT_LIST
1103 && STATEMENT_LIST_TAIL (inner_then))
1104 inner_then = STATEMENT_LIST_TAIL (inner_then)->stmt;
1106 if (inner_else && TREE_CODE (inner_else) == STATEMENT_LIST
1107 && STATEMENT_LIST_TAIL (inner_else))
1108 inner_else = STATEMENT_LIST_TAIL (inner_else)->stmt;
1110 if (IS_EMPTY_STMT (inner_then) && !inner_else)
1111 warning (OPT_Wempty_body, "%Hsuggest braces around empty body "
1112 "in an %<if%> statement", EXPR_LOCUS (inner_then));
1114 else if (inner_else && IS_EMPTY_STMT (inner_else))
1115 warning (OPT_Wempty_body, "%Hsuggest braces around empty body "
1116 "in an %<else%> statement", EXPR_LOCUS (inner_else));
1119 /* Warn for unlikely, improbable, or stupid DECL declarations
1123 check_main_parameter_types (tree decl)
1128 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args;
1129 args = TREE_CHAIN (args))
1131 tree type = args ? TREE_VALUE (args) : 0;
1133 if (type == void_type_node || type == error_mark_node )
1140 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1141 pedwarn ("first argument of %q+D should be %<int%>", decl);
1145 if (TREE_CODE (type) != POINTER_TYPE
1146 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1147 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1149 pedwarn ("second argument of %q+D should be %<char **%>",
1154 if (TREE_CODE (type) != POINTER_TYPE
1155 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1156 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1158 pedwarn ("third argument of %q+D should probably be "
1159 "%<char **%>", decl);
1164 /* It is intentional that this message does not mention the third
1165 argument because it's only mentioned in an appendix of the
1167 if (argct > 0 && (argct < 2 || argct > 3))
1168 pedwarn ("%q+D takes only zero or two arguments", decl);
1171 /* True if vector types T1 and T2 can be converted to each other
1172 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1173 can only be converted with -flax-vector-conversions yet that is not
1174 in effect, emit a note telling the user about that option if such
1175 a note has not previously been emitted. */
1177 vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
1179 static bool emitted_lax_note = false;
1180 bool convertible_lax;
1182 if ((targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2))
1183 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1187 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1188 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1189 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1190 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
1191 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
1193 if (!convertible_lax || flag_lax_vector_conversions)
1194 return convertible_lax;
1196 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1197 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2)))
1200 if (emit_lax_note && !emitted_lax_note)
1202 emitted_lax_note = true;
1203 inform ("use -flax-vector-conversions to permit "
1204 "conversions between vectors with differing "
1205 "element types or numbers of subparts");
1211 /* Warns if the conversion of EXPR to TYPE may alter a value.
1212 This is a helper function for warnings_for_convert_and_check. */
1215 conversion_warning (tree type, tree expr)
1217 bool give_warning = false;
1219 unsigned int formal_prec = TYPE_PRECISION (type);
1221 if (!warn_conversion && !warn_sign_conversion)
1224 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
1226 /* Warn for real constant that is not an exact integer converted
1228 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1229 && TREE_CODE (type) == INTEGER_TYPE)
1231 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (TREE_TYPE (expr))))
1232 give_warning = true;
1234 /* Warn for an integer constant that does not fit into integer type. */
1235 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1236 && TREE_CODE (type) == INTEGER_TYPE
1237 && !int_fits_type_p (expr, type))
1239 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr)))
1240 warning (OPT_Wsign_conversion,
1241 "negative integer implicitly converted to unsigned type");
1242 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (TREE_TYPE (expr)))
1243 warning (OPT_Wsign_conversion,
1244 "conversion of unsigned constant value to negative integer");
1246 give_warning = true;
1248 else if (TREE_CODE (type) == REAL_TYPE)
1250 /* Warn for an integer constant that does not fit into real type. */
1251 if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE)
1253 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
1254 if (!exact_real_truncate (TYPE_MODE (type), &a))
1255 give_warning = true;
1257 /* Warn for a real constant that does not fit into a smaller
1259 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1260 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1262 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
1263 if (!exact_real_truncate (TYPE_MODE (type), &a))
1264 give_warning = true;
1269 warning (OPT_Wconversion,
1270 "conversion to %qT alters %qT constant value",
1271 type, TREE_TYPE (expr));
1273 else /* 'expr' is not a constant. */
1275 /* Warn for real types converted to integer types. */
1276 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1277 && TREE_CODE (type) == INTEGER_TYPE)
1278 give_warning = true;
1280 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1281 && TREE_CODE (type) == INTEGER_TYPE)
1283 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1284 expr = get_unwidened (expr, 0);
1286 /* Warn for integer types converted to smaller integer types. */
1287 if (formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1288 give_warning = true;
1290 /* When they are the same width but different signedness,
1291 then the value may change. */
1292 else if ((formal_prec == TYPE_PRECISION (TREE_TYPE (expr))
1293 && TYPE_UNSIGNED (TREE_TYPE (expr)) != TYPE_UNSIGNED (type))
1294 /* Even when converted to a bigger type, if the type is
1295 unsigned but expr is signed, then negative values
1297 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr))))
1298 warning (OPT_Wsign_conversion,
1299 "conversion to %qT from %qT may change the sign of the result",
1300 type, TREE_TYPE (expr));
1303 /* Warn for integer types converted to real types if and only if
1304 all the range of values of the integer type cannot be
1305 represented by the real type. */
1306 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1307 && TREE_CODE (type) == REAL_TYPE)
1309 tree type_low_bound = TYPE_MIN_VALUE (TREE_TYPE (expr));
1310 tree type_high_bound = TYPE_MAX_VALUE (TREE_TYPE (expr));
1311 REAL_VALUE_TYPE real_low_bound = real_value_from_int_cst (0, type_low_bound);
1312 REAL_VALUE_TYPE real_high_bound = real_value_from_int_cst (0, type_high_bound);
1314 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
1315 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
1316 give_warning = true;
1319 /* Warn for real types converted to smaller real types. */
1320 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1321 && TREE_CODE (type) == REAL_TYPE
1322 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1323 give_warning = true;
1327 warning (OPT_Wconversion,
1328 "conversion to %qT from %qT may alter its value",
1329 type, TREE_TYPE (expr));
1333 /* Produce warnings after a conversion. RESULT is the result of
1334 converting EXPR to TYPE. This is a helper function for
1335 convert_and_check and cp_convert_and_check. */
1338 warnings_for_convert_and_check (tree type, tree expr, tree result)
1340 if (TREE_CODE (expr) == INTEGER_CST
1341 && (TREE_CODE (type) == INTEGER_TYPE
1342 || TREE_CODE (type) == ENUMERAL_TYPE)
1343 && !int_fits_type_p (expr, type))
1345 /* Do not diagnose overflow in a constant expression merely
1346 because a conversion overflowed. */
1347 if (TREE_OVERFLOW (result))
1348 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
1350 if (TYPE_UNSIGNED (type))
1352 /* This detects cases like converting -129 or 256 to
1354 if (!int_fits_type_p (expr, c_common_signed_type (type)))
1355 warning (OPT_Woverflow,
1356 "large integer implicitly truncated to unsigned type");
1358 conversion_warning (type, expr);
1360 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
1361 warning (OPT_Woverflow,
1362 "overflow in implicit constant conversion");
1363 /* No warning for converting 0x80000000 to int. */
1365 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
1366 || TYPE_PRECISION (TREE_TYPE (expr))
1367 != TYPE_PRECISION (type)))
1368 warning (OPT_Woverflow,
1369 "overflow in implicit constant conversion");
1372 conversion_warning (type, expr);
1374 else if ((TREE_CODE (result) == INTEGER_CST
1375 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
1376 warning (OPT_Woverflow,
1377 "overflow in implicit constant conversion");
1379 conversion_warning (type, expr);
1383 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1384 Invoke this function on every expression that is converted implicitly,
1385 i.e. because of language rules and not because of an explicit cast. */
1388 convert_and_check (tree type, tree expr)
1392 if (TREE_TYPE (expr) == type)
1395 result = convert (type, expr);
1397 if (!skip_evaluation && !TREE_OVERFLOW_P (expr) && result != error_mark_node)
1398 warnings_for_convert_and_check (type, expr, result);
1403 /* A node in a list that describes references to variables (EXPR), which are
1404 either read accesses if WRITER is zero, or write accesses, in which case
1405 WRITER is the parent of EXPR. */
1412 /* Used to implement a cache the results of a call to verify_tree. We only
1413 use this for SAVE_EXPRs. */
1416 struct tlist_cache *next;
1417 struct tlist *cache_before_sp;
1418 struct tlist *cache_after_sp;
1422 /* Obstack to use when allocating tlist structures, and corresponding
1424 static struct obstack tlist_obstack;
1425 static char *tlist_firstobj = 0;
1427 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1429 static struct tlist *warned_ids;
1430 /* SAVE_EXPRs need special treatment. We process them only once and then
1431 cache the results. */
1432 static struct tlist_cache *save_expr_cache;
1434 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1435 static void merge_tlist (struct tlist **, struct tlist *, int);
1436 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1437 static int warning_candidate_p (tree);
1438 static void warn_for_collisions (struct tlist *);
1439 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1440 static struct tlist *new_tlist (struct tlist *, tree, tree);
1442 /* Create a new struct tlist and fill in its fields. */
1443 static struct tlist *
1444 new_tlist (struct tlist *next, tree t, tree writer)
1447 l = XOBNEW (&tlist_obstack, struct tlist);
1454 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1455 is nonnull, we ignore any node we find which has a writer equal to it. */
1458 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1462 struct tlist *next = add->next;
1465 if (!exclude_writer || add->writer != exclude_writer)
1466 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1471 /* Merge the nodes of ADD into TO. This merging process is done so that for
1472 each variable that already exists in TO, no new node is added; however if
1473 there is a write access recorded in ADD, and an occurrence on TO is only
1474 a read access, then the occurrence in TO will be modified to record the
1478 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1480 struct tlist **end = to;
1483 end = &(*end)->next;
1489 struct tlist *next = add->next;
1491 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1492 if (tmp2->expr == add->expr)
1496 tmp2->writer = add->writer;
1500 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1501 end = &(*end)->next;
1508 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1509 references in list LIST conflict with it, excluding reads if ONLY writers
1513 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1518 /* Avoid duplicate warnings. */
1519 for (tmp = warned_ids; tmp; tmp = tmp->next)
1520 if (tmp->expr == written)
1525 if (list->expr == written
1526 && list->writer != writer
1527 && (!only_writes || list->writer)
1528 && DECL_NAME (list->expr))
1530 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1531 warning (OPT_Wsequence_point, "operation on %qE may be undefined",
1538 /* Given a list LIST of references to variables, find whether any of these
1539 can cause conflicts due to missing sequence points. */
1542 warn_for_collisions (struct tlist *list)
1546 for (tmp = list; tmp; tmp = tmp->next)
1549 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1553 /* Return nonzero if X is a tree that can be verified by the sequence point
1556 warning_candidate_p (tree x)
1558 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1561 /* Walk the tree X, and record accesses to variables. If X is written by the
1562 parent tree, WRITER is the parent.
1563 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1564 expression or its only operand forces a sequence point, then everything up
1565 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1567 Once we return, we will have emitted warnings if any subexpression before
1568 such a sequence point could be undefined. On a higher level, however, the
1569 sequence point may not be relevant, and we'll merge the two lists.
1571 Example: (b++, a) + b;
1572 The call that processes the COMPOUND_EXPR will store the increment of B
1573 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1574 processes the PLUS_EXPR will need to merge the two lists so that
1575 eventually, all accesses end up on the same list (and we'll warn about the
1576 unordered subexpressions b++ and b.
1578 A note on merging. If we modify the former example so that our expression
1581 care must be taken not simply to add all three expressions into the final
1582 PNO_SP list. The function merge_tlist takes care of that by merging the
1583 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1584 way, so that no more than one access to B is recorded. */
1587 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1590 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1591 enum tree_code code;
1592 enum tree_code_class cl;
1594 /* X may be NULL if it is the operand of an empty statement expression
1600 code = TREE_CODE (x);
1601 cl = TREE_CODE_CLASS (code);
1603 if (warning_candidate_p (x))
1605 *pno_sp = new_tlist (*pno_sp, x, writer);
1615 case TRUTH_ANDIF_EXPR:
1616 case TRUTH_ORIF_EXPR:
1617 tmp_before = tmp_nosp = tmp_list3 = 0;
1618 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1619 warn_for_collisions (tmp_nosp);
1620 merge_tlist (pbefore_sp, tmp_before, 0);
1621 merge_tlist (pbefore_sp, tmp_nosp, 0);
1622 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1623 merge_tlist (pbefore_sp, tmp_list3, 0);
1627 tmp_before = tmp_list2 = 0;
1628 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1629 warn_for_collisions (tmp_list2);
1630 merge_tlist (pbefore_sp, tmp_before, 0);
1631 merge_tlist (pbefore_sp, tmp_list2, 1);
1633 tmp_list3 = tmp_nosp = 0;
1634 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1635 warn_for_collisions (tmp_nosp);
1636 merge_tlist (pbefore_sp, tmp_list3, 0);
1638 tmp_list3 = tmp_list2 = 0;
1639 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1640 warn_for_collisions (tmp_list2);
1641 merge_tlist (pbefore_sp, tmp_list3, 0);
1642 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1643 two first, to avoid warning for (a ? b++ : b++). */
1644 merge_tlist (&tmp_nosp, tmp_list2, 0);
1645 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1648 case PREDECREMENT_EXPR:
1649 case PREINCREMENT_EXPR:
1650 case POSTDECREMENT_EXPR:
1651 case POSTINCREMENT_EXPR:
1652 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1656 tmp_before = tmp_nosp = tmp_list3 = 0;
1657 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1658 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1659 /* Expressions inside the LHS are not ordered wrt. the sequence points
1660 in the RHS. Example:
1662 Despite the fact that the modification of "a" is in the before_sp
1663 list (tmp_before), it conflicts with the use of "a" in the LHS.
1664 We can handle this by adding the contents of tmp_list3
1665 to those of tmp_before, and redoing the collision warnings for that
1667 add_tlist (&tmp_before, tmp_list3, x, 1);
1668 warn_for_collisions (tmp_before);
1669 /* Exclude the LHS itself here; we first have to merge it into the
1670 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1671 didn't exclude the LHS, we'd get it twice, once as a read and once
1673 add_tlist (pno_sp, tmp_list3, x, 0);
1674 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1676 merge_tlist (pbefore_sp, tmp_before, 0);
1677 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1678 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1679 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1683 /* We need to warn about conflicts among arguments and conflicts between
1684 args and the function address. Side effects of the function address,
1685 however, are not ordered by the sequence point of the call. */
1687 call_expr_arg_iterator iter;
1689 tmp_before = tmp_nosp = 0;
1690 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
1691 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
1693 tmp_list2 = tmp_list3 = 0;
1694 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
1695 merge_tlist (&tmp_list3, tmp_list2, 0);
1696 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1698 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1699 warn_for_collisions (tmp_before);
1700 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1705 /* Scan all the list, e.g. indices of multi dimensional array. */
1708 tmp_before = tmp_nosp = 0;
1709 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1710 merge_tlist (&tmp_nosp, tmp_before, 0);
1711 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1718 struct tlist_cache *t;
1719 for (t = save_expr_cache; t; t = t->next)
1725 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1726 t->next = save_expr_cache;
1728 save_expr_cache = t;
1730 tmp_before = tmp_nosp = 0;
1731 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1732 warn_for_collisions (tmp_nosp);
1737 struct tlist *t = tmp_nosp;
1739 merge_tlist (&tmp_list3, t, 0);
1741 t->cache_before_sp = tmp_before;
1742 t->cache_after_sp = tmp_list3;
1744 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1745 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1750 /* For other expressions, simply recurse on their operands.
1751 Manual tail recursion for unary expressions.
1752 Other non-expressions need not be processed. */
1753 if (cl == tcc_unary)
1755 x = TREE_OPERAND (x, 0);
1759 else if (IS_EXPR_CODE_CLASS (cl))
1762 int max = TREE_OPERAND_LENGTH (x);
1763 for (lp = 0; lp < max; lp++)
1765 tmp_before = tmp_nosp = 0;
1766 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1767 merge_tlist (&tmp_nosp, tmp_before, 0);
1768 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1775 /* Try to warn for undefined behavior in EXPR due to missing sequence
1779 verify_sequence_points (tree expr)
1781 struct tlist *before_sp = 0, *after_sp = 0;
1784 save_expr_cache = 0;
1785 if (tlist_firstobj == 0)
1787 gcc_obstack_init (&tlist_obstack);
1788 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1791 verify_tree (expr, &before_sp, &after_sp, 0);
1792 warn_for_collisions (after_sp);
1793 obstack_free (&tlist_obstack, tlist_firstobj);
1796 /* Validate the expression after `case' and apply default promotions. */
1799 check_case_value (tree value)
1801 if (value == NULL_TREE)
1804 /* ??? Can we ever get nops here for a valid case value? We
1806 STRIP_TYPE_NOPS (value);
1807 /* In C++, the following is allowed:
1810 switch (...) { case i: ... }
1812 So, we try to reduce the VALUE to a constant that way. */
1813 if (c_dialect_cxx ())
1815 value = decl_constant_value (value);
1816 STRIP_TYPE_NOPS (value);
1817 value = fold (value);
1820 if (TREE_CODE (value) == INTEGER_CST)
1821 /* Promote char or short to int. */
1822 value = perform_integral_promotions (value);
1823 else if (value != error_mark_node)
1825 error ("case label does not reduce to an integer constant");
1826 value = error_mark_node;
1829 constant_expression_warning (value);
1834 /* See if the case values LOW and HIGH are in the range of the original
1835 type (i.e. before the default conversion to int) of the switch testing
1837 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1838 the type before promoting it. CASE_LOW_P is a pointer to the lower
1839 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1840 if the case is not a case range.
1841 The caller has to make sure that we are not called with NULL for
1842 CASE_LOW_P (i.e. the default case).
1843 Returns true if the case label is in range of ORIG_TYPE (saturated or
1844 untouched) or false if the label is out of range. */
1847 check_case_bounds (tree type, tree orig_type,
1848 tree *case_low_p, tree *case_high_p)
1850 tree min_value, max_value;
1851 tree case_low = *case_low_p;
1852 tree case_high = case_high_p ? *case_high_p : case_low;
1854 /* If there was a problem with the original type, do nothing. */
1855 if (orig_type == error_mark_node)
1858 min_value = TYPE_MIN_VALUE (orig_type);
1859 max_value = TYPE_MAX_VALUE (orig_type);
1861 /* Case label is less than minimum for type. */
1862 if (tree_int_cst_compare (case_low, min_value) < 0
1863 && tree_int_cst_compare (case_high, min_value) < 0)
1865 warning (0, "case label value is less than minimum value for type");
1869 /* Case value is greater than maximum for type. */
1870 if (tree_int_cst_compare (case_low, max_value) > 0
1871 && tree_int_cst_compare (case_high, max_value) > 0)
1873 warning (0, "case label value exceeds maximum value for type");
1877 /* Saturate lower case label value to minimum. */
1878 if (tree_int_cst_compare (case_high, min_value) >= 0
1879 && tree_int_cst_compare (case_low, min_value) < 0)
1881 warning (0, "lower value in case label range"
1882 " less than minimum value for type");
1883 case_low = min_value;
1886 /* Saturate upper case label value to maximum. */
1887 if (tree_int_cst_compare (case_low, max_value) <= 0
1888 && tree_int_cst_compare (case_high, max_value) > 0)
1890 warning (0, "upper value in case label range"
1891 " exceeds maximum value for type");
1892 case_high = max_value;
1895 if (*case_low_p != case_low)
1896 *case_low_p = convert (type, case_low);
1897 if (case_high_p && *case_high_p != case_high)
1898 *case_high_p = convert (type, case_high);
1903 /* Return an integer type with BITS bits of precision,
1904 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1907 c_common_type_for_size (unsigned int bits, int unsignedp)
1909 if (bits == TYPE_PRECISION (integer_type_node))
1910 return unsignedp ? unsigned_type_node : integer_type_node;
1912 if (bits == TYPE_PRECISION (signed_char_type_node))
1913 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1915 if (bits == TYPE_PRECISION (short_integer_type_node))
1916 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1918 if (bits == TYPE_PRECISION (long_integer_type_node))
1919 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1921 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1922 return (unsignedp ? long_long_unsigned_type_node
1923 : long_long_integer_type_node);
1925 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1926 return (unsignedp ? widest_unsigned_literal_type_node
1927 : widest_integer_literal_type_node);
1929 if (bits <= TYPE_PRECISION (intQI_type_node))
1930 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1932 if (bits <= TYPE_PRECISION (intHI_type_node))
1933 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1935 if (bits <= TYPE_PRECISION (intSI_type_node))
1936 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1938 if (bits <= TYPE_PRECISION (intDI_type_node))
1939 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1944 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
1945 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
1946 and saturating if SATP is nonzero, otherwise not saturating. */
1949 c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
1950 int unsignedp, int satp)
1952 enum machine_mode mode;
1954 mode = unsignedp ? UQQmode : QQmode;
1956 mode = unsignedp ? UHAmode : HAmode;
1958 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
1959 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
1962 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
1964 sorry ("GCC cannot support operators with integer types and "
1965 "fixed-point types that have too many integral and "
1966 "fractional bits together");
1970 return c_common_type_for_mode (mode, satp);
1973 /* Used for communication between c_common_type_for_mode and
1974 c_register_builtin_type. */
1975 static GTY(()) tree registered_builtin_types;
1977 /* Return a data type that has machine mode MODE.
1978 If the mode is an integer,
1979 then UNSIGNEDP selects between signed and unsigned types.
1980 If the mode is a fixed-point mode,
1981 then UNSIGNEDP selects between saturating and nonsaturating types. */
1984 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1988 if (mode == TYPE_MODE (integer_type_node))
1989 return unsignedp ? unsigned_type_node : integer_type_node;
1991 if (mode == TYPE_MODE (signed_char_type_node))
1992 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1994 if (mode == TYPE_MODE (short_integer_type_node))
1995 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1997 if (mode == TYPE_MODE (long_integer_type_node))
1998 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2000 if (mode == TYPE_MODE (long_long_integer_type_node))
2001 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2003 if (mode == TYPE_MODE (widest_integer_literal_type_node))
2004 return unsignedp ? widest_unsigned_literal_type_node
2005 : widest_integer_literal_type_node;
2008 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2011 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2014 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2017 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2019 #if HOST_BITS_PER_WIDE_INT >= 64
2020 if (mode == TYPE_MODE (intTI_type_node))
2021 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2024 if (mode == TYPE_MODE (float_type_node))
2025 return float_type_node;
2027 if (mode == TYPE_MODE (double_type_node))
2028 return double_type_node;
2030 if (mode == TYPE_MODE (long_double_type_node))
2031 return long_double_type_node;
2033 if (mode == TYPE_MODE (void_type_node))
2034 return void_type_node;
2036 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
2038 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2039 : make_signed_type (GET_MODE_PRECISION (mode)));
2041 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
2043 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2044 : make_signed_type (GET_MODE_PRECISION (mode)));
2046 if (COMPLEX_MODE_P (mode))
2048 enum machine_mode inner_mode;
2051 if (mode == TYPE_MODE (complex_float_type_node))
2052 return complex_float_type_node;
2053 if (mode == TYPE_MODE (complex_double_type_node))
2054 return complex_double_type_node;
2055 if (mode == TYPE_MODE (complex_long_double_type_node))
2056 return complex_long_double_type_node;
2058 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
2059 return complex_integer_type_node;
2061 inner_mode = GET_MODE_INNER (mode);
2062 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2063 if (inner_type != NULL_TREE)
2064 return build_complex_type (inner_type);
2066 else if (VECTOR_MODE_P (mode))
2068 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2069 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2070 if (inner_type != NULL_TREE)
2071 return build_vector_type_for_mode (inner_type, mode);
2074 if (mode == TYPE_MODE (dfloat32_type_node))
2075 return dfloat32_type_node;
2076 if (mode == TYPE_MODE (dfloat64_type_node))
2077 return dfloat64_type_node;
2078 if (mode == TYPE_MODE (dfloat128_type_node))
2079 return dfloat128_type_node;
2081 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
2083 if (mode == TYPE_MODE (short_fract_type_node))
2084 return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
2085 if (mode == TYPE_MODE (fract_type_node))
2086 return unsignedp ? sat_fract_type_node : fract_type_node;
2087 if (mode == TYPE_MODE (long_fract_type_node))
2088 return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
2089 if (mode == TYPE_MODE (long_long_fract_type_node))
2090 return unsignedp ? sat_long_long_fract_type_node
2091 : long_long_fract_type_node;
2093 if (mode == TYPE_MODE (unsigned_short_fract_type_node))
2094 return unsignedp ? sat_unsigned_short_fract_type_node
2095 : unsigned_short_fract_type_node;
2096 if (mode == TYPE_MODE (unsigned_fract_type_node))
2097 return unsignedp ? sat_unsigned_fract_type_node
2098 : unsigned_fract_type_node;
2099 if (mode == TYPE_MODE (unsigned_long_fract_type_node))
2100 return unsignedp ? sat_unsigned_long_fract_type_node
2101 : unsigned_long_fract_type_node;
2102 if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
2103 return unsignedp ? sat_unsigned_long_long_fract_type_node
2104 : unsigned_long_long_fract_type_node;
2106 if (mode == TYPE_MODE (short_accum_type_node))
2107 return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
2108 if (mode == TYPE_MODE (accum_type_node))
2109 return unsignedp ? sat_accum_type_node : accum_type_node;
2110 if (mode == TYPE_MODE (long_accum_type_node))
2111 return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
2112 if (mode == TYPE_MODE (long_long_accum_type_node))
2113 return unsignedp ? sat_long_long_accum_type_node
2114 : long_long_accum_type_node;
2116 if (mode == TYPE_MODE (unsigned_short_accum_type_node))
2117 return unsignedp ? sat_unsigned_short_accum_type_node
2118 : unsigned_short_accum_type_node;
2119 if (mode == TYPE_MODE (unsigned_accum_type_node))
2120 return unsignedp ? sat_unsigned_accum_type_node
2121 : unsigned_accum_type_node;
2122 if (mode == TYPE_MODE (unsigned_long_accum_type_node))
2123 return unsignedp ? sat_unsigned_long_accum_type_node
2124 : unsigned_long_accum_type_node;
2125 if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
2126 return unsignedp ? sat_unsigned_long_long_accum_type_node
2127 : unsigned_long_long_accum_type_node;
2130 return unsignedp ? sat_qq_type_node : qq_type_node;
2132 return unsignedp ? sat_hq_type_node : hq_type_node;
2134 return unsignedp ? sat_sq_type_node : sq_type_node;
2136 return unsignedp ? sat_dq_type_node : dq_type_node;
2138 return unsignedp ? sat_tq_type_node : tq_type_node;
2140 if (mode == UQQmode)
2141 return unsignedp ? sat_uqq_type_node : uqq_type_node;
2142 if (mode == UHQmode)
2143 return unsignedp ? sat_uhq_type_node : uhq_type_node;
2144 if (mode == USQmode)
2145 return unsignedp ? sat_usq_type_node : usq_type_node;
2146 if (mode == UDQmode)
2147 return unsignedp ? sat_udq_type_node : udq_type_node;
2148 if (mode == UTQmode)
2149 return unsignedp ? sat_utq_type_node : utq_type_node;
2152 return unsignedp ? sat_ha_type_node : ha_type_node;
2154 return unsignedp ? sat_sa_type_node : sa_type_node;
2156 return unsignedp ? sat_da_type_node : da_type_node;
2158 return unsignedp ? sat_ta_type_node : ta_type_node;
2160 if (mode == UHAmode)
2161 return unsignedp ? sat_uha_type_node : uha_type_node;
2162 if (mode == USAmode)
2163 return unsignedp ? sat_usa_type_node : usa_type_node;
2164 if (mode == UDAmode)
2165 return unsignedp ? sat_uda_type_node : uda_type_node;
2166 if (mode == UTAmode)
2167 return unsignedp ? sat_uta_type_node : uta_type_node;
2170 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
2171 if (TYPE_MODE (TREE_VALUE (t)) == mode)
2172 return TREE_VALUE (t);
2178 c_common_unsigned_type (tree type)
2180 return c_common_signed_or_unsigned_type (1, type);
2183 /* Return a signed type the same as TYPE in other respects. */
2186 c_common_signed_type (tree type)
2188 return c_common_signed_or_unsigned_type (0, type);
2191 /* Return a type the same as TYPE except unsigned or
2192 signed according to UNSIGNEDP. */
2195 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2199 /* This block of code emulates the behavior of the old
2200 c_common_unsigned_type. In particular, it returns
2201 long_unsigned_type_node if passed a long, even when a int would
2202 have the same size. This is necessary for warnings to work
2203 correctly in archs where sizeof(int) == sizeof(long) */
2205 type1 = TYPE_MAIN_VARIANT (type);
2206 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
2207 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2208 if (type1 == integer_type_node || type1 == unsigned_type_node)
2209 return unsignedp ? unsigned_type_node : integer_type_node;
2210 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
2211 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2212 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
2213 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2214 if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
2215 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2216 if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
2217 return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
2218 #if HOST_BITS_PER_WIDE_INT >= 64
2219 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
2220 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2222 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
2223 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2224 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
2225 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2226 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
2227 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2228 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
2229 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2231 #define C_COMMON_FIXED_TYPES(SAT,NAME) \
2232 if (type1 == SAT ## short_ ## NAME ## _type_node \
2233 || type1 == SAT ## unsigned_short_ ## NAME ## _type_node) \
2234 return unsignedp ? SAT ## unsigned_short_ ## NAME ## _type_node \
2235 : SAT ## short_ ## NAME ## _type_node; \
2236 if (type1 == SAT ## NAME ## _type_node \
2237 || type1 == SAT ## unsigned_ ## NAME ## _type_node) \
2238 return unsignedp ? SAT ## unsigned_ ## NAME ## _type_node \
2239 : SAT ## NAME ## _type_node; \
2240 if (type1 == SAT ## long_ ## NAME ## _type_node \
2241 || type1 == SAT ## unsigned_long_ ## NAME ## _type_node) \
2242 return unsignedp ? SAT ## unsigned_long_ ## NAME ## _type_node \
2243 : SAT ## long_ ## NAME ## _type_node; \
2244 if (type1 == SAT ## long_long_ ## NAME ## _type_node \
2245 || type1 == SAT ## unsigned_long_long_ ## NAME ## _type_node) \
2246 return unsignedp ? SAT ## unsigned_long_long_ ## NAME ## _type_node \
2247 : SAT ## long_long_ ## NAME ## _type_node;
2249 #define C_COMMON_FIXED_MODE_TYPES(SAT,NAME) \
2250 if (type1 == SAT ## NAME ## _type_node \
2251 || type1 == SAT ## u ## NAME ## _type_node) \
2252 return unsignedp ? SAT ## u ## NAME ## _type_node \
2253 : SAT ## NAME ## _type_node;
2255 C_COMMON_FIXED_TYPES (, fract);
2256 C_COMMON_FIXED_TYPES (sat_, fract);
2257 C_COMMON_FIXED_TYPES (, accum);
2258 C_COMMON_FIXED_TYPES (sat_, accum);
2260 C_COMMON_FIXED_MODE_TYPES (, qq);
2261 C_COMMON_FIXED_MODE_TYPES (, hq);
2262 C_COMMON_FIXED_MODE_TYPES (, sq);
2263 C_COMMON_FIXED_MODE_TYPES (, dq);
2264 C_COMMON_FIXED_MODE_TYPES (, tq);
2265 C_COMMON_FIXED_MODE_TYPES (sat_, qq);
2266 C_COMMON_FIXED_MODE_TYPES (sat_, hq);
2267 C_COMMON_FIXED_MODE_TYPES (sat_, sq);
2268 C_COMMON_FIXED_MODE_TYPES (sat_, dq);
2269 C_COMMON_FIXED_MODE_TYPES (sat_, tq);
2270 C_COMMON_FIXED_MODE_TYPES (, ha);
2271 C_COMMON_FIXED_MODE_TYPES (, sa);
2272 C_COMMON_FIXED_MODE_TYPES (, da);
2273 C_COMMON_FIXED_MODE_TYPES (, ta);
2274 C_COMMON_FIXED_MODE_TYPES (sat_, ha);
2275 C_COMMON_FIXED_MODE_TYPES (sat_, sa);
2276 C_COMMON_FIXED_MODE_TYPES (sat_, da);
2277 C_COMMON_FIXED_MODE_TYPES (sat_, ta);
2279 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2280 the precision; they have precision set to match their range, but
2281 may use a wider mode to match an ABI. If we change modes, we may
2282 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2283 the precision as well, so as to yield correct results for
2284 bit-field types. C++ does not have these separate bit-field
2285 types, and producing a signed or unsigned variant of an
2286 ENUMERAL_TYPE may cause other problems as well. */
2288 if (!INTEGRAL_TYPE_P (type)
2289 || TYPE_UNSIGNED (type) == unsignedp)
2292 #define TYPE_OK(node) \
2293 (TYPE_MODE (type) == TYPE_MODE (node) \
2294 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2295 if (TYPE_OK (signed_char_type_node))
2296 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2297 if (TYPE_OK (integer_type_node))
2298 return unsignedp ? unsigned_type_node : integer_type_node;
2299 if (TYPE_OK (short_integer_type_node))
2300 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2301 if (TYPE_OK (long_integer_type_node))
2302 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2303 if (TYPE_OK (long_long_integer_type_node))
2304 return (unsignedp ? long_long_unsigned_type_node
2305 : long_long_integer_type_node);
2306 if (TYPE_OK (widest_integer_literal_type_node))
2307 return (unsignedp ? widest_unsigned_literal_type_node
2308 : widest_integer_literal_type_node);
2310 #if HOST_BITS_PER_WIDE_INT >= 64
2311 if (TYPE_OK (intTI_type_node))
2312 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2314 if (TYPE_OK (intDI_type_node))
2315 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2316 if (TYPE_OK (intSI_type_node))
2317 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2318 if (TYPE_OK (intHI_type_node))
2319 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2320 if (TYPE_OK (intQI_type_node))
2321 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2324 if (c_dialect_cxx ())
2327 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
2330 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2333 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
2335 /* Extended integer types of the same width as a standard type have
2336 lesser rank, so those of the same width as int promote to int or
2337 unsigned int and are valid for printf formats expecting int or
2338 unsigned int. To avoid such special cases, avoid creating
2339 extended integer types for bit-fields if a standard integer type
2341 if (width == TYPE_PRECISION (integer_type_node))
2342 return unsignedp ? unsigned_type_node : integer_type_node;
2343 if (width == TYPE_PRECISION (signed_char_type_node))
2344 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2345 if (width == TYPE_PRECISION (short_integer_type_node))
2346 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2347 if (width == TYPE_PRECISION (long_integer_type_node))
2348 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2349 if (width == TYPE_PRECISION (long_long_integer_type_node))
2350 return (unsignedp ? long_long_unsigned_type_node
2351 : long_long_integer_type_node);
2352 return build_nonstandard_integer_type (width, unsignedp);
2355 /* The C version of the register_builtin_type langhook. */
2358 c_register_builtin_type (tree type, const char* name)
2362 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2363 DECL_ARTIFICIAL (decl) = 1;
2364 if (!TYPE_NAME (type))
2365 TYPE_NAME (type) = decl;
2368 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2372 /* Return the minimum number of bits needed to represent VALUE in a
2373 signed or unsigned type, UNSIGNEDP says which. */
2376 min_precision (tree value, int unsignedp)
2380 /* If the value is negative, compute its negative minus 1. The latter
2381 adjustment is because the absolute value of the largest negative value
2382 is one larger than the largest positive value. This is equivalent to
2383 a bit-wise negation, so use that operation instead. */
2385 if (tree_int_cst_sgn (value) < 0)
2386 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
2388 /* Return the number of bits needed, taking into account the fact
2389 that we need one more bit for a signed than unsigned type. */
2391 if (integer_zerop (value))
2394 log = tree_floor_log2 (value);
2396 return log + 1 + !unsignedp;
2399 /* Print an error message for invalid operands to arith operation
2400 CODE with TYPE0 for operand 0, and TYPE1 for operand 1. */
2403 binary_op_error (enum tree_code code, tree type0, tree type1)
2410 opname = "+"; break;
2412 opname = "-"; break;
2414 opname = "*"; break;
2416 opname = "max"; break;
2418 opname = "min"; break;
2420 opname = "=="; break;
2422 opname = "!="; break;
2424 opname = "<="; break;
2426 opname = ">="; break;
2428 opname = "<"; break;
2430 opname = ">"; break;
2432 opname = "<<"; break;
2434 opname = ">>"; break;
2435 case TRUNC_MOD_EXPR:
2436 case FLOOR_MOD_EXPR:
2437 opname = "%"; break;
2438 case TRUNC_DIV_EXPR:
2439 case FLOOR_DIV_EXPR:
2440 opname = "/"; break;
2442 opname = "&"; break;
2444 opname = "|"; break;
2445 case TRUTH_ANDIF_EXPR:
2446 opname = "&&"; break;
2447 case TRUTH_ORIF_EXPR:
2448 opname = "||"; break;
2450 opname = "^"; break;
2454 error ("invalid operands to binary %s (have %qT and %qT)", opname,
2458 /* Subroutine of build_binary_op, used for comparison operations.
2459 See if the operands have both been converted from subword integer types
2460 and, if so, perhaps change them both back to their original type.
2461 This function is also responsible for converting the two operands
2462 to the proper common type for comparison.
2464 The arguments of this function are all pointers to local variables
2465 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2466 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2468 If this function returns nonzero, it means that the comparison has
2469 a constant value. What this function returns is an expression for
2473 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2474 enum tree_code *rescode_ptr)
2477 tree op0 = *op0_ptr;
2478 tree op1 = *op1_ptr;
2479 int unsignedp0, unsignedp1;
2481 tree primop0, primop1;
2482 enum tree_code code = *rescode_ptr;
2484 /* Throw away any conversions to wider types
2485 already present in the operands. */
2487 primop0 = get_narrower (op0, &unsignedp0);
2488 primop1 = get_narrower (op1, &unsignedp1);
2490 /* Handle the case that OP0 does not *contain* a conversion
2491 but it *requires* conversion to FINAL_TYPE. */
2493 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2494 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2495 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2496 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2498 /* If one of the operands must be floated, we cannot optimize. */
2499 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2500 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2502 /* If first arg is constant, swap the args (changing operation
2503 so value is preserved), for canonicalization. Don't do this if
2504 the second arg is 0. */
2506 if (TREE_CONSTANT (primop0)
2507 && !integer_zerop (primop1) && !real_zerop (primop1)
2508 && !fixed_zerop (primop1))
2511 int temi = unsignedp0;
2519 unsignedp0 = unsignedp1;
2542 *rescode_ptr = code;
2545 /* If comparing an integer against a constant more bits wide,
2546 maybe we can deduce a value of 1 or 0 independent of the data.
2547 Or else truncate the constant now
2548 rather than extend the variable at run time.
2550 This is only interesting if the constant is the wider arg.
2551 Also, it is not safe if the constant is unsigned and the
2552 variable arg is signed, since in this case the variable
2553 would be sign-extended and then regarded as unsigned.
2554 Our technique fails in this case because the lowest/highest
2555 possible unsigned results don't follow naturally from the
2556 lowest/highest possible values of the variable operand.
2557 For just EQ_EXPR and NE_EXPR there is another technique that
2558 could be used: see if the constant can be faithfully represented
2559 in the other operand's type, by truncating it and reextending it
2560 and see if that preserves the constant's value. */
2562 if (!real1 && !real2
2563 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
2564 && TREE_CODE (primop1) == INTEGER_CST
2565 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2567 int min_gt, max_gt, min_lt, max_lt;
2568 tree maxval, minval;
2569 /* 1 if comparison is nominally unsigned. */
2570 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2573 type = c_common_signed_or_unsigned_type (unsignedp0,
2574 TREE_TYPE (primop0));
2576 maxval = TYPE_MAX_VALUE (type);
2577 minval = TYPE_MIN_VALUE (type);
2579 if (unsignedp && !unsignedp0)
2580 *restype_ptr = c_common_signed_type (*restype_ptr);
2582 if (TREE_TYPE (primop1) != *restype_ptr)
2584 /* Convert primop1 to target type, but do not introduce
2585 additional overflow. We know primop1 is an int_cst. */
2586 primop1 = force_fit_type_double (*restype_ptr,
2587 TREE_INT_CST_LOW (primop1),
2588 TREE_INT_CST_HIGH (primop1), 0,
2589 TREE_OVERFLOW (primop1));
2591 if (type != *restype_ptr)
2593 minval = convert (*restype_ptr, minval);
2594 maxval = convert (*restype_ptr, maxval);
2597 if (unsignedp && unsignedp0)
2599 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2600 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2601 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2602 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2606 min_gt = INT_CST_LT (primop1, minval);
2607 max_gt = INT_CST_LT (primop1, maxval);
2608 min_lt = INT_CST_LT (minval, primop1);
2609 max_lt = INT_CST_LT (maxval, primop1);
2613 /* This used to be a switch, but Genix compiler can't handle that. */
2614 if (code == NE_EXPR)
2616 if (max_lt || min_gt)
2617 val = truthvalue_true_node;
2619 else if (code == EQ_EXPR)
2621 if (max_lt || min_gt)
2622 val = truthvalue_false_node;
2624 else if (code == LT_EXPR)
2627 val = truthvalue_true_node;
2629 val = truthvalue_false_node;
2631 else if (code == GT_EXPR)
2634 val = truthvalue_true_node;
2636 val = truthvalue_false_node;
2638 else if (code == LE_EXPR)
2641 val = truthvalue_true_node;
2643 val = truthvalue_false_node;
2645 else if (code == GE_EXPR)
2648 val = truthvalue_true_node;
2650 val = truthvalue_false_node;
2653 /* If primop0 was sign-extended and unsigned comparison specd,
2654 we did a signed comparison above using the signed type bounds.
2655 But the comparison we output must be unsigned.
2657 Also, for inequalities, VAL is no good; but if the signed
2658 comparison had *any* fixed result, it follows that the
2659 unsigned comparison just tests the sign in reverse
2660 (positive values are LE, negative ones GE).
2661 So we can generate an unsigned comparison
2662 against an extreme value of the signed type. */
2664 if (unsignedp && !unsignedp0)
2671 primop1 = TYPE_MIN_VALUE (type);
2677 primop1 = TYPE_MAX_VALUE (type);
2684 type = c_common_unsigned_type (type);
2687 if (TREE_CODE (primop0) != INTEGER_CST)
2689 if (val == truthvalue_false_node)
2690 warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type");
2691 if (val == truthvalue_true_node)
2692 warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type");
2697 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2698 if (TREE_SIDE_EFFECTS (primop0))
2699 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2703 /* Value is not predetermined, but do the comparison
2704 in the type of the operand that is not constant.
2705 TYPE is already properly set. */
2708 /* If either arg is decimal float and the other is float, find the
2709 proper common type to use for comparison. */
2710 else if (real1 && real2
2711 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
2712 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
2713 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2715 else if (real1 && real2
2716 && (TYPE_PRECISION (TREE_TYPE (primop0))
2717 == TYPE_PRECISION (TREE_TYPE (primop1))))
2718 type = TREE_TYPE (primop0);
2720 /* If args' natural types are both narrower than nominal type
2721 and both extend in the same manner, compare them
2722 in the type of the wider arg.
2723 Otherwise must actually extend both to the nominal
2724 common type lest different ways of extending
2726 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2728 else if (unsignedp0 == unsignedp1 && real1 == real2
2729 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2730 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2732 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2733 type = c_common_signed_or_unsigned_type (unsignedp0
2734 || TYPE_UNSIGNED (*restype_ptr),
2736 /* Make sure shorter operand is extended the right way
2737 to match the longer operand. */
2739 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2740 TREE_TYPE (primop0)),
2743 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2744 TREE_TYPE (primop1)),
2749 /* Here we must do the comparison on the nominal type
2750 using the args exactly as we received them. */
2751 type = *restype_ptr;
2755 if (!real1 && !real2 && integer_zerop (primop1)
2756 && TYPE_UNSIGNED (*restype_ptr))
2762 /* All unsigned values are >= 0, so we warn. However,
2763 if OP0 is a constant that is >= 0, the signedness of
2764 the comparison isn't an issue, so suppress the
2766 if (warn_type_limits && !in_system_header
2767 && !(TREE_CODE (primop0) == INTEGER_CST
2768 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2770 warning (OPT_Wtype_limits,
2771 "comparison of unsigned expression >= 0 is always true");
2772 value = truthvalue_true_node;
2776 if (warn_type_limits && !in_system_header
2777 && !(TREE_CODE (primop0) == INTEGER_CST
2778 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2780 warning (OPT_Wtype_limits,
2781 "comparison of unsigned expression < 0 is always false");
2782 value = truthvalue_false_node;
2791 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2792 if (TREE_SIDE_EFFECTS (primop0))
2793 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2800 *op0_ptr = convert (type, primop0);
2801 *op1_ptr = convert (type, primop1);
2803 *restype_ptr = truthvalue_type_node;
2808 /* Return a tree for the sum or difference (RESULTCODE says which)
2809 of pointer PTROP and integer INTOP. */
2812 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2816 /* The result is a pointer of the same type that is being added. */
2817 tree result_type = TREE_TYPE (ptrop);
2819 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2821 if (pedantic || warn_pointer_arith)
2822 pedwarn ("pointer of type %<void *%> used in arithmetic");
2823 size_exp = integer_one_node;
2825 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2827 if (pedantic || warn_pointer_arith)
2828 pedwarn ("pointer to a function used in arithmetic");
2829 size_exp = integer_one_node;
2831 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2833 if (pedantic || warn_pointer_arith)
2834 pedwarn ("pointer to member function used in arithmetic");
2835 size_exp = integer_one_node;
2838 size_exp = size_in_bytes (TREE_TYPE (result_type));
2840 /* We are manipulating pointer values, so we don't need to warn
2841 about relying on undefined signed overflow. We disable the
2842 warning here because we use integer types so fold won't know that
2843 they are really pointers. */
2844 fold_defer_overflow_warnings ();
2846 /* If what we are about to multiply by the size of the elements
2847 contains a constant term, apply distributive law
2848 and multiply that constant term separately.
2849 This helps produce common subexpressions. */
2850 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2851 && !TREE_CONSTANT (intop)
2852 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2853 && TREE_CONSTANT (size_exp)
2854 /* If the constant comes from pointer subtraction,
2855 skip this optimization--it would cause an error. */
2856 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2857 /* If the constant is unsigned, and smaller than the pointer size,
2858 then we must skip this optimization. This is because it could cause
2859 an overflow error if the constant is negative but INTOP is not. */
2860 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2861 || (TYPE_PRECISION (TREE_TYPE (intop))
2862 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2864 enum tree_code subcode = resultcode;
2865 tree int_type = TREE_TYPE (intop);
2866 if (TREE_CODE (intop) == MINUS_EXPR)
2867 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2868 /* Convert both subexpression types to the type of intop,
2869 because weird cases involving pointer arithmetic
2870 can result in a sum or difference with different type args. */
2871 ptrop = build_binary_op (subcode, ptrop,
2872 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2873 intop = convert (int_type, TREE_OPERAND (intop, 0));
2876 /* Convert the integer argument to a type the same size as sizetype
2877 so the multiply won't overflow spuriously. */
2878 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2879 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2880 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2881 TYPE_UNSIGNED (sizetype)), intop);
2883 /* Replace the integer argument with a suitable product by the object size.
2884 Do this multiplication as signed, then convert to the appropriate
2885 type for the pointer operation. */
2886 intop = convert (sizetype,
2887 build_binary_op (MULT_EXPR, intop,
2888 convert (TREE_TYPE (intop), size_exp), 1));
2890 /* Create the sum or difference. */
2891 if (resultcode == MINUS_EXPR)
2892 intop = fold_build1 (NEGATE_EXPR, sizetype, intop);
2894 ret = fold_build2 (POINTER_PLUS_EXPR, result_type, ptrop, intop);
2896 fold_undefer_and_ignore_overflow_warnings ();
2901 /* Return whether EXPR is a declaration whose address can never be
2905 decl_with_nonnull_addr_p (const_tree expr)
2907 return (DECL_P (expr)
2908 && (TREE_CODE (expr) == PARM_DECL
2909 || TREE_CODE (expr) == LABEL_DECL
2910 || !DECL_WEAK (expr)));
2913 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2914 or for an `if' or `while' statement or ?..: exp. It should already
2915 have been validated to be of suitable type; otherwise, a bad
2916 diagnostic may result.
2918 This preparation consists of taking the ordinary
2919 representation of an expression expr and producing a valid tree
2920 boolean expression describing whether expr is nonzero. We could
2921 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2922 but we optimize comparisons, &&, ||, and !.
2924 The resulting type should always be `truthvalue_type_node'. */
2927 c_common_truthvalue_conversion (tree expr)
2929 switch (TREE_CODE (expr))
2931 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2932 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2933 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2934 case ORDERED_EXPR: case UNORDERED_EXPR:
2935 if (TREE_TYPE (expr) == truthvalue_type_node)
2937 return build2 (TREE_CODE (expr), truthvalue_type_node,
2938 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2940 case TRUTH_ANDIF_EXPR:
2941 case TRUTH_ORIF_EXPR:
2942 case TRUTH_AND_EXPR:
2944 case TRUTH_XOR_EXPR:
2945 if (TREE_TYPE (expr) == truthvalue_type_node)
2947 return build2 (TREE_CODE (expr), truthvalue_type_node,
2948 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2949 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)));
2951 case TRUTH_NOT_EXPR:
2952 if (TREE_TYPE (expr) == truthvalue_type_node)
2954 return build1 (TREE_CODE (expr), truthvalue_type_node,
2955 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2961 return integer_zerop (expr) ? truthvalue_false_node
2962 : truthvalue_true_node;
2965 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2966 ? truthvalue_true_node
2967 : truthvalue_false_node;
2970 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
2971 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
2972 ? truthvalue_true_node
2973 : truthvalue_false_node;
2976 expr = build_unary_op (ADDR_EXPR, expr, 0);
2981 tree inner = TREE_OPERAND (expr, 0);
2982 if (decl_with_nonnull_addr_p (inner))
2984 /* Common Ada/Pascal programmer's mistake. */
2985 warning (OPT_Waddress,
2986 "the address of %qD will always evaluate as %<true%>",
2988 return truthvalue_true_node;
2991 /* If we still have a decl, it is possible for its address to
2992 be NULL, so we cannot optimize. */
2995 gcc_assert (DECL_WEAK (inner));
2999 if (TREE_SIDE_EFFECTS (inner))
3000 return build2 (COMPOUND_EXPR, truthvalue_type_node,
3001 inner, truthvalue_true_node);
3003 return truthvalue_true_node;
3007 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
3008 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
3009 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
3010 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
3016 /* These don't change whether an object is nonzero or zero. */
3017 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
3021 /* These don't change whether an object is zero or nonzero, but
3022 we can't ignore them if their second arg has side-effects. */
3023 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
3024 return build2 (COMPOUND_EXPR, truthvalue_type_node,
3025 TREE_OPERAND (expr, 1),
3026 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
3028 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
3031 /* Distribute the conversion into the arms of a COND_EXPR. */
3032 return fold_build3 (COND_EXPR, truthvalue_type_node,
3033 TREE_OPERAND (expr, 0),
3034 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
3035 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2)));
3039 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3040 since that affects how `default_conversion' will behave. */
3041 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
3042 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
3044 /* If this is widening the argument, we can ignore it. */
3045 if (TYPE_PRECISION (TREE_TYPE (expr))
3046 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
3047 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
3051 if (!TREE_NO_WARNING (expr)
3052 && warn_parentheses)
3054 warning (OPT_Wparentheses,
3055 "suggest parentheses around assignment used as truth value");
3056 TREE_NO_WARNING (expr) = 1;
3064 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
3066 tree t = save_expr (expr);
3067 return (build_binary_op
3068 ((TREE_SIDE_EFFECTS (expr)
3069 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
3070 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
3071 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
3075 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
3077 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
3079 (TREE_TYPE (expr))));
3080 return build_binary_op (NE_EXPR, expr, fixed_zero_node, 1);
3083 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
3086 static void def_builtin_1 (enum built_in_function fncode,
3088 enum built_in_class fnclass,
3089 tree fntype, tree libtype,
3090 bool both_p, bool fallback_p, bool nonansi_p,
3091 tree fnattrs, bool implicit_p);
3094 /* Apply the TYPE_QUALS to the new DECL. */
3097 c_apply_type_quals_to_decl (int type_quals, tree decl)
3099 tree type = TREE_TYPE (decl);
3101 if (type == error_mark_node)
3104 if (((type_quals & TYPE_QUAL_CONST)
3105 || (type && TREE_CODE (type) == REFERENCE_TYPE))
3106 /* An object declared 'const' is only readonly after it is
3107 initialized. We don't have any way of expressing this currently,
3108 so we need to be conservative and unset TREE_READONLY for types
3109 with constructors. Otherwise aliasing code will ignore stores in
3110 an inline constructor. */
3111 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
3112 TREE_READONLY (decl) = 1;
3113 if (type_quals & TYPE_QUAL_VOLATILE)
3115 TREE_SIDE_EFFECTS (decl) = 1;
3116 TREE_THIS_VOLATILE (decl) = 1;
3118 if (type_quals & TYPE_QUAL_RESTRICT)
3120 while (type && TREE_CODE (type) == ARRAY_TYPE)
3121 /* Allow 'restrict' on arrays of pointers.
3122 FIXME currently we just ignore it. */
3123 type = TREE_TYPE (type);
3125 || !POINTER_TYPE_P (type)
3126 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
3127 error ("invalid use of %<restrict%>");
3128 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
3129 /* Indicate we need to make a unique alias set for this pointer.
3130 We can't do it here because it might be pointing to an
3132 DECL_POINTER_ALIAS_SET (decl) = -2;
3136 /* Hash function for the problem of multiple type definitions in
3137 different files. This must hash all types that will compare
3138 equal via comptypes to the same value. In practice it hashes
3139 on some of the simple stuff and leaves the details to comptypes. */
3142 c_type_hash (const void *p)
3146 const_tree const t = (const_tree) p;
3148 switch (TREE_CODE (t))
3150 /* For pointers, hash on pointee type plus some swizzling. */
3152 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
3153 /* Hash on number of elements and total size. */
3156 t2 = TYPE_VALUES (t);
3160 t2 = TYPE_FIELDS (t);
3162 case QUAL_UNION_TYPE:
3164 t2 = TYPE_FIELDS (t);
3168 t2 = TYPE_FIELDS (t);
3173 for (; t2; t2 = TREE_CHAIN (t2))
3175 /* We might have a VLA here. */
3176 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
3179 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
3180 return ((size << 24) | (i << shift));
3183 static GTY((param_is (union tree_node))) htab_t type_hash_table;
3185 /* Return the typed-based alias set for T, which may be an expression
3186 or a type. Return -1 if we don't do anything special. */
3189 c_common_get_alias_set (tree t)
3194 /* Permit type-punning when accessing a union, provided the access
3195 is directly through the union. For example, this code does not
3196 permit taking the address of a union member and then storing
3197 through it. Even the type-punning allowed here is a GCC
3198 extension, albeit a common and useful one; the C standard says
3199 that such accesses have implementation-defined behavior. */
3201 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
3202 u = TREE_OPERAND (u, 0))
3203 if (TREE_CODE (u) == COMPONENT_REF
3204 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
3207 /* That's all the expressions we handle specially. */
3211 /* The C standard guarantees that any object may be accessed via an
3212 lvalue that has character type. */
3213 if (t == char_type_node
3214 || t == signed_char_type_node
3215 || t == unsigned_char_type_node)
3218 /* If it has the may_alias attribute, it can alias anything. */
3219 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
3222 /* The C standard specifically allows aliasing between signed and
3223 unsigned variants of the same type. We treat the signed
3224 variant as canonical. */
3225 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
3227 tree t1 = c_common_signed_type (t);
3229 /* t1 == t can happen for boolean nodes which are always unsigned. */
3231 return get_alias_set (t1);
3233 else if (POINTER_TYPE_P (t))
3237 /* Unfortunately, there is no canonical form of a pointer type.
3238 In particular, if we have `typedef int I', then `int *', and
3239 `I *' are different types. So, we have to pick a canonical
3240 representative. We do this below.
3242 Technically, this approach is actually more conservative that
3243 it needs to be. In particular, `const int *' and `int *'
3244 should be in different alias sets, according to the C and C++
3245 standard, since their types are not the same, and so,
3246 technically, an `int **' and `const int **' cannot point at
3249 But, the standard is wrong. In particular, this code is
3254 const int* const* cipp = ipp;
3256 And, it doesn't make sense for that to be legal unless you
3257 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3258 the pointed-to types. This issue has been reported to the
3260 t1 = build_type_no_quals (t);
3262 return get_alias_set (t1);
3265 /* Handle the case of multiple type nodes referring to "the same" type,
3266 which occurs with IMA. These share an alias set. FIXME: Currently only
3267 C90 is handled. (In C99 type compatibility is not transitive, which
3268 complicates things mightily. The alias set splay trees can theoretically
3269 represent this, but insertion is tricky when you consider all the
3270 different orders things might arrive in.) */
3272 if (c_language != clk_c || flag_isoc99)
3275 /* Save time if there's only one input file. */
3276 if (num_in_fnames == 1)
3279 /* Pointers need special handling if they point to any type that
3280 needs special handling (below). */
3281 if (TREE_CODE (t) == POINTER_TYPE)
3284 /* Find bottom type under any nested POINTERs. */
3285 for (t2 = TREE_TYPE (t);
3286 TREE_CODE (t2) == POINTER_TYPE;
3287 t2 = TREE_TYPE (t2))
3289 if (TREE_CODE (t2) != RECORD_TYPE
3290 && TREE_CODE (t2) != ENUMERAL_TYPE
3291 && TREE_CODE (t2) != QUAL_UNION_TYPE
3292 && TREE_CODE (t2) != UNION_TYPE)
3294 if (TYPE_SIZE (t2) == 0)
3297 /* These are the only cases that need special handling. */
3298 if (TREE_CODE (t) != RECORD_TYPE
3299 && TREE_CODE (t) != ENUMERAL_TYPE
3300 && TREE_CODE (t) != QUAL_UNION_TYPE
3301 && TREE_CODE (t) != UNION_TYPE
3302 && TREE_CODE (t) != POINTER_TYPE)
3305 if (TYPE_SIZE (t) == 0)
3308 /* Look up t in hash table. Only one of the compatible types within each
3309 alias set is recorded in the table. */
3310 if (!type_hash_table)
3311 type_hash_table = htab_create_ggc (1021, c_type_hash,
3312 (htab_eq) lang_hooks.types_compatible_p,
3314 slot = htab_find_slot (type_hash_table, t, INSERT);
3317 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
3318 return TYPE_ALIAS_SET ((tree)*slot);
3321 /* Our caller will assign and record (in t) a new alias set; all we need
3322 to do is remember t in the hash table. */
3328 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3329 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3330 flag controls whether we should diagnose possibly ill-formed
3331 constructs or not. */
3334 c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain)
3336 const char *op_name;
3338 enum tree_code type_code = TREE_CODE (type);
3340 op_name = is_sizeof ? "sizeof" : "__alignof__";
3342 if (type_code == FUNCTION_TYPE)
3346 if (complain && (pedantic || warn_pointer_arith))
3347 pedwarn ("invalid application of %<sizeof%> to a function type");
3348 value = size_one_node;
3351 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3353 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3355 if (type_code == VOID_TYPE
3356 && complain && (pedantic || warn_pointer_arith))
3357 pedwarn ("invalid application of %qs to a void type", op_name);
3358 value = size_one_node;
3360 else if (!COMPLETE_TYPE_P (type))
3363 error ("invalid application of %qs to incomplete type %qT ",
3365 value = size_zero_node;
3370 /* Convert in case a char is more than one unit. */
3371 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3372 size_int (TYPE_PRECISION (char_type_node)
3375 value = size_int (TYPE_ALIGN_UNIT (type));
3378 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3379 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3380 never happen. However, this node should really have type
3381 `size_t', which is just a typedef for an ordinary integer type. */
3382 value = fold_convert (size_type_node, value);
3383 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
3388 /* Implement the __alignof keyword: Return the minimum required
3389 alignment of EXPR, measured in bytes. For VAR_DECLs,
3390 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3391 from an "aligned" __attribute__ specification). */
3394 c_alignof_expr (tree expr)
3398 if (VAR_OR_FUNCTION_DECL_P (expr))
3399 t = size_int (DECL_ALIGN_UNIT (expr));
3401 else if (TREE_CODE (expr) == COMPONENT_REF
3402 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3404 error ("%<__alignof%> applied to a bit-field");
3407 else if (TREE_CODE (expr) == COMPONENT_REF
3408 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3409 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
3411 else if (TREE_CODE (expr) == INDIRECT_REF)
3413 tree t = TREE_OPERAND (expr, 0);
3415 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3417 while ((TREE_CODE (t) == NOP_EXPR || TREE_CODE (t) == CONVERT_EXPR)
3418 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3422 t = TREE_OPERAND (t, 0);
3423 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3424 if (thisalign > bestalign)
3425 best = t, bestalign = thisalign;
3427 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3430 return c_alignof (TREE_TYPE (expr));
3432 return fold_convert (size_type_node, t);
3435 /* Handle C and C++ default attributes. */
3437 enum built_in_attribute
3439 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3440 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3441 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3442 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3443 #include "builtin-attrs.def"
3444 #undef DEF_ATTR_NULL_TREE
3446 #undef DEF_ATTR_IDENT
3447 #undef DEF_ATTR_TREE_LIST
3451 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3453 static void c_init_attributes (void);
3457 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3458 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3459 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3460 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3461 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3462 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3463 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3464 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3465 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3466 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3467 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3468 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3469 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3470 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3471 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3473 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3474 #include "builtin-types.def"
3475 #undef DEF_PRIMITIVE_TYPE
3476 #undef DEF_FUNCTION_TYPE_0
3477 #undef DEF_FUNCTION_TYPE_1
3478 #undef DEF_FUNCTION_TYPE_2
3479 #undef DEF_FUNCTION_TYPE_3
3480 #undef DEF_FUNCTION_TYPE_4
3481 #undef DEF_FUNCTION_TYPE_5
3482 #undef DEF_FUNCTION_TYPE_6
3483 #undef DEF_FUNCTION_TYPE_7
3484 #undef DEF_FUNCTION_TYPE_VAR_0
3485 #undef DEF_FUNCTION_TYPE_VAR_1
3486 #undef DEF_FUNCTION_TYPE_VAR_2
3487 #undef DEF_FUNCTION_TYPE_VAR_3
3488 #undef DEF_FUNCTION_TYPE_VAR_4
3489 #undef DEF_FUNCTION_TYPE_VAR_5
3490 #undef DEF_POINTER_TYPE
3494 typedef enum c_builtin_type builtin_type;
3496 /* A temporary array for c_common_nodes_and_builtins. Used in
3497 communication with def_fn_type. */
3498 static tree builtin_types[(int) BT_LAST + 1];
3500 /* A helper function for c_common_nodes_and_builtins. Build function type
3501 for DEF with return type RET and N arguments. If VAR is true, then the
3502 function should be variadic after those N arguments.
3504 Takes special care not to ICE if any of the types involved are
3505 error_mark_node, which indicates that said type is not in fact available
3506 (see builtin_type_for_size). In which case the function type as a whole
3507 should be error_mark_node. */
3510 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
3512 tree args = NULL, t;
3517 for (i = 0; i < n; ++i)
3519 builtin_type a = va_arg (list, builtin_type);
3520 t = builtin_types[a];
3521 if (t == error_mark_node)
3523 args = tree_cons (NULL_TREE, t, args);
3527 args = nreverse (args);
3529 args = chainon (args, void_list_node);
3531 t = builtin_types[ret];
3532 if (t == error_mark_node)
3534 t = build_function_type (t, args);
3537 builtin_types[def] = t;
3540 /* Build builtin functions common to both C and C++ language
3544 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
3546 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3547 builtin_types[ENUM] = VALUE;
3548 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3549 def_fn_type (ENUM, RETURN, 0, 0);
3550 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3551 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3552 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3553 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3554 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3555 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3556 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3557 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3558 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3559 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3560 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3562 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3563 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3565 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3566 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3567 def_fn_type (ENUM, RETURN, 1, 0);
3568 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3569 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3570 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3571 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3572 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3573 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3574 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3575 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3576 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3577 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3578 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3579 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3581 #include "builtin-types.def"
3583 #undef DEF_PRIMITIVE_TYPE
3584 #undef DEF_FUNCTION_TYPE_1
3585 #undef DEF_FUNCTION_TYPE_2
3586 #undef DEF_FUNCTION_TYPE_3
3587 #undef DEF_FUNCTION_TYPE_4
3588 #undef DEF_FUNCTION_TYPE_5
3589 #undef DEF_FUNCTION_TYPE_6
3590 #undef DEF_FUNCTION_TYPE_VAR_0
3591 #undef DEF_FUNCTION_TYPE_VAR_1
3592 #undef DEF_FUNCTION_TYPE_VAR_2
3593 #undef DEF_FUNCTION_TYPE_VAR_3
3594 #undef DEF_FUNCTION_TYPE_VAR_4
3595 #undef DEF_FUNCTION_TYPE_VAR_5
3596 #undef DEF_POINTER_TYPE
3597 builtin_types[(int) BT_LAST] = NULL_TREE;
3599 c_init_attributes ();
3601 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3602 NONANSI_P, ATTRS, IMPLICIT, COND) \
3604 def_builtin_1 (ENUM, NAME, CLASS, \
3605 builtin_types[(int) TYPE], \
3606 builtin_types[(int) LIBTYPE], \
3607 BOTH_P, FALLBACK_P, NONANSI_P, \
3608 built_in_attributes[(int) ATTRS], IMPLICIT);
3609 #include "builtins.def"
3612 targetm.init_builtins ();
3614 build_common_builtin_nodes ();
3620 /* Build tree nodes and builtin functions common to both C and C++ language
3624 c_common_nodes_and_builtins (void)
3626 int wchar_type_size;
3627 tree array_domain_type;
3628 tree va_list_ref_type_node;
3629 tree va_list_arg_type_node;
3631 /* Define `int' and `char' first so that dbx will output them first. */
3632 record_builtin_type (RID_INT, NULL, integer_type_node);
3633 record_builtin_type (RID_CHAR, "char", char_type_node);
3635 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3636 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3637 but not C. Are the conditionals here needed? */
3638 if (c_dialect_cxx ())
3639 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3640 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3641 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3642 record_builtin_type (RID_MAX, "long unsigned int",
3643 long_unsigned_type_node);
3644 if (c_dialect_cxx ())
3645 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3646 record_builtin_type (RID_MAX, "long long int",
3647 long_long_integer_type_node);
3648 record_builtin_type (RID_MAX, "long long unsigned int",
3649 long_long_unsigned_type_node);
3650 if (c_dialect_cxx ())
3651 record_builtin_type (RID_MAX, "long long unsigned",
3652 long_long_unsigned_type_node);
3653 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3654 record_builtin_type (RID_MAX, "short unsigned int",
3655 short_unsigned_type_node);
3656 if (c_dialect_cxx ())
3657 record_builtin_type (RID_MAX, "unsigned short",
3658 short_unsigned_type_node);
3660 /* Define both `signed char' and `unsigned char'. */
3661 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3662 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3664 /* These are types that c_common_type_for_size and
3665 c_common_type_for_mode use. */
3666 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3668 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3670 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3672 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3674 #if HOST_BITS_PER_WIDE_INT >= 64
3675 if (targetm.scalar_mode_supported_p (TImode))
3676 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3677 get_identifier ("__int128_t"),
3680 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3681 unsigned_intQI_type_node));
3682 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3683 unsigned_intHI_type_node));
3684 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3685 unsigned_intSI_type_node));
3686 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3687 unsigned_intDI_type_node));
3688 #if HOST_BITS_PER_WIDE_INT >= 64
3689 if (targetm.scalar_mode_supported_p (TImode))
3690 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3691 get_identifier ("__uint128_t"),
3692 unsigned_intTI_type_node));
3695 /* Create the widest literal types. */
3696 widest_integer_literal_type_node
3697 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3698 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3699 widest_integer_literal_type_node));
3701 widest_unsigned_literal_type_node
3702 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3703 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3704 widest_unsigned_literal_type_node));
3706 /* `unsigned long' is the standard type for sizeof.
3707 Note that stddef.h uses `unsigned long',
3708 and this must agree, even if long and int are the same size. */
3710 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3711 signed_size_type_node = c_common_signed_type (size_type_node);
3712 set_sizetype (size_type_node);
3715 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3717 build_common_tree_nodes_2 (flag_short_double);
3719 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3720 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3721 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3723 /* Only supported decimal floating point extension if the target
3724 actually supports underlying modes. */
3725 if (targetm.scalar_mode_supported_p (SDmode)
3726 && targetm.scalar_mode_supported_p (DDmode)
3727 && targetm.scalar_mode_supported_p (TDmode))
3729 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
3730 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
3731 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
3734 if (targetm.fixed_point_supported_p ())
3736 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
3737 record_builtin_type (RID_FRACT, NULL, fract_type_node);
3738 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
3739 record_builtin_type (RID_MAX, "long long _Fract",
3740 long_long_fract_type_node);
3741 record_builtin_type (RID_MAX, "unsigned short _Fract",
3742 unsigned_short_fract_type_node);
3743 record_builtin_type (RID_MAX, "unsigned _Fract",
3744 unsigned_fract_type_node);
3745 record_builtin_type (RID_MAX, "unsigned long _Fract",
3746 unsigned_long_fract_type_node);
3747 record_builtin_type (RID_MAX, "unsigned long long _Fract",
3748 unsigned_long_long_fract_type_node);
3749 record_builtin_type (RID_MAX, "_Sat short _Fract",
3750 sat_short_fract_type_node);
3751 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
3752 record_builtin_type (RID_MAX, "_Sat long _Fract",
3753 sat_long_fract_type_node);
3754 record_builtin_type (RID_MAX, "_Sat long long _Fract",
3755 sat_long_long_fract_type_node);
3756 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
3757 sat_unsigned_short_fract_type_node);
3758 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
3759 sat_unsigned_fract_type_node);
3760 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
3761 sat_unsigned_long_fract_type_node);
3762 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
3763 sat_unsigned_long_long_fract_type_node);
3764 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
3765 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
3766 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
3767 record_builtin_type (RID_MAX, "long long _Accum",
3768 long_long_accum_type_node);
3769 record_builtin_type (RID_MAX, "unsigned short _Accum",
3770 unsigned_short_accum_type_node);
3771 record_builtin_type (RID_MAX, "unsigned _Accum",
3772 unsigned_accum_type_node);
3773 record_builtin_type (RID_MAX, "unsigned long _Accum",
3774 unsigned_long_accum_type_node);
3775 record_builtin_type (RID_MAX, "unsigned long long _Accum",
3776 unsigned_long_long_accum_type_node);
3777 record_builtin_type (RID_MAX, "_Sat short _Accum",
3778 sat_short_accum_type_node);
3779 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
3780 record_builtin_type (RID_MAX, "_Sat long _Accum",
3781 sat_long_accum_type_node);
3782 record_builtin_type (RID_MAX, "_Sat long long _Accum",
3783 sat_long_long_accum_type_node);
3784 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
3785 sat_unsigned_short_accum_type_node);
3786 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
3787 sat_unsigned_accum_type_node);
3788 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
3789 sat_unsigned_long_accum_type_node);
3790 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
3791 sat_unsigned_long_long_accum_type_node);
3795 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3796 get_identifier ("complex int"),
3797 complex_integer_type_node));
3798 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3799 get_identifier ("complex float"),
3800 complex_float_type_node));
3801 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3802 get_identifier ("complex double"),
3803 complex_double_type_node));
3804 lang_hooks.decls.pushdecl
3805 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3806 complex_long_double_type_node));
3808 if (c_dialect_cxx ())
3809 /* For C++, make fileptr_type_node a distinct void * type until
3810 FILE type is defined. */
3811 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3813 record_builtin_type (RID_VOID, NULL, void_type_node);
3815 /* Set the TYPE_NAME for any variants that were built before
3816 record_builtin_type gave names to the built-in types. */
3818 tree void_name = TYPE_NAME (void_type_node);
3819 TYPE_NAME (void_type_node) = NULL_TREE;
3820 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
3822 TYPE_NAME (void_type_node) = void_name;
3825 /* This node must not be shared. */
3826 void_zero_node = make_node (INTEGER_CST);
3827 TREE_TYPE (void_zero_node) = void_type_node;
3829 void_list_node = build_void_list_node ();
3831 /* Make a type to be the domain of a few array types
3832 whose domains don't really matter.
3833 200 is small enough that it always fits in size_t
3834 and large enough that it can hold most function names for the
3835 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3836 array_domain_type = build_index_type (size_int (200));
3838 /* Make a type for arrays of characters.
3839 With luck nothing will ever really depend on the length of this
3841 char_array_type_node
3842 = build_array_type (char_type_node, array_domain_type);
3844 /* Likewise for arrays of ints. */
3846 = build_array_type (integer_type_node, array_domain_type);
3848 string_type_node = build_pointer_type (char_type_node);
3849 const_string_type_node
3850 = build_pointer_type (build_qualified_type
3851 (char_type_node, TYPE_QUAL_CONST));
3853 /* This is special for C++ so functions can be overloaded. */
3854 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3855 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3856 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3857 if (c_dialect_cxx ())
3859 if (TYPE_UNSIGNED (wchar_type_node))
3860 wchar_type_node = make_unsigned_type (wchar_type_size);
3862 wchar_type_node = make_signed_type (wchar_type_size);
3863 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3867 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3868 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3871 /* This is for wide string constants. */
3872 wchar_array_type_node
3873 = build_array_type (wchar_type_node, array_domain_type);
3876 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3879 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3881 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3883 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3885 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3886 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3888 lang_hooks.decls.pushdecl
3889 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3890 va_list_type_node));
3892 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3894 va_list_arg_type_node = va_list_ref_type_node =
3895 build_pointer_type (TREE_TYPE (va_list_type_node));
3899 va_list_arg_type_node = va_list_type_node;
3900 va_list_ref_type_node = build_reference_type (va_list_type_node);
3903 if (!flag_preprocess_only)
3904 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
3906 main_identifier_node = get_identifier ("main");
3908 /* Create the built-in __null node. It is important that this is
3910 null_node = make_node (INTEGER_CST);
3911 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
3913 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3914 memset (builtin_types, 0, sizeof (builtin_types));
3917 /* Look up the function in built_in_decls that corresponds to DECL
3918 and set ASMSPEC as its user assembler name. DECL must be a
3919 function decl that declares a builtin. */
3922 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3925 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3926 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3929 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3930 set_user_assembler_name (builtin, asmspec);
3931 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3932 init_block_move_fn (asmspec);
3933 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3934 init_block_clear_fn (asmspec);
3937 /* The number of named compound-literals generated thus far. */
3938 static GTY(()) int compound_literal_number;
3940 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3943 set_compound_literal_name (tree decl)
3946 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
3947 compound_literal_number);
3948 compound_literal_number++;
3949 DECL_NAME (decl) = get_identifier (name);
3953 build_va_arg (tree expr, tree type)
3955 return build1 (VA_ARG_EXPR, type, expr);
3959 /* Linked list of disabled built-in functions. */
3961 typedef struct disabled_builtin
3964 struct disabled_builtin *next;
3966 static disabled_builtin *disabled_builtins = NULL;
3968 static bool builtin_function_disabled_p (const char *);
3970 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3971 begins with "__builtin_", give an error. */
3974 disable_builtin_function (const char *name)
3976 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3977 error ("cannot disable built-in function %qs", name);
3980 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3981 new_disabled_builtin->name = name;
3982 new_disabled_builtin->next = disabled_builtins;
3983 disabled_builtins = new_disabled_builtin;
3988 /* Return true if the built-in function NAME has been disabled, false
3992 builtin_function_disabled_p (const char *name)
3994 disabled_builtin *p;
3995 for (p = disabled_builtins; p != NULL; p = p->next)
3997 if (strcmp (name, p->name) == 0)
4004 /* Worker for DEF_BUILTIN.
4005 Possibly define a builtin function with one or two names.
4006 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4007 nonansi_p and flag_no_nonansi_builtin. */
4010 def_builtin_1 (enum built_in_function fncode,
4012 enum built_in_class fnclass,
4013 tree fntype, tree libtype,
4014 bool both_p, bool fallback_p, bool nonansi_p,
4015 tree fnattrs, bool implicit_p)
4018 const char *libname;
4020 if (fntype == error_mark_node)
4023 gcc_assert ((!both_p && !fallback_p)
4024 || !strncmp (name, "__builtin_",
4025 strlen ("__builtin_")));
4027 libname = name + strlen ("__builtin_");
4028 decl = add_builtin_function (name, fntype, fncode, fnclass,
4029 (fallback_p ? libname : NULL),
4032 && !flag_no_builtin && !builtin_function_disabled_p (libname)
4033 && !(nonansi_p && flag_no_nonansi_builtin))
4034 add_builtin_function (libname, libtype, fncode, fnclass,
4037 built_in_decls[(int) fncode] = decl;
4039 implicit_built_in_decls[(int) fncode] = decl;
4042 /* Nonzero if the type T promotes to int. This is (nearly) the
4043 integral promotions defined in ISO C99 6.3.1.1/2. */
4046 c_promoting_integer_type_p (const_tree t)
4048 switch (TREE_CODE (t))
4051 return (TYPE_MAIN_VARIANT (t) == char_type_node
4052 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
4053 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
4054 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
4055 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
4056 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
4059 /* ??? Technically all enumerations not larger than an int
4060 promote to an int. But this is used along code paths
4061 that only want to notice a size change. */
4062 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
4072 /* Return 1 if PARMS specifies a fixed number of parameters
4073 and none of their types is affected by default promotions. */
4076 self_promoting_args_p (const_tree parms)
4079 for (t = parms; t; t = TREE_CHAIN (t))
4081 tree type = TREE_VALUE (t);
4083 if (type == error_mark_node)
4086 if (TREE_CHAIN (t) == 0 && type != void_type_node)
4092 if (TYPE_MAIN_VARIANT (type) == float_type_node)
4095 if (c_promoting_integer_type_p (type))
4101 /* Recursively examines the array elements of TYPE, until a non-array
4102 element type is found. */
4105 strip_array_types (tree type)
4107 while (TREE_CODE (type) == ARRAY_TYPE)
4108 type = TREE_TYPE (type);
4113 /* Recursively remove any '*' or '&' operator from TYPE. */
4115 strip_pointer_operator (tree t)
4117 while (POINTER_TYPE_P (t))
4122 /* Recursively remove pointer or array type from TYPE. */
4124 strip_pointer_or_array_types (tree t)
4126 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
4131 /* Used to compare case labels. K1 and K2 are actually tree nodes
4132 representing case labels, or NULL_TREE for a `default' label.
4133 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4134 K2, and 0 if K1 and K2 are equal. */
4137 case_compare (splay_tree_key k1, splay_tree_key k2)
4139 /* Consider a NULL key (such as arises with a `default' label) to be
4140 smaller than anything else. */
4146 return tree_int_cst_compare ((tree) k1, (tree) k2);
4149 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4150 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4151 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4152 case label was declared using the usual C/C++ syntax, rather than
4153 the GNU case range extension. CASES is a tree containing all the
4154 case ranges processed so far; COND is the condition for the
4155 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
4156 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4159 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
4160 tree low_value, tree high_value)
4165 splay_tree_node node;
4167 /* Create the LABEL_DECL itself. */
4168 label = create_artificial_label ();
4170 /* If there was an error processing the switch condition, bail now
4171 before we get more confused. */
4172 if (!cond || cond == error_mark_node)
4175 if ((low_value && TREE_TYPE (low_value)
4176 && POINTER_TYPE_P (TREE_TYPE (low_value)))
4177 || (high_value && TREE_TYPE (high_value)
4178 && POINTER_TYPE_P (TREE_TYPE (high_value))))
4180 error ("pointers are not permitted as case values");
4184 /* Case ranges are a GNU extension. */
4185 if (high_value && pedantic)
4186 pedwarn ("range expressions in switch statements are non-standard");
4188 type = TREE_TYPE (cond);
4191 low_value = check_case_value (low_value);
4192 low_value = convert_and_check (type, low_value);
4193 if (low_value == error_mark_node)
4198 high_value = check_case_value (high_value);
4199 high_value = convert_and_check (type, high_value);
4200 if (high_value == error_mark_node)
4204 if (low_value && high_value)
4206 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4207 really a case range, even though it was written that way.
4208 Remove the HIGH_VALUE to simplify later processing. */
4209 if (tree_int_cst_equal (low_value, high_value))
4210 high_value = NULL_TREE;
4211 else if (!tree_int_cst_lt (low_value, high_value))
4212 warning (0, "empty range specified");
4215 /* See if the case is in range of the type of the original testing
4216 expression. If both low_value and high_value are out of range,
4217 don't insert the case label and return NULL_TREE. */
4219 && !check_case_bounds (type, orig_type,
4220 &low_value, high_value ? &high_value : NULL))
4223 /* Look up the LOW_VALUE in the table of case labels we already
4225 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
4226 /* If there was not an exact match, check for overlapping ranges.
4227 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4228 that's a `default' label and the only overlap is an exact match. */
4229 if (!node && (low_value || high_value))
4231 splay_tree_node low_bound;
4232 splay_tree_node high_bound;
4234 /* Even though there wasn't an exact match, there might be an
4235 overlap between this case range and another case range.
4236 Since we've (inductively) not allowed any overlapping case
4237 ranges, we simply need to find the greatest low case label
4238 that is smaller that LOW_VALUE, and the smallest low case
4239 label that is greater than LOW_VALUE. If there is an overlap
4240 it will occur in one of these two ranges. */
4241 low_bound = splay_tree_predecessor (cases,
4242 (splay_tree_key) low_value);
4243 high_bound = splay_tree_successor (cases,
4244 (splay_tree_key) low_value);
4246 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4247 the LOW_VALUE, so there is no need to check unless the
4248 LOW_BOUND is in fact itself a case range. */
4250 && CASE_HIGH ((tree) low_bound->value)
4251 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4254 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4255 range is bigger than the low end of the current range, so we
4256 are only interested if the current range is a real range, and
4257 not an ordinary case label. */
4260 && (tree_int_cst_compare ((tree) high_bound->key,
4265 /* If there was an overlap, issue an error. */
4268 tree duplicate = CASE_LABEL ((tree) node->value);
4272 error ("duplicate (or overlapping) case value");
4273 error ("%Jthis is the first entry overlapping that value", duplicate);
4277 error ("duplicate case value") ;
4278 error ("%Jpreviously used here", duplicate);
4282 error ("multiple default labels in one switch");
4283 error ("%Jthis is the first default label", duplicate);
4288 /* Add a CASE_LABEL to the statement-tree. */
4289 case_label = add_stmt (build_case_label (low_value, high_value, label));
4290 /* Register this case label in the splay tree. */
4291 splay_tree_insert (cases,
4292 (splay_tree_key) low_value,
4293 (splay_tree_value) case_label);
4298 /* Add a label so that the back-end doesn't think that the beginning of
4299 the switch is unreachable. Note that we do not add a case label, as
4300 that just leads to duplicates and thence to failure later on. */
4303 tree t = create_artificial_label ();
4304 add_stmt (build_stmt (LABEL_EXPR, t));
4306 return error_mark_node;
4309 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4310 Used to verify that case values match up with enumerator values. */
4313 match_case_to_enum_1 (tree key, tree type, tree label)
4315 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4317 /* ??? Not working too hard to print the double-word value.
4318 Should perhaps be done with %lwd in the diagnostic routines? */
4319 if (TREE_INT_CST_HIGH (key) == 0)
4320 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4321 TREE_INT_CST_LOW (key));
4322 else if (!TYPE_UNSIGNED (type)
4323 && TREE_INT_CST_HIGH (key) == -1
4324 && TREE_INT_CST_LOW (key) != 0)
4325 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4326 -TREE_INT_CST_LOW (key));
4328 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4329 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
4331 if (TYPE_NAME (type) == 0)
4332 warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
4333 "%Jcase value %qs not in enumerated type",
4334 CASE_LABEL (label), buf);
4336 warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
4337 "%Jcase value %qs not in enumerated type %qT",
4338 CASE_LABEL (label), buf, type);
4341 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4342 Used to verify that case values match up with enumerator values. */
4345 match_case_to_enum (splay_tree_node node, void *data)
4347 tree label = (tree) node->value;
4348 tree type = (tree) data;
4350 /* Skip default case. */
4351 if (!CASE_LOW (label))
4354 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4355 when we did our enum->case scan. Reset our scratch bit after. */
4356 if (!CASE_LOW_SEEN (label))
4357 match_case_to_enum_1 (CASE_LOW (label), type, label);
4359 CASE_LOW_SEEN (label) = 0;
4361 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4362 not set, that means that CASE_HIGH did not appear when we did our
4363 enum->case scan. Reset our scratch bit after. */
4364 if (CASE_HIGH (label))
4366 if (!CASE_HIGH_SEEN (label))
4367 match_case_to_enum_1 (CASE_HIGH (label), type, label);
4369 CASE_HIGH_SEEN (label) = 0;
4375 /* Handle -Wswitch*. Called from the front end after parsing the
4376 switch construct. */
4377 /* ??? Should probably be somewhere generic, since other languages
4378 besides C and C++ would want this. At the moment, however, C/C++
4379 are the only tree-ssa languages that support enumerations at all,
4380 so the point is moot. */
4383 c_do_switch_warnings (splay_tree cases, location_t switch_location,
4384 tree type, tree cond)
4386 splay_tree_node default_node;
4387 splay_tree_node node;
4389 int saved_warn_switch;
4391 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4394 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4396 warning (OPT_Wswitch_default, "%Hswitch missing default case",
4399 /* From here on, we only care about about enumerated types. */
4400 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
4403 /* If the switch expression was an enumerated type, check that
4404 exactly all enumeration literals are covered by the cases.
4405 The check is made when -Wswitch was specified and there is no
4406 default case, or when -Wswitch-enum was specified. */
4408 if (!warn_switch_enum
4409 && !(warn_switch && !default_node))
4412 /* Clearing COND if it is not an integer constant simplifies
4413 the tests inside the loop below. */
4414 if (TREE_CODE (cond) != INTEGER_CST)
4417 /* The time complexity here is O(N*lg(N)) worst case, but for the
4418 common case of monotonically increasing enumerators, it is
4419 O(N), since the nature of the splay tree will keep the next
4420 element adjacent to the root at all times. */
4422 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4424 tree value = TREE_VALUE (chain);
4425 node = splay_tree_lookup (cases, (splay_tree_key) value);
4428 /* Mark the CASE_LOW part of the case entry as seen. */
4429 tree label = (tree) node->value;
4430 CASE_LOW_SEEN (label) = 1;
4434 /* Even though there wasn't an exact match, there might be a
4435 case range which includes the enumator's value. */
4436 node = splay_tree_predecessor (cases, (splay_tree_key) value);
4437 if (node && CASE_HIGH ((tree) node->value))
4439 tree label = (tree) node->value;
4440 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
4443 /* If we match the upper bound exactly, mark the CASE_HIGH
4444 part of the case entry as seen. */
4446 CASE_HIGH_SEEN (label) = 1;
4451 /* We've now determined that this enumerated literal isn't
4452 handled by the case labels of the switch statement. */
4454 /* If the switch expression is a constant, we only really care
4455 about whether that constant is handled by the switch. */
4456 if (cond && tree_int_cst_compare (cond, value))
4459 /* If there is a default_node, the only relevant option is
4460 Wswitch-enum. Otherwise, if both are enabled then we prefer
4461 to warn using -Wswitch because -Wswitch is enabled by -Wall
4462 while -Wswitch-enum is explicit. */
4463 warning ((default_node || !warn_switch)
4464 ? OPT_Wswitch_enum : OPT_Wswitch,
4465 "%Henumeration value %qE not handled in switch",
4466 &switch_location, TREE_PURPOSE (chain));
4469 /* Warn if there are case expressions that don't correspond to
4470 enumerators. This can occur since C and C++ don't enforce
4471 type-checking of assignments to enumeration variables.
4473 The time complexity here is now always O(N) worst case, since
4474 we should have marked both the lower bound and upper bound of
4475 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4476 above. This scan also resets those fields. */
4478 /* If there is a default_node, the only relevant option is
4479 Wswitch-enum. Otherwise, if both are enabled then we prefer
4480 to warn using -Wswitch because -Wswitch is enabled by -Wall
4481 while -Wswitch-enum is explicit. */
4482 saved_warn_switch = warn_switch;
4485 splay_tree_foreach (cases, match_case_to_enum, type);
4486 warn_switch = saved_warn_switch;
4490 /* Finish an expression taking the address of LABEL (an
4491 IDENTIFIER_NODE). Returns an expression for the address. */
4494 finish_label_address_expr (tree label)
4499 pedwarn ("taking the address of a label is non-standard");
4501 if (label == error_mark_node)
4502 return error_mark_node;
4504 label = lookup_label (label);
4505 if (label == NULL_TREE)
4506 result = null_pointer_node;
4509 TREE_USED (label) = 1;
4510 result = build1 (ADDR_EXPR, ptr_type_node, label);
4511 /* The current function in not necessarily uninlinable.
4512 Computed gotos are incompatible with inlining, but the value
4513 here could be used only in a diagnostic, for example. */
4519 /* Hook used by expand_expr to expand language-specific tree codes. */
4520 /* The only things that should go here are bits needed to expand
4521 constant initializers. Everything else should be handled by the
4522 gimplification routines. */
4525 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4526 int modifier /* Actually enum_modifier. */,
4529 switch (TREE_CODE (exp))
4531 case COMPOUND_LITERAL_EXPR:
4533 /* Initialize the anonymous variable declared in the compound
4534 literal, then return the variable. */
4535 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4536 emit_local_var (decl);
4537 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4545 /* Hook used by staticp to handle language-specific tree codes. */
4548 c_staticp (tree exp)
4550 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4551 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
4556 /* Given a boolean expression ARG, return a tree representing an increment
4557 or decrement (as indicated by CODE) of ARG. The front end must check for
4558 invalid cases (e.g., decrement in C++). */
4560 boolean_increment (enum tree_code code, tree arg)
4563 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
4565 arg = stabilize_reference (arg);
4568 case PREINCREMENT_EXPR:
4569 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4571 case POSTINCREMENT_EXPR:
4572 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4573 arg = save_expr (arg);
4574 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4575 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4577 case PREDECREMENT_EXPR:
4578 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4579 invert_truthvalue (arg));
4581 case POSTDECREMENT_EXPR:
4582 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4583 invert_truthvalue (arg));
4584 arg = save_expr (arg);
4585 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4586 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4591 TREE_SIDE_EFFECTS (val) = 1;
4595 /* Built-in macros for stddef.h, that require macros defined in this
4598 c_stddef_cpp_builtins(void)
4600 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4601 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4602 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4603 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4604 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
4605 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
4609 c_init_attributes (void)
4611 /* Fill in the built_in_attributes array. */
4612 #define DEF_ATTR_NULL_TREE(ENUM) \
4613 built_in_attributes[(int) ENUM] = NULL_TREE;
4614 #define DEF_ATTR_INT(ENUM, VALUE) \
4615 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4616 #define DEF_ATTR_IDENT(ENUM, STRING) \
4617 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4618 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4619 built_in_attributes[(int) ENUM] \
4620 = tree_cons (built_in_attributes[(int) PURPOSE], \
4621 built_in_attributes[(int) VALUE], \
4622 built_in_attributes[(int) CHAIN]);
4623 #include "builtin-attrs.def"
4624 #undef DEF_ATTR_NULL_TREE
4626 #undef DEF_ATTR_IDENT
4627 #undef DEF_ATTR_TREE_LIST
4630 /* Attribute handlers common to C front ends. */
4632 /* Handle a "packed" attribute; arguments as in
4633 struct attribute_spec.handler. */
4636 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4637 int flags, bool *no_add_attrs)
4641 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4642 *node = build_variant_type_copy (*node);
4643 TYPE_PACKED (*node) = 1;
4645 else if (TREE_CODE (*node) == FIELD_DECL)
4647 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT)
4648 warning (OPT_Wattributes,
4649 "%qE attribute ignored for field of type %qT",
4650 name, TREE_TYPE (*node));
4652 DECL_PACKED (*node) = 1;
4654 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4655 used for DECL_REGISTER. It wouldn't mean anything anyway.
4656 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4657 that changes what the typedef is typing. */
4660 warning (OPT_Wattributes, "%qE attribute ignored", name);
4661 *no_add_attrs = true;
4667 /* Handle a "nocommon" attribute; arguments as in
4668 struct attribute_spec.handler. */
4671 handle_nocommon_attribute (tree *node, tree name,
4672 tree ARG_UNUSED (args),
4673 int ARG_UNUSED (flags), bool *no_add_attrs)
4675 if (TREE_CODE (*node) == VAR_DECL)
4676 DECL_COMMON (*node) = 0;
4679 warning (OPT_Wattributes, "%qE attribute ignored", name);
4680 *no_add_attrs = true;
4686 /* Handle a "common" attribute; arguments as in
4687 struct attribute_spec.handler. */
4690 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4691 int ARG_UNUSED (flags), bool *no_add_attrs)
4693 if (TREE_CODE (*node) == VAR_DECL)
4694 DECL_COMMON (*node) = 1;
4697 warning (OPT_Wattributes, "%qE attribute ignored", name);
4698 *no_add_attrs = true;
4704 /* Handle a "noreturn" attribute; arguments as in
4705 struct attribute_spec.handler. */
4708 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4709 int ARG_UNUSED (flags), bool *no_add_attrs)
4711 tree type = TREE_TYPE (*node);
4713 /* See FIXME comment in c_common_attribute_table. */
4714 if (TREE_CODE (*node) == FUNCTION_DECL)
4715 TREE_THIS_VOLATILE (*node) = 1;
4716 else if (TREE_CODE (type) == POINTER_TYPE
4717 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4719 = build_pointer_type
4720 (build_type_variant (TREE_TYPE (type),
4721 TYPE_READONLY (TREE_TYPE (type)), 1));
4724 warning (OPT_Wattributes, "%qE attribute ignored", name);
4725 *no_add_attrs = true;
4731 /* Handle a "hot" and attribute; arguments as in
4732 struct attribute_spec.handler. */
4735 handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4736 int ARG_UNUSED (flags), bool *no_add_attrs)
4738 if (TREE_CODE (*node) == FUNCTION_DECL)
4740 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
4742 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
4744 *no_add_attrs = true;
4746 /* Do nothing else, just set the attribute. We'll get at
4747 it later with lookup_attribute. */
4751 warning (OPT_Wattributes, "%qE attribute ignored", name);
4752 *no_add_attrs = true;
4757 /* Handle a "cold" and attribute; arguments as in
4758 struct attribute_spec.handler. */
4761 handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4762 int ARG_UNUSED (flags), bool *no_add_attrs)
4764 if (TREE_CODE (*node) == FUNCTION_DECL)
4766 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
4768 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
4770 *no_add_attrs = true;
4772 /* Do nothing else, just set the attribute. We'll get at
4773 it later with lookup_attribute. */
4777 warning (OPT_Wattributes, "%qE attribute ignored", name);
4778 *no_add_attrs = true;
4784 /* Handle a "noinline" attribute; arguments as in
4785 struct attribute_spec.handler. */
4788 handle_noinline_attribute (tree *node, tree name,
4789 tree ARG_UNUSED (args),
4790 int ARG_UNUSED (flags), bool *no_add_attrs)
4792 if (TREE_CODE (*node) == FUNCTION_DECL)
4793 DECL_UNINLINABLE (*node) = 1;
4796 warning (OPT_Wattributes, "%qE attribute ignored", name);
4797 *no_add_attrs = true;
4803 /* Handle a "always_inline" attribute; arguments as in
4804 struct attribute_spec.handler. */
4807 handle_always_inline_attribute (tree *node, tree name,
4808 tree ARG_UNUSED (args),
4809 int ARG_UNUSED (flags),
4812 if (TREE_CODE (*node) == FUNCTION_DECL)
4814 /* Set the attribute and mark it for disregarding inline
4816 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
4820 warning (OPT_Wattributes, "%qE attribute ignored", name);
4821 *no_add_attrs = true;
4827 /* Handle a "gnu_inline" attribute; arguments as in
4828 struct attribute_spec.handler. */
4831 handle_gnu_inline_attribute (tree *node, tree name,
4832 tree ARG_UNUSED (args),
4833 int ARG_UNUSED (flags),
4836 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
4838 /* Do nothing else, just set the attribute. We'll get at
4839 it later with lookup_attribute. */
4843 warning (OPT_Wattributes, "%qE attribute ignored", name);
4844 *no_add_attrs = true;
4850 /* Handle an "artificial" attribute; arguments as in
4851 struct attribute_spec.handler. */
4854 handle_artificial_attribute (tree *node, tree name,
4855 tree ARG_UNUSED (args),
4856 int ARG_UNUSED (flags),
4859 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
4861 /* Do nothing else, just set the attribute. We'll get at
4862 it later with lookup_attribute. */
4866 warning (OPT_Wattributes, "%qE attribute ignored", name);
4867 *no_add_attrs = true;
4873 /* Handle a "flatten" attribute; arguments as in
4874 struct attribute_spec.handler. */
4877 handle_flatten_attribute (tree *node, tree name,
4878 tree args ATTRIBUTE_UNUSED,
4879 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4881 if (TREE_CODE (*node) == FUNCTION_DECL)
4882 /* Do nothing else, just set the attribute. We'll get at
4883 it later with lookup_attribute. */
4887 warning (OPT_Wattributes, "%qE attribute ignored", name);
4888 *no_add_attrs = true;
4894 /* Handle a "warning" or "error" attribute; arguments as in
4895 struct attribute_spec.handler. */
4898 handle_error_attribute (tree *node, tree name, tree args,
4899 int ARG_UNUSED (flags), bool *no_add_attrs)
4901 if (TREE_CODE (*node) == FUNCTION_DECL
4902 || TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4903 /* Do nothing else, just set the attribute. We'll get at
4904 it later with lookup_attribute. */
4908 warning (OPT_Wattributes, "%qE attribute ignored", name);
4909 *no_add_attrs = true;
4915 /* Handle a "used" attribute; arguments as in
4916 struct attribute_spec.handler. */
4919 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4920 int ARG_UNUSED (flags), bool *no_add_attrs)
4924 if (TREE_CODE (node) == FUNCTION_DECL
4925 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4927 TREE_USED (node) = 1;
4928 DECL_PRESERVE_P (node) = 1;
4932 warning (OPT_Wattributes, "%qE attribute ignored", name);
4933 *no_add_attrs = true;
4939 /* Handle a "unused" attribute; arguments as in
4940 struct attribute_spec.handler. */
4943 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4944 int flags, bool *no_add_attrs)
4950 if (TREE_CODE (decl) == PARM_DECL
4951 || TREE_CODE (decl) == VAR_DECL
4952 || TREE_CODE (decl) == FUNCTION_DECL
4953 || TREE_CODE (decl) == LABEL_DECL
4954 || TREE_CODE (decl) == TYPE_DECL)
4955 TREE_USED (decl) = 1;
4958 warning (OPT_Wattributes, "%qE attribute ignored", name);
4959 *no_add_attrs = true;
4964 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4965 *node = build_variant_type_copy (*node);
4966 TREE_USED (*node) = 1;
4972 /* Handle a "externally_visible" attribute; arguments as in
4973 struct attribute_spec.handler. */
4976 handle_externally_visible_attribute (tree *pnode, tree name,
4977 tree ARG_UNUSED (args),
4978 int ARG_UNUSED (flags),
4983 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
4985 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
4986 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
4988 warning (OPT_Wattributes,
4989 "%qE attribute have effect only on public objects", name);
4990 *no_add_attrs = true;
4995 warning (OPT_Wattributes, "%qE attribute ignored", name);
4996 *no_add_attrs = true;
5002 /* Handle a "const" attribute; arguments as in
5003 struct attribute_spec.handler. */
5006 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5007 int ARG_UNUSED (flags), bool *no_add_attrs)
5009 tree type = TREE_TYPE (*node);
5011 /* See FIXME comment on noreturn in c_common_attribute_table. */
5012 if (TREE_CODE (*node) == FUNCTION_DECL)
5013 TREE_READONLY (*node) = 1;
5014 else if (TREE_CODE (type) == POINTER_TYPE
5015 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5017 = build_pointer_type
5018 (build_type_variant (TREE_TYPE (type), 1,
5019 TREE_THIS_VOLATILE (TREE_TYPE (type))));
5022 warning (OPT_Wattributes, "%qE attribute ignored", name);
5023 *no_add_attrs = true;
5029 /* Handle a "transparent_union" attribute; arguments as in
5030 struct attribute_spec.handler. */
5033 handle_transparent_union_attribute (tree *node, tree name,
5034 tree ARG_UNUSED (args), int flags,
5039 *no_add_attrs = true;
5041 if (TREE_CODE (*node) == TYPE_DECL)
5042 node = &TREE_TYPE (*node);
5045 if (TREE_CODE (type) == UNION_TYPE)
5047 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
5048 the code in finish_struct. */
5049 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5051 if (TYPE_FIELDS (type) == NULL_TREE
5052 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
5055 /* A type variant isn't good enough, since we don't a cast
5056 to such a type removed as a no-op. */
5057 *node = type = build_duplicate_type (type);
5060 TYPE_TRANSPARENT_UNION (type) = 1;
5065 warning (OPT_Wattributes, "%qE attribute ignored", name);
5069 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
5070 get the requested priority for a constructor or destructor,
5071 possibly issuing diagnostics for invalid or reserved
5074 static priority_type
5075 get_priority (tree args, bool is_destructor)
5081 return DEFAULT_INIT_PRIORITY;
5083 if (!SUPPORTS_INIT_PRIORITY)
5086 error ("destructor priorities are not supported");
5088 error ("constructor priorities are not supported");
5089 return DEFAULT_INIT_PRIORITY;
5092 arg = TREE_VALUE (args);
5093 if (!host_integerp (arg, /*pos=*/0)
5094 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5097 pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0);
5098 if (pri < 0 || pri > MAX_INIT_PRIORITY)
5101 if (pri <= MAX_RESERVED_INIT_PRIORITY)
5105 "destructor priorities from 0 to %d are reserved "
5106 "for the implementation",
5107 MAX_RESERVED_INIT_PRIORITY);
5110 "constructor priorities from 0 to %d are reserved "
5111 "for the implementation",
5112 MAX_RESERVED_INIT_PRIORITY);
5118 error ("destructor priorities must be integers from 0 to %d inclusive",
5121 error ("constructor priorities must be integers from 0 to %d inclusive",
5123 return DEFAULT_INIT_PRIORITY;
5126 /* Handle a "constructor" attribute; arguments as in
5127 struct attribute_spec.handler. */
5130 handle_constructor_attribute (tree *node, tree name, tree args,
5131 int ARG_UNUSED (flags),
5135 tree type = TREE_TYPE (decl);
5137 if (TREE_CODE (decl) == FUNCTION_DECL
5138 && TREE_CODE (type) == FUNCTION_TYPE
5139 && decl_function_context (decl) == 0)
5141 priority_type priority;
5142 DECL_STATIC_CONSTRUCTOR (decl) = 1;
5143 priority = get_priority (args, /*is_destructor=*/false);
5144 SET_DECL_INIT_PRIORITY (decl, priority);
5145 TREE_USED (decl) = 1;
5149 warning (OPT_Wattributes, "%qE attribute ignored", name);
5150 *no_add_attrs = true;
5156 /* Handle a "destructor" attribute; arguments as in
5157 struct attribute_spec.handler. */
5160 handle_destructor_attribute (tree *node, tree name, tree args,
5161 int ARG_UNUSED (flags),
5165 tree type = TREE_TYPE (decl);
5167 if (TREE_CODE (decl) == FUNCTION_DECL
5168 && TREE_CODE (type) == FUNCTION_TYPE
5169 && decl_function_context (decl) == 0)
5171 priority_type priority;
5172 DECL_STATIC_DESTRUCTOR (decl) = 1;
5173 priority = get_priority (args, /*is_destructor=*/true);
5174 SET_DECL_FINI_PRIORITY (decl, priority);
5175 TREE_USED (decl) = 1;
5179 warning (OPT_Wattributes, "%qE attribute ignored", name);
5180 *no_add_attrs = true;
5186 /* Handle a "mode" attribute; arguments as in
5187 struct attribute_spec.handler. */
5190 handle_mode_attribute (tree *node, tree name, tree args,
5191 int ARG_UNUSED (flags), bool *no_add_attrs)
5195 *no_add_attrs = true;
5197 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
5198 warning (OPT_Wattributes, "%qE attribute ignored", name);
5202 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
5203 int len = strlen (p);
5204 enum machine_mode mode = VOIDmode;
5208 if (len > 4 && p[0] == '_' && p[1] == '_'
5209 && p[len - 1] == '_' && p[len - 2] == '_')
5211 char *newp = (char *) alloca (len - 1);
5213 strcpy (newp, &p[2]);
5214 newp[len - 4] = '\0';
5218 /* Change this type to have a type with the specified mode.
5219 First check for the special modes. */
5220 if (!strcmp (p, "byte"))
5222 else if (!strcmp (p, "word"))
5224 else if (!strcmp (p, "pointer"))
5226 else if (!strcmp (p, "libgcc_cmp_return"))
5227 mode = targetm.libgcc_cmp_return_mode ();
5228 else if (!strcmp (p, "libgcc_shift_count"))
5229 mode = targetm.libgcc_shift_count_mode ();
5231 for (j = 0; j < NUM_MACHINE_MODES; j++)
5232 if (!strcmp (p, GET_MODE_NAME (j)))
5234 mode = (enum machine_mode) j;
5238 if (mode == VOIDmode)
5240 error ("unknown machine mode %qs", p);
5245 switch (GET_MODE_CLASS (mode))
5248 case MODE_PARTIAL_INT:
5250 case MODE_DECIMAL_FLOAT:
5255 valid_mode = targetm.scalar_mode_supported_p (mode);
5258 case MODE_COMPLEX_INT:
5259 case MODE_COMPLEX_FLOAT:
5260 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
5263 case MODE_VECTOR_INT:
5264 case MODE_VECTOR_FLOAT:
5265 case MODE_VECTOR_FRACT:
5266 case MODE_VECTOR_UFRACT:
5267 case MODE_VECTOR_ACCUM:
5268 case MODE_VECTOR_UACCUM:
5269 warning (OPT_Wattributes, "specifying vector types with "
5270 "__attribute__ ((mode)) is deprecated");
5271 warning (OPT_Wattributes,
5272 "use __attribute__ ((vector_size)) instead");
5273 valid_mode = vector_mode_valid_p (mode);
5281 error ("unable to emulate %qs", p);
5285 if (POINTER_TYPE_P (type))
5287 tree (*fn)(tree, enum machine_mode, bool);
5289 if (!targetm.valid_pointer_mode (mode))
5291 error ("invalid pointer mode %qs", p);
5295 if (TREE_CODE (type) == POINTER_TYPE)
5296 fn = build_pointer_type_for_mode;
5298 fn = build_reference_type_for_mode;
5299 typefm = fn (TREE_TYPE (type), mode, false);
5303 /* For fixed-point modes, we need to test if the signness of type
5304 and the machine mode are consistent. */
5305 if (ALL_FIXED_POINT_MODE_P (mode)
5306 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
5308 error ("signness of type and machine mode %qs don't match", p);
5311 /* For fixed-point modes, we need to pass saturating info. */
5312 typefm = lang_hooks.types.type_for_mode (mode,
5313 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
5314 : TYPE_UNSIGNED (type));
5317 if (typefm == NULL_TREE)
5319 error ("no data type for mode %qs", p);
5322 else if (TREE_CODE (type) == ENUMERAL_TYPE)
5324 /* For enumeral types, copy the precision from the integer
5325 type returned above. If not an INTEGER_TYPE, we can't use
5326 this mode for this type. */
5327 if (TREE_CODE (typefm) != INTEGER_TYPE)
5329 error ("cannot use mode %qs for enumeral types", p);
5333 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
5335 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
5340 /* We cannot build a type variant, as there's code that assumes
5341 that TYPE_MAIN_VARIANT has the same mode. This includes the
5342 debug generators. Instead, create a subrange type. This
5343 results in all of the enumeral values being emitted only once
5344 in the original, and the subtype gets them by reference. */
5345 if (TYPE_UNSIGNED (type))
5346 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
5348 typefm = make_signed_type (TYPE_PRECISION (typefm));
5349 TREE_TYPE (typefm) = type;
5352 else if (VECTOR_MODE_P (mode)
5353 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
5354 : TREE_CODE (type) != TREE_CODE (typefm))
5356 error ("mode %qs applied to inappropriate type", p);
5366 /* Handle a "section" attribute; arguments as in
5367 struct attribute_spec.handler. */
5370 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5371 int ARG_UNUSED (flags), bool *no_add_attrs)
5375 if (targetm.have_named_sections)
5377 user_defined_section_attribute = true;
5379 if ((TREE_CODE (decl) == FUNCTION_DECL
5380 || TREE_CODE (decl) == VAR_DECL)
5381 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
5383 if (TREE_CODE (decl) == VAR_DECL
5384 && current_function_decl != NULL_TREE
5385 && !TREE_STATIC (decl))
5387 error ("%Jsection attribute cannot be specified for "
5388 "local variables", decl);
5389 *no_add_attrs = true;
5392 /* The decl may have already been given a section attribute
5393 from a previous declaration. Ensure they match. */
5394 else if (DECL_SECTION_NAME (decl) != NULL_TREE
5395 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
5396 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
5398 error ("section of %q+D conflicts with previous declaration",
5400 *no_add_attrs = true;
5403 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
5407 error ("section attribute not allowed for %q+D", *node);
5408 *no_add_attrs = true;
5413 error ("%Jsection attributes are not supported for this target", *node);
5414 *no_add_attrs = true;
5420 /* Handle a "aligned" attribute; arguments as in
5421 struct attribute_spec.handler. */
5424 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5425 int flags, bool *no_add_attrs)
5427 tree decl = NULL_TREE;
5430 tree align_expr = (args ? TREE_VALUE (args)
5431 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5437 type = &TREE_TYPE (decl);
5438 is_type = TREE_CODE (*node) == TYPE_DECL;
5440 else if (TYPE_P (*node))
5441 type = node, is_type = 1;
5443 if (TREE_CODE (align_expr) != INTEGER_CST)
5445 error ("requested alignment is not a constant");
5446 *no_add_attrs = true;
5448 else if ((i = tree_log2 (align_expr)) == -1)
5450 error ("requested alignment is not a power of 2");
5451 *no_add_attrs = true;
5453 else if (i > HOST_BITS_PER_INT - 2)
5455 error ("requested alignment is too large");
5456 *no_add_attrs = true;
5460 /* If we have a TYPE_DECL, then copy the type, so that we
5461 don't accidentally modify a builtin type. See pushdecl. */
5462 if (decl && TREE_TYPE (decl) != error_mark_node
5463 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5465 tree tt = TREE_TYPE (decl);
5466 *type = build_variant_type_copy (*type);
5467 DECL_ORIGINAL_TYPE (decl) = tt;
5468 TYPE_NAME (*type) = decl;
5469 TREE_USED (*type) = TREE_USED (decl);
5470 TREE_TYPE (decl) = *type;
5472 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5473 *type = build_variant_type_copy (*type);
5475 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5476 TYPE_USER_ALIGN (*type) = 1;
5478 else if (! VAR_OR_FUNCTION_DECL_P (decl)
5479 && TREE_CODE (decl) != FIELD_DECL)
5481 error ("alignment may not be specified for %q+D", decl);
5482 *no_add_attrs = true;
5484 else if (TREE_CODE (decl) == FUNCTION_DECL
5485 && DECL_ALIGN (decl) > (1 << i) * BITS_PER_UNIT)
5487 if (DECL_USER_ALIGN (decl))
5488 error ("alignment for %q+D was previously specified as %d "
5489 "and may not be decreased", decl,
5490 DECL_ALIGN (decl) / BITS_PER_UNIT);
5492 error ("alignment for %q+D must be at least %d", decl,
5493 DECL_ALIGN (decl) / BITS_PER_UNIT);
5494 *no_add_attrs = true;
5498 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5499 DECL_USER_ALIGN (decl) = 1;
5505 /* Handle a "weak" attribute; arguments as in
5506 struct attribute_spec.handler. */
5509 handle_weak_attribute (tree *node, tree name,
5510 tree ARG_UNUSED (args),
5511 int ARG_UNUSED (flags),
5512 bool * ARG_UNUSED (no_add_attrs))
5514 if (TREE_CODE (*node) == FUNCTION_DECL
5515 || TREE_CODE (*node) == VAR_DECL)
5516 declare_weak (*node);
5518 warning (OPT_Wattributes, "%qE attribute ignored", name);
5524 /* Handle an "alias" attribute; arguments as in
5525 struct attribute_spec.handler. */
5528 handle_alias_attribute (tree *node, tree name, tree args,
5529 int ARG_UNUSED (flags), bool *no_add_attrs)
5533 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5534 || (TREE_CODE (decl) != FUNCTION_DECL
5535 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
5536 /* A static variable declaration is always a tentative definition,
5537 but the alias is a non-tentative definition which overrides. */
5538 || (TREE_CODE (decl) != FUNCTION_DECL
5539 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
5541 error ("%q+D defined both normally and as an alias", decl);
5542 *no_add_attrs = true;
5545 /* Note that the very first time we process a nested declaration,
5546 decl_function_context will not be set. Indeed, *would* never
5547 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
5548 we do below. After such frobbery, pushdecl would set the context.
5549 In any case, this is never what we want. */
5550 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
5554 id = TREE_VALUE (args);
5555 if (TREE_CODE (id) != STRING_CST)
5557 error ("alias argument not a string");
5558 *no_add_attrs = true;
5561 id = get_identifier (TREE_STRING_POINTER (id));
5562 /* This counts as a use of the object pointed to. */
5565 if (TREE_CODE (decl) == FUNCTION_DECL)
5566 DECL_INITIAL (decl) = error_mark_node;
5569 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5570 DECL_EXTERNAL (decl) = 1;
5572 DECL_EXTERNAL (decl) = 0;
5573 TREE_STATIC (decl) = 1;
5578 warning (OPT_Wattributes, "%qE attribute ignored", name);
5579 *no_add_attrs = true;
5585 /* Handle a "weakref" attribute; arguments as in struct
5586 attribute_spec.handler. */
5589 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5590 int flags, bool *no_add_attrs)
5592 tree attr = NULL_TREE;
5594 /* We must ignore the attribute when it is associated with
5595 local-scoped decls, since attribute alias is ignored and many
5596 such symbols do not even have a DECL_WEAK field. */
5597 if (decl_function_context (*node) || current_function_decl)
5599 warning (OPT_Wattributes, "%qE attribute ignored", name);
5600 *no_add_attrs = true;
5604 /* The idea here is that `weakref("name")' mutates into `weakref,
5605 alias("name")', and weakref without arguments, in turn,
5606 implicitly adds weak. */
5610 attr = tree_cons (get_identifier ("alias"), args, attr);
5611 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
5613 *no_add_attrs = true;
5615 decl_attributes (node, attr, flags);
5619 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
5620 error ("%Jweakref attribute must appear before alias attribute",
5623 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5624 and that isn't supported; and because it wants to add it to
5625 the list of weak decls, which isn't helpful. */
5626 DECL_WEAK (*node) = 1;
5632 /* Handle an "visibility" attribute; arguments as in
5633 struct attribute_spec.handler. */
5636 handle_visibility_attribute (tree *node, tree name, tree args,
5637 int ARG_UNUSED (flags),
5638 bool *ARG_UNUSED (no_add_attrs))
5641 tree id = TREE_VALUE (args);
5642 enum symbol_visibility vis;
5646 if (TREE_CODE (*node) == ENUMERAL_TYPE)
5648 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
5650 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
5654 else if (TYPE_FIELDS (*node))
5656 error ("%qE attribute ignored because %qT is already defined",
5661 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
5663 warning (OPT_Wattributes, "%qE attribute ignored", name);
5667 if (TREE_CODE (id) != STRING_CST)
5669 error ("visibility argument not a string");
5673 /* If this is a type, set the visibility on the type decl. */
5676 decl = TYPE_NAME (decl);
5679 if (TREE_CODE (decl) == IDENTIFIER_NODE)
5681 warning (OPT_Wattributes, "%qE attribute ignored on types",
5687 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5688 vis = VISIBILITY_DEFAULT;
5689 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5690 vis = VISIBILITY_INTERNAL;
5691 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5692 vis = VISIBILITY_HIDDEN;
5693 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5694 vis = VISIBILITY_PROTECTED;
5697 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5698 vis = VISIBILITY_DEFAULT;
5701 if (DECL_VISIBILITY_SPECIFIED (decl)
5702 && vis != DECL_VISIBILITY (decl))
5704 tree attributes = (TYPE_P (*node)
5705 ? TYPE_ATTRIBUTES (*node)
5706 : DECL_ATTRIBUTES (decl));
5707 if (lookup_attribute ("visibility", attributes))
5708 error ("%qD redeclared with different visibility", decl);
5709 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5710 && lookup_attribute ("dllimport", attributes))
5711 error ("%qD was declared %qs which implies default visibility",
5713 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5714 && lookup_attribute ("dllexport", attributes))
5715 error ("%qD was declared %qs which implies default visibility",
5719 DECL_VISIBILITY (decl) = vis;
5720 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5722 /* Go ahead and attach the attribute to the node as well. This is needed
5723 so we can determine whether we have VISIBILITY_DEFAULT because the
5724 visibility was not specified, or because it was explicitly overridden
5725 from the containing scope. */
5730 /* Determine the ELF symbol visibility for DECL, which is either a
5731 variable or a function. It is an error to use this function if a
5732 definition of DECL is not available in this translation unit.
5733 Returns true if the final visibility has been determined by this
5734 function; false if the caller is free to make additional
5738 c_determine_visibility (tree decl)
5740 gcc_assert (TREE_CODE (decl) == VAR_DECL
5741 || TREE_CODE (decl) == FUNCTION_DECL);
5743 /* If the user explicitly specified the visibility with an
5744 attribute, honor that. DECL_VISIBILITY will have been set during
5745 the processing of the attribute. We check for an explicit
5746 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5747 to distinguish the use of an attribute from the use of a "#pragma
5748 GCC visibility push(...)"; in the latter case we still want other
5749 considerations to be able to overrule the #pragma. */
5750 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
5751 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5752 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
5753 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
5756 /* Set default visibility to whatever the user supplied with
5757 visibility_specified depending on #pragma GCC visibility. */
5758 if (!DECL_VISIBILITY_SPECIFIED (decl))
5760 DECL_VISIBILITY (decl) = default_visibility;
5761 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
5766 /* Handle an "tls_model" attribute; arguments as in
5767 struct attribute_spec.handler. */
5770 handle_tls_model_attribute (tree *node, tree name, tree args,
5771 int ARG_UNUSED (flags), bool *no_add_attrs)
5775 enum tls_model kind;
5777 *no_add_attrs = true;
5779 if (!DECL_THREAD_LOCAL_P (decl))
5781 warning (OPT_Wattributes, "%qE attribute ignored", name);
5785 kind = DECL_TLS_MODEL (decl);
5786 id = TREE_VALUE (args);
5787 if (TREE_CODE (id) != STRING_CST)
5789 error ("tls_model argument not a string");
5793 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
5794 kind = TLS_MODEL_LOCAL_EXEC;
5795 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
5796 kind = TLS_MODEL_INITIAL_EXEC;
5797 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
5798 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
5799 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5800 kind = TLS_MODEL_GLOBAL_DYNAMIC;
5802 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5804 DECL_TLS_MODEL (decl) = kind;
5808 /* Handle a "no_instrument_function" attribute; arguments as in
5809 struct attribute_spec.handler. */
5812 handle_no_instrument_function_attribute (tree *node, tree name,
5813 tree ARG_UNUSED (args),
5814 int ARG_UNUSED (flags),
5819 if (TREE_CODE (decl) != FUNCTION_DECL)
5821 error ("%J%qE attribute applies only to functions", decl, name);
5822 *no_add_attrs = true;
5824 else if (DECL_INITIAL (decl))
5826 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5827 *no_add_attrs = true;
5830 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5835 /* Handle a "malloc" attribute; arguments as in
5836 struct attribute_spec.handler. */
5839 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5840 int ARG_UNUSED (flags), bool *no_add_attrs)
5842 if (TREE_CODE (*node) == FUNCTION_DECL
5843 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
5844 DECL_IS_MALLOC (*node) = 1;
5847 warning (OPT_Wattributes, "%qE attribute ignored", name);
5848 *no_add_attrs = true;
5854 /* Handle a "alloc_size" attribute; arguments as in
5855 struct attribute_spec.handler. */
5858 handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5859 int ARG_UNUSED (flags), bool *no_add_attrs)
5861 tree params = TYPE_ARG_TYPES (*node);
5862 unsigned arg_count = 0;
5864 for (; TREE_CHAIN (params); params = TREE_CHAIN (params))
5867 for (; args; args = TREE_CHAIN (args))
5869 tree position = TREE_VALUE (args);
5871 if (TREE_CODE (position) != INTEGER_CST
5872 || TREE_INT_CST_HIGH (position)
5873 || TREE_INT_CST_LOW (position) < 1
5874 || TREE_INT_CST_LOW (position) > arg_count )
5876 warning (OPT_Wattributes,
5877 "alloc_size parameter outside range");
5878 *no_add_attrs = true;
5885 /* Handle a "returns_twice" attribute; arguments as in
5886 struct attribute_spec.handler. */
5889 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5890 int ARG_UNUSED (flags), bool *no_add_attrs)
5892 if (TREE_CODE (*node) == FUNCTION_DECL)
5893 DECL_IS_RETURNS_TWICE (*node) = 1;
5896 warning (OPT_Wattributes, "%qE attribute ignored", name);
5897 *no_add_attrs = true;
5903 /* Handle a "no_limit_stack" attribute; arguments as in
5904 struct attribute_spec.handler. */
5907 handle_no_limit_stack_attribute (tree *node, tree name,
5908 tree ARG_UNUSED (args),
5909 int ARG_UNUSED (flags),
5914 if (TREE_CODE (decl) != FUNCTION_DECL)
5916 error ("%J%qE attribute applies only to functions", decl, name);
5917 *no_add_attrs = true;
5919 else if (DECL_INITIAL (decl))
5921 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5922 *no_add_attrs = true;
5925 DECL_NO_LIMIT_STACK (decl) = 1;
5930 /* Handle a "pure" attribute; arguments as in
5931 struct attribute_spec.handler. */
5934 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5935 int ARG_UNUSED (flags), bool *no_add_attrs)
5937 if (TREE_CODE (*node) == FUNCTION_DECL)
5938 DECL_IS_PURE (*node) = 1;
5939 /* ??? TODO: Support types. */
5942 warning (OPT_Wattributes, "%qE attribute ignored", name);
5943 *no_add_attrs = true;
5949 /* Handle a "no vops" attribute; arguments as in
5950 struct attribute_spec.handler. */
5953 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
5954 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
5955 bool *ARG_UNUSED (no_add_attrs))
5957 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
5958 DECL_IS_NOVOPS (*node) = 1;
5962 /* Handle a "deprecated" attribute; arguments as in
5963 struct attribute_spec.handler. */
5966 handle_deprecated_attribute (tree *node, tree name,
5967 tree ARG_UNUSED (args), int flags,
5970 tree type = NULL_TREE;
5972 tree what = NULL_TREE;
5977 type = TREE_TYPE (decl);
5979 if (TREE_CODE (decl) == TYPE_DECL
5980 || TREE_CODE (decl) == PARM_DECL
5981 || TREE_CODE (decl) == VAR_DECL
5982 || TREE_CODE (decl) == FUNCTION_DECL
5983 || TREE_CODE (decl) == FIELD_DECL)
5984 TREE_DEPRECATED (decl) = 1;
5988 else if (TYPE_P (*node))
5990 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5991 *node = build_variant_type_copy (*node);
5992 TREE_DEPRECATED (*node) = 1;
6000 *no_add_attrs = true;
6001 if (type && TYPE_NAME (type))
6003 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
6004 what = TYPE_NAME (*node);
6005 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
6006 && DECL_NAME (TYPE_NAME (type)))
6007 what = DECL_NAME (TYPE_NAME (type));
6010 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
6012 warning (OPT_Wattributes, "%qE attribute ignored", name);
6018 /* Handle a "vector_size" attribute; arguments as in
6019 struct attribute_spec.handler. */
6022 handle_vector_size_attribute (tree *node, tree name, tree args,
6023 int ARG_UNUSED (flags),
6026 unsigned HOST_WIDE_INT vecsize, nunits;
6027 enum machine_mode orig_mode;
6028 tree type = *node, new_type, size;
6030 *no_add_attrs = true;
6032 size = TREE_VALUE (args);
6034 if (!host_integerp (size, 1))
6036 warning (OPT_Wattributes, "%qE attribute ignored", name);
6040 /* Get the vector size (in bytes). */
6041 vecsize = tree_low_cst (size, 1);
6043 /* We need to provide for vector pointers, vector arrays, and
6044 functions returning vectors. For example:
6046 __attribute__((vector_size(16))) short *foo;
6048 In this case, the mode is SI, but the type being modified is
6049 HI, so we need to look further. */
6051 while (POINTER_TYPE_P (type)
6052 || TREE_CODE (type) == FUNCTION_TYPE
6053 || TREE_CODE (type) == METHOD_TYPE
6054 || TREE_CODE (type) == ARRAY_TYPE
6055 || TREE_CODE (type) == OFFSET_TYPE)
6056 type = TREE_TYPE (type);
6058 /* Get the mode of the type being modified. */
6059 orig_mode = TYPE_MODE (type);
6061 if ((!INTEGRAL_TYPE_P (type)
6062 && !SCALAR_FLOAT_TYPE_P (type)
6063 && !FIXED_POINT_TYPE_P (type))
6064 || (!SCALAR_FLOAT_MODE_P (orig_mode)
6065 && GET_MODE_CLASS (orig_mode) != MODE_INT
6066 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
6067 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
6069 error ("invalid vector type for attribute %qE", name);
6073 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
6075 error ("vector size not an integral multiple of component size");
6081 error ("zero vector size");
6085 /* Calculate how many units fit in the vector. */
6086 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
6087 if (nunits & (nunits - 1))
6089 error ("number of components of the vector not a power of two");
6093 new_type = build_vector_type (type, nunits);
6095 /* Build back pointers if needed. */
6096 *node = reconstruct_complex_type (*node, new_type);
6101 /* Handle the "nonnull" attribute. */
6103 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
6104 tree args, int ARG_UNUSED (flags),
6108 unsigned HOST_WIDE_INT attr_arg_num;
6110 /* If no arguments are specified, all pointer arguments should be
6111 non-null. Verify a full prototype is given so that the arguments
6112 will have the correct types when we actually check them later. */
6115 if (!TYPE_ARG_TYPES (type))
6117 error ("nonnull attribute without arguments on a non-prototype");
6118 *no_add_attrs = true;
6123 /* Argument list specified. Verify that each argument number references
6124 a pointer argument. */
6125 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
6128 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
6130 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
6132 error ("nonnull argument has invalid operand number (argument %lu)",
6133 (unsigned long) attr_arg_num);
6134 *no_add_attrs = true;
6138 argument = TYPE_ARG_TYPES (type);
6141 for (ck_num = 1; ; ck_num++)
6143 if (!argument || ck_num == arg_num)
6145 argument = TREE_CHAIN (argument);
6149 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
6151 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
6152 (unsigned long) attr_arg_num, (unsigned long) arg_num);
6153 *no_add_attrs = true;
6157 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
6159 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
6160 (unsigned long) attr_arg_num, (unsigned long) arg_num);
6161 *no_add_attrs = true;
6170 /* Check the argument list of a function call for null in argument slots
6171 that are marked as requiring a non-null pointer argument. The NARGS
6172 arguments are passed in the array ARGARRAY.
6176 check_function_nonnull (tree attrs, int nargs, tree *argarray)
6181 for (a = attrs; a; a = TREE_CHAIN (a))
6183 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
6185 args = TREE_VALUE (a);
6187 /* Walk the argument list. If we encounter an argument number we
6188 should check for non-null, do it. If the attribute has no args,
6189 then every pointer argument is checked (in which case the check
6190 for pointer type is done in check_nonnull_arg). */
6191 for (i = 0; i < nargs; i++)
6193 if (!args || nonnull_check_p (args, i + 1))
6194 check_function_arguments_recurse (check_nonnull_arg, NULL,
6202 /* Check that the Nth argument of a function call (counting backwards
6203 from the end) is a (pointer)0. The NARGS arguments are passed in the
6207 check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist)
6209 tree attr = lookup_attribute ("sentinel", attrs);
6217 /* Skip over the named arguments. */
6218 while (typelist && len < nargs)
6220 typelist = TREE_CHAIN (typelist);
6224 if (TREE_VALUE (attr))
6226 tree p = TREE_VALUE (TREE_VALUE (attr));
6227 pos = TREE_INT_CST_LOW (p);
6230 /* The sentinel must be one of the varargs, i.e.
6231 in position >= the number of fixed arguments. */
6232 if ((nargs - 1 - pos) < len)
6234 warning (OPT_Wformat,
6235 "not enough variable arguments to fit a sentinel");
6239 /* Validate the sentinel. */
6240 sentinel = argarray[nargs - 1 - pos];
6241 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
6242 || !integer_zerop (sentinel))
6243 /* Although __null (in C++) is only an integer we allow it
6244 nevertheless, as we are guaranteed that it's exactly
6245 as wide as a pointer, and we don't want to force
6246 users to cast the NULL they have written there.
6247 We warn with -Wstrict-null-sentinel, though. */
6248 && (warn_strict_null_sentinel || null_node != sentinel))
6249 warning (OPT_Wformat, "missing sentinel in function call");
6253 /* Helper for check_function_nonnull; given a list of operands which
6254 must be non-null in ARGS, determine if operand PARAM_NUM should be
6258 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
6260 unsigned HOST_WIDE_INT arg_num = 0;
6262 for (; args; args = TREE_CHAIN (args))
6264 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
6268 if (arg_num == param_num)
6274 /* Check that the function argument PARAM (which is operand number
6275 PARAM_NUM) is non-null. This is called by check_function_nonnull
6276 via check_function_arguments_recurse. */
6279 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
6280 unsigned HOST_WIDE_INT param_num)
6282 /* Just skip checking the argument if it's not a pointer. This can
6283 happen if the "nonnull" attribute was given without an operand
6284 list (which means to check every pointer argument). */
6286 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
6289 if (integer_zerop (param))
6290 warning (OPT_Wnonnull, "null argument where non-null required "
6291 "(argument %lu)", (unsigned long) param_num);
6294 /* Helper for nonnull attribute handling; fetch the operand number
6295 from the attribute argument list. */
6298 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
6300 /* Verify the arg number is a constant. */
6301 if (TREE_CODE (arg_num_expr) != INTEGER_CST
6302 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
6305 *valp = TREE_INT_CST_LOW (arg_num_expr);
6309 /* Handle a "nothrow" attribute; arguments as in
6310 struct attribute_spec.handler. */
6313 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6314 int ARG_UNUSED (flags), bool *no_add_attrs)
6316 if (TREE_CODE (*node) == FUNCTION_DECL)
6317 TREE_NOTHROW (*node) = 1;
6318 /* ??? TODO: Support types. */
6321 warning (OPT_Wattributes, "%qE attribute ignored", name);
6322 *no_add_attrs = true;
6328 /* Handle a "cleanup" attribute; arguments as in
6329 struct attribute_spec.handler. */
6332 handle_cleanup_attribute (tree *node, tree name, tree args,
6333 int ARG_UNUSED (flags), bool *no_add_attrs)
6336 tree cleanup_id, cleanup_decl;
6338 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6339 for global destructors in C++. This requires infrastructure that
6340 we don't have generically at the moment. It's also not a feature
6341 we'd be missing too much, since we do have attribute constructor. */
6342 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
6344 warning (OPT_Wattributes, "%qE attribute ignored", name);
6345 *no_add_attrs = true;
6349 /* Verify that the argument is a function in scope. */
6350 /* ??? We could support pointers to functions here as well, if
6351 that was considered desirable. */
6352 cleanup_id = TREE_VALUE (args);
6353 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
6355 error ("cleanup argument not an identifier");
6356 *no_add_attrs = true;
6359 cleanup_decl = lookup_name (cleanup_id);
6360 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
6362 error ("cleanup argument not a function");
6363 *no_add_attrs = true;
6367 /* That the function has proper type is checked with the
6368 eventual call to build_function_call. */
6373 /* Handle a "warn_unused_result" attribute. No special handling. */
6376 handle_warn_unused_result_attribute (tree *node, tree name,
6377 tree ARG_UNUSED (args),
6378 int ARG_UNUSED (flags), bool *no_add_attrs)
6380 /* Ignore the attribute for functions not returning any value. */
6381 if (VOID_TYPE_P (TREE_TYPE (*node)))
6383 warning (OPT_Wattributes, "%qE attribute ignored", name);
6384 *no_add_attrs = true;
6390 /* Handle a "sentinel" attribute. */
6393 handle_sentinel_attribute (tree *node, tree name, tree args,
6394 int ARG_UNUSED (flags), bool *no_add_attrs)
6396 tree params = TYPE_ARG_TYPES (*node);
6400 warning (OPT_Wattributes,
6401 "%qE attribute requires prototypes with named arguments", name);
6402 *no_add_attrs = true;
6406 while (TREE_CHAIN (params))
6407 params = TREE_CHAIN (params);
6409 if (VOID_TYPE_P (TREE_VALUE (params)))
6411 warning (OPT_Wattributes,
6412 "%qE attribute only applies to variadic functions", name);
6413 *no_add_attrs = true;
6419 tree position = TREE_VALUE (args);
6421 if (TREE_CODE (position) != INTEGER_CST)
6423 warning (OPT_Wattributes,
6424 "requested position is not an integer constant");
6425 *no_add_attrs = true;
6429 if (tree_int_cst_lt (position, integer_zero_node))
6431 warning (OPT_Wattributes,
6432 "requested position is less than zero");
6433 *no_add_attrs = true;
6441 /* Handle a "type_generic" attribute. */
6444 handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
6445 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
6446 bool * ARG_UNUSED (no_add_attrs))
6448 /* Ensure we have a function type, with no arguments. */
6449 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE && ! TYPE_ARG_TYPES (*node));
6454 /* Check for valid arguments being passed to a function.
6455 ATTRS is a list of attributes. There are NARGS arguments in the array
6456 ARGARRAY. TYPELIST is the list of argument types for the function.
6459 check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist)
6461 /* Check for null being passed in a pointer argument that must be
6462 non-null. We also need to do this if format checking is enabled. */
6465 check_function_nonnull (attrs, nargs, argarray);
6467 /* Check for errors in format strings. */
6469 if (warn_format || warn_missing_format_attribute)
6470 check_function_format (attrs, nargs, argarray);
6473 check_function_sentinel (attrs, nargs, argarray, typelist);
6476 /* Generic argument checking recursion routine. PARAM is the argument to
6477 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6478 once the argument is resolved. CTX is context for the callback. */
6480 check_function_arguments_recurse (void (*callback)
6481 (void *, tree, unsigned HOST_WIDE_INT),
6482 void *ctx, tree param,
6483 unsigned HOST_WIDE_INT param_num)
6485 if ((TREE_CODE (param) == NOP_EXPR || TREE_CODE (param) == CONVERT_EXPR)
6486 && (TYPE_PRECISION (TREE_TYPE (param))
6487 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
6489 /* Strip coercion. */
6490 check_function_arguments_recurse (callback, ctx,
6491 TREE_OPERAND (param, 0), param_num);
6495 if (TREE_CODE (param) == CALL_EXPR)
6497 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
6499 bool found_format_arg = false;
6501 /* See if this is a call to a known internationalization function
6502 that modifies a format arg. Such a function may have multiple
6503 format_arg attributes (for example, ngettext). */
6505 for (attrs = TYPE_ATTRIBUTES (type);
6507 attrs = TREE_CHAIN (attrs))
6508 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
6511 tree format_num_expr;
6514 call_expr_arg_iterator iter;
6516 /* Extract the argument number, which was previously checked
6518 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
6520 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
6521 && !TREE_INT_CST_HIGH (format_num_expr));
6523 format_num = TREE_INT_CST_LOW (format_num_expr);
6525 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
6527 inner_arg = next_call_expr_arg (&iter), i++)
6528 if (i == format_num)
6530 check_function_arguments_recurse (callback, ctx,
6531 inner_arg, param_num);
6532 found_format_arg = true;
6537 /* If we found a format_arg attribute and did a recursive check,
6538 we are done with checking this argument. Otherwise, we continue
6539 and this will be considered a non-literal. */
6540 if (found_format_arg)
6544 if (TREE_CODE (param) == COND_EXPR)
6546 /* Check both halves of the conditional expression. */
6547 check_function_arguments_recurse (callback, ctx,
6548 TREE_OPERAND (param, 1), param_num);
6549 check_function_arguments_recurse (callback, ctx,
6550 TREE_OPERAND (param, 2), param_num);
6554 (*callback) (ctx, param, param_num);
6557 /* Function to help qsort sort FIELD_DECLs by name order. */
6560 field_decl_cmp (const void *x_p, const void *y_p)
6562 const tree *const x = (const tree *const) x_p;
6563 const tree *const y = (const tree *const) y_p;
6565 if (DECL_NAME (*x) == DECL_NAME (*y))
6566 /* A nontype is "greater" than a type. */
6567 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
6568 if (DECL_NAME (*x) == NULL_TREE)
6570 if (DECL_NAME (*y) == NULL_TREE)
6572 if (DECL_NAME (*x) < DECL_NAME (*y))
6578 gt_pointer_operator new_value;
6582 /* This routine compares two fields like field_decl_cmp but using the
6583 pointer operator in resort_data. */
6586 resort_field_decl_cmp (const void *x_p, const void *y_p)
6588 const tree *const x = (const tree *const) x_p;
6589 const tree *const y = (const tree *const) y_p;
6591 if (DECL_NAME (*x) == DECL_NAME (*y))
6592 /* A nontype is "greater" than a type. */
6593 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
6594 if (DECL_NAME (*x) == NULL_TREE)
6596 if (DECL_NAME (*y) == NULL_TREE)
6599 tree d1 = DECL_NAME (*x);
6600 tree d2 = DECL_NAME (*y);
6601 resort_data.new_value (&d1, resort_data.cookie);
6602 resort_data.new_value (&d2, resort_data.cookie);
6609 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6612 resort_sorted_fields (void *obj,
6613 void * ARG_UNUSED (orig_obj),
6614 gt_pointer_operator new_value,
6617 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
6618 resort_data.new_value = new_value;
6619 resort_data.cookie = cookie;
6620 qsort (&sf->elts[0], sf->len, sizeof (tree),
6621 resort_field_decl_cmp);
6624 /* Subroutine of c_parse_error.
6625 Return the result of concatenating LHS and RHS. RHS is really
6626 a string literal, its first character is indicated by RHS_START and
6627 RHS_SIZE is its length (including the terminating NUL character).
6629 The caller is responsible for deleting the returned pointer. */
6632 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
6634 const int lhs_size = strlen (lhs);
6635 char *result = XNEWVEC (char, lhs_size + rhs_size);
6636 strncpy (result, lhs, lhs_size);
6637 strncpy (result + lhs_size, rhs_start, rhs_size);
6641 /* Issue the error given by GMSGID, indicating that it occurred before
6642 TOKEN, which had the associated VALUE. */
6645 c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value)
6647 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6649 char *message = NULL;
6651 if (token == CPP_EOF)
6652 message = catenate_messages (gmsgid, " at end of input");
6653 else if (token == CPP_CHAR || token == CPP_WCHAR)
6655 unsigned int val = TREE_INT_CST_LOW (value);
6656 const char *const ell = (token == CPP_CHAR) ? "" : "L";
6657 if (val <= UCHAR_MAX && ISGRAPH (val))
6658 message = catenate_messages (gmsgid, " before %s'%c'");
6660 message = catenate_messages (gmsgid, " before %s'\\x%x'");
6662 error (message, ell, val);
6666 else if (token == CPP_STRING || token == CPP_WSTRING)
6667 message = catenate_messages (gmsgid, " before string constant");
6668 else if (token == CPP_NUMBER)
6669 message = catenate_messages (gmsgid, " before numeric constant");
6670 else if (token == CPP_NAME)
6672 message = catenate_messages (gmsgid, " before %qE");
6673 error (message, value);
6677 else if (token == CPP_PRAGMA)
6678 message = catenate_messages (gmsgid, " before %<#pragma%>");
6679 else if (token == CPP_PRAGMA_EOL)
6680 message = catenate_messages (gmsgid, " before end of line");
6681 else if (token < N_TTYPES)
6683 message = catenate_messages (gmsgid, " before %qs token");
6684 error (message, cpp_type2name (token));
6696 #undef catenate_messages
6699 /* Walk a gimplified function and warn for functions whose return value is
6700 ignored and attribute((warn_unused_result)) is set. This is done before
6701 inlining, so we don't have to worry about that. */
6704 c_warn_unused_result (tree *top_p)
6707 tree_stmt_iterator i;
6710 switch (TREE_CODE (t))
6712 case STATEMENT_LIST:
6713 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
6714 c_warn_unused_result (tsi_stmt_ptr (i));
6718 c_warn_unused_result (&COND_EXPR_THEN (t));
6719 c_warn_unused_result (&COND_EXPR_ELSE (t));
6722 c_warn_unused_result (&BIND_EXPR_BODY (t));
6724 case TRY_FINALLY_EXPR:
6725 case TRY_CATCH_EXPR:
6726 c_warn_unused_result (&TREE_OPERAND (t, 0));
6727 c_warn_unused_result (&TREE_OPERAND (t, 1));
6730 c_warn_unused_result (&CATCH_BODY (t));
6732 case EH_FILTER_EXPR:
6733 c_warn_unused_result (&EH_FILTER_FAILURE (t));
6740 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6741 a MODIFY_EXPR. All calls whose value is ignored should be
6742 represented like this. Look for the attribute. */
6743 fdecl = get_callee_fndecl (t);
6745 ftype = TREE_TYPE (fdecl);
6748 ftype = TREE_TYPE (CALL_EXPR_FN (t));
6749 /* Look past pointer-to-function to the function type itself. */
6750 ftype = TREE_TYPE (ftype);
6753 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
6756 warning (0, "%Hignoring return value of %qD, "
6757 "declared with attribute warn_unused_result",
6758 EXPR_LOCUS (t), fdecl);
6760 warning (0, "%Hignoring return value of function "
6761 "declared with attribute warn_unused_result",
6767 /* Not a container, not a call, or a call whose value is used. */
6772 /* Convert a character from the host to the target execution character
6773 set. cpplib handles this, mostly. */
6776 c_common_to_target_charset (HOST_WIDE_INT c)
6778 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6779 zero-extended under -fno-signed-char. cpplib insists that characters
6780 and character constants are always unsigned. Hence we must convert
6782 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
6784 uc = cpp_host_to_exec_charset (parse_in, uc);
6786 if (flag_signed_char)
6787 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
6788 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
6793 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6794 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6795 NULL, at the bottom; much like the traditional rendering of offsetof as a
6796 macro. Returns the folded and properly cast result. */
6799 fold_offsetof_1 (tree expr, tree stop_ref)
6801 enum tree_code code = PLUS_EXPR;
6804 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
6805 return size_zero_node;
6807 switch (TREE_CODE (expr))
6813 error ("cannot apply %<offsetof%> to static data member %qD", expr);
6814 return error_mark_node;
6817 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6818 return error_mark_node;
6821 gcc_assert (integer_zerop (expr));
6822 return size_zero_node;
6826 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6827 gcc_assert (base == error_mark_node || base == size_zero_node);
6831 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6832 if (base == error_mark_node)
6835 t = TREE_OPERAND (expr, 1);
6836 if (DECL_C_BIT_FIELD (t))
6838 error ("attempt to take address of bit-field structure "
6840 return error_mark_node;
6842 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
6843 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
6848 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6849 if (base == error_mark_node)
6852 t = TREE_OPERAND (expr, 1);
6853 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
6856 t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t);
6858 t = convert (sizetype, t);
6859 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
6863 /* Handle static members of volatile structs. */
6864 t = TREE_OPERAND (expr, 1);
6865 gcc_assert (TREE_CODE (t) == VAR_DECL);
6866 return fold_offsetof_1 (t, stop_ref);
6872 return size_binop (code, base, off);
6876 fold_offsetof (tree expr, tree stop_ref)
6878 /* Convert back from the internal sizetype to size_t. */
6879 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
6882 /* Print an error message for an invalid lvalue. USE says
6883 how the lvalue is being used and so selects the error message. */
6886 lvalue_error (enum lvalue_use use)
6891 error ("lvalue required as left operand of assignment");
6894 error ("lvalue required as increment operand");
6897 error ("lvalue required as decrement operand");
6900 error ("lvalue required as unary %<&%> operand");
6903 error ("lvalue required in asm statement");
6910 /* *PTYPE is an incomplete array. Complete it with a domain based on
6911 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6912 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6913 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6916 complete_array_type (tree *ptype, tree initial_value, bool do_default)
6918 tree maxindex, type, main_type, elt, unqual_elt;
6919 int failure = 0, quals;
6920 hashval_t hashcode = 0;
6922 maxindex = size_zero_node;
6925 if (TREE_CODE (initial_value) == STRING_CST)
6928 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
6929 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
6931 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
6933 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
6935 if (VEC_empty (constructor_elt, v))
6939 maxindex = integer_minus_one_node;
6944 unsigned HOST_WIDE_INT cnt;
6945 constructor_elt *ce;
6947 if (VEC_index (constructor_elt, v, 0)->index)
6948 maxindex = fold_convert (sizetype,
6949 VEC_index (constructor_elt,
6951 curindex = maxindex;
6954 VEC_iterate (constructor_elt, v, cnt, ce);
6958 curindex = fold_convert (sizetype, ce->index);
6960 curindex = size_binop (PLUS_EXPR, curindex, size_one_node);
6962 if (tree_int_cst_lt (maxindex, curindex))
6963 maxindex = curindex;
6969 /* Make an error message unless that happened already. */
6970 if (initial_value != error_mark_node)
6982 elt = TREE_TYPE (type);
6983 quals = TYPE_QUALS (strip_array_types (elt));
6987 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
6989 /* Using build_distinct_type_copy and modifying things afterward instead
6990 of using build_array_type to create a new type preserves all of the
6991 TYPE_LANG_FLAG_? bits that the front end may have set. */
6992 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
6993 TREE_TYPE (main_type) = unqual_elt;
6994 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
6995 layout_type (main_type);
6997 /* Make sure we have the canonical MAIN_TYPE. */
6998 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
6999 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
7001 main_type = type_hash_canon (hashcode, main_type);
7003 /* Fix the canonical type. */
7004 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
7005 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
7006 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
7007 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
7008 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
7009 != TYPE_DOMAIN (main_type)))
7010 TYPE_CANONICAL (main_type)
7011 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
7012 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
7014 TYPE_CANONICAL (main_type) = main_type;
7019 type = c_build_qualified_type (main_type, quals);
7021 if (COMPLETE_TYPE_P (type)
7022 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
7023 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type)))
7025 error ("size of array is too large");
7026 /* If we proceed with the array type as it is, we'll eventually
7027 crash in tree_low_cst(). */
7028 type = error_mark_node;
7036 /* Used to help initialize the builtin-types.def table. When a type of
7037 the correct size doesn't exist, use error_mark_node instead of NULL.
7038 The later results in segfaults even when a decl using the type doesn't
7042 builtin_type_for_size (int size, bool unsignedp)
7044 tree type = lang_hooks.types.type_for_size (size, unsignedp);
7045 return type ? type : error_mark_node;
7048 /* A helper function for resolve_overloaded_builtin in resolving the
7049 overloaded __sync_ builtins. Returns a positive power of 2 if the
7050 first operand of PARAMS is a pointer to a supported data type.
7051 Returns 0 if an error is encountered. */
7054 sync_resolve_size (tree function, tree params)
7061 error ("too few arguments to function %qE", function);
7065 type = TREE_TYPE (TREE_VALUE (params));
7066 if (TREE_CODE (type) != POINTER_TYPE)
7069 type = TREE_TYPE (type);
7070 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
7073 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
7074 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
7078 error ("incompatible type for argument %d of %qE", 1, function);
7082 /* A helper function for resolve_overloaded_builtin. Adds casts to
7083 PARAMS to make arguments match up with those of FUNCTION. Drops
7084 the variadic arguments at the end. Returns false if some error
7085 was encountered; true on success. */
7088 sync_resolve_params (tree orig_function, tree function, tree params)
7090 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
7094 /* We've declared the implementation functions to use "volatile void *"
7095 as the pointer parameter, so we shouldn't get any complaints from the
7096 call to check_function_arguments what ever type the user used. */
7097 arg_types = TREE_CHAIN (arg_types);
7098 ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
7101 /* For the rest of the values, we need to cast these to FTYPE, so that we
7102 don't get warnings for passing pointer types, etc. */
7103 while (arg_types != void_list_node)
7107 params = TREE_CHAIN (params);
7110 error ("too few arguments to function %qE", orig_function);
7114 /* ??? Ideally for the first conversion we'd use convert_for_assignment
7115 so that we get warnings for anything that doesn't match the pointer
7116 type. This isn't portable across the C and C++ front ends atm. */
7117 val = TREE_VALUE (params);
7118 val = convert (ptype, val);
7119 val = convert (TREE_VALUE (arg_types), val);
7120 TREE_VALUE (params) = val;
7122 arg_types = TREE_CHAIN (arg_types);
7126 /* The definition of these primitives is variadic, with the remaining
7127 being "an optional list of variables protected by the memory barrier".
7128 No clue what that's supposed to mean, precisely, but we consider all
7129 call-clobbered variables to be protected so we're safe. */
7130 TREE_CHAIN (params) = NULL;
7135 /* A helper function for resolve_overloaded_builtin. Adds a cast to
7136 RESULT to make it match the type of the first pointer argument in
7140 sync_resolve_return (tree params, tree result)
7142 tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
7143 ptype = TYPE_MAIN_VARIANT (ptype);
7144 return convert (ptype, result);
7147 /* Some builtin functions are placeholders for other expressions. This
7148 function should be called immediately after parsing the call expression
7149 before surrounding code has committed to the type of the expression.
7151 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7152 PARAMS is the argument list for the call. The return value is non-null
7153 when expansion is complete, and null if normal processing should
7157 resolve_overloaded_builtin (tree function, tree params)
7159 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
7160 switch (DECL_BUILT_IN_CLASS (function))
7162 case BUILT_IN_NORMAL:
7165 if (targetm.resolve_overloaded_builtin)
7166 return targetm.resolve_overloaded_builtin (function, params);
7173 /* Handle BUILT_IN_NORMAL here. */
7176 case BUILT_IN_FETCH_AND_ADD_N:
7177 case BUILT_IN_FETCH_AND_SUB_N:
7178 case BUILT_IN_FETCH_AND_OR_N:
7179 case BUILT_IN_FETCH_AND_AND_N:
7180 case BUILT_IN_FETCH_AND_XOR_N:
7181 case BUILT_IN_FETCH_AND_NAND_N:
7182 case BUILT_IN_ADD_AND_FETCH_N:
7183 case BUILT_IN_SUB_AND_FETCH_N:
7184 case BUILT_IN_OR_AND_FETCH_N:
7185 case BUILT_IN_AND_AND_FETCH_N:
7186 case BUILT_IN_XOR_AND_FETCH_N:
7187 case BUILT_IN_NAND_AND_FETCH_N:
7188 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
7189 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
7190 case BUILT_IN_LOCK_TEST_AND_SET_N:
7191 case BUILT_IN_LOCK_RELEASE_N:
7193 int n = sync_resolve_size (function, params);
7194 tree new_function, result;
7197 return error_mark_node;
7199 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
7200 if (!sync_resolve_params (function, new_function, params))
7201 return error_mark_node;
7203 result = build_function_call (new_function, params);
7204 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
7205 && orig_code != BUILT_IN_LOCK_RELEASE_N)
7206 result = sync_resolve_return (params, result);
7216 /* Ignoring their sign, return true if two scalar types are the same. */
7218 same_scalar_type_ignoring_signedness (tree t1, tree t2)
7220 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
7222 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
7223 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
7224 || c2 == FIXED_POINT_TYPE));
7226 /* Equality works here because c_common_signed_type uses
7227 TYPE_MAIN_VARIANT. */
7228 return c_common_signed_type (t1)
7229 == c_common_signed_type (t2);
7232 /* Check for missing format attributes on function pointers. LTYPE is
7233 the new type or left-hand side type. RTYPE is the old type or
7234 right-hand side type. Returns TRUE if LTYPE is missing the desired
7238 check_missing_format_attribute (tree ltype, tree rtype)
7240 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
7243 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
7244 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
7249 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
7250 if (is_attribute_p ("format", TREE_PURPOSE (la)))
7258 /* Subscripting with type char is likely to lose on a machine where
7259 chars are signed. So warn on any machine, but optionally. Don't
7260 warn for unsigned char since that type is safe. Don't warn for
7261 signed char because anyone who uses that must have done so
7262 deliberately. Furthermore, we reduce the false positive load by
7263 warning only for non-constant value of type char. */
7266 warn_array_subscript_with_type_char (tree index)
7268 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
7269 && TREE_CODE (index) != INTEGER_CST)
7270 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
7273 /* Implement -Wparentheses for the unexpected C precedence rules, to
7274 cover cases like x + y << z which readers are likely to
7275 misinterpret. We have seen an expression in which CODE is a binary
7276 operator used to combine expressions headed by CODE_LEFT and
7277 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
7278 means that that side of the expression was not formed using a
7279 binary operator, or it was enclosed in parentheses. */
7282 warn_about_parentheses (enum tree_code code, enum tree_code code_left,
7283 enum tree_code code_right)
7285 if (!warn_parentheses)
7288 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
7290 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
7291 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
7292 warning (OPT_Wparentheses,
7293 "suggest parentheses around + or - inside shift");
7296 if (code == TRUTH_ORIF_EXPR)
7298 if (code_left == TRUTH_ANDIF_EXPR
7299 || code_right == TRUTH_ANDIF_EXPR)
7300 warning (OPT_Wparentheses,
7301 "suggest parentheses around && within ||");
7304 if (code == BIT_IOR_EXPR)
7306 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
7307 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
7308 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
7309 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
7310 warning (OPT_Wparentheses,
7311 "suggest parentheses around arithmetic in operand of |");
7312 /* Check cases like x|y==z */
7313 if (TREE_CODE_CLASS (code_left) == tcc_comparison
7314 || TREE_CODE_CLASS (code_right) == tcc_comparison)
7315 warning (OPT_Wparentheses,
7316 "suggest parentheses around comparison in operand of |");
7319 if (code == BIT_XOR_EXPR)
7321 if (code_left == BIT_AND_EXPR
7322 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
7323 || code_right == BIT_AND_EXPR
7324 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
7325 warning (OPT_Wparentheses,
7326 "suggest parentheses around arithmetic in operand of ^");
7327 /* Check cases like x^y==z */
7328 if (TREE_CODE_CLASS (code_left) == tcc_comparison
7329 || TREE_CODE_CLASS (code_right) == tcc_comparison)
7330 warning (OPT_Wparentheses,
7331 "suggest parentheses around comparison in operand of ^");
7334 if (code == BIT_AND_EXPR)
7336 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
7337 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
7338 warning (OPT_Wparentheses,
7339 "suggest parentheses around + or - in operand of &");
7340 /* Check cases like x&y==z */
7341 if (TREE_CODE_CLASS (code_left) == tcc_comparison
7342 || TREE_CODE_CLASS (code_right) == tcc_comparison)
7343 warning (OPT_Wparentheses,
7344 "suggest parentheses around comparison in operand of &");
7347 if (code == EQ_EXPR || code == NE_EXPR)
7349 if (TREE_CODE_CLASS (code_left) == tcc_comparison
7350 || TREE_CODE_CLASS (code_right) == tcc_comparison)
7351 warning (OPT_Wparentheses,
7352 "suggest parentheses around comparison in operand of %s",
7353 code == EQ_EXPR ? "==" : "!=");
7355 else if (TREE_CODE_CLASS (code) == tcc_comparison)
7357 if ((TREE_CODE_CLASS (code_left) == tcc_comparison
7358 && code_left != NE_EXPR && code_left != EQ_EXPR)
7359 || (TREE_CODE_CLASS (code_right) == tcc_comparison
7360 && code_right != NE_EXPR && code_right != EQ_EXPR))
7361 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
7362 "have their mathematical meaning");
7366 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
7369 warn_for_unused_label (tree label)
7371 if (!TREE_USED (label))
7373 if (DECL_INITIAL (label))
7374 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
7376 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
7380 #ifndef TARGET_HAS_TARGETCM
7381 struct gcc_targetcm targetcm = TARGETCM_INITIALIZER;
7384 /* Warn for division by zero according to the value of DIVISOR. */
7387 warn_for_div_by_zero (tree divisor)
7389 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
7390 about division by zero. Do not issue a warning if DIVISOR has a
7391 floating-point type, since we consider 0.0/0.0 a valid way of
7392 generating a NaN. */
7393 if (skip_evaluation == 0
7394 && (integer_zerop (divisor) || fixed_zerop (divisor)))
7395 warning (OPT_Wdiv_by_zero, "division by zero");
7398 #include "gt-c-common.h"