]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/c-family/c-common.c
projects / thirdparty / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
2011-08-10 Artjoms Sinkarovs <artyom.shinakroff@gmail.com>
[thirdparty/gcc.git] / gcc / c-family / c-common.c
CommitLineData
b0fc3e72 1/* Subroutines shared by all languages that are variants of C.
d513ec2f 2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
fdd84b77 3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
2d9d8740 4 Free Software Foundation, Inc.
b0fc3e72 5
f12b58b3 6This file is part of GCC.
b0fc3e72 7
f12b58b3 8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
8c4c00c1 10Software Foundation; either version 3, or (at your option) any later
f12b58b3 11version.
b0fc3e72 12
f12b58b3 13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16for more details.
b0fc3e72 17
18You should have received a copy of the GNU General Public License
8c4c00c1 19along with GCC; see the file COPYING3. If not see
20<http://www.gnu.org/licenses/>. */
b0fc3e72 21
22#include "config.h"
405711de 23#include "system.h"
805e22b2 24#include "coretypes.h"
25#include "tm.h"
e48d0f41 26#include "intl.h"
b0fc3e72 27#include "tree.h"
b0fc3e72 28#include "flags.h"
cd03a192 29#include "output.h"
a3fa7feb 30#include "c-pragma.h"
dc12af01 31#include "ggc.h"
e41f0d80 32#include "c-common.h"
6c536c4f 33#include "c-objc.h"
d8c9779c 34#include "tm_p.h"
4e91a871 35#include "obstack.h"
a654e028 36#include "cpplib.h"
8ee295a7 37#include "target.h"
218e3e4e 38#include "common/common-target.h"
96554925 39#include "langhooks.h"
f3dde807 40#include "tree-inline.h"
69579044 41#include "toplev.h"
7f5f3953 42#include "diagnostic.h"
4ee9c684 43#include "tree-iterator.h"
44#include "hashtab.h"
b55af61c 45#include "tree-mudflap.h"
e08bd2f4 46#include "opts.h"
62eec3b4 47#include "cgraph.h"
b9fc964a 48#include "target-def.h"
979d3efc 49#include "libfuncs.h"
fd6f6435 50
90cc7820 51cpp_reader *parse_in; /* Declared in c-pragma.h. */
a654e028 52
72040e7e 53/* The following symbols are subsumed in the c_global_trees array, and
44e9fa65 54 listed here individually for documentation purposes.
72040e7e 55
56 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
57
58 tree short_integer_type_node;
59 tree long_integer_type_node;
60 tree long_long_integer_type_node;
6388cfe2 61 tree int128_integer_type_node;
72040e7e 62
63 tree short_unsigned_type_node;
64 tree long_unsigned_type_node;
65 tree long_long_unsigned_type_node;
6388cfe2 66 tree int128_unsigned_type_node;
72040e7e 67
3c2239cf 68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72040e7e 71
72 tree ptrdiff_type_node;
73
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
76 tree wchar_type_node;
72040e7e 77
924bbf02 78 tree char16_type_node;
79 tree char32_type_node;
80
72040e7e 81 tree float_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
84
85 tree complex_integer_type_node;
86 tree complex_float_type_node;
87 tree complex_double_type_node;
88 tree complex_long_double_type_node;
89
c4503c0a 90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
93
72040e7e 94 tree intQI_type_node;
95 tree intHI_type_node;
96 tree intSI_type_node;
97 tree intDI_type_node;
98 tree intTI_type_node;
99
100 tree unsigned_intQI_type_node;
101 tree unsigned_intHI_type_node;
102 tree unsigned_intSI_type_node;
103 tree unsigned_intDI_type_node;
104 tree unsigned_intTI_type_node;
105
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
108
109 Nodes for types `void *' and `const void *'.
110
111 tree ptr_type_node, const_ptr_type_node;
112
113 Nodes for types `char *' and `const char *'.
114
115 tree string_type_node, const_string_type_node;
116
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
119
120 tree char_array_type_node;
121
122 Type `int[SOMENUMBER]' or something like it.
123 Used when an array of int needed and the size is irrelevant.
124
125 tree int_array_type_node;
126
127 Type `wchar_t[SOMENUMBER]' or something like it.
128 Used when a wide string literal is created.
129
130 tree wchar_array_type_node;
131
924bbf02 132 Type `char16_t[SOMENUMBER]' or something like it.
133 Used when a UTF-16 string literal is created.
134
135 tree char16_array_type_node;
136
137 Type `char32_t[SOMENUMBER]' or something like it.
138 Used when a UTF-32 string literal is created.
139
140 tree char32_array_type_node;
141
72040e7e 142 Type `int ()' -- used for implicit declaration of functions.
143
144 tree default_function_type;
145
72040e7e 146 A VOID_TYPE node, packaged in a TREE_LIST.
147
148 tree void_list_node;
149
734c98be 150 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
65b7f83f 151 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
152 VAR_DECLS, but C++ does.)
71d9fc9b 153
65b7f83f 154 tree function_name_decl_node;
734c98be 155 tree pretty_function_name_decl_node;
65b7f83f 156 tree c99_function_name_decl_node;
157
158 Stack of nested function name VAR_DECLs.
1cae46be 159
65b7f83f 160 tree saved_function_name_decls;
71d9fc9b 161
72040e7e 162*/
163
164tree c_global_trees[CTI_MAX];
573aba85 165\f
574a6990 166/* Switches common to the C front ends. */
167
f7070933 168/* Nonzero means don't output line number information. */
169
170char flag_no_line_commands;
171
172/* Nonzero causes -E output not to be done, but directives such as
173 #define that have side effects are still obeyed. */
174
175char flag_no_output;
176
177/* Nonzero means dump macros in some fashion. */
178
179char flag_dump_macros;
180
181/* Nonzero means pass #include lines through to the output. */
182
183char flag_dump_includes;
184
d718b525 185/* Nonzero means process PCH files while preprocessing. */
186
187bool flag_pch_preprocess;
188
573aba85 189/* The file name to which we should write a precompiled header, or
190 NULL if no header will be written in this compile. */
191
192const char *pch_file;
193
1ed9d5f5 194/* Nonzero if an ISO standard was selected. It rejects macros in the
195 user's namespace. */
196int flag_iso;
197
1cae46be 198/* Warn about #pragma directives that are not recognized. */
574a6990 199
1cae46be 200int warn_unknown_pragmas; /* Tri state variable. */
574a6990 201
574a6990 202/* Warn about format/argument anomalies in calls to formatted I/O functions
203 (*printf, *scanf, strftime, strfmon, etc.). */
204
205int warn_format;
206
574a6990 207/* C/ObjC language option variables. */
208
209
574a6990 210/* Nonzero means allow type mismatches in conditional expressions;
211 just make their values `void'. */
212
213int flag_cond_mismatch;
214
215/* Nonzero means enable C89 Amendment 1 features. */
216
217int flag_isoc94;
218
39012afb 219/* Nonzero means use the ISO C99 (or C1X) dialect of C. */
574a6990 220
221int flag_isoc99;
222
39012afb 223/* Nonzero means use the ISO C1X dialect of C. */
224
225int flag_isoc1x;
226
8b332087 227/* Nonzero means that we have builtin functions, and main is an int. */
574a6990 228
229int flag_hosted = 1;
230
574a6990 231
232/* ObjC language option variables. */
233
234
574a6990 235/* Tells the compiler that this is a special run. Do not perform any
236 compiling, instead we are to test some platform dependent features
237 and output a C header file with appropriate definitions. */
238
239int print_struct_values;
240
f0b5f617 241/* Tells the compiler what is the constant string class for ObjC. */
574a6990 242
243const char *constant_string_class_name;
244
574a6990 245
246/* C++ language option variables. */
247
248
574a6990 249/* Nonzero means generate separate instantiation control files and
250 juggle them at link time. */
251
252int flag_use_repository;
253
6dcdb5de 254/* The C++ dialect being used. C++98 is the default. */
0fe6eeac 255
6dcdb5de 256enum cxx_dialect cxx_dialect = cxx98;
0fe6eeac 257
9dcd0d49 258/* Maximum template instantiation depth. This limit exists to limit the
8ce59854 259 time it takes to notice excessively recursive template instantiations.
574a6990 260
8ce59854 261 The default is lower than the 1024 recommended by the C++0x standard
262 because G++ runs out of stack before 1024 with highly recursive template
263 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
264
265int max_tinst_depth = 900;
574a6990 266
988fc1d1 267/* The elements of `ridpointers' are identifier nodes for the reserved
268 type names and storage classes. It is indexed by a RID_... value. */
269tree *ridpointers;
270
e60a6f7b 271tree (*make_fname_decl) (location_t, tree, int);
9e5a737d 272
48d94ede 273/* Nonzero means don't warn about problems that occur when the code is
274 executed. */
275int c_inhibit_evaluation_warnings;
e78703c1 276
93be21c0 277/* Whether we are building a boolean conversion inside
278 convert_for_assignment, or some other late binary operation. If
279 build_binary_op is called for C (from code shared by C and C++) in
280 this case, then the operands have already been folded and the
281 result will not be folded again, so C_MAYBE_CONST_EXPR should not
282 be generated. */
283bool in_late_binary_op;
284
7f5f3953 285/* Whether lexing has been completed, so subsequent preprocessor
286 errors should use the compiler's input_location. */
287bool done_lexing = false;
288
2c0e001b 289/* Information about how a function name is generated. */
65b7f83f 290struct fname_var_t
291{
e99c3a1d 292 tree *const decl; /* pointer to the VAR_DECL. */
293 const unsigned rid; /* RID number for the identifier. */
294 const int pretty; /* How pretty is it? */
65b7f83f 295};
296
2c0e001b 297/* The three ways of getting then name of the current function. */
65b7f83f 298
299const struct fname_var_t fname_vars[] =
300{
2c0e001b 301 /* C99 compliant __func__, must be first. */
65b7f83f 302 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
2c0e001b 303 /* GCC __FUNCTION__ compliant. */
65b7f83f 304 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
2c0e001b 305 /* GCC __PRETTY_FUNCTION__ compliant. */
65b7f83f 306 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
307 {NULL, 0, 0},
308};
309
79396169 310/* Global visibility options. */
311struct visibility_flags visibility_options;
312
a75b1c71 313static tree c_fully_fold_internal (tree expr, bool, bool *, bool *);
2ca392fd 314static tree check_case_value (tree);
315static bool check_case_bounds (tree, tree, tree *, tree *);
be43ff5a 316
1cae46be 317static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
318static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
319static tree handle_common_attribute (tree *, tree, tree, int, bool *);
320static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
5de92639 321static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
322static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
1cae46be 323static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
bdb1f0d1 324static tree handle_noclone_attribute (tree *, tree, tree, int, bool *);
7bd95dfd 325static tree handle_leaf_attribute (tree *, tree, tree, int, bool *);
1cae46be 326static tree handle_always_inline_attribute (tree *, tree, tree, int,
327 bool *);
1b16fc45 328static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
329static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
0cdd9887 330static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
10fc867f 331static tree handle_error_attribute (tree *, tree, tree, int, bool *);
1cae46be 332static tree handle_used_attribute (tree *, tree, tree, int, bool *);
333static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
62eec3b4 334static tree handle_externally_visible_attribute (tree *, tree, tree, int,
335 bool *);
1cae46be 336static tree handle_const_attribute (tree *, tree, tree, int, bool *);
337static tree handle_transparent_union_attribute (tree *, tree, tree,
338 int, bool *);
339static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
340static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
341static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
342static tree handle_section_attribute (tree *, tree, tree, int, bool *);
343static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
344static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
85c0a25c 345static tree handle_alias_ifunc_attribute (bool, tree *, tree, tree, bool *);
346static tree handle_ifunc_attribute (tree *, tree, tree, int, bool *);
1cae46be 347static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
f4a30bd7 348static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
1cae46be 349static tree handle_visibility_attribute (tree *, tree, tree, int,
350 bool *);
351static tree handle_tls_model_attribute (tree *, tree, tree, int,
352 bool *);
353static tree handle_no_instrument_function_attribute (tree *, tree,
354 tree, int, bool *);
355static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
26d1c5ff 356static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
1cae46be 357static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
358 bool *);
359static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
fc09b200 360static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
1cae46be 361static tree handle_deprecated_attribute (tree *, tree, tree, int,
362 bool *);
363static tree handle_vector_size_attribute (tree *, tree, tree, int,
364 bool *);
365static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
366static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
367static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
8a8cdb8d 368static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
369 bool *);
bf6c8de0 370static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
b5c26b42 371static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
4a29c97c 372static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
24470055 373static tree handle_target_attribute (tree *, tree, tree, int, bool *);
46f8e3b0 374static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
48b14f50 375static tree handle_no_split_stack_attribute (tree *, tree, tree, int, bool *);
8ce86007 376static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
1cae46be 377
d01f58f9 378static void check_function_nonnull (tree, int, tree *);
1cae46be 379static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
380static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
381static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
860251be 382static int resort_field_decl_cmp (const void *, const void *);
dbf6c367 383
5c6e5756 384/* Reserved words. The third field is a mask: keywords are disabled
385 if they match the mask.
386
387 Masks for languages:
388 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
389 C --std=c99: D_CXXONLY | D_OBJC
390 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
391 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
392 C++ --std=c0x: D_CONLY | D_OBJC
393 ObjC++ is like C++ except that D_OBJC is not set
394
395 If -fno-asm is used, D_ASM is added to the mask. If
396 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
397 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
b27e241e 398 In C with -Wc++-compat, we warn if D_CXXWARN is set.
5c6e5756 399
b27e241e 400 Note the complication of the D_CXX_OBJC keywords. These are
401 reserved words such as 'class'. In C++, 'class' is a reserved
402 word. In Objective-C++ it is too. In Objective-C, it is a
403 reserved word too, but only if it follows an '@' sign.
404*/
5c6e5756 405const struct c_common_resword c_common_reswords[] =
406{
407 { "_Bool", RID_BOOL, D_CONLY },
408 { "_Complex", RID_COMPLEX, 0 },
c1800156 409 { "_Imaginary", RID_IMAGINARY, D_CONLY },
5c6e5756 410 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
411 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
412 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
413 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
414 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
415 { "_Sat", RID_SAT, D_CONLY | D_EXT },
f80e7755 416 { "_Static_assert", RID_STATIC_ASSERT, D_CONLY },
5c6e5756 417 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
418 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
419 { "__alignof", RID_ALIGNOF, 0 },
420 { "__alignof__", RID_ALIGNOF, 0 },
421 { "__asm", RID_ASM, 0 },
422 { "__asm__", RID_ASM, 0 },
423 { "__attribute", RID_ATTRIBUTE, 0 },
424 { "__attribute__", RID_ATTRIBUTE, 0 },
425 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
426 { "__builtin_offsetof", RID_OFFSETOF, 0 },
427 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
428 { "__builtin_va_arg", RID_VA_ARG, 0 },
429 { "__complex", RID_COMPLEX, 0 },
430 { "__complex__", RID_COMPLEX, 0 },
431 { "__const", RID_CONST, 0 },
432 { "__const__", RID_CONST, 0 },
433 { "__decltype", RID_DECLTYPE, D_CXXONLY },
434 { "__extension__", RID_EXTENSION, 0 },
435 { "__func__", RID_C99_FUNCTION_NAME, 0 },
436 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
437 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
438 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
439 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
440 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
441 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
442 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
443 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
23407dc9 444 { "__imag", RID_IMAGPART, 0 },
445 { "__imag__", RID_IMAGPART, 0 },
446 { "__inline", RID_INLINE, 0 },
447 { "__inline__", RID_INLINE, 0 },
6388cfe2 448 { "__int128", RID_INT128, 0 },
5c6e5756 449 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
450 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
451 { "__is_class", RID_IS_CLASS, D_CXXONLY },
452 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO, D_CXXONLY },
453 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
454 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
23407dc9 455 { "__is_literal_type", RID_IS_LITERAL_TYPE, D_CXXONLY },
5c6e5756 456 { "__is_pod", RID_IS_POD, D_CXXONLY },
457 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
c1c67b4f 458 { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY },
459 { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY },
5c6e5756 460 { "__is_union", RID_IS_UNION, D_CXXONLY },
5c6e5756 461 { "__label__", RID_LABEL, 0 },
462 { "__null", RID_NULL, 0 },
463 { "__real", RID_REALPART, 0 },
464 { "__real__", RID_REALPART, 0 },
465 { "__restrict", RID_RESTRICT, 0 },
466 { "__restrict__", RID_RESTRICT, 0 },
467 { "__signed", RID_SIGNED, 0 },
468 { "__signed__", RID_SIGNED, 0 },
469 { "__thread", RID_THREAD, 0 },
470 { "__typeof", RID_TYPEOF, 0 },
471 { "__typeof__", RID_TYPEOF, 0 },
23407dc9 472 { "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY },
5c6e5756 473 { "__volatile", RID_VOLATILE, 0 },
474 { "__volatile__", RID_VOLATILE, 0 },
e463efd7 475 { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX0X | D_CXXWARN },
5c6e5756 476 { "asm", RID_ASM, D_ASM },
477 { "auto", RID_AUTO, 0 },
dbd982c9 478 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
5c6e5756 479 { "break", RID_BREAK, 0 },
480 { "case", RID_CASE, 0 },
51030405 481 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
5c6e5756 482 { "char", RID_CHAR, 0 },
51030405 483 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX0X | D_CXXWARN },
484 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX0X | D_CXXWARN },
485 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
5c6e5756 486 { "const", RID_CONST, 0 },
17814aca 487 { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX0X | D_CXXWARN },
5c6e5756 488 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
489 { "continue", RID_CONTINUE, 0 },
51030405 490 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX0X | D_CXXWARN },
5c6e5756 491 { "default", RID_DEFAULT, 0 },
51030405 492 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
5c6e5756 493 { "do", RID_DO, 0 },
494 { "double", RID_DOUBLE, 0 },
495 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
496 { "else", RID_ELSE, 0 },
497 { "enum", RID_ENUM, 0 },
51030405 498 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
499 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
5c6e5756 500 { "extern", RID_EXTERN, 0 },
51030405 501 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
5c6e5756 502 { "float", RID_FLOAT, 0 },
503 { "for", RID_FOR, 0 },
51030405 504 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
5c6e5756 505 { "goto", RID_GOTO, 0 },
506 { "if", RID_IF, 0 },
507 { "inline", RID_INLINE, D_EXT89 },
508 { "int", RID_INT, 0 },
509 { "long", RID_LONG, 0 },
510 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
51030405 511 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
512 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
98fe9664 513 { "noexcept", RID_NOEXCEPT, D_CXXONLY | D_CXX0X | D_CXXWARN },
6fe11077 514 { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX0X | D_CXXWARN },
51030405 515 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
516 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
517 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
518 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
5c6e5756 519 { "register", RID_REGISTER, 0 },
520 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
521 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
522 { "return", RID_RETURN, 0 },
523 { "short", RID_SHORT, 0 },
524 { "signed", RID_SIGNED, 0 },
525 { "sizeof", RID_SIZEOF, 0 },
526 { "static", RID_STATIC, 0 },
527 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX0X | D_CXXWARN },
528 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
529 { "struct", RID_STRUCT, 0 },
530 { "switch", RID_SWITCH, 0 },
51030405 531 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
532 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
533 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
534 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
535 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
5c6e5756 536 { "typedef", RID_TYPEDEF, 0 },
51030405 537 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
538 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
5c6e5756 539 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
540 { "union", RID_UNION, 0 },
541 { "unsigned", RID_UNSIGNED, 0 },
51030405 542 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
543 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
5c6e5756 544 { "void", RID_VOID, 0 },
545 { "volatile", RID_VOLATILE, 0 },
546 { "wchar_t", RID_WCHAR, D_CXXONLY },
547 { "while", RID_WHILE, 0 },
548 /* These Objective-C keywords are recognized only immediately after
549 an '@'. */
550 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
551 { "defs", RID_AT_DEFS, D_OBJC },
552 { "encode", RID_AT_ENCODE, D_OBJC },
553 { "end", RID_AT_END, D_OBJC },
554 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
555 { "interface", RID_AT_INTERFACE, D_OBJC },
556 { "protocol", RID_AT_PROTOCOL, D_OBJC },
557 { "selector", RID_AT_SELECTOR, D_OBJC },
558 { "finally", RID_AT_FINALLY, D_OBJC },
559 { "synchronized", RID_AT_SYNCHRONIZED, D_OBJC },
069761fb 560 { "optional", RID_AT_OPTIONAL, D_OBJC },
561 { "required", RID_AT_REQUIRED, D_OBJC },
86c110ac 562 { "property", RID_AT_PROPERTY, D_OBJC },
4a8875ed 563 { "package", RID_AT_PACKAGE, D_OBJC },
e1f293c0 564 { "synthesize", RID_AT_SYNTHESIZE, D_OBJC },
565 { "dynamic", RID_AT_DYNAMIC, D_OBJC },
5c6e5756 566 /* These are recognized only in protocol-qualifier context
567 (see above) */
568 { "bycopy", RID_BYCOPY, D_OBJC },
569 { "byref", RID_BYREF, D_OBJC },
570 { "in", RID_IN, D_OBJC },
571 { "inout", RID_INOUT, D_OBJC },
572 { "oneway", RID_ONEWAY, D_OBJC },
573 { "out", RID_OUT, D_OBJC },
86c110ac 574 /* These are recognized inside a property attribute list */
7590f0e5 575 { "assign", RID_ASSIGN, D_OBJC },
576 { "copy", RID_COPY, D_OBJC },
86c110ac 577 { "getter", RID_GETTER, D_OBJC },
7590f0e5 578 { "nonatomic", RID_NONATOMIC, D_OBJC },
579 { "readonly", RID_READONLY, D_OBJC },
580 { "readwrite", RID_READWRITE, D_OBJC },
581 { "retain", RID_RETAIN, D_OBJC },
86c110ac 582 { "setter", RID_SETTER, D_OBJC },
5c6e5756 583};
584
585const unsigned int num_c_common_reswords =
586 sizeof c_common_reswords / sizeof (struct c_common_resword);
587
f8e93a2e 588/* Table of machine-independent attributes common to all C-like languages. */
589const struct attribute_spec c_common_attribute_table[] =
590{
ac86af5d 591 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
592 affects_type_identity } */
f8e93a2e 593 { "packed", 0, 0, false, false, false,
ac86af5d 594 handle_packed_attribute , false},
f8e93a2e 595 { "nocommon", 0, 0, true, false, false,
ac86af5d 596 handle_nocommon_attribute, false},
f8e93a2e 597 { "common", 0, 0, true, false, false,
ac86af5d 598 handle_common_attribute, false },
f8e93a2e 599 /* FIXME: logically, noreturn attributes should be listed as
600 "false, true, true" and apply to function types. But implementing this
601 would require all the places in the compiler that use TREE_THIS_VOLATILE
602 on a decl to identify non-returning functions to be located and fixed
603 to check the function type instead. */
604 { "noreturn", 0, 0, true, false, false,
ac86af5d 605 handle_noreturn_attribute, false },
f8e93a2e 606 { "volatile", 0, 0, true, false, false,
ac86af5d 607 handle_noreturn_attribute, false },
f8e93a2e 608 { "noinline", 0, 0, true, false, false,
ac86af5d 609 handle_noinline_attribute, false },
bdb1f0d1 610 { "noclone", 0, 0, true, false, false,
ac86af5d 611 handle_noclone_attribute, false },
7bd95dfd 612 { "leaf", 0, 0, true, false, false,
ac86af5d 613 handle_leaf_attribute, false },
f8e93a2e 614 { "always_inline", 0, 0, true, false, false,
ac86af5d 615 handle_always_inline_attribute, false },
541e4101 616 { "gnu_inline", 0, 0, true, false, false,
ac86af5d 617 handle_gnu_inline_attribute, false },
1b16fc45 618 { "artificial", 0, 0, true, false, false,
ac86af5d 619 handle_artificial_attribute, false },
0cdd9887 620 { "flatten", 0, 0, true, false, false,
ac86af5d 621 handle_flatten_attribute, false },
f8e93a2e 622 { "used", 0, 0, true, false, false,
ac86af5d 623 handle_used_attribute, false },
f8e93a2e 624 { "unused", 0, 0, false, false, false,
ac86af5d 625 handle_unused_attribute, false },
62eec3b4 626 { "externally_visible", 0, 0, true, false, false,
ac86af5d 627 handle_externally_visible_attribute, false },
f8e93a2e 628 /* The same comments as for noreturn attributes apply to const ones. */
629 { "const", 0, 0, true, false, false,
ac86af5d 630 handle_const_attribute, false },
f8e93a2e 631 { "transparent_union", 0, 0, false, false, false,
ac86af5d 632 handle_transparent_union_attribute, false },
9af7fd5b 633 { "constructor", 0, 1, true, false, false,
ac86af5d 634 handle_constructor_attribute, false },
9af7fd5b 635 { "destructor", 0, 1, true, false, false,
ac86af5d 636 handle_destructor_attribute, false },
f8e93a2e 637 { "mode", 1, 1, false, true, false,
ac86af5d 638 handle_mode_attribute, false },
f8e93a2e 639 { "section", 1, 1, true, false, false,
ac86af5d 640 handle_section_attribute, false },
f8e93a2e 641 { "aligned", 0, 1, false, false, false,
ac86af5d 642 handle_aligned_attribute, false },
f8e93a2e 643 { "weak", 0, 0, true, false, false,
ac86af5d 644 handle_weak_attribute, false },
85c0a25c 645 { "ifunc", 1, 1, true, false, false,
ac86af5d 646 handle_ifunc_attribute, false },
f8e93a2e 647 { "alias", 1, 1, true, false, false,
ac86af5d 648 handle_alias_attribute, false },
f4a30bd7 649 { "weakref", 0, 1, true, false, false,
ac86af5d 650 handle_weakref_attribute, false },
f8e93a2e 651 { "no_instrument_function", 0, 0, true, false, false,
ac86af5d 652 handle_no_instrument_function_attribute,
653 false },
f8e93a2e 654 { "malloc", 0, 0, true, false, false,
ac86af5d 655 handle_malloc_attribute, false },
26d1c5ff 656 { "returns_twice", 0, 0, true, false, false,
ac86af5d 657 handle_returns_twice_attribute, false },
f8e93a2e 658 { "no_stack_limit", 0, 0, true, false, false,
ac86af5d 659 handle_no_limit_stack_attribute, false },
f8e93a2e 660 { "pure", 0, 0, true, false, false,
ac86af5d 661 handle_pure_attribute, false },
fc09b200 662 /* For internal use (marking of builtins) only. The name contains space
663 to prevent its usage in source code. */
664 { "no vops", 0, 0, true, false, false,
ac86af5d 665 handle_novops_attribute, false },
45c4e798 666 { "deprecated", 0, 1, false, false, false,
ac86af5d 667 handle_deprecated_attribute, false },
f8e93a2e 668 { "vector_size", 1, 1, false, true, false,
ac86af5d 669 handle_vector_size_attribute, false },
b212f378 670 { "visibility", 1, 1, false, false, false,
ac86af5d 671 handle_visibility_attribute, false },
24dfead4 672 { "tls_model", 1, 1, true, false, false,
ac86af5d 673 handle_tls_model_attribute, false },
dbf6c367 674 { "nonnull", 0, -1, false, true, true,
ac86af5d 675 handle_nonnull_attribute, false },
fa987697 676 { "nothrow", 0, 0, true, false, false,
ac86af5d 677 handle_nothrow_attribute, false },
678 { "may_alias", 0, 0, false, true, false, NULL, false },
7acb29a3 679 { "cleanup", 1, 1, true, false, false,
ac86af5d 680 handle_cleanup_attribute, false },
8a8cdb8d 681 { "warn_unused_result", 0, 0, false, true, true,
ac86af5d 682 handle_warn_unused_result_attribute, false },
50ca527f 683 { "sentinel", 0, 1, false, true, true,
ac86af5d 684 handle_sentinel_attribute, false },
b5c26b42 685 /* For internal use (marking of builtins) only. The name contains space
686 to prevent its usage in source code. */
687 { "type generic", 0, 0, false, true, true,
ac86af5d 688 handle_type_generic_attribute, false },
4a29c97c 689 { "alloc_size", 1, 2, false, true, true,
ac86af5d 690 handle_alloc_size_attribute, false },
5de92639 691 { "cold", 0, 0, true, false, false,
ac86af5d 692 handle_cold_attribute, false },
5de92639 693 { "hot", 0, 0, true, false, false,
ac86af5d 694 handle_hot_attribute, false },
10fc867f 695 { "warning", 1, 1, true, false, false,
ac86af5d 696 handle_error_attribute, false },
10fc867f 697 { "error", 1, 1, true, false, false,
ac86af5d 698 handle_error_attribute, false },
24470055 699 { "target", 1, -1, true, false, false,
ac86af5d 700 handle_target_attribute, false },
46f8e3b0 701 { "optimize", 1, -1, true, false, false,
ac86af5d 702 handle_optimize_attribute, false },
48b14f50 703 { "no_split_stack", 0, 0, true, false, false,
ac86af5d 704 handle_no_split_stack_attribute, false },
8ce86007 705 /* For internal use (marking of builtins and runtime functions) only.
706 The name contains space to prevent its usage in source code. */
707 { "fn spec", 1, 1, false, true, true,
ac86af5d 708 handle_fnspec_attribute, false },
709 { NULL, 0, 0, false, false, false, NULL, false }
f8e93a2e 710};
711
712/* Give the specifications for the format attributes, used by C and all
d716ce75 713 descendants. */
f8e93a2e 714
715const struct attribute_spec c_common_format_attribute_table[] =
716{
ac86af5d 717 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
718 affects_type_identity } */
f8e93a2e 719 { "format", 3, 3, false, true, true,
ac86af5d 720 handle_format_attribute, false },
f8e93a2e 721 { "format_arg", 1, 1, false, true, true,
ac86af5d 722 handle_format_arg_attribute, false },
723 { NULL, 0, 0, false, false, false, NULL, false }
f8e93a2e 724};
725
6d5d708e 726/* Return identifier for address space AS. */
34208e18 727
6d5d708e 728const char *
729c_addr_space_name (addr_space_t as)
730{
34208e18 731 int rid = RID_FIRST_ADDR_SPACE + as;
732 gcc_assert (ridpointers [rid]);
733 return IDENTIFIER_POINTER (ridpointers [rid]);
6d5d708e 734}
735
2c0e001b 736/* Push current bindings for the function name VAR_DECLS. */
f4e3c278 737
738void
1cae46be 739start_fname_decls (void)
f4e3c278 740{
65b7f83f 741 unsigned ix;
742 tree saved = NULL_TREE;
1cae46be 743
65b7f83f 744 for (ix = 0; fname_vars[ix].decl; ix++)
745 {
746 tree decl = *fname_vars[ix].decl;
f4e3c278 747
65b7f83f 748 if (decl)
749 {
ceb7b692 750 saved = tree_cons (decl, build_int_cst (integer_type_node, ix),
751 saved);
65b7f83f 752 *fname_vars[ix].decl = NULL_TREE;
753 }
754 }
755 if (saved || saved_function_name_decls)
756 /* Normally they'll have been NULL, so only push if we've got a
757 stack, or they are non-NULL. */
758 saved_function_name_decls = tree_cons (saved, NULL_TREE,
759 saved_function_name_decls);
760}
761
2363ef00 762/* Finish up the current bindings, adding them into the current function's
763 statement tree. This must be done _before_ finish_stmt_tree is called.
764 If there is no current function, we must be at file scope and no statements
765 are involved. Pop the previous bindings. */
65b7f83f 766
767void
1cae46be 768finish_fname_decls (void)
65b7f83f 769{
770 unsigned ix;
2363ef00 771 tree stmts = NULL_TREE;
65b7f83f 772 tree stack = saved_function_name_decls;
773
774 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
2363ef00 775 append_to_statement_list (TREE_VALUE (stack), &stmts);
1cae46be 776
2363ef00 777 if (stmts)
65b7f83f 778 {
2363ef00 779 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
5c423bd6 780
2363ef00 781 if (TREE_CODE (*bodyp) == BIND_EXPR)
782 bodyp = &BIND_EXPR_BODY (*bodyp);
81010c97 783
bc2b76e0 784 append_to_statement_list_force (*bodyp, &stmts);
2363ef00 785 *bodyp = stmts;
65b7f83f 786 }
1cae46be 787
65b7f83f 788 for (ix = 0; fname_vars[ix].decl; ix++)
789 *fname_vars[ix].decl = NULL_TREE;
1cae46be 790
65b7f83f 791 if (stack)
f4e3c278 792 {
2c0e001b 793 /* We had saved values, restore them. */
65b7f83f 794 tree saved;
795
796 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
797 {
798 tree decl = TREE_PURPOSE (saved);
799 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1cae46be 800
65b7f83f 801 *fname_vars[ix].decl = decl;
802 }
803 stack = TREE_CHAIN (stack);
f4e3c278 804 }
65b7f83f 805 saved_function_name_decls = stack;
806}
807
81010c97 808/* Return the text name of the current function, suitably prettified
5fc7fa69 809 by PRETTY_P. Return string must be freed by caller. */
65b7f83f 810
811const char *
1cae46be 812fname_as_string (int pretty_p)
65b7f83f 813{
9ad4bb1e 814 const char *name = "top level";
5fc7fa69 815 char *namep;
8115b8be 816 int vrb = 2, len;
817 cpp_string cstr = { 0, 0 }, strname;
9ad4bb1e 818
84166705 819 if (!pretty_p)
9ad4bb1e 820 {
821 name = "";
822 vrb = 0;
823 }
824
825 if (current_function_decl)
dc24ddbd 826 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
9ad4bb1e 827
8115b8be 828 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
5fc7fa69 829
8115b8be 830 namep = XNEWVEC (char, len);
831 snprintf (namep, len, "\"%s\"", name);
832 strname.text = (unsigned char *) namep;
833 strname.len = len - 1;
5fc7fa69 834
924bbf02 835 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
8115b8be 836 {
837 XDELETEVEC (namep);
838 return (const char *) cstr.text;
5fc7fa69 839 }
5fc7fa69 840
841 return namep;
65b7f83f 842}
843
65b7f83f 844/* Return the VAR_DECL for a const char array naming the current
845 function. If the VAR_DECL has not yet been created, create it
846 now. RID indicates how it should be formatted and IDENTIFIER_NODE
847 ID is its name (unfortunately C and C++ hold the RID values of
848 keywords in different places, so we can't derive RID from ID in
e3b80d49 849 this language independent code. LOC is the location of the
850 function. */
65b7f83f 851
852tree
e3b80d49 853fname_decl (location_t loc, unsigned int rid, tree id)
65b7f83f 854{
855 unsigned ix;
856 tree decl = NULL_TREE;
857
858 for (ix = 0; fname_vars[ix].decl; ix++)
859 if (fname_vars[ix].rid == rid)
860 break;
861
862 decl = *fname_vars[ix].decl;
863 if (!decl)
f4e3c278 864 {
2222b3c6 865 /* If a tree is built here, it would normally have the lineno of
866 the current statement. Later this tree will be moved to the
867 beginning of the function and this line number will be wrong.
868 To avoid this problem set the lineno to 0 here; that prevents
7299020b 869 it from appearing in the RTL. */
2363ef00 870 tree stmts;
9a6486a6 871 location_t saved_location = input_location;
9a6486a6 872 input_location = UNKNOWN_LOCATION;
1cae46be 873
2363ef00 874 stmts = push_stmt_list ();
e60a6f7b 875 decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty);
2363ef00 876 stmts = pop_stmt_list (stmts);
877 if (!IS_EMPTY_STMT (stmts))
878 saved_function_name_decls
879 = tree_cons (decl, stmts, saved_function_name_decls);
65b7f83f 880 *fname_vars[ix].decl = decl;
9a6486a6 881 input_location = saved_location;
f4e3c278 882 }
65b7f83f 883 if (!ix && !current_function_decl)
e3b80d49 884 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
81010c97 885
65b7f83f 886 return decl;
f4e3c278 887}
888
070236f0 889/* Given a STRING_CST, give it a suitable array-of-chars data type. */
b0fc3e72 890
891tree
1cae46be 892fix_string_type (tree value)
b0fc3e72 893{
070236f0 894 int length = TREE_STRING_LENGTH (value);
895 int nchars;
00d26680 896 tree e_type, i_type, a_type;
897
73be5127 898 /* Compute the number of elements, for the array type. */
924bbf02 899 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
900 {
901 nchars = length;
902 e_type = char_type_node;
903 }
904 else if (TREE_TYPE (value) == char16_array_type_node)
905 {
906 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
907 e_type = char16_type_node;
908 }
909 else if (TREE_TYPE (value) == char32_array_type_node)
910 {
911 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
912 e_type = char32_type_node;
913 }
914 else
915 {
916 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
917 e_type = wchar_type_node;
918 }
b0fc3e72 919
1d752508 920 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
921 limit in C++98 Annex B is very large (65536) and is not normative,
922 so we do not diagnose it (warn_overlength_strings is forced off
923 in c_common_post_options). */
924 if (warn_overlength_strings)
925 {
926 const int nchars_max = flag_isoc99 ? 4095 : 509;
927 const int relevant_std = flag_isoc99 ? 99 : 90;
928 if (nchars - 1 > nchars_max)
929 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
930 separate the %d from the 'C'. 'ISO' should not be
931 translated, but it may be moved after 'C%d' in languages
932 where modifiers follow nouns. */
21ca8540 933 pedwarn (input_location, OPT_Woverlength_strings,
8864917d 934 "string length %qd is greater than the length %qd "
1d752508 935 "ISO C%d compilers are required to support",
936 nchars - 1, nchars_max, relevant_std);
937 }
82cfc7f7 938
390be14e 939 /* Create the array type for the string constant. The ISO C++
940 standard says that a string literal has type `const char[N]' or
941 `const wchar_t[N]'. We use the same logic when invoked as a C
942 front-end with -Wwrite-strings.
943 ??? We should change the type of an expression depending on the
944 state of a warning flag. We should just be warning -- see how
945 this is handled in the C++ front-end for the deprecated implicit
946 conversion from string literals to `char*' or `wchar_t*'.
00d26680 947
948 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
949 array type being the unqualified version of that type.
950 Therefore, if we are constructing an array of const char, we must
951 construct the matching unqualified array type first. The C front
952 end does not require this, but it does no harm, so we do it
953 unconditionally. */
ceb7b692 954 i_type = build_index_type (size_int (nchars - 1));
00d26680 955 a_type = build_array_type (e_type, i_type);
390be14e 956 if (c_dialect_cxx() || warn_write_strings)
aebc8537 957 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
3a10ba35 958
00d26680 959 TREE_TYPE (value) = a_type;
b8e3b7ad 960 TREE_CONSTANT (value) = 1;
a814bad5 961 TREE_READONLY (value) = 1;
b0fc3e72 962 TREE_STATIC (value) = 1;
963 return value;
964}
965\f
fc501191 966/* If DISABLE is true, stop issuing warnings. This is used when
967 parsing code that we know will not be executed. This function may
968 be called multiple times, and works as a stack. */
969
970static void
971c_disable_warnings (bool disable)
972{
973 if (disable)
974 {
975 ++c_inhibit_evaluation_warnings;
976 fold_defer_overflow_warnings ();
977 }
978}
979
980/* If ENABLE is true, reenable issuing warnings. */
981
982static void
983c_enable_warnings (bool enable)
984{
985 if (enable)
986 {
987 --c_inhibit_evaluation_warnings;
988 fold_undefer_and_ignore_overflow_warnings ();
989 }
990}
991
a75b1c71 992/* Fully fold EXPR, an expression that was not folded (beyond integer
993 constant expressions and null pointer constants) when being built
994 up. If IN_INIT, this is in a static initializer and certain
995 changes are made to the folding done. Clear *MAYBE_CONST if
996 MAYBE_CONST is not NULL and EXPR is definitely not a constant
997 expression because it contains an evaluated operator (in C99) or an
998 operator outside of sizeof returning an integer constant (in C90)
999 not permitted in constant expressions, or because it contains an
1000 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1001 set to true by callers before calling this function.) Return the
1002 folded expression. Function arguments have already been folded
1003 before calling this function, as have the contents of SAVE_EXPR,
1004 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1005 C_MAYBE_CONST_EXPR. */
1006
1007tree
1008c_fully_fold (tree expr, bool in_init, bool *maybe_const)
1009{
1010 tree ret;
c6418a4e 1011 tree eptype = NULL_TREE;
a75b1c71 1012 bool dummy = true;
1013 bool maybe_const_itself = true;
389dd41b 1014 location_t loc = EXPR_LOCATION (expr);
a75b1c71 1015
1016 /* This function is not relevant to C++ because C++ folds while
1017 parsing, and may need changes to be correct for C++ when C++
1018 stops folding while parsing. */
1019 if (c_dialect_cxx ())
1020 gcc_unreachable ();
1021
1022 if (!maybe_const)
1023 maybe_const = &dummy;
c6418a4e 1024 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
1025 {
1026 eptype = TREE_TYPE (expr);
1027 expr = TREE_OPERAND (expr, 0);
1028 }
a75b1c71 1029 ret = c_fully_fold_internal (expr, in_init, maybe_const,
1030 &maybe_const_itself);
c6418a4e 1031 if (eptype)
389dd41b 1032 ret = fold_convert_loc (loc, eptype, ret);
a75b1c71 1033 *maybe_const &= maybe_const_itself;
1034 return ret;
1035}
1036
1037/* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1038 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1039 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1040 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1041 both evaluated and unevaluated subexpressions while
1042 *MAYBE_CONST_ITSELF is carried from only evaluated
1043 subexpressions). */
1044
1045static tree
1046c_fully_fold_internal (tree expr, bool in_init, bool *maybe_const_operands,
1047 bool *maybe_const_itself)
1048{
1049 tree ret = expr;
1050 enum tree_code code = TREE_CODE (expr);
1051 enum tree_code_class kind = TREE_CODE_CLASS (code);
1052 location_t loc = EXPR_LOCATION (expr);
1053 tree op0, op1, op2, op3;
1054 tree orig_op0, orig_op1, orig_op2;
1055 bool op0_const = true, op1_const = true, op2_const = true;
1056 bool op0_const_self = true, op1_const_self = true, op2_const_self = true;
1057 bool nowarning = TREE_NO_WARNING (expr);
fc501191 1058 bool unused_p;
a75b1c71 1059
1060 /* This function is not relevant to C++ because C++ folds while
1061 parsing, and may need changes to be correct for C++ when C++
1062 stops folding while parsing. */
1063 if (c_dialect_cxx ())
1064 gcc_unreachable ();
1065
1066 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1067 anything else not counted as an expression cannot usefully be
1068 folded further at this point. */
1069 if (!IS_EXPR_CODE_CLASS (kind)
1070 || kind == tcc_statement
1071 || code == SAVE_EXPR)
1072 return expr;
1073
1074 /* Operands of variable-length expressions (function calls) have
1075 already been folded, as have __builtin_* function calls, and such
1076 expressions cannot occur in constant expressions. */
1077 if (kind == tcc_vl_exp)
1078 {
1079 *maybe_const_operands = false;
1080 ret = fold (expr);
1081 goto out;
1082 }
1083
1084 if (code == C_MAYBE_CONST_EXPR)
1085 {
1086 tree pre = C_MAYBE_CONST_EXPR_PRE (expr);
1087 tree inner = C_MAYBE_CONST_EXPR_EXPR (expr);
1088 if (C_MAYBE_CONST_EXPR_NON_CONST (expr))
1089 *maybe_const_operands = false;
1090 if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr))
1091 *maybe_const_itself = false;
1092 if (pre && !in_init)
1093 ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr), pre, inner);
1094 else
1095 ret = inner;
1096 goto out;
1097 }
1098
1099 /* Assignment, increment, decrement, function call and comma
1100 operators, and statement expressions, cannot occur in constant
1101 expressions if evaluated / outside of sizeof. (Function calls
1102 were handled above, though VA_ARG_EXPR is treated like a function
1103 call here, and statement expressions are handled through
1104 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1105 switch (code)
1106 {
1107 case MODIFY_EXPR:
1108 case PREDECREMENT_EXPR:
1109 case PREINCREMENT_EXPR:
1110 case POSTDECREMENT_EXPR:
1111 case POSTINCREMENT_EXPR:
1112 case COMPOUND_EXPR:
1113 *maybe_const_operands = false;
1114 break;
1115
1116 case VA_ARG_EXPR:
1117 case TARGET_EXPR:
1118 case BIND_EXPR:
1119 case OBJ_TYPE_REF:
1120 *maybe_const_operands = false;
1121 ret = fold (expr);
1122 goto out;
1123
1124 default:
1125 break;
1126 }
1127
1128 /* Fold individual tree codes as appropriate. */
1129 switch (code)
1130 {
1131 case COMPOUND_LITERAL_EXPR:
1132 /* Any non-constancy will have been marked in a containing
1133 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1134 goto out;
1135
1136 case COMPONENT_REF:
1137 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1138 op1 = TREE_OPERAND (expr, 1);
1139 op2 = TREE_OPERAND (expr, 2);
1140 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1141 maybe_const_itself);
f59e3889 1142 STRIP_TYPE_NOPS (op0);
a75b1c71 1143 if (op0 != orig_op0)
1144 ret = build3 (COMPONENT_REF, TREE_TYPE (expr), op0, op1, op2);
1145 if (ret != expr)
1146 {
1147 TREE_READONLY (ret) = TREE_READONLY (expr);
1148 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1149 }
1150 goto out;
1151
1152 case ARRAY_REF:
1153 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1154 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1155 op2 = TREE_OPERAND (expr, 2);
1156 op3 = TREE_OPERAND (expr, 3);
1157 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1158 maybe_const_itself);
f59e3889 1159 STRIP_TYPE_NOPS (op0);
a75b1c71 1160 op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands,
1161 maybe_const_itself);
f59e3889 1162 STRIP_TYPE_NOPS (op1);
a75b1c71 1163 op1 = decl_constant_value_for_optimization (op1);
1164 if (op0 != orig_op0 || op1 != orig_op1)
1165 ret = build4 (ARRAY_REF, TREE_TYPE (expr), op0, op1, op2, op3);
1166 if (ret != expr)
1167 {
1168 TREE_READONLY (ret) = TREE_READONLY (expr);
1169 TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr);
1170 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1171 }
1172 ret = fold (ret);
1173 goto out;
1174
1175 case COMPOUND_EXPR:
1176 case MODIFY_EXPR:
1177 case PREDECREMENT_EXPR:
1178 case PREINCREMENT_EXPR:
1179 case POSTDECREMENT_EXPR:
1180 case POSTINCREMENT_EXPR:
1181 case PLUS_EXPR:
1182 case MINUS_EXPR:
1183 case MULT_EXPR:
1184 case POINTER_PLUS_EXPR:
1185 case TRUNC_DIV_EXPR:
1186 case CEIL_DIV_EXPR:
1187 case FLOOR_DIV_EXPR:
1188 case TRUNC_MOD_EXPR:
1189 case RDIV_EXPR:
1190 case EXACT_DIV_EXPR:
1191 case LSHIFT_EXPR:
1192 case RSHIFT_EXPR:
1193 case BIT_IOR_EXPR:
1194 case BIT_XOR_EXPR:
1195 case BIT_AND_EXPR:
1196 case LT_EXPR:
1197 case LE_EXPR:
1198 case GT_EXPR:
1199 case GE_EXPR:
1200 case EQ_EXPR:
1201 case NE_EXPR:
1202 case COMPLEX_EXPR:
1203 case TRUTH_AND_EXPR:
1204 case TRUTH_OR_EXPR:
1205 case TRUTH_XOR_EXPR:
1206 case UNORDERED_EXPR:
1207 case ORDERED_EXPR:
1208 case UNLT_EXPR:
1209 case UNLE_EXPR:
1210 case UNGT_EXPR:
1211 case UNGE_EXPR:
1212 case UNEQ_EXPR:
1213 /* Binary operations evaluating both arguments (increment and
1214 decrement are binary internally in GCC). */
1215 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1216 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1217 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1218 maybe_const_itself);
f59e3889 1219 STRIP_TYPE_NOPS (op0);
a75b1c71 1220 if (code != MODIFY_EXPR
1221 && code != PREDECREMENT_EXPR
1222 && code != PREINCREMENT_EXPR
1223 && code != POSTDECREMENT_EXPR
1224 && code != POSTINCREMENT_EXPR)
1225 op0 = decl_constant_value_for_optimization (op0);
1226 /* The RHS of a MODIFY_EXPR was fully folded when building that
1227 expression for the sake of conversion warnings. */
1228 if (code != MODIFY_EXPR)
1229 op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands,
1230 maybe_const_itself);
f59e3889 1231 STRIP_TYPE_NOPS (op1);
a75b1c71 1232 op1 = decl_constant_value_for_optimization (op1);
1233 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
1234 ret = in_init
389dd41b 1235 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
1236 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
a75b1c71 1237 else
1238 ret = fold (expr);
672d914b 1239 if (TREE_OVERFLOW_P (ret)
1240 && !TREE_OVERFLOW_P (op0)
1241 && !TREE_OVERFLOW_P (op1))
1242 overflow_warning (EXPR_LOCATION (expr), ret);
a75b1c71 1243 goto out;
1244
1245 case INDIRECT_REF:
1246 case FIX_TRUNC_EXPR:
1247 case FLOAT_EXPR:
1248 CASE_CONVERT:
2b19dfe4 1249 case VIEW_CONVERT_EXPR:
a75b1c71 1250 case NON_LVALUE_EXPR:
1251 case NEGATE_EXPR:
1252 case BIT_NOT_EXPR:
1253 case TRUTH_NOT_EXPR:
1254 case ADDR_EXPR:
1255 case CONJ_EXPR:
1256 case REALPART_EXPR:
1257 case IMAGPART_EXPR:
1258 /* Unary operations. */
1259 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1260 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1261 maybe_const_itself);
f59e3889 1262 STRIP_TYPE_NOPS (op0);
a75b1c71 1263 if (code != ADDR_EXPR && code != REALPART_EXPR && code != IMAGPART_EXPR)
1264 op0 = decl_constant_value_for_optimization (op0);
1265 if (op0 != orig_op0 || in_init)
1266 ret = in_init
389dd41b 1267 ? fold_build1_initializer_loc (loc, code, TREE_TYPE (expr), op0)
1268 : fold_build1_loc (loc, code, TREE_TYPE (expr), op0);
a75b1c71 1269 else
1270 ret = fold (expr);
1271 if (code == INDIRECT_REF
1272 && ret != expr
1273 && TREE_CODE (ret) == INDIRECT_REF)
1274 {
1275 TREE_READONLY (ret) = TREE_READONLY (expr);
1276 TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr);
1277 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1278 }
672d914b 1279 switch (code)
1280 {
1281 case FIX_TRUNC_EXPR:
1282 case FLOAT_EXPR:
1283 CASE_CONVERT:
1284 /* Don't warn about explicit conversions. We will already
1285 have warned about suspect implicit conversions. */
1286 break;
1287
1288 default:
1289 if (TREE_OVERFLOW_P (ret) && !TREE_OVERFLOW_P (op0))
1290 overflow_warning (EXPR_LOCATION (expr), ret);
1291 break;
1292 }
a75b1c71 1293 goto out;
1294
1295 case TRUTH_ANDIF_EXPR:
1296 case TRUTH_ORIF_EXPR:
1297 /* Binary operations not necessarily evaluating both
1298 arguments. */
1299 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1300 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1301 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self);
f59e3889 1302 STRIP_TYPE_NOPS (op0);
672d914b 1303
1304 unused_p = (op0 == (code == TRUTH_ANDIF_EXPR
1305 ? truthvalue_false_node
1306 : truthvalue_true_node));
fc501191 1307 c_disable_warnings (unused_p);
a75b1c71 1308 op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self);
f59e3889 1309 STRIP_TYPE_NOPS (op1);
fc501191 1310 c_enable_warnings (unused_p);
672d914b 1311
a75b1c71 1312 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
1313 ret = in_init
389dd41b 1314 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
1315 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
a75b1c71 1316 else
1317 ret = fold (expr);
1318 *maybe_const_operands &= op0_const;
1319 *maybe_const_itself &= op0_const_self;
1320 if (!(flag_isoc99
1321 && op0_const
1322 && op0_const_self
1323 && (code == TRUTH_ANDIF_EXPR
1324 ? op0 == truthvalue_false_node
1325 : op0 == truthvalue_true_node)))
1326 *maybe_const_operands &= op1_const;
1327 if (!(op0_const
1328 && op0_const_self
1329 && (code == TRUTH_ANDIF_EXPR
1330 ? op0 == truthvalue_false_node
1331 : op0 == truthvalue_true_node)))
1332 *maybe_const_itself &= op1_const_self;
1333 goto out;
1334
1335 case COND_EXPR:
1336 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1337 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1338 orig_op2 = op2 = TREE_OPERAND (expr, 2);
1339 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self);
672d914b 1340
f59e3889 1341 STRIP_TYPE_NOPS (op0);
fc501191 1342 c_disable_warnings (op0 == truthvalue_false_node);
a75b1c71 1343 op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self);
f59e3889 1344 STRIP_TYPE_NOPS (op1);
fc501191 1345 c_enable_warnings (op0 == truthvalue_false_node);
672d914b 1346
fc501191 1347 c_disable_warnings (op0 == truthvalue_true_node);
a75b1c71 1348 op2 = c_fully_fold_internal (op2, in_init, &op2_const, &op2_const_self);
f59e3889 1349 STRIP_TYPE_NOPS (op2);
fc501191 1350 c_enable_warnings (op0 == truthvalue_true_node);
672d914b 1351
a75b1c71 1352 if (op0 != orig_op0 || op1 != orig_op1 || op2 != orig_op2)
389dd41b 1353 ret = fold_build3_loc (loc, code, TREE_TYPE (expr), op0, op1, op2);
a75b1c71 1354 else
1355 ret = fold (expr);
1356 *maybe_const_operands &= op0_const;
1357 *maybe_const_itself &= op0_const_self;
1358 if (!(flag_isoc99
1359 && op0_const
1360 && op0_const_self
1361 && op0 == truthvalue_false_node))
1362 *maybe_const_operands &= op1_const;
1363 if (!(op0_const
1364 && op0_const_self
1365 && op0 == truthvalue_false_node))
1366 *maybe_const_itself &= op1_const_self;
1367 if (!(flag_isoc99
1368 && op0_const
1369 && op0_const_self
1370 && op0 == truthvalue_true_node))
1371 *maybe_const_operands &= op2_const;
1372 if (!(op0_const
1373 && op0_const_self
1374 && op0 == truthvalue_true_node))
1375 *maybe_const_itself &= op2_const_self;
1376 goto out;
1377
c6418a4e 1378 case EXCESS_PRECISION_EXPR:
1379 /* Each case where an operand with excess precision may be
1380 encountered must remove the EXCESS_PRECISION_EXPR around
1381 inner operands and possibly put one around the whole
1382 expression or possibly convert to the semantic type (which
1383 c_fully_fold does); we cannot tell at this stage which is
1384 appropriate in any particular case. */
1385 gcc_unreachable ();
1386
a75b1c71 1387 default:
1388 /* Various codes may appear through folding built-in functions
1389 and their arguments. */
1390 goto out;
1391 }
1392
1393 out:
1394 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1395 have been done by this point, so remove them again. */
1396 nowarning |= TREE_NO_WARNING (ret);
1397 STRIP_TYPE_NOPS (ret);
1398 if (nowarning && !TREE_NO_WARNING (ret))
1399 {
1400 if (!CAN_HAVE_LOCATION_P (ret))
1401 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
1402 TREE_NO_WARNING (ret) = 1;
1403 }
1404 if (ret != expr)
1405 protected_set_expr_location (ret, loc);
1406 return ret;
1407}
1408
1409/* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1410 return EXP. Otherwise, return either EXP or its known constant
1411 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1412 Is the BLKmode test appropriate? */
1413
1414tree
1415decl_constant_value_for_optimization (tree exp)
1416{
1417 tree ret;
1418
1419 /* This function is only used by C, for c_fully_fold and other
1420 optimization, and may not be correct for C++. */
1421 if (c_dialect_cxx ())
1422 gcc_unreachable ();
1423
1424 if (!optimize
1425 || TREE_CODE (exp) != VAR_DECL
1426 || TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
1427 || DECL_MODE (exp) == BLKmode)
1428 return exp;
1429
1430 ret = decl_constant_value (exp);
1431 /* Avoid unwanted tree sharing between the initializer and current
1432 function's body where the tree can be modified e.g. by the
1433 gimplifier. */
1434 if (ret != exp && TREE_STATIC (exp))
1435 ret = unshare_expr (ret);
1436 return ret;
1437}
1438
2a1736ed 1439/* Print a warning if a constant expression had overflow in folding.
1440 Invoke this function on every expression that the language
1441 requires to be a constant expression.
1442 Note the ANSI C standard says it is erroneous for a
1443 constant expression to overflow. */
b2806639 1444
1445void
1cae46be 1446constant_expression_warning (tree value)
07317e69 1447{
48e1416a 1448 if (warn_overflow && pedantic
07317e69 1449 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1450 || TREE_CODE (value) == FIXED_CST
1451 || TREE_CODE (value) == VECTOR_CST
1452 || TREE_CODE (value) == COMPLEX_CST)
1453 && TREE_OVERFLOW (value))
21ca8540 1454 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
07317e69 1455}
1456
1457/* The same as above but print an unconditional error. */
1458void
1459constant_expression_error (tree value)
b2806639 1460{
837e1122 1461 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
9421ebb9 1462 || TREE_CODE (value) == FIXED_CST
886cfd4f 1463 || TREE_CODE (value) == VECTOR_CST
837e1122 1464 || TREE_CODE (value) == COMPLEX_CST)
07317e69 1465 && TREE_OVERFLOW (value))
1466 error ("overflow in constant expression");
2a1736ed 1467}
1468
f170d67f 1469/* Print a warning if an expression had overflow in folding and its
1470 operands hadn't.
1471
2a1736ed 1472 Invoke this function on every expression that
1473 (1) appears in the source code, and
f170d67f 1474 (2) is a constant expression that overflowed, and
2a1736ed 1475 (3) is not already checked by convert_and_check;
f170d67f 1476 however, do not invoke this function on operands of explicit casts
1477 or when the expression is the result of an operator and any operand
1478 already overflowed. */
2a1736ed 1479
1480void
e60a6f7b 1481overflow_warning (location_t loc, tree value)
2a1736ed 1482{
48d94ede 1483 if (c_inhibit_evaluation_warnings != 0)
1484 return;
f170d67f 1485
1486 switch (TREE_CODE (value))
886cfd4f 1487 {
f170d67f 1488 case INTEGER_CST:
e60a6f7b 1489 warning_at (loc, OPT_Woverflow, "integer overflow in expression");
f170d67f 1490 break;
48e1416a 1491
f170d67f 1492 case REAL_CST:
e60a6f7b 1493 warning_at (loc, OPT_Woverflow,
1494 "floating point overflow in expression");
f170d67f 1495 break;
48e1416a 1496
9421ebb9 1497 case FIXED_CST:
e60a6f7b 1498 warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
9421ebb9 1499 break;
1500
f170d67f 1501 case VECTOR_CST:
e60a6f7b 1502 warning_at (loc, OPT_Woverflow, "vector overflow in expression");
f170d67f 1503 break;
48e1416a 1504
f170d67f 1505 case COMPLEX_CST:
1506 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
e60a6f7b 1507 warning_at (loc, OPT_Woverflow,
1508 "complex integer overflow in expression");
f170d67f 1509 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
e60a6f7b 1510 warning_at (loc, OPT_Woverflow,
1511 "complex floating point overflow in expression");
f170d67f 1512 break;
1513
1514 default:
1515 break;
886cfd4f 1516 }
2a1736ed 1517}
1518
03033af4 1519/* Warn about uses of logical || / && operator in a context where it
1520 is likely that the bitwise equivalent was intended by the
1521 programmer. We have seen an expression in which CODE is a binary
9c20c4fc 1522 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1523 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
b13d1547 1524void
9c20c4fc 1525warn_logical_operator (location_t location, enum tree_code code, tree type,
48e1416a 1526 enum tree_code code_left, tree op_left,
03033af4 1527 enum tree_code ARG_UNUSED (code_right), tree op_right)
b13d1547 1528{
9c20c4fc 1529 int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
1530 int in0_p, in1_p, in_p;
1531 tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
1532 bool strict_overflow_p = false;
1533
03033af4 1534 if (code != TRUTH_ANDIF_EXPR
1535 && code != TRUTH_AND_EXPR
1536 && code != TRUTH_ORIF_EXPR
1537 && code != TRUTH_OR_EXPR)
1538 return;
1539
1540 /* Warn if &&/|| are being used in a context where it is
1541 likely that the bitwise equivalent was intended by the
1542 programmer. That is, an expression such as op && MASK
1543 where op should not be any boolean expression, nor a
1544 constant, and mask seems to be a non-boolean integer constant. */
1545 if (!truth_value_p (code_left)
1546 && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
1547 && !CONSTANT_CLASS_P (op_left)
1548 && !TREE_NO_WARNING (op_left)
1549 && TREE_CODE (op_right) == INTEGER_CST
1550 && !integer_zerop (op_right)
1551 && !integer_onep (op_right))
b13d1547 1552 {
9c20c4fc 1553 if (or_op)
03033af4 1554 warning_at (location, OPT_Wlogical_op, "logical %<or%>"
1555 " applied to non-boolean constant");
1556 else
1557 warning_at (location, OPT_Wlogical_op, "logical %<and%>"
1558 " applied to non-boolean constant");
1559 TREE_NO_WARNING (op_left) = true;
9c20c4fc 1560 return;
1561 }
1562
1563 /* We do not warn for constants because they are typical of macro
1564 expansions that test for features. */
1565 if (CONSTANT_CLASS_P (op_left) || CONSTANT_CLASS_P (op_right))
1566 return;
1567
1568 /* This warning only makes sense with logical operands. */
1569 if (!(truth_value_p (TREE_CODE (op_left))
1570 || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
1571 || !(truth_value_p (TREE_CODE (op_right))
1572 || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
1573 return;
1574
1575 lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
1576 rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
1577
1578 if (lhs && TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
1579 lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
1580
1581 if (rhs && TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
1582 rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
48e1416a 1583
9c20c4fc 1584 /* If this is an OR operation, invert both sides; we will invert
1585 again at the end. */
1586 if (or_op)
1587 in0_p = !in0_p, in1_p = !in1_p;
48e1416a 1588
9c20c4fc 1589 /* If both expressions are the same, if we can merge the ranges, and we
0969aa9b 1590 can build the range test, return it or it inverted. */
1591 if (lhs && rhs && operand_equal_p (lhs, rhs, 0)
9c20c4fc 1592 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
1593 in1_p, low1, high1)
389dd41b 1594 && 0 != (tem = build_range_check (UNKNOWN_LOCATION,
1595 type, lhs, in_p, low, high)))
9c20c4fc 1596 {
1597 if (TREE_CODE (tem) != INTEGER_CST)
1598 return;
1599
1600 if (or_op)
1601 warning_at (location, OPT_Wlogical_op,
1602 "logical %<or%> "
1603 "of collectively exhaustive tests is always true");
1604 else
1605 warning_at (location, OPT_Wlogical_op,
1606 "logical %<and%> "
1607 "of mutually exclusive tests is always false");
b13d1547 1608 }
1609}
1610
1611
bcf22371 1612/* Print a warning about casts that might indicate violation
1613 of strict aliasing rules if -Wstrict-aliasing is used and
1e31ff37 1614 strict aliasing mode is in effect. OTYPE is the original
1615 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
bcf22371 1616
e6fa0ea6 1617bool
1e31ff37 1618strict_aliasing_warning (tree otype, tree type, tree expr)
bcf22371 1619{
45bb3afb 1620 /* Strip pointer conversion chains and get to the correct original type. */
1621 STRIP_NOPS (expr);
1622 otype = TREE_TYPE (expr);
1623
f06537f2 1624 if (!(flag_strict_aliasing
1625 && POINTER_TYPE_P (type)
1626 && POINTER_TYPE_P (otype)
1627 && !VOID_TYPE_P (TREE_TYPE (type)))
1628 /* If the type we are casting to is a ref-all pointer
1629 dereferencing it is always valid. */
1630 || TYPE_REF_CAN_ALIAS_ALL (type))
e6fa0ea6 1631 return false;
1632
1633 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
bcf22371 1634 && (DECL_P (TREE_OPERAND (expr, 0))
e6fa0ea6 1635 || handled_component_p (TREE_OPERAND (expr, 0))))
bcf22371 1636 {
1637 /* Casting the address of an object to non void pointer. Warn
1638 if the cast breaks type based aliasing. */
e6fa0ea6 1639 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1640 {
1641 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1642 "might break strict-aliasing rules");
1643 return true;
1644 }
bcf22371 1645 else
1646 {
48e1416a 1647 /* warn_strict_aliasing >= 3. This includes the default (3).
e6fa0ea6 1648 Only warn if the cast is dereferenced immediately. */
32c2fdea 1649 alias_set_type set1 =
e6fa0ea6 1650 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
32c2fdea 1651 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
bcf22371 1652
62d823d0 1653 if (set1 != set2 && set2 != 0
1654 && (set1 == 0 || !alias_sets_conflict_p (set1, set2)))
e6fa0ea6 1655 {
1656 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1657 "pointer will break strict-aliasing rules");
1658 return true;
1659 }
1660 else if (warn_strict_aliasing == 2
879f881c 1661 && !alias_sets_must_conflict_p (set1, set2))
e6fa0ea6 1662 {
1663 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1664 "pointer might break strict-aliasing rules");
1665 return true;
1666 }
bcf22371 1667 }
1668 }
e6fa0ea6 1669 else
1670 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
1671 {
1672 /* At this level, warn for any conversions, even if an address is
1673 not taken in the same statement. This will likely produce many
1674 false positives, but could be useful to pinpoint problems that
1675 are not revealed at higher levels. */
32c2fdea 1676 alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
1677 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1678 if (!COMPLETE_TYPE_P (type)
879f881c 1679 || !alias_sets_must_conflict_p (set1, set2))
e6fa0ea6 1680 {
1681 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1682 "pointer might break strict-aliasing rules");
1683 return true;
1684 }
1685 }
1686
1687 return false;
bcf22371 1688}
1689
3f08e399 1690/* Warn for unlikely, improbable, or stupid DECL declarations
1691 of `main'. */
1692
1693void
1694check_main_parameter_types (tree decl)
1695{
d0af78c5 1696 function_args_iterator iter;
1697 tree type;
3f08e399 1698 int argct = 0;
1699
d0af78c5 1700 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl), type, iter)
1701 {
1702 /* XXX void_type_node belies the abstraction. */
1703 if (type == void_type_node || type == error_mark_node )
1704 break;
1705
1706 ++argct;
1707 switch (argct)
1708 {
1709 case 1:
1710 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1711 pedwarn (input_location, OPT_Wmain,
1712 "first argument of %q+D should be %<int%>", decl);
1713 break;
1714
1715 case 2:
1716 if (TREE_CODE (type) != POINTER_TYPE
1717 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1718 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1719 != char_type_node))
1720 pedwarn (input_location, OPT_Wmain,
1721 "second argument of %q+D should be %<char **%>", decl);
1722 break;
1723
1724 case 3:
1725 if (TREE_CODE (type) != POINTER_TYPE
1726 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1727 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1728 != char_type_node))
1729 pedwarn (input_location, OPT_Wmain,
1730 "third argument of %q+D should probably be "
1731 "%<char **%>", decl);
1732 break;
1733 }
1734 }
3f08e399 1735
1736 /* It is intentional that this message does not mention the third
1737 argument because it's only mentioned in an appendix of the
1738 standard. */
1739 if (argct > 0 && (argct < 2 || argct > 3))
d0af78c5 1740 pedwarn (input_location, OPT_Wmain,
1741 "%q+D takes only zero or two arguments", decl);
3f08e399 1742}
1743
ed7c4e62 1744/* True if pointers to distinct types T1 and T2 can be converted to
1745 each other without an explicit cast. Only returns true for opaque
1746 vector types. */
1747bool
1748vector_targets_convertible_p (const_tree t1, const_tree t2)
1749{
1750 if (TREE_CODE (t1) == VECTOR_TYPE && TREE_CODE (t2) == VECTOR_TYPE
8d125f7d 1751 && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
ed7c4e62 1752 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1753 return true;
1754
1755 return false;
1756}
1757
546c4794 1758/* True if vector types T1 and T2 can be converted to each other
1759 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1760 can only be converted with -flax-vector-conversions yet that is not
1761 in effect, emit a note telling the user about that option if such
1762 a note has not previously been emitted. */
1763bool
9f627b1a 1764vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
8b4b9810 1765{
546c4794 1766 static bool emitted_lax_note = false;
ae6db8ab 1767 bool convertible_lax;
1768
8d125f7d 1769 if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
ae6db8ab 1770 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1771 return true;
1772
1773 convertible_lax =
1774 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1775 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1776 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1777 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
1778 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
546c4794 1779
1780 if (!convertible_lax || flag_lax_vector_conversions)
1781 return convertible_lax;
1782
1783 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
29f51994 1784 && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
546c4794 1785 return true;
1786
1787 if (emit_lax_note && !emitted_lax_note)
1788 {
1789 emitted_lax_note = true;
5bcc316e 1790 inform (input_location, "use -flax-vector-conversions to permit "
546c4794 1791 "conversions between vectors with differing "
1792 "element types or numbers of subparts");
1793 }
1794
1795 return false;
8b4b9810 1796}
1797
7f506bca 1798/* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1799 to integral type. */
1800
1801static tree
1802c_common_get_narrower (tree op, int *unsignedp_ptr)
1803{
1804 op = get_narrower (op, unsignedp_ptr);
1805
1806 if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE
1807 && ENUM_IS_SCOPED (TREE_TYPE (op)))
1808 {
1809 /* C++0x scoped enumerations don't implicitly convert to integral
1810 type; if we stripped an explicit conversion to a larger type we
1811 need to replace it so common_type will still work. */
1812 tree type = (lang_hooks.types.type_for_size
1813 (TYPE_PRECISION (TREE_TYPE (op)),
1814 TYPE_UNSIGNED (TREE_TYPE (op))));
1815 op = fold_convert (type, op);
1816 }
1817 return op;
1818}
1819
2561cea2 1820/* This is a helper function of build_binary_op.
1821
1822 For certain operations if both args were extended from the same
1823 smaller type, do the arithmetic in that type and then extend.
1824
1825 BITWISE indicates a bitwise operation.
1826 For them, this optimization is safe only if
1827 both args are zero-extended or both are sign-extended.
1828 Otherwise, we might change the result.
1829 Eg, (short)-1 | (unsigned short)-1 is (int)-1
48e1416a 1830 but calculated in (unsigned short) it would be (unsigned short)-1.
2561cea2 1831*/
7f506bca 1832tree
1833shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
2561cea2 1834{
1835 int unsigned0, unsigned1;
1836 tree arg0, arg1;
1837 int uns;
1838 tree type;
1839
1840 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1841 excessive narrowing when we call get_narrower below. For
1842 example, suppose that OP0 is of unsigned int extended
1843 from signed char and that RESULT_TYPE is long long int.
1844 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1845 like
48e1416a 1846
2561cea2 1847 (long long int) (unsigned int) signed_char
1848
1849 which get_narrower would narrow down to
48e1416a 1850
2561cea2 1851 (unsigned int) signed char
48e1416a 1852
2561cea2 1853 If we do not cast OP0 first, get_narrower would return
1854 signed_char, which is inconsistent with the case of the
1855 explicit cast. */
1856 op0 = convert (result_type, op0);
1857 op1 = convert (result_type, op1);
1858
7f506bca 1859 arg0 = c_common_get_narrower (op0, &unsigned0);
1860 arg1 = c_common_get_narrower (op1, &unsigned1);
2561cea2 1861
1862 /* UNS is 1 if the operation to be done is an unsigned one. */
1863 uns = TYPE_UNSIGNED (result_type);
1864
1865 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1866 but it *requires* conversion to FINAL_TYPE. */
48e1416a 1867
2561cea2 1868 if ((TYPE_PRECISION (TREE_TYPE (op0))
1869 == TYPE_PRECISION (TREE_TYPE (arg0)))
1870 && TREE_TYPE (op0) != result_type)
1871 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1872 if ((TYPE_PRECISION (TREE_TYPE (op1))
1873 == TYPE_PRECISION (TREE_TYPE (arg1)))
1874 && TREE_TYPE (op1) != result_type)
1875 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
48e1416a 1876
2561cea2 1877 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
48e1416a 1878
2561cea2 1879 /* For bitwise operations, signedness of nominal type
1880 does not matter. Consider only how operands were extended. */
1881 if (bitwise)
1882 uns = unsigned0;
48e1416a 1883
2561cea2 1884 /* Note that in all three cases below we refrain from optimizing
1885 an unsigned operation on sign-extended args.
1886 That would not be valid. */
48e1416a 1887
2561cea2 1888 /* Both args variable: if both extended in same way
1889 from same width, do it in that width.
1890 Do it unsigned if args were zero-extended. */
1891 if ((TYPE_PRECISION (TREE_TYPE (arg0))
1892 < TYPE_PRECISION (result_type))
1893 && (TYPE_PRECISION (TREE_TYPE (arg1))
1894 == TYPE_PRECISION (TREE_TYPE (arg0)))
1895 && unsigned0 == unsigned1
1896 && (unsigned0 || !uns))
1897 return c_common_signed_or_unsigned_type
1898 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
1899
1900 else if (TREE_CODE (arg0) == INTEGER_CST
1901 && (unsigned1 || !uns)
1902 && (TYPE_PRECISION (TREE_TYPE (arg1))
1903 < TYPE_PRECISION (result_type))
1904 && (type
1905 = c_common_signed_or_unsigned_type (unsigned1,
1906 TREE_TYPE (arg1)))
1907 && !POINTER_TYPE_P (type)
1908 && int_fits_type_p (arg0, type))
1909 return type;
1910
1911 else if (TREE_CODE (arg1) == INTEGER_CST
1912 && (unsigned0 || !uns)
1913 && (TYPE_PRECISION (TREE_TYPE (arg0))
1914 < TYPE_PRECISION (result_type))
1915 && (type
1916 = c_common_signed_or_unsigned_type (unsigned0,
1917 TREE_TYPE (arg0)))
1918 && !POINTER_TYPE_P (type)
1919 && int_fits_type_p (arg1, type))
1920 return type;
1921
1922 return result_type;
1923}
1924
7dfa155b 1925/* Checks if expression EXPR of real/integer type cannot be converted
1926 to the real/integer type TYPE. Function returns true when:
1927 * EXPR is a constant which cannot be exactly converted to TYPE
1928 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1929 for EXPR type and TYPE being both integers or both real.
1930 * EXPR is not a constant of real type and TYPE is an integer.
1931 * EXPR is not a constant of integer type which cannot be
1932 exactly converted to real type.
1933 Function allows conversions between types of different signedness and
1934 does not return true in that case. Function can produce signedness
1935 warnings if PRODUCE_WARNS is true. */
1936bool
1937unsafe_conversion_p (tree type, tree expr, bool produce_warns)
d31d55f0 1938{
1939 bool give_warning = false;
27259707 1940 tree expr_type = TREE_TYPE (expr);
8637f1db 1941 location_t loc = EXPR_LOC_OR_HERE (expr);
d31d55f0 1942
7dfa155b 1943 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
5b16c152 1944 {
d31d55f0 1945 /* Warn for real constant that is not an exact integer converted
7dfa155b 1946 to integer type. */
27259707 1947 if (TREE_CODE (expr_type) == REAL_TYPE
7dfa155b 1948 && TREE_CODE (type) == INTEGER_TYPE)
1949 {
1950 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
1951 give_warning = true;
1952 }
da1fb07b 1953 /* Warn for an integer constant that does not fit into integer type. */
27259707 1954 else if (TREE_CODE (expr_type) == INTEGER_TYPE
7dfa155b 1955 && TREE_CODE (type) == INTEGER_TYPE
1956 && !int_fits_type_p (expr, type))
1957 {
1958 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
27259707 1959 && tree_int_cst_sgn (expr) < 0)
7dfa155b 1960 {
1961 if (produce_warns)
1962 warning_at (loc, OPT_Wsign_conversion, "negative integer"
1963 " implicitly converted to unsigned type");
1964 }
1965 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
1966 {
1967 if (produce_warns)
1968 warning_at (loc, OPT_Wsign_conversion, "conversion of unsigned"
1969 " constant value to negative integer");
1970 }
7ee0d227 1971 else
1972 give_warning = true;
7dfa155b 1973 }
d31d55f0 1974 else if (TREE_CODE (type) == REAL_TYPE)
7dfa155b 1975 {
1976 /* Warn for an integer constant that does not fit into real type. */
1977 if (TREE_CODE (expr_type) == INTEGER_TYPE)
1978 {
1979 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
1980 if (!exact_real_truncate (TYPE_MODE (type), &a))
1981 give_warning = true;
1982 }
1983 /* Warn for a real constant that does not fit into a smaller
1984 real type. */
1985 else if (TREE_CODE (expr_type) == REAL_TYPE
1986 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
1987 {
1988 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
1989 if (!exact_real_truncate (TYPE_MODE (type), &a))
1990 give_warning = true;
1991 }
1992 }
1993 }
1994 else
1995 {
d31d55f0 1996 /* Warn for real types converted to integer types. */
2561cea2 1997 if (TREE_CODE (expr_type) == REAL_TYPE
7dfa155b 1998 && TREE_CODE (type) == INTEGER_TYPE)
1999 give_warning = true;
d31d55f0 2000
2561cea2 2001 else if (TREE_CODE (expr_type) == INTEGER_TYPE
7dfa155b 2002 && TREE_CODE (type) == INTEGER_TYPE)
2003 {
69609004 2004 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
f9d856a4 2005 expr = get_unwidened (expr, 0);
2561cea2 2006 expr_type = TREE_TYPE (expr);
69609004 2007
2561cea2 2008 /* Don't warn for short y; short x = ((int)y & 0xff); */
48e1416a 2009 if (TREE_CODE (expr) == BIT_AND_EXPR
7dfa155b 2010 || TREE_CODE (expr) == BIT_IOR_EXPR
2561cea2 2011 || TREE_CODE (expr) == BIT_XOR_EXPR)
2012 {
27259707 2013 /* If both args were extended from a shortest type,
2014 use that type if that is safe. */
48e1416a 2015 expr_type = shorten_binary_op (expr_type,
2016 TREE_OPERAND (expr, 0),
2017 TREE_OPERAND (expr, 1),
2561cea2 2018 /* bitwise */1);
2019
2561cea2 2020 if (TREE_CODE (expr) == BIT_AND_EXPR)
2021 {
2022 tree op0 = TREE_OPERAND (expr, 0);
2023 tree op1 = TREE_OPERAND (expr, 1);
30de145b 2024 bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2025 bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2026
2027 /* If one of the operands is a non-negative constant
2028 that fits in the target type, then the type of the
2029 other operand does not matter. */
2561cea2 2030 if ((TREE_CODE (op0) == INTEGER_CST
2031 && int_fits_type_p (op0, c_common_signed_type (type))
2032 && int_fits_type_p (op0, c_common_unsigned_type (type)))
2033 || (TREE_CODE (op1) == INTEGER_CST
27259707 2034 && int_fits_type_p (op1, c_common_signed_type (type))
48e1416a 2035 && int_fits_type_p (op1,
27259707 2036 c_common_unsigned_type (type))))
7dfa155b 2037 return false;
30de145b 2038 /* If constant is unsigned and fits in the target
2039 type, then the result will also fit. */
2040 else if ((TREE_CODE (op0) == INTEGER_CST
48e1416a 2041 && unsigned0
30de145b 2042 && int_fits_type_p (op0, type))
2043 || (TREE_CODE (op1) == INTEGER_CST
2044 && unsigned1
2045 && int_fits_type_p (op1, type)))
7dfa155b 2046 return false;
2561cea2 2047 }
2048 }
7dfa155b 2049 /* Warn for integer types converted to smaller integer types. */
48e1416a 2050 if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
7ee0d227 2051 give_warning = true;
2052
2053 /* When they are the same width but different signedness,
2054 then the value may change. */
7dfa155b 2055 else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
2561cea2 2056 && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
7ee0d227 2057 /* Even when converted to a bigger type, if the type is
2058 unsigned but expr is signed, then negative values
2059 will be changed. */
7dfa155b 2060 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
2061 && produce_warns)
200dd99c 2062 warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT "
2063 "may change the sign of the result",
2064 type, expr_type);
7dfa155b 2065 }
d31d55f0 2066
2067 /* Warn for integer types converted to real types if and only if
7dfa155b 2068 all the range of values of the integer type cannot be
2069 represented by the real type. */
2561cea2 2070 else if (TREE_CODE (expr_type) == INTEGER_TYPE
7dfa155b 2071 && TREE_CODE (type) == REAL_TYPE)
2072 {
4c2cfa81 2073 tree type_low_bound, type_high_bound;
7dfa155b 2074 REAL_VALUE_TYPE real_low_bound, real_high_bound;
4c2cfa81 2075
2076 /* Don't warn about char y = 0xff; float x = (int) y; */
2077 expr = get_unwidened (expr, 0);
2078 expr_type = TREE_TYPE (expr);
2079
7dfa155b 2080 type_low_bound = TYPE_MIN_VALUE (expr_type);
2081 type_high_bound = TYPE_MAX_VALUE (expr_type);
2082 real_low_bound = real_value_from_int_cst (0, type_low_bound);
2083 real_high_bound = real_value_from_int_cst (0, type_high_bound);
d31d55f0 2084
7dfa155b 2085 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
2086 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
2087 give_warning = true;
2088 }
d31d55f0 2089
2090 /* Warn for real types converted to smaller real types. */
2561cea2 2091 else if (TREE_CODE (expr_type) == REAL_TYPE
7dfa155b 2092 && TREE_CODE (type) == REAL_TYPE
2093 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2094 give_warning = true;
2095 }
2096
2097 return give_warning;
2098}
2099
2100/* Warns if the conversion of EXPR to TYPE may alter a value.
2101 This is a helper function for warnings_for_convert_and_check. */
2102
2103static void
2104conversion_warning (tree type, tree expr)
2105{
2106 int i;
2107 const int expr_num_operands = TREE_OPERAND_LENGTH (expr);
2108 tree expr_type = TREE_TYPE (expr);
2109 location_t loc = EXPR_LOC_OR_HERE (expr);
d31d55f0 2110
7dfa155b 2111 if (!warn_conversion && !warn_sign_conversion)
2112 return;
d31d55f0 2113
7dfa155b 2114 /* If any operand is artificial, then this expression was generated
2115 by the compiler and we do not warn. */
2116 for (i = 0; i < expr_num_operands; i++)
2117 {
2118 tree op = TREE_OPERAND (expr, i);
2119 if (op && DECL_P (op) && DECL_ARTIFICIAL (op))
2120 return;
2121 }
2122
2123 switch (TREE_CODE (expr))
2124 {
2125 case EQ_EXPR:
2126 case NE_EXPR:
2127 case LE_EXPR:
2128 case GE_EXPR:
2129 case LT_EXPR:
2130 case GT_EXPR:
2131 case TRUTH_ANDIF_EXPR:
2132 case TRUTH_ORIF_EXPR:
2133 case TRUTH_AND_EXPR:
2134 case TRUTH_OR_EXPR:
2135 case TRUTH_XOR_EXPR:
2136 case TRUTH_NOT_EXPR:
2137 /* Conversion from boolean to a signed:1 bit-field (which only
2138 can hold the values 0 and -1) doesn't lose information - but
2139 it does change the value. */
2140 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
2141 warning_at (loc, OPT_Wconversion,
2142 "conversion to %qT from boolean expression", type);
2143 return;
2144
2145 case REAL_CST:
2146 case INTEGER_CST:
2147 if (unsafe_conversion_p (type, expr, true))
2148 warning_at (loc, OPT_Wconversion,
2149 "conversion to %qT alters %qT constant value",
2150 type, expr_type);
2151 return;
2152
2153 case COND_EXPR:
2154 {
2155 /* In case of COND_EXPR, if both operands are constants or
2156 COND_EXPR, then we do not care about the type of COND_EXPR,
2157 only about the conversion of each operand. */
2158 tree op1 = TREE_OPERAND (expr, 1);
2159 tree op2 = TREE_OPERAND (expr, 2);
2160
2161 if ((TREE_CODE (op1) == REAL_CST || TREE_CODE (op1) == INTEGER_CST
2162 || TREE_CODE (op1) == COND_EXPR)
2163 && (TREE_CODE (op2) == REAL_CST || TREE_CODE (op2) == INTEGER_CST
2164 || TREE_CODE (op2) == COND_EXPR))
2165 {
2166 conversion_warning (type, op1);
2167 conversion_warning (type, op2);
2168 return;
2169 }
2170 /* Fall through. */
2171 }
2172
2173 default: /* 'expr' is not a constant. */
2174 if (unsafe_conversion_p (type, expr, true))
2175 warning_at (loc, OPT_Wconversion,
200dd99c 2176 "conversion to %qT from %qT may alter its value",
2177 type, expr_type);
d31d55f0 2178 }
2179}
2180
59dd8856 2181/* Produce warnings after a conversion. RESULT is the result of
2182 converting EXPR to TYPE. This is a helper function for
2183 convert_and_check and cp_convert_and_check. */
2a1736ed 2184
59dd8856 2185void
2186warnings_for_convert_and_check (tree type, tree expr, tree result)
2a1736ed 2187{
da1fb07b 2188 if (TREE_CODE (expr) == INTEGER_CST
2189 && (TREE_CODE (type) == INTEGER_TYPE
2190 || TREE_CODE (type) == ENUMERAL_TYPE)
2191 && !int_fits_type_p (expr, type))
2192 {
d31d55f0 2193 /* Do not diagnose overflow in a constant expression merely
2194 because a conversion overflowed. */
da1fb07b 2195 if (TREE_OVERFLOW (result))
eddad94a 2196 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
2197
da1fb07b 2198 if (TYPE_UNSIGNED (type))
d31d55f0 2199 {
da1fb07b 2200 /* This detects cases like converting -129 or 256 to
2201 unsigned char. */
2202 if (!int_fits_type_p (expr, c_common_signed_type (type)))
2203 warning (OPT_Woverflow,
2204 "large integer implicitly truncated to unsigned type");
7ee0d227 2205 else
da1fb07b 2206 conversion_warning (type, expr);
2207 }
48e1416a 2208 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
e0913805 2209 warning (OPT_Woverflow,
2210 "overflow in implicit constant conversion");
2211 /* No warning for converting 0x80000000 to int. */
2212 else if (pedantic
2213 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
2214 || TYPE_PRECISION (TREE_TYPE (expr))
2215 != TYPE_PRECISION (type)))
2216 warning (OPT_Woverflow,
2217 "overflow in implicit constant conversion");
2218
7ee0d227 2219 else
e0913805 2220 conversion_warning (type, expr);
2a1736ed 2221 }
9421ebb9 2222 else if ((TREE_CODE (result) == INTEGER_CST
2223 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
da1fb07b 2224 warning (OPT_Woverflow,
2225 "overflow in implicit constant conversion");
7ee0d227 2226 else
da1fb07b 2227 conversion_warning (type, expr);
59dd8856 2228}
2229
2230
2231/* Convert EXPR to TYPE, warning about conversion problems with constants.
2232 Invoke this function on every expression that is converted implicitly,
2233 i.e. because of language rules and not because of an explicit cast. */
2234
2235tree
2236convert_and_check (tree type, tree expr)
2237{
2238 tree result;
c6418a4e 2239 tree expr_for_warning;
2240
2241 /* Convert from a value with possible excess precision rather than
2242 via the semantic type, but do not warn about values not fitting
2243 exactly in the semantic type. */
2244 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
2245 {
2246 tree orig_type = TREE_TYPE (expr);
2247 expr = TREE_OPERAND (expr, 0);
2248 expr_for_warning = convert (orig_type, expr);
2249 if (orig_type == type)
2250 return expr_for_warning;
2251 }
2252 else
2253 expr_for_warning = expr;
59dd8856 2254
2255 if (TREE_TYPE (expr) == type)
2256 return expr;
48e1416a 2257
59dd8856 2258 result = convert (type, expr);
2259
48d94ede 2260 if (c_inhibit_evaluation_warnings == 0
2261 && !TREE_OVERFLOW_P (expr)
2262 && result != error_mark_node)
c6418a4e 2263 warnings_for_convert_and_check (type, expr_for_warning, result);
59dd8856 2264
da1fb07b 2265 return result;
b2806639 2266}
2267\f
4e91a871 2268/* A node in a list that describes references to variables (EXPR), which are
2269 either read accesses if WRITER is zero, or write accesses, in which case
2270 WRITER is the parent of EXPR. */
2271struct tlist
2272{
2273 struct tlist *next;
2274 tree expr, writer;
2275};
2276
2277/* Used to implement a cache the results of a call to verify_tree. We only
2278 use this for SAVE_EXPRs. */
2279struct tlist_cache
2280{
2281 struct tlist_cache *next;
2282 struct tlist *cache_before_sp;
2283 struct tlist *cache_after_sp;
2284 tree expr;
481c6ce6 2285};
2286
4e91a871 2287/* Obstack to use when allocating tlist structures, and corresponding
2288 firstobj. */
2289static struct obstack tlist_obstack;
2290static char *tlist_firstobj = 0;
2291
2292/* Keep track of the identifiers we've warned about, so we can avoid duplicate
2293 warnings. */
2294static struct tlist *warned_ids;
2295/* SAVE_EXPRs need special treatment. We process them only once and then
2296 cache the results. */
2297static struct tlist_cache *save_expr_cache;
2298
1cae46be 2299static void add_tlist (struct tlist **, struct tlist *, tree, int);
2300static void merge_tlist (struct tlist **, struct tlist *, int);
2301static void verify_tree (tree, struct tlist **, struct tlist **, tree);
2302static int warning_candidate_p (tree);
79973b57 2303static bool candidate_equal_p (const_tree, const_tree);
1cae46be 2304static void warn_for_collisions (struct tlist *);
2305static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
2306static struct tlist *new_tlist (struct tlist *, tree, tree);
481c6ce6 2307
4e91a871 2308/* Create a new struct tlist and fill in its fields. */
2309static struct tlist *
1cae46be 2310new_tlist (struct tlist *next, tree t, tree writer)
4e91a871 2311{
2312 struct tlist *l;
9318f22c 2313 l = XOBNEW (&tlist_obstack, struct tlist);
4e91a871 2314 l->next = next;
2315 l->expr = t;
2316 l->writer = writer;
2317 return l;
2318}
2319
2320/* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2321 is nonnull, we ignore any node we find which has a writer equal to it. */
2322
2323static void
1cae46be 2324add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
4e91a871 2325{
2326 while (add)
2327 {
2328 struct tlist *next = add->next;
84166705 2329 if (!copy)
4e91a871 2330 add->next = *to;
79973b57 2331 if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
4e91a871 2332 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
2333 add = next;
2334 }
2335}
2336
2337/* Merge the nodes of ADD into TO. This merging process is done so that for
2338 each variable that already exists in TO, no new node is added; however if
2339 there is a write access recorded in ADD, and an occurrence on TO is only
2340 a read access, then the occurrence in TO will be modified to record the
2341 write. */
481c6ce6 2342
2343static void
1cae46be 2344merge_tlist (struct tlist **to, struct tlist *add, int copy)
4e91a871 2345{
2346 struct tlist **end = to;
2347
2348 while (*end)
2349 end = &(*end)->next;
2350
2351 while (add)
2352 {
2353 int found = 0;
2354 struct tlist *tmp2;
2355 struct tlist *next = add->next;
2356
2357 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
79973b57 2358 if (candidate_equal_p (tmp2->expr, add->expr))
4e91a871 2359 {
2360 found = 1;
84166705 2361 if (!tmp2->writer)
4e91a871 2362 tmp2->writer = add->writer;
2363 }
84166705 2364 if (!found)
4e91a871 2365 {
2366 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
2367 end = &(*end)->next;
2368 *end = 0;
2369 }
2370 add = next;
2371 }
2372}
2373
2374/* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2375 references in list LIST conflict with it, excluding reads if ONLY writers
2376 is nonzero. */
2377
2378static void
1cae46be 2379warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
2380 int only_writes)
4e91a871 2381{
2382 struct tlist *tmp;
2383
2384 /* Avoid duplicate warnings. */
2385 for (tmp = warned_ids; tmp; tmp = tmp->next)
79973b57 2386 if (candidate_equal_p (tmp->expr, written))
4e91a871 2387 return;
2388
2389 while (list)
2390 {
79973b57 2391 if (candidate_equal_p (list->expr, written)
2392 && !candidate_equal_p (list->writer, writer)
2393 && (!only_writes || list->writer))
4e91a871 2394 {
2395 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
8637f1db 2396 warning_at (EXPR_LOC_OR_HERE (writer),
6513b50d 2397 OPT_Wsequence_point, "operation on %qE may be undefined",
2398 list->expr);
4e91a871 2399 }
2400 list = list->next;
2401 }
2402}
2403
2404/* Given a list LIST of references to variables, find whether any of these
2405 can cause conflicts due to missing sequence points. */
2406
2407static void
1cae46be 2408warn_for_collisions (struct tlist *list)
4e91a871 2409{
2410 struct tlist *tmp;
1cae46be 2411
4e91a871 2412 for (tmp = list; tmp; tmp = tmp->next)
2413 {
2414 if (tmp->writer)
2415 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
2416 }
2417}
2418
734c98be 2419/* Return nonzero if X is a tree that can be verified by the sequence point
4e91a871 2420 warnings. */
2421static int
1cae46be 2422warning_candidate_p (tree x)
481c6ce6 2423{
6ef8d12f 2424 if (DECL_P (x) && DECL_ARTIFICIAL (x))
2425 return 0;
2426
027fc6ef 2427 if (TREE_CODE (x) == BLOCK)
2428 return 0;
2429
6ef8d12f 2430 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
79973b57 2431 (lvalue_p) crash on TRY/CATCH. */
6ef8d12f 2432 if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x)))
2433 return 0;
2434
2435 if (!lvalue_p (x))
2436 return 0;
2437
2438 /* No point to track non-const calls, they will never satisfy
2439 operand_equal_p. */
2440 if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0)
2441 return 0;
2442
2443 if (TREE_CODE (x) == STRING_CST)
2444 return 0;
2445
2446 return 1;
79973b57 2447}
2448
2449/* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2450static bool
2451candidate_equal_p (const_tree x, const_tree y)
2452{
2453 return (x == y) || (x && y && operand_equal_p (x, y, 0));
4e91a871 2454}
481c6ce6 2455
4e91a871 2456/* Walk the tree X, and record accesses to variables. If X is written by the
2457 parent tree, WRITER is the parent.
2458 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2459 expression or its only operand forces a sequence point, then everything up
2460 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2461 in PNO_SP.
2462 Once we return, we will have emitted warnings if any subexpression before
2463 such a sequence point could be undefined. On a higher level, however, the
2464 sequence point may not be relevant, and we'll merge the two lists.
2465
2466 Example: (b++, a) + b;
2467 The call that processes the COMPOUND_EXPR will store the increment of B
2468 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2469 processes the PLUS_EXPR will need to merge the two lists so that
2470 eventually, all accesses end up on the same list (and we'll warn about the
2471 unordered subexpressions b++ and b.
2472
2473 A note on merging. If we modify the former example so that our expression
2474 becomes
2475 (b++, b) + a
2476 care must be taken not simply to add all three expressions into the final
2477 PNO_SP list. The function merge_tlist takes care of that by merging the
2478 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2479 way, so that no more than one access to B is recorded. */
481c6ce6 2480
4e91a871 2481static void
1cae46be 2482verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2483 tree writer)
4e91a871 2484{
2485 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
2486 enum tree_code code;
ce45a448 2487 enum tree_code_class cl;
481c6ce6 2488
e5b75768 2489 /* X may be NULL if it is the operand of an empty statement expression
2490 ({ }). */
2491 if (x == NULL)
2492 return;
2493
4e91a871 2494 restart:
2495 code = TREE_CODE (x);
e916c70c 2496 cl = TREE_CODE_CLASS (code);
481c6ce6 2497
4e91a871 2498 if (warning_candidate_p (x))
79973b57 2499 *pno_sp = new_tlist (*pno_sp, x, writer);
4e91a871 2500
2501 switch (code)
2502 {
67b28e3e 2503 case CONSTRUCTOR:
2504 return;
2505
4e91a871 2506 case COMPOUND_EXPR:
2507 case TRUTH_ANDIF_EXPR:
2508 case TRUTH_ORIF_EXPR:
2509 tmp_before = tmp_nosp = tmp_list3 = 0;
2510 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2511 warn_for_collisions (tmp_nosp);
2512 merge_tlist (pbefore_sp, tmp_before, 0);
2513 merge_tlist (pbefore_sp, tmp_nosp, 0);
2514 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
2515 merge_tlist (pbefore_sp, tmp_list3, 0);
2516 return;
2517
2518 case COND_EXPR:
2519 tmp_before = tmp_list2 = 0;
2520 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
2521 warn_for_collisions (tmp_list2);
2522 merge_tlist (pbefore_sp, tmp_before, 0);
2523 merge_tlist (pbefore_sp, tmp_list2, 1);
2524
2525 tmp_list3 = tmp_nosp = 0;
2526 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
2527 warn_for_collisions (tmp_nosp);
2528 merge_tlist (pbefore_sp, tmp_list3, 0);
2529
2530 tmp_list3 = tmp_list2 = 0;
2531 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
2532 warn_for_collisions (tmp_list2);
2533 merge_tlist (pbefore_sp, tmp_list3, 0);
2534 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2535 two first, to avoid warning for (a ? b++ : b++). */
2536 merge_tlist (&tmp_nosp, tmp_list2, 0);
2537 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2538 return;
2539
481c6ce6 2540 case PREDECREMENT_EXPR:
2541 case PREINCREMENT_EXPR:
2542 case POSTDECREMENT_EXPR:
2543 case POSTINCREMENT_EXPR:
4e91a871 2544 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
2545 return;
2546
2547 case MODIFY_EXPR:
2548 tmp_before = tmp_nosp = tmp_list3 = 0;
2549 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
2550 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
2551 /* Expressions inside the LHS are not ordered wrt. the sequence points
2552 in the RHS. Example:
2553 *a = (a++, 2)
2554 Despite the fact that the modification of "a" is in the before_sp
2555 list (tmp_before), it conflicts with the use of "a" in the LHS.
2556 We can handle this by adding the contents of tmp_list3
2557 to those of tmp_before, and redoing the collision warnings for that
2558 list. */
2559 add_tlist (&tmp_before, tmp_list3, x, 1);
2560 warn_for_collisions (tmp_before);
2561 /* Exclude the LHS itself here; we first have to merge it into the
2562 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2563 didn't exclude the LHS, we'd get it twice, once as a read and once
2564 as a write. */
2565 add_tlist (pno_sp, tmp_list3, x, 0);
2566 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
2567
2568 merge_tlist (pbefore_sp, tmp_before, 0);
2569 if (warning_candidate_p (TREE_OPERAND (x, 0)))
2570 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
2571 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
2572 return;
481c6ce6 2573
2574 case CALL_EXPR:
4e91a871 2575 /* We need to warn about conflicts among arguments and conflicts between
2576 args and the function address. Side effects of the function address,
2577 however, are not ordered by the sequence point of the call. */
c2f47e15 2578 {
2579 call_expr_arg_iterator iter;
2580 tree arg;
48e1416a 2581 tmp_before = tmp_nosp = 0;
c2f47e15 2582 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
2583 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
2584 {
2585 tmp_list2 = tmp_list3 = 0;
2586 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
2587 merge_tlist (&tmp_list3, tmp_list2, 0);
2588 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
2589 }
2590 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
2591 warn_for_collisions (tmp_before);
2592 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
2593 return;
2594 }
481c6ce6 2595
2596 case TREE_LIST:
2597 /* Scan all the list, e.g. indices of multi dimensional array. */
2598 while (x)
2599 {
4e91a871 2600 tmp_before = tmp_nosp = 0;
2601 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
2602 merge_tlist (&tmp_nosp, tmp_before, 0);
2603 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
481c6ce6 2604 x = TREE_CHAIN (x);
2605 }
4e91a871 2606 return;
481c6ce6 2607
4e91a871 2608 case SAVE_EXPR:
2609 {
2610 struct tlist_cache *t;
2611 for (t = save_expr_cache; t; t = t->next)
79973b57 2612 if (candidate_equal_p (t->expr, x))
4e91a871 2613 break;
481c6ce6 2614
84166705 2615 if (!t)
481c6ce6 2616 {
9318f22c 2617 t = XOBNEW (&tlist_obstack, struct tlist_cache);
4e91a871 2618 t->next = save_expr_cache;
2619 t->expr = x;
2620 save_expr_cache = t;
2621
2622 tmp_before = tmp_nosp = 0;
2623 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2624 warn_for_collisions (tmp_nosp);
2625
2626 tmp_list3 = 0;
2627 while (tmp_nosp)
2628 {
2629 struct tlist *t = tmp_nosp;
2630 tmp_nosp = t->next;
2631 merge_tlist (&tmp_list3, t, 0);
2632 }
2633 t->cache_before_sp = tmp_before;
2634 t->cache_after_sp = tmp_list3;
481c6ce6 2635 }
4e91a871 2636 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
2637 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
2638 return;
2639 }
481c6ce6 2640
012916cb 2641 case ADDR_EXPR:
2642 x = TREE_OPERAND (x, 0);
2643 if (DECL_P (x))
2644 return;
2645 writer = 0;
2646 goto restart;
2647
ce45a448 2648 default:
2649 /* For other expressions, simply recurse on their operands.
a0c938f0 2650 Manual tail recursion for unary expressions.
ce45a448 2651 Other non-expressions need not be processed. */
2652 if (cl == tcc_unary)
2653 {
ce45a448 2654 x = TREE_OPERAND (x, 0);
2655 writer = 0;
2656 goto restart;
2657 }
2658 else if (IS_EXPR_CODE_CLASS (cl))
2659 {
2660 int lp;
c2f47e15 2661 int max = TREE_OPERAND_LENGTH (x);
ce45a448 2662 for (lp = 0; lp < max; lp++)
2663 {
2664 tmp_before = tmp_nosp = 0;
2665 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
2666 merge_tlist (&tmp_nosp, tmp_before, 0);
2667 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2668 }
2669 }
2670 return;
481c6ce6 2671 }
481c6ce6 2672}
2673
974e2c0c 2674/* Try to warn for undefined behavior in EXPR due to missing sequence
481c6ce6 2675 points. */
2676
4b987fac 2677DEBUG_FUNCTION void
1cae46be 2678verify_sequence_points (tree expr)
481c6ce6 2679{
4e91a871 2680 struct tlist *before_sp = 0, *after_sp = 0;
481c6ce6 2681
4e91a871 2682 warned_ids = 0;
2683 save_expr_cache = 0;
2684 if (tlist_firstobj == 0)
481c6ce6 2685 {
4e91a871 2686 gcc_obstack_init (&tlist_obstack);
4fd61bc6 2687 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
481c6ce6 2688 }
2689
4e91a871 2690 verify_tree (expr, &before_sp, &after_sp, 0);
2691 warn_for_collisions (after_sp);
2692 obstack_free (&tlist_obstack, tlist_firstobj);
481c6ce6 2693}
b0fc3e72 2694\f
2695/* Validate the expression after `case' and apply default promotions. */
2696
2ca392fd 2697static tree
1cae46be 2698check_case_value (tree value)
b0fc3e72 2699{
2700 if (value == NULL_TREE)
2701 return value;
2702
b96dc121 2703 if (TREE_CODE (value) == INTEGER_CST)
2704 /* Promote char or short to int. */
2705 value = perform_integral_promotions (value);
2706 else if (value != error_mark_node)
b0fc3e72 2707 {
2708 error ("case label does not reduce to an integer constant");
2709 value = error_mark_node;
2710 }
b0fc3e72 2711
6433f1c2 2712 constant_expression_warning (value);
2713
b0fc3e72 2714 return value;
2715}
2716\f
2ca392fd 2717/* See if the case values LOW and HIGH are in the range of the original
5c9dae64 2718 type (i.e. before the default conversion to int) of the switch testing
2ca392fd 2719 expression.
2720 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
91275768 2721 the type before promoting it. CASE_LOW_P is a pointer to the lower
2ca392fd 2722 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2723 if the case is not a case range.
2724 The caller has to make sure that we are not called with NULL for
5c9dae64 2725 CASE_LOW_P (i.e. the default case).
442e3cb9 2726 Returns true if the case label is in range of ORIG_TYPE (saturated or
2ca392fd 2727 untouched) or false if the label is out of range. */
2728
2729static bool
2730check_case_bounds (tree type, tree orig_type,
2731 tree *case_low_p, tree *case_high_p)
2732{
2733 tree min_value, max_value;
2734 tree case_low = *case_low_p;
2735 tree case_high = case_high_p ? *case_high_p : case_low;
2736
2737 /* If there was a problem with the original type, do nothing. */
2738 if (orig_type == error_mark_node)
2739 return true;
2740
2741 min_value = TYPE_MIN_VALUE (orig_type);
2742 max_value = TYPE_MAX_VALUE (orig_type);
2743
2744 /* Case label is less than minimum for type. */
2745 if (tree_int_cst_compare (case_low, min_value) < 0
2746 && tree_int_cst_compare (case_high, min_value) < 0)
2747 {
c3ceba8e 2748 warning (0, "case label value is less than minimum value for type");
2ca392fd 2749 return false;
2750 }
b27ac6b5 2751
2ca392fd 2752 /* Case value is greater than maximum for type. */
2753 if (tree_int_cst_compare (case_low, max_value) > 0
2754 && tree_int_cst_compare (case_high, max_value) > 0)
2755 {
c3ceba8e 2756 warning (0, "case label value exceeds maximum value for type");
2ca392fd 2757 return false;
2758 }
2759
2760 /* Saturate lower case label value to minimum. */
2761 if (tree_int_cst_compare (case_high, min_value) >= 0
2762 && tree_int_cst_compare (case_low, min_value) < 0)
2763 {
c3ceba8e 2764 warning (0, "lower value in case label range"
2ca392fd 2765 " less than minimum value for type");
2766 case_low = min_value;
2767 }
b27ac6b5 2768
2ca392fd 2769 /* Saturate upper case label value to maximum. */
2770 if (tree_int_cst_compare (case_low, max_value) <= 0
2771 && tree_int_cst_compare (case_high, max_value) > 0)
2772 {
c3ceba8e 2773 warning (0, "upper value in case label range"
2ca392fd 2774 " exceeds maximum value for type");
2775 case_high = max_value;
2776 }
2777
2778 if (*case_low_p != case_low)
2779 *case_low_p = convert (type, case_low);
2780 if (case_high_p && *case_high_p != case_high)
2781 *case_high_p = convert (type, case_high);
2782
2783 return true;
2784}
2785\f
b0fc3e72 2786/* Return an integer type with BITS bits of precision,
2787 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2788
2789tree
1cae46be 2790c_common_type_for_size (unsigned int bits, int unsignedp)
b0fc3e72 2791{
46375237 2792 if (bits == TYPE_PRECISION (integer_type_node))
2793 return unsignedp ? unsigned_type_node : integer_type_node;
2794
bacde65a 2795 if (bits == TYPE_PRECISION (signed_char_type_node))
b0fc3e72 2796 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2797
bacde65a 2798 if (bits == TYPE_PRECISION (short_integer_type_node))
b0fc3e72 2799 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2800
bacde65a 2801 if (bits == TYPE_PRECISION (long_integer_type_node))
b0fc3e72 2802 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2803
bacde65a 2804 if (bits == TYPE_PRECISION (long_long_integer_type_node))
b0fc3e72 2805 return (unsignedp ? long_long_unsigned_type_node
2806 : long_long_integer_type_node);
2807
6388cfe2 2808 if (int128_integer_type_node
2809 && bits == TYPE_PRECISION (int128_integer_type_node))
2810 return (unsignedp ? int128_unsigned_type_node
2811 : int128_integer_type_node);
2812
f57fa2ea 2813 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
2814 return (unsignedp ? widest_unsigned_literal_type_node
2815 : widest_integer_literal_type_node);
2816
bacde65a 2817 if (bits <= TYPE_PRECISION (intQI_type_node))
2818 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2819
2820 if (bits <= TYPE_PRECISION (intHI_type_node))
2821 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2822
2823 if (bits <= TYPE_PRECISION (intSI_type_node))
2824 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2825
2826 if (bits <= TYPE_PRECISION (intDI_type_node))
2827 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2828
b0fc3e72 2829 return 0;
2830}
2831
9421ebb9 2832/* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2833 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2834 and saturating if SATP is nonzero, otherwise not saturating. */
2835
2836tree
2837c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
2838 int unsignedp, int satp)
2839{
2840 enum machine_mode mode;
2841 if (ibit == 0)
2842 mode = unsignedp ? UQQmode : QQmode;
2843 else
2844 mode = unsignedp ? UHAmode : HAmode;
2845
2846 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
2847 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
2848 break;
2849
2850 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
2851 {
2852 sorry ("GCC cannot support operators with integer types and "
2853 "fixed-point types that have too many integral and "
2854 "fractional bits together");
2855 return 0;
2856 }
2857
2858 return c_common_type_for_mode (mode, satp);
2859}
2860
5b247e9f 2861/* Used for communication between c_common_type_for_mode and
2862 c_register_builtin_type. */
2863static GTY(()) tree registered_builtin_types;
2864
b0fc3e72 2865/* Return a data type that has machine mode MODE.
2866 If the mode is an integer,
9421ebb9 2867 then UNSIGNEDP selects between signed and unsigned types.
2868 If the mode is a fixed-point mode,
2869 then UNSIGNEDP selects between saturating and nonsaturating types. */
b0fc3e72 2870
2871tree
1cae46be 2872c_common_type_for_mode (enum machine_mode mode, int unsignedp)
b0fc3e72 2873{
5b247e9f 2874 tree t;
2875
46375237 2876 if (mode == TYPE_MODE (integer_type_node))
2877 return unsignedp ? unsigned_type_node : integer_type_node;
2878
b0fc3e72 2879 if (mode == TYPE_MODE (signed_char_type_node))
2880 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2881
2882 if (mode == TYPE_MODE (short_integer_type_node))
2883 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2884
b0fc3e72 2885 if (mode == TYPE_MODE (long_integer_type_node))
2886 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2887
2888 if (mode == TYPE_MODE (long_long_integer_type_node))
2889 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2890
6388cfe2 2891 if (int128_integer_type_node
2892 && mode == TYPE_MODE (int128_integer_type_node))
2893 return unsignedp ? int128_unsigned_type_node : int128_integer_type_node;
2894
f57fa2ea 2895 if (mode == TYPE_MODE (widest_integer_literal_type_node))
44e9fa65 2896 return unsignedp ? widest_unsigned_literal_type_node
4ee9c684 2897 : widest_integer_literal_type_node;
f57fa2ea 2898
88ae7f04 2899 if (mode == QImode)
bacde65a 2900 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2901
88ae7f04 2902 if (mode == HImode)
bacde65a 2903 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2904
88ae7f04 2905 if (mode == SImode)
bacde65a 2906 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2907
88ae7f04 2908 if (mode == DImode)
bacde65a 2909 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2910
cc1cc1c7 2911#if HOST_BITS_PER_WIDE_INT >= 64
6274009c 2912 if (mode == TYPE_MODE (intTI_type_node))
2913 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
cc1cc1c7 2914#endif
6274009c 2915
b0fc3e72 2916 if (mode == TYPE_MODE (float_type_node))
2917 return float_type_node;
2918
2919 if (mode == TYPE_MODE (double_type_node))
2920 return double_type_node;
2921
2922 if (mode == TYPE_MODE (long_double_type_node))
2923 return long_double_type_node;
2924
545c2bde 2925 if (mode == TYPE_MODE (void_type_node))
2926 return void_type_node;
b27ac6b5 2927
b0fc3e72 2928 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
61b9b73c 2929 return (unsignedp
2930 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2931 : make_signed_type (GET_MODE_PRECISION (mode)));
b0fc3e72 2932
2933 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
61b9b73c 2934 return (unsignedp
2935 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2936 : make_signed_type (GET_MODE_PRECISION (mode)));
b0fc3e72 2937
0dfc45b5 2938 if (COMPLEX_MODE_P (mode))
2939 {
2940 enum machine_mode inner_mode;
2941 tree inner_type;
2942
2943 if (mode == TYPE_MODE (complex_float_type_node))
2944 return complex_float_type_node;
2945 if (mode == TYPE_MODE (complex_double_type_node))
2946 return complex_double_type_node;
2947 if (mode == TYPE_MODE (complex_long_double_type_node))
2948 return complex_long_double_type_node;
2949
2950 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
2951 return complex_integer_type_node;
2952
2953 inner_mode = GET_MODE_INNER (mode);
2954 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2955 if (inner_type != NULL_TREE)
2956 return build_complex_type (inner_type);
2957 }
2958 else if (VECTOR_MODE_P (mode))
4917c376 2959 {
2960 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2961 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2962 if (inner_type != NULL_TREE)
2963 return build_vector_type_for_mode (inner_type, mode);
88ae7f04 2964 }
e2ea7e3a 2965
c4503c0a 2966 if (mode == TYPE_MODE (dfloat32_type_node))
2967 return dfloat32_type_node;
2968 if (mode == TYPE_MODE (dfloat64_type_node))
2969 return dfloat64_type_node;
2970 if (mode == TYPE_MODE (dfloat128_type_node))
2971 return dfloat128_type_node;
2972
9421ebb9 2973 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
2974 {
2975 if (mode == TYPE_MODE (short_fract_type_node))
2976 return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
2977 if (mode == TYPE_MODE (fract_type_node))
2978 return unsignedp ? sat_fract_type_node : fract_type_node;
2979 if (mode == TYPE_MODE (long_fract_type_node))
2980 return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
2981 if (mode == TYPE_MODE (long_long_fract_type_node))
2982 return unsignedp ? sat_long_long_fract_type_node
2983 : long_long_fract_type_node;
2984
2985 if (mode == TYPE_MODE (unsigned_short_fract_type_node))
2986 return unsignedp ? sat_unsigned_short_fract_type_node
2987 : unsigned_short_fract_type_node;
2988 if (mode == TYPE_MODE (unsigned_fract_type_node))
2989 return unsignedp ? sat_unsigned_fract_type_node
2990 : unsigned_fract_type_node;
2991 if (mode == TYPE_MODE (unsigned_long_fract_type_node))
2992 return unsignedp ? sat_unsigned_long_fract_type_node
2993 : unsigned_long_fract_type_node;
2994 if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
2995 return unsignedp ? sat_unsigned_long_long_fract_type_node
2996 : unsigned_long_long_fract_type_node;
2997
2998 if (mode == TYPE_MODE (short_accum_type_node))
2999 return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
3000 if (mode == TYPE_MODE (accum_type_node))
3001 return unsignedp ? sat_accum_type_node : accum_type_node;
3002 if (mode == TYPE_MODE (long_accum_type_node))
3003 return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
3004 if (mode == TYPE_MODE (long_long_accum_type_node))
3005 return unsignedp ? sat_long_long_accum_type_node
3006 : long_long_accum_type_node;
3007
3008 if (mode == TYPE_MODE (unsigned_short_accum_type_node))
3009 return unsignedp ? sat_unsigned_short_accum_type_node
3010 : unsigned_short_accum_type_node;
3011 if (mode == TYPE_MODE (unsigned_accum_type_node))
3012 return unsignedp ? sat_unsigned_accum_type_node
3013 : unsigned_accum_type_node;
3014 if (mode == TYPE_MODE (unsigned_long_accum_type_node))
3015 return unsignedp ? sat_unsigned_long_accum_type_node
3016 : unsigned_long_accum_type_node;
3017 if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
3018 return unsignedp ? sat_unsigned_long_long_accum_type_node
3019 : unsigned_long_long_accum_type_node;
3020
3021 if (mode == QQmode)
3022 return unsignedp ? sat_qq_type_node : qq_type_node;
3023 if (mode == HQmode)
3024 return unsignedp ? sat_hq_type_node : hq_type_node;
3025 if (mode == SQmode)
3026 return unsignedp ? sat_sq_type_node : sq_type_node;
3027 if (mode == DQmode)
3028 return unsignedp ? sat_dq_type_node : dq_type_node;
3029 if (mode == TQmode)
3030 return unsignedp ? sat_tq_type_node : tq_type_node;
3031
3032 if (mode == UQQmode)
3033 return unsignedp ? sat_uqq_type_node : uqq_type_node;
3034 if (mode == UHQmode)
3035 return unsignedp ? sat_uhq_type_node : uhq_type_node;
3036 if (mode == USQmode)
3037 return unsignedp ? sat_usq_type_node : usq_type_node;
3038 if (mode == UDQmode)
3039 return unsignedp ? sat_udq_type_node : udq_type_node;
3040 if (mode == UTQmode)
3041 return unsignedp ? sat_utq_type_node : utq_type_node;
3042
3043 if (mode == HAmode)
3044 return unsignedp ? sat_ha_type_node : ha_type_node;
3045 if (mode == SAmode)
3046 return unsignedp ? sat_sa_type_node : sa_type_node;
3047 if (mode == DAmode)
3048 return unsignedp ? sat_da_type_node : da_type_node;
3049 if (mode == TAmode)
3050 return unsignedp ? sat_ta_type_node : ta_type_node;
3051
3052 if (mode == UHAmode)
3053 return unsignedp ? sat_uha_type_node : uha_type_node;
3054 if (mode == USAmode)
3055 return unsignedp ? sat_usa_type_node : usa_type_node;
3056 if (mode == UDAmode)
3057 return unsignedp ? sat_uda_type_node : uda_type_node;
3058 if (mode == UTAmode)
3059 return unsignedp ? sat_uta_type_node : uta_type_node;
3060 }
3061
5b247e9f 3062 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
3063 if (TYPE_MODE (TREE_VALUE (t)) == mode)
3064 return TREE_VALUE (t);
3065
b0fc3e72 3066 return 0;
3067}
20d39783 3068
11773141 3069tree
3070c_common_unsigned_type (tree type)
3071{
3072 return c_common_signed_or_unsigned_type (1, type);
3073}
3074
20d39783 3075/* Return a signed type the same as TYPE in other respects. */
3076
3077tree
1cae46be 3078c_common_signed_type (tree type)
20d39783 3079{
4070745f 3080 return c_common_signed_or_unsigned_type (0, type);
20d39783 3081}
3082
3083/* Return a type the same as TYPE except unsigned or
3084 signed according to UNSIGNEDP. */
3085
3086tree
1cae46be 3087c_common_signed_or_unsigned_type (int unsignedp, tree type)
20d39783 3088{
7a91101f 3089 tree type1;
20d39783 3090
7a91101f 3091 /* This block of code emulates the behavior of the old
3092 c_common_unsigned_type. In particular, it returns
3093 long_unsigned_type_node if passed a long, even when a int would
3094 have the same size. This is necessary for warnings to work
3095 correctly in archs where sizeof(int) == sizeof(long) */
3096
3097 type1 = TYPE_MAIN_VARIANT (type);
3098 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3099 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3100 if (type1 == integer_type_node || type1 == unsigned_type_node)
3101 return unsignedp ? unsigned_type_node : integer_type_node;
3102 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
3103 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3104 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
3105 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3106 if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
3107 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
6388cfe2 3108 if (int128_integer_type_node
3109 && (type1 == int128_integer_type_node
3110 || type1 == int128_unsigned_type_node))
3111 return unsignedp ? int128_unsigned_type_node : int128_integer_type_node;
7a91101f 3112 if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
3113 return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
3114#if HOST_BITS_PER_WIDE_INT >= 64
3115 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
3116 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3117#endif
3118 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
3119 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3120 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
3121 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3122 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
3123 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3124 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
3125 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3126
9f92e1a2 3127#define C_COMMON_FIXED_TYPES(NAME) \
3128 if (type1 == short_ ## NAME ## _type_node \
3129 || type1 == unsigned_short_ ## NAME ## _type_node) \
3130 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3131 : short_ ## NAME ## _type_node; \
3132 if (type1 == NAME ## _type_node \
3133 || type1 == unsigned_ ## NAME ## _type_node) \
3134 return unsignedp ? unsigned_ ## NAME ## _type_node \
3135 : NAME ## _type_node; \
3136 if (type1 == long_ ## NAME ## _type_node \
3137 || type1 == unsigned_long_ ## NAME ## _type_node) \
3138 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3139 : long_ ## NAME ## _type_node; \
3140 if (type1 == long_long_ ## NAME ## _type_node \
3141 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3142 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3143 : long_long_ ## NAME ## _type_node;
3144
3145#define C_COMMON_FIXED_MODE_TYPES(NAME) \
3146 if (type1 == NAME ## _type_node \
3147 || type1 == u ## NAME ## _type_node) \
3148 return unsignedp ? u ## NAME ## _type_node \
3149 : NAME ## _type_node;
3150
3151#define C_COMMON_FIXED_TYPES_SAT(NAME) \
3152 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3153 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3154 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3155 : sat_ ## short_ ## NAME ## _type_node; \
3156 if (type1 == sat_ ## NAME ## _type_node \
3157 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3158 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3159 : sat_ ## NAME ## _type_node; \
3160 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3161 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3162 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3163 : sat_ ## long_ ## NAME ## _type_node; \
3164 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3165 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3166 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3167 : sat_ ## long_long_ ## NAME ## _type_node;
3168
3169#define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3170 if (type1 == sat_ ## NAME ## _type_node \
3171 || type1 == sat_ ## u ## NAME ## _type_node) \
3172 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3173 : sat_ ## NAME ## _type_node;
3174
3175 C_COMMON_FIXED_TYPES (fract);
3176 C_COMMON_FIXED_TYPES_SAT (fract);
3177 C_COMMON_FIXED_TYPES (accum);
3178 C_COMMON_FIXED_TYPES_SAT (accum);
3179
3180 C_COMMON_FIXED_MODE_TYPES (qq);
3181 C_COMMON_FIXED_MODE_TYPES (hq);
3182 C_COMMON_FIXED_MODE_TYPES (sq);
3183 C_COMMON_FIXED_MODE_TYPES (dq);
3184 C_COMMON_FIXED_MODE_TYPES (tq);
3185 C_COMMON_FIXED_MODE_TYPES_SAT (qq);
3186 C_COMMON_FIXED_MODE_TYPES_SAT (hq);
3187 C_COMMON_FIXED_MODE_TYPES_SAT (sq);
3188 C_COMMON_FIXED_MODE_TYPES_SAT (dq);
3189 C_COMMON_FIXED_MODE_TYPES_SAT (tq);
3190 C_COMMON_FIXED_MODE_TYPES (ha);
3191 C_COMMON_FIXED_MODE_TYPES (sa);
3192 C_COMMON_FIXED_MODE_TYPES (da);
3193 C_COMMON_FIXED_MODE_TYPES (ta);
3194 C_COMMON_FIXED_MODE_TYPES_SAT (ha);
3195 C_COMMON_FIXED_MODE_TYPES_SAT (sa);
3196 C_COMMON_FIXED_MODE_TYPES_SAT (da);
3197 C_COMMON_FIXED_MODE_TYPES_SAT (ta);
9421ebb9 3198
4f7f7efd 3199 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3200 the precision; they have precision set to match their range, but
3201 may use a wider mode to match an ABI. If we change modes, we may
3202 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3203 the precision as well, so as to yield correct results for
3204 bit-field types. C++ does not have these separate bit-field
3205 types, and producing a signed or unsigned variant of an
3206 ENUMERAL_TYPE may cause other problems as well. */
3207
ac265864 3208 if (!INTEGRAL_TYPE_P (type)
3209 || TYPE_UNSIGNED (type) == unsignedp)
3210 return type;
3211
4f7f7efd 3212#define TYPE_OK(node) \
3213 (TYPE_MODE (type) == TYPE_MODE (node) \
0c4abe5b 3214 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4f7f7efd 3215 if (TYPE_OK (signed_char_type_node))
20d39783 3216 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
4f7f7efd 3217 if (TYPE_OK (integer_type_node))
20d39783 3218 return unsignedp ? unsigned_type_node : integer_type_node;
4f7f7efd 3219 if (TYPE_OK (short_integer_type_node))
20d39783 3220 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
4f7f7efd 3221 if (TYPE_OK (long_integer_type_node))
20d39783 3222 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
4f7f7efd 3223 if (TYPE_OK (long_long_integer_type_node))
20d39783 3224 return (unsignedp ? long_long_unsigned_type_node
3225 : long_long_integer_type_node);
6388cfe2 3226 if (int128_integer_type_node && TYPE_OK (int128_integer_type_node))
3227 return (unsignedp ? int128_unsigned_type_node
3228 : int128_integer_type_node);
4f7f7efd 3229 if (TYPE_OK (widest_integer_literal_type_node))
20d39783 3230 return (unsignedp ? widest_unsigned_literal_type_node
3231 : widest_integer_literal_type_node);
ef11801e 3232
3233#if HOST_BITS_PER_WIDE_INT >= 64
4f7f7efd 3234 if (TYPE_OK (intTI_type_node))
ef11801e 3235 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3236#endif
4f7f7efd 3237 if (TYPE_OK (intDI_type_node))
ef11801e 3238 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
4f7f7efd 3239 if (TYPE_OK (intSI_type_node))
ef11801e 3240 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
4f7f7efd 3241 if (TYPE_OK (intHI_type_node))
ef11801e 3242 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
4f7f7efd 3243 if (TYPE_OK (intQI_type_node))
ef11801e 3244 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
4f7f7efd 3245#undef TYPE_OK
ef11801e 3246
0c4abe5b 3247 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
20d39783 3248}
b268e47e 3249
c0e47fd4 3250/* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3251
3252tree
3253c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
3254{
3255 /* Extended integer types of the same width as a standard type have
3256 lesser rank, so those of the same width as int promote to int or
3257 unsigned int and are valid for printf formats expecting int or
3258 unsigned int. To avoid such special cases, avoid creating
3259 extended integer types for bit-fields if a standard integer type
3260 is available. */
3261 if (width == TYPE_PRECISION (integer_type_node))
3262 return unsignedp ? unsigned_type_node : integer_type_node;
3263 if (width == TYPE_PRECISION (signed_char_type_node))
3264 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3265 if (width == TYPE_PRECISION (short_integer_type_node))
3266 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3267 if (width == TYPE_PRECISION (long_integer_type_node))
3268 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3269 if (width == TYPE_PRECISION (long_long_integer_type_node))
3270 return (unsignedp ? long_long_unsigned_type_node
3271 : long_long_integer_type_node);
6388cfe2 3272 if (int128_integer_type_node
3273 && width == TYPE_PRECISION (int128_integer_type_node))
3274 return (unsignedp ? int128_unsigned_type_node
3275 : int128_integer_type_node);
c0e47fd4 3276 return build_nonstandard_integer_type (width, unsignedp);
3277}
3278
b268e47e 3279/* The C version of the register_builtin_type langhook. */
3280
3281void
3282c_register_builtin_type (tree type, const char* name)
3283{
3284 tree decl;
3285
e60a6f7b 3286 decl = build_decl (UNKNOWN_LOCATION,
3287 TYPE_DECL, get_identifier (name), type);
b268e47e 3288 DECL_ARTIFICIAL (decl) = 1;
3289 if (!TYPE_NAME (type))
3290 TYPE_NAME (type) = decl;
3291 pushdecl (decl);
5b247e9f 3292
3293 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
b268e47e 3294}
a9b9d10c 3295\f
aff9e656 3296/* Print an error message for invalid operands to arith operation
8e70fb09 3297 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3298 LOCATION is the location of the message. */
b0fc3e72 3299
3300void
8e70fb09 3301binary_op_error (location_t location, enum tree_code code,
3302 tree type0, tree type1)
b0fc3e72 3303{
19cb6b50 3304 const char *opname;
f03946e4 3305
b0fc3e72 3306 switch (code)
3307 {
b0fc3e72 3308 case PLUS_EXPR:
3309 opname = "+"; break;
3310 case MINUS_EXPR:
3311 opname = "-"; break;
3312 case MULT_EXPR:
3313 opname = "*"; break;
3314 case MAX_EXPR:
3315 opname = "max"; break;
3316 case MIN_EXPR:
3317 opname = "min"; break;
3318 case EQ_EXPR:
3319 opname = "=="; break;
3320 case NE_EXPR:
3321 opname = "!="; break;
3322 case LE_EXPR:
3323 opname = "<="; break;
3324 case GE_EXPR:
3325 opname = ">="; break;
3326 case LT_EXPR:
3327 opname = "<"; break;
3328 case GT_EXPR:
3329 opname = ">"; break;
3330 case LSHIFT_EXPR:
3331 opname = "<<"; break;
3332 case RSHIFT_EXPR:
3333 opname = ">>"; break;
3334 case TRUNC_MOD_EXPR:
66618a1e 3335 case FLOOR_MOD_EXPR:
b0fc3e72 3336 opname = "%"; break;
3337 case TRUNC_DIV_EXPR:
66618a1e 3338 case FLOOR_DIV_EXPR:
b0fc3e72 3339 opname = "/"; break;
3340 case BIT_AND_EXPR:
3341 opname = "&"; break;
3342 case BIT_IOR_EXPR:
3343 opname = "|"; break;
3344 case TRUTH_ANDIF_EXPR:
3345 opname = "&&"; break;
3346 case TRUTH_ORIF_EXPR:
3347 opname = "||"; break;
3348 case BIT_XOR_EXPR:
3349 opname = "^"; break;
31f820d2 3350 default:
315ba355 3351 gcc_unreachable ();
b0fc3e72 3352 }
8e70fb09 3353 error_at (location,
3354 "invalid operands to binary %s (have %qT and %qT)", opname,
3355 type0, type1);
b0fc3e72 3356}
3357\f
3358/* Subroutine of build_binary_op, used for comparison operations.
3359 See if the operands have both been converted from subword integer types
3360 and, if so, perhaps change them both back to their original type.
5b511807 3361 This function is also responsible for converting the two operands
3362 to the proper common type for comparison.
b0fc3e72 3363
3364 The arguments of this function are all pointers to local variables
3365 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3366 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3367
3368 If this function returns nonzero, it means that the comparison has
3369 a constant value. What this function returns is an expression for
3370 that value. */
3371
3372tree
1cae46be 3373shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
3374 enum tree_code *rescode_ptr)
b0fc3e72 3375{
19cb6b50 3376 tree type;
b0fc3e72 3377 tree op0 = *op0_ptr;
3378 tree op1 = *op1_ptr;
3379 int unsignedp0, unsignedp1;
3380 int real1, real2;
3381 tree primop0, primop1;
3382 enum tree_code code = *rescode_ptr;
3383
3384 /* Throw away any conversions to wider types
3385 already present in the operands. */
3386
7f506bca 3387 primop0 = c_common_get_narrower (op0, &unsignedp0);
3388 primop1 = c_common_get_narrower (op1, &unsignedp1);
b0fc3e72 3389
119d06b2 3390 /* If primopN is first sign-extended from primopN's precision to opN's
3391 precision, then zero-extended from opN's precision to
3392 *restype_ptr precision, shortenings might be invalid. */
3393 if (TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (TREE_TYPE (op0))
3394 && TYPE_PRECISION (TREE_TYPE (op0)) < TYPE_PRECISION (*restype_ptr)
3395 && !unsignedp0
3396 && TYPE_UNSIGNED (TREE_TYPE (op0)))
3397 primop0 = op0;
3398 if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1))
3399 && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr)
3400 && !unsignedp1
3401 && TYPE_UNSIGNED (TREE_TYPE (op1)))
3402 primop1 = op1;
3403
b0fc3e72 3404 /* Handle the case that OP0 does not *contain* a conversion
3405 but it *requires* conversion to FINAL_TYPE. */
3406
3407 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
78a8ed03 3408 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
b0fc3e72 3409 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
78a8ed03 3410 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
b0fc3e72 3411
3412 /* If one of the operands must be floated, we cannot optimize. */
3413 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
3414 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
3415
3416 /* If first arg is constant, swap the args (changing operation
2bd278cc 3417 so value is preserved), for canonicalization. Don't do this if
3418 the second arg is 0. */
b0fc3e72 3419
2bd278cc 3420 if (TREE_CONSTANT (primop0)
9421ebb9 3421 && !integer_zerop (primop1) && !real_zerop (primop1)
3422 && !fixed_zerop (primop1))
b0fc3e72 3423 {
19cb6b50 3424 tree tem = primop0;
3425 int temi = unsignedp0;
b0fc3e72 3426 primop0 = primop1;
3427 primop1 = tem;
3428 tem = op0;
3429 op0 = op1;
3430 op1 = tem;
3431 *op0_ptr = op0;
3432 *op1_ptr = op1;
3433 unsignedp0 = unsignedp1;
3434 unsignedp1 = temi;
3435 temi = real1;
3436 real1 = real2;
3437 real2 = temi;
3438
3439 switch (code)
3440 {
3441 case LT_EXPR:
3442 code = GT_EXPR;
3443 break;
3444 case GT_EXPR:
3445 code = LT_EXPR;
3446 break;
3447 case LE_EXPR:
3448 code = GE_EXPR;
3449 break;
3450 case GE_EXPR:
3451 code = LE_EXPR;
3452 break;
31f820d2 3453 default:
3454 break;
b0fc3e72 3455 }
3456 *rescode_ptr = code;
3457 }
3458
3459 /* If comparing an integer against a constant more bits wide,
3460 maybe we can deduce a value of 1 or 0 independent of the data.
3461 Or else truncate the constant now
3462 rather than extend the variable at run time.
3463
3464 This is only interesting if the constant is the wider arg.
3465 Also, it is not safe if the constant is unsigned and the
3466 variable arg is signed, since in this case the variable
3467 would be sign-extended and then regarded as unsigned.
3468 Our technique fails in this case because the lowest/highest
3469 possible unsigned results don't follow naturally from the
3470 lowest/highest possible values of the variable operand.
3471 For just EQ_EXPR and NE_EXPR there is another technique that
3472 could be used: see if the constant can be faithfully represented
3473 in the other operand's type, by truncating it and reextending it
3474 and see if that preserves the constant's value. */
3475
3476 if (!real1 && !real2
9421ebb9 3477 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
b0fc3e72 3478 && TREE_CODE (primop1) == INTEGER_CST
3479 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
3480 {
3481 int min_gt, max_gt, min_lt, max_lt;
3482 tree maxval, minval;
3483 /* 1 if comparison is nominally unsigned. */
78a8ed03 3484 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
b0fc3e72 3485 tree val;
3486
4070745f 3487 type = c_common_signed_or_unsigned_type (unsignedp0,
3488 TREE_TYPE (primop0));
cda09c61 3489
b0fc3e72 3490 maxval = TYPE_MAX_VALUE (type);
3491 minval = TYPE_MIN_VALUE (type);
3492
3493 if (unsignedp && !unsignedp0)
4070745f 3494 *restype_ptr = c_common_signed_type (*restype_ptr);
b0fc3e72 3495
3496 if (TREE_TYPE (primop1) != *restype_ptr)
18dbec6f 3497 {
9a5e8086 3498 /* Convert primop1 to target type, but do not introduce
3499 additional overflow. We know primop1 is an int_cst. */
c8110c8f 3500 primop1 = force_fit_type_double (*restype_ptr,
d3237426 3501 tree_to_double_int (primop1),
3502 0, TREE_OVERFLOW (primop1));
18dbec6f 3503 }
b0fc3e72 3504 if (type != *restype_ptr)
3505 {
3506 minval = convert (*restype_ptr, minval);
3507 maxval = convert (*restype_ptr, maxval);
3508 }
3509
3510 if (unsignedp && unsignedp0)
3511 {
3512 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
3513 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
3514 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
3515 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
3516 }
3517 else
3518 {
3519 min_gt = INT_CST_LT (primop1, minval);
3520 max_gt = INT_CST_LT (primop1, maxval);
3521 min_lt = INT_CST_LT (minval, primop1);
3522 max_lt = INT_CST_LT (maxval, primop1);
3523 }
3524
3525 val = 0;
3526 /* This used to be a switch, but Genix compiler can't handle that. */
3527 if (code == NE_EXPR)
3528 {
3529 if (max_lt || min_gt)
3c2239cf 3530 val = truthvalue_true_node;
b0fc3e72 3531 }
3532 else if (code == EQ_EXPR)
3533 {
3534 if (max_lt || min_gt)
3c2239cf 3535 val = truthvalue_false_node;
b0fc3e72 3536 }
3537 else if (code == LT_EXPR)
3538 {
3539 if (max_lt)
3c2239cf 3540 val = truthvalue_true_node;
b0fc3e72 3541 if (!min_lt)
3c2239cf 3542 val = truthvalue_false_node;
b0fc3e72 3543 }
3544 else if (code == GT_EXPR)
3545 {
3546 if (min_gt)
3c2239cf 3547 val = truthvalue_true_node;
b0fc3e72 3548 if (!max_gt)
3c2239cf 3549 val = truthvalue_false_node;
b0fc3e72 3550 }
3551 else if (code == LE_EXPR)
3552 {
3553 if (!max_gt)
3c2239cf 3554 val = truthvalue_true_node;
b0fc3e72 3555 if (min_gt)
3c2239cf 3556 val = truthvalue_false_node;
b0fc3e72 3557 }
3558 else if (code == GE_EXPR)
3559 {
3560 if (!min_lt)
3c2239cf 3561 val = truthvalue_true_node;
b0fc3e72 3562 if (max_lt)
3c2239cf 3563 val = truthvalue_false_node;
b0fc3e72 3564 }
3565
3566 /* If primop0 was sign-extended and unsigned comparison specd,
3567 we did a signed comparison above using the signed type bounds.
3568 But the comparison we output must be unsigned.
3569
3570 Also, for inequalities, VAL is no good; but if the signed
3571 comparison had *any* fixed result, it follows that the
3572 unsigned comparison just tests the sign in reverse
3573 (positive values are LE, negative ones GE).
3574 So we can generate an unsigned comparison
3575 against an extreme value of the signed type. */
3576
3577 if (unsignedp && !unsignedp0)
3578 {
3579 if (val != 0)
3580 switch (code)
3581 {
3582 case LT_EXPR:
3583 case GE_EXPR:
3584 primop1 = TYPE_MIN_VALUE (type);
3585 val = 0;
3586 break;
3587
3588 case LE_EXPR:
3589 case GT_EXPR:
3590 primop1 = TYPE_MAX_VALUE (type);
3591 val = 0;
3592 break;
31f820d2 3593
3594 default:
3595 break;
b0fc3e72 3596 }
11773141 3597 type = c_common_unsigned_type (type);
b0fc3e72 3598 }
3599
fe5f2366 3600 if (TREE_CODE (primop0) != INTEGER_CST)
b0fc3e72 3601 {
3c2239cf 3602 if (val == truthvalue_false_node)
e6e352cb 3603 warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type");
3c2239cf 3604 if (val == truthvalue_true_node)
e6e352cb 3605 warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type");
b0fc3e72 3606 }
3607
3608 if (val != 0)
3609 {
3610 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3611 if (TREE_SIDE_EFFECTS (primop0))
14ae0310 3612 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
b0fc3e72 3613 return val;
3614 }
3615
3616 /* Value is not predetermined, but do the comparison
3617 in the type of the operand that is not constant.
3618 TYPE is already properly set. */
3619 }
c4503c0a 3620
3621 /* If either arg is decimal float and the other is float, find the
3622 proper common type to use for comparison. */
3623 else if (real1 && real2
3624 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
3625 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
3626 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
3627
b0fc3e72 3628 else if (real1 && real2
2203bd5c 3629 && (TYPE_PRECISION (TREE_TYPE (primop0))
3630 == TYPE_PRECISION (TREE_TYPE (primop1))))
b0fc3e72 3631 type = TREE_TYPE (primop0);
3632
3633 /* If args' natural types are both narrower than nominal type
3634 and both extend in the same manner, compare them
3635 in the type of the wider arg.
3636 Otherwise must actually extend both to the nominal
3637 common type lest different ways of extending
3638 alter the result.
3639 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3640
3641 else if (unsignedp0 == unsignedp1 && real1 == real2
3642 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
3643 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
3644 {
3645 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
4070745f 3646 type = c_common_signed_or_unsigned_type (unsignedp0
78a8ed03 3647 || TYPE_UNSIGNED (*restype_ptr),
4070745f 3648 type);
b0fc3e72 3649 /* Make sure shorter operand is extended the right way
3650 to match the longer operand. */
4070745f 3651 primop0
3652 = convert (c_common_signed_or_unsigned_type (unsignedp0,
3653 TREE_TYPE (primop0)),
3654 primop0);
3655 primop1
3656 = convert (c_common_signed_or_unsigned_type (unsignedp1,
3657 TREE_TYPE (primop1)),
3658 primop1);
b0fc3e72 3659 }
3660 else
3661 {
3662 /* Here we must do the comparison on the nominal type
3663 using the args exactly as we received them. */
3664 type = *restype_ptr;
3665 primop0 = op0;
3666 primop1 = op1;
3667
3668 if (!real1 && !real2 && integer_zerop (primop1)
78a8ed03 3669 && TYPE_UNSIGNED (*restype_ptr))
b0fc3e72 3670 {
3671 tree value = 0;
3672 switch (code)
3673 {
3674 case GE_EXPR:
e6e352cb 3675 /* All unsigned values are >= 0, so we warn. However,
3676 if OP0 is a constant that is >= 0, the signedness of
3677 the comparison isn't an issue, so suppress the
3678 warning. */
3679 if (warn_type_limits && !in_system_header
84166705 3680 && !(TREE_CODE (primop0) == INTEGER_CST
3681 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3682 primop0))))
48e1416a 3683 warning (OPT_Wtype_limits,
e6e352cb 3684 "comparison of unsigned expression >= 0 is always true");
3c2239cf 3685 value = truthvalue_true_node;
b0fc3e72 3686 break;
3687
3688 case LT_EXPR:
e6e352cb 3689 if (warn_type_limits && !in_system_header
84166705 3690 && !(TREE_CODE (primop0) == INTEGER_CST
3691 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3692 primop0))))
48e1416a 3693 warning (OPT_Wtype_limits,
e6e352cb 3694 "comparison of unsigned expression < 0 is always false");
3c2239cf 3695 value = truthvalue_false_node;
31f820d2 3696 break;
3697
3698 default:
3699 break;
b0fc3e72 3700 }
3701
3702 if (value != 0)
3703 {
3704 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3705 if (TREE_SIDE_EFFECTS (primop0))
14ae0310 3706 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
3707 primop0, value);
b0fc3e72 3708 return value;
3709 }
3710 }
3711 }
3712
3713 *op0_ptr = convert (type, primop0);
3714 *op1_ptr = convert (type, primop1);
3715
3c2239cf 3716 *restype_ptr = truthvalue_type_node;
b0fc3e72 3717
3718 return 0;
3719}
3720\f
1c26100f 3721/* Return a tree for the sum or difference (RESULTCODE says which)
3722 of pointer PTROP and integer INTOP. */
3723
3724tree
389dd41b 3725pointer_int_sum (location_t loc, enum tree_code resultcode,
3726 tree ptrop, tree intop)
1c26100f 3727{
add6ee5e 3728 tree size_exp, ret;
1c26100f 3729
1c26100f 3730 /* The result is a pointer of the same type that is being added. */
1c26100f 3731 tree result_type = TREE_TYPE (ptrop);
3732
3733 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3734 {
48e1416a 3735 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
8864917d 3736 "pointer of type %<void *%> used in arithmetic");
1c26100f 3737 size_exp = integer_one_node;
3738 }
3739 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
3740 {
48e1416a 3741 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
8864917d 3742 "pointer to a function used in arithmetic");
1c26100f 3743 size_exp = integer_one_node;
3744 }
3745 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
3746 {
48e1416a 3747 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
8864917d 3748 "pointer to member function used in arithmetic");
1c26100f 3749 size_exp = integer_one_node;
3750 }
1c26100f 3751 else
3752 size_exp = size_in_bytes (TREE_TYPE (result_type));
3753
add6ee5e 3754 /* We are manipulating pointer values, so we don't need to warn
3755 about relying on undefined signed overflow. We disable the
3756 warning here because we use integer types so fold won't know that
3757 they are really pointers. */
3758 fold_defer_overflow_warnings ();
3759
1c26100f 3760 /* If what we are about to multiply by the size of the elements
3761 contains a constant term, apply distributive law
3762 and multiply that constant term separately.
3763 This helps produce common subexpressions. */
1c26100f 3764 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
84166705 3765 && !TREE_CONSTANT (intop)
1c26100f 3766 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
3767 && TREE_CONSTANT (size_exp)
3768 /* If the constant comes from pointer subtraction,
3769 skip this optimization--it would cause an error. */
3770 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
3771 /* If the constant is unsigned, and smaller than the pointer size,
3772 then we must skip this optimization. This is because it could cause
3773 an overflow error if the constant is negative but INTOP is not. */
84166705 3774 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
1c26100f 3775 || (TYPE_PRECISION (TREE_TYPE (intop))
3776 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
3777 {
3778 enum tree_code subcode = resultcode;
3779 tree int_type = TREE_TYPE (intop);
3780 if (TREE_CODE (intop) == MINUS_EXPR)
3781 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
3782 /* Convert both subexpression types to the type of intop,
3783 because weird cases involving pointer arithmetic
3784 can result in a sum or difference with different type args. */
8e70fb09 3785 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
3786 subcode, ptrop,
1c26100f 3787 convert (int_type, TREE_OPERAND (intop, 1)), 1);
3788 intop = convert (int_type, TREE_OPERAND (intop, 0));
3789 }
3790
3791 /* Convert the integer argument to a type the same size as sizetype
3792 so the multiply won't overflow spuriously. */
1c26100f 3793 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
78a8ed03 3794 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
1cae46be 3795 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
78a8ed03 3796 TYPE_UNSIGNED (sizetype)), intop);
1c26100f 3797
3798 /* Replace the integer argument with a suitable product by the object size.
c6feb9f1 3799 Do this multiplication as signed, then convert to the appropriate type
3800 for the pointer operation and disregard an overflow that occured only
3801 because of the sign-extension change in the latter conversion. */
3802 {
3803 tree t = build_binary_op (loc,
3804 MULT_EXPR, intop,
3805 convert (TREE_TYPE (intop), size_exp), 1);
3806 intop = convert (sizetype, t);
3807 if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
3808 intop = build_int_cst_wide (TREE_TYPE (intop), TREE_INT_CST_LOW (intop),
3809 TREE_INT_CST_HIGH (intop));
3810 }
0de36bdb 3811
499e523f 3812 /* Create the sum or difference. */
0de36bdb 3813 if (resultcode == MINUS_EXPR)
389dd41b 3814 intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
1c26100f 3815
2cc66f2a 3816 ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
add6ee5e 3817
3818 fold_undefer_and_ignore_overflow_warnings ();
3819
3820 return ret;
1c26100f 3821}
3822\f
f59e3889 3823/* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3824 and if NON_CONST is known not to be permitted in an evaluated part
3825 of a constant expression. */
3826
3827tree
3828c_wrap_maybe_const (tree expr, bool non_const)
3829{
3830 bool nowarning = TREE_NO_WARNING (expr);
3831 location_t loc = EXPR_LOCATION (expr);
3832
3833 /* This should never be called for C++. */
3834 if (c_dialect_cxx ())
3835 gcc_unreachable ();
3836
3837 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3838 STRIP_TYPE_NOPS (expr);
3839 expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
3840 C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
3841 if (nowarning)
3842 TREE_NO_WARNING (expr) = 1;
3843 protected_set_expr_location (expr, loc);
3844
3845 return expr;
3846}
3847
a75b1c71 3848/* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3849 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3850 around the SAVE_EXPR if needed so that c_fully_fold does not need
3851 to look inside SAVE_EXPRs. */
3852
3853tree
3854c_save_expr (tree expr)
3855{
3856 bool maybe_const = true;
3857 if (c_dialect_cxx ())
3858 return save_expr (expr);
3859 expr = c_fully_fold (expr, false, &maybe_const);
3860 expr = save_expr (expr);
3861 if (!maybe_const)
f59e3889 3862 expr = c_wrap_maybe_const (expr, true);
a75b1c71 3863 return expr;
3864}
3865
6b68e71a 3866/* Return whether EXPR is a declaration whose address can never be
3867 NULL. */
3868
3869bool
9f627b1a 3870decl_with_nonnull_addr_p (const_tree expr)
6b68e71a 3871{
3872 return (DECL_P (expr)
3873 && (TREE_CODE (expr) == PARM_DECL
3874 || TREE_CODE (expr) == LABEL_DECL
3875 || !DECL_WEAK (expr)));
3876}
3877
b0fc3e72 3878/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
45a78cc0 3879 or for an `if' or `while' statement or ?..: exp. It should already
3880 have been validated to be of suitable type; otherwise, a bad
3881 diagnostic may result.
b0fc3e72 3882
8e70fb09 3883 The EXPR is located at LOCATION.
3884
b0fc3e72 3885 This preparation consists of taking the ordinary
3886 representation of an expression expr and producing a valid tree
3887 boolean expression describing whether expr is nonzero. We could
3c2239cf 3888 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
b0fc3e72 3889 but we optimize comparisons, &&, ||, and !.
3890
3c2239cf 3891 The resulting type should always be `truthvalue_type_node'. */
b0fc3e72 3892
3893tree
8e70fb09 3894c_common_truthvalue_conversion (location_t location, tree expr)
b0fc3e72 3895{
b0fc3e72 3896 switch (TREE_CODE (expr))
3897 {
318a728f 3898 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
e1232ce2 3899 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
3900 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
3901 case ORDERED_EXPR: case UNORDERED_EXPR:
ce04dcdc 3902 if (TREE_TYPE (expr) == truthvalue_type_node)
3903 return expr;
e60a6f7b 3904 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
ce04dcdc 3905 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
e60a6f7b 3906 goto ret;
ce04dcdc 3907
b0fc3e72 3908 case TRUTH_ANDIF_EXPR:
3909 case TRUTH_ORIF_EXPR:
3910 case TRUTH_AND_EXPR:
3911 case TRUTH_OR_EXPR:
31f6e93c 3912 case TRUTH_XOR_EXPR:
ce04dcdc 3913 if (TREE_TYPE (expr) == truthvalue_type_node)
3914 return expr;
e60a6f7b 3915 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
48e1416a 3916 c_common_truthvalue_conversion (location,
e60a6f7b 3917 TREE_OPERAND (expr, 0)),
3918 c_common_truthvalue_conversion (location,
3919 TREE_OPERAND (expr, 1)));
3920 goto ret;
3e851b85 3921
f6e28f72 3922 case TRUTH_NOT_EXPR:
ce04dcdc 3923 if (TREE_TYPE (expr) == truthvalue_type_node)
3924 return expr;
e60a6f7b 3925 expr = build1 (TREE_CODE (expr), truthvalue_type_node,
3926 c_common_truthvalue_conversion (location,
3927 TREE_OPERAND (expr, 0)));
3928 goto ret;
f6e28f72 3929
b0fc3e72 3930 case ERROR_MARK:
3931 return expr;
3932
3933 case INTEGER_CST:
eddad94a 3934 return integer_zerop (expr) ? truthvalue_false_node
3935 : truthvalue_true_node;
b0fc3e72 3936
3937 case REAL_CST:
5000e21c 3938 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
3939 ? truthvalue_true_node
3940 : truthvalue_false_node;
b0fc3e72 3941
9421ebb9 3942 case FIXED_CST:
3943 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
3944 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
3945 ? truthvalue_true_node
3946 : truthvalue_false_node;
3947
ce04dcdc 3948 case FUNCTION_DECL:
b6889cb0 3949 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
ce04dcdc 3950 /* Fall through. */
3951
b0fc3e72 3952 case ADDR_EXPR:
ce871053 3953 {
ee7d4d6a 3954 tree inner = TREE_OPERAND (expr, 0);
6b68e71a 3955 if (decl_with_nonnull_addr_p (inner))
ce871053 3956 {
6b68e71a 3957 /* Common Ada/Pascal programmer's mistake. */
8e70fb09 3958 warning_at (location,
3959 OPT_Waddress,
3960 "the address of %qD will always evaluate as %<true%>",
3961 inner);
ce871053 3962 return truthvalue_true_node;
3963 }
d473d901 3964 break;
ce871053 3965 }
b0fc3e72 3966
2203bd5c 3967 case COMPLEX_EXPR:
e60a6f7b 3968 expr = build_binary_op (EXPR_LOCATION (expr),
8e70fb09 3969 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
95809de4 3970 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
8e70fb09 3971 c_common_truthvalue_conversion (location,
3972 TREE_OPERAND (expr, 0)),
3973 c_common_truthvalue_conversion (location,
3974 TREE_OPERAND (expr, 1)),
2203bd5c 3975 0);
e60a6f7b 3976 goto ret;
2203bd5c 3977
b0fc3e72 3978 case NEGATE_EXPR:
3979 case ABS_EXPR:
3980 case FLOAT_EXPR:
c6418a4e 3981 case EXCESS_PRECISION_EXPR:
d10cfa8d 3982 /* These don't change whether an object is nonzero or zero. */
8e70fb09 3983 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
b0fc3e72 3984
3985 case LROTATE_EXPR:
3986 case RROTATE_EXPR:
d10cfa8d 3987 /* These don't change whether an object is zero or nonzero, but
b0fc3e72 3988 we can't ignore them if their second arg has side-effects. */
3989 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
e60a6f7b 3990 {
3991 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
3992 TREE_OPERAND (expr, 1),
48e1416a 3993 c_common_truthvalue_conversion
e60a6f7b 3994 (location, TREE_OPERAND (expr, 0)));
3995 goto ret;
3996 }
b0fc3e72 3997 else
8e70fb09 3998 return c_common_truthvalue_conversion (location,
3999 TREE_OPERAND (expr, 0));
73be5127 4000
b0fc3e72 4001 case COND_EXPR:
4002 /* Distribute the conversion into the arms of a COND_EXPR. */
a75b1c71 4003 if (c_dialect_cxx ())
e60a6f7b 4004 {
d0389adc 4005 tree op1 = TREE_OPERAND (expr, 1);
4006 tree op2 = TREE_OPERAND (expr, 2);
4007 /* In C++ one of the arms might have void type if it is throw. */
4008 if (!VOID_TYPE_P (TREE_TYPE (op1)))
4009 op1 = c_common_truthvalue_conversion (location, op1);
4010 if (!VOID_TYPE_P (TREE_TYPE (op2)))
4011 op2 = c_common_truthvalue_conversion (location, op2);
389dd41b 4012 expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
d0389adc 4013 TREE_OPERAND (expr, 0), op1, op2);
e60a6f7b 4014 goto ret;
4015 }
a75b1c71 4016 else
e60a6f7b 4017 {
4018 /* Folding will happen later for C. */
4019 expr = build3 (COND_EXPR, truthvalue_type_node,
4020 TREE_OPERAND (expr, 0),
4021 c_common_truthvalue_conversion (location,
4022 TREE_OPERAND (expr, 1)),
4023 c_common_truthvalue_conversion (location,
4024 TREE_OPERAND (expr, 2)));
4025 goto ret;
4026 }
b0fc3e72 4027
72dd6141 4028 CASE_CONVERT:
f8913d47 4029 {
4030 tree totype = TREE_TYPE (expr);
4031 tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
4032
4033 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4034 since that affects how `default_conversion' will behave. */
4035 if (TREE_CODE (totype) == REFERENCE_TYPE
4036 || TREE_CODE (fromtype) == REFERENCE_TYPE)
4037 break;
4038 /* Don't strip a conversion from C++0x scoped enum, since they
4039 don't implicitly convert to other types. */
4040 if (TREE_CODE (fromtype) == ENUMERAL_TYPE
4041 && ENUM_IS_SCOPED (fromtype))
4042 break;
4043 /* If this isn't narrowing the argument, we can ignore it. */
4044 if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
4045 return c_common_truthvalue_conversion (location,
4046 TREE_OPERAND (expr, 0));
4047 }
b0fc3e72 4048 break;
4049
16837b18 4050 case MODIFY_EXPR:
60a0513e 4051 if (!TREE_NO_WARNING (expr)
4052 && warn_parentheses)
4053 {
4054 warning (OPT_Wparentheses,
4055 "suggest parentheses around assignment used as truth value");
4056 TREE_NO_WARNING (expr) = 1;
4057 }
16837b18 4058 break;
73be5127 4059
31f820d2 4060 default:
4061 break;
b0fc3e72 4062 }
4063
2ba726d2 4064 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
a0748b7d 4065 {
93be21c0 4066 tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr));
e60a6f7b 4067 expr = (build_binary_op
8e70fb09 4068 (EXPR_LOCATION (expr),
4069 (TREE_SIDE_EFFECTS (expr)
a0748b7d 4070 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
b6889cb0 4071 c_common_truthvalue_conversion
4072 (location,
4073 build_unary_op (location, REALPART_EXPR, t, 0)),
4074 c_common_truthvalue_conversion
4075 (location,
4076 build_unary_op (location, IMAGPART_EXPR, t, 0)),
a0748b7d 4077 0));
e60a6f7b 4078 goto ret;
a0748b7d 4079 }
2ba726d2 4080
9421ebb9 4081 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
4082 {
4083 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
4084 FCONST0 (TYPE_MODE
4085 (TREE_TYPE (expr))));
43158006 4086 return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
9421ebb9 4087 }
e60a6f7b 4088 else
4089 return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
9421ebb9 4090
e60a6f7b 4091 ret:
4092 protected_set_expr_location (expr, location);
4093 return expr;
b0fc3e72 4094}
4095\f
3237155d 4096static void def_builtin_1 (enum built_in_function fncode,
4097 const char *name,
4098 enum built_in_class fnclass,
4099 tree fntype, tree libtype,
4100 bool both_p, bool fallback_p, bool nonansi_p,
4101 tree fnattrs, bool implicit_p);
0d4238dc 4102
a5b1863e 4103
4104/* Apply the TYPE_QUALS to the new DECL. */
4105
4106void
1cae46be 4107c_apply_type_quals_to_decl (int type_quals, tree decl)
a5b1863e 4108{
adfb367f 4109 tree type = TREE_TYPE (decl);
b27ac6b5 4110
e4eabbe4 4111 if (type == error_mark_node)
4112 return;
adfb367f 4113
98a33d9f 4114 if ((type_quals & TYPE_QUAL_CONST)
4115 || (type && TREE_CODE (type) == REFERENCE_TYPE))
4116 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4117 constructor can produce constant init, so rely on cp_finish_decl to
4118 clear TREE_READONLY if the variable has non-constant init. */
a5b1863e 4119 TREE_READONLY (decl) = 1;
4120 if (type_quals & TYPE_QUAL_VOLATILE)
4121 {
4122 TREE_SIDE_EFFECTS (decl) = 1;
4123 TREE_THIS_VOLATILE (decl) = 1;
4124 }
d91a20bc 4125 if (type_quals & TYPE_QUAL_RESTRICT)
a5b1863e 4126 {
adfb367f 4127 while (type && TREE_CODE (type) == ARRAY_TYPE)
4128 /* Allow 'restrict' on arrays of pointers.
4129 FIXME currently we just ignore it. */
4130 type = TREE_TYPE (type);
4131 if (!type
4132 || !POINTER_TYPE_P (type)
4133 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
b0b1af64 4134 error ("invalid use of %<restrict%>");
a5b1863e 4135 }
4136}
4137
4ee9c684 4138/* Hash function for the problem of multiple type definitions in
4139 different files. This must hash all types that will compare
4140 equal via comptypes to the same value. In practice it hashes
0bed3869 4141 on some of the simple stuff and leaves the details to comptypes. */
4ee9c684 4142
4143static hashval_t
4144c_type_hash (const void *p)
4145{
ecf2703d 4146 int n_elements;
4ee9c684 4147 int shift, size;
aae87fc3 4148 const_tree const t = (const_tree) p;
4ee9c684 4149 tree t2;
4150 switch (TREE_CODE (t))
4151 {
fbf0afd1 4152 /* For pointers, hash on pointee type plus some swizzling. */
2363ef00 4153 case POINTER_TYPE:
4154 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
4155 /* Hash on number of elements and total size. */
4156 case ENUMERAL_TYPE:
4157 shift = 3;
4158 t2 = TYPE_VALUES (t);
4159 break;
4160 case RECORD_TYPE:
4161 shift = 0;
4162 t2 = TYPE_FIELDS (t);
4163 break;
4164 case QUAL_UNION_TYPE:
4165 shift = 1;
4166 t2 = TYPE_FIELDS (t);
4167 break;
4168 case UNION_TYPE:
4169 shift = 2;
4170 t2 = TYPE_FIELDS (t);
4171 break;
4172 default:
231bd014 4173 gcc_unreachable ();
4ee9c684 4174 }
ecf2703d 4175 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4176 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4177 n_elements = list_length (t2);
78c2e180 4178 /* We might have a VLA here. */
4179 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
4180 size = 0;
4181 else
4182 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
ecf2703d 4183 return ((size << 24) | (n_elements << shift));
4ee9c684 4184}
4185
1ecd4018 4186static GTY((param_is (union tree_node))) htab_t type_hash_table;
4187
b5ba9f3a 4188/* Return the typed-based alias set for T, which may be an expression
f7c44134 4189 or a type. Return -1 if we don't do anything special. */
b5ba9f3a 4190
32c2fdea 4191alias_set_type
1cae46be 4192c_common_get_alias_set (tree t)
b5ba9f3a 4193{
be4f2de7 4194 tree u;
4ee9c684 4195 PTR *slot;
1cae46be 4196
e58c17e7 4197 /* For VLAs, use the alias set of the element type rather than the
4198 default of alias set 0 for types compared structurally. */
4199 if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
4200 {
4201 if (TREE_CODE (t) == ARRAY_TYPE)
4202 return get_alias_set (TREE_TYPE (t));
4203 return -1;
4204 }
4205
be4f2de7 4206 /* Permit type-punning when accessing a union, provided the access
4207 is directly through the union. For example, this code does not
4208 permit taking the address of a union member and then storing
4209 through it. Even the type-punning allowed here is a GCC
4210 extension, albeit a common and useful one; the C standard says
4211 that such accesses have implementation-defined behavior. */
4212 for (u = t;
4213 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4214 u = TREE_OPERAND (u, 0))
4215 if (TREE_CODE (u) == COMPONENT_REF
4216 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4217 return 0;
1e2513d9 4218
9fcc3e54 4219 /* That's all the expressions we handle specially. */
84166705 4220 if (!TYPE_P (t))
9fcc3e54 4221 return -1;
4222
d716ce75 4223 /* The C standard guarantees that any object may be accessed via an
9fcc3e54 4224 lvalue that has character type. */
4225 if (t == char_type_node
4226 || t == signed_char_type_node
4227 || t == unsigned_char_type_node)
f7c44134 4228 return 0;
a5b1863e 4229
1607663f 4230 /* The C standard specifically allows aliasing between signed and
4231 unsigned variants of the same type. We treat the signed
4232 variant as canonical. */
78a8ed03 4233 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
a8868e19 4234 {
4070745f 4235 tree t1 = c_common_signed_type (t);
1607663f 4236
a8868e19 4237 /* t1 == t can happen for boolean nodes which are always unsigned. */
4238 if (t1 != t)
4239 return get_alias_set (t1);
4240 }
1e2513d9 4241
4ee9c684 4242 /* Handle the case of multiple type nodes referring to "the same" type,
4243 which occurs with IMA. These share an alias set. FIXME: Currently only
4244 C90 is handled. (In C99 type compatibility is not transitive, which
4245 complicates things mightily. The alias set splay trees can theoretically
4246 represent this, but insertion is tricky when you consider all the
4247 different orders things might arrive in.) */
4248
4249 if (c_language != clk_c || flag_isoc99)
4250 return -1;
4251
0bed3869 4252 /* Save time if there's only one input file. */
e08bd2f4 4253 if (num_in_fnames == 1)
4ee9c684 4254 return -1;
4255
4256 /* Pointers need special handling if they point to any type that
4257 needs special handling (below). */
4258 if (TREE_CODE (t) == POINTER_TYPE)
4259 {
4260 tree t2;
4261 /* Find bottom type under any nested POINTERs. */
b27ac6b5 4262 for (t2 = TREE_TYPE (t);
af592f67 4263 TREE_CODE (t2) == POINTER_TYPE;
4264 t2 = TREE_TYPE (t2))
4265 ;
b27ac6b5 4266 if (TREE_CODE (t2) != RECORD_TYPE
af592f67 4267 && TREE_CODE (t2) != ENUMERAL_TYPE
4268 && TREE_CODE (t2) != QUAL_UNION_TYPE
4269 && TREE_CODE (t2) != UNION_TYPE)
4270 return -1;
4ee9c684 4271 if (TYPE_SIZE (t2) == 0)
af592f67 4272 return -1;
4ee9c684 4273 }
4274 /* These are the only cases that need special handling. */
b27ac6b5 4275 if (TREE_CODE (t) != RECORD_TYPE
4ee9c684 4276 && TREE_CODE (t) != ENUMERAL_TYPE
4277 && TREE_CODE (t) != QUAL_UNION_TYPE
4278 && TREE_CODE (t) != UNION_TYPE
4279 && TREE_CODE (t) != POINTER_TYPE)
4280 return -1;
4281 /* Undefined? */
4282 if (TYPE_SIZE (t) == 0)
4283 return -1;
4284
b27ac6b5 4285 /* Look up t in hash table. Only one of the compatible types within each
4ee9c684 4286 alias set is recorded in the table. */
4287 if (!type_hash_table)
1ecd4018 4288 type_hash_table = htab_create_ggc (1021, c_type_hash,
4ee9c684 4289 (htab_eq) lang_hooks.types_compatible_p,
4290 NULL);
4291 slot = htab_find_slot (type_hash_table, t, INSERT);
4292 if (*slot != NULL)
ad16cb2c 4293 {
4294 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
4295 return TYPE_ALIAS_SET ((tree)*slot);
4296 }
4ee9c684 4297 else
4298 /* Our caller will assign and record (in t) a new alias set; all we need
4299 to do is remember t in the hash table. */
4300 *slot = t;
4301
f7c44134 4302 return -1;
b5ba9f3a 4303}
902b4e01 4304\f
e60a6f7b 4305/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4306 the second parameter indicates which OPERATOR is being applied.
4307 The COMPLAIN flag controls whether we should diagnose possibly
4308 ill-formed constructs or not. LOC is the location of the SIZEOF or
4309 TYPEOF operator. */
908c697e 4310
902b4e01 4311tree
e60a6f7b 4312c_sizeof_or_alignof_type (location_t loc,
4313 tree type, bool is_sizeof, int complain)
902b4e01 4314{
d4c4d95c 4315 const char *op_name;
4316 tree value = NULL;
4317 enum tree_code type_code = TREE_CODE (type);
1cae46be 4318
908c697e 4319 op_name = is_sizeof ? "sizeof" : "__alignof__";
1cae46be 4320
d4c4d95c 4321 if (type_code == FUNCTION_TYPE)
902b4e01 4322 {
908c697e 4323 if (is_sizeof)
d4c4d95c 4324 {
d3a4d008 4325 if (complain && (pedantic || warn_pointer_arith))
48e1416a 4326 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
8864917d 4327 "invalid application of %<sizeof%> to a function type");
ebd21de4 4328 else if (!complain)
4329 return error_mark_node;
d4c4d95c 4330 value = size_one_node;
4331 }
4332 else
4333 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
4334 }
4335 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
4336 {
1cae46be 4337 if (type_code == VOID_TYPE
d3a4d008 4338 && complain && (pedantic || warn_pointer_arith))
48e1416a 4339 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
8864917d 4340 "invalid application of %qs to a void type", op_name);
ebd21de4 4341 else if (!complain)
4342 return error_mark_node;
d4c4d95c 4343 value = size_one_node;
902b4e01 4344 }
902b4e01 4345 else if (!COMPLETE_TYPE_P (type))
4346 {
d3a4d008 4347 if (complain)
e60a6f7b 4348 error_at (loc, "invalid application of %qs to incomplete type %qT ",
4349 op_name, type);
9c719c74 4350 return error_mark_node;
902b4e01 4351 }
4352 else
d4c4d95c 4353 {
908c697e 4354 if (is_sizeof)
d4c4d95c 4355 /* Convert in case a char is more than one unit. */
389dd41b 4356 value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
4357 size_int (TYPE_PRECISION (char_type_node)
4358 / BITS_PER_UNIT));
d4c4d95c 4359 else
d37625c0 4360 value = size_int (TYPE_ALIGN_UNIT (type));
d4c4d95c 4361 }
902b4e01 4362
d4c4d95c 4363 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4364 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4365 never happen. However, this node should really have type
4366 `size_t', which is just a typedef for an ordinary integer type. */
389dd41b 4367 value = fold_convert_loc (loc, size_type_node, value);
1d8fc210 4368 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
1cae46be 4369
d4c4d95c 4370 return value;
902b4e01 4371}
4372
4373/* Implement the __alignof keyword: Return the minimum required
097b5c8b 4374 alignment of EXPR, measured in bytes. For VAR_DECLs,
4375 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
e60a6f7b 4376 from an "aligned" __attribute__ specification). LOC is the
4377 location of the ALIGNOF operator. */
72040e7e 4378
902b4e01 4379tree
e60a6f7b 4380c_alignof_expr (location_t loc, tree expr)
902b4e01 4381{
4382 tree t;
4383
097b5c8b 4384 if (VAR_OR_FUNCTION_DECL_P (expr))
d37625c0 4385 t = size_int (DECL_ALIGN_UNIT (expr));
1cae46be 4386
902b4e01 4387 else if (TREE_CODE (expr) == COMPONENT_REF
4388 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
4389 {
e60a6f7b 4390 error_at (loc, "%<__alignof%> applied to a bit-field");
902b4e01 4391 t = size_one_node;
4392 }
4393 else if (TREE_CODE (expr) == COMPONENT_REF
7cc7e163 4394 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
d37625c0 4395 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
1cae46be 4396
902b4e01 4397 else if (TREE_CODE (expr) == INDIRECT_REF)
4398 {
4399 tree t = TREE_OPERAND (expr, 0);
4400 tree best = t;
4401 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1cae46be 4402
72dd6141 4403 while (CONVERT_EXPR_P (t)
7cc7e163 4404 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
902b4e01 4405 {
4406 int thisalign;
4407
4408 t = TREE_OPERAND (t, 0);
4409 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4410 if (thisalign > bestalign)
4411 best = t, bestalign = thisalign;
4412 }
e60a6f7b 4413 return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
902b4e01 4414 }
4415 else
e60a6f7b 4416 return c_alignof (loc, TREE_TYPE (expr));
902b4e01 4417
389dd41b 4418 return fold_convert_loc (loc, size_type_node, t);
902b4e01 4419}
4420\f
8fe4a266 4421/* Handle C and C++ default attributes. */
4422
4423enum built_in_attribute
4424{
4425#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4426#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4427#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4428#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
8fe4a266 4429#include "builtin-attrs.def"
4430#undef DEF_ATTR_NULL_TREE
4431#undef DEF_ATTR_INT
4432#undef DEF_ATTR_IDENT
4433#undef DEF_ATTR_TREE_LIST
8fe4a266 4434 ATTR_LAST
4435};
4436
4437static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
4438
1cae46be 4439static void c_init_attributes (void);
8fe4a266 4440
27213ba3 4441enum c_builtin_type
72040e7e 4442{
d2d4bdde 4443#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4444#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4445#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4446#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4447#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4448#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
0a39fd54 4449#define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
27213ba3 4450#define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4451#define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
d2d4bdde 4452#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4453#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4454#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
03901330 4455#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
0a39fd54 4456#define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4457#define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4458 NAME,
d2d4bdde 4459#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4460#include "builtin-types.def"
4461#undef DEF_PRIMITIVE_TYPE
4462#undef DEF_FUNCTION_TYPE_0
4463#undef DEF_FUNCTION_TYPE_1
4464#undef DEF_FUNCTION_TYPE_2
4465#undef DEF_FUNCTION_TYPE_3
4466#undef DEF_FUNCTION_TYPE_4
0a39fd54 4467#undef DEF_FUNCTION_TYPE_5
4468#undef DEF_FUNCTION_TYPE_6
27213ba3 4469#undef DEF_FUNCTION_TYPE_7
d2d4bdde 4470#undef DEF_FUNCTION_TYPE_VAR_0
4471#undef DEF_FUNCTION_TYPE_VAR_1
4472#undef DEF_FUNCTION_TYPE_VAR_2
03901330 4473#undef DEF_FUNCTION_TYPE_VAR_3
0a39fd54 4474#undef DEF_FUNCTION_TYPE_VAR_4
4475#undef DEF_FUNCTION_TYPE_VAR_5
d2d4bdde 4476#undef DEF_POINTER_TYPE
27213ba3 4477 BT_LAST
4478};
4479
4480typedef enum c_builtin_type builtin_type;
d2d4bdde 4481
27213ba3 4482/* A temporary array for c_common_nodes_and_builtins. Used in
4483 communication with def_fn_type. */
4484static tree builtin_types[(int) BT_LAST + 1];
d2d4bdde 4485
27213ba3 4486/* A helper function for c_common_nodes_and_builtins. Build function type
4487 for DEF with return type RET and N arguments. If VAR is true, then the
4488 function should be variadic after those N arguments.
4489
4490 Takes special care not to ICE if any of the types involved are
4491 error_mark_node, which indicates that said type is not in fact available
4492 (see builtin_type_for_size). In which case the function type as a whole
4493 should be error_mark_node. */
4494
4495static void
4496def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
4497{
3a939d12 4498 tree t;
4499 tree *args = XALLOCAVEC (tree, n);
27213ba3 4500 va_list list;
4501 int i;
4502
4503 va_start (list, n);
4504 for (i = 0; i < n; ++i)
4505 {
7d339f93 4506 builtin_type a = (builtin_type) va_arg (list, int);
27213ba3 4507 t = builtin_types[a];
4508 if (t == error_mark_node)
4509 goto egress;
3a939d12 4510 args[i] = t;
27213ba3 4511 }
27213ba3 4512
27213ba3 4513 t = builtin_types[ret];
4514 if (t == error_mark_node)
4515 goto egress;
3a939d12 4516 if (var)
4517 t = build_varargs_function_type_array (t, n, args);
4518 else
4519 t = build_function_type_array (t, n, args);
27213ba3 4520
4521 egress:
4522 builtin_types[def] = t;
451c8e2f 4523 va_end (list);
27213ba3 4524}
4525
dce22712 4526/* Build builtin functions common to both C and C++ language
4527 frontends. */
4528
4529static void
4530c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
4531{
4532#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4533 builtin_types[ENUM] = VALUE;
4534#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4535 def_fn_type (ENUM, RETURN, 0, 0);
4536#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4537 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4538#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4539 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4540#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4541 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4542#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4543 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4544#define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4545 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4546#define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4547 ARG6) \
4548 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4549#define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4550 ARG6, ARG7) \
4551 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4552#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4553 def_fn_type (ENUM, RETURN, 1, 0);
4554#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4555 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4556#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4557 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4558#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4559 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4560#define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4561 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4562#define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4563 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4564#define DEF_POINTER_TYPE(ENUM, TYPE) \
4565 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4566
4567#include "builtin-types.def"
4568
4569#undef DEF_PRIMITIVE_TYPE
4570#undef DEF_FUNCTION_TYPE_1
4571#undef DEF_FUNCTION_TYPE_2
4572#undef DEF_FUNCTION_TYPE_3
4573#undef DEF_FUNCTION_TYPE_4
4574#undef DEF_FUNCTION_TYPE_5
4575#undef DEF_FUNCTION_TYPE_6
4576#undef DEF_FUNCTION_TYPE_VAR_0
4577#undef DEF_FUNCTION_TYPE_VAR_1
4578#undef DEF_FUNCTION_TYPE_VAR_2
4579#undef DEF_FUNCTION_TYPE_VAR_3
4580#undef DEF_FUNCTION_TYPE_VAR_4
4581#undef DEF_FUNCTION_TYPE_VAR_5
4582#undef DEF_POINTER_TYPE
4583 builtin_types[(int) BT_LAST] = NULL_TREE;
4584
4585 c_init_attributes ();
4586
4587#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4588 NONANSI_P, ATTRS, IMPLICIT, COND) \
4589 if (NAME && COND) \
4590 def_builtin_1 (ENUM, NAME, CLASS, \
4591 builtin_types[(int) TYPE], \
4592 builtin_types[(int) LIBTYPE], \
4593 BOTH_P, FALLBACK_P, NONANSI_P, \
4594 built_in_attributes[(int) ATTRS], IMPLICIT);
4595#include "builtins.def"
4596#undef DEF_BUILTIN
4597
87eb1c28 4598 targetm.init_builtins ();
4599
471eff36 4600 build_common_builtin_nodes ();
dce22712 4601
dce22712 4602 if (flag_mudflap)
4603 mudflap_init ();
4604}
4605
9e6687c8 4606/* Like get_identifier, but avoid warnings about null arguments when
4607 the argument may be NULL for targets where GCC lacks stdint.h type
4608 information. */
4609
4610static inline tree
4611c_get_ident (const char *id)
4612{
4613 return get_identifier (id);
4614}
4615
27213ba3 4616/* Build tree nodes and builtin functions common to both C and C++ language
4617 frontends. */
4618
4619void
4620c_common_nodes_and_builtins (void)
4621{
924bbf02 4622 int char16_type_size;
4623 int char32_type_size;
174fcc61 4624 int wchar_type_size;
4625 tree array_domain_type;
2d47cc32 4626 tree va_list_ref_type_node;
8a15c04a 4627 tree va_list_arg_type_node;
a66c9326 4628
c38a75b7 4629 build_common_tree_nodes (flag_signed_char, flag_short_double);
e593356b 4630
174fcc61 4631 /* Define `int' and `char' first so that dbx will output them first. */
d946ea19 4632 record_builtin_type (RID_INT, NULL, integer_type_node);
174fcc61 4633 record_builtin_type (RID_CHAR, "char", char_type_node);
4634
4635 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4636 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4637 but not C. Are the conditionals here needed? */
c0f19401 4638 if (c_dialect_cxx ())
d946ea19 4639 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
174fcc61 4640 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
4641 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
4642 record_builtin_type (RID_MAX, "long unsigned int",
4643 long_unsigned_type_node);
6388cfe2 4644 if (int128_integer_type_node != NULL_TREE)
4645 {
4646 record_builtin_type (RID_INT128, "__int128",
4647 int128_integer_type_node);
4648 record_builtin_type (RID_MAX, "__int128 unsigned",
4649 int128_unsigned_type_node);
4650 }
c0f19401 4651 if (c_dialect_cxx ())
174fcc61 4652 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
4653 record_builtin_type (RID_MAX, "long long int",
4654 long_long_integer_type_node);
4655 record_builtin_type (RID_MAX, "long long unsigned int",
4656 long_long_unsigned_type_node);
c0f19401 4657 if (c_dialect_cxx ())
174fcc61 4658 record_builtin_type (RID_MAX, "long long unsigned",
4659 long_long_unsigned_type_node);
4660 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
4661 record_builtin_type (RID_MAX, "short unsigned int",
4662 short_unsigned_type_node);
c0f19401 4663 if (c_dialect_cxx ())
174fcc61 4664 record_builtin_type (RID_MAX, "unsigned short",
4665 short_unsigned_type_node);
4666
4667 /* Define both `signed char' and `unsigned char'. */
4668 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
4669 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
4670
771d21fa 4671 /* These are types that c_common_type_for_size and
4672 c_common_type_for_mode use. */
e60a6f7b 4673 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4674 TYPE_DECL, NULL_TREE,
dc24ddbd 4675 intQI_type_node));
e60a6f7b 4676 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4677 TYPE_DECL, NULL_TREE,
dc24ddbd 4678 intHI_type_node));
e60a6f7b 4679 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4680 TYPE_DECL, NULL_TREE,
dc24ddbd 4681 intSI_type_node));
e60a6f7b 4682 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4683 TYPE_DECL, NULL_TREE,
dc24ddbd 4684 intDI_type_node));
174fcc61 4685#if HOST_BITS_PER_WIDE_INT >= 64
f1515a39 4686 if (targetm.scalar_mode_supported_p (TImode))
e60a6f7b 4687 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4688 TYPE_DECL,
f1515a39 4689 get_identifier ("__int128_t"),
4690 intTI_type_node));
174fcc61 4691#endif
e60a6f7b 4692 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4693 TYPE_DECL, NULL_TREE,
dc24ddbd 4694 unsigned_intQI_type_node));
e60a6f7b 4695 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4696 TYPE_DECL, NULL_TREE,
dc24ddbd 4697 unsigned_intHI_type_node));
e60a6f7b 4698 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4699 TYPE_DECL, NULL_TREE,
dc24ddbd 4700 unsigned_intSI_type_node));
e60a6f7b 4701 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4702 TYPE_DECL, NULL_TREE,
dc24ddbd 4703 unsigned_intDI_type_node));
174fcc61 4704#if HOST_BITS_PER_WIDE_INT >= 64
f1515a39 4705 if (targetm.scalar_mode_supported_p (TImode))
e60a6f7b 4706 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4707 TYPE_DECL,
f1515a39 4708 get_identifier ("__uint128_t"),
4709 unsigned_intTI_type_node));
174fcc61 4710#endif
4711
4712 /* Create the widest literal types. */
4713 widest_integer_literal_type_node
4714 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
e60a6f7b 4715 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4716 TYPE_DECL, NULL_TREE,
dc24ddbd 4717 widest_integer_literal_type_node));
174fcc61 4718
4719 widest_unsigned_literal_type_node
4720 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
e60a6f7b 4721 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4722 TYPE_DECL, NULL_TREE,
dc24ddbd 4723 widest_unsigned_literal_type_node));
174fcc61 4724
654ef926 4725 signed_size_type_node = c_common_signed_type (size_type_node);
174fcc61 4726
73673831 4727 pid_type_node =
4728 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
4729
d946ea19 4730 record_builtin_type (RID_FLOAT, NULL, float_type_node);
4731 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
174fcc61 4732 record_builtin_type (RID_MAX, "long double", long_double_type_node);
4733
c4503c0a 4734 /* Only supported decimal floating point extension if the target
4735 actually supports underlying modes. */
48e1416a 4736 if (targetm.scalar_mode_supported_p (SDmode)
c4503c0a 4737 && targetm.scalar_mode_supported_p (DDmode)
4738 && targetm.scalar_mode_supported_p (TDmode))
4739 {
4740 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
4741 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
4742 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
4743 }
4744
9421ebb9 4745 if (targetm.fixed_point_supported_p ())
4746 {
4747 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
4748 record_builtin_type (RID_FRACT, NULL, fract_type_node);
4749 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
4750 record_builtin_type (RID_MAX, "long long _Fract",
4751 long_long_fract_type_node);
4752 record_builtin_type (RID_MAX, "unsigned short _Fract",
4753 unsigned_short_fract_type_node);
4754 record_builtin_type (RID_MAX, "unsigned _Fract",
4755 unsigned_fract_type_node);
4756 record_builtin_type (RID_MAX, "unsigned long _Fract",
4757 unsigned_long_fract_type_node);
4758 record_builtin_type (RID_MAX, "unsigned long long _Fract",
4759 unsigned_long_long_fract_type_node);
4760 record_builtin_type (RID_MAX, "_Sat short _Fract",
4761 sat_short_fract_type_node);
4762 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
4763 record_builtin_type (RID_MAX, "_Sat long _Fract",
4764 sat_long_fract_type_node);
4765 record_builtin_type (RID_MAX, "_Sat long long _Fract",
4766 sat_long_long_fract_type_node);
4767 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
4768 sat_unsigned_short_fract_type_node);
4769 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
4770 sat_unsigned_fract_type_node);
4771 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
4772 sat_unsigned_long_fract_type_node);
4773 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
4774 sat_unsigned_long_long_fract_type_node);
4775 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
4776 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
4777 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
4778 record_builtin_type (RID_MAX, "long long _Accum",
4779 long_long_accum_type_node);
4780 record_builtin_type (RID_MAX, "unsigned short _Accum",
4781 unsigned_short_accum_type_node);
4782 record_builtin_type (RID_MAX, "unsigned _Accum",
4783 unsigned_accum_type_node);
4784 record_builtin_type (RID_MAX, "unsigned long _Accum",
4785 unsigned_long_accum_type_node);
4786 record_builtin_type (RID_MAX, "unsigned long long _Accum",
4787 unsigned_long_long_accum_type_node);
4788 record_builtin_type (RID_MAX, "_Sat short _Accum",
4789 sat_short_accum_type_node);
4790 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
4791 record_builtin_type (RID_MAX, "_Sat long _Accum",
4792 sat_long_accum_type_node);
4793 record_builtin_type (RID_MAX, "_Sat long long _Accum",
4794 sat_long_long_accum_type_node);
4795 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
4796 sat_unsigned_short_accum_type_node);
4797 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
4798 sat_unsigned_accum_type_node);
4799 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
4800 sat_unsigned_long_accum_type_node);
4801 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
4802 sat_unsigned_long_long_accum_type_node);
4803
4804 }
4805
e60a6f7b 4806 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4807 TYPE_DECL,
dc24ddbd 4808 get_identifier ("complex int"),
4809 complex_integer_type_node));
e60a6f7b 4810 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4811 TYPE_DECL,
dc24ddbd 4812 get_identifier ("complex float"),
4813 complex_float_type_node));
e60a6f7b 4814 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4815 TYPE_DECL,
dc24ddbd 4816 get_identifier ("complex double"),
4817 complex_double_type_node));
4818 lang_hooks.decls.pushdecl
e60a6f7b 4819 (build_decl (UNKNOWN_LOCATION,
4820 TYPE_DECL, get_identifier ("complex long double"),
20325f61 4821 complex_long_double_type_node));
174fcc61 4822
e256d445 4823 if (c_dialect_cxx ())
4824 /* For C++, make fileptr_type_node a distinct void * type until
4825 FILE type is defined. */
e086912e 4826 fileptr_type_node = build_variant_type_copy (ptr_type_node);
e256d445 4827
d946ea19 4828 record_builtin_type (RID_VOID, NULL, void_type_node);
174fcc61 4829
6753bca0 4830 /* Set the TYPE_NAME for any variants that were built before
4831 record_builtin_type gave names to the built-in types. */
4832 {
4833 tree void_name = TYPE_NAME (void_type_node);
4834 TYPE_NAME (void_type_node) = NULL_TREE;
4835 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
4836 = void_name;
4837 TYPE_NAME (void_type_node) = void_name;
4838 }
4839
fbf0afd1 4840 /* This node must not be shared. */
7c446c95 4841 void_zero_node = make_node (INTEGER_CST);
d2d4bdde 4842 TREE_TYPE (void_zero_node) = void_type_node;
4843
174fcc61 4844 void_list_node = build_void_list_node ();
4845
4846 /* Make a type to be the domain of a few array types
4847 whose domains don't really matter.
4848 200 is small enough that it always fits in size_t
4849 and large enough that it can hold most function names for the
4850 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4851 array_domain_type = build_index_type (size_int (200));
4852
4853 /* Make a type for arrays of characters.
4854 With luck nothing will ever really depend on the length of this
4855 array type. */
4856 char_array_type_node
4857 = build_array_type (char_type_node, array_domain_type);
4858
4859 /* Likewise for arrays of ints. */
4860 int_array_type_node
4861 = build_array_type (integer_type_node, array_domain_type);
4862
d2d4bdde 4863 string_type_node = build_pointer_type (char_type_node);
4864 const_string_type_node
4865 = build_pointer_type (build_qualified_type
4866 (char_type_node, TYPE_QUAL_CONST));
4867
174fcc61 4868 /* This is special for C++ so functions can be overloaded. */
18ef7ac2 4869 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
174fcc61 4870 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
4871 wchar_type_size = TYPE_PRECISION (wchar_type_node);
f3449a3c 4872 underlying_wchar_type_node = wchar_type_node;
c0f19401 4873 if (c_dialect_cxx ())
174fcc61 4874 {
78a8ed03 4875 if (TYPE_UNSIGNED (wchar_type_node))
174fcc61 4876 wchar_type_node = make_unsigned_type (wchar_type_size);
4877 else
4878 wchar_type_node = make_signed_type (wchar_type_size);
4879 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
4880 }
174fcc61 4881
4882 /* This is for wide string constants. */
4883 wchar_array_type_node
4884 = build_array_type (wchar_type_node, array_domain_type);
4885
924bbf02 4886 /* Define 'char16_t'. */
4887 char16_type_node = get_identifier (CHAR16_TYPE);
4888 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
4889 char16_type_size = TYPE_PRECISION (char16_type_node);
4890 if (c_dialect_cxx ())
4891 {
4892 char16_type_node = make_unsigned_type (char16_type_size);
4893
4894 if (cxx_dialect == cxx0x)
4895 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
4896 }
4897
4898 /* This is for UTF-16 string constants. */
4899 char16_array_type_node
4900 = build_array_type (char16_type_node, array_domain_type);
4901
4902 /* Define 'char32_t'. */
4903 char32_type_node = get_identifier (CHAR32_TYPE);
4904 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
4905 char32_type_size = TYPE_PRECISION (char32_type_node);
4906 if (c_dialect_cxx ())
4907 {
4908 char32_type_node = make_unsigned_type (char32_type_size);
4909
4910 if (cxx_dialect == cxx0x)
4911 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
4912 }
4913
4914 /* This is for UTF-32 string constants. */
4915 char32_array_type_node
4916 = build_array_type (char32_type_node, array_domain_type);
4917
6bf5ed8d 4918 wint_type_node =
4919 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
4920
4921 intmax_type_node =
4922 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
4923 uintmax_type_node =
4924 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
4925
f3449a3c 4926 if (SIG_ATOMIC_TYPE)
4927 sig_atomic_type_node =
9e6687c8 4928 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
f3449a3c 4929 if (INT8_TYPE)
4930 int8_type_node =
9e6687c8 4931 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
f3449a3c 4932 if (INT16_TYPE)
4933 int16_type_node =
9e6687c8 4934 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
f3449a3c 4935 if (INT32_TYPE)
4936 int32_type_node =
9e6687c8 4937 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
f3449a3c 4938 if (INT64_TYPE)
4939 int64_type_node =
9e6687c8 4940 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
f3449a3c 4941 if (UINT8_TYPE)
4942 uint8_type_node =
9e6687c8 4943 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
f3449a3c 4944 if (UINT16_TYPE)
4945 uint16_type_node =
9e6687c8 4946 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
f3449a3c 4947 if (UINT32_TYPE)
4948 c_uint32_type_node =
9e6687c8 4949 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
f3449a3c 4950 if (UINT64_TYPE)
4951 c_uint64_type_node =
9e6687c8 4952 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
f3449a3c 4953 if (INT_LEAST8_TYPE)
4954 int_least8_type_node =
9e6687c8 4955 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
f3449a3c 4956 if (INT_LEAST16_TYPE)
4957 int_least16_type_node =
9e6687c8 4958 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
f3449a3c 4959 if (INT_LEAST32_TYPE)
4960 int_least32_type_node =
9e6687c8 4961 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
f3449a3c 4962 if (INT_LEAST64_TYPE)
4963 int_least64_type_node =
9e6687c8 4964 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
f3449a3c 4965 if (UINT_LEAST8_TYPE)
4966 uint_least8_type_node =
9e6687c8 4967 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
f3449a3c 4968 if (UINT_LEAST16_TYPE)
4969 uint_least16_type_node =
9e6687c8 4970 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
f3449a3c 4971 if (UINT_LEAST32_TYPE)
4972 uint_least32_type_node =
9e6687c8 4973 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
f3449a3c 4974 if (UINT_LEAST64_TYPE)
4975 uint_least64_type_node =
9e6687c8 4976 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
f3449a3c 4977 if (INT_FAST8_TYPE)
4978 int_fast8_type_node =
9e6687c8 4979 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
f3449a3c 4980 if (INT_FAST16_TYPE)
4981 int_fast16_type_node =
9e6687c8 4982 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
f3449a3c 4983 if (INT_FAST32_TYPE)
4984 int_fast32_type_node =
9e6687c8 4985 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
f3449a3c 4986 if (INT_FAST64_TYPE)
4987 int_fast64_type_node =
9e6687c8 4988 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
f3449a3c 4989 if (UINT_FAST8_TYPE)
4990 uint_fast8_type_node =
9e6687c8 4991 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
f3449a3c 4992 if (UINT_FAST16_TYPE)
4993 uint_fast16_type_node =
9e6687c8 4994 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
f3449a3c 4995 if (UINT_FAST32_TYPE)
4996 uint_fast32_type_node =
9e6687c8 4997 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
f3449a3c 4998 if (UINT_FAST64_TYPE)
4999 uint_fast64_type_node =
9e6687c8 5000 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
f3449a3c 5001 if (INTPTR_TYPE)
5002 intptr_type_node =
9e6687c8 5003 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
f3449a3c 5004 if (UINTPTR_TYPE)
5005 uintptr_type_node =
9e6687c8 5006 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
f3449a3c 5007
3a939d12 5008 default_function_type
5009 = build_varargs_function_type_list (integer_type_node, NULL_TREE);
6bf5ed8d 5010 ptrdiff_type_node
5011 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
11773141 5012 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
6bf5ed8d 5013
dc24ddbd 5014 lang_hooks.decls.pushdecl
e60a6f7b 5015 (build_decl (UNKNOWN_LOCATION,
5016 TYPE_DECL, get_identifier ("__builtin_va_list"),
20325f61 5017 va_list_type_node));
202d6e5f 5018 if (targetm.enum_va_list_p)
acd6f472 5019 {
5020 int l;
5021 const char *pname;
5022 tree ptype;
5f57a8b1 5023
202d6e5f 5024 for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
acd6f472 5025 {
5026 lang_hooks.decls.pushdecl
5027 (build_decl (UNKNOWN_LOCATION,
5028 TYPE_DECL, get_identifier (pname),
5029 ptype));
5030
5031 }
5032 }
8a15c04a 5033
8a15c04a 5034 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
2d47cc32 5035 {
5036 va_list_arg_type_node = va_list_ref_type_node =
5037 build_pointer_type (TREE_TYPE (va_list_type_node));
5038 }
8a15c04a 5039 else
2d47cc32 5040 {
5041 va_list_arg_type_node = va_list_type_node;
5042 va_list_ref_type_node = build_reference_type (va_list_type_node);
5043 }
1cae46be 5044
dce22712 5045 if (!flag_preprocess_only)
5046 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
ffa8918b 5047
5c62f199 5048 main_identifier_node = get_identifier ("main");
ae84079f 5049
5050 /* Create the built-in __null node. It is important that this is
5051 not shared. */
5052 null_node = make_node (INTEGER_CST);
5053 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
27213ba3 5054
5055 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5056 memset (builtin_types, 0, sizeof (builtin_types));
72040e7e 5057}
a66c9326 5058
79b01846 5059/* The number of named compound-literals generated thus far. */
5060static GTY(()) int compound_literal_number;
5061
5062/* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5063
5064void
5065set_compound_literal_name (tree decl)
5066{
5067 char *name;
5068 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
5069 compound_literal_number);
5070 compound_literal_number++;
5071 DECL_NAME (decl) = get_identifier (name);
5072}
5073
a66c9326 5074tree
e60a6f7b 5075build_va_arg (location_t loc, tree expr, tree type)
a66c9326 5076{
e60a6f7b 5077 expr = build1 (VA_ARG_EXPR, type, expr);
5078 SET_EXPR_LOCATION (expr, loc);
5079 return expr;
a66c9326 5080}
0d4238dc 5081
5082
dd878098 5083/* Linked list of disabled built-in functions. */
5084
5085typedef struct disabled_builtin
5086{
5087 const char *name;
5088 struct disabled_builtin *next;
5089} disabled_builtin;
5090static disabled_builtin *disabled_builtins = NULL;
5091
1cae46be 5092static bool builtin_function_disabled_p (const char *);
dd878098 5093
5094/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5095 begins with "__builtin_", give an error. */
5096
5097void
1cae46be 5098disable_builtin_function (const char *name)
dd878098 5099{
5100 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
b0b1af64 5101 error ("cannot disable built-in function %qs", name);
dd878098 5102 else
5103 {
e85905e5 5104 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
5105 new_disabled_builtin->name = name;
5106 new_disabled_builtin->next = disabled_builtins;
5107 disabled_builtins = new_disabled_builtin;
dd878098 5108 }
5109}
5110
5111
5112/* Return true if the built-in function NAME has been disabled, false
5113 otherwise. */
5114
5115static bool
1cae46be 5116builtin_function_disabled_p (const char *name)
dd878098 5117{
5118 disabled_builtin *p;
5119 for (p = disabled_builtins; p != NULL; p = p->next)
5120 {
5121 if (strcmp (name, p->name) == 0)
5122 return true;
5123 }
5124 return false;
5125}
5126
5127
3237155d 5128/* Worker for DEF_BUILTIN.
5129 Possibly define a builtin function with one or two names.
5130 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5131 nonansi_p and flag_no_nonansi_builtin. */
0d4238dc 5132
3237155d 5133static void
5134def_builtin_1 (enum built_in_function fncode,
5135 const char *name,
5136 enum built_in_class fnclass,
5137 tree fntype, tree libtype,
5138 bool both_p, bool fallback_p, bool nonansi_p,
5139 tree fnattrs, bool implicit_p)
0d4238dc 5140{
3237155d 5141 tree decl;
5142 const char *libname;
5143
27213ba3 5144 if (fntype == error_mark_node)
5145 return;
5146
3237155d 5147 gcc_assert ((!both_p && !fallback_p)
5148 || !strncmp (name, "__builtin_",
5149 strlen ("__builtin_")));
5150
5151 libname = name + strlen ("__builtin_");
54be5d7e 5152 decl = add_builtin_function (name, fntype, fncode, fnclass,
5153 (fallback_p ? libname : NULL),
5154 fnattrs);
3237155d 5155 if (both_p
5156 && !flag_no_builtin && !builtin_function_disabled_p (libname)
dd878098 5157 && !(nonansi_p && flag_no_nonansi_builtin))
54be5d7e 5158 add_builtin_function (libname, libtype, fncode, fnclass,
5159 NULL, fnattrs);
a40609e6 5160
3237155d 5161 built_in_decls[(int) fncode] = decl;
5162 if (implicit_p)
5163 implicit_built_in_decls[(int) fncode] = decl;
0d4238dc 5164}
e94026da 5165\f
d7aeef06 5166/* Nonzero if the type T promotes to int. This is (nearly) the
5167 integral promotions defined in ISO C99 6.3.1.1/2. */
5168
5169bool
9f627b1a 5170c_promoting_integer_type_p (const_tree t)
d7aeef06 5171{
5172 switch (TREE_CODE (t))
5173 {
5174 case INTEGER_TYPE:
5175 return (TYPE_MAIN_VARIANT (t) == char_type_node
5176 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
5177 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
5178 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
7aa1e6eb 5179 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
5180 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
d7aeef06 5181
5182 case ENUMERAL_TYPE:
5183 /* ??? Technically all enumerations not larger than an int
5184 promote to an int. But this is used along code paths
5185 that only want to notice a size change. */
5186 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
5187
5188 case BOOLEAN_TYPE:
5189 return 1;
5190
5191 default:
5192 return 0;
5193 }
5194}
5195
e94026da 5196/* Return 1 if PARMS specifies a fixed number of parameters
5197 and none of their types is affected by default promotions. */
5198
5199int
9f627b1a 5200self_promoting_args_p (const_tree parms)
e94026da 5201{
9f627b1a 5202 const_tree t;
e94026da 5203 for (t = parms; t; t = TREE_CHAIN (t))
5204 {
19cb6b50 5205 tree type = TREE_VALUE (t);
43f74bc4 5206
e1d8e198 5207 if (type == error_mark_node)
5208 continue;
5209
e94026da 5210 if (TREE_CHAIN (t) == 0 && type != void_type_node)
5211 return 0;
5212
5213 if (type == 0)
5214 return 0;
5215
5216 if (TYPE_MAIN_VARIANT (type) == float_type_node)
5217 return 0;
5218
d7aeef06 5219 if (c_promoting_integer_type_p (type))
e94026da 5220 return 0;
5221 }
5222 return 1;
5223}
605fb01e 5224
c10de5e7 5225/* Recursively remove any '*' or '&' operator from TYPE. */
5226tree
5227strip_pointer_operator (tree t)
5228{
5229 while (POINTER_TYPE_P (t))
5230 t = TREE_TYPE (t);
5231 return t;
5232}
5233
57a0ed23 5234/* Recursively remove pointer or array type from TYPE. */
5235tree
5236strip_pointer_or_array_types (tree t)
5237{
5238 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
5239 t = TREE_TYPE (t);
5240 return t;
5241}
5242
e41f0d80 5243/* Used to compare case labels. K1 and K2 are actually tree nodes
5244 representing case labels, or NULL_TREE for a `default' label.
5245 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5246 K2, and 0 if K1 and K2 are equal. */
5247
5248int
1cae46be 5249case_compare (splay_tree_key k1, splay_tree_key k2)
e41f0d80 5250{
5251 /* Consider a NULL key (such as arises with a `default' label) to be
5252 smaller than anything else. */
5253 if (!k1)
5254 return k2 ? -1 : 0;
5255 else if (!k2)
5256 return k1 ? 1 : 0;
5257
5258 return tree_int_cst_compare ((tree) k1, (tree) k2);
5259}
5260
e60a6f7b 5261/* Process a case label, located at LOC, for the range LOW_VALUE
5262 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5263 then this case label is actually a `default' label. If only
5264 HIGH_VALUE is NULL_TREE, then case label was declared using the
5265 usual C/C++ syntax, rather than the GNU case range extension.
5266 CASES is a tree containing all the case ranges processed so far;
5267 COND is the condition for the switch-statement itself. Returns the
5268 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5269 is created. */
e41f0d80 5270
5271tree
e60a6f7b 5272c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
2ca392fd 5273 tree low_value, tree high_value)
e41f0d80 5274{
5275 tree type;
5276 tree label;
5277 tree case_label;
5278 splay_tree_node node;
5279
5280 /* Create the LABEL_DECL itself. */
e60a6f7b 5281 label = create_artificial_label (loc);
e41f0d80 5282
5283 /* If there was an error processing the switch condition, bail now
5284 before we get more confused. */
5285 if (!cond || cond == error_mark_node)
4ee9c684 5286 goto error_out;
e41f0d80 5287
1cae46be 5288 if ((low_value && TREE_TYPE (low_value)
5289 && POINTER_TYPE_P (TREE_TYPE (low_value)))
e41f0d80 5290 || (high_value && TREE_TYPE (high_value)
5291 && POINTER_TYPE_P (TREE_TYPE (high_value))))
b96dc121 5292 {
e60a6f7b 5293 error_at (loc, "pointers are not permitted as case values");
b96dc121 5294 goto error_out;
5295 }
e41f0d80 5296
5297 /* Case ranges are a GNU extension. */
8864917d 5298 if (high_value)
48e1416a 5299 pedwarn (loc, OPT_pedantic,
8864917d 5300 "range expressions in switch statements are non-standard");
e41f0d80 5301
5302 type = TREE_TYPE (cond);
5303 if (low_value)
5304 {
5305 low_value = check_case_value (low_value);
5306 low_value = convert_and_check (type, low_value);
96722196 5307 if (low_value == error_mark_node)
5308 goto error_out;
e41f0d80 5309 }
5310 if (high_value)
5311 {
5312 high_value = check_case_value (high_value);
5313 high_value = convert_and_check (type, high_value);
96722196 5314 if (high_value == error_mark_node)
5315 goto error_out;
e41f0d80 5316 }
5317
96722196 5318 if (low_value && high_value)
5319 {
5320 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
a0c938f0 5321 really a case range, even though it was written that way.
5322 Remove the HIGH_VALUE to simplify later processing. */
96722196 5323 if (tree_int_cst_equal (low_value, high_value))
5324 high_value = NULL_TREE;
5325 else if (!tree_int_cst_lt (low_value, high_value))
e60a6f7b 5326 warning_at (loc, 0, "empty range specified");
96722196 5327 }
e41f0d80 5328
2ca392fd 5329 /* See if the case is in range of the type of the original testing
5330 expression. If both low_value and high_value are out of range,
5331 don't insert the case label and return NULL_TREE. */
5332 if (low_value
84166705 5333 && !check_case_bounds (type, orig_type,
5334 &low_value, high_value ? &high_value : NULL))
2ca392fd 5335 return NULL_TREE;
5336
e41f0d80 5337 /* Look up the LOW_VALUE in the table of case labels we already
5338 have. */
5339 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
5340 /* If there was not an exact match, check for overlapping ranges.
5341 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5342 that's a `default' label and the only overlap is an exact match. */
5343 if (!node && (low_value || high_value))
5344 {
5345 splay_tree_node low_bound;
5346 splay_tree_node high_bound;
5347
5348 /* Even though there wasn't an exact match, there might be an
5349 overlap between this case range and another case range.
5350 Since we've (inductively) not allowed any overlapping case
5351 ranges, we simply need to find the greatest low case label
5352 that is smaller that LOW_VALUE, and the smallest low case
5353 label that is greater than LOW_VALUE. If there is an overlap
5354 it will occur in one of these two ranges. */
5355 low_bound = splay_tree_predecessor (cases,
5356 (splay_tree_key) low_value);
5357 high_bound = splay_tree_successor (cases,
5358 (splay_tree_key) low_value);
5359
5360 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5361 the LOW_VALUE, so there is no need to check unless the
5362 LOW_BOUND is in fact itself a case range. */
5363 if (low_bound
5364 && CASE_HIGH ((tree) low_bound->value)
5365 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
5366 low_value) >= 0)
5367 node = low_bound;
5368 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5369 range is bigger than the low end of the current range, so we
5370 are only interested if the current range is a real range, and
5371 not an ordinary case label. */
1cae46be 5372 else if (high_bound
e41f0d80 5373 && high_value
5374 && (tree_int_cst_compare ((tree) high_bound->key,
5375 high_value)
5376 <= 0))
5377 node = high_bound;
5378 }
5379 /* If there was an overlap, issue an error. */
5380 if (node)
5381 {
eaae3b75 5382 tree duplicate = CASE_LABEL ((tree) node->value);
e41f0d80 5383
5384 if (high_value)
5385 {
e60a6f7b 5386 error_at (loc, "duplicate (or overlapping) case value");
5387 error_at (DECL_SOURCE_LOCATION (duplicate),
5388 "this is the first entry overlapping that value");
e41f0d80 5389 }
5390 else if (low_value)
5391 {
e60a6f7b 5392 error_at (loc, "duplicate case value") ;
5393 error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
e41f0d80 5394 }
5395 else
5396 {
e60a6f7b 5397 error_at (loc, "multiple default labels in one switch");
5398 error_at (DECL_SOURCE_LOCATION (duplicate),
5399 "this is the first default label");
e41f0d80 5400 }
4ee9c684 5401 goto error_out;
e41f0d80 5402 }
5403
5404 /* Add a CASE_LABEL to the statement-tree. */
b6e3dd65 5405 case_label = add_stmt (build_case_label (low_value, high_value, label));
e41f0d80 5406 /* Register this case label in the splay tree. */
1cae46be 5407 splay_tree_insert (cases,
e41f0d80 5408 (splay_tree_key) low_value,
5409 (splay_tree_value) case_label);
5410
5411 return case_label;
4ee9c684 5412
5413 error_out:
daf6dff5 5414 /* Add a label so that the back-end doesn't think that the beginning of
4ee9c684 5415 the switch is unreachable. Note that we do not add a case label, as
a53ff4c1 5416 that just leads to duplicates and thence to failure later on. */
4ee9c684 5417 if (!cases->root)
5418 {
e60a6f7b 5419 tree t = create_artificial_label (loc);
5420 add_stmt (build_stmt (loc, LABEL_EXPR, t));
4ee9c684 5421 }
5422 return error_mark_node;
5423}
5424
5425/* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5426 Used to verify that case values match up with enumerator values. */
5427
5428static void
5429match_case_to_enum_1 (tree key, tree type, tree label)
5430{
5431 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
5432
5433 /* ??? Not working too hard to print the double-word value.
5434 Should perhaps be done with %lwd in the diagnostic routines? */
5435 if (TREE_INT_CST_HIGH (key) == 0)
5436 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
5437 TREE_INT_CST_LOW (key));
5438 else if (!TYPE_UNSIGNED (type)
5439 && TREE_INT_CST_HIGH (key) == -1
5440 && TREE_INT_CST_LOW (key) != 0)
5441 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
5442 -TREE_INT_CST_LOW (key));
5443 else
5444 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
7df7561b 5445 (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (key),
5446 (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (key));
4ee9c684 5447
5448 if (TYPE_NAME (type) == 0)
712d2297 5449 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
5450 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
5451 "case value %qs not in enumerated type",
5452 buf);
4ee9c684 5453 else
712d2297 5454 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
5455 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
5456 "case value %qs not in enumerated type %qT",
5457 buf, type);
4ee9c684 5458}
5459
359d87c6 5460/* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5461 Used to verify that case values match up with enumerator values. */
5462
4ee9c684 5463static int
5464match_case_to_enum (splay_tree_node node, void *data)
5465{
5466 tree label = (tree) node->value;
4fd61bc6 5467 tree type = (tree) data;
4ee9c684 5468
5469 /* Skip default case. */
5470 if (!CASE_LOW (label))
5471 return 0;
5472
359d87c6 5473 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4ee9c684 5474 when we did our enum->case scan. Reset our scratch bit after. */
359d87c6 5475 if (!CASE_LOW_SEEN (label))
4ee9c684 5476 match_case_to_enum_1 (CASE_LOW (label), type, label);
5477 else
359d87c6 5478 CASE_LOW_SEEN (label) = 0;
4ee9c684 5479
359d87c6 5480 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5481 not set, that means that CASE_HIGH did not appear when we did our
5482 enum->case scan. Reset our scratch bit after. */
4ee9c684 5483 if (CASE_HIGH (label))
5484 {
359d87c6 5485 if (!CASE_HIGH_SEEN (label))
5486 match_case_to_enum_1 (CASE_HIGH (label), type, label);
5487 else
5488 CASE_HIGH_SEEN (label) = 0;
4ee9c684 5489 }
5490
5491 return 0;
5492}
5493
e7911019 5494/* Handle -Wswitch*. Called from the front end after parsing the
5495 switch construct. */
5496/* ??? Should probably be somewhere generic, since other languages
5497 besides C and C++ would want this. At the moment, however, C/C++
5498 are the only tree-ssa languages that support enumerations at all,
5499 so the point is moot. */
4ee9c684 5500
e7911019 5501void
5502c_do_switch_warnings (splay_tree cases, location_t switch_location,
5503 tree type, tree cond)
4ee9c684 5504{
b27ac6b5 5505 splay_tree_node default_node;
359d87c6 5506 splay_tree_node node;
5507 tree chain;
4ee9c684 5508
5509 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
5510 return;
5511
4ee9c684 5512 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
8b6866af 5513 if (!default_node)
5fb6a912 5514 warning_at (switch_location, OPT_Wswitch_default,
5515 "switch missing default case");
4ee9c684 5516
359d87c6 5517 /* From here on, we only care about about enumerated types. */
5518 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
5519 return;
5520
561017b5 5521 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5522 if (!warn_switch_enum && !warn_switch)
359d87c6 5523 return;
5524
561017b5 5525 /* Check the cases. Warn about case values which are not members of
5526 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5527 there is no default case, check that exactly all enumeration
5528 literals are covered by the cases. */
5529
359d87c6 5530 /* Clearing COND if it is not an integer constant simplifies
5531 the tests inside the loop below. */
5532 if (TREE_CODE (cond) != INTEGER_CST)
5533 cond = NULL_TREE;
5534
5535 /* The time complexity here is O(N*lg(N)) worst case, but for the
5536 common case of monotonically increasing enumerators, it is
5537 O(N), since the nature of the splay tree will keep the next
5538 element adjacent to the root at all times. */
4ee9c684 5539
359d87c6 5540 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
5541 {
5542 tree value = TREE_VALUE (chain);
3f00a6c0 5543 if (TREE_CODE (value) == CONST_DECL)
5544 value = DECL_INITIAL (value);
359d87c6 5545 node = splay_tree_lookup (cases, (splay_tree_key) value);
5546 if (node)
4ee9c684 5547 {
359d87c6 5548 /* Mark the CASE_LOW part of the case entry as seen. */
5549 tree label = (tree) node->value;
5550 CASE_LOW_SEEN (label) = 1;
5551 continue;
5552 }
5553
5554 /* Even though there wasn't an exact match, there might be a
f0b5f617 5555 case range which includes the enumerator's value. */
359d87c6 5556 node = splay_tree_predecessor (cases, (splay_tree_key) value);
5557 if (node && CASE_HIGH ((tree) node->value))
5558 {
5559 tree label = (tree) node->value;
5560 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
5561 if (cmp >= 0)
4ee9c684 5562 {
359d87c6 5563 /* If we match the upper bound exactly, mark the CASE_HIGH
5564 part of the case entry as seen. */
5565 if (cmp == 0)
5566 CASE_HIGH_SEEN (label) = 1;
5567 continue;
4ee9c684 5568 }
5569 }
5570
359d87c6 5571 /* We've now determined that this enumerated literal isn't
5572 handled by the case labels of the switch statement. */
4ee9c684 5573
359d87c6 5574 /* If the switch expression is a constant, we only really care
5575 about whether that constant is handled by the switch. */
5576 if (cond && tree_int_cst_compare (cond, value))
5577 continue;
4ee9c684 5578
6cbbbc89 5579 /* If there is a default_node, the only relevant option is
561017b5 5580 Wswitch-enum. Otherwise, if both are enabled then we prefer
6cbbbc89 5581 to warn using -Wswitch because -Wswitch is enabled by -Wall
5582 while -Wswitch-enum is explicit. */
561017b5 5583 warning_at (switch_location,
5584 (default_node || !warn_switch
5585 ? OPT_Wswitch_enum
5586 : OPT_Wswitch),
5587 "enumeration value %qE not handled in switch",
5588 TREE_PURPOSE (chain));
4ee9c684 5589 }
359d87c6 5590
5591 /* Warn if there are case expressions that don't correspond to
5592 enumerators. This can occur since C and C++ don't enforce
5593 type-checking of assignments to enumeration variables.
5594
5595 The time complexity here is now always O(N) worst case, since
5596 we should have marked both the lower bound and upper bound of
5597 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5598 above. This scan also resets those fields. */
6cbbbc89 5599
359d87c6 5600 splay_tree_foreach (cases, match_case_to_enum, type);
e41f0d80 5601}
5602
9dd48740 5603/* Finish an expression taking the address of LABEL (an
dda49785 5604 IDENTIFIER_NODE). Returns an expression for the address.
5605
5606 LOC is the location for the expression returned. */
d0a47c8d 5607
1cae46be 5608tree
dda49785 5609finish_label_address_expr (tree label, location_t loc)
d0a47c8d 5610{
5611 tree result;
5612
21ca8540 5613 pedwarn (input_location, OPT_pedantic, "taking the address of a label is non-standard");
d0a47c8d 5614
9dd48740 5615 if (label == error_mark_node)
5616 return error_mark_node;
5617
d0a47c8d 5618 label = lookup_label (label);
5619 if (label == NULL_TREE)
5620 result = null_pointer_node;
5621 else
5622 {
5623 TREE_USED (label) = 1;
5624 result = build1 (ADDR_EXPR, ptr_type_node, label);
344cd9b2 5625 /* The current function is not necessarily uninlinable.
d0a47c8d 5626 Computed gotos are incompatible with inlining, but the value
5627 here could be used only in a diagnostic, for example. */
dda49785 5628 protected_set_expr_location (result, loc);
d0a47c8d 5629 }
5630
5631 return result;
5632}
4f9a1c9b 5633\f
5634
5635/* Given a boolean expression ARG, return a tree representing an increment
5636 or decrement (as indicated by CODE) of ARG. The front end must check for
5637 invalid cases (e.g., decrement in C++). */
5638tree
1cae46be 5639boolean_increment (enum tree_code code, tree arg)
4f9a1c9b 5640{
5641 tree val;
69db191c 5642 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
c0f19401 5643
4f9a1c9b 5644 arg = stabilize_reference (arg);
5645 switch (code)
5646 {
5647 case PREINCREMENT_EXPR:
14ae0310 5648 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4f9a1c9b 5649 break;
5650 case POSTINCREMENT_EXPR:
14ae0310 5651 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4f9a1c9b 5652 arg = save_expr (arg);
14ae0310 5653 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5654 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4f9a1c9b 5655 break;
5656 case PREDECREMENT_EXPR:
14ae0310 5657 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
389dd41b 5658 invert_truthvalue_loc (input_location, arg));
4f9a1c9b 5659 break;
5660 case POSTDECREMENT_EXPR:
14ae0310 5661 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
389dd41b 5662 invert_truthvalue_loc (input_location, arg));
4f9a1c9b 5663 arg = save_expr (arg);
14ae0310 5664 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5665 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4f9a1c9b 5666 break;
5667 default:
231bd014 5668 gcc_unreachable ();
4f9a1c9b 5669 }
5670 TREE_SIDE_EFFECTS (val) = 1;
5671 return val;
5672}
76a6e674 5673\f
f3449a3c 5674/* Built-in macros for stddef.h and stdint.h, that require macros
5675 defined in this file. */
79cf3ec1 5676void
1cae46be 5677c_stddef_cpp_builtins(void)
1ed9d5f5 5678{
63994318 5679 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
5680 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
5681 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
5682 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
36bccbfc 5683 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
5684 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
b0726616 5685 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
5686 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
f3449a3c 5687 if (SIG_ATOMIC_TYPE)
5688 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
5689 if (INT8_TYPE)
5690 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
5691 if (INT16_TYPE)
5692 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
5693 if (INT32_TYPE)
5694 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
5695 if (INT64_TYPE)
5696 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
5697 if (UINT8_TYPE)
5698 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
5699 if (UINT16_TYPE)
5700 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
5701 if (UINT32_TYPE)
5702 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
5703 if (UINT64_TYPE)
5704 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
5705 if (INT_LEAST8_TYPE)
5706 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
5707 if (INT_LEAST16_TYPE)
5708 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
5709 if (INT_LEAST32_TYPE)
5710 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
5711 if (INT_LEAST64_TYPE)
5712 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
5713 if (UINT_LEAST8_TYPE)
5714 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
5715 if (UINT_LEAST16_TYPE)
5716 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
5717 if (UINT_LEAST32_TYPE)
5718 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
5719 if (UINT_LEAST64_TYPE)
5720 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
5721 if (INT_FAST8_TYPE)
5722 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
5723 if (INT_FAST16_TYPE)
5724 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
5725 if (INT_FAST32_TYPE)
5726 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
5727 if (INT_FAST64_TYPE)
5728 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
5729 if (UINT_FAST8_TYPE)
5730 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
5731 if (UINT_FAST16_TYPE)
5732 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
5733 if (UINT_FAST32_TYPE)
5734 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
5735 if (UINT_FAST64_TYPE)
5736 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
5737 if (INTPTR_TYPE)
5738 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
5739 if (UINTPTR_TYPE)
5740 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
574006c3 5741}
5742
7d3b509a 5743static void
1cae46be 5744c_init_attributes (void)
7d3b509a 5745{
5746 /* Fill in the built_in_attributes array. */
7c446c95 5747#define DEF_ATTR_NULL_TREE(ENUM) \
7d3b509a 5748 built_in_attributes[(int) ENUM] = NULL_TREE;
7c446c95 5749#define DEF_ATTR_INT(ENUM, VALUE) \
ceb7b692 5750 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
7d3b509a 5751#define DEF_ATTR_IDENT(ENUM, STRING) \
5752 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5753#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5754 built_in_attributes[(int) ENUM] \
5755 = tree_cons (built_in_attributes[(int) PURPOSE], \
5756 built_in_attributes[(int) VALUE], \
5757 built_in_attributes[(int) CHAIN]);
7d3b509a 5758#include "builtin-attrs.def"
5759#undef DEF_ATTR_NULL_TREE
5760#undef DEF_ATTR_INT
5761#undef DEF_ATTR_IDENT
5762#undef DEF_ATTR_TREE_LIST
76a6e674 5763}
5f3cead1 5764
33199a81 5765/* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5766 identifier as an argument, so the front end shouldn't look it up. */
5767
5768bool
47b19b94 5769attribute_takes_identifier_p (const_tree attr_id)
33199a81 5770{
9bf1c74e 5771 const struct attribute_spec *spec = lookup_attribute_spec (attr_id);
02cb1060 5772 if (spec == NULL)
5773 /* Unknown attribute that we'll end up ignoring, return true so we
5774 don't complain about an identifier argument. */
5775 return true;
5776 else if (!strcmp ("mode", spec->name)
5777 || !strcmp ("format", spec->name)
5778 || !strcmp ("cleanup", spec->name))
47b19b94 5779 return true;
5780 else
5781 return targetm.attribute_takes_identifier_p (attr_id);
33199a81 5782}
5783
f8e93a2e 5784/* Attribute handlers common to C front ends. */
5785
5786/* Handle a "packed" attribute; arguments as in
5787 struct attribute_spec.handler. */
5788
5789static tree
9a03a746 5790handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
09347743 5791 int flags, bool *no_add_attrs)
f8e93a2e 5792{
f40175cb 5793 if (TYPE_P (*node))
f8e93a2e 5794 {
5795 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
e086912e 5796 *node = build_variant_type_copy (*node);
f40175cb 5797 TYPE_PACKED (*node) = 1;
f8e93a2e 5798 }
5799 else if (TREE_CODE (*node) == FIELD_DECL)
c2ab04f9 5800 {
9fd767c5 5801 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
5802 /* Still pack bitfields. */
5803 && ! DECL_INITIAL (*node))
c2ab04f9 5804 warning (OPT_Wattributes,
5805 "%qE attribute ignored for field of type %qT",
5806 name, TREE_TYPE (*node));
5807 else
5808 DECL_PACKED (*node) = 1;
5809 }
f8e93a2e 5810 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
f40175cb 5811 used for DECL_REGISTER. It wouldn't mean anything anyway.
5812 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5813 that changes what the typedef is typing. */
f8e93a2e 5814 else
5815 {
9b2d6d13 5816 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5817 *no_add_attrs = true;
5818 }
5819
5820 return NULL_TREE;
5821}
5822
5823/* Handle a "nocommon" attribute; arguments as in
5824 struct attribute_spec.handler. */
5825
5826static tree
1cae46be 5827handle_nocommon_attribute (tree *node, tree name,
9a03a746 5828 tree ARG_UNUSED (args),
5829 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 5830{
5831 if (TREE_CODE (*node) == VAR_DECL)
5832 DECL_COMMON (*node) = 0;
5833 else
5834 {
9b2d6d13 5835 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5836 *no_add_attrs = true;
5837 }
5838
5839 return NULL_TREE;
5840}
5841
5842/* Handle a "common" attribute; arguments as in
5843 struct attribute_spec.handler. */
5844
5845static tree
9a03a746 5846handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5847 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 5848{
5849 if (TREE_CODE (*node) == VAR_DECL)
5850 DECL_COMMON (*node) = 1;
5851 else
5852 {
9b2d6d13 5853 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5854 *no_add_attrs = true;
5855 }
5856
5857 return NULL_TREE;
5858}
5859
5860/* Handle a "noreturn" attribute; arguments as in
5861 struct attribute_spec.handler. */
5862
5863static tree
9a03a746 5864handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5865 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 5866{
5867 tree type = TREE_TYPE (*node);
5868
5869 /* See FIXME comment in c_common_attribute_table. */
8c582e4f 5870 if (TREE_CODE (*node) == FUNCTION_DECL
5871 || objc_method_decl (TREE_CODE (*node)))
f8e93a2e 5872 TREE_THIS_VOLATILE (*node) = 1;
5873 else if (TREE_CODE (type) == POINTER_TYPE
5874 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5875 TREE_TYPE (*node)
5876 = build_pointer_type
5877 (build_type_variant (TREE_TYPE (type),
71bda45d 5878 TYPE_READONLY (TREE_TYPE (type)), 1));
f8e93a2e 5879 else
5880 {
9b2d6d13 5881 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5882 *no_add_attrs = true;
5883 }
5884
5885 return NULL_TREE;
5886}
5887
5de92639 5888/* Handle a "hot" and attribute; arguments as in
5889 struct attribute_spec.handler. */
5890
5891static tree
5892handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
46f8e3b0 5893 int ARG_UNUSED (flags), bool *no_add_attrs)
5de92639 5894{
5895 if (TREE_CODE (*node) == FUNCTION_DECL)
5896 {
5897 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
5898 {
5899 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5900 name, "cold");
5901 *no_add_attrs = true;
5902 }
24470055 5903 /* Most of the rest of the hot processing is done later with
5904 lookup_attribute. */
5de92639 5905 }
5906 else
5907 {
5908 warning (OPT_Wattributes, "%qE attribute ignored", name);
5909 *no_add_attrs = true;
5910 }
5911
5912 return NULL_TREE;
5913}
5914/* Handle a "cold" and attribute; arguments as in
5915 struct attribute_spec.handler. */
5916
5917static tree
5918handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5919 int ARG_UNUSED (flags), bool *no_add_attrs)
5920{
5921 if (TREE_CODE (*node) == FUNCTION_DECL)
5922 {
5923 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
5924 {
5925 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5926 name, "hot");
5927 *no_add_attrs = true;
5928 }
24470055 5929 /* Most of the rest of the cold processing is done later with
5930 lookup_attribute. */
5de92639 5931 }
5932 else
5933 {
5934 warning (OPT_Wattributes, "%qE attribute ignored", name);
5935 *no_add_attrs = true;
5936 }
5937
5938 return NULL_TREE;
5939}
5940
f8e93a2e 5941/* Handle a "noinline" attribute; arguments as in
5942 struct attribute_spec.handler. */
5943
5944static tree
1cae46be 5945handle_noinline_attribute (tree *node, tree name,
9a03a746 5946 tree ARG_UNUSED (args),
5947 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 5948{
5949 if (TREE_CODE (*node) == FUNCTION_DECL)
5950 DECL_UNINLINABLE (*node) = 1;
5951 else
5952 {
9b2d6d13 5953 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5954 *no_add_attrs = true;
5955 }
5956
5957 return NULL_TREE;
5958}
5959
bdb1f0d1 5960/* Handle a "noclone" attribute; arguments as in
5961 struct attribute_spec.handler. */
5962
5963static tree
5964handle_noclone_attribute (tree *node, tree name,
5965 tree ARG_UNUSED (args),
5966 int ARG_UNUSED (flags), bool *no_add_attrs)
5967{
5968 if (TREE_CODE (*node) != FUNCTION_DECL)
5969 {
5970 warning (OPT_Wattributes, "%qE attribute ignored", name);
5971 *no_add_attrs = true;
5972 }
5973
5974 return NULL_TREE;
5975}
5976
f8e93a2e 5977/* Handle a "always_inline" attribute; arguments as in
5978 struct attribute_spec.handler. */
5979
5980static tree
1cae46be 5981handle_always_inline_attribute (tree *node, tree name,
9a03a746 5982 tree ARG_UNUSED (args),
5983 int ARG_UNUSED (flags),
09347743 5984 bool *no_add_attrs)
f8e93a2e 5985{
5986 if (TREE_CODE (*node) == FUNCTION_DECL)
5987 {
ebb7d626 5988 /* Set the attribute and mark it for disregarding inline
5989 limits. */
5990 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
f8e93a2e 5991 }
5992 else
5993 {
9b2d6d13 5994 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 5995 *no_add_attrs = true;
541e4101 5996 }
5997
5998 return NULL_TREE;
5999}
6000
6001/* Handle a "gnu_inline" attribute; arguments as in
6002 struct attribute_spec.handler. */
6003
6004static tree
6005handle_gnu_inline_attribute (tree *node, tree name,
6006 tree ARG_UNUSED (args),
6007 int ARG_UNUSED (flags),
6008 bool *no_add_attrs)
6009{
6010 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6011 {
6012 /* Do nothing else, just set the attribute. We'll get at
6013 it later with lookup_attribute. */
6014 }
6015 else
6016 {
6017 warning (OPT_Wattributes, "%qE attribute ignored", name);
6018 *no_add_attrs = true;
7bd95dfd 6019 }
6020
6021 return NULL_TREE;
6022}
6023
6024/* Handle a "leaf" attribute; arguments as in
6025 struct attribute_spec.handler. */
6026
6027static tree
6028handle_leaf_attribute (tree *node, tree name,
6029 tree ARG_UNUSED (args),
6030 int ARG_UNUSED (flags), bool *no_add_attrs)
6031{
6032 if (TREE_CODE (*node) != FUNCTION_DECL)
6033 {
6034 warning (OPT_Wattributes, "%qE attribute ignored", name);
6035 *no_add_attrs = true;
6036 }
6037 if (!TREE_PUBLIC (*node))
6038 {
6039 warning (OPT_Wattributes, "%qE attribute has no effect on unit local functions", name);
6040 *no_add_attrs = true;
f8e93a2e 6041 }
6042
6043 return NULL_TREE;
6044}
6045
1b16fc45 6046/* Handle an "artificial" attribute; arguments as in
6047 struct attribute_spec.handler. */
6048
6049static tree
6050handle_artificial_attribute (tree *node, tree name,
6051 tree ARG_UNUSED (args),
6052 int ARG_UNUSED (flags),
6053 bool *no_add_attrs)
6054{
6055 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6056 {
6057 /* Do nothing else, just set the attribute. We'll get at
6058 it later with lookup_attribute. */
6059 }
6060 else
6061 {
6062 warning (OPT_Wattributes, "%qE attribute ignored", name);
6063 *no_add_attrs = true;
6064 }
6065
6066 return NULL_TREE;
6067}
6068
0cdd9887 6069/* Handle a "flatten" attribute; arguments as in
6070 struct attribute_spec.handler. */
6071
6072static tree
6073handle_flatten_attribute (tree *node, tree name,
a0c938f0 6074 tree args ATTRIBUTE_UNUSED,
6075 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
0cdd9887 6076{
6077 if (TREE_CODE (*node) == FUNCTION_DECL)
6078 /* Do nothing else, just set the attribute. We'll get at
6079 it later with lookup_attribute. */
6080 ;
6081 else
6082 {
6083 warning (OPT_Wattributes, "%qE attribute ignored", name);
6084 *no_add_attrs = true;
6085 }
6086
6087 return NULL_TREE;
6088}
6089
10fc867f 6090/* Handle a "warning" or "error" attribute; arguments as in
6091 struct attribute_spec.handler. */
6092
6093static tree
6094handle_error_attribute (tree *node, tree name, tree args,
6095 int ARG_UNUSED (flags), bool *no_add_attrs)
6096{
6097 if (TREE_CODE (*node) == FUNCTION_DECL
6098 || TREE_CODE (TREE_VALUE (args)) == STRING_CST)
6099 /* Do nothing else, just set the attribute. We'll get at
6100 it later with lookup_attribute. */
6101 ;
6102 else
6103 {
6104 warning (OPT_Wattributes, "%qE attribute ignored", name);
6105 *no_add_attrs = true;
6106 }
6107
6108 return NULL_TREE;
6109}
0cdd9887 6110
f8e93a2e 6111/* Handle a "used" attribute; arguments as in
6112 struct attribute_spec.handler. */
6113
6114static tree
9a03a746 6115handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
6116 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 6117{
d0a31bd8 6118 tree node = *pnode;
6119
6120 if (TREE_CODE (node) == FUNCTION_DECL
6121 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
f54ed8bc 6122 {
f54ed8bc 6123 TREE_USED (node) = 1;
9423c9b7 6124 DECL_PRESERVE_P (node) = 1;
abc6c64f 6125 if (TREE_CODE (node) == VAR_DECL)
6126 DECL_READ_P (node) = 1;
f54ed8bc 6127 }
f8e93a2e 6128 else
6129 {
9b2d6d13 6130 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6131 *no_add_attrs = true;
6132 }
6133
6134 return NULL_TREE;
6135}
6136
6137/* Handle a "unused" attribute; arguments as in
6138 struct attribute_spec.handler. */
6139
6140static tree
9a03a746 6141handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6142 int flags, bool *no_add_attrs)
f8e93a2e 6143{
6144 if (DECL_P (*node))
6145 {
6146 tree decl = *node;
6147
6148 if (TREE_CODE (decl) == PARM_DECL
6149 || TREE_CODE (decl) == VAR_DECL
6150 || TREE_CODE (decl) == FUNCTION_DECL
6151 || TREE_CODE (decl) == LABEL_DECL
6152 || TREE_CODE (decl) == TYPE_DECL)
abc6c64f 6153 {
6154 TREE_USED (decl) = 1;
6155 if (TREE_CODE (decl) == VAR_DECL
6156 || TREE_CODE (decl) == PARM_DECL)
6157 DECL_READ_P (decl) = 1;
6158 }
f8e93a2e 6159 else
6160 {
9b2d6d13 6161 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6162 *no_add_attrs = true;
6163 }
6164 }
6165 else
6166 {
6167 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
e086912e 6168 *node = build_variant_type_copy (*node);
f8e93a2e 6169 TREE_USED (*node) = 1;
6170 }
6171
6172 return NULL_TREE;
6173}
6174
62eec3b4 6175/* Handle a "externally_visible" attribute; arguments as in
6176 struct attribute_spec.handler. */
6177
6178static tree
6179handle_externally_visible_attribute (tree *pnode, tree name,
6180 tree ARG_UNUSED (args),
6181 int ARG_UNUSED (flags),
6182 bool *no_add_attrs)
6183{
6184 tree node = *pnode;
6185
ba12ea31 6186 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
62eec3b4 6187 {
ba12ea31 6188 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
6189 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
6190 {
6191 warning (OPT_Wattributes,
6192 "%qE attribute have effect only on public objects", name);
6193 *no_add_attrs = true;
6194 }
62eec3b4 6195 }
62eec3b4 6196 else
6197 {
6198 warning (OPT_Wattributes, "%qE attribute ignored", name);
6199 *no_add_attrs = true;
6200 }
6201
6202 return NULL_TREE;
6203}
6204
f8e93a2e 6205/* Handle a "const" attribute; arguments as in
6206 struct attribute_spec.handler. */
6207
6208static tree
9a03a746 6209handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6210 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 6211{
6212 tree type = TREE_TYPE (*node);
6213
6214 /* See FIXME comment on noreturn in c_common_attribute_table. */
6215 if (TREE_CODE (*node) == FUNCTION_DECL)
6216 TREE_READONLY (*node) = 1;
6217 else if (TREE_CODE (type) == POINTER_TYPE
6218 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
6219 TREE_TYPE (*node)
6220 = build_pointer_type
6221 (build_type_variant (TREE_TYPE (type), 1,
6222 TREE_THIS_VOLATILE (TREE_TYPE (type))));
6223 else
6224 {
9b2d6d13 6225 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6226 *no_add_attrs = true;
6227 }
6228
6229 return NULL_TREE;
6230}
6231
6232/* Handle a "transparent_union" attribute; arguments as in
6233 struct attribute_spec.handler. */
6234
6235static tree
1cae46be 6236handle_transparent_union_attribute (tree *node, tree name,
9a03a746 6237 tree ARG_UNUSED (args), int flags,
09347743 6238 bool *no_add_attrs)
f8e93a2e 6239{
881eb642 6240 tree type;
03908818 6241
6242 *no_add_attrs = true;
f8e93a2e 6243
881eb642 6244 if (TREE_CODE (*node) == TYPE_DECL)
6245 node = &TREE_TYPE (*node);
6246 type = *node;
f8e93a2e 6247
03908818 6248 if (TREE_CODE (type) == UNION_TYPE)
f8e93a2e 6249 {
03908818 6250 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6251 the code in finish_struct. */
f8e93a2e 6252 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
03908818 6253 {
6254 if (TYPE_FIELDS (type) == NULL_TREE
914d1151 6255 || c_dialect_cxx ()
03908818 6256 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
6257 goto ignored;
6258
6259 /* A type variant isn't good enough, since we don't a cast
6260 to such a type removed as a no-op. */
6261 *node = type = build_duplicate_type (type);
6262 }
6263
8df5a43d 6264 TYPE_TRANSPARENT_AGGR (type) = 1;
03908818 6265 return NULL_TREE;
f8e93a2e 6266 }
6267
03908818 6268 ignored:
6269 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6270 return NULL_TREE;
6271}
6272
9af7fd5b 6273/* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6274 get the requested priority for a constructor or destructor,
6275 possibly issuing diagnostics for invalid or reserved
6276 priorities. */
6277
6278static priority_type
6279get_priority (tree args, bool is_destructor)
6280{
6281 HOST_WIDE_INT pri;
6c181a06 6282 tree arg;
9af7fd5b 6283
6284 if (!args)
6285 return DEFAULT_INIT_PRIORITY;
48e1416a 6286
28fbc04f 6287 if (!SUPPORTS_INIT_PRIORITY)
6288 {
6289 if (is_destructor)
6290 error ("destructor priorities are not supported");
6291 else
6292 error ("constructor priorities are not supported");
6293 return DEFAULT_INIT_PRIORITY;
6294 }
6295
6c181a06 6296 arg = TREE_VALUE (args);
6297 if (!host_integerp (arg, /*pos=*/0)
6298 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
9af7fd5b 6299 goto invalid;
6300
6301 pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0);
6302 if (pri < 0 || pri > MAX_INIT_PRIORITY)
6303 goto invalid;
6304
6305 if (pri <= MAX_RESERVED_INIT_PRIORITY)
6306 {
6307 if (is_destructor)
6308 warning (0,
6309 "destructor priorities from 0 to %d are reserved "
48e1416a 6310 "for the implementation",
9af7fd5b 6311 MAX_RESERVED_INIT_PRIORITY);
6312 else
6313 warning (0,
6314 "constructor priorities from 0 to %d are reserved "
48e1416a 6315 "for the implementation",
9af7fd5b 6316 MAX_RESERVED_INIT_PRIORITY);
6317 }
6318 return pri;
6319
6320 invalid:
6321 if (is_destructor)
6322 error ("destructor priorities must be integers from 0 to %d inclusive",
6323 MAX_INIT_PRIORITY);
6324 else
6325 error ("constructor priorities must be integers from 0 to %d inclusive",
6326 MAX_INIT_PRIORITY);
6327 return DEFAULT_INIT_PRIORITY;
6328}
6329
f8e93a2e 6330/* Handle a "constructor" attribute; arguments as in
6331 struct attribute_spec.handler. */
6332
6333static tree
9af7fd5b 6334handle_constructor_attribute (tree *node, tree name, tree args,
9a03a746 6335 int ARG_UNUSED (flags),
09347743 6336 bool *no_add_attrs)
f8e93a2e 6337{
6338 tree decl = *node;
6339 tree type = TREE_TYPE (decl);
6340
6341 if (TREE_CODE (decl) == FUNCTION_DECL
6342 && TREE_CODE (type) == FUNCTION_TYPE
6343 && decl_function_context (decl) == 0)
6344 {
9af7fd5b 6345 priority_type priority;
f8e93a2e 6346 DECL_STATIC_CONSTRUCTOR (decl) = 1;
9af7fd5b 6347 priority = get_priority (args, /*is_destructor=*/false);
6348 SET_DECL_INIT_PRIORITY (decl, priority);
f8e93a2e 6349 TREE_USED (decl) = 1;
6350 }
6351 else
6352 {
9b2d6d13 6353 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6354 *no_add_attrs = true;
6355 }
6356
6357 return NULL_TREE;
6358}
6359
6360/* Handle a "destructor" attribute; arguments as in
6361 struct attribute_spec.handler. */
6362
6363static tree
9af7fd5b 6364handle_destructor_attribute (tree *node, tree name, tree args,
9a03a746 6365 int ARG_UNUSED (flags),
09347743 6366 bool *no_add_attrs)
f8e93a2e 6367{
6368 tree decl = *node;
6369 tree type = TREE_TYPE (decl);
6370
6371 if (TREE_CODE (decl) == FUNCTION_DECL
6372 && TREE_CODE (type) == FUNCTION_TYPE
6373 && decl_function_context (decl) == 0)
6374 {
9af7fd5b 6375 priority_type priority;
f8e93a2e 6376 DECL_STATIC_DESTRUCTOR (decl) = 1;
9af7fd5b 6377 priority = get_priority (args, /*is_destructor=*/true);
6378 SET_DECL_FINI_PRIORITY (decl, priority);
f8e93a2e 6379 TREE_USED (decl) = 1;
6380 }
6381 else
6382 {
9b2d6d13 6383 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6384 *no_add_attrs = true;
6385 }
6386
6387 return NULL_TREE;
6388}
6389
1c58e3f1 6390/* Nonzero if the mode is a valid vector mode for this architecture.
6391 This returns nonzero even if there is no hardware support for the
6392 vector mode, but we can emulate with narrower modes. */
6393
6394static int
6395vector_mode_valid_p (enum machine_mode mode)
6396{
6397 enum mode_class mclass = GET_MODE_CLASS (mode);
6398 enum machine_mode innermode;
6399
6400 /* Doh! What's going on? */
6401 if (mclass != MODE_VECTOR_INT
6402 && mclass != MODE_VECTOR_FLOAT
6403 && mclass != MODE_VECTOR_FRACT
6404 && mclass != MODE_VECTOR_UFRACT
6405 && mclass != MODE_VECTOR_ACCUM
6406 && mclass != MODE_VECTOR_UACCUM)
6407 return 0;
6408
6409 /* Hardware support. Woo hoo! */
6410 if (targetm.vector_mode_supported_p (mode))
6411 return 1;
6412
6413 innermode = GET_MODE_INNER (mode);
6414
6415 /* We should probably return 1 if requesting V4DI and we have no DI,
6416 but we have V2DI, but this is probably very unlikely. */
6417
6418 /* If we have support for the inner mode, we can safely emulate it.
6419 We may not have V2DI, but me can emulate with a pair of DIs. */
6420 return targetm.scalar_mode_supported_p (innermode);
6421}
6422
6423
f8e93a2e 6424/* Handle a "mode" attribute; arguments as in
6425 struct attribute_spec.handler. */
6426
6427static tree
9a03a746 6428handle_mode_attribute (tree *node, tree name, tree args,
6429 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 6430{
6431 tree type = *node;
d1dd9ac0 6432 tree ident = TREE_VALUE (args);
f8e93a2e 6433
6434 *no_add_attrs = true;
6435
d1dd9ac0 6436 if (TREE_CODE (ident) != IDENTIFIER_NODE)
9b2d6d13 6437 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6438 else
6439 {
6440 int j;
d1dd9ac0 6441 const char *p = IDENTIFIER_POINTER (ident);
f8e93a2e 6442 int len = strlen (p);
6443 enum machine_mode mode = VOIDmode;
6444 tree typefm;
b2aef146 6445 bool valid_mode;
f8e93a2e 6446
6447 if (len > 4 && p[0] == '_' && p[1] == '_'
6448 && p[len - 1] == '_' && p[len - 2] == '_')
6449 {
4fd61bc6 6450 char *newp = (char *) alloca (len - 1);
f8e93a2e 6451
6452 strcpy (newp, &p[2]);
6453 newp[len - 4] = '\0';
6454 p = newp;
6455 }
6456
6457 /* Change this type to have a type with the specified mode.
6458 First check for the special modes. */
84166705 6459 if (!strcmp (p, "byte"))
f8e93a2e 6460 mode = byte_mode;
6461 else if (!strcmp (p, "word"))
6462 mode = word_mode;
84166705 6463 else if (!strcmp (p, "pointer"))
f8e93a2e 6464 mode = ptr_mode;
0ef89dfd 6465 else if (!strcmp (p, "libgcc_cmp_return"))
6466 mode = targetm.libgcc_cmp_return_mode ();
6467 else if (!strcmp (p, "libgcc_shift_count"))
6468 mode = targetm.libgcc_shift_count_mode ();
1bd43494 6469 else if (!strcmp (p, "unwind_word"))
6470 mode = targetm.unwind_word_mode ();
f8e93a2e 6471 else
6472 for (j = 0; j < NUM_MACHINE_MODES; j++)
6473 if (!strcmp (p, GET_MODE_NAME (j)))
743a6f47 6474 {
6475 mode = (enum machine_mode) j;
6476 break;
6477 }
f8e93a2e 6478
6479 if (mode == VOIDmode)
4917c376 6480 {
d1dd9ac0 6481 error ("unknown machine mode %qE", ident);
4917c376 6482 return NULL_TREE;
6483 }
6484
b2aef146 6485 valid_mode = false;
6486 switch (GET_MODE_CLASS (mode))
4917c376 6487 {
b2aef146 6488 case MODE_INT:
6489 case MODE_PARTIAL_INT:
6490 case MODE_FLOAT:
c4503c0a 6491 case MODE_DECIMAL_FLOAT:
9421ebb9 6492 case MODE_FRACT:
6493 case MODE_UFRACT:
6494 case MODE_ACCUM:
6495 case MODE_UACCUM:
b2aef146 6496 valid_mode = targetm.scalar_mode_supported_p (mode);
6497 break;
6498
6499 case MODE_COMPLEX_INT:
6500 case MODE_COMPLEX_FLOAT:
6501 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
6502 break;
6503
6504 case MODE_VECTOR_INT:
6505 case MODE_VECTOR_FLOAT:
9421ebb9 6506 case MODE_VECTOR_FRACT:
6507 case MODE_VECTOR_UFRACT:
6508 case MODE_VECTOR_ACCUM:
6509 case MODE_VECTOR_UACCUM:
9b2d6d13 6510 warning (OPT_Wattributes, "specifying vector types with "
6511 "__attribute__ ((mode)) is deprecated");
6512 warning (OPT_Wattributes,
6513 "use __attribute__ ((vector_size)) instead");
b2aef146 6514 valid_mode = vector_mode_valid_p (mode);
6515 break;
4917c376 6516
b2aef146 6517 default:
6518 break;
6519 }
6520 if (!valid_mode)
6521 {
1e5fcbe2 6522 error ("unable to emulate %qs", p);
b2aef146 6523 return NULL_TREE;
6524 }
4917c376 6525
b2aef146 6526 if (POINTER_TYPE_P (type))
ead34f59 6527 {
6d5d708e 6528 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
b2aef146 6529 tree (*fn)(tree, enum machine_mode, bool);
6530
6d5d708e 6531 if (!targetm.addr_space.valid_pointer_mode (mode, as))
ead34f59 6532 {
1e5fcbe2 6533 error ("invalid pointer mode %qs", p);
ead34f59 6534 return NULL_TREE;
6535 }
6536
a0c938f0 6537 if (TREE_CODE (type) == POINTER_TYPE)
b2aef146 6538 fn = build_pointer_type_for_mode;
805e22b2 6539 else
b2aef146 6540 fn = build_reference_type_for_mode;
6541 typefm = fn (TREE_TYPE (type), mode, false);
ead34f59 6542 }
b2aef146 6543 else
9421ebb9 6544 {
6545 /* For fixed-point modes, we need to test if the signness of type
6546 and the machine mode are consistent. */
6547 if (ALL_FIXED_POINT_MODE_P (mode)
6548 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
6549 {
bf776685 6550 error ("signedness of type and machine mode %qs don%'t match", p);
9421ebb9 6551 return NULL_TREE;
6552 }
6553 /* For fixed-point modes, we need to pass saturating info. */
6554 typefm = lang_hooks.types.type_for_mode (mode,
6555 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
6556 : TYPE_UNSIGNED (type));
6557 }
3a648ab9 6558
b2aef146 6559 if (typefm == NULL_TREE)
6560 {
743a6f47 6561 error ("no data type for mode %qs", p);
b2aef146 6562 return NULL_TREE;
6563 }
3a648ab9 6564 else if (TREE_CODE (type) == ENUMERAL_TYPE)
6565 {
6566 /* For enumeral types, copy the precision from the integer
6567 type returned above. If not an INTEGER_TYPE, we can't use
6568 this mode for this type. */
6569 if (TREE_CODE (typefm) != INTEGER_TYPE)
6570 {
743a6f47 6571 error ("cannot use mode %qs for enumeral types", p);
3a648ab9 6572 return NULL_TREE;
6573 }
6574
10080eac 6575 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
6576 {
6577 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
6578 typefm = type;
6579 }
6580 else
6581 {
6582 /* We cannot build a type variant, as there's code that assumes
6583 that TYPE_MAIN_VARIANT has the same mode. This includes the
6584 debug generators. Instead, create a subrange type. This
6585 results in all of the enumeral values being emitted only once
6586 in the original, and the subtype gets them by reference. */
6587 if (TYPE_UNSIGNED (type))
6588 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
6589 else
6590 typefm = make_signed_type (TYPE_PRECISION (typefm));
6591 TREE_TYPE (typefm) = type;
6592 }
3a648ab9 6593 }
4bf450a1 6594 else if (VECTOR_MODE_P (mode)
6595 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
6596 : TREE_CODE (type) != TREE_CODE (typefm))
743a6f47 6597 {
6598 error ("mode %qs applied to inappropriate type", p);
6599 return NULL_TREE;
6600 }
6601
b2aef146 6602 *node = typefm;
f8e93a2e 6603 }
6604
6605 return NULL_TREE;
6606}
6607
6608/* Handle a "section" attribute; arguments as in
6609 struct attribute_spec.handler. */
6610
6611static tree
9a03a746 6612handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6613 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 6614{
6615 tree decl = *node;
6616
218e3e4e 6617 if (targetm_common.have_named_sections)
f8e93a2e 6618 {
065efcb1 6619 user_defined_section_attribute = true;
6620
f8e93a2e 6621 if ((TREE_CODE (decl) == FUNCTION_DECL
6622 || TREE_CODE (decl) == VAR_DECL)
6623 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
6624 {
6625 if (TREE_CODE (decl) == VAR_DECL
6626 && current_function_decl != NULL_TREE
84166705 6627 && !TREE_STATIC (decl))
f8e93a2e 6628 {
48e1416a 6629 error_at (DECL_SOURCE_LOCATION (decl),
712d2297 6630 "section attribute cannot be specified for "
6631 "local variables");
f8e93a2e 6632 *no_add_attrs = true;
6633 }
6634
6635 /* The decl may have already been given a section attribute
6636 from a previous declaration. Ensure they match. */
6637 else if (DECL_SECTION_NAME (decl) != NULL_TREE
6638 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
6639 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
6640 {
3cf8b391 6641 error ("section of %q+D conflicts with previous declaration",
6642 *node);
f8e93a2e 6643 *no_add_attrs = true;
6644 }
38475469 6645 else if (TREE_CODE (decl) == VAR_DECL
6646 && !targetm.have_tls && targetm.emutls.tmpl_section
6647 && DECL_THREAD_LOCAL_P (decl))
6648 {
6649 error ("section of %q+D cannot be overridden", *node);
6650 *no_add_attrs = true;
6651 }
f8e93a2e 6652 else
6653 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
6654 }
6655 else
6656 {
3cf8b391 6657 error ("section attribute not allowed for %q+D", *node);
f8e93a2e 6658 *no_add_attrs = true;
6659 }
6660 }
6661 else
6662 {
712d2297 6663 error_at (DECL_SOURCE_LOCATION (*node),
6664 "section attributes are not supported for this target");
f8e93a2e 6665 *no_add_attrs = true;
6666 }
6667
6668 return NULL_TREE;
6669}
6670
6671/* Handle a "aligned" attribute; arguments as in
6672 struct attribute_spec.handler. */
6673
6674static tree
9a03a746 6675handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
09347743 6676 int flags, bool *no_add_attrs)
f8e93a2e 6677{
6678 tree decl = NULL_TREE;
6679 tree *type = NULL;
6680 int is_type = 0;
6681 tree align_expr = (args ? TREE_VALUE (args)
02421213 6682 : size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT));
f8e93a2e 6683 int i;
6684
6685 if (DECL_P (*node))
6686 {
6687 decl = *node;
6688 type = &TREE_TYPE (decl);
6689 is_type = TREE_CODE (*node) == TYPE_DECL;
6690 }
6691 else if (TYPE_P (*node))
6692 type = node, is_type = 1;
6693
f8e93a2e 6694 if (TREE_CODE (align_expr) != INTEGER_CST)
6695 {
6696 error ("requested alignment is not a constant");
6697 *no_add_attrs = true;
6698 }
6699 else if ((i = tree_log2 (align_expr)) == -1)
6700 {
6701 error ("requested alignment is not a power of 2");
6702 *no_add_attrs = true;
6703 }
7cfdc2f0 6704 else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG)
f8e93a2e 6705 {
6706 error ("requested alignment is too large");
6707 *no_add_attrs = true;
6708 }
6709 else if (is_type)
6710 {
2ec3af9c 6711 if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6712 /* OK, modify the type in place. */;
f8e93a2e 6713 /* If we have a TYPE_DECL, then copy the type, so that we
6714 don't accidentally modify a builtin type. See pushdecl. */
2ec3af9c 6715 else if (decl && TREE_TYPE (decl) != error_mark_node
6716 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
f8e93a2e 6717 {
6718 tree tt = TREE_TYPE (decl);
e086912e 6719 *type = build_variant_type_copy (*type);
f8e93a2e 6720 DECL_ORIGINAL_TYPE (decl) = tt;
6721 TYPE_NAME (*type) = decl;
6722 TREE_USED (*type) = TREE_USED (decl);
6723 TREE_TYPE (decl) = *type;
6724 }
2ec3af9c 6725 else
e086912e 6726 *type = build_variant_type_copy (*type);
f8e93a2e 6727
7cfdc2f0 6728 TYPE_ALIGN (*type) = (1U << i) * BITS_PER_UNIT;
f8e93a2e 6729 TYPE_USER_ALIGN (*type) = 1;
6730 }
097b5c8b 6731 else if (! VAR_OR_FUNCTION_DECL_P (decl)
f8e93a2e 6732 && TREE_CODE (decl) != FIELD_DECL)
6733 {
3cf8b391 6734 error ("alignment may not be specified for %q+D", decl);
f8e93a2e 6735 *no_add_attrs = true;
6736 }
097b5c8b 6737 else if (TREE_CODE (decl) == FUNCTION_DECL
7cfdc2f0 6738 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
097b5c8b 6739 {
6740 if (DECL_USER_ALIGN (decl))
6741 error ("alignment for %q+D was previously specified as %d "
6742 "and may not be decreased", decl,
6743 DECL_ALIGN (decl) / BITS_PER_UNIT);
6744 else
6745 error ("alignment for %q+D must be at least %d", decl,
6746 DECL_ALIGN (decl) / BITS_PER_UNIT);
6747 *no_add_attrs = true;
6748 }
f8e93a2e 6749 else
6750 {
7cfdc2f0 6751 DECL_ALIGN (decl) = (1U << i) * BITS_PER_UNIT;
f8e93a2e 6752 DECL_USER_ALIGN (decl) = 1;
6753 }
6754
6755 return NULL_TREE;
6756}
6757
6758/* Handle a "weak" attribute; arguments as in
6759 struct attribute_spec.handler. */
6760
6761static tree
f948b309 6762handle_weak_attribute (tree *node, tree name,
9a03a746 6763 tree ARG_UNUSED (args),
6764 int ARG_UNUSED (flags),
6765 bool * ARG_UNUSED (no_add_attrs))
f8e93a2e 6766{
f948b309 6767 if (TREE_CODE (*node) == FUNCTION_DECL
059a60f3 6768 && DECL_DECLARED_INLINE_P (*node))
6769 {
0725e25c 6770 warning (OPT_Wattributes, "inline function %q+D declared weak", *node);
059a60f3 6771 *no_add_attrs = true;
6772 }
85c0a25c 6773 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
6774 {
6775 error ("indirect function %q+D cannot be declared weak", *node);
6776 *no_add_attrs = true;
6777 return NULL_TREE;
6778 }
059a60f3 6779 else if (TREE_CODE (*node) == FUNCTION_DECL
6780 || TREE_CODE (*node) == VAR_DECL)
f948b309 6781 declare_weak (*node);
6782 else
6783 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6784
6785 return NULL_TREE;
6786}
6787
85c0a25c 6788/* Handle an "alias" or "ifunc" attribute; arguments as in
6789 struct attribute_spec.handler, except that IS_ALIAS tells us
6790 whether this is an alias as opposed to ifunc attribute. */
f8e93a2e 6791
6792static tree
85c0a25c 6793handle_alias_ifunc_attribute (bool is_alias, tree *node, tree name, tree args,
6794 bool *no_add_attrs)
f8e93a2e 6795{
6796 tree decl = *node;
6797
85c0a25c 6798 if (TREE_CODE (decl) != FUNCTION_DECL
6799 && (!is_alias || TREE_CODE (decl) != VAR_DECL))
9e830260 6800 {
6801 warning (OPT_Wattributes, "%qE attribute ignored", name);
6802 *no_add_attrs = true;
6803 }
6804 else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
48e1416a 6805 || (TREE_CODE (decl) != FUNCTION_DECL
0a3ecdc1 6806 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
6807 /* A static variable declaration is always a tentative definition,
6808 but the alias is a non-tentative definition which overrides. */
48e1416a 6809 || (TREE_CODE (decl) != FUNCTION_DECL
0a3ecdc1 6810 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
f8e93a2e 6811 {
85c0a25c 6812 error ("%q+D defined both normally and as %qE attribute", decl, name);
f8e93a2e 6813 *no_add_attrs = true;
85c0a25c 6814 return NULL_TREE;
f8e93a2e 6815 }
85c0a25c 6816 else if (!is_alias
6817 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
6818 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))))
6819 {
6820 error ("weak %q+D cannot be defined %qE", decl, name);
6821 *no_add_attrs = true;
6822 return NULL_TREE;
6823 }
8c42f0d9 6824
6825 /* Note that the very first time we process a nested declaration,
6826 decl_function_context will not be set. Indeed, *would* never
6827 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6828 we do below. After such frobbery, pushdecl would set the context.
6829 In any case, this is never what we want. */
6830 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
f8e93a2e 6831 {
6832 tree id;
6833
6834 id = TREE_VALUE (args);
6835 if (TREE_CODE (id) != STRING_CST)
6836 {
85c0a25c 6837 error ("attribute %qE argument not a string", name);
f8e93a2e 6838 *no_add_attrs = true;
6839 return NULL_TREE;
6840 }
6841 id = get_identifier (TREE_STRING_POINTER (id));
6842 /* This counts as a use of the object pointed to. */
6843 TREE_USED (id) = 1;
6844
6845 if (TREE_CODE (decl) == FUNCTION_DECL)
6846 DECL_INITIAL (decl) = error_mark_node;
6847 else
4ee9c684 6848 {
f4a30bd7 6849 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
6850 DECL_EXTERNAL (decl) = 1;
6851 else
6852 DECL_EXTERNAL (decl) = 0;
4ee9c684 6853 TREE_STATIC (decl) = 1;
6854 }
85c0a25c 6855
6856 if (!is_alias)
6857 /* ifuncs are also aliases, so set that attribute too. */
6858 DECL_ATTRIBUTES (decl)
6859 = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
f8e93a2e 6860 }
6861 else
6862 {
9b2d6d13 6863 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 6864 *no_add_attrs = true;
6865 }
6866
6867 return NULL_TREE;
6868}
6869
85c0a25c 6870/* Handle an "alias" or "ifunc" attribute; arguments as in
6871 struct attribute_spec.handler. */
6872
6873static tree
6874handle_ifunc_attribute (tree *node, tree name, tree args,
6875 int ARG_UNUSED (flags), bool *no_add_attrs)
6876{
6877 return handle_alias_ifunc_attribute (false, node, name, args, no_add_attrs);
6878}
6879
6880/* Handle an "alias" or "ifunc" attribute; arguments as in
6881 struct attribute_spec.handler. */
6882
6883static tree
6884handle_alias_attribute (tree *node, tree name, tree args,
6885 int ARG_UNUSED (flags), bool *no_add_attrs)
6886{
6887 return handle_alias_ifunc_attribute (true, node, name, args, no_add_attrs);
6888}
6889
f4a30bd7 6890/* Handle a "weakref" attribute; arguments as in struct
6891 attribute_spec.handler. */
6892
6893static tree
6894handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6895 int flags, bool *no_add_attrs)
6896{
6897 tree attr = NULL_TREE;
6898
83852912 6899 /* We must ignore the attribute when it is associated with
6900 local-scoped decls, since attribute alias is ignored and many
6901 such symbols do not even have a DECL_WEAK field. */
64a7bd81 6902 if (decl_function_context (*node)
6903 || current_function_decl
6904 || (TREE_CODE (*node) != VAR_DECL && TREE_CODE (*node) != FUNCTION_DECL))
83852912 6905 {
6906 warning (OPT_Wattributes, "%qE attribute ignored", name);
6907 *no_add_attrs = true;
6908 return NULL_TREE;
6909 }
6910
85c0a25c 6911 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
6912 {
6913 error ("indirect function %q+D cannot be declared weakref", *node);
6914 *no_add_attrs = true;
6915 return NULL_TREE;
6916 }
6917
f4a30bd7 6918 /* The idea here is that `weakref("name")' mutates into `weakref,
6919 alias("name")', and weakref without arguments, in turn,
6920 implicitly adds weak. */
6921
6922 if (args)
6923 {
6924 attr = tree_cons (get_identifier ("alias"), args, attr);
6925 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
6926
6927 *no_add_attrs = true;
0a3ecdc1 6928
6929 decl_attributes (node, attr, flags);
f4a30bd7 6930 }
6931 else
6932 {
6933 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
712d2297 6934 error_at (DECL_SOURCE_LOCATION (*node),
6935 "weakref attribute must appear before alias attribute");
f4a30bd7 6936
0a3ecdc1 6937 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6938 and that isn't supported; and because it wants to add it to
6939 the list of weak decls, which isn't helpful. */
6940 DECL_WEAK (*node) = 1;
f4a30bd7 6941 }
6942
f4a30bd7 6943 return NULL_TREE;
6944}
6945
f8e93a2e 6946/* Handle an "visibility" attribute; arguments as in
6947 struct attribute_spec.handler. */
6948
6949static tree
1cae46be 6950handle_visibility_attribute (tree *node, tree name, tree args,
9a03a746 6951 int ARG_UNUSED (flags),
4a2849cb 6952 bool *ARG_UNUSED (no_add_attrs))
f8e93a2e 6953{
6954 tree decl = *node;
9c40570a 6955 tree id = TREE_VALUE (args);
4a2849cb 6956 enum symbol_visibility vis;
f8e93a2e 6957
b212f378 6958 if (TYPE_P (*node))
6959 {
4a2849cb 6960 if (TREE_CODE (*node) == ENUMERAL_TYPE)
6961 /* OK */;
6962 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
6963 {
6964 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
6965 name);
6966 return NULL_TREE;
6967 }
6968 else if (TYPE_FIELDS (*node))
6969 {
6970 error ("%qE attribute ignored because %qT is already defined",
6971 name, *node);
6972 return NULL_TREE;
6973 }
b212f378 6974 }
84166705 6975 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
f8e93a2e 6976 {
9b2d6d13 6977 warning (OPT_Wattributes, "%qE attribute ignored", name);
9c40570a 6978 return NULL_TREE;
f8e93a2e 6979 }
f8e93a2e 6980
9c40570a 6981 if (TREE_CODE (id) != STRING_CST)
6982 {
07e3a3d2 6983 error ("visibility argument not a string");
9c40570a 6984 return NULL_TREE;
f8e93a2e 6985 }
b27ac6b5 6986
b212f378 6987 /* If this is a type, set the visibility on the type decl. */
6988 if (TYPE_P (decl))
6989 {
6990 decl = TYPE_NAME (decl);
84166705 6991 if (!decl)
a0c938f0 6992 return NULL_TREE;
e147aab3 6993 if (TREE_CODE (decl) == IDENTIFIER_NODE)
6994 {
9b2d6d13 6995 warning (OPT_Wattributes, "%qE attribute ignored on types",
e147aab3 6996 name);
6997 return NULL_TREE;
6998 }
b212f378 6999 }
f8e93a2e 7000
9c40570a 7001 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4a2849cb 7002 vis = VISIBILITY_DEFAULT;
9c40570a 7003 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4a2849cb 7004 vis = VISIBILITY_INTERNAL;
9c40570a 7005 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4a2849cb 7006 vis = VISIBILITY_HIDDEN;
9c40570a 7007 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4a2849cb 7008 vis = VISIBILITY_PROTECTED;
9c40570a 7009 else
4a2849cb 7010 {
7011 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7012 vis = VISIBILITY_DEFAULT;
7013 }
7014
7015 if (DECL_VISIBILITY_SPECIFIED (decl)
098a01e7 7016 && vis != DECL_VISIBILITY (decl))
7017 {
7018 tree attributes = (TYPE_P (*node)
7019 ? TYPE_ATTRIBUTES (*node)
7020 : DECL_ATTRIBUTES (decl));
7021 if (lookup_attribute ("visibility", attributes))
7022 error ("%qD redeclared with different visibility", decl);
7023 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7024 && lookup_attribute ("dllimport", attributes))
7025 error ("%qD was declared %qs which implies default visibility",
7026 decl, "dllimport");
7027 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7028 && lookup_attribute ("dllexport", attributes))
7029 error ("%qD was declared %qs which implies default visibility",
7030 decl, "dllexport");
7031 }
4a2849cb 7032
7033 DECL_VISIBILITY (decl) = vis;
b212f378 7034 DECL_VISIBILITY_SPECIFIED (decl) = 1;
7035
4a2849cb 7036 /* Go ahead and attach the attribute to the node as well. This is needed
7037 so we can determine whether we have VISIBILITY_DEFAULT because the
7038 visibility was not specified, or because it was explicitly overridden
7039 from the containing scope. */
9c40570a 7040
f8e93a2e 7041 return NULL_TREE;
7042}
7043
3aa0c315 7044/* Determine the ELF symbol visibility for DECL, which is either a
7045 variable or a function. It is an error to use this function if a
7046 definition of DECL is not available in this translation unit.
7047 Returns true if the final visibility has been determined by this
7048 function; false if the caller is free to make additional
7049 modifications. */
7050
7051bool
7052c_determine_visibility (tree decl)
7053{
1d8fc210 7054 gcc_assert (TREE_CODE (decl) == VAR_DECL
7055 || TREE_CODE (decl) == FUNCTION_DECL);
3aa0c315 7056
7057 /* If the user explicitly specified the visibility with an
7058 attribute, honor that. DECL_VISIBILITY will have been set during
7059 the processing of the attribute. We check for an explicit
7060 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7061 to distinguish the use of an attribute from the use of a "#pragma
7062 GCC visibility push(...)"; in the latter case we still want other
7063 considerations to be able to overrule the #pragma. */
098a01e7 7064 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
7065 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7066 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
7067 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
3aa0c315 7068 return true;
7069
4a2849cb 7070 /* Set default visibility to whatever the user supplied with
7071 visibility_specified depending on #pragma GCC visibility. */
7072 if (!DECL_VISIBILITY_SPECIFIED (decl))
7073 {
2d9d8740 7074 if (visibility_options.inpragma
7075 || DECL_VISIBILITY (decl) != default_visibility)
7076 {
7077 DECL_VISIBILITY (decl) = default_visibility;
7078 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
7079 /* If visibility changed and DECL already has DECL_RTL, ensure
7080 symbol flags are updated. */
7081 if (((TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
7082 || TREE_CODE (decl) == FUNCTION_DECL)
7083 && DECL_RTL_SET_P (decl))
7084 make_decl_rtl (decl);
7085 }
4a2849cb 7086 }
3aa0c315 7087 return false;
7088}
7089
24dfead4 7090/* Handle an "tls_model" attribute; arguments as in
7091 struct attribute_spec.handler. */
7092
7093static tree
1cae46be 7094handle_tls_model_attribute (tree *node, tree name, tree args,
9a03a746 7095 int ARG_UNUSED (flags), bool *no_add_attrs)
24dfead4 7096{
1b53eb20 7097 tree id;
24dfead4 7098 tree decl = *node;
1b53eb20 7099 enum tls_model kind;
24dfead4 7100
1b53eb20 7101 *no_add_attrs = true;
7102
c34f8a78 7103 if (TREE_CODE (decl) != VAR_DECL || !DECL_THREAD_LOCAL_P (decl))
24dfead4 7104 {
9b2d6d13 7105 warning (OPT_Wattributes, "%qE attribute ignored", name);
1b53eb20 7106 return NULL_TREE;
24dfead4 7107 }
24dfead4 7108
1b53eb20 7109 kind = DECL_TLS_MODEL (decl);
7110 id = TREE_VALUE (args);
7111 if (TREE_CODE (id) != STRING_CST)
7112 {
7113 error ("tls_model argument not a string");
7114 return NULL_TREE;
24dfead4 7115 }
7116
1b53eb20 7117 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
7118 kind = TLS_MODEL_LOCAL_EXEC;
7119 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
7120 kind = TLS_MODEL_INITIAL_EXEC;
7121 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
7122 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
7123 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
7124 kind = TLS_MODEL_GLOBAL_DYNAMIC;
7125 else
7126 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7127
7128 DECL_TLS_MODEL (decl) = kind;
24dfead4 7129 return NULL_TREE;
7130}
7131
f8e93a2e 7132/* Handle a "no_instrument_function" attribute; arguments as in
7133 struct attribute_spec.handler. */
7134
7135static tree
1cae46be 7136handle_no_instrument_function_attribute (tree *node, tree name,
9a03a746 7137 tree ARG_UNUSED (args),
7138 int ARG_UNUSED (flags),
09347743 7139 bool *no_add_attrs)
f8e93a2e 7140{
7141 tree decl = *node;
7142
7143 if (TREE_CODE (decl) != FUNCTION_DECL)
7144 {
712d2297 7145 error_at (DECL_SOURCE_LOCATION (decl),
7146 "%qE attribute applies only to functions", name);
f8e93a2e 7147 *no_add_attrs = true;
7148 }
7149 else if (DECL_INITIAL (decl))
7150 {
712d2297 7151 error_at (DECL_SOURCE_LOCATION (decl),
7152 "can%'t set %qE attribute after definition", name);
f8e93a2e 7153 *no_add_attrs = true;
7154 }
7155 else
7156 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
7157
7158 return NULL_TREE;
7159}
7160
7161/* Handle a "malloc" attribute; arguments as in
7162 struct attribute_spec.handler. */
7163
7164static tree
9a03a746 7165handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7166 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 7167{
a5147fca 7168 if (TREE_CODE (*node) == FUNCTION_DECL
7169 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
f8e93a2e 7170 DECL_IS_MALLOC (*node) = 1;
f8e93a2e 7171 else
7172 {
9b2d6d13 7173 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 7174 *no_add_attrs = true;
7175 }
7176
7177 return NULL_TREE;
7178}
7179
4a29c97c 7180/* Handle a "alloc_size" attribute; arguments as in
7181 struct attribute_spec.handler. */
7182
7183static tree
7184handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7185 int ARG_UNUSED (flags), bool *no_add_attrs)
7186{
2802826e 7187 unsigned arg_count = type_num_arguments (*node);
4a29c97c 7188 for (; args; args = TREE_CHAIN (args))
7189 {
7190 tree position = TREE_VALUE (args);
7191
7192 if (TREE_CODE (position) != INTEGER_CST
48e1416a 7193 || TREE_INT_CST_HIGH (position)
4a29c97c 7194 || TREE_INT_CST_LOW (position) < 1
7195 || TREE_INT_CST_LOW (position) > arg_count )
7196 {
48e1416a 7197 warning (OPT_Wattributes,
4a29c97c 7198 "alloc_size parameter outside range");
7199 *no_add_attrs = true;
7200 return NULL_TREE;
7201 }
7202 }
7203 return NULL_TREE;
7204}
7205
8ce86007 7206/* Handle a "fn spec" attribute; arguments as in
7207 struct attribute_spec.handler. */
7208
7209static tree
7210handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
7211 tree args, int ARG_UNUSED (flags),
7212 bool *no_add_attrs ATTRIBUTE_UNUSED)
7213{
7214 gcc_assert (args
7215 && TREE_CODE (TREE_VALUE (args)) == STRING_CST
7216 && !TREE_CHAIN (args));
7217 return NULL_TREE;
7218}
7219
26d1c5ff 7220/* Handle a "returns_twice" attribute; arguments as in
7221 struct attribute_spec.handler. */
7222
7223static tree
7224handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7225 int ARG_UNUSED (flags), bool *no_add_attrs)
7226{
7227 if (TREE_CODE (*node) == FUNCTION_DECL)
7228 DECL_IS_RETURNS_TWICE (*node) = 1;
7229 else
7230 {
9b2d6d13 7231 warning (OPT_Wattributes, "%qE attribute ignored", name);
26d1c5ff 7232 *no_add_attrs = true;
7233 }
7234
7235 return NULL_TREE;
7236}
7237
f8e93a2e 7238/* Handle a "no_limit_stack" attribute; arguments as in
7239 struct attribute_spec.handler. */
7240
7241static tree
1cae46be 7242handle_no_limit_stack_attribute (tree *node, tree name,
9a03a746 7243 tree ARG_UNUSED (args),
7244 int ARG_UNUSED (flags),
09347743 7245 bool *no_add_attrs)
f8e93a2e 7246{
7247 tree decl = *node;
7248
7249 if (TREE_CODE (decl) != FUNCTION_DECL)
7250 {
712d2297 7251 error_at (DECL_SOURCE_LOCATION (decl),
7252 "%qE attribute applies only to functions", name);
f8e93a2e 7253 *no_add_attrs = true;
7254 }
7255 else if (DECL_INITIAL (decl))
7256 {
712d2297 7257 error_at (DECL_SOURCE_LOCATION (decl),
7258 "can%'t set %qE attribute after definition", name);
f8e93a2e 7259 *no_add_attrs = true;
7260 }
7261 else
7262 DECL_NO_LIMIT_STACK (decl) = 1;
7263
7264 return NULL_TREE;
7265}
7266
7267/* Handle a "pure" attribute; arguments as in
7268 struct attribute_spec.handler. */
7269
7270static tree
9a03a746 7271handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7272 int ARG_UNUSED (flags), bool *no_add_attrs)
f8e93a2e 7273{
7274 if (TREE_CODE (*node) == FUNCTION_DECL)
9c2a0c05 7275 DECL_PURE_P (*node) = 1;
f8e93a2e 7276 /* ??? TODO: Support types. */
7277 else
7278 {
9b2d6d13 7279 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 7280 *no_add_attrs = true;
7281 }
7282
7283 return NULL_TREE;
7284}
7285
fc09b200 7286/* Handle a "no vops" attribute; arguments as in
7287 struct attribute_spec.handler. */
7288
7289static tree
7290handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
7291 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
7292 bool *ARG_UNUSED (no_add_attrs))
7293{
7294 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
7295 DECL_IS_NOVOPS (*node) = 1;
7296 return NULL_TREE;
7297}
7298
f8e93a2e 7299/* Handle a "deprecated" attribute; arguments as in
7300 struct attribute_spec.handler. */
1cae46be 7301
f8e93a2e 7302static tree
1cae46be 7303handle_deprecated_attribute (tree *node, tree name,
45c4e798 7304 tree args, int flags,
09347743 7305 bool *no_add_attrs)
f8e93a2e 7306{
7307 tree type = NULL_TREE;
7308 int warn = 0;
782858b8 7309 tree what = NULL_TREE;
1cae46be 7310
45c4e798 7311 if (!args)
7312 *no_add_attrs = true;
7313 else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
7314 {
7315 error ("deprecated message is not a string");
7316 *no_add_attrs = true;
7317 }
7318
f8e93a2e 7319 if (DECL_P (*node))
7320 {
7321 tree decl = *node;
7322 type = TREE_TYPE (decl);
1cae46be 7323
f8e93a2e 7324 if (TREE_CODE (decl) == TYPE_DECL
7325 || TREE_CODE (decl) == PARM_DECL
7326 || TREE_CODE (decl) == VAR_DECL
7327 || TREE_CODE (decl) == FUNCTION_DECL
40c8d1dd 7328 || TREE_CODE (decl) == FIELD_DECL
7329 || objc_method_decl (TREE_CODE (decl)))
f8e93a2e 7330 TREE_DEPRECATED (decl) = 1;
7331 else
7332 warn = 1;
7333 }
7334 else if (TYPE_P (*node))
7335 {
7336 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
e086912e 7337 *node = build_variant_type_copy (*node);
f8e93a2e 7338 TREE_DEPRECATED (*node) = 1;
7339 type = *node;
7340 }
7341 else
7342 warn = 1;
1cae46be 7343
f8e93a2e 7344 if (warn)
7345 {
7346 *no_add_attrs = true;
7347 if (type && TYPE_NAME (type))
7348 {
7349 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
782858b8 7350 what = TYPE_NAME (*node);
f8e93a2e 7351 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7352 && DECL_NAME (TYPE_NAME (type)))
782858b8 7353 what = DECL_NAME (TYPE_NAME (type));
f8e93a2e 7354 }
7355 if (what)
9b2d6d13 7356 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
f8e93a2e 7357 else
9b2d6d13 7358 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 7359 }
7360
7361 return NULL_TREE;
7362}
7363
f8e93a2e 7364/* Handle a "vector_size" attribute; arguments as in
7365 struct attribute_spec.handler. */
7366
7367static tree
1cae46be 7368handle_vector_size_attribute (tree *node, tree name, tree args,
9a03a746 7369 int ARG_UNUSED (flags),
09347743 7370 bool *no_add_attrs)
f8e93a2e 7371{
7372 unsigned HOST_WIDE_INT vecsize, nunits;
83e2a11b 7373 enum machine_mode orig_mode;
4917c376 7374 tree type = *node, new_type, size;
f8e93a2e 7375
7376 *no_add_attrs = true;
7377
4917c376 7378 size = TREE_VALUE (args);
4917c376 7379
84166705 7380 if (!host_integerp (size, 1))
f8e93a2e 7381 {
9b2d6d13 7382 warning (OPT_Wattributes, "%qE attribute ignored", name);
f8e93a2e 7383 return NULL_TREE;
7384 }
7385
7386 /* Get the vector size (in bytes). */
4917c376 7387 vecsize = tree_low_cst (size, 1);
f8e93a2e 7388
7389 /* We need to provide for vector pointers, vector arrays, and
7390 functions returning vectors. For example:
7391
7392 __attribute__((vector_size(16))) short *foo;
7393
7394 In this case, the mode is SI, but the type being modified is
7395 HI, so we need to look further. */
7396
7397 while (POINTER_TYPE_P (type)
7398 || TREE_CODE (type) == FUNCTION_TYPE
5bfb0742 7399 || TREE_CODE (type) == METHOD_TYPE
2cb0e5d9 7400 || TREE_CODE (type) == ARRAY_TYPE
7401 || TREE_CODE (type) == OFFSET_TYPE)
f8e93a2e 7402 type = TREE_TYPE (type);
7403
7404 /* Get the mode of the type being modified. */
7405 orig_mode = TYPE_MODE (type);
7406
2cb0e5d9 7407 if ((!INTEGRAL_TYPE_P (type)
7408 && !SCALAR_FLOAT_TYPE_P (type)
7409 && !FIXED_POINT_TYPE_P (type))
cee7491d 7410 || (!SCALAR_FLOAT_MODE_P (orig_mode)
9421ebb9 7411 && GET_MODE_CLASS (orig_mode) != MODE_INT
7412 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
7ec31215 7413 || !host_integerp (TYPE_SIZE_UNIT (type), 1)
7414 || TREE_CODE (type) == BOOLEAN_TYPE)
f8e93a2e 7415 {
782858b8 7416 error ("invalid vector type for attribute %qE", name);
f8e93a2e 7417 return NULL_TREE;
7418 }
7419
39cc3e6d 7420 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
7421 {
7422 error ("vector size not an integral multiple of component size");
7423 return NULL;
7424 }
7425
7426 if (vecsize == 0)
7427 {
7428 error ("zero vector size");
7429 return NULL;
7430 }
7431
f8e93a2e 7432 /* Calculate how many units fit in the vector. */
7433 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
83e2a11b 7434 if (nunits & (nunits - 1))
f8e93a2e 7435 {
83e2a11b 7436 error ("number of components of the vector not a power of two");
f8e93a2e 7437 return NULL_TREE;
7438 }
7439
83e2a11b 7440 new_type = build_vector_type (type, nunits);
f8e93a2e 7441
7442 /* Build back pointers if needed. */
d991e6e8 7443 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
f8e93a2e 7444
7445 return NULL_TREE;
7446}
7447
dbf6c367 7448/* Handle the "nonnull" attribute. */
7449static tree
9a03a746 7450handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
7451 tree args, int ARG_UNUSED (flags),
09347743 7452 bool *no_add_attrs)
dbf6c367 7453{
7454 tree type = *node;
7455 unsigned HOST_WIDE_INT attr_arg_num;
7456
7457 /* If no arguments are specified, all pointer arguments should be
d716ce75 7458 non-null. Verify a full prototype is given so that the arguments
dbf6c367 7459 will have the correct types when we actually check them later. */
84166705 7460 if (!args)
dbf6c367 7461 {
a36cf284 7462 if (!prototype_p (type))
dbf6c367 7463 {
7464 error ("nonnull attribute without arguments on a non-prototype");
4ee9c684 7465 *no_add_attrs = true;
dbf6c367 7466 }
7467 return NULL_TREE;
7468 }
7469
7470 /* Argument list specified. Verify that each argument number references
7471 a pointer argument. */
7472 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
7473 {
4ee9c684 7474 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
dbf6c367 7475
84166705 7476 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
dbf6c367 7477 {
07e3a3d2 7478 error ("nonnull argument has invalid operand number (argument %lu)",
dbf6c367 7479 (unsigned long) attr_arg_num);
7480 *no_add_attrs = true;
7481 return NULL_TREE;
7482 }
7483
d0af78c5 7484 if (prototype_p (type))
dbf6c367 7485 {
d0af78c5 7486 function_args_iterator iter;
7487 tree argument;
7488
7489 function_args_iter_init (&iter, type);
7490 for (ck_num = 1; ; ck_num++, function_args_iter_next (&iter))
dbf6c367 7491 {
d0af78c5 7492 argument = function_args_iter_cond (&iter);
7493 if (argument == NULL_TREE || ck_num == arg_num)
dbf6c367 7494 break;
dbf6c367 7495 }
7496
84166705 7497 if (!argument
d0af78c5 7498 || TREE_CODE (argument) == VOID_TYPE)
dbf6c367 7499 {
07e3a3d2 7500 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
dbf6c367 7501 (unsigned long) attr_arg_num, (unsigned long) arg_num);
7502 *no_add_attrs = true;
7503 return NULL_TREE;
7504 }
7505
d0af78c5 7506 if (TREE_CODE (argument) != POINTER_TYPE)
dbf6c367 7507 {
07e3a3d2 7508 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
dbf6c367 7509 (unsigned long) attr_arg_num, (unsigned long) arg_num);
7510 *no_add_attrs = true;
7511 return NULL_TREE;
7512 }
7513 }
7514 }
7515
7516 return NULL_TREE;
7517}
7518
7519/* Check the argument list of a function call for null in argument slots
d01f58f9 7520 that are marked as requiring a non-null pointer argument. The NARGS
7521 arguments are passed in the array ARGARRAY.
7522*/
dbf6c367 7523
7524static void
d01f58f9 7525check_function_nonnull (tree attrs, int nargs, tree *argarray)
dbf6c367 7526{
d01f58f9 7527 tree a, args;
7528 int i;
dbf6c367 7529
7530 for (a = attrs; a; a = TREE_CHAIN (a))
7531 {
7532 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
7533 {
4ee9c684 7534 args = TREE_VALUE (a);
dbf6c367 7535
4ee9c684 7536 /* Walk the argument list. If we encounter an argument number we
7537 should check for non-null, do it. If the attribute has no args,
7538 then every pointer argument is checked (in which case the check
dbf6c367 7539 for pointer type is done in check_nonnull_arg). */
d01f58f9 7540 for (i = 0; i < nargs; i++)
4ee9c684 7541 {
d01f58f9 7542 if (!args || nonnull_check_p (args, i + 1))
e4603171 7543 check_function_arguments_recurse (check_nonnull_arg, NULL,
d01f58f9 7544 argarray[i],
7545 i + 1);
4ee9c684 7546 }
dbf6c367 7547 }
7548 }
7549}
7550
50ca527f 7551/* Check that the Nth argument of a function call (counting backwards
d01f58f9 7552 from the end) is a (pointer)0. The NARGS arguments are passed in the
7553 array ARGARRAY. */
bf6c8de0 7554
7555static void
774e9d58 7556check_function_sentinel (const_tree fntype, int nargs, tree *argarray)
bf6c8de0 7557{
774e9d58 7558 tree attr = lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype));
bf6c8de0 7559
7560 if (attr)
7561 {
d01f58f9 7562 int len = 0;
7563 int pos = 0;
7564 tree sentinel;
774e9d58 7565 function_args_iterator iter;
7566 tree t;
a0c938f0 7567
d01f58f9 7568 /* Skip over the named arguments. */
774e9d58 7569 FOREACH_FUNCTION_ARGS (fntype, t, iter)
a0c938f0 7570 {
774e9d58 7571 if (len == nargs)
7572 break;
d01f58f9 7573 len++;
7574 }
50ca527f 7575
d01f58f9 7576 if (TREE_VALUE (attr))
7577 {
7578 tree p = TREE_VALUE (TREE_VALUE (attr));
7579 pos = TREE_INT_CST_LOW (p);
7580 }
50ca527f 7581
d01f58f9 7582 /* The sentinel must be one of the varargs, i.e.
7583 in position >= the number of fixed arguments. */
7584 if ((nargs - 1 - pos) < len)
7585 {
7586 warning (OPT_Wformat,
7587 "not enough variable arguments to fit a sentinel");
7588 return;
bf6c8de0 7589 }
d01f58f9 7590
7591 /* Validate the sentinel. */
7592 sentinel = argarray[nargs - 1 - pos];
7593 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
7594 || !integer_zerop (sentinel))
7595 /* Although __null (in C++) is only an integer we allow it
7596 nevertheless, as we are guaranteed that it's exactly
7597 as wide as a pointer, and we don't want to force
7598 users to cast the NULL they have written there.
7599 We warn with -Wstrict-null-sentinel, though. */
7600 && (warn_strict_null_sentinel || null_node != sentinel))
7601 warning (OPT_Wformat, "missing sentinel in function call");
bf6c8de0 7602 }
7603}
7604
dbf6c367 7605/* Helper for check_function_nonnull; given a list of operands which
7606 must be non-null in ARGS, determine if operand PARAM_NUM should be
7607 checked. */
7608
7609static bool
1cae46be 7610nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
dbf6c367 7611{
4ee9c684 7612 unsigned HOST_WIDE_INT arg_num = 0;
dbf6c367 7613
7614 for (; args; args = TREE_CHAIN (args))
7615 {
231bd014 7616 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
7617
7618 gcc_assert (found);
dbf6c367 7619
7620 if (arg_num == param_num)
7621 return true;
7622 }
7623 return false;
7624}
7625
7626/* Check that the function argument PARAM (which is operand number
7627 PARAM_NUM) is non-null. This is called by check_function_nonnull
7628 via check_function_arguments_recurse. */
7629
7630static void
9a03a746 7631check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
1cae46be 7632 unsigned HOST_WIDE_INT param_num)
dbf6c367 7633{
7634 /* Just skip checking the argument if it's not a pointer. This can
7635 happen if the "nonnull" attribute was given without an operand
7636 list (which means to check every pointer argument). */
7637
7638 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
7639 return;
7640
7641 if (integer_zerop (param))
155b601b 7642 warning (OPT_Wnonnull, "null argument where non-null required "
7643 "(argument %lu)", (unsigned long) param_num);
dbf6c367 7644}
7645
7646/* Helper for nonnull attribute handling; fetch the operand number
7647 from the attribute argument list. */
7648
7649static bool
1cae46be 7650get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
dbf6c367 7651{
67409385 7652 /* Verify the arg number is a constant. */
dbf6c367 7653 if (TREE_CODE (arg_num_expr) != INTEGER_CST
7654 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
7655 return false;
7656
7657 *valp = TREE_INT_CST_LOW (arg_num_expr);
7658 return true;
7659}
fa987697 7660
7661/* Handle a "nothrow" attribute; arguments as in
7662 struct attribute_spec.handler. */
7663
7664static tree
9a03a746 7665handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7666 int ARG_UNUSED (flags), bool *no_add_attrs)
fa987697 7667{
7668 if (TREE_CODE (*node) == FUNCTION_DECL)
7669 TREE_NOTHROW (*node) = 1;
7670 /* ??? TODO: Support types. */
7671 else
7672 {
9b2d6d13 7673 warning (OPT_Wattributes, "%qE attribute ignored", name);
fa987697 7674 *no_add_attrs = true;
7675 }
7676
7677 return NULL_TREE;
7678}
7acb29a3 7679
7680/* Handle a "cleanup" attribute; arguments as in
7681 struct attribute_spec.handler. */
7682
7683static tree
1cae46be 7684handle_cleanup_attribute (tree *node, tree name, tree args,
9a03a746 7685 int ARG_UNUSED (flags), bool *no_add_attrs)
7acb29a3 7686{
7687 tree decl = *node;
7688 tree cleanup_id, cleanup_decl;
7689
7690 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7691 for global destructors in C++. This requires infrastructure that
7692 we don't have generically at the moment. It's also not a feature
7693 we'd be missing too much, since we do have attribute constructor. */
7694 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
7695 {
9b2d6d13 7696 warning (OPT_Wattributes, "%qE attribute ignored", name);
7acb29a3 7697 *no_add_attrs = true;
7698 return NULL_TREE;
7699 }
7700
7701 /* Verify that the argument is a function in scope. */
7702 /* ??? We could support pointers to functions here as well, if
7703 that was considered desirable. */
7704 cleanup_id = TREE_VALUE (args);
7705 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
7706 {
07e3a3d2 7707 error ("cleanup argument not an identifier");
7acb29a3 7708 *no_add_attrs = true;
7709 return NULL_TREE;
7710 }
d1c41717 7711 cleanup_decl = lookup_name (cleanup_id);
7acb29a3 7712 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
7713 {
07e3a3d2 7714 error ("cleanup argument not a function");
7acb29a3 7715 *no_add_attrs = true;
7716 return NULL_TREE;
7717 }
7718
1cae46be 7719 /* That the function has proper type is checked with the
7acb29a3 7720 eventual call to build_function_call. */
7721
7722 return NULL_TREE;
7723}
8a8cdb8d 7724
7725/* Handle a "warn_unused_result" attribute. No special handling. */
7726
7727static tree
7728handle_warn_unused_result_attribute (tree *node, tree name,
9a03a746 7729 tree ARG_UNUSED (args),
7730 int ARG_UNUSED (flags), bool *no_add_attrs)
8a8cdb8d 7731{
7732 /* Ignore the attribute for functions not returning any value. */
7733 if (VOID_TYPE_P (TREE_TYPE (*node)))
7734 {
9b2d6d13 7735 warning (OPT_Wattributes, "%qE attribute ignored", name);
8a8cdb8d 7736 *no_add_attrs = true;
7737 }
7738
7739 return NULL_TREE;
7740}
bf6c8de0 7741
7742/* Handle a "sentinel" attribute. */
7743
7744static tree
50ca527f 7745handle_sentinel_attribute (tree *node, tree name, tree args,
bf6c8de0 7746 int ARG_UNUSED (flags), bool *no_add_attrs)
7747{
a36cf284 7748 if (!prototype_p (*node))
bf6c8de0 7749 {
9b2d6d13 7750 warning (OPT_Wattributes,
7751 "%qE attribute requires prototypes with named arguments", name);
bf6c8de0 7752 *no_add_attrs = true;
bf6c8de0 7753 }
50ca527f 7754 else
7755 {
c33080b9 7756 if (!stdarg_p (*node))
a0c938f0 7757 {
9b2d6d13 7758 warning (OPT_Wattributes,
7759 "%qE attribute only applies to variadic functions", name);
50ca527f 7760 *no_add_attrs = true;
7761 }
7762 }
a0c938f0 7763
50ca527f 7764 if (args)
bf6c8de0 7765 {
50ca527f 7766 tree position = TREE_VALUE (args);
7767
50ca527f 7768 if (TREE_CODE (position) != INTEGER_CST)
a0c938f0 7769 {
48e1416a 7770 warning (OPT_Wattributes,
01b54db5 7771 "requested position is not an integer constant");
50ca527f 7772 *no_add_attrs = true;
7773 }
7774 else
a0c938f0 7775 {
50ca527f 7776 if (tree_int_cst_lt (position, integer_zero_node))
7777 {
01b54db5 7778 warning (OPT_Wattributes,
7779 "requested position is less than zero");
50ca527f 7780 *no_add_attrs = true;
7781 }
7782 }
bf6c8de0 7783 }
a0c938f0 7784
bf6c8de0 7785 return NULL_TREE;
7786}
b5c26b42 7787
7788/* Handle a "type_generic" attribute. */
7789
7790static tree
7791handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
7792 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
7793 bool * ARG_UNUSED (no_add_attrs))
7794{
19fbe3a4 7795 /* Ensure we have a function type. */
7796 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
48e1416a 7797
19fbe3a4 7798 /* Ensure we have a variadic function. */
c33080b9 7799 gcc_assert (!prototype_p (*node) || stdarg_p (*node));
b5c26b42 7800
7801 return NULL_TREE;
7802}
46f8e3b0 7803
24470055 7804/* Handle a "target" attribute. */
46f8e3b0 7805
7806static tree
24470055 7807handle_target_attribute (tree *node, tree name, tree args, int flags,
46f8e3b0 7808 bool *no_add_attrs)
7809{
7810 /* Ensure we have a function type. */
7811 if (TREE_CODE (*node) != FUNCTION_DECL)
7812 {
7813 warning (OPT_Wattributes, "%qE attribute ignored", name);
7814 *no_add_attrs = true;
7815 }
46f8e3b0 7816 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
7817 flags))
7818 *no_add_attrs = true;
7819
7820 return NULL_TREE;
7821}
7822
7823/* Arguments being collected for optimization. */
7824typedef const char *const_char_p; /* For DEF_VEC_P. */
7825DEF_VEC_P(const_char_p);
7826DEF_VEC_ALLOC_P(const_char_p, gc);
7827static GTY(()) VEC(const_char_p, gc) *optimize_args;
7828
7829
7830/* Inner function to convert a TREE_LIST to argv string to parse the optimize
7831 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7832 false for #pragma GCC optimize. */
7833
7834bool
7835parse_optimize_options (tree args, bool attr_p)
7836{
7837 bool ret = true;
7838 unsigned opt_argc;
7839 unsigned i;
2becf397 7840 int saved_flag_strict_aliasing;
46f8e3b0 7841 const char **opt_argv;
615ef0bb 7842 struct cl_decoded_option *decoded_options;
7843 unsigned int decoded_options_count;
46f8e3b0 7844 tree ap;
7845
7846 /* Build up argv vector. Just in case the string is stored away, use garbage
7847 collected strings. */
7848 VEC_truncate (const_char_p, optimize_args, 0);
7849 VEC_safe_push (const_char_p, gc, optimize_args, NULL);
7850
7851 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
7852 {
7853 tree value = TREE_VALUE (ap);
7854
7855 if (TREE_CODE (value) == INTEGER_CST)
7856 {
7857 char buffer[20];
7858 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
7859 VEC_safe_push (const_char_p, gc, optimize_args, ggc_strdup (buffer));
7860 }
7861
7862 else if (TREE_CODE (value) == STRING_CST)
7863 {
7864 /* Split string into multiple substrings. */
7865 size_t len = TREE_STRING_LENGTH (value);
7866 char *p = ASTRDUP (TREE_STRING_POINTER (value));
7867 char *end = p + len;
7868 char *comma;
7869 char *next_p = p;
7870
7871 while (next_p != NULL)
7872 {
7873 size_t len2;
7874 char *q, *r;
7875
7876 p = next_p;
7877 comma = strchr (p, ',');
7878 if (comma)
7879 {
7880 len2 = comma - p;
7881 *comma = '\0';
7882 next_p = comma+1;
7883 }
7884 else
7885 {
7886 len2 = end - p;
7887 next_p = NULL;
7888 }
7889
ba72912a 7890 r = q = (char *) ggc_alloc_atomic (len2 + 3);
46f8e3b0 7891
7892 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7893 options. */
7894 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
7895 {
7896 ret = false;
7897 if (attr_p)
7898 warning (OPT_Wattributes,
ebd7c4c1 7899 "bad option %s to optimize attribute", p);
46f8e3b0 7900 else
7901 warning (OPT_Wpragmas,
e44b0a1f 7902 "bad option %s to pragma attribute", p);
46f8e3b0 7903 continue;
7904 }
7905
7906 if (*p != '-')
7907 {
7908 *r++ = '-';
7909
7910 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7911 itself is -Os, and any other switch begins with a -f. */
7912 if ((*p >= '0' && *p <= '9')
7913 || (p[0] == 's' && p[1] == '\0'))
7914 *r++ = 'O';
7915 else if (*p != 'O')
7916 *r++ = 'f';
7917 }
7918
7919 memcpy (r, p, len2);
7920 r[len2] = '\0';
7921 VEC_safe_push (const_char_p, gc, optimize_args, q);
7922 }
7923
7924 }
7925 }
7926
7927 opt_argc = VEC_length (const_char_p, optimize_args);
7928 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
7929
7930 for (i = 1; i < opt_argc; i++)
7931 opt_argv[i] = VEC_index (const_char_p, optimize_args, i);
7932
2becf397 7933 saved_flag_strict_aliasing = flag_strict_aliasing;
7934
46f8e3b0 7935 /* Now parse the options. */
f3f006ad 7936 decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv,
7937 &decoded_options,
7938 &decoded_options_count);
7939 decode_options (&global_options, &global_options_set,
3c6c0e40 7940 decoded_options, decoded_options_count,
7941 input_location, global_dc);
46f8e3b0 7942
4bec06b3 7943 targetm.override_options_after_change();
7944
2becf397 7945 /* Don't allow changing -fstrict-aliasing. */
7946 flag_strict_aliasing = saved_flag_strict_aliasing;
7947
46f8e3b0 7948 VEC_truncate (const_char_p, optimize_args, 0);
7949 return ret;
7950}
7951
7952/* For handling "optimize" attribute. arguments as in
7953 struct attribute_spec.handler. */
7954
7955static tree
7956handle_optimize_attribute (tree *node, tree name, tree args,
7957 int ARG_UNUSED (flags), bool *no_add_attrs)
7958{
7959 /* Ensure we have a function type. */
7960 if (TREE_CODE (*node) != FUNCTION_DECL)
7961 {
7962 warning (OPT_Wattributes, "%qE attribute ignored", name);
7963 *no_add_attrs = true;
7964 }
7965 else
7966 {
7967 struct cl_optimization cur_opts;
7968 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
7969
7970 /* Save current options. */
2c5d2e39 7971 cl_optimization_save (&cur_opts, &global_options);
46f8e3b0 7972
7973 /* If we previously had some optimization options, use them as the
7974 default. */
7975 if (old_opts)
2c5d2e39 7976 cl_optimization_restore (&global_options,
7977 TREE_OPTIMIZATION (old_opts));
46f8e3b0 7978
7979 /* Parse options, and update the vector. */
7980 parse_optimize_options (args, true);
7981 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
7982 = build_optimization_node ();
7983
7984 /* Restore current options. */
2c5d2e39 7985 cl_optimization_restore (&global_options, &cur_opts);
46f8e3b0 7986 }
7987
7988 return NULL_TREE;
7989}
48b14f50 7990
7991/* Handle a "no_split_stack" attribute. */
7992
7993static tree
7994handle_no_split_stack_attribute (tree *node, tree name,
7995 tree ARG_UNUSED (args),
7996 int ARG_UNUSED (flags),
7997 bool *no_add_attrs)
7998{
7999 tree decl = *node;
8000
8001 if (TREE_CODE (decl) != FUNCTION_DECL)
8002 {
8003 error_at (DECL_SOURCE_LOCATION (decl),
8004 "%qE attribute applies only to functions", name);
8005 *no_add_attrs = true;
8006 }
8007 else if (DECL_INITIAL (decl))
8008 {
8009 error_at (DECL_SOURCE_LOCATION (decl),
8010 "can%'t set %qE attribute after definition", name);
8011 *no_add_attrs = true;
8012 }
8013
8014 return NULL_TREE;
8015}
dbf6c367 8016\f
774e9d58 8017/* Check for valid arguments being passed to a function with FNTYPE.
8018 There are NARGS arguments in the array ARGARRAY. */
dbf6c367 8019void
774e9d58 8020check_function_arguments (const_tree fntype, int nargs, tree *argarray)
dbf6c367 8021{
8022 /* Check for null being passed in a pointer argument that must be
8023 non-null. We also need to do this if format checking is enabled. */
8024
8025 if (warn_nonnull)
774e9d58 8026 check_function_nonnull (TYPE_ATTRIBUTES (fntype), nargs, argarray);
dbf6c367 8027
8028 /* Check for errors in format strings. */
8029
95c90e04 8030 if (warn_format || warn_missing_format_attribute)
774e9d58 8031 check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray);
95c90e04 8032
8033 if (warn_format)
774e9d58 8034 check_function_sentinel (fntype, nargs, argarray);
dbf6c367 8035}
8036
8037/* Generic argument checking recursion routine. PARAM is the argument to
8038 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8039 once the argument is resolved. CTX is context for the callback. */
8040void
1cae46be 8041check_function_arguments_recurse (void (*callback)
8042 (void *, tree, unsigned HOST_WIDE_INT),
8043 void *ctx, tree param,
8044 unsigned HOST_WIDE_INT param_num)
dbf6c367 8045{
72dd6141 8046 if (CONVERT_EXPR_P (param)
c44afe23 8047 && (TYPE_PRECISION (TREE_TYPE (param))
8048 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
dbf6c367 8049 {
8050 /* Strip coercion. */
8051 check_function_arguments_recurse (callback, ctx,
4ee9c684 8052 TREE_OPERAND (param, 0), param_num);
dbf6c367 8053 return;
8054 }
8055
8056 if (TREE_CODE (param) == CALL_EXPR)
8057 {
c2f47e15 8058 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
dbf6c367 8059 tree attrs;
8060 bool found_format_arg = false;
8061
8062 /* See if this is a call to a known internationalization function
8063 that modifies a format arg. Such a function may have multiple
8064 format_arg attributes (for example, ngettext). */
8065
8066 for (attrs = TYPE_ATTRIBUTES (type);
8067 attrs;
8068 attrs = TREE_CHAIN (attrs))
8069 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
8070 {
c2f47e15 8071 tree inner_arg;
dbf6c367 8072 tree format_num_expr;
8073 int format_num;
8074 int i;
c2f47e15 8075 call_expr_arg_iterator iter;
dbf6c367 8076
8077 /* Extract the argument number, which was previously checked
8078 to be valid. */
8079 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
dbf6c367 8080
231bd014 8081 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
8082 && !TREE_INT_CST_HIGH (format_num_expr));
dbf6c367 8083
8084 format_num = TREE_INT_CST_LOW (format_num_expr);
8085
c2f47e15 8086 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
8087 inner_arg != 0;
8088 inner_arg = next_call_expr_arg (&iter), i++)
dbf6c367 8089 if (i == format_num)
8090 {
8091 check_function_arguments_recurse (callback, ctx,
c2f47e15 8092 inner_arg, param_num);
dbf6c367 8093 found_format_arg = true;
8094 break;
8095 }
8096 }
8097
8098 /* If we found a format_arg attribute and did a recursive check,
8099 we are done with checking this argument. Otherwise, we continue
8100 and this will be considered a non-literal. */
8101 if (found_format_arg)
8102 return;
8103 }
8104
8105 if (TREE_CODE (param) == COND_EXPR)
8106 {
8107 /* Check both halves of the conditional expression. */
8108 check_function_arguments_recurse (callback, ctx,
4ee9c684 8109 TREE_OPERAND (param, 1), param_num);
dbf6c367 8110 check_function_arguments_recurse (callback, ctx,
4ee9c684 8111 TREE_OPERAND (param, 2), param_num);
dbf6c367 8112 return;
8113 }
8114
8115 (*callback) (ctx, param, param_num);
8116}
1f3233d1 8117
60cce472 8118/* Checks for a builtin function FNDECL that the number of arguments
8119 NARGS against the required number REQUIRED and issues an error if
8120 there is a mismatch. Returns true if the number of arguments is
8121 correct, otherwise false. */
d43cee80 8122
8123static bool
60cce472 8124builtin_function_validate_nargs (tree fndecl, int nargs, int required)
d43cee80 8125{
8126 if (nargs < required)
8127 {
60cce472 8128 error_at (input_location,
8129 "not enough arguments to function %qE", fndecl);
d43cee80 8130 return false;
8131 }
8132 else if (nargs > required)
8133 {
60cce472 8134 error_at (input_location,
8135 "too many arguments to function %qE", fndecl);
d43cee80 8136 return false;
8137 }
8138 return true;
8139}
8140
8141/* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8142 Returns false if there was an error, otherwise true. */
8143
8144bool
8145check_builtin_function_arguments (tree fndecl, int nargs, tree *args)
8146{
8147 if (!DECL_BUILT_IN (fndecl)
8148 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
8149 return true;
8150
8151 switch (DECL_FUNCTION_CODE (fndecl))
8152 {
8153 case BUILT_IN_CONSTANT_P:
60cce472 8154 return builtin_function_validate_nargs (fndecl, nargs, 1);
d43cee80 8155
8156 case BUILT_IN_ISFINITE:
8157 case BUILT_IN_ISINF:
c319d56a 8158 case BUILT_IN_ISINF_SIGN:
d43cee80 8159 case BUILT_IN_ISNAN:
8160 case BUILT_IN_ISNORMAL:
60cce472 8161 if (builtin_function_validate_nargs (fndecl, nargs, 1))
d43cee80 8162 {
8163 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
8164 {
8165 error ("non-floating-point argument in call to "
8166 "function %qE", fndecl);
8167 return false;
8168 }
8169 return true;
8170 }
8171 return false;
8172
8173 case BUILT_IN_ISGREATER:
8174 case BUILT_IN_ISGREATEREQUAL:
8175 case BUILT_IN_ISLESS:
8176 case BUILT_IN_ISLESSEQUAL:
8177 case BUILT_IN_ISLESSGREATER:
8178 case BUILT_IN_ISUNORDERED:
60cce472 8179 if (builtin_function_validate_nargs (fndecl, nargs, 2))
d43cee80 8180 {
8181 enum tree_code code0, code1;
8182 code0 = TREE_CODE (TREE_TYPE (args[0]));
8183 code1 = TREE_CODE (TREE_TYPE (args[1]));
8184 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
8185 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
8186 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
8187 {
8188 error ("non-floating-point arguments in call to "
8189 "function %qE", fndecl);
8190 return false;
8191 }
8192 return true;
8193 }
8194 return false;
8195
19fbe3a4 8196 case BUILT_IN_FPCLASSIFY:
60cce472 8197 if (builtin_function_validate_nargs (fndecl, nargs, 6))
19fbe3a4 8198 {
8199 unsigned i;
48e1416a 8200
19fbe3a4 8201 for (i=0; i<5; i++)
8202 if (TREE_CODE (args[i]) != INTEGER_CST)
8203 {
8204 error ("non-const integer argument %u in call to function %qE",
8205 i+1, fndecl);
8206 return false;
8207 }
8208
8209 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
8210 {
8211 error ("non-floating-point argument in call to function %qE",
8212 fndecl);
8213 return false;
8214 }
8215 return true;
8216 }
8217 return false;
8218
fca0886c 8219 case BUILT_IN_ASSUME_ALIGNED:
8220 if (builtin_function_validate_nargs (fndecl, nargs, 2 + (nargs > 2)))
8221 {
8222 if (nargs >= 3 && TREE_CODE (TREE_TYPE (args[2])) != INTEGER_TYPE)
8223 {
8224 error ("non-integer argument 3 in call to function %qE", fndecl);
8225 return false;
8226 }
8227 return true;
8228 }
8229 return false;
8230
d43cee80 8231 default:
8232 return true;
8233 }
8234}
8235
860251be 8236/* Function to help qsort sort FIELD_DECLs by name order. */
8237
8238int
8239field_decl_cmp (const void *x_p, const void *y_p)
8240{
4fd61bc6 8241 const tree *const x = (const tree *const) x_p;
8242 const tree *const y = (const tree *const) y_p;
8243
860251be 8244 if (DECL_NAME (*x) == DECL_NAME (*y))
8245 /* A nontype is "greater" than a type. */
8246 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
8247 if (DECL_NAME (*x) == NULL_TREE)
8248 return -1;
8249 if (DECL_NAME (*y) == NULL_TREE)
8250 return 1;
8251 if (DECL_NAME (*x) < DECL_NAME (*y))
8252 return -1;
8253 return 1;
8254}
8255
8256static struct {
8257 gt_pointer_operator new_value;
8258 void *cookie;
8259} resort_data;
8260
8261/* This routine compares two fields like field_decl_cmp but using the
8262pointer operator in resort_data. */
8263
8264static int
8265resort_field_decl_cmp (const void *x_p, const void *y_p)
8266{
4fd61bc6 8267 const tree *const x = (const tree *const) x_p;
8268 const tree *const y = (const tree *const) y_p;
860251be 8269
8270 if (DECL_NAME (*x) == DECL_NAME (*y))
8271 /* A nontype is "greater" than a type. */
8272 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
8273 if (DECL_NAME (*x) == NULL_TREE)
8274 return -1;
8275 if (DECL_NAME (*y) == NULL_TREE)
8276 return 1;
8277 {
8278 tree d1 = DECL_NAME (*x);
8279 tree d2 = DECL_NAME (*y);
8280 resort_data.new_value (&d1, resort_data.cookie);
8281 resort_data.new_value (&d2, resort_data.cookie);
8282 if (d1 < d2)
8283 return -1;
8284 }
8285 return 1;
8286}
8287
8288/* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8289
8290void
8291resort_sorted_fields (void *obj,
9a03a746 8292 void * ARG_UNUSED (orig_obj),
4ee9c684 8293 gt_pointer_operator new_value,
8294 void *cookie)
860251be 8295{
9a03a746 8296 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
860251be 8297 resort_data.new_value = new_value;
8298 resort_data.cookie = cookie;
8299 qsort (&sf->elts[0], sf->len, sizeof (tree),
4ee9c684 8300 resort_field_decl_cmp);
860251be 8301}
8302
209c9752 8303/* Subroutine of c_parse_error.
8304 Return the result of concatenating LHS and RHS. RHS is really
8305 a string literal, its first character is indicated by RHS_START and
cfee01e3 8306 RHS_SIZE is its length (including the terminating NUL character).
209c9752 8307
8308 The caller is responsible for deleting the returned pointer. */
8309
8310static char *
8311catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
8312{
8313 const int lhs_size = strlen (lhs);
8314 char *result = XNEWVEC (char, lhs_size + rhs_size);
8315 strncpy (result, lhs, lhs_size);
8316 strncpy (result + lhs_size, rhs_start, rhs_size);
8317 return result;
8318}
8319
380c6697 8320/* Issue the error given by GMSGID, indicating that it occurred before
92b128ed 8321 TOKEN, which had the associated VALUE. */
8322
8323void
48e1416a 8324c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
ba99525e 8325 tree value, unsigned char token_flags)
92b128ed 8326{
209c9752 8327#define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8328
8329 char *message = NULL;
92b128ed 8330
ba99525e 8331 if (token_type == CPP_EOF)
380c6697 8332 message = catenate_messages (gmsgid, " at end of input");
48e1416a 8333 else if (token_type == CPP_CHAR
8334 || token_type == CPP_WCHAR
ba99525e 8335 || token_type == CPP_CHAR16
8336 || token_type == CPP_CHAR32)
92b128ed 8337 {
8338 unsigned int val = TREE_INT_CST_LOW (value);
924bbf02 8339 const char *prefix;
8340
ba99525e 8341 switch (token_type)
924bbf02 8342 {
8343 default:
8344 prefix = "";
8345 break;
8346 case CPP_WCHAR:
8347 prefix = "L";
8348 break;
8349 case CPP_CHAR16:
8350 prefix = "u";
8351 break;
8352 case CPP_CHAR32:
8353 prefix = "U";
8354 break;
8355 }
8356
92b128ed 8357 if (val <= UCHAR_MAX && ISGRAPH (val))
a0c938f0 8358 message = catenate_messages (gmsgid, " before %s'%c'");
92b128ed 8359 else
a0c938f0 8360 message = catenate_messages (gmsgid, " before %s'\\x%x'");
209c9752 8361
924bbf02 8362 error (message, prefix, val);
209c9752 8363 free (message);
8364 message = NULL;
92b128ed 8365 }
48e1416a 8366 else if (token_type == CPP_STRING
8367 || token_type == CPP_WSTRING
ba99525e 8368 || token_type == CPP_STRING16
538ba11a 8369 || token_type == CPP_STRING32
8370 || token_type == CPP_UTF8STRING)
380c6697 8371 message = catenate_messages (gmsgid, " before string constant");
ba99525e 8372 else if (token_type == CPP_NUMBER)
380c6697 8373 message = catenate_messages (gmsgid, " before numeric constant");
ba99525e 8374 else if (token_type == CPP_NAME)
209c9752 8375 {
380c6697 8376 message = catenate_messages (gmsgid, " before %qE");
782858b8 8377 error (message, value);
209c9752 8378 free (message);
8379 message = NULL;
8380 }
ba99525e 8381 else if (token_type == CPP_PRAGMA)
b75b98aa 8382 message = catenate_messages (gmsgid, " before %<#pragma%>");
ba99525e 8383 else if (token_type == CPP_PRAGMA_EOL)
b75b98aa 8384 message = catenate_messages (gmsgid, " before end of line");
07b8f133 8385 else if (token_type == CPP_DECLTYPE)
8386 message = catenate_messages (gmsgid, " before %<decltype%>");
ba99525e 8387 else if (token_type < N_TTYPES)
209c9752 8388 {
380c6697 8389 message = catenate_messages (gmsgid, " before %qs token");
ba99525e 8390 error (message, cpp_type2name (token_type, token_flags));
209c9752 8391 free (message);
8392 message = NULL;
8393 }
92b128ed 8394 else
380c6697 8395 error (gmsgid);
209c9752 8396
8397 if (message)
8398 {
8399 error (message);
8400 free (message);
8401 }
a0c938f0 8402#undef catenate_messages
92b128ed 8403}
8404
3a79f5da 8405/* Mapping for cpp message reasons to the options that enable them. */
8406
8407struct reason_option_codes_t
8408{
8409 const int reason; /* cpplib message reason. */
8410 const int option_code; /* gcc option that controls this message. */
8411};
8412
8413static const struct reason_option_codes_t option_codes[] = {
8414 {CPP_W_DEPRECATED, OPT_Wdeprecated},
67089c6b 8415 {CPP_W_COMMENTS, OPT_Wcomment},
3a79f5da 8416 {CPP_W_TRIGRAPHS, OPT_Wtrigraphs},
8417 {CPP_W_MULTICHAR, OPT_Wmultichar},
8418 {CPP_W_TRADITIONAL, OPT_Wtraditional},
8419 {CPP_W_LONG_LONG, OPT_Wlong_long},
8420 {CPP_W_ENDIF_LABELS, OPT_Wendif_labels},
8421 {CPP_W_VARIADIC_MACROS, OPT_Wvariadic_macros},
8422 {CPP_W_BUILTIN_MACRO_REDEFINED, OPT_Wbuiltin_macro_redefined},
8423 {CPP_W_UNDEF, OPT_Wundef},
8424 {CPP_W_UNUSED_MACROS, OPT_Wunused_macros},
8425 {CPP_W_CXX_OPERATOR_NAMES, OPT_Wc___compat},
8426 {CPP_W_NORMALIZE, OPT_Wnormalized_},
8427 {CPP_W_INVALID_PCH, OPT_Winvalid_pch},
8428 {CPP_W_WARNING_DIRECTIVE, OPT_Wcpp},
8429 {CPP_W_NONE, 0}
8430};
8431
8432/* Return the gcc option code associated with the reason for a cpp
8433 message, or 0 if none. */
8434
8435static int
8436c_option_controlling_cpp_error (int reason)
8437{
8438 const struct reason_option_codes_t *entry;
8439
8440 for (entry = option_codes; entry->reason != CPP_W_NONE; entry++)
8441 {
8442 if (entry->reason == reason)
8443 return entry->option_code;
8444 }
8445 return 0;
8446}
8447
7f5f3953 8448/* Callback from cpp_error for PFILE to print diagnostics from the
3a79f5da 8449 preprocessor. The diagnostic is of type LEVEL, with REASON set
8450 to the reason code if LEVEL is represents a warning, at location
7f5f3953 8451 LOCATION unless this is after lexing and the compiler's location
8452 should be used instead, with column number possibly overridden by
8453 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8454 the arguments. Returns true if a diagnostic was emitted, false
8455 otherwise. */
8456
8457bool
3a79f5da 8458c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason,
7f5f3953 8459 location_t location, unsigned int column_override,
8460 const char *msg, va_list *ap)
8461{
8462 diagnostic_info diagnostic;
8463 diagnostic_t dlevel;
5ae82d58 8464 bool save_warn_system_headers = global_dc->dc_warn_system_headers;
7f5f3953 8465 bool ret;
8466
8467 switch (level)
8468 {
8469 case CPP_DL_WARNING_SYSHDR:
8470 if (flag_no_output)
8471 return false;
5ae82d58 8472 global_dc->dc_warn_system_headers = 1;
7f5f3953 8473 /* Fall through. */
8474 case CPP_DL_WARNING:
8475 if (flag_no_output)
8476 return false;
8477 dlevel = DK_WARNING;
8478 break;
8479 case CPP_DL_PEDWARN:
8480 if (flag_no_output && !flag_pedantic_errors)
8481 return false;
8482 dlevel = DK_PEDWARN;
8483 break;
8484 case CPP_DL_ERROR:
8485 dlevel = DK_ERROR;
8486 break;
8487 case CPP_DL_ICE:
8488 dlevel = DK_ICE;
8489 break;
8490 case CPP_DL_NOTE:
8491 dlevel = DK_NOTE;
8492 break;
ff903809 8493 case CPP_DL_FATAL:
8494 dlevel = DK_FATAL;
8495 break;
7f5f3953 8496 default:
8497 gcc_unreachable ();
8498 }
8499 if (done_lexing)
8500 location = input_location;
8501 diagnostic_set_info_translated (&diagnostic, msg, ap,
8502 location, dlevel);
8503 if (column_override)
8504 diagnostic_override_column (&diagnostic, column_override);
3a79f5da 8505 diagnostic_override_option_index (&diagnostic,
8506 c_option_controlling_cpp_error (reason));
7f5f3953 8507 ret = report_diagnostic (&diagnostic);
8508 if (level == CPP_DL_WARNING_SYSHDR)
5ae82d58 8509 global_dc->dc_warn_system_headers = save_warn_system_headers;
7f5f3953 8510 return ret;
8511}
8512
624d37a6 8513/* Convert a character from the host to the target execution character
8514 set. cpplib handles this, mostly. */
8515
8516HOST_WIDE_INT
8517c_common_to_target_charset (HOST_WIDE_INT c)
8518{
8519 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8520 zero-extended under -fno-signed-char. cpplib insists that characters
8521 and character constants are always unsigned. Hence we must convert
8522 back and forth. */
8523 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
8524
8525 uc = cpp_host_to_exec_charset (parse_in, uc);
8526
8527 if (flag_signed_char)
8528 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
8529 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
8530 else
8531 return uc;
8532}
8533
af28855b 8534/* Build the result of __builtin_offsetof. EXPR is a nested sequence of
d897f7c2 8535 component references, with STOP_REF, or alternatively an INDIRECT_REF of
8536 NULL, at the bottom; much like the traditional rendering of offsetof as a
8537 macro. Returns the folded and properly cast result. */
af28855b 8538
8539static tree
d897f7c2 8540fold_offsetof_1 (tree expr, tree stop_ref)
af28855b 8541{
8542 enum tree_code code = PLUS_EXPR;
8543 tree base, off, t;
8544
d897f7c2 8545 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
8546 return size_zero_node;
8547
af28855b 8548 switch (TREE_CODE (expr))
8549 {
8550 case ERROR_MARK:
8551 return expr;
8552
6b11d2e3 8553 case VAR_DECL:
8554 error ("cannot apply %<offsetof%> to static data member %qD", expr);
8555 return error_mark_node;
8556
d897f7c2 8557 case CALL_EXPR:
cf1a89a3 8558 case TARGET_EXPR:
d897f7c2 8559 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
8560 return error_mark_node;
8561
d897f7c2 8562 case NOP_EXPR:
8563 case INDIRECT_REF:
64ed018c 8564 if (!integer_zerop (TREE_OPERAND (expr, 0)))
8565 {
8566 error ("cannot apply %<offsetof%> to a non constant address");
8567 return error_mark_node;
8568 }
8569 return size_zero_node;
d897f7c2 8570
af28855b 8571 case COMPONENT_REF:
d897f7c2 8572 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
af28855b 8573 if (base == error_mark_node)
8574 return base;
8575
8576 t = TREE_OPERAND (expr, 1);
8577 if (DECL_C_BIT_FIELD (t))
8578 {
8579 error ("attempt to take address of bit-field structure "
782858b8 8580 "member %qD", t);
af28855b 8581 return error_mark_node;
8582 }
389dd41b 8583 off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t),
8584 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t),
8585 1)
8586 / BITS_PER_UNIT));
af28855b 8587 break;
8588
8589 case ARRAY_REF:
d897f7c2 8590 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
af28855b 8591 if (base == error_mark_node)
8592 return base;
8593
8594 t = TREE_OPERAND (expr, 1);
8595 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
8596 {
8597 code = MINUS_EXPR;
389dd41b 8598 t = fold_build1_loc (input_location, NEGATE_EXPR, TREE_TYPE (t), t);
af28855b 8599 }
8600 t = convert (sizetype, t);
8601 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
64ed018c 8602
8603 /* Check if the offset goes beyond the upper bound of the array. */
e0559d69 8604 if (code == PLUS_EXPR && TREE_CODE (t) == INTEGER_CST)
8605 {
8606 tree upbound = array_ref_up_bound (expr);
8607 if (upbound != NULL_TREE
8608 && TREE_CODE (upbound) == INTEGER_CST
8609 && !tree_int_cst_equal (upbound,
8610 TYPE_MAX_VALUE (TREE_TYPE (upbound))))
8611 {
8612 upbound = size_binop (PLUS_EXPR, upbound,
8613 build_int_cst (TREE_TYPE (upbound), 1));
8614 if (tree_int_cst_lt (upbound, t))
8615 {
8616 tree v;
8617
8618 for (v = TREE_OPERAND (expr, 0);
8619 TREE_CODE (v) == COMPONENT_REF;
8620 v = TREE_OPERAND (v, 0))
8621 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0)))
8622 == RECORD_TYPE)
8623 {
1767a056 8624 tree fld_chain = DECL_CHAIN (TREE_OPERAND (v, 1));
8625 for (; fld_chain; fld_chain = DECL_CHAIN (fld_chain))
e0559d69 8626 if (TREE_CODE (fld_chain) == FIELD_DECL)
8627 break;
8628
8629 if (fld_chain)
8630 break;
8631 }
8632 /* Don't warn if the array might be considered a poor
8633 man's flexible array member with a very permissive
8634 definition thereof. */
8635 if (TREE_CODE (v) == ARRAY_REF
8636 || TREE_CODE (v) == COMPONENT_REF)
8637 warning (OPT_Warray_bounds,
8638 "index %E denotes an offset "
8639 "greater than size of %qT",
8640 t, TREE_TYPE (TREE_OPERAND (expr, 0)));
8641 }
8642 }
8643 }
af28855b 8644 break;
8645
ede90cc2 8646 case COMPOUND_EXPR:
8647 /* Handle static members of volatile structs. */
8648 t = TREE_OPERAND (expr, 1);
8649 gcc_assert (TREE_CODE (t) == VAR_DECL);
8650 return fold_offsetof_1 (t, stop_ref);
8651
af28855b 8652 default:
231bd014 8653 gcc_unreachable ();
af28855b 8654 }
8655
8656 return size_binop (code, base, off);
8657}
8658
8659tree
d897f7c2 8660fold_offsetof (tree expr, tree stop_ref)
af28855b 8661{
8662 /* Convert back from the internal sizetype to size_t. */
d897f7c2 8663 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
af28855b 8664}
8665
b9bdfa0b 8666/* Warn for A ?: C expressions (with B omitted) where A is a boolean
8667 expression, because B will always be true. */
8668
8669void
8670warn_for_omitted_condop (location_t location, tree cond)
8671{
8672 if (truth_value_p (TREE_CODE (cond)))
8673 warning_at (location, OPT_Wparentheses,
8674 "the omitted middle operand in ?: will always be %<true%>, "
8675 "suggest explicit middle operand");
8676}
8677
a1f90215 8678/* Give an error for storing into ARG, which is 'const'. USE indicates
8679 how ARG was being used. */
8680
8681void
8682readonly_error (tree arg, enum lvalue_use use)
8683{
8684 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
8685 || use == lv_asm);
8686 /* Using this macro rather than (for example) arrays of messages
8687 ensures that all the format strings are checked at compile
8688 time. */
8689#define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
8690 : (use == lv_increment ? (I) \
8691 : (use == lv_decrement ? (D) : (AS))))
8692 if (TREE_CODE (arg) == COMPONENT_REF)
8693 {
8694 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
8695 error (READONLY_MSG (G_("assignment of member "
8696 "%qD in read-only object"),
8697 G_("increment of member "
8698 "%qD in read-only object"),
8699 G_("decrement of member "
8700 "%qD in read-only object"),
8701 G_("member %qD in read-only object "
8702 "used as %<asm%> output")),
8703 TREE_OPERAND (arg, 1));
8704 else
8705 error (READONLY_MSG (G_("assignment of read-only member %qD"),
8706 G_("increment of read-only member %qD"),
8707 G_("decrement of read-only member %qD"),
8708 G_("read-only member %qD used as %<asm%> output")),
8709 TREE_OPERAND (arg, 1));
8710 }
8711 else if (TREE_CODE (arg) == VAR_DECL)
8712 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
8713 G_("increment of read-only variable %qD"),
8714 G_("decrement of read-only variable %qD"),
8715 G_("read-only variable %qD used as %<asm%> output")),
8716 arg);
8717 else if (TREE_CODE (arg) == PARM_DECL)
8718 error (READONLY_MSG (G_("assignment of read-only parameter %qD"),
8719 G_("increment of read-only parameter %qD"),
8720 G_("decrement of read-only parameter %qD"),
8721 G_("read-only parameter %qD use as %<asm%> output")),
8722 arg);
8723 else if (TREE_CODE (arg) == RESULT_DECL)
8724 {
8725 gcc_assert (c_dialect_cxx ());
8726 error (READONLY_MSG (G_("assignment of "
8727 "read-only named return value %qD"),
8728 G_("increment of "
8729 "read-only named return value %qD"),
8730 G_("decrement of "
8731 "read-only named return value %qD"),
8732 G_("read-only named return value %qD "
8733 "used as %<asm%>output")),
8734 arg);
8735 }
8736 else if (TREE_CODE (arg) == FUNCTION_DECL)
8737 error (READONLY_MSG (G_("assignment of function %qD"),
8738 G_("increment of function %qD"),
8739 G_("decrement of function %qD"),
8740 G_("function %qD used as %<asm%> output")),
8741 arg);
8742 else
8743 error (READONLY_MSG (G_("assignment of read-only location %qE"),
8744 G_("increment of read-only location %qE"),
8745 G_("decrement of read-only location %qE"),
8746 G_("read-only location %qE used as %<asm%> output")),
8747 arg);
8748}
8749
e35976b1 8750/* Print an error message for an invalid lvalue. USE says
fdd84b77 8751 how the lvalue is being used and so selects the error message. LOC
8752 is the location for the error. */
ab6bb714 8753
e35976b1 8754void
fdd84b77 8755lvalue_error (location_t loc, enum lvalue_use use)
ab6bb714 8756{
e35976b1 8757 switch (use)
ab6bb714 8758 {
e35976b1 8759 case lv_assign:
fdd84b77 8760 error_at (loc, "lvalue required as left operand of assignment");
e35976b1 8761 break;
8762 case lv_increment:
fdd84b77 8763 error_at (loc, "lvalue required as increment operand");
e35976b1 8764 break;
8765 case lv_decrement:
fdd84b77 8766 error_at (loc, "lvalue required as decrement operand");
e35976b1 8767 break;
8768 case lv_addressof:
fdd84b77 8769 error_at (loc, "lvalue required as unary %<&%> operand");
e35976b1 8770 break;
8771 case lv_asm:
fdd84b77 8772 error_at (loc, "lvalue required in asm statement");
e35976b1 8773 break;
8774 default:
8775 gcc_unreachable ();
ab6bb714 8776 }
ab6bb714 8777}
b1bbc8e5 8778
8779/* Print an error message for an invalid indirection of type TYPE.
8780 ERRSTRING is the name of the operator for the indirection. */
8781
8782void
8783invalid_indirection_error (location_t loc, tree type, ref_operator errstring)
8784{
8785 switch (errstring)
8786 {
8787 case RO_NULL:
8788 gcc_assert (c_dialect_cxx ());
8789 error_at (loc, "invalid type argument (have %qT)", type);
8790 break;
8791 case RO_ARRAY_INDEXING:
8792 error_at (loc,
8793 "invalid type argument of array indexing (have %qT)",
8794 type);
8795 break;
8796 case RO_UNARY_STAR:
8797 error_at (loc,
8798 "invalid type argument of unary %<*%> (have %qT)",
8799 type);
8800 break;
8801 case RO_ARROW:
8802 error_at (loc,
8803 "invalid type argument of %<->%> (have %qT)",
8804 type);
8805 break;
8806 case RO_IMPLICIT_CONVERSION:
8807 error_at (loc,
8808 "invalid type argument of implicit conversion (have %qT)",
8809 type);
8810 break;
8811 default:
8812 gcc_unreachable ();
8813 }
8814}
c271bdb2 8815\f
8816/* *PTYPE is an incomplete array. Complete it with a domain based on
8817 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8818 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8819 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8820
8821int
8822complete_array_type (tree *ptype, tree initial_value, bool do_default)
8823{
8824 tree maxindex, type, main_type, elt, unqual_elt;
8825 int failure = 0, quals;
6753bca0 8826 hashval_t hashcode = 0;
c271bdb2 8827
8828 maxindex = size_zero_node;
8829 if (initial_value)
8830 {
8831 if (TREE_CODE (initial_value) == STRING_CST)
8832 {
8833 int eltsize
8834 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8835 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
8836 }
8837 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8838 {
c75b4594 8839 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
c271bdb2 8840
c75b4594 8841 if (VEC_empty (constructor_elt, v))
c271bdb2 8842 {
8843 if (pedantic)
8844 failure = 3;
8845 maxindex = integer_minus_one_node;
8846 }
8847 else
8848 {
8849 tree curindex;
c75b4594 8850 unsigned HOST_WIDE_INT cnt;
8851 constructor_elt *ce;
cee43f7e 8852 bool fold_p = false;
c271bdb2 8853
c75b4594 8854 if (VEC_index (constructor_elt, v, 0)->index)
389dd41b 8855 maxindex = fold_convert_loc (input_location, sizetype,
8856 VEC_index (constructor_elt,
8857 v, 0)->index);
c271bdb2 8858 curindex = maxindex;
8859
c75b4594 8860 for (cnt = 1;
8861 VEC_iterate (constructor_elt, v, cnt, ce);
8862 cnt++)
c271bdb2 8863 {
cee43f7e 8864 bool curfold_p = false;
c75b4594 8865 if (ce->index)
cee43f7e 8866 curindex = ce->index, curfold_p = true;
c271bdb2 8867 else
cee43f7e 8868 {
8869 if (fold_p)
8870 curindex = fold_convert (sizetype, curindex);
389dd41b 8871 curindex = size_binop (PLUS_EXPR, curindex,
8872 size_one_node);
cee43f7e 8873 }
c271bdb2 8874 if (tree_int_cst_lt (maxindex, curindex))
cee43f7e 8875 maxindex = curindex, fold_p = curfold_p;
c271bdb2 8876 }
cee43f7e 8877 if (fold_p)
8878 maxindex = fold_convert (sizetype, maxindex);
c271bdb2 8879 }
8880 }
8881 else
8882 {
8883 /* Make an error message unless that happened already. */
8884 if (initial_value != error_mark_node)
8885 failure = 1;
8886 }
8887 }
8888 else
8889 {
8890 failure = 2;
8891 if (!do_default)
8892 return failure;
8893 }
8894
8895 type = *ptype;
8896 elt = TREE_TYPE (type);
8897 quals = TYPE_QUALS (strip_array_types (elt));
8898 if (quals == 0)
8899 unqual_elt = elt;
8900 else
6d5d708e 8901 unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals));
c271bdb2 8902
8903 /* Using build_distinct_type_copy and modifying things afterward instead
8904 of using build_array_type to create a new type preserves all of the
8905 TYPE_LANG_FLAG_? bits that the front end may have set. */
8906 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
8907 TREE_TYPE (main_type) = unqual_elt;
783bb57e 8908 TYPE_DOMAIN (main_type)
8909 = build_range_type (TREE_TYPE (maxindex),
8910 build_int_cst (TREE_TYPE (maxindex), 0), maxindex);
c271bdb2 8911 layout_type (main_type);
8912
6753bca0 8913 /* Make sure we have the canonical MAIN_TYPE. */
8914 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
48e1416a 8915 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
6753bca0 8916 hashcode);
8917 main_type = type_hash_canon (hashcode, main_type);
8918
796735dc 8919 /* Fix the canonical type. */
8920 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
8921 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
8922 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
8923 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
8924 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
8925 != TYPE_DOMAIN (main_type)))
48e1416a 8926 TYPE_CANONICAL (main_type)
796735dc 8927 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
8928 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
8929 else
8930 TYPE_CANONICAL (main_type) = main_type;
8931
c271bdb2 8932 if (quals == 0)
8933 type = main_type;
8934 else
8935 type = c_build_qualified_type (main_type, quals);
8936
4f5b8f2a 8937 if (COMPLETE_TYPE_P (type)
8938 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
8939 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type)))
8940 {
8941 error ("size of array is too large");
8942 /* If we proceed with the array type as it is, we'll eventually
8943 crash in tree_low_cst(). */
8944 type = error_mark_node;
8945 }
8946
c271bdb2 8947 *ptype = type;
8948 return failure;
8949}
ab6bb714 8950
93426222 8951/* Like c_mark_addressable but don't check register qualifier. */
8952void
8953c_common_mark_addressable_vec (tree t)
8954{
8955 while (handled_component_p (t))
8956 t = TREE_OPERAND (t, 0);
8957 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8958 return;
8959 TREE_ADDRESSABLE (t) = 1;
8960}
8961
8962
b6a5fc45 8963\f
8964/* Used to help initialize the builtin-types.def table. When a type of
8965 the correct size doesn't exist, use error_mark_node instead of NULL.
8966 The later results in segfaults even when a decl using the type doesn't
8967 get invoked. */
8968
8969tree
8970builtin_type_for_size (int size, bool unsignedp)
8971{
8972 tree type = lang_hooks.types.type_for_size (size, unsignedp);
8973 return type ? type : error_mark_node;
8974}
8975
8976/* A helper function for resolve_overloaded_builtin in resolving the
8977 overloaded __sync_ builtins. Returns a positive power of 2 if the
8978 first operand of PARAMS is a pointer to a supported data type.
8979 Returns 0 if an error is encountered. */
8980
8981static int
b9c74b4d 8982sync_resolve_size (tree function, VEC(tree,gc) *params)
b6a5fc45 8983{
8984 tree type;
8985 int size;
8986
b9c74b4d 8987 if (VEC_empty (tree, params))
b6a5fc45 8988 {
8989 error ("too few arguments to function %qE", function);
8990 return 0;
8991 }
8992
b9c74b4d 8993 type = TREE_TYPE (VEC_index (tree, params, 0));
b6a5fc45 8994 if (TREE_CODE (type) != POINTER_TYPE)
8995 goto incompatible;
8996
8997 type = TREE_TYPE (type);
8998 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
8999 goto incompatible;
9000
9001 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
27213ba3 9002 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
b6a5fc45 9003 return size;
9004
9005 incompatible:
9006 error ("incompatible type for argument %d of %qE", 1, function);
9007 return 0;
9008}
9009
a0c938f0 9010/* A helper function for resolve_overloaded_builtin. Adds casts to
b6a5fc45 9011 PARAMS to make arguments match up with those of FUNCTION. Drops
9012 the variadic arguments at the end. Returns false if some error
9013 was encountered; true on success. */
9014
9015static bool
b9c74b4d 9016sync_resolve_params (tree orig_function, tree function, VEC(tree, gc) *params)
b6a5fc45 9017{
d0af78c5 9018 function_args_iterator iter;
b6a5fc45 9019 tree ptype;
b9c74b4d 9020 unsigned int parmnum;
b6a5fc45 9021
d0af78c5 9022 function_args_iter_init (&iter, TREE_TYPE (function));
b6a5fc45 9023 /* We've declared the implementation functions to use "volatile void *"
9024 as the pointer parameter, so we shouldn't get any complaints from the
9025 call to check_function_arguments what ever type the user used. */
d0af78c5 9026 function_args_iter_next (&iter);
b9c74b4d 9027 ptype = TREE_TYPE (TREE_TYPE (VEC_index (tree, params, 0)));
b6a5fc45 9028
9029 /* For the rest of the values, we need to cast these to FTYPE, so that we
9030 don't get warnings for passing pointer types, etc. */
b9c74b4d 9031 parmnum = 0;
d0af78c5 9032 while (1)
b6a5fc45 9033 {
d0af78c5 9034 tree val, arg_type;
9035
9036 arg_type = function_args_iter_cond (&iter);
9037 /* XXX void_type_node belies the abstraction. */
9038 if (arg_type == void_type_node)
9039 break;
b6a5fc45 9040
b9c74b4d 9041 ++parmnum;
9042 if (VEC_length (tree, params) <= parmnum)
b6a5fc45 9043 {
9044 error ("too few arguments to function %qE", orig_function);
9045 return false;
9046 }
9047
9048 /* ??? Ideally for the first conversion we'd use convert_for_assignment
9049 so that we get warnings for anything that doesn't match the pointer
9050 type. This isn't portable across the C and C++ front ends atm. */
b9c74b4d 9051 val = VEC_index (tree, params, parmnum);
b6a5fc45 9052 val = convert (ptype, val);
d0af78c5 9053 val = convert (arg_type, val);
b9c74b4d 9054 VEC_replace (tree, params, parmnum, val);
b6a5fc45 9055
d0af78c5 9056 function_args_iter_next (&iter);
b6a5fc45 9057 }
9058
9059 /* The definition of these primitives is variadic, with the remaining
9060 being "an optional list of variables protected by the memory barrier".
9061 No clue what that's supposed to mean, precisely, but we consider all
9062 call-clobbered variables to be protected so we're safe. */
b9c74b4d 9063 VEC_truncate (tree, params, parmnum + 1);
b6a5fc45 9064
9065 return true;
9066}
9067
a0c938f0 9068/* A helper function for resolve_overloaded_builtin. Adds a cast to
b6a5fc45 9069 RESULT to make it match the type of the first pointer argument in
9070 PARAMS. */
9071
9072static tree
b9c74b4d 9073sync_resolve_return (tree first_param, tree result)
b6a5fc45 9074{
b9c74b4d 9075 tree ptype = TREE_TYPE (TREE_TYPE (first_param));
10080eac 9076 ptype = TYPE_MAIN_VARIANT (ptype);
b6a5fc45 9077 return convert (ptype, result);
9078}
9079
9080/* Some builtin functions are placeholders for other expressions. This
9081 function should be called immediately after parsing the call expression
9082 before surrounding code has committed to the type of the expression.
9083
e60a6f7b 9084 LOC is the location of the builtin call.
9085
b6a5fc45 9086 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
9087 PARAMS is the argument list for the call. The return value is non-null
9088 when expansion is complete, and null if normal processing should
9089 continue. */
9090
9091tree
e60a6f7b 9092resolve_overloaded_builtin (location_t loc, tree function, VEC(tree,gc) *params)
b6a5fc45 9093{
9094 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
65441f6f 9095 switch (DECL_BUILT_IN_CLASS (function))
9096 {
9097 case BUILT_IN_NORMAL:
9098 break;
9099 case BUILT_IN_MD:
9100 if (targetm.resolve_overloaded_builtin)
e60a6f7b 9101 return targetm.resolve_overloaded_builtin (loc, function, params);
65441f6f 9102 else
a0c938f0 9103 return NULL_TREE;
65441f6f 9104 default:
9105 return NULL_TREE;
9106 }
a0c938f0 9107
65441f6f 9108 /* Handle BUILT_IN_NORMAL here. */
b6a5fc45 9109 switch (orig_code)
9110 {
2797f13a 9111 case BUILT_IN_SYNC_FETCH_AND_ADD_N:
9112 case BUILT_IN_SYNC_FETCH_AND_SUB_N:
9113 case BUILT_IN_SYNC_FETCH_AND_OR_N:
9114 case BUILT_IN_SYNC_FETCH_AND_AND_N:
9115 case BUILT_IN_SYNC_FETCH_AND_XOR_N:
9116 case BUILT_IN_SYNC_FETCH_AND_NAND_N:
9117 case BUILT_IN_SYNC_ADD_AND_FETCH_N:
9118 case BUILT_IN_SYNC_SUB_AND_FETCH_N:
9119 case BUILT_IN_SYNC_OR_AND_FETCH_N:
9120 case BUILT_IN_SYNC_AND_AND_FETCH_N:
9121 case BUILT_IN_SYNC_XOR_AND_FETCH_N:
9122 case BUILT_IN_SYNC_NAND_AND_FETCH_N:
9123 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N:
9124 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N:
9125 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N:
9126 case BUILT_IN_SYNC_LOCK_RELEASE_N:
b6a5fc45 9127 {
9128 int n = sync_resolve_size (function, params);
b9c74b4d 9129 tree new_function, first_param, result;
b6a5fc45 9130
9131 if (n == 0)
9132 return error_mark_node;
9133
9134 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
9135 if (!sync_resolve_params (function, new_function, params))
9136 return error_mark_node;
9137
b9c74b4d 9138 first_param = VEC_index (tree, params, 0);
e60a6f7b 9139 result = build_function_call_vec (loc, new_function, params, NULL);
2797f13a 9140 if (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
9141 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N)
b9c74b4d 9142 result = sync_resolve_return (first_param, result);
b6a5fc45 9143
9144 return result;
9145 }
9146
9147 default:
65441f6f 9148 return NULL_TREE;
b6a5fc45 9149 }
9150}
9151
491255f5 9152/* Ignoring their sign, return true if two scalar types are the same. */
9153bool
9154same_scalar_type_ignoring_signedness (tree t1, tree t2)
9155{
9156 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
9157
9421ebb9 9158 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
9159 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
9160 || c2 == FIXED_POINT_TYPE));
491255f5 9161
9162 /* Equality works here because c_common_signed_type uses
9163 TYPE_MAIN_VARIANT. */
11773141 9164 return c_common_signed_type (t1)
9165 == c_common_signed_type (t2);
491255f5 9166}
9167
be7350e7 9168/* Check for missing format attributes on function pointers. LTYPE is
9169 the new type or left-hand side type. RTYPE is the old type or
9170 right-hand side type. Returns TRUE if LTYPE is missing the desired
9171 attribute. */
9172
9173bool
9174check_missing_format_attribute (tree ltype, tree rtype)
9175{
9176 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
9177 tree ra;
9178
9179 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
9180 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
9181 break;
9182 if (ra)
9183 {
9184 tree la;
9185 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
9186 if (is_attribute_p ("format", TREE_PURPOSE (la)))
9187 break;
9188 return !la;
9189 }
9190 else
9191 return false;
9192}
9193
2840aae4 9194/* Subscripting with type char is likely to lose on a machine where
9195 chars are signed. So warn on any machine, but optionally. Don't
9196 warn for unsigned char since that type is safe. Don't warn for
9197 signed char because anyone who uses that must have done so
9198 deliberately. Furthermore, we reduce the false positive load by
9199 warning only for non-constant value of type char. */
9200
9201void
9202warn_array_subscript_with_type_char (tree index)
9203{
9204 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
9205 && TREE_CODE (index) != INTEGER_CST)
9206 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
9207}
9208
e534436e 9209/* Implement -Wparentheses for the unexpected C precedence rules, to
9210 cover cases like x + y << z which readers are likely to
9211 misinterpret. We have seen an expression in which CODE is a binary
82012ffe 9212 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
9213 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
9214 CODE_RIGHT may be ERROR_MARK, which means that that side of the
9215 expression was not formed using a binary or unary operator, or it
9216 was enclosed in parentheses. */
e534436e 9217
9218void
82012ffe 9219warn_about_parentheses (enum tree_code code,
269f7979 9220 enum tree_code code_left, tree arg_left,
82012ffe 9221 enum tree_code code_right, tree arg_right)
e534436e 9222{
9223 if (!warn_parentheses)
9224 return;
9225
82012ffe 9226 /* This macro tests that the expression ARG with original tree code
9227 CODE appears to be a boolean expression. or the result of folding a
9228 boolean expression. */
9229#define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
9230 (truth_value_p (TREE_CODE (ARG)) \
9231 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
9232 /* Folding may create 0 or 1 integers from other expressions. */ \
9233 || ((CODE) != INTEGER_CST \
9234 && (integer_onep (ARG) || integer_zerop (ARG))))
9235
48e1416a 9236 switch (code)
e534436e 9237 {
82012ffe 9238 case LSHIFT_EXPR:
9239 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
e534436e 9240 warning (OPT_Wparentheses,
82012ffe 9241 "suggest parentheses around %<+%> inside %<<<%>");
9242 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
9243 warning (OPT_Wparentheses,
9244 "suggest parentheses around %<-%> inside %<<<%>");
9245 return;
e534436e 9246
82012ffe 9247 case RSHIFT_EXPR:
9248 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
e534436e 9249 warning (OPT_Wparentheses,
82012ffe 9250 "suggest parentheses around %<+%> inside %<>>%>");
9251 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
9252 warning (OPT_Wparentheses,
9253 "suggest parentheses around %<-%> inside %<>>%>");
9254 return;
e534436e 9255
82012ffe 9256 case TRUTH_ORIF_EXPR:
9257 if (code_left == TRUTH_ANDIF_EXPR || code_right == TRUTH_ANDIF_EXPR)
9258 warning (OPT_Wparentheses,
9259 "suggest parentheses around %<&&%> within %<||%>");
9260 return;
9261
9262 case BIT_IOR_EXPR:
e534436e 9263 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
9264 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
9265 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
9266 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
9267 warning (OPT_Wparentheses,
82012ffe 9268 "suggest parentheses around arithmetic in operand of %<|%>");
e534436e 9269 /* Check cases like x|y==z */
82012ffe 9270 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9271 || TREE_CODE_CLASS (code_right) == tcc_comparison)
e534436e 9272 warning (OPT_Wparentheses,
82012ffe 9273 "suggest parentheses around comparison in operand of %<|%>");
9274 /* Check cases like !x | y */
9275 else if (code_left == TRUTH_NOT_EXPR
9276 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
96bda40f 9277 warning (OPT_Wparentheses, "suggest parentheses around operand of "
82012ffe 9278 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
9279 return;
e534436e 9280
82012ffe 9281 case BIT_XOR_EXPR:
e534436e 9282 if (code_left == BIT_AND_EXPR
9283 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
9284 || code_right == BIT_AND_EXPR
9285 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
9286 warning (OPT_Wparentheses,
82012ffe 9287 "suggest parentheses around arithmetic in operand of %<^%>");
e534436e 9288 /* Check cases like x^y==z */
82012ffe 9289 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9290 || TREE_CODE_CLASS (code_right) == tcc_comparison)
e534436e 9291 warning (OPT_Wparentheses,
82012ffe 9292 "suggest parentheses around comparison in operand of %<^%>");
9293 return;
e534436e 9294
82012ffe 9295 case BIT_AND_EXPR:
9296 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
9297 warning (OPT_Wparentheses,
9298 "suggest parentheses around %<+%> in operand of %<&%>");
9299 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
e534436e 9300 warning (OPT_Wparentheses,
82012ffe 9301 "suggest parentheses around %<-%> in operand of %<&%>");
e534436e 9302 /* Check cases like x&y==z */
82012ffe 9303 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9304 || TREE_CODE_CLASS (code_right) == tcc_comparison)
e534436e 9305 warning (OPT_Wparentheses,
82012ffe 9306 "suggest parentheses around comparison in operand of %<&%>");
9307 /* Check cases like !x & y */
9308 else if (code_left == TRUTH_NOT_EXPR
9309 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
96bda40f 9310 warning (OPT_Wparentheses, "suggest parentheses around operand of "
82012ffe 9311 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
9312 return;
e534436e 9313
82012ffe 9314 case EQ_EXPR:
6ce0c450 9315 if (TREE_CODE_CLASS (code_left) == tcc_comparison
9316 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9317 warning (OPT_Wparentheses,
82012ffe 9318 "suggest parentheses around comparison in operand of %<==%>");
9319 return;
9320 case NE_EXPR:
9321 if (TREE_CODE_CLASS (code_left) == tcc_comparison
9322 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9323 warning (OPT_Wparentheses,
9324 "suggest parentheses around comparison in operand of %<!=%>");
9325 return;
9326
9327 default:
9328 if (TREE_CODE_CLASS (code) == tcc_comparison
9329 && ((TREE_CODE_CLASS (code_left) == tcc_comparison
269f7979 9330 && code_left != NE_EXPR && code_left != EQ_EXPR
9331 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
82012ffe 9332 || (TREE_CODE_CLASS (code_right) == tcc_comparison
269f7979 9333 && code_right != NE_EXPR && code_right != EQ_EXPR
9334 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))))
82012ffe 9335 warning (OPT_Wparentheses, "comparisons like %<X<=Y<=Z%> do not "
6ce0c450 9336 "have their mathematical meaning");
82012ffe 9337 return;
6ce0c450 9338 }
82012ffe 9339#undef NOT_A_BOOLEAN_EXPR_P
e534436e 9340}
9341
92fccaaa 9342/* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9343
9344void
9345warn_for_unused_label (tree label)
9346{
9347 if (!TREE_USED (label))
9348 {
9349 if (DECL_INITIAL (label))
9350 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
9351 else
9352 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
9353 }
9354}
2840aae4 9355
b6889cb0 9356/* Warn for division by zero according to the value of DIVISOR. LOC
9357 is the location of the division operator. */
f092582b 9358
9359void
b6889cb0 9360warn_for_div_by_zero (location_t loc, tree divisor)
f092582b 9361{
9421ebb9 9362 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9363 about division by zero. Do not issue a warning if DIVISOR has a
f092582b 9364 floating-point type, since we consider 0.0/0.0 a valid way of
9365 generating a NaN. */
48d94ede 9366 if (c_inhibit_evaluation_warnings == 0
9421ebb9 9367 && (integer_zerop (divisor) || fixed_zerop (divisor)))
b6889cb0 9368 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
f092582b 9369}
9370
13869a99 9371/* Subroutine of build_binary_op. Give warnings for comparisons
9372 between signed and unsigned quantities that may fail. Do the
9373 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9374 so that casts will be considered, but default promotions won't
8e70fb09 9375 be.
9376
9377 LOCATION is the location of the comparison operator.
13869a99 9378
9379 The arguments of this function map directly to local variables
9380 of build_binary_op. */
9381
48e1416a 9382void
8e70fb09 9383warn_for_sign_compare (location_t location,
48e1416a 9384 tree orig_op0, tree orig_op1,
9385 tree op0, tree op1,
13869a99 9386 tree result_type, enum tree_code resultcode)
9387{
9388 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
9389 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
9390 int unsignedp0, unsignedp1;
48e1416a 9391
13869a99 9392 /* In C++, check for comparison of different enum types. */
9393 if (c_dialect_cxx()
9394 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
9395 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
9396 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
895b662f 9397 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
13869a99 9398 {
8e70fb09 9399 warning_at (location,
9400 OPT_Wsign_compare, "comparison between types %qT and %qT",
9401 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
13869a99 9402 }
9403
9404 /* Do not warn if the comparison is being done in a signed type,
9405 since the signed type will only be chosen if it can represent
9406 all the values of the unsigned type. */
9407 if (!TYPE_UNSIGNED (result_type))
9408 /* OK */;
9409 /* Do not warn if both operands are unsigned. */
9410 else if (op0_signed == op1_signed)
9411 /* OK */;
9412 else
9413 {
895b662f 9414 tree sop, uop, base_type;
13869a99 9415 bool ovf;
895b662f 9416
13869a99 9417 if (op0_signed)
9418 sop = orig_op0, uop = orig_op1;
48e1416a 9419 else
13869a99 9420 sop = orig_op1, uop = orig_op0;
9421
48e1416a 9422 STRIP_TYPE_NOPS (sop);
13869a99 9423 STRIP_TYPE_NOPS (uop);
895b662f 9424 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
9425 ? TREE_TYPE (result_type) : result_type);
13869a99 9426
9427 /* Do not warn if the signed quantity is an unsuffixed integer
9428 literal (or some static constant expression involving such
9429 literals or a conditional expression involving such literals)
9430 and it is non-negative. */
9431 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
9432 /* OK */;
9433 /* Do not warn if the comparison is an equality operation, the
9434 unsigned quantity is an integral constant, and it would fit
9435 in the result if the result were signed. */
9436 else if (TREE_CODE (uop) == INTEGER_CST
9437 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
895b662f 9438 && int_fits_type_p (uop, c_common_signed_type (base_type)))
13869a99 9439 /* OK */;
9440 /* In C, do not warn if the unsigned quantity is an enumeration
9441 constant and its maximum value would fit in the result if the
9442 result were signed. */
9443 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
9444 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
9445 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
895b662f 9446 c_common_signed_type (base_type)))
13869a99 9447 /* OK */;
48e1416a 9448 else
8e70fb09 9449 warning_at (location,
48e1416a 9450 OPT_Wsign_compare,
8e70fb09 9451 "comparison between signed and unsigned integer expressions");
13869a99 9452 }
48e1416a 9453
13869a99 9454 /* Warn if two unsigned values are being compared in a size larger
9455 than their original size, and one (and only one) is the result of
9456 a `~' operator. This comparison will always fail.
48e1416a 9457
13869a99 9458 Also warn if one operand is a constant, and the constant does not
9459 have all bits set that are set in the ~ operand when it is
9460 extended. */
9461
7f506bca 9462 op0 = c_common_get_narrower (op0, &unsignedp0);
9463 op1 = c_common_get_narrower (op1, &unsignedp1);
48e1416a 9464
13869a99 9465 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
9466 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
9467 {
9468 if (TREE_CODE (op0) == BIT_NOT_EXPR)
7f506bca 9469 op0 = c_common_get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
13869a99 9470 if (TREE_CODE (op1) == BIT_NOT_EXPR)
7f506bca 9471 op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
13869a99 9472
9473 if (host_integerp (op0, 0) || host_integerp (op1, 0))
9474 {
9475 tree primop;
9476 HOST_WIDE_INT constant, mask;
9477 int unsignedp;
9478 unsigned int bits;
48e1416a 9479
13869a99 9480 if (host_integerp (op0, 0))
9481 {
9482 primop = op1;
9483 unsignedp = unsignedp1;
9484 constant = tree_low_cst (op0, 0);
9485 }
9486 else
9487 {
9488 primop = op0;
9489 unsignedp = unsignedp0;
9490 constant = tree_low_cst (op1, 0);
9491 }
48e1416a 9492
13869a99 9493 bits = TYPE_PRECISION (TREE_TYPE (primop));
9494 if (bits < TYPE_PRECISION (result_type)
9495 && bits < HOST_BITS_PER_LONG && unsignedp)
9496 {
9497 mask = (~ (HOST_WIDE_INT) 0) << bits;
9498 if ((mask & constant) != mask)
9499 {
9500 if (constant == 0)
48e1416a 9501 warning (OPT_Wsign_compare,
13869a99 9502 "promoted ~unsigned is always non-zero");
9503 else
48e1416a 9504 warning_at (location, OPT_Wsign_compare,
8e70fb09 9505 "comparison of promoted ~unsigned with constant");
13869a99 9506 }
9507 }
9508 }
9509 else if (unsignedp0 && unsignedp1
9510 && (TYPE_PRECISION (TREE_TYPE (op0))
9511 < TYPE_PRECISION (result_type))
9512 && (TYPE_PRECISION (TREE_TYPE (op1))
9513 < TYPE_PRECISION (result_type)))
8e70fb09 9514 warning_at (location, OPT_Wsign_compare,
13869a99 9515 "comparison of promoted ~unsigned with unsigned");
9516 }
9517}
9518
5ba33bf4 9519/* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
9520 type via c_common_type. If -Wdouble-promotion is in use, and the
9521 conditions for warning have been met, issue a warning. GMSGID is
9522 the warning message. It must have two %T specifiers for the type
9523 that was converted (generally "float") and the type to which it was
9524 converted (generally "double), respectively. LOC is the location
9525 to which the awrning should refer. */
9526
9527void
9528do_warn_double_promotion (tree result_type, tree type1, tree type2,
9529 const char *gmsgid, location_t loc)
9530{
9531 tree source_type;
9532
9533 if (!warn_double_promotion)
9534 return;
9535 /* If the conversion will not occur at run-time, there is no need to
9536 warn about it. */
9537 if (c_inhibit_evaluation_warnings)
9538 return;
9539 if (TYPE_MAIN_VARIANT (result_type) != double_type_node
9540 && TYPE_MAIN_VARIANT (result_type) != complex_double_type_node)
9541 return;
9542 if (TYPE_MAIN_VARIANT (type1) == float_type_node
9543 || TYPE_MAIN_VARIANT (type1) == complex_float_type_node)
9544 source_type = type1;
9545 else if (TYPE_MAIN_VARIANT (type2) == float_type_node
9546 || TYPE_MAIN_VARIANT (type2) == complex_float_type_node)
9547 source_type = type2;
9548 else
9549 return;
9550 warning_at (loc, OPT_Wdouble_promotion, gmsgid, source_type, result_type);
9551}
9552
41771881 9553/* Setup a TYPE_DECL node as a typedef representation.
9554
9555 X is a TYPE_DECL for a typedef statement. Create a brand new
9556 ..._TYPE node (which will be just a variant of the existing
9557 ..._TYPE node with identical properties) and then install X
9558 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9559
9560 The whole point here is to end up with a situation where each
9561 and every ..._TYPE node the compiler creates will be uniquely
9562 associated with AT MOST one node representing a typedef name.
9563 This way, even though the compiler substitutes corresponding
9564 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9565 early on, later parts of the compiler can always do the reverse
9566 translation and get back the corresponding typedef name. For
9567 example, given:
9568
9569 typedef struct S MY_TYPE;
9570 MY_TYPE object;
9571
9572 Later parts of the compiler might only know that `object' was of
9573 type `struct S' if it were not for code just below. With this
9574 code however, later parts of the compiler see something like:
9575
9576 struct S' == struct S
9577 typedef struct S' MY_TYPE;
9578 struct S' object;
9579
9580 And they can then deduce (from the node for type struct S') that
9581 the original object declaration was:
9582
9583 MY_TYPE object;
9584
9585 Being able to do this is important for proper support of protoize,
9586 and also for generating precise symbolic debugging information
9587 which takes full account of the programmer's (typedef) vocabulary.
9588
9589 Obviously, we don't want to generate a duplicate ..._TYPE node if
9590 the TYPE_DECL node that we are now processing really represents a
9591 standard built-in type. */
9592
9593void
9594set_underlying_type (tree x)
9595{
9596 if (x == error_mark_node)
9597 return;
9598 if (DECL_IS_BUILTIN (x))
9599 {
9600 if (TYPE_NAME (TREE_TYPE (x)) == 0)
9601 TYPE_NAME (TREE_TYPE (x)) = x;
9602 }
9603 else if (TREE_TYPE (x) != error_mark_node
9604 && DECL_ORIGINAL_TYPE (x) == NULL_TREE)
9605 {
9606 tree tt = TREE_TYPE (x);
9607 DECL_ORIGINAL_TYPE (x) = tt;
9608 tt = build_variant_type_copy (tt);
9609 TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
9610 TYPE_NAME (tt) = x;
9611 TREE_USED (tt) = TREE_USED (x);
9612 TREE_TYPE (x) = tt;
9613 }
9614}
9615
1a4c44c5 9616/* Record the types used by the current global variable declaration
9617 being parsed, so that we can decide later to emit their debug info.
9618 Those types are in types_used_by_cur_var_decl, and we are going to
9619 store them in the types_used_by_vars_hash hash table.
9620 DECL is the declaration of the global variable that has been parsed. */
9621
9622void
9623record_types_used_by_current_var_decl (tree decl)
9624{
9625 gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl));
9626
aef48c9a 9627 while (!VEC_empty (tree, types_used_by_cur_var_decl))
1a4c44c5 9628 {
aef48c9a 9629 tree type = VEC_pop (tree, types_used_by_cur_var_decl);
9630 types_used_by_var_decl_insert (type, decl);
1a4c44c5 9631 }
9632}
9633
f352a3fb 9634/* The C and C++ parsers both use vectors to hold function arguments.
9635 For efficiency, we keep a cache of unused vectors. This is the
9636 cache. */
9637
9638typedef VEC(tree,gc)* tree_gc_vec;
9639DEF_VEC_P(tree_gc_vec);
9640DEF_VEC_ALLOC_P(tree_gc_vec,gc);
9641static GTY((deletable)) VEC(tree_gc_vec,gc) *tree_vector_cache;
9642
9643/* Return a new vector from the cache. If the cache is empty,
9644 allocate a new vector. These vectors are GC'ed, so it is OK if the
9645 pointer is not released.. */
9646
9647VEC(tree,gc) *
9648make_tree_vector (void)
9649{
9650 if (!VEC_empty (tree_gc_vec, tree_vector_cache))
9651 return VEC_pop (tree_gc_vec, tree_vector_cache);
9652 else
9653 {
9654 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9655 that we always return a non-NULL value. The vector code uses
9656 4 when growing a NULL vector, so we do too. */
9657 return VEC_alloc (tree, gc, 4);
9658 }
9659}
9660
9661/* Release a vector of trees back to the cache. */
9662
9663void
9664release_tree_vector (VEC(tree,gc) *vec)
9665{
9666 if (vec != NULL)
9667 {
9668 VEC_truncate (tree, vec, 0);
9669 VEC_safe_push (tree_gc_vec, gc, tree_vector_cache, vec);
9670 }
9671}
9672
9673/* Get a new tree vector holding a single tree. */
9674
9675VEC(tree,gc) *
9676make_tree_vector_single (tree t)
9677{
9678 VEC(tree,gc) *ret = make_tree_vector ();
9679 VEC_quick_push (tree, ret, t);
9680 return ret;
9681}
9682
c66c81be 9683/* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
9684
9685VEC(tree,gc) *
9686make_tree_vector_from_list (tree list)
9687{
9688 VEC(tree,gc) *ret = make_tree_vector ();
9689 for (; list; list = TREE_CHAIN (list))
9690 VEC_safe_push (tree, gc, ret, TREE_VALUE (list));
9691 return ret;
9692}
9693
f352a3fb 9694/* Get a new tree vector which is a copy of an existing one. */
9695
9696VEC(tree,gc) *
9697make_tree_vector_copy (const VEC(tree,gc) *orig)
9698{
9699 VEC(tree,gc) *ret;
9700 unsigned int ix;
9701 tree t;
9702
9703 ret = make_tree_vector ();
9704 VEC_reserve (tree, gc, ret, VEC_length (tree, orig));
48148244 9705 FOR_EACH_VEC_ELT (tree, orig, ix, t)
f352a3fb 9706 VEC_quick_push (tree, ret, t);
9707 return ret;
9708}
9709
a9ffdd35 9710/* Return true if KEYWORD starts a type specifier. */
9711
9712bool
9713keyword_begins_type_specifier (enum rid keyword)
9714{
9715 switch (keyword)
9716 {
9717 case RID_INT:
9718 case RID_CHAR:
9719 case RID_FLOAT:
9720 case RID_DOUBLE:
9721 case RID_VOID:
9722 case RID_INT128:
9723 case RID_UNSIGNED:
9724 case RID_LONG:
9725 case RID_SHORT:
9726 case RID_SIGNED:
9727 case RID_DFLOAT32:
9728 case RID_DFLOAT64:
9729 case RID_DFLOAT128:
9730 case RID_FRACT:
9731 case RID_ACCUM:
9732 case RID_BOOL:
9733 case RID_WCHAR:
9734 case RID_CHAR16:
9735 case RID_CHAR32:
9736 case RID_SAT:
9737 case RID_COMPLEX:
9738 case RID_TYPEOF:
9739 case RID_STRUCT:
9740 case RID_CLASS:
9741 case RID_UNION:
9742 case RID_ENUM:
9743 return true;
9744 default:
9745 return false;
9746 }
9747}
9748
9749/* Return true if KEYWORD names a type qualifier. */
9750
9751bool
9752keyword_is_type_qualifier (enum rid keyword)
9753{
9754 switch (keyword)
9755 {
9756 case RID_CONST:
9757 case RID_VOLATILE:
9758 case RID_RESTRICT:
9759 return true;
9760 default:
9761 return false;
9762 }
9763}
9764
9765/* Return true if KEYWORD names a storage class specifier.
9766
9767 RID_TYPEDEF is not included in this list despite `typedef' being
9768 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
9769 such for syntactic convenience only. */
9770
9771bool
9772keyword_is_storage_class_specifier (enum rid keyword)
9773{
9774 switch (keyword)
9775 {
9776 case RID_STATIC:
9777 case RID_EXTERN:
9778 case RID_REGISTER:
9779 case RID_AUTO:
9780 case RID_MUTABLE:
9781 case RID_THREAD:
9782 return true;
9783 default:
9784 return false;
9785 }
9786}
9787
fad3f658 9788/* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
9789
9790static bool
9791keyword_is_function_specifier (enum rid keyword)
9792{
9793 switch (keyword)
9794 {
9795 case RID_INLINE:
9796 case RID_VIRTUAL:
9797 case RID_EXPLICIT:
9798 return true;
9799 default:
9800 return false;
9801 }
9802}
9803
9804/* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
9805 declaration-specifier (C99 6.7). */
9806
9807bool
9808keyword_is_decl_specifier (enum rid keyword)
9809{
9810 if (keyword_is_storage_class_specifier (keyword)
9811 || keyword_is_type_qualifier (keyword)
9812 || keyword_is_function_specifier (keyword))
9813 return true;
9814
9815 switch (keyword)
9816 {
9817 case RID_TYPEDEF:
9818 case RID_FRIEND:
9819 case RID_CONSTEXPR:
9820 return true;
9821 default:
9822 return false;
9823 }
9824}
9825
9b88d08d 9826/* Initialize language-specific-bits of tree_contains_struct. */
9827
9828void
9829c_common_init_ts (void)
9830{
9831 MARK_TS_TYPED (C_MAYBE_CONST_EXPR);
9832 MARK_TS_TYPED (EXCESS_PRECISION_EXPR);
9833}
9834
7bedc3a0 9835#include "gt-c-family-c-common.h"
Mirror of https://gcc.gnu.org/git/gcc.git