]> 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
Daily bump.
[thirdparty/gcc.git] / gcc / c-family / c-common.c
CommitLineData
b30f223b 1/* Subroutines shared by all languages that are variants of C.
818ab71a 2 Copyright (C) 1992-2016 Free Software Foundation, Inc.
b30f223b 3
1322177d 4This file is part of GCC.
b30f223b 5
1322177d
LB		 6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
9dcd6f09 8Software Foundation; either version 3, or (at your option) any later
1322177d 9version.
b30f223b 10
1322177d
LB		 11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14for more details.
b30f223b
RS		 15
16You should have received a copy of the GNU General Public License
9dcd6f09
NC		 17along with GCC; see the file COPYING3. If not see
18<http://www.gnu.org/licenses/>. */
b30f223b 19
40e23961
MC		 20#define GCC_C_COMMON_C
21
b30f223b 22#include "config.h"
670ee920 23#include "system.h"
4977bab6 24#include "coretypes.h"
2adfab87
AM		 25#include "target.h"
26#include "function.h"
2adfab87 27#include "tree.h"
b559c810 28#include "c-common.h"
2adfab87
AM		 29#include "gimple-expr.h"
30#include "tm_p.h"
31#include "stringpool.h"
32#include "cgraph.h"
33#include "diagnostic.h"
d9b2742a 34#include "intl.h"
d8a2d370
DN		 35#include "stor-layout.h"
36#include "calls.h"
d8a2d370
DN		 37#include "attribs.h"
38#include "varasm.h"
39#include "trans-mem.h"
61d3ce20 40#include "c-objc.h"
677f3fa8 41#include "common/common-target.h"
7afff7cf 42#include "langhooks.h"
d57a4b98 43#include "tree-inline.h"
5f1989e6 44#include "toplev.h"
6de9cd9a 45#include "tree-iterator.h"
d974312d 46#include "opts.h"
45b0be94 47#include "gimplify.h"
cb60f38d 48
81a75f0f 49cpp_reader *parse_in; /* Declared in c-pragma.h. */
c8724862 50
8fba1830
BRF		 51/* Mode used to build pointers (VOIDmode means ptr_mode). */
52
53machine_mode c_default_pointer_mode = VOIDmode;
54
7f4edbcb 55/* The following symbols are subsumed in the c_global_trees array, and
d125d268 56 listed here individually for documentation purposes.
7f4edbcb
BS		 57
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
59
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
63
64 tree short_unsigned_type_node;
65 tree long_unsigned_type_node;
66 tree long_long_unsigned_type_node;
67
de7df9eb
JM		 68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
7f4edbcb
BS		 71
72 tree ptrdiff_type_node;
73
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
76 tree wchar_type_node;
7f4edbcb 77
b6baa67d
KVH		 78 tree char16_type_node;
79 tree char32_type_node;
80
7f4edbcb
BS		 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
9a8ce21f
JG		 90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
93
7f4edbcb
BS		 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
7f4edbcb
BS		 122 Type `wchar_t[SOMENUMBER]' or something like it.
123 Used when a wide string literal is created.
124
125 tree wchar_array_type_node;
126
b6baa67d
KVH		 127 Type `char16_t[SOMENUMBER]' or something like it.
128 Used when a UTF-16 string literal is created.
129
130 tree char16_array_type_node;
131
132 Type `char32_t[SOMENUMBER]' or something like it.
133 Used when a UTF-32 string literal is created.
134
135 tree char32_array_type_node;
136
7f4edbcb
BS		 137 Type `int ()' -- used for implicit declaration of functions.
138
139 tree default_function_type;
140
7f4edbcb
BS		 141 A VOID_TYPE node, packaged in a TREE_LIST.
142
143 tree void_list_node;
144
684d9f3b 145 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
0ba8a114
NS		 146 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
147 VAR_DECLS, but C++ does.)
63ad61ed 148
0ba8a114 149 tree function_name_decl_node;
684d9f3b 150 tree pretty_function_name_decl_node;
0ba8a114
NS		 151 tree c99_function_name_decl_node;
152
153 Stack of nested function name VAR_DECLs.
35b1a6fa 154
0ba8a114 155 tree saved_function_name_decls;
63ad61ed 156
7f4edbcb
BS		 157*/
158
159tree c_global_trees[CTI_MAX];
17211ab5 160\f
4078b403
NB		 161/* Switches common to the C front ends. */
162
63973df3
NB		 163/* Nonzero means don't output line number information. */
164
165char flag_no_line_commands;
166
167/* Nonzero causes -E output not to be done, but directives such as
168 #define that have side effects are still obeyed. */
169
170char flag_no_output;
171
172/* Nonzero means dump macros in some fashion. */
173
174char flag_dump_macros;
175
176/* Nonzero means pass #include lines through to the output. */
177
178char flag_dump_includes;
179
c0d578e6
GK		 180/* Nonzero means process PCH files while preprocessing. */
181
182bool flag_pch_preprocess;
183
17211ab5
GK		 184/* The file name to which we should write a precompiled header, or
185 NULL if no header will be written in this compile. */
186
187const char *pch_file;
188
3df89291
NB		 189/* Nonzero if an ISO standard was selected. It rejects macros in the
190 user's namespace. */
191int flag_iso;
192
4078b403
NB		 193/* C/ObjC language option variables. */
194
195
4078b403
NB		 196/* Nonzero means allow type mismatches in conditional expressions;
197 just make their values `void'. */
198
199int flag_cond_mismatch;
200
201/* Nonzero means enable C89 Amendment 1 features. */
202
203int flag_isoc94;
204
48b0b196 205/* Nonzero means use the ISO C99 (or C11) dialect of C. */
4078b403
NB		 206
207int flag_isoc99;
208
48b0b196 209/* Nonzero means use the ISO C11 dialect of C. */
2778d766 210
48b0b196 211int flag_isoc11;
2778d766 212
6614fd40 213/* Nonzero means that we have builtin functions, and main is an int. */
4078b403
NB		 214
215int flag_hosted = 1;
216
4078b403
NB		 217
218/* ObjC language option variables. */
219
220
4078b403
NB		 221/* Tells the compiler that this is a special run. Do not perform any
222 compiling, instead we are to test some platform dependent features
223 and output a C header file with appropriate definitions. */
224
225int print_struct_values;
226
fa10beec 227/* Tells the compiler what is the constant string class for ObjC. */
4078b403
NB		 228
229const char *constant_string_class_name;
230
4078b403
NB		 231
232/* C++ language option variables. */
233
a75f1574
JM		 234/* The reference version of the ABI for -Wabi. */
235
236int warn_abi_version = -1;
4078b403 237
4078b403
NB		 238/* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
240
241int flag_use_repository;
242
129211bc 243/* The C++ dialect being used. Default set in c_common_post_options. */
966541e3 244
129211bc 245enum cxx_dialect cxx_dialect = cxx_unset;
966541e3 246
4afe7ad7 247/* Maximum template instantiation depth. This limit exists to limit the
3ff60975 248 time it takes to notice excessively recursive template instantiations.
4078b403 249
3ff60975
JM		 250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
253
254int max_tinst_depth = 900;
4078b403 255
f09f1de5
MM		 256/* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
258tree *ridpointers;
259
c2255bc4 260tree (*make_fname_decl) (location_t, tree, int);
2ce07e2d 261
7d882b83
ILT		 262/* Nonzero means don't warn about problems that occur when the code is
263 executed. */
264int c_inhibit_evaluation_warnings;
e78a3b42 265
5386338c
JM		 266/* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
272bool in_late_binary_op;
273
148e4216
JM		 274/* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
276bool done_lexing = false;
277
ec5c56db 278/* Information about how a function name is generated. */
0ba8a114
NS		 279struct fname_var_t
280{
8b60264b
KG		 281 tree *const decl; /* pointer to the VAR_DECL. */
282 const unsigned rid; /* RID number for the identifier. */
283 const int pretty; /* How pretty is it? */
0ba8a114
NS		 284};
285
ec5c56db 286/* The three ways of getting then name of the current function. */
0ba8a114
NS		 287
288const struct fname_var_t fname_vars[] =
289{
ec5c56db 290 /* C99 compliant __func__, must be first. */
0ba8a114 291 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
ec5c56db 292 /* GCC __FUNCTION__ compliant. */
0ba8a114 293 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
ec5c56db 294 /* GCC __PRETTY_FUNCTION__ compliant. */
0ba8a114
NS		 295 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
296 {NULL, 0, 0},
297};
298
c98cd5bf
JM		 299/* Global visibility options. */
300struct visibility_flags visibility_options;
301
62e4eb35 302static tree check_case_value (location_t, tree);
b155cfd9
MP		 303static bool check_case_bounds (location_t, tree, tree, tree *, tree *,
304 bool *);
4724b3de 305
35b1a6fa
AJ		 306static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
307static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
308static tree handle_common_attribute (tree *, tree, tree, int, bool *);
309static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
52bf96d2
JH		 310static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
311static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
e664c61c
KS		 312static tree handle_no_sanitize_address_attribute (tree *, tree, tree,
313 int, bool *);
77bc5132
JJ		 314static tree handle_no_address_safety_analysis_attribute (tree *, tree, tree,
315 int, bool *);
ce6923c5
MP		 316static tree handle_no_sanitize_undefined_attribute (tree *, tree, tree, int,
317 bool *);
5434dc07 318static tree handle_stack_protect_attribute (tree *, tree, tree, int, bool *);
35b1a6fa 319static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
86631ea3 320static tree handle_noclone_attribute (tree *, tree, tree, int, bool *);
185c9e56 321static tree handle_noicf_attribute (tree *, tree, tree, int, bool *);
46a4da10 322static tree handle_leaf_attribute (tree *, tree, tree, int, bool *);
35b1a6fa
AJ		 323static tree handle_always_inline_attribute (tree *, tree, tree, int,
324 bool *);
d752cfdb
JJ		 325static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
326static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
0691d1d4 327static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
d2af6a68 328static tree handle_error_attribute (tree *, tree, tree, int, bool *);
35b1a6fa 329static tree handle_used_attribute (tree *, tree, tree, int, bool *);
ce91e74c
JH		 330static tree handle_externally_visible_attribute (tree *, tree, tree, int,
331 bool *);
7861b648
AK		 332static tree handle_no_reorder_attribute (tree *, tree, tree, int,
333 bool *);
35b1a6fa
AJ		 334static tree handle_const_attribute (tree *, tree, tree, int, bool *);
335static tree handle_transparent_union_attribute (tree *, tree, tree,
336 int, bool *);
ee45a32d
EB		 337static tree handle_scalar_storage_order_attribute (tree *, tree, tree,
338 int, bool *);
35b1a6fa
AJ		 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 *) ;
4bb794e2 345static tree handle_noplt_attribute (tree *, tree, tree, int, bool *) ;
ba885ec5
NS		 346static tree handle_alias_ifunc_attribute (bool, tree *, tree, tree, bool *);
347static tree handle_ifunc_attribute (tree *, tree, tree, int, bool *);
35b1a6fa 348static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
a0203ca7 349static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
35b1a6fa
AJ		 350static tree handle_visibility_attribute (tree *, tree, tree, int,
351 bool *);
352static tree handle_tls_model_attribute (tree *, tree, tree, int,
353 bool *);
354static tree handle_no_instrument_function_attribute (tree *, tree,
355 tree, int, bool *);
356static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
6e9a3221 357static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
35b1a6fa
AJ		 358static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
359 bool *);
360static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
0a35513e
AH		 361static tree handle_tm_attribute (tree *, tree, tree, int, bool *);
362static tree handle_tm_wrap_attribute (tree *, tree, tree, int, bool *);
dcd6de6d 363static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
35b1a6fa
AJ		 364static tree handle_deprecated_attribute (tree *, tree, tree, int,
365 bool *);
366static tree handle_vector_size_attribute (tree *, tree, tree, int,
367 bool *);
368static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
369static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
370static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
72954a4f
JM		 371static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
372 bool *);
3d091dac 373static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
b5d32c25 374static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
51bc54a6 375static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
8fcbce72
JJ		 376static tree handle_alloc_align_attribute (tree *, tree, tree, int, bool *);
377static tree handle_assume_aligned_attribute (tree *, tree, tree, int, bool *);
5779e713 378static tree handle_target_attribute (tree *, tree, tree, int, bool *);
3b1661a9 379static tree handle_target_clones_attribute (tree *, tree, tree, int, bool *);
ab442df7 380static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
0a35513e 381static tree ignore_attribute (tree *, tree, tree, int, bool *);
7458026b 382static tree handle_no_split_stack_attribute (tree *, tree, tree, int, bool *);
0b7b376d 383static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
2a99e5e6 384static tree handle_warn_unused_attribute (tree *, tree, tree, int, bool *);
826cacfe 385static tree handle_returns_nonnull_attribute (tree *, tree, tree, int, bool *);
acf0174b
JJ		 386static tree handle_omp_declare_simd_attribute (tree *, tree, tree, int,
387 bool *);
fff77217 388static tree handle_simd_attribute (tree *, tree, tree, int, bool *);
acf0174b
JJ		 389static tree handle_omp_declare_target_attribute (tree *, tree, tree, int,
390 bool *);
976d5a22 391static tree handle_designated_init_attribute (tree *, tree, tree, int, bool *);
d5e254e1
IE		 392static tree handle_bnd_variable_size_attribute (tree *, tree, tree, int, bool *);
393static tree handle_bnd_legacy (tree *, tree, tree, int, bool *);
394static tree handle_bnd_instrument (tree *, tree, tree, int, bool *);
35b1a6fa 395
35b1a6fa
AJ		 396static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
397static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
398static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
d07605f5 399static int resort_field_decl_cmp (const void *, const void *);
b34c7881 400
eea1139b
ILT		 401/* Reserved words. The third field is a mask: keywords are disabled
402 if they match the mask.
403
404 Masks for languages:
405 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
406 C --std=c99: D_CXXONLY | D_OBJC
407 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
408 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
409 C++ --std=c0x: D_CONLY | D_OBJC
410 ObjC++ is like C++ except that D_OBJC is not set
411
412 If -fno-asm is used, D_ASM is added to the mask. If
413 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
414 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
1973201f 415 In C with -Wc++-compat, we warn if D_CXXWARN is set.
eea1139b 416
1973201f
NP		 417 Note the complication of the D_CXX_OBJC keywords. These are
418 reserved words such as 'class'. In C++, 'class' is a reserved
419 word. In Objective-C++ it is too. In Objective-C, it is a
420 reserved word too, but only if it follows an '@' sign.
421*/
eea1139b
ILT		 422const struct c_common_resword c_common_reswords[] =
423{
d19fa6b5
JM		 424 { "_Alignas", RID_ALIGNAS, D_CONLY },
425 { "_Alignof", RID_ALIGNOF, D_CONLY },
267bac10 426 { "_Atomic", RID_ATOMIC, D_CONLY },
eea1139b
ILT		 427 { "_Bool", RID_BOOL, D_CONLY },
428 { "_Complex", RID_COMPLEX, 0 },
939b37da
BI		 429 { "_Cilk_spawn", RID_CILK_SPAWN, 0 },
430 { "_Cilk_sync", RID_CILK_SYNC, 0 },
9a771876 431 { "_Cilk_for", RID_CILK_FOR, 0 },
fa5da7de 432 { "_Imaginary", RID_IMAGINARY, D_CONLY },
eea1139b
ILT		 433 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
434 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
435 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
436 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
437 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
438 { "_Sat", RID_SAT, D_CONLY | D_EXT },
32912286 439 { "_Static_assert", RID_STATIC_ASSERT, D_CONLY },
bbceee64 440 { "_Noreturn", RID_NORETURN, D_CONLY },
433cc7b0 441 { "_Generic", RID_GENERIC, D_CONLY },
582d9b50 442 { "_Thread_local", RID_THREAD, D_CONLY },
eea1139b
ILT		 443 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
444 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
445 { "__alignof", RID_ALIGNOF, 0 },
446 { "__alignof__", RID_ALIGNOF, 0 },
447 { "__asm", RID_ASM, 0 },
448 { "__asm__", RID_ASM, 0 },
449 { "__attribute", RID_ATTRIBUTE, 0 },
450 { "__attribute__", RID_ATTRIBUTE, 0 },
38b7bc7f 451 { "__auto_type", RID_AUTO_TYPE, D_CONLY },
4daba884 452 { "__bases", RID_BASES, D_CXXONLY },
74893f25
RH		 453 { "__builtin_call_with_static_chain",
454 RID_BUILTIN_CALL_WITH_STATIC_CHAIN, D_CONLY },
eea1139b 455 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
d4a83c10 456 { "__builtin_complex", RID_BUILTIN_COMPLEX, D_CONLY },
9e1a8dd1 457 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE, 0 },
eea1139b
ILT		 458 { "__builtin_offsetof", RID_OFFSETOF, 0 },
459 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
460 { "__builtin_va_arg", RID_VA_ARG, 0 },
461 { "__complex", RID_COMPLEX, 0 },
462 { "__complex__", RID_COMPLEX, 0 },
463 { "__const", RID_CONST, 0 },
464 { "__const__", RID_CONST, 0 },
465 { "__decltype", RID_DECLTYPE, D_CXXONLY },
4daba884 466 { "__direct_bases", RID_DIRECT_BASES, D_CXXONLY },
eea1139b
ILT		 467 { "__extension__", RID_EXTENSION, 0 },
468 { "__func__", RID_C99_FUNCTION_NAME, 0 },
469 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
470 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
471 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
472 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
473 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
474 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
475 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
476 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
3c0d13bf
PC		 477 { "__imag", RID_IMAGPART, 0 },
478 { "__imag__", RID_IMAGPART, 0 },
479 { "__inline", RID_INLINE, 0 },
480 { "__inline__", RID_INLINE, 0 },
eea1139b
ILT		 481 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
482 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
483 { "__is_class", RID_IS_CLASS, D_CXXONLY },
eea1139b
ILT		 484 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
485 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
b3908fcc 486 { "__is_final", RID_IS_FINAL, D_CXXONLY },
3c0d13bf 487 { "__is_literal_type", RID_IS_LITERAL_TYPE, D_CXXONLY },
eea1139b
ILT		 488 { "__is_pod", RID_IS_POD, D_CXXONLY },
489 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
971e17ff 490 { "__is_same_as", RID_IS_SAME_AS, D_CXXONLY },
c32097d8
JM		 491 { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY },
492 { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY },
dd5d5481
JM		 493 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE, D_CXXONLY },
494 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE, D_CXXONLY },
b752325e 495 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE, D_CXXONLY },
eea1139b 496 { "__is_union", RID_IS_UNION, D_CXXONLY },
eea1139b
ILT		 497 { "__label__", RID_LABEL, 0 },
498 { "__null", RID_NULL, 0 },
499 { "__real", RID_REALPART, 0 },
500 { "__real__", RID_REALPART, 0 },
501 { "__restrict", RID_RESTRICT, 0 },
502 { "__restrict__", RID_RESTRICT, 0 },
503 { "__signed", RID_SIGNED, 0 },
504 { "__signed__", RID_SIGNED, 0 },
505 { "__thread", RID_THREAD, 0 },
0a35513e
AH		 506 { "__transaction_atomic", RID_TRANSACTION_ATOMIC, 0 },
507 { "__transaction_relaxed", RID_TRANSACTION_RELAXED, 0 },
508 { "__transaction_cancel", RID_TRANSACTION_CANCEL, 0 },
eea1139b
ILT		 509 { "__typeof", RID_TYPEOF, 0 },
510 { "__typeof__", RID_TYPEOF, 0 },
3c0d13bf 511 { "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY },
eea1139b
ILT		 512 { "__volatile", RID_VOLATILE, 0 },
513 { "__volatile__", RID_VOLATILE, 0 },
36a85135
JM		 514 { "alignas", RID_ALIGNAS, D_CXXONLY | D_CXX11 | D_CXXWARN },
515 { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 516 { "asm", RID_ASM, D_ASM },
517 { "auto", RID_AUTO, 0 },
03c3034e 518 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 519 { "break", RID_BREAK, 0 },
520 { "case", RID_CASE, 0 },
2696a995 521 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
eea1139b 522 { "char", RID_CHAR, 0 },
36a85135
JM		 523 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX11 | D_CXXWARN },
524 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995 525 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
eea1139b 526 { "const", RID_CONST, 0 },
36a85135 527 { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 528 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
529 { "continue", RID_CONTINUE, 0 },
36a85135 530 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b 531 { "default", RID_DEFAULT, 0 },
2696a995 532 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 533 { "do", RID_DO, 0 },
534 { "double", RID_DOUBLE, 0 },
535 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
536 { "else", RID_ELSE, 0 },
537 { "enum", RID_ENUM, 0 },
2696a995
KG		 538 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
539 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
eea1139b 540 { "extern", RID_EXTERN, 0 },
2696a995 541 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 542 { "float", RID_FLOAT, 0 },
543 { "for", RID_FOR, 0 },
2696a995 544 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 545 { "goto", RID_GOTO, 0 },
546 { "if", RID_IF, 0 },
547 { "inline", RID_INLINE, D_EXT89 },
548 { "int", RID_INT, 0 },
549 { "long", RID_LONG, 0 },
550 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
2696a995
KG		 551 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
552 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
36a85135
JM		 553 { "noexcept", RID_NOEXCEPT, D_CXXONLY | D_CXX11 | D_CXXWARN },
554 { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995
KG		 555 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
556 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
557 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
558 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
eea1139b
ILT		 559 { "register", RID_REGISTER, 0 },
560 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
561 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
562 { "return", RID_RETURN, 0 },
563 { "short", RID_SHORT, 0 },
564 { "signed", RID_SIGNED, 0 },
565 { "sizeof", RID_SIZEOF, 0 },
566 { "static", RID_STATIC, 0 },
36a85135 567 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 568 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
569 { "struct", RID_STRUCT, 0 },
570 { "switch", RID_SWITCH, 0 },
2696a995
KG		 571 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
572 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
36a85135 573 { "thread_local", RID_THREAD, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995
KG		 574 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
575 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
576 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
eea1139b 577 { "typedef", RID_TYPEDEF, 0 },
2696a995
KG		 578 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
579 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 580 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
581 { "union", RID_UNION, 0 },
582 { "unsigned", RID_UNSIGNED, 0 },
2696a995
KG		 583 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
584 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 585 { "void", RID_VOID, 0 },
586 { "volatile", RID_VOLATILE, 0 },
587 { "wchar_t", RID_WCHAR, D_CXXONLY },
588 { "while", RID_WHILE, 0 },
971e17ff 589
b8fd7909
JM		 590 /* C++ transactional memory. */
591 { "synchronized", RID_SYNCHRONIZED, D_CXX_OBJC | D_TRANSMEM },
592 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT, D_CXXONLY | D_TRANSMEM },
593 { "atomic_cancel", RID_ATOMIC_CANCEL, D_CXXONLY | D_TRANSMEM },
594 { "atomic_commit", RID_TRANSACTION_ATOMIC, D_CXXONLY | D_TRANSMEM },
595
971e17ff
AS		 596 /* Concepts-related keywords */
597 { "concept", RID_CONCEPT, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
598 { "requires", RID_REQUIRES, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
599
eea1139b
ILT		 600 /* These Objective-C keywords are recognized only immediately after
601 an '@'. */
602 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
603 { "defs", RID_AT_DEFS, D_OBJC },
604 { "encode", RID_AT_ENCODE, D_OBJC },
605 { "end", RID_AT_END, D_OBJC },
606 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
607 { "interface", RID_AT_INTERFACE, D_OBJC },
608 { "protocol", RID_AT_PROTOCOL, D_OBJC },
609 { "selector", RID_AT_SELECTOR, D_OBJC },
610 { "finally", RID_AT_FINALLY, D_OBJC },
92902b1b
IS		 611 { "optional", RID_AT_OPTIONAL, D_OBJC },
612 { "required", RID_AT_REQUIRED, D_OBJC },
668ea4b1 613 { "property", RID_AT_PROPERTY, D_OBJC },
c37d8c30 614 { "package", RID_AT_PACKAGE, D_OBJC },
da57d1b9
NP		 615 { "synthesize", RID_AT_SYNTHESIZE, D_OBJC },
616 { "dynamic", RID_AT_DYNAMIC, D_OBJC },
eea1139b
ILT		 617 /* These are recognized only in protocol-qualifier context
618 (see above) */
619 { "bycopy", RID_BYCOPY, D_OBJC },
620 { "byref", RID_BYREF, D_OBJC },
621 { "in", RID_IN, D_OBJC },
622 { "inout", RID_INOUT, D_OBJC },
623 { "oneway", RID_ONEWAY, D_OBJC },
624 { "out", RID_OUT, D_OBJC },
668ea4b1 625 /* These are recognized inside a property attribute list */
200290f2
NP		 626 { "assign", RID_ASSIGN, D_OBJC },
627 { "copy", RID_COPY, D_OBJC },
668ea4b1 628 { "getter", RID_GETTER, D_OBJC },
200290f2
NP		 629 { "nonatomic", RID_NONATOMIC, D_OBJC },
630 { "readonly", RID_READONLY, D_OBJC },
631 { "readwrite", RID_READWRITE, D_OBJC },
632 { "retain", RID_RETAIN, D_OBJC },
668ea4b1 633 { "setter", RID_SETTER, D_OBJC },
eea1139b
ILT		 634};
635
636const unsigned int num_c_common_reswords =
637 sizeof c_common_reswords / sizeof (struct c_common_resword);
638
d5e254e1
IE		 639/* Table of machine-independent attributes common to all C-like languages.
640
641 All attributes referencing arguments should be additionally processed
642 in chkp_copy_function_type_adding_bounds for correct instrumentation
643 by Pointer Bounds Checker.
644 Current list of processed common attributes: nonnull. */
349ae713
NB		 645const struct attribute_spec c_common_attribute_table[] =
646{
62d784f7
KT		 647 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
648 affects_type_identity } */
349ae713 649 { "packed", 0, 0, false, false, false,
62d784f7 650 handle_packed_attribute , false},
349ae713 651 { "nocommon", 0, 0, true, false, false,
62d784f7 652 handle_nocommon_attribute, false},
349ae713 653 { "common", 0, 0, true, false, false,
62d784f7 654 handle_common_attribute, false },
349ae713
NB		 655 /* FIXME: logically, noreturn attributes should be listed as
656 "false, true, true" and apply to function types. But implementing this
657 would require all the places in the compiler that use TREE_THIS_VOLATILE
658 on a decl to identify non-returning functions to be located and fixed
659 to check the function type instead. */
660 { "noreturn", 0, 0, true, false, false,
62d784f7 661 handle_noreturn_attribute, false },
349ae713 662 { "volatile", 0, 0, true, false, false,
62d784f7 663 handle_noreturn_attribute, false },
5434dc07
MD		 664 { "stack_protect", 0, 0, true, false, false,
665 handle_stack_protect_attribute, false },
349ae713 666 { "noinline", 0, 0, true, false, false,
62d784f7 667 handle_noinline_attribute, false },
86631ea3 668 { "noclone", 0, 0, true, false, false,
62d784f7 669 handle_noclone_attribute, false },
185c9e56
ML		 670 { "no_icf", 0, 0, true, false, false,
671 handle_noicf_attribute, false },
46a4da10 672 { "leaf", 0, 0, true, false, false,
62d784f7 673 handle_leaf_attribute, false },
349ae713 674 { "always_inline", 0, 0, true, false, false,
62d784f7 675 handle_always_inline_attribute, false },
4eb7fd83 676 { "gnu_inline", 0, 0, true, false, false,
62d784f7 677 handle_gnu_inline_attribute, false },
d752cfdb 678 { "artificial", 0, 0, true, false, false,
62d784f7 679 handle_artificial_attribute, false },
0691d1d4 680 { "flatten", 0, 0, true, false, false,
62d784f7 681 handle_flatten_attribute, false },
349ae713 682 { "used", 0, 0, true, false, false,
62d784f7 683 handle_used_attribute, false },
349ae713 684 { "unused", 0, 0, false, false, false,
62d784f7 685 handle_unused_attribute, false },
ce91e74c 686 { "externally_visible", 0, 0, true, false, false,
62d784f7 687 handle_externally_visible_attribute, false },
7861b648
AK		 688 { "no_reorder", 0, 0, true, false, false,
689 handle_no_reorder_attribute, false },
349ae713
NB		 690 /* The same comments as for noreturn attributes apply to const ones. */
691 { "const", 0, 0, true, false, false,
62d784f7 692 handle_const_attribute, false },
ee45a32d
EB		 693 { "scalar_storage_order", 1, 1, false, false, false,
694 handle_scalar_storage_order_attribute, false },
349ae713 695 { "transparent_union", 0, 0, false, false, false,
62d784f7 696 handle_transparent_union_attribute, false },
fc8600f9 697 { "constructor", 0, 1, true, false, false,
62d784f7 698 handle_constructor_attribute, false },
fc8600f9 699 { "destructor", 0, 1, true, false, false,
62d784f7 700 handle_destructor_attribute, false },
349ae713 701 { "mode", 1, 1, false, true, false,
62d784f7 702 handle_mode_attribute, false },
349ae713 703 { "section", 1, 1, true, false, false,
62d784f7 704 handle_section_attribute, false },
349ae713 705 { "aligned", 0, 1, false, false, false,
62d784f7 706 handle_aligned_attribute, false },
349ae713 707 { "weak", 0, 0, true, false, false,
62d784f7 708 handle_weak_attribute, false },
4bb794e2
ST		 709 { "noplt", 0, 0, true, false, false,
710 handle_noplt_attribute, false },
ba885ec5 711 { "ifunc", 1, 1, true, false, false,
62d784f7 712 handle_ifunc_attribute, false },
349ae713 713 { "alias", 1, 1, true, false, false,
62d784f7 714 handle_alias_attribute, false },
a0203ca7 715 { "weakref", 0, 1, true, false, false,
62d784f7 716 handle_weakref_attribute, false },
349ae713 717 { "no_instrument_function", 0, 0, true, false, false,
62d784f7
KT		 718 handle_no_instrument_function_attribute,
719 false },
349ae713 720 { "malloc", 0, 0, true, false, false,
62d784f7 721 handle_malloc_attribute, false },
6e9a3221 722 { "returns_twice", 0, 0, true, false, false,
62d784f7 723 handle_returns_twice_attribute, false },
349ae713 724 { "no_stack_limit", 0, 0, true, false, false,
62d784f7 725 handle_no_limit_stack_attribute, false },
349ae713 726 { "pure", 0, 0, true, false, false,
62d784f7 727 handle_pure_attribute, false },
0a35513e
AH		 728 { "transaction_callable", 0, 0, false, true, false,
729 handle_tm_attribute, false },
730 { "transaction_unsafe", 0, 0, false, true, false,
b8fd7909 731 handle_tm_attribute, true },
0a35513e 732 { "transaction_safe", 0, 0, false, true, false,
b8fd7909
JM		 733 handle_tm_attribute, true },
734 { "transaction_safe_dynamic", 0, 0, true, false, false,
0a35513e
AH		 735 handle_tm_attribute, false },
736 { "transaction_may_cancel_outer", 0, 0, false, true, false,
737 handle_tm_attribute, false },
738 /* ??? These two attributes didn't make the transition from the
739 Intel language document to the multi-vendor language document. */
740 { "transaction_pure", 0, 0, false, true, false,
741 handle_tm_attribute, false },
742 { "transaction_wrap", 1, 1, true, false, false,
743 handle_tm_wrap_attribute, false },
dcd6de6d
ZD		 744 /* For internal use (marking of builtins) only. The name contains space
745 to prevent its usage in source code. */
746 { "no vops", 0, 0, true, false, false,
62d784f7 747 handle_novops_attribute, false },
9b86d6bb 748 { "deprecated", 0, 1, false, false, false,
62d784f7 749 handle_deprecated_attribute, false },
349ae713 750 { "vector_size", 1, 1, false, true, false,
62d784f7 751 handle_vector_size_attribute, false },
d7afec4b 752 { "visibility", 1, 1, false, false, false,
62d784f7 753 handle_visibility_attribute, false },
dce81a1a 754 { "tls_model", 1, 1, true, false, false,
62d784f7 755 handle_tls_model_attribute, false },
b34c7881 756 { "nonnull", 0, -1, false, true, true,
62d784f7 757 handle_nonnull_attribute, false },
39f2f3c8 758 { "nothrow", 0, 0, true, false, false,
62d784f7
KT		 759 handle_nothrow_attribute, false },
760 { "may_alias", 0, 0, false, true, false, NULL, false },
0bfa5f65 761 { "cleanup", 1, 1, true, false, false,
62d784f7 762 handle_cleanup_attribute, false },
72954a4f 763 { "warn_unused_result", 0, 0, false, true, true,
62d784f7 764 handle_warn_unused_result_attribute, false },
254986c7 765 { "sentinel", 0, 1, false, true, true,
62d784f7 766 handle_sentinel_attribute, false },
b5d32c25
KG		 767 /* For internal use (marking of builtins) only. The name contains space
768 to prevent its usage in source code. */
769 { "type generic", 0, 0, false, true, true,
62d784f7 770 handle_type_generic_attribute, false },
51bc54a6 771 { "alloc_size", 1, 2, false, true, true,
62d784f7 772 handle_alloc_size_attribute, false },
52bf96d2 773 { "cold", 0, 0, true, false, false,
62d784f7 774 handle_cold_attribute, false },
52bf96d2 775 { "hot", 0, 0, true, false, false,
62d784f7 776 handle_hot_attribute, false },
77bc5132
JJ		 777 { "no_address_safety_analysis",
778 0, 0, true, false, false,
779 handle_no_address_safety_analysis_attribute,
780 false },
e664c61c
KS		 781 { "no_sanitize_address", 0, 0, true, false, false,
782 handle_no_sanitize_address_attribute,
783 false },
de35aa66
MS		 784 { "no_sanitize_thread", 0, 0, true, false, false,
785 handle_no_sanitize_address_attribute,
786 false },
ce6923c5
MP		 787 { "no_sanitize_undefined", 0, 0, true, false, false,
788 handle_no_sanitize_undefined_attribute,
789 false },
d2af6a68 790 { "warning", 1, 1, true, false, false,
62d784f7 791 handle_error_attribute, false },
d2af6a68 792 { "error", 1, 1, true, false, false,
62d784f7 793 handle_error_attribute, false },
5779e713 794 { "target", 1, -1, true, false, false,
62d784f7 795 handle_target_attribute, false },
3b1661a9
ES		 796 { "target_clones", 1, -1, true, false, false,
797 handle_target_clones_attribute, false },
ab442df7 798 { "optimize", 1, -1, true, false, false,
62d784f7 799 handle_optimize_attribute, false },
0a35513e
AH		 800 /* For internal use only. The leading '*' both prevents its usage in
801 source code and signals that it may be overridden by machine tables. */
802 { "*tm regparm", 0, 0, false, true, true,
803 ignore_attribute, false },
7458026b 804 { "no_split_stack", 0, 0, true, false, false,
62d784f7 805 handle_no_split_stack_attribute, false },
0b7b376d
RG		 806 /* For internal use (marking of builtins and runtime functions) only.
807 The name contains space to prevent its usage in source code. */
808 { "fn spec", 1, 1, false, true, true,
62d784f7 809 handle_fnspec_attribute, false },
2a99e5e6
LL		 810 { "warn_unused", 0, 0, false, false, false,
811 handle_warn_unused_attribute, false },
826cacfe
MG		 812 { "returns_nonnull", 0, 0, false, true, true,
813 handle_returns_nonnull_attribute, false },
acf0174b
JJ		 814 { "omp declare simd", 0, -1, true, false, false,
815 handle_omp_declare_simd_attribute, false },
41958c28
BI		 816 { "cilk simd function", 0, -1, true, false, false,
817 handle_omp_declare_simd_attribute, false },
e7b69085 818 { "simd", 0, 1, true, false, false,
fff77217 819 handle_simd_attribute, false },
acf0174b
JJ		 820 { "omp declare target", 0, 0, true, false, false,
821 handle_omp_declare_target_attribute, false },
4a38b02b
IV		 822 { "omp declare target link", 0, 0, true, false, false,
823 handle_omp_declare_target_attribute, false },
8fcbce72
JJ		 824 { "alloc_align", 1, 1, false, true, true,
825 handle_alloc_align_attribute, false },
826 { "assume_aligned", 1, 2, false, true, true,
827 handle_assume_aligned_attribute, false },
976d5a22
TT		 828 { "designated_init", 0, 0, false, true, false,
829 handle_designated_init_attribute, false },
d5e254e1
IE		 830 { "bnd_variable_size", 0, 0, true, false, false,
831 handle_bnd_variable_size_attribute, false },
832 { "bnd_legacy", 0, 0, true, false, false,
833 handle_bnd_legacy, false },
834 { "bnd_instrument", 0, 0, true, false, false,
835 handle_bnd_instrument, false },
62d784f7 836 { NULL, 0, 0, false, false, false, NULL, false }
349ae713
NB		 837};
838
839/* Give the specifications for the format attributes, used by C and all
d5e254e1 840 descendants.
349ae713 841
d5e254e1
IE		 842 All attributes referencing arguments should be additionally processed
843 in chkp_copy_function_type_adding_bounds for correct instrumentation
844 by Pointer Bounds Checker.
845 Current list of processed format attributes: format, format_arg. */
349ae713
NB		 846const struct attribute_spec c_common_format_attribute_table[] =
847{
62d784f7
KT		 848 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
849 affects_type_identity } */
349ae713 850 { "format", 3, 3, false, true, true,
62d784f7 851 handle_format_attribute, false },
349ae713 852 { "format_arg", 1, 1, false, true, true,
62d784f7
KT		 853 handle_format_arg_attribute, false },
854 { NULL, 0, 0, false, false, false, NULL, false }
349ae713
NB		 855};
856
36c5e70a 857/* Return identifier for address space AS. */
3ef0694c 858
36c5e70a
BE		 859const char *
860c_addr_space_name (addr_space_t as)
861{
3ef0694c
UW		 862 int rid = RID_FIRST_ADDR_SPACE + as;
863 gcc_assert (ridpointers [rid]);
864 return IDENTIFIER_POINTER (ridpointers [rid]);
36c5e70a
BE		 865}
866
ec5c56db 867/* Push current bindings for the function name VAR_DECLS. */
7da551a2
RS		 868
869void
35b1a6fa 870start_fname_decls (void)
7da551a2 871{
0ba8a114
NS		 872 unsigned ix;
873 tree saved = NULL_TREE;
35b1a6fa 874
0ba8a114
NS		 875 for (ix = 0; fname_vars[ix].decl; ix++)
876 {
877 tree decl = *fname_vars[ix].decl;
7da551a2 878
0ba8a114
NS		 879 if (decl)
880 {
c62c040f
RG		 881 saved = tree_cons (decl, build_int_cst (integer_type_node, ix),
882 saved);
0ba8a114
NS		 883 *fname_vars[ix].decl = NULL_TREE;
884 }
885 }
886 if (saved || saved_function_name_decls)
887 /* Normally they'll have been NULL, so only push if we've got a
888 stack, or they are non-NULL. */
889 saved_function_name_decls = tree_cons (saved, NULL_TREE,
890 saved_function_name_decls);
891}
892
325c3691
RH		 893/* Finish up the current bindings, adding them into the current function's
894 statement tree. This must be done _before_ finish_stmt_tree is called.
895 If there is no current function, we must be at file scope and no statements
896 are involved. Pop the previous bindings. */
0ba8a114
NS		 897
898void
35b1a6fa 899finish_fname_decls (void)
0ba8a114
NS		 900{
901 unsigned ix;
325c3691 902 tree stmts = NULL_TREE;
0ba8a114
NS		 903 tree stack = saved_function_name_decls;
904
905 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
325c3691 906 append_to_statement_list (TREE_VALUE (stack), &stmts);
35b1a6fa 907
325c3691 908 if (stmts)
0ba8a114 909 {
325c3691 910 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
bfaba7a9 911
325c3691
RH		 912 if (TREE_CODE (*bodyp) == BIND_EXPR)
913 bodyp = &BIND_EXPR_BODY (*bodyp);
6cce57b0 914
86ad3aa9 915 append_to_statement_list_force (*bodyp, &stmts);
325c3691 916 *bodyp = stmts;
0ba8a114 917 }
35b1a6fa 918
0ba8a114
NS		 919 for (ix = 0; fname_vars[ix].decl; ix++)
920 *fname_vars[ix].decl = NULL_TREE;
35b1a6fa 921
0ba8a114 922 if (stack)
7da551a2 923 {
ec5c56db 924 /* We had saved values, restore them. */
0ba8a114
NS		 925 tree saved;
926
927 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
928 {
929 tree decl = TREE_PURPOSE (saved);
930 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
35b1a6fa 931
0ba8a114
NS		 932 *fname_vars[ix].decl = decl;
933 }
934 stack = TREE_CHAIN (stack);
7da551a2 935 }
0ba8a114
NS		 936 saved_function_name_decls = stack;
937}
938
6cce57b0 939/* Return the text name of the current function, suitably prettified
0d0bc036 940 by PRETTY_P. Return string must be freed by caller. */
0ba8a114
NS		 941
942const char *
35b1a6fa 943fname_as_string (int pretty_p)
0ba8a114 944{
47ab33b2 945 const char *name = "top level";
0d0bc036 946 char *namep;
46c2514e
TT		 947 int vrb = 2, len;
948 cpp_string cstr = { 0, 0 }, strname;
47ab33b2 949
3f75a254 950 if (!pretty_p)
47ab33b2
MA		 951 {
952 name = "";
953 vrb = 0;
954 }
955
956 if (current_function_decl)
ae2bcd98 957 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
47ab33b2 958
46c2514e 959 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
0d0bc036 960
46c2514e
TT		 961 namep = XNEWVEC (char, len);
962 snprintf (namep, len, "\"%s\"", name);
963 strname.text = (unsigned char *) namep;
964 strname.len = len - 1;
0d0bc036 965
b6baa67d 966 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
46c2514e
TT		 967 {
968 XDELETEVEC (namep);
969 return (const char *) cstr.text;
0d0bc036 970 }
0d0bc036
AH		 971
972 return namep;
0ba8a114
NS		 973}
974
0ba8a114
NS		 975/* Return the VAR_DECL for a const char array naming the current
976 function. If the VAR_DECL has not yet been created, create it
977 now. RID indicates how it should be formatted and IDENTIFIER_NODE
978 ID is its name (unfortunately C and C++ hold the RID values of
979 keywords in different places, so we can't derive RID from ID in
3ba09659
AH		 980 this language independent code. LOC is the location of the
981 function. */
0ba8a114
NS		 982
983tree
3ba09659 984fname_decl (location_t loc, unsigned int rid, tree id)
0ba8a114
NS		 985{
986 unsigned ix;
987 tree decl = NULL_TREE;
988
989 for (ix = 0; fname_vars[ix].decl; ix++)
990 if (fname_vars[ix].rid == rid)
991 break;
992
993 decl = *fname_vars[ix].decl;
994 if (!decl)
7da551a2 995 {
8d3e27d1
DJ		 996 /* If a tree is built here, it would normally have the lineno of
997 the current statement. Later this tree will be moved to the
998 beginning of the function and this line number will be wrong.
999 To avoid this problem set the lineno to 0 here; that prevents
4b7e68e7 1000 it from appearing in the RTL. */
325c3691 1001 tree stmts;
3c20847b 1002 location_t saved_location = input_location;
3c20847b 1003 input_location = UNKNOWN_LOCATION;
35b1a6fa 1004
325c3691 1005 stmts = push_stmt_list ();
c2255bc4 1006 decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty);
325c3691
RH		 1007 stmts = pop_stmt_list (stmts);
1008 if (!IS_EMPTY_STMT (stmts))
1009 saved_function_name_decls
1010 = tree_cons (decl, stmts, saved_function_name_decls);
0ba8a114 1011 *fname_vars[ix].decl = decl;
3c20847b 1012 input_location = saved_location;
7da551a2 1013 }
0ba8a114 1014 if (!ix && !current_function_decl)
3ba09659 1015 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
6cce57b0 1016
0ba8a114 1017 return decl;
7da551a2
RS		 1018}
1019
b84a3874 1020/* Given a STRING_CST, give it a suitable array-of-chars data type. */
b30f223b
RS		 1021
1022tree
35b1a6fa 1023fix_string_type (tree value)
b30f223b 1024{
b84a3874
RH		 1025 int length = TREE_STRING_LENGTH (value);
1026 int nchars;
c162c75e
MA		 1027 tree e_type, i_type, a_type;
1028
b57062ca 1029 /* Compute the number of elements, for the array type. */
b6baa67d
KVH		 1030 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
1031 {
1032 nchars = length;
1033 e_type = char_type_node;
1034 }
1035 else if (TREE_TYPE (value) == char16_array_type_node)
1036 {
1037 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
1038 e_type = char16_type_node;
1039 }
1040 else if (TREE_TYPE (value) == char32_array_type_node)
1041 {
1042 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
1043 e_type = char32_type_node;
1044 }
1045 else
1046 {
1047 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
1048 e_type = wchar_type_node;
1049 }
b30f223b 1050
89a42ac8
ZW		 1051 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1052 limit in C++98 Annex B is very large (65536) and is not normative,
1053 so we do not diagnose it (warn_overlength_strings is forced off
1054 in c_common_post_options). */
1055 if (warn_overlength_strings)
1056 {
1057 const int nchars_max = flag_isoc99 ? 4095 : 509;
1058 const int relevant_std = flag_isoc99 ? 99 : 90;
1059 if (nchars - 1 > nchars_max)
1060 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1061 separate the %d from the 'C'. 'ISO' should not be
1062 translated, but it may be moved after 'C%d' in languages
1063 where modifiers follow nouns. */
509c9d60 1064 pedwarn (input_location, OPT_Woverlength_strings,
fcf73884 1065 "string length %qd is greater than the length %qd "
89a42ac8
ZW		 1066 "ISO C%d compilers are required to support",
1067 nchars - 1, nchars_max, relevant_std);
1068 }
1326a48b 1069
cfb10bd3
GDR		 1070 /* Create the array type for the string constant. The ISO C++
1071 standard says that a string literal has type `const char[N]' or
1072 `const wchar_t[N]'. We use the same logic when invoked as a C
1073 front-end with -Wwrite-strings.
1074 ??? We should change the type of an expression depending on the
1075 state of a warning flag. We should just be warning -- see how
1076 this is handled in the C++ front-end for the deprecated implicit
1077 conversion from string literals to `char*' or `wchar_t*'.
c162c75e
MA		 1078
1079 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1080 array type being the unqualified version of that type.
1081 Therefore, if we are constructing an array of const char, we must
1082 construct the matching unqualified array type first. The C front
1083 end does not require this, but it does no harm, so we do it
1084 unconditionally. */
c62c040f 1085 i_type = build_index_type (size_int (nchars - 1));
c162c75e 1086 a_type = build_array_type (e_type, i_type);
cfb10bd3 1087 if (c_dialect_cxx() || warn_write_strings)
46df2823 1088 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
d9cf7c82 1089
c162c75e 1090 TREE_TYPE (value) = a_type;
ccd4c832 1091 TREE_CONSTANT (value) = 1;
3521b33c 1092 TREE_READONLY (value) = 1;
b30f223b
RS		 1093 TREE_STATIC (value) = 1;
1094 return value;
1095}
1096\f
f479b43d
JM		 1097/* Fold X for consideration by one of the warning functions when checking
1098 whether an expression has a constant value. */
1099
1100static tree
1101fold_for_warn (tree x)
1102{
1103 if (c_dialect_cxx ())
1104 return c_fully_fold (x, /*for_init*/false, /*maybe_constp*/NULL);
1105 else
1106 /* The C front-end has already folded X appropriately. */
1107 return x;
1108}
1109
d74154d5
RS		 1110/* Print a warning if a constant expression had overflow in folding.
1111 Invoke this function on every expression that the language
1112 requires to be a constant expression.
1113 Note the ANSI C standard says it is erroneous for a
1114 constant expression to overflow. */
96571883
BK		 1115
1116void
35b1a6fa 1117constant_expression_warning (tree value)
393eda6a 1118{
b8698a0f 1119 if (warn_overflow && pedantic
393eda6a
MLI		 1120 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1121 || TREE_CODE (value) == FIXED_CST
1122 || TREE_CODE (value) == VECTOR_CST
1123 || TREE_CODE (value) == COMPLEX_CST)
1124 && TREE_OVERFLOW (value))
509c9d60 1125 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
393eda6a
MLI		 1126}
1127
1128/* The same as above but print an unconditional error. */
1129void
1130constant_expression_error (tree value)
96571883 1131{
c05f751c 1132 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
ab22c1fa 1133 || TREE_CODE (value) == FIXED_CST
69ef87e2 1134 || TREE_CODE (value) == VECTOR_CST
c05f751c 1135 || TREE_CODE (value) == COMPLEX_CST)
393eda6a
MLI		 1136 && TREE_OVERFLOW (value))
1137 error ("overflow in constant expression");
d74154d5
RS		 1138}
1139
59c0753d
MLI		 1140/* Print a warning if an expression had overflow in folding and its
1141 operands hadn't.
1142
d74154d5
RS		 1143 Invoke this function on every expression that
1144 (1) appears in the source code, and
59c0753d 1145 (2) is a constant expression that overflowed, and
d74154d5 1146 (3) is not already checked by convert_and_check;
59c0753d
MLI		 1147 however, do not invoke this function on operands of explicit casts
1148 or when the expression is the result of an operator and any operand
1149 already overflowed. */
d74154d5
RS		 1150
1151void
c2255bc4 1152overflow_warning (location_t loc, tree value)
d74154d5 1153{
7d882b83
ILT		 1154 if (c_inhibit_evaluation_warnings != 0)
1155 return;
59c0753d
MLI		 1156
1157 switch (TREE_CODE (value))
69ef87e2 1158 {
59c0753d 1159 case INTEGER_CST:
c2255bc4 1160 warning_at (loc, OPT_Woverflow, "integer overflow in expression");
59c0753d 1161 break;
b8698a0f 1162
59c0753d 1163 case REAL_CST:
c2255bc4
AH		 1164 warning_at (loc, OPT_Woverflow,
1165 "floating point overflow in expression");
59c0753d 1166 break;
b8698a0f 1167
ab22c1fa 1168 case FIXED_CST:
c2255bc4 1169 warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
ab22c1fa
CF		 1170 break;
1171
59c0753d 1172 case VECTOR_CST:
c2255bc4 1173 warning_at (loc, OPT_Woverflow, "vector overflow in expression");
59c0753d 1174 break;
b8698a0f 1175
59c0753d
MLI		 1176 case COMPLEX_CST:
1177 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
c2255bc4
AH		 1178 warning_at (loc, OPT_Woverflow,
1179 "complex integer overflow in expression");
59c0753d 1180 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
c2255bc4
AH		 1181 warning_at (loc, OPT_Woverflow,
1182 "complex floating point overflow in expression");
59c0753d
MLI		 1183 break;
1184
1185 default:
1186 break;
69ef87e2 1187 }
d74154d5
RS		 1188}
1189
ca409efd
MLI		 1190/* Warn about uses of logical || / && operator in a context where it
1191 is likely that the bitwise equivalent was intended by the
1192 programmer. We have seen an expression in which CODE is a binary
a243fb4a
MLI		 1193 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1194 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
63a08740 1195void
a243fb4a 1196warn_logical_operator (location_t location, enum tree_code code, tree type,
b8698a0f 1197 enum tree_code code_left, tree op_left,
ca409efd 1198 enum tree_code ARG_UNUSED (code_right), tree op_right)
63a08740 1199{
a243fb4a
MLI		 1200 int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
1201 int in0_p, in1_p, in_p;
1202 tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
1203 bool strict_overflow_p = false;
1204
ca409efd
MLI		 1205 if (code != TRUTH_ANDIF_EXPR
1206 && code != TRUTH_AND_EXPR
1207 && code != TRUTH_ORIF_EXPR
1208 && code != TRUTH_OR_EXPR)
1209 return;
1210
b8787813
MP		 1211 /* We don't want to warn if either operand comes from a macro
1212 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1213 see PR61534. */
1214 if (from_macro_expansion_at (EXPR_LOCATION (op_left))
1215 || from_macro_expansion_at (EXPR_LOCATION (op_right)))
1216 return;
1217
ca409efd
MLI		 1218 /* Warn if &&/|| are being used in a context where it is
1219 likely that the bitwise equivalent was intended by the
1220 programmer. That is, an expression such as op && MASK
1221 where op should not be any boolean expression, nor a
1222 constant, and mask seems to be a non-boolean integer constant. */
f479b43d
JM		 1223 if (TREE_CODE (op_right) == CONST_DECL)
1224 /* An enumerator counts as a constant. */
1225 op_right = DECL_INITIAL (op_right);
ca409efd
MLI		 1226 if (!truth_value_p (code_left)
1227 && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
1228 && !CONSTANT_CLASS_P (op_left)
1229 && !TREE_NO_WARNING (op_left)
1230 && TREE_CODE (op_right) == INTEGER_CST
1231 && !integer_zerop (op_right)
1232 && !integer_onep (op_right))
63a08740 1233 {
a243fb4a 1234 if (or_op)
ca409efd
MLI		 1235 warning_at (location, OPT_Wlogical_op, "logical %<or%>"
1236 " applied to non-boolean constant");
1237 else
1238 warning_at (location, OPT_Wlogical_op, "logical %<and%>"
1239 " applied to non-boolean constant");
1240 TREE_NO_WARNING (op_left) = true;
a243fb4a
MLI		 1241 return;
1242 }
1243
1244 /* We do not warn for constants because they are typical of macro
1245 expansions that test for features. */
f479b43d
JM		 1246 if (CONSTANT_CLASS_P (fold_for_warn (op_left))
1247 || CONSTANT_CLASS_P (fold_for_warn (op_right)))
a243fb4a
MLI		 1248 return;
1249
1250 /* This warning only makes sense with logical operands. */
1251 if (!(truth_value_p (TREE_CODE (op_left))
1252 || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
1253 || !(truth_value_p (TREE_CODE (op_right))
1254 || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
1255 return;
1256
3c9aabbd
MG		 1257 /* The range computations only work with scalars. */
1258 if (VECTOR_TYPE_P (TREE_TYPE (op_left))
1259 || VECTOR_TYPE_P (TREE_TYPE (op_right)))
1260 return;
a243fb4a 1261
f2c4a785
MLI		 1262 /* We first test whether either side separately is trivially true
1263 (with OR) or trivially false (with AND). If so, do not warn.
1264 This is a common idiom for testing ranges of data types in
1265 portable code. */
1266 lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
1267 if (!lhs)
1268 return;
1269 if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
a243fb4a
MLI		 1270 lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
1271
f2c4a785
MLI		 1272 /* If this is an OR operation, invert both sides; now, the result
1273 should be always false to get a warning. */
1274 if (or_op)
1275 in0_p = !in0_p;
1276
1277 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in0_p, low0, high0);
1e537948 1278 if (tem && integer_zerop (tem))
f2c4a785
MLI		 1279 return;
1280
1281 rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
1282 if (!rhs)
1283 return;
1284 if (TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
a243fb4a 1285 rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
b8698a0f 1286
f2c4a785
MLI		 1287 /* If this is an OR operation, invert both sides; now, the result
1288 should be always false to get a warning. */
a243fb4a 1289 if (or_op)
f2c4a785 1290 in1_p = !in1_p;
b8698a0f 1291
f2c4a785 1292 tem = build_range_check (UNKNOWN_LOCATION, type, rhs, in1_p, low1, high1);
1e537948 1293 if (tem && integer_zerop (tem))
f2c4a785
MLI		 1294 return;
1295
1296 /* If both expressions have the same operand, if we can merge the
8c2b7f79 1297 ranges, ... */
f2c4a785 1298 if (operand_equal_p (lhs, rhs, 0)
a243fb4a 1299 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
8c2b7f79 1300 in1_p, low1, high1))
a243fb4a 1301 {
8c2b7f79
MP		 1302 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in_p, low, high);
1303 /* ... and if the range test is always false, then warn. */
1304 if (tem && integer_zerop (tem))
1305 {
1306 if (or_op)
1307 warning_at (location, OPT_Wlogical_op,
1308 "logical %<or%> of collectively exhaustive tests is "
1309 "always true");
1310 else
1311 warning_at (location, OPT_Wlogical_op,
1312 "logical %<and%> of mutually exclusive tests is "
1313 "always false");
1314 }
1315 /* Or warn if the operands have exactly the same range, e.g.
1316 A > 0 && A > 0. */
a68ae2e1
MP		 1317 else if (tree_int_cst_equal (low0, low1)
1318 && tree_int_cst_equal (high0, high1))
8c2b7f79
MP		 1319 {
1320 if (or_op)
1321 warning_at (location, OPT_Wlogical_op,
1322 "logical %<or%> of equal expressions");
1323 else
1324 warning_at (location, OPT_Wlogical_op,
1325 "logical %<and%> of equal expressions");
1326 }
63a08740
DM		 1327 }
1328}
1329
05b28fd6
MP		 1330/* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1331 with constant indices. */
1332
1333static tree
1334find_array_ref_with_const_idx_r (tree *expr_p, int *walk_subtrees, void *data)
1335{
1336 tree expr = *expr_p;
1337
1338 if ((TREE_CODE (expr) == ARRAY_REF
1339 || TREE_CODE (expr) == ARRAY_RANGE_REF)
1340 && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)
1341 {
1342 *(bool *) data = true;
1343 *walk_subtrees = 0;
1344 }
1345
1346 return NULL_TREE;
1347}
1348
1349/* Warn if a self-comparison always evaluates to true or false. LOC
1350 is the location of the comparison with code CODE, LHS and RHS are
1351 operands of the comparison. */
1352
1353void
1354warn_tautological_cmp (location_t loc, enum tree_code code, tree lhs, tree rhs)
1355{
1356 if (TREE_CODE_CLASS (code) != tcc_comparison)
1357 return;
1358
f2afe6dd
MP		 1359 /* Don't warn for various macro expansions. */
1360 if (from_macro_expansion_at (loc)
1361 || from_macro_expansion_at (EXPR_LOCATION (lhs))
1362 || from_macro_expansion_at (EXPR_LOCATION (rhs)))
1363 return;
1364
05b28fd6
MP		 1365 /* We do not warn for constants because they are typical of macro
1366 expansions that test for features, sizeof, and similar. */
f479b43d
JM		 1367 if (CONSTANT_CLASS_P (fold_for_warn (lhs))
1368 || CONSTANT_CLASS_P (fold_for_warn (rhs)))
05b28fd6
MP		 1369 return;
1370
1371 /* Don't warn for e.g.
1372 HOST_WIDE_INT n;
1373 ...
1374 if (n == (long) n) ...
1375 */
1376 if ((CONVERT_EXPR_P (lhs) || TREE_CODE (lhs) == NON_LVALUE_EXPR)
1377 || (CONVERT_EXPR_P (rhs) || TREE_CODE (rhs) == NON_LVALUE_EXPR))
1378 return;
1379
173864e8
MP		 1380 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1381 It could be a NaN, and NaN never compares equal to anything, even
1382 itself. */
1383 if (FLOAT_TYPE_P (TREE_TYPE (lhs)) || FLOAT_TYPE_P (TREE_TYPE (rhs)))
1384 return;
1385
05b28fd6
MP		 1386 if (operand_equal_p (lhs, rhs, 0))
1387 {
1388 /* Don't warn about array references with constant indices;
1389 these are likely to come from a macro. */
1390 bool found = false;
1391 walk_tree_without_duplicates (&lhs, find_array_ref_with_const_idx_r,
1392 &found);
1393 if (found)
1394 return;
1395 const bool always_true = (code == EQ_EXPR || code == LE_EXPR
1396 || code == GE_EXPR || code == UNLE_EXPR
1397 || code == UNGE_EXPR || code == UNEQ_EXPR);
1398 if (always_true)
1399 warning_at (loc, OPT_Wtautological_compare,
1400 "self-comparison always evaluates to true");
1401 else
1402 warning_at (loc, OPT_Wtautological_compare,
1403 "self-comparison always evaluates to false");
1404 }
1405}
1406
742938c9
MP		 1407/* Warn about logical not used on the left hand side operand of a comparison.
1408 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
59ea0364 1409 Do not warn if RHS is of a boolean type. */
742938c9
MP		 1410
1411void
1412warn_logical_not_parentheses (location_t location, enum tree_code code,
59ea0364 1413 tree rhs)
742938c9 1414{
59ea0364
MP		 1415 if (TREE_CODE_CLASS (code) != tcc_comparison
1416 || TREE_TYPE (rhs) == NULL_TREE
1417 || TREE_CODE (TREE_TYPE (rhs)) == BOOLEAN_TYPE)
742938c9
MP		 1418 return;
1419
7ccb1a11
JJ		 1420 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1421 !(x == 0) or !(y != 0). */
1422 if ((code == EQ_EXPR || code == NE_EXPR)
1423 && integer_zerop (rhs))
1424 return;
1425
742938c9
MP		 1426 warning_at (location, OPT_Wlogical_not_parentheses,
1427 "logical not is only applied to the left hand side of "
1428 "comparison");
1429}
63a08740 1430
fd4116f4
MLI		 1431/* Warn if EXP contains any computations whose results are not used.
1432 Return true if a warning is printed; false otherwise. LOCUS is the
1433 (potential) location of the expression. */
1434
1435bool
1436warn_if_unused_value (const_tree exp, location_t locus)
1437{
1438 restart:
1439 if (TREE_USED (exp) || TREE_NO_WARNING (exp))
1440 return false;
1441
1442 /* Don't warn about void constructs. This includes casting to void,
1443 void function calls, and statement expressions with a final cast
1444 to void. */
1445 if (VOID_TYPE_P (TREE_TYPE (exp)))
1446 return false;
1447
1448 if (EXPR_HAS_LOCATION (exp))
1449 locus = EXPR_LOCATION (exp);
1450
1451 switch (TREE_CODE (exp))
1452 {
1453 case PREINCREMENT_EXPR:
1454 case POSTINCREMENT_EXPR:
1455 case PREDECREMENT_EXPR:
1456 case POSTDECREMENT_EXPR:
1457 case MODIFY_EXPR:
1458 case INIT_EXPR:
1459 case TARGET_EXPR:
1460 case CALL_EXPR:
1461 case TRY_CATCH_EXPR:
1462 case WITH_CLEANUP_EXPR:
1463 case EXIT_EXPR:
1464 case VA_ARG_EXPR:
1465 return false;
1466
1467 case BIND_EXPR:
1468 /* For a binding, warn if no side effect within it. */
1469 exp = BIND_EXPR_BODY (exp);
1470 goto restart;
1471
1472 case SAVE_EXPR:
1473 case NON_LVALUE_EXPR:
007a787d 1474 case NOP_EXPR:
fd4116f4
MLI		 1475 exp = TREE_OPERAND (exp, 0);
1476 goto restart;
1477
1478 case TRUTH_ORIF_EXPR:
1479 case TRUTH_ANDIF_EXPR:
1480 /* In && or ||, warn if 2nd operand has no side effect. */
1481 exp = TREE_OPERAND (exp, 1);
1482 goto restart;
1483
1484 case COMPOUND_EXPR:
1485 if (warn_if_unused_value (TREE_OPERAND (exp, 0), locus))
1486 return true;
1487 /* Let people do `(foo (), 0)' without a warning. */
1488 if (TREE_CONSTANT (TREE_OPERAND (exp, 1)))
1489 return false;
1490 exp = TREE_OPERAND (exp, 1);
1491 goto restart;
1492
1493 case COND_EXPR:
1494 /* If this is an expression with side effects, don't warn; this
1495 case commonly appears in macro expansions. */
1496 if (TREE_SIDE_EFFECTS (exp))
1497 return false;
1498 goto warn;
1499
1500 case INDIRECT_REF:
1501 /* Don't warn about automatic dereferencing of references, since
1502 the user cannot control it. */
1503 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
1504 {
1505 exp = TREE_OPERAND (exp, 0);
1506 goto restart;
1507 }
1508 /* Fall through. */
1509
1510 default:
1511 /* Referencing a volatile value is a side effect, so don't warn. */
1512 if ((DECL_P (exp) || REFERENCE_CLASS_P (exp))
1513 && TREE_THIS_VOLATILE (exp))
1514 return false;
1515
1516 /* If this is an expression which has no operands, there is no value
1517 to be unused. There are no such language-independent codes,
1518 but front ends may define such. */
1519 if (EXPRESSION_CLASS_P (exp) && TREE_OPERAND_LENGTH (exp) == 0)
1520 return false;
1521
1522 warn:
1523 return warning_at (locus, OPT_Wunused_value, "value computed is not used");
1524 }
1525}
1526
1527
de9c56a4
RG		 1528/* Print a warning about casts that might indicate violation
1529 of strict aliasing rules if -Wstrict-aliasing is used and
3f0a2a47
DM		 1530 strict aliasing mode is in effect. OTYPE is the original
1531 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
de9c56a4 1532
79bedddc 1533bool
3f0a2a47 1534strict_aliasing_warning (tree otype, tree type, tree expr)
de9c56a4 1535{
255d3827
RG		 1536 /* Strip pointer conversion chains and get to the correct original type. */
1537 STRIP_NOPS (expr);
1538 otype = TREE_TYPE (expr);
1539
ac7ee6ad
RG		 1540 if (!(flag_strict_aliasing
1541 && POINTER_TYPE_P (type)
1542 && POINTER_TYPE_P (otype)
1543 && !VOID_TYPE_P (TREE_TYPE (type)))
1544 /* If the type we are casting to is a ref-all pointer
1545 dereferencing it is always valid. */
1546 || TYPE_REF_CAN_ALIAS_ALL (type))
79bedddc
SR		 1547 return false;
1548
1549 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
de9c56a4 1550 && (DECL_P (TREE_OPERAND (expr, 0))
79bedddc 1551 || handled_component_p (TREE_OPERAND (expr, 0))))
de9c56a4
RG		 1552 {
1553 /* Casting the address of an object to non void pointer. Warn
1554 if the cast breaks type based aliasing. */
79bedddc
SR		 1555 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1556 {
1557 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1558 "might break strict-aliasing rules");
1559 return true;
1560 }
de9c56a4
RG		 1561 else
1562 {
b8698a0f 1563 /* warn_strict_aliasing >= 3. This includes the default (3).
79bedddc 1564 Only warn if the cast is dereferenced immediately. */
4862826d 1565 alias_set_type set1 =
79bedddc 1566 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
4862826d 1567 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
de9c56a4 1568
4653cae5 1569 if (set1 != set2 && set2 != 0
c06d25bb
RB		 1570 && (set1 == 0
1571 || (!alias_set_subset_of (set2, set1)
1572 && !alias_sets_conflict_p (set1, set2))))
79bedddc
SR		 1573 {
1574 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1575 "pointer will break strict-aliasing rules");
1576 return true;
1577 }
1578 else if (warn_strict_aliasing == 2
836f7794 1579 && !alias_sets_must_conflict_p (set1, set2))
79bedddc
SR		 1580 {
1581 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1582 "pointer might break strict-aliasing rules");
1583 return true;
1584 }
de9c56a4
RG		 1585 }
1586 }
79bedddc
SR		 1587 else
1588 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
1589 {
1590 /* At this level, warn for any conversions, even if an address is
1591 not taken in the same statement. This will likely produce many
1592 false positives, but could be useful to pinpoint problems that
1593 are not revealed at higher levels. */
4862826d
ILT		 1594 alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
1595 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1596 if (!COMPLETE_TYPE_P (type)
836f7794 1597 || !alias_sets_must_conflict_p (set1, set2))
79bedddc
SR		 1598 {
1599 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1600 "pointer might break strict-aliasing rules");
1601 return true;
1602 }
1603 }
1604
1605 return false;
de9c56a4
RG		 1606}
1607
1a4049e7
JJ		 1608/* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1609 sizeof as last operand of certain builtins. */
1610
1611void
3a785c97 1612sizeof_pointer_memaccess_warning (location_t *sizeof_arg_loc, tree callee,
9771b263 1613 vec<tree, va_gc> *params, tree *sizeof_arg,
1a4049e7
JJ		 1614 bool (*comp_types) (tree, tree))
1615{
1616 tree type, dest = NULL_TREE, src = NULL_TREE, tem;
3a785c97
JJ		 1617 bool strop = false, cmp = false;
1618 unsigned int idx = ~0;
1619 location_t loc;
1a4049e7
JJ		 1620
1621 if (TREE_CODE (callee) != FUNCTION_DECL
1622 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL
9771b263 1623 || vec_safe_length (params) <= 1)
1a4049e7
JJ		 1624 return;
1625
1a4049e7
JJ		 1626 switch (DECL_FUNCTION_CODE (callee))
1627 {
1628 case BUILT_IN_STRNCMP:
1629 case BUILT_IN_STRNCASECMP:
3a785c97
JJ		 1630 cmp = true;
1631 /* FALLTHRU */
1a4049e7 1632 case BUILT_IN_STRNCPY:
3a785c97 1633 case BUILT_IN_STRNCPY_CHK:
1a4049e7 1634 case BUILT_IN_STRNCAT:
3a785c97
JJ		 1635 case BUILT_IN_STRNCAT_CHK:
1636 case BUILT_IN_STPNCPY:
1637 case BUILT_IN_STPNCPY_CHK:
1a4049e7
JJ		 1638 strop = true;
1639 /* FALLTHRU */
1640 case BUILT_IN_MEMCPY:
3a785c97 1641 case BUILT_IN_MEMCPY_CHK:
1a4049e7 1642 case BUILT_IN_MEMMOVE:
3a785c97 1643 case BUILT_IN_MEMMOVE_CHK:
9771b263 1644 if (params->length () < 3)
3a785c97 1645 return;
9771b263
DN		 1646 src = (*params)[1];
1647 dest = (*params)[0];
3a785c97
JJ		 1648 idx = 2;
1649 break;
1650 case BUILT_IN_BCOPY:
9771b263 1651 if (params->length () < 3)
3a785c97 1652 return;
9771b263
DN		 1653 src = (*params)[0];
1654 dest = (*params)[1];
3a785c97
JJ		 1655 idx = 2;
1656 break;
1a4049e7 1657 case BUILT_IN_MEMCMP:
3a785c97 1658 case BUILT_IN_BCMP:
9771b263 1659 if (params->length () < 3)
1a4049e7 1660 return;
9771b263
DN		 1661 src = (*params)[1];
1662 dest = (*params)[0];
3a785c97
JJ		 1663 idx = 2;
1664 cmp = true;
1a4049e7
JJ		 1665 break;
1666 case BUILT_IN_MEMSET:
3a785c97 1667 case BUILT_IN_MEMSET_CHK:
9771b263 1668 if (params->length () < 3)
1a4049e7 1669 return;
9771b263 1670 dest = (*params)[0];
3a785c97
JJ		 1671 idx = 2;
1672 break;
1673 case BUILT_IN_BZERO:
9771b263 1674 dest = (*params)[0];
3a785c97 1675 idx = 1;
1a4049e7
JJ		 1676 break;
1677 case BUILT_IN_STRNDUP:
9771b263 1678 src = (*params)[0];
1a4049e7 1679 strop = true;
3a785c97
JJ		 1680 idx = 1;
1681 break;
1682 case BUILT_IN_MEMCHR:
9771b263 1683 if (params->length () < 3)
3a785c97 1684 return;
9771b263 1685 src = (*params)[0];
3a785c97
JJ		 1686 idx = 2;
1687 break;
1688 case BUILT_IN_SNPRINTF:
1689 case BUILT_IN_SNPRINTF_CHK:
1690 case BUILT_IN_VSNPRINTF:
1691 case BUILT_IN_VSNPRINTF_CHK:
9771b263 1692 dest = (*params)[0];
3a785c97
JJ		 1693 idx = 1;
1694 strop = true;
1a4049e7
JJ		 1695 break;
1696 default:
1697 break;
1698 }
1699
3a785c97
JJ		 1700 if (idx >= 3)
1701 return;
1702
1703 if (sizeof_arg[idx] == NULL || sizeof_arg[idx] == error_mark_node)
1704 return;
1705
1706 type = TYPE_P (sizeof_arg[idx])
1707 ? sizeof_arg[idx] : TREE_TYPE (sizeof_arg[idx]);
1708 if (!POINTER_TYPE_P (type))
1709 return;
1710
1a4049e7
JJ		 1711 if (dest
1712 && (tem = tree_strip_nop_conversions (dest))
1713 && POINTER_TYPE_P (TREE_TYPE (tem))
1714 && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
1715 return;
1716
1717 if (src
1718 && (tem = tree_strip_nop_conversions (src))
1719 && POINTER_TYPE_P (TREE_TYPE (tem))
1720 && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
1721 return;
1722
3a785c97
JJ		 1723 loc = sizeof_arg_loc[idx];
1724
1725 if (dest && !cmp)
1a4049e7 1726 {
3a785c97
JJ		 1727 if (!TYPE_P (sizeof_arg[idx])
1728 && operand_equal_p (dest, sizeof_arg[idx], 0)
1a4049e7
JJ		 1729 && comp_types (TREE_TYPE (dest), type))
1730 {
3a785c97 1731 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
1a4049e7
JJ		 1732 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1733 "argument to %<sizeof%> in %qD call is the same "
1734 "expression as the destination; did you mean to "
1735 "remove the addressof?", callee);
1736 else if ((TYPE_PRECISION (TREE_TYPE (type))
1737 == TYPE_PRECISION (char_type_node))
1738 || strop)
1739 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1740 "argument to %<sizeof%> in %qD call is the same "
1741 "expression as the destination; did you mean to "
1742 "provide an explicit length?", callee);
1743 else
1744 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1745 "argument to %<sizeof%> in %qD call is the same "
1746 "expression as the destination; did you mean to "
1747 "dereference it?", callee);
1748 return;
1749 }
1750
1751 if (POINTER_TYPE_P (TREE_TYPE (dest))
1752 && !strop
1753 && comp_types (TREE_TYPE (dest), type)
1754 && !VOID_TYPE_P (TREE_TYPE (type)))
1755 {
1756 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1757 "argument to %<sizeof%> in %qD call is the same "
1758 "pointer type %qT as the destination; expected %qT "
1759 "or an explicit length", callee, TREE_TYPE (dest),
1760 TREE_TYPE (TREE_TYPE (dest)));
1761 return;
1762 }
1763 }
1764
3a785c97 1765 if (src && !cmp)
1a4049e7 1766 {
3a785c97
JJ		 1767 if (!TYPE_P (sizeof_arg[idx])
1768 && operand_equal_p (src, sizeof_arg[idx], 0)
1a4049e7
JJ		 1769 && comp_types (TREE_TYPE (src), type))
1770 {
3a785c97 1771 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
1a4049e7
JJ		 1772 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1773 "argument to %<sizeof%> in %qD call is the same "
1774 "expression as the source; did you mean to "
1775 "remove the addressof?", callee);
1776 else if ((TYPE_PRECISION (TREE_TYPE (type))
1777 == TYPE_PRECISION (char_type_node))
1778 || strop)
1779 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1780 "argument to %<sizeof%> in %qD call is the same "
1781 "expression as the source; did you mean to "
1782 "provide an explicit length?", callee);
1783 else
1784 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1785 "argument to %<sizeof%> in %qD call is the same "
1786 "expression as the source; did you mean to "
1787 "dereference it?", callee);
1788 return;
1789 }
1790
1791 if (POINTER_TYPE_P (TREE_TYPE (src))
1792 && !strop
1793 && comp_types (TREE_TYPE (src), type)
1794 && !VOID_TYPE_P (TREE_TYPE (type)))
1795 {
1796 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1797 "argument to %<sizeof%> in %qD call is the same "
1798 "pointer type %qT as the source; expected %qT "
1799 "or an explicit length", callee, TREE_TYPE (src),
1800 TREE_TYPE (TREE_TYPE (src)));
1801 return;
1802 }
1803 }
3a785c97
JJ		 1804
1805 if (dest)
1806 {
1807 if (!TYPE_P (sizeof_arg[idx])
1808 && operand_equal_p (dest, sizeof_arg[idx], 0)
1809 && comp_types (TREE_TYPE (dest), type))
1810 {
1811 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
1812 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1813 "argument to %<sizeof%> in %qD call is the same "
1814 "expression as the first source; did you mean to "
1815 "remove the addressof?", callee);
1816 else if ((TYPE_PRECISION (TREE_TYPE (type))
1817 == TYPE_PRECISION (char_type_node))
1818 || strop)
1819 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1820 "argument to %<sizeof%> in %qD call is the same "
1821 "expression as the first source; did you mean to "
1822 "provide an explicit length?", callee);
1823 else
1824 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1825 "argument to %<sizeof%> in %qD call is the same "
1826 "expression as the first source; did you mean to "
1827 "dereference it?", callee);
1828 return;
1829 }
1830
1831 if (POINTER_TYPE_P (TREE_TYPE (dest))
1832 && !strop
1833 && comp_types (TREE_TYPE (dest), type)
1834 && !VOID_TYPE_P (TREE_TYPE (type)))
1835 {
1836 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1837 "argument to %<sizeof%> in %qD call is the same "
1838 "pointer type %qT as the first source; expected %qT "
1839 "or an explicit length", callee, TREE_TYPE (dest),
1840 TREE_TYPE (TREE_TYPE (dest)));
1841 return;
1842 }
1843 }
1844
1845 if (src)
1846 {
1847 if (!TYPE_P (sizeof_arg[idx])
1848 && operand_equal_p (src, sizeof_arg[idx], 0)
1849 && comp_types (TREE_TYPE (src), type))
1850 {
1851 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
1852 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1853 "argument to %<sizeof%> in %qD call is the same "
1854 "expression as the second source; did you mean to "
1855 "remove the addressof?", callee);
1856 else if ((TYPE_PRECISION (TREE_TYPE (type))
1857 == TYPE_PRECISION (char_type_node))
1858 || strop)
1859 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1860 "argument to %<sizeof%> in %qD call is the same "
1861 "expression as the second source; did you mean to "
1862 "provide an explicit length?", callee);
1863 else
1864 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1865 "argument to %<sizeof%> in %qD call is the same "
1866 "expression as the second source; did you mean to "
1867 "dereference it?", callee);
1868 return;
1869 }
1870
1871 if (POINTER_TYPE_P (TREE_TYPE (src))
1872 && !strop
1873 && comp_types (TREE_TYPE (src), type)
1874 && !VOID_TYPE_P (TREE_TYPE (type)))
1875 {
1876 warning_at (loc, OPT_Wsizeof_pointer_memaccess,
1877 "argument to %<sizeof%> in %qD call is the same "
1878 "pointer type %qT as the second source; expected %qT "
1879 "or an explicit length", callee, TREE_TYPE (src),
1880 TREE_TYPE (TREE_TYPE (src)));
1881 return;
1882 }
1883 }
1884
1a4049e7
JJ		 1885}
1886
a1e45ff0
DM		 1887/* Warn for unlikely, improbable, or stupid DECL declarations
1888 of `main'. */
1889
1890void
1891check_main_parameter_types (tree decl)
1892{
e19a18d4
NF		 1893 function_args_iterator iter;
1894 tree type;
a1e45ff0
DM		 1895 int argct = 0;
1896
e19a18d4
NF		 1897 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl), type, iter)
1898 {
1899 /* XXX void_type_node belies the abstraction. */
1900 if (type == void_type_node || type == error_mark_node )
1901 break;
1902
f827930a
MP		 1903 tree t = type;
1904 if (TYPE_ATOMIC (t))
1905 pedwarn (input_location, OPT_Wmain,
1906 "%<_Atomic%>-qualified parameter type %qT of %q+D",
1907 type, decl);
1908 while (POINTER_TYPE_P (t))
1909 {
1910 t = TREE_TYPE (t);
1911 if (TYPE_ATOMIC (t))
1912 pedwarn (input_location, OPT_Wmain,
1913 "%<_Atomic%>-qualified parameter type %qT of %q+D",
1914 type, decl);
1915 }
1916
e19a18d4
NF		 1917 ++argct;
1918 switch (argct)
1919 {
1920 case 1:
1921 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1922 pedwarn (input_location, OPT_Wmain,
1923 "first argument of %q+D should be %<int%>", decl);
1924 break;
1925
1926 case 2:
1927 if (TREE_CODE (type) != POINTER_TYPE
1928 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1929 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1930 != char_type_node))
1931 pedwarn (input_location, OPT_Wmain,
1932 "second argument of %q+D should be %<char **%>", decl);
1933 break;
1934
1935 case 3:
1936 if (TREE_CODE (type) != POINTER_TYPE
1937 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1938 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1939 != char_type_node))
1940 pedwarn (input_location, OPT_Wmain,
1941 "third argument of %q+D should probably be "
1942 "%<char **%>", decl);
1943 break;
1944 }
1945 }
a1e45ff0
DM		 1946
1947 /* It is intentional that this message does not mention the third
1948 argument because it's only mentioned in an appendix of the
1949 standard. */
1950 if (argct > 0 && (argct < 2 || argct > 3))
e19a18d4
NF		 1951 pedwarn (input_location, OPT_Wmain,
1952 "%q+D takes only zero or two arguments", decl);
38e514c0
MP		 1953
1954 if (stdarg_p (TREE_TYPE (decl)))
1955 pedwarn (input_location, OPT_Wmain,
1956 "%q+D declared as variadic function", decl);
a1e45ff0
DM		 1957}
1958
0af94e6f
JR		 1959/* vector_targets_convertible_p is used for vector pointer types. The
1960 callers perform various checks that the qualifiers are satisfactory,
1961 while OTOH vector_targets_convertible_p ignores the number of elements
1962 in the vectors. That's fine with vector pointers as we can consider,
1963 say, a vector of 8 elements as two consecutive vectors of 4 elements,
1964 and that does not require and conversion of the pointer values.
1965 In contrast, vector_types_convertible_p and
1966 vector_types_compatible_elements_p are used for vector value types. */
f83c7f63
DJ		 1967/* True if pointers to distinct types T1 and T2 can be converted to
1968 each other without an explicit cast. Only returns true for opaque
1969 vector types. */
1970bool
1971vector_targets_convertible_p (const_tree t1, const_tree t2)
1972{
31521951 1973 if (VECTOR_TYPE_P (t1) && VECTOR_TYPE_P (t2)
b6fc2cdb 1974 && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
f83c7f63
DJ		 1975 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1976 return true;
1977
1978 return false;
1979}
1980
0af94e6f
JR		 1981/* vector_types_convertible_p is used for vector value types.
1982 It could in principle call vector_targets_convertible_p as a subroutine,
1983 but then the check for vector type would be duplicated with its callers,
1984 and also the purpose of vector_targets_convertible_p would become
1985 muddled.
1986 Where vector_types_convertible_p returns true, a conversion might still be
1987 needed to make the types match.
1988 In contrast, vector_targets_convertible_p is used for vector pointer
1989 values, and vector_types_compatible_elements_p is used specifically
1990 in the context for binary operators, as a check if use is possible without
1991 conversion. */
00c8e9f6
MS		 1992/* True if vector types T1 and T2 can be converted to each other
1993 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1994 can only be converted with -flax-vector-conversions yet that is not
1995 in effect, emit a note telling the user about that option if such
1996 a note has not previously been emitted. */
1997bool
58f9752a 1998vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
cc27e657 1999{
00c8e9f6 2000 static bool emitted_lax_note = false;
14e765da
JM		 2001 bool convertible_lax;
2002
b6fc2cdb 2003 if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
14e765da
JM		 2004 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
2005 return true;
2006
2007 convertible_lax =
2008 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
2009 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
a5e0cd1d 2010 TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2))
14e765da
JM		 2011 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
2012 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
00c8e9f6
MS		 2013
2014 if (!convertible_lax || flag_lax_vector_conversions)
2015 return convertible_lax;
2016
2017 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
cf7bc668 2018 && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
00c8e9f6
MS		 2019 return true;
2020
2021 if (emit_lax_note && !emitted_lax_note)
2022 {
2023 emitted_lax_note = true;
1f5b3869 2024 inform (input_location, "use -flax-vector-conversions to permit "
00c8e9f6
MS		 2025 "conversions between vectors with differing "
2026 "element types or numbers of subparts");
2027 }
2028
2029 return false;
cc27e657
PB		 2030}
2031
9e1a8dd1
RR		 2032/* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2033 and have vector types, V0 has the same type as V1, and the number of
2034 elements of V0, V1, MASK is the same.
2035
2036 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2037 called with two arguments. In this case implementation passes the
2038 first argument twice in order to share the same tree code. This fact
2039 could enable the mask-values being twice the vector length. This is
2040 an implementation accident and this semantics is not guaranteed to
2041 the user. */
2042tree
bedc293e
MG		 2043c_build_vec_perm_expr (location_t loc, tree v0, tree v1, tree mask,
2044 bool complain)
9e1a8dd1
RR		 2045{
2046 tree ret;
2047 bool wrap = true;
2048 bool maybe_const = false;
2049 bool two_arguments = false;
2050
2051 if (v1 == NULL_TREE)
2052 {
2053 two_arguments = true;
2054 v1 = v0;
2055 }
2056
2057 if (v0 == error_mark_node || v1 == error_mark_node
2058 || mask == error_mark_node)
2059 return error_mark_node;
2060
31521951 2061 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask)))
9e1a8dd1 2062 {
bedc293e
MG		 2063 if (complain)
2064 error_at (loc, "__builtin_shuffle last argument must "
2065 "be an integer vector");
9e1a8dd1
RR		 2066 return error_mark_node;
2067 }
2068
31521951
MP		 2069 if (!VECTOR_TYPE_P (TREE_TYPE (v0))
2070 || !VECTOR_TYPE_P (TREE_TYPE (v1)))
9e1a8dd1 2071 {
bedc293e
MG		 2072 if (complain)
2073 error_at (loc, "__builtin_shuffle arguments must be vectors");
9e1a8dd1
RR		 2074 return error_mark_node;
2075 }
2076
2077 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1)))
2078 {
bedc293e
MG		 2079 if (complain)
2080 error_at (loc, "__builtin_shuffle argument vectors must be of "
2081 "the same type");
9e1a8dd1
RR		 2082 return error_mark_node;
2083 }
2084
2085 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0))
2086 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask))
2087 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1))
2088 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask)))
2089 {
bedc293e
MG		 2090 if (complain)
2091 error_at (loc, "__builtin_shuffle number of elements of the "
2092 "argument vector(s) and the mask vector should "
2093 "be the same");
9e1a8dd1
RR		 2094 return error_mark_node;
2095 }
2096
2097 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0))))
2098 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask)))))
2099 {
bedc293e
MG		 2100 if (complain)
2101 error_at (loc, "__builtin_shuffle argument vector(s) inner type "
2102 "must have the same size as inner type of the mask");
9e1a8dd1
RR		 2103 return error_mark_node;
2104 }
2105
2106 if (!c_dialect_cxx ())
2107 {
2108 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2109 v0 = c_fully_fold (v0, false, &maybe_const);
2110 wrap &= maybe_const;
2111
2112 if (two_arguments)
2113 v1 = v0 = save_expr (v0);
2114 else
2115 {
2116 v1 = c_fully_fold (v1, false, &maybe_const);
2117 wrap &= maybe_const;
2118 }
2119
2120 mask = c_fully_fold (mask, false, &maybe_const);
2121 wrap &= maybe_const;
2122 }
bedc293e
MG		 2123 else if (two_arguments)
2124 v1 = v0 = save_expr (v0);
9e1a8dd1
RR		 2125
2126 ret = build3_loc (loc, VEC_PERM_EXPR, TREE_TYPE (v0), v0, v1, mask);
2127
2128 if (!c_dialect_cxx () && !wrap)
2129 ret = c_wrap_maybe_const (ret, true);
2130
2131 return ret;
2132}
2133
828fb3ba
JM		 2134/* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2135 to integral type. */
2136
2137static tree
2138c_common_get_narrower (tree op, int *unsignedp_ptr)
2139{
2140 op = get_narrower (op, unsignedp_ptr);
2141
2142 if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE
2143 && ENUM_IS_SCOPED (TREE_TYPE (op)))
2144 {
2145 /* C++0x scoped enumerations don't implicitly convert to integral
2146 type; if we stripped an explicit conversion to a larger type we
2147 need to replace it so common_type will still work. */
21fa2faf
RG		 2148 tree type = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op)),
2149 TYPE_UNSIGNED (TREE_TYPE (op)));
828fb3ba
JM		 2150 op = fold_convert (type, op);
2151 }
2152 return op;
2153}
2154
6715192c
MLI		 2155/* This is a helper function of build_binary_op.
2156
2157 For certain operations if both args were extended from the same
2158 smaller type, do the arithmetic in that type and then extend.
2159
2160 BITWISE indicates a bitwise operation.
2161 For them, this optimization is safe only if
2162 both args are zero-extended or both are sign-extended.
2163 Otherwise, we might change the result.
2164 Eg, (short)-1 | (unsigned short)-1 is (int)-1
b8698a0f 2165 but calculated in (unsigned short) it would be (unsigned short)-1.
6715192c 2166*/
828fb3ba
JM		 2167tree
2168shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
6715192c
MLI		 2169{
2170 int unsigned0, unsigned1;
2171 tree arg0, arg1;
2172 int uns;
2173 tree type;
2174
2175 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2176 excessive narrowing when we call get_narrower below. For
2177 example, suppose that OP0 is of unsigned int extended
2178 from signed char and that RESULT_TYPE is long long int.
2179 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2180 like
b8698a0f 2181
6715192c
MLI		 2182 (long long int) (unsigned int) signed_char
2183
2184 which get_narrower would narrow down to
b8698a0f 2185
6715192c 2186 (unsigned int) signed char
b8698a0f 2187
6715192c
MLI		 2188 If we do not cast OP0 first, get_narrower would return
2189 signed_char, which is inconsistent with the case of the
2190 explicit cast. */
2191 op0 = convert (result_type, op0);
2192 op1 = convert (result_type, op1);
2193
828fb3ba
JM		 2194 arg0 = c_common_get_narrower (op0, &unsigned0);
2195 arg1 = c_common_get_narrower (op1, &unsigned1);
6715192c
MLI		 2196
2197 /* UNS is 1 if the operation to be done is an unsigned one. */
2198 uns = TYPE_UNSIGNED (result_type);
2199
2200 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2201 but it *requires* conversion to FINAL_TYPE. */
b8698a0f 2202
6715192c
MLI		 2203 if ((TYPE_PRECISION (TREE_TYPE (op0))
2204 == TYPE_PRECISION (TREE_TYPE (arg0)))
2205 && TREE_TYPE (op0) != result_type)
2206 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2207 if ((TYPE_PRECISION (TREE_TYPE (op1))
2208 == TYPE_PRECISION (TREE_TYPE (arg1)))
2209 && TREE_TYPE (op1) != result_type)
2210 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
b8698a0f 2211
6715192c 2212 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
b8698a0f 2213
6715192c
MLI		 2214 /* For bitwise operations, signedness of nominal type
2215 does not matter. Consider only how operands were extended. */
2216 if (bitwise)
2217 uns = unsigned0;
b8698a0f 2218
6715192c
MLI		 2219 /* Note that in all three cases below we refrain from optimizing
2220 an unsigned operation on sign-extended args.
2221 That would not be valid. */
b8698a0f 2222
6715192c
MLI		 2223 /* Both args variable: if both extended in same way
2224 from same width, do it in that width.
2225 Do it unsigned if args were zero-extended. */
2226 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2227 < TYPE_PRECISION (result_type))
2228 && (TYPE_PRECISION (TREE_TYPE (arg1))
2229 == TYPE_PRECISION (TREE_TYPE (arg0)))
2230 && unsigned0 == unsigned1
2231 && (unsigned0 || !uns))
2232 return c_common_signed_or_unsigned_type
2233 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2234
2235 else if (TREE_CODE (arg0) == INTEGER_CST
2236 && (unsigned1 || !uns)
2237 && (TYPE_PRECISION (TREE_TYPE (arg1))
2238 < TYPE_PRECISION (result_type))
2239 && (type
2240 = c_common_signed_or_unsigned_type (unsigned1,
2241 TREE_TYPE (arg1)))
2242 && !POINTER_TYPE_P (type)
2243 && int_fits_type_p (arg0, type))
2244 return type;
2245
2246 else if (TREE_CODE (arg1) == INTEGER_CST
2247 && (unsigned0 || !uns)
2248 && (TYPE_PRECISION (TREE_TYPE (arg0))
2249 < TYPE_PRECISION (result_type))
2250 && (type
2251 = c_common_signed_or_unsigned_type (unsigned0,
2252 TREE_TYPE (arg0)))
2253 && !POINTER_TYPE_P (type)
2254 && int_fits_type_p (arg1, type))
2255 return type;
2256
2257 return result_type;
2258}
2259
7a37fa90
MM		 2260/* Returns true iff any integer value of type FROM_TYPE can be represented as
2261 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2262
2263static bool
2264int_safely_convertible_to_real_p (const_tree from_type, const_tree to_type)
2265{
2266 tree type_low_bound = TYPE_MIN_VALUE (from_type);
2267 tree type_high_bound = TYPE_MAX_VALUE (from_type);
2268 REAL_VALUE_TYPE real_low_bound =
2269 real_value_from_int_cst (0, type_low_bound);
2270 REAL_VALUE_TYPE real_high_bound =
2271 real_value_from_int_cst (0, type_high_bound);
2272
2273 return exact_real_truncate (TYPE_MODE (to_type), &real_low_bound)
2274 && exact_real_truncate (TYPE_MODE (to_type), &real_high_bound);
2275}
2276
2277/* Checks if expression EXPR of complex/real/integer type cannot be converted
2278 to the complex/real/integer type TYPE. Function returns non-zero when:
68fca595
MP		 2279 * EXPR is a constant which cannot be exactly converted to TYPE.
2280 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
7a37fa90
MM		 2281 for EXPR type and TYPE being both integers or both real, or both
2282 complex.
2283 * EXPR is not a constant of complex type and TYPE is a real or
2284 an integer.
68fca595
MP		 2285 * EXPR is not a constant of real type and TYPE is an integer.
2286 * EXPR is not a constant of integer type which cannot be
2287 exactly converted to real type.
7a37fa90 2288
0e3a99ae 2289 Function allows conversions between types of different signedness and
49b0aa18 2290 can return SAFE_CONVERSION (zero) in that case. Function can produce
7a37fa90
MM		 2291 signedness warnings if PRODUCE_WARNS is true.
2292
2293 Function allows conversions from complex constants to non-complex types,
2294 provided that imaginary part is zero and real part can be safely converted
2295 to TYPE. */
68fca595 2296
49b0aa18 2297enum conversion_safety
68fca595 2298unsafe_conversion_p (location_t loc, tree type, tree expr, bool produce_warns)
422c3a54 2299{
49b0aa18 2300 enum conversion_safety give_warning = SAFE_CONVERSION; /* is 0 or false */
374035cb 2301 tree expr_type = TREE_TYPE (expr);
68fca595 2302 loc = expansion_point_location_if_in_system_header (loc);
422c3a54 2303
0e3a99ae 2304 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
0011dedb 2305 {
7a37fa90
MM		 2306 /* If type is complex, we are interested in compatibility with
2307 underlying type. */
2308 if (TREE_CODE (type) == COMPLEX_TYPE)
2309 type = TREE_TYPE (type);
2310
422c3a54 2311 /* Warn for real constant that is not an exact integer converted
0e3a99ae 2312 to integer type. */
374035cb 2313 if (TREE_CODE (expr_type) == REAL_TYPE
0e3a99ae
AS		 2314 && TREE_CODE (type) == INTEGER_TYPE)
2315 {
2316 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
49b0aa18 2317 give_warning = UNSAFE_REAL;
0e3a99ae 2318 }
91c41804 2319 /* Warn for an integer constant that does not fit into integer type. */
374035cb 2320 else if (TREE_CODE (expr_type) == INTEGER_TYPE
0e3a99ae
AS		 2321 && TREE_CODE (type) == INTEGER_TYPE
2322 && !int_fits_type_p (expr, type))
2323 {
2324 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
374035cb 2325 && tree_int_cst_sgn (expr) < 0)
0e3a99ae
AS		 2326 {
2327 if (produce_warns)
2328 warning_at (loc, OPT_Wsign_conversion, "negative integer"
2329 " implicitly converted to unsigned type");
2330 }
2331 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
2332 {
2333 if (produce_warns)
2334 warning_at (loc, OPT_Wsign_conversion, "conversion of unsigned"
2335 " constant value to negative integer");
2336 }
7060db96 2337 else
49b0aa18 2338 give_warning = UNSAFE_OTHER;
0e3a99ae 2339 }
422c3a54 2340 else if (TREE_CODE (type) == REAL_TYPE)
0e3a99ae
AS		 2341 {
2342 /* Warn for an integer constant that does not fit into real type. */
2343 if (TREE_CODE (expr_type) == INTEGER_TYPE)
2344 {
2345 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
2346 if (!exact_real_truncate (TYPE_MODE (type), &a))
49b0aa18 2347 give_warning = UNSAFE_REAL;
0e3a99ae
AS		 2348 }
2349 /* Warn for a real constant that does not fit into a smaller
2350 real type. */
2351 else if (TREE_CODE (expr_type) == REAL_TYPE
2352 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2353 {
2354 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
2355 if (!exact_real_truncate (TYPE_MODE (type), &a))
49b0aa18 2356 give_warning = UNSAFE_REAL;
0e3a99ae
AS		 2357 }
2358 }
2359 }
7a37fa90
MM		 2360
2361 else if (TREE_CODE (expr) == COMPLEX_CST)
2362 {
2363 tree imag_part = TREE_IMAGPART (expr);
2364 /* Conversion from complex constant with zero imaginary part,
2365 perform check for conversion of real part. */
2366 if ((TREE_CODE (imag_part) == REAL_CST
2367 && real_zerop (imag_part))
2368 || (TREE_CODE (imag_part) == INTEGER_CST
2369 && integer_zerop (imag_part)))
2370 /* Note: in this branch we use recursive call to unsafe_conversion_p
2371 with different type of EXPR, but it is still safe, because when EXPR
2372 is a constant, it's type is not used in text of generated warnings
2373 (otherwise they could sound misleading). */
2374 return unsafe_conversion_p (loc, type, TREE_REALPART (expr),
2375 produce_warns);
2376 /* Conversion from complex constant with non-zero imaginary part. */
2377 else
2378 {
2379 /* Conversion to complex type.
2380 Perform checks for both real and imaginary parts. */
2381 if (TREE_CODE (type) == COMPLEX_TYPE)
2382 {
2383 /* Unfortunately, produce_warns must be false in two subsequent
2384 calls of unsafe_conversion_p, because otherwise we could
2385 produce strange "double" warnings, if both real and imaginary
2386 parts have conversion problems related to signedness.
2387
2388 For example:
2389 int32_t _Complex a = 0x80000000 + 0x80000000i;
2390
2391 Possible solution: add a separate function for checking
2392 constants and combine result of two calls appropriately. */
2393 enum conversion_safety re_safety =
2394 unsafe_conversion_p (loc, type, TREE_REALPART (expr), false);
2395 enum conversion_safety im_safety =
2396 unsafe_conversion_p (loc, type, imag_part, false);
2397
2398 /* Merge the results into appropriate single warning. */
2399
2400 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2401 if (re_safety == im_safety)
2402 give_warning = re_safety;
2403 else if (!re_safety && im_safety)
2404 give_warning = im_safety;
2405 else if (re_safety && !im_safety)
2406 give_warning = re_safety;
2407 else
2408 give_warning = UNSAFE_OTHER;
2409 }
2410 /* Warn about conversion from complex to real or integer type. */
2411 else
2412 give_warning = UNSAFE_IMAGINARY;
2413 }
2414 }
2415
2416 /* Checks for remaining case: EXPR is not constant. */
0e3a99ae
AS		 2417 else
2418 {
422c3a54 2419 /* Warn for real types converted to integer types. */
6715192c 2420 if (TREE_CODE (expr_type) == REAL_TYPE
0e3a99ae 2421 && TREE_CODE (type) == INTEGER_TYPE)
49b0aa18 2422 give_warning = UNSAFE_REAL;
422c3a54 2423
6715192c 2424 else if (TREE_CODE (expr_type) == INTEGER_TYPE
0e3a99ae
AS		 2425 && TREE_CODE (type) == INTEGER_TYPE)
2426 {
cfdaefec 2427 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
c00e8b06 2428 expr = get_unwidened (expr, 0);
6715192c 2429 expr_type = TREE_TYPE (expr);
cfdaefec 2430
6715192c 2431 /* Don't warn for short y; short x = ((int)y & 0xff); */
b8698a0f 2432 if (TREE_CODE (expr) == BIT_AND_EXPR
0e3a99ae 2433 || TREE_CODE (expr) == BIT_IOR_EXPR
6715192c
MLI		 2434 || TREE_CODE (expr) == BIT_XOR_EXPR)
2435 {
374035cb
MLI		 2436 /* If both args were extended from a shortest type,
2437 use that type if that is safe. */
b8698a0f
L		 2438 expr_type = shorten_binary_op (expr_type,
2439 TREE_OPERAND (expr, 0),
2440 TREE_OPERAND (expr, 1),
6715192c
MLI		 2441 /* bitwise */1);
2442
6715192c
MLI		 2443 if (TREE_CODE (expr) == BIT_AND_EXPR)
2444 {
2445 tree op0 = TREE_OPERAND (expr, 0);
2446 tree op1 = TREE_OPERAND (expr, 1);
9c591bd0
MLI		 2447 bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2448 bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2449
2450 /* If one of the operands is a non-negative constant
2451 that fits in the target type, then the type of the
2452 other operand does not matter. */
6715192c
MLI		 2453 if ((TREE_CODE (op0) == INTEGER_CST
2454 && int_fits_type_p (op0, c_common_signed_type (type))
2455 && int_fits_type_p (op0, c_common_unsigned_type (type)))
2456 || (TREE_CODE (op1) == INTEGER_CST
374035cb 2457 && int_fits_type_p (op1, c_common_signed_type (type))
b8698a0f 2458 && int_fits_type_p (op1,
374035cb 2459 c_common_unsigned_type (type))))
49b0aa18 2460 return SAFE_CONVERSION;
9c591bd0
MLI		 2461 /* If constant is unsigned and fits in the target
2462 type, then the result will also fit. */
2463 else if ((TREE_CODE (op0) == INTEGER_CST
b8698a0f 2464 && unsigned0
9c591bd0
MLI		 2465 && int_fits_type_p (op0, type))
2466 || (TREE_CODE (op1) == INTEGER_CST
2467 && unsigned1
2468 && int_fits_type_p (op1, type)))
49b0aa18 2469 return SAFE_CONVERSION;
6715192c
MLI		 2470 }
2471 }
0e3a99ae 2472 /* Warn for integer types converted to smaller integer types. */
b8698a0f 2473 if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
49b0aa18 2474 give_warning = UNSAFE_OTHER;
7060db96
MLI		 2475
2476 /* When they are the same width but different signedness,
2477 then the value may change. */
0e3a99ae 2478 else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
6715192c 2479 && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
7060db96
MLI		 2480 /* Even when converted to a bigger type, if the type is
2481 unsigned but expr is signed, then negative values
2482 will be changed. */
0e3a99ae
AS		 2483 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
2484 && produce_warns)
6312e84d
MLI		 2485 warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT "
2486 "may change the sign of the result",
2487 type, expr_type);
0e3a99ae 2488 }
422c3a54
MLI		 2489
2490 /* Warn for integer types converted to real types if and only if
0e3a99ae
AS		 2491 all the range of values of the integer type cannot be
2492 represented by the real type. */
6715192c 2493 else if (TREE_CODE (expr_type) == INTEGER_TYPE
0e3a99ae
AS		 2494 && TREE_CODE (type) == REAL_TYPE)
2495 {
58076e21
MLI		 2496 /* Don't warn about char y = 0xff; float x = (int) y; */
2497 expr = get_unwidened (expr, 0);
2498 expr_type = TREE_TYPE (expr);
2499
7a37fa90 2500 if (!int_safely_convertible_to_real_p (expr_type, type))
49b0aa18 2501 give_warning = UNSAFE_OTHER;
0e3a99ae 2502 }
422c3a54
MLI		 2503
2504 /* Warn for real types converted to smaller real types. */
6715192c 2505 else if (TREE_CODE (expr_type) == REAL_TYPE
0e3a99ae
AS		 2506 && TREE_CODE (type) == REAL_TYPE
2507 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
49b0aa18 2508 give_warning = UNSAFE_REAL;
7a37fa90
MM		 2509
2510 /* Check conversion between two complex types. */
2511 else if (TREE_CODE (expr_type) == COMPLEX_TYPE
2512 && TREE_CODE (type) == COMPLEX_TYPE)
2513 {
2514 /* Extract underlying types (i.e., type of real and imaginary
2515 parts) of expr_type and type. */
2516 tree from_type = TREE_TYPE (expr_type);
2517 tree to_type = TREE_TYPE (type);
2518
2519 /* Warn for real types converted to integer types. */
2520 if (TREE_CODE (from_type) == REAL_TYPE
2521 && TREE_CODE (to_type) == INTEGER_TYPE)
2522 give_warning = UNSAFE_REAL;
2523
2524 /* Warn for real types converted to smaller real types. */
2525 else if (TREE_CODE (from_type) == REAL_TYPE
2526 && TREE_CODE (to_type) == REAL_TYPE
2527 && TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
2528 give_warning = UNSAFE_REAL;
2529
2530 /* Check conversion for complex integer types. Here implementation
2531 is simpler than for real-domain integers because it does not
2532 involve sophisticated cases, such as bitmasks, casts, etc. */
2533 else if (TREE_CODE (from_type) == INTEGER_TYPE
2534 && TREE_CODE (to_type) == INTEGER_TYPE)
2535 {
2536 /* Warn for integer types converted to smaller integer types. */
2537 if (TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
2538 give_warning = UNSAFE_OTHER;
2539
2540 /* Check for different signedness, see case for real-domain
2541 integers (above) for a more detailed comment. */
2542 else if (((TYPE_PRECISION (to_type) == TYPE_PRECISION (from_type)
2543 && TYPE_UNSIGNED (to_type) != TYPE_UNSIGNED (from_type))
2544 || (TYPE_UNSIGNED (to_type) && !TYPE_UNSIGNED (from_type)))
2545 && produce_warns)
2546 warning_at (loc, OPT_Wsign_conversion,
2547 "conversion to %qT from %qT "
2548 "may change the sign of the result",
2549 type, expr_type);
2550 }
2551 else if (TREE_CODE (from_type) == INTEGER_TYPE
2552 && TREE_CODE (to_type) == REAL_TYPE
2553 && !int_safely_convertible_to_real_p (from_type, to_type))
2554 give_warning = UNSAFE_OTHER;
2555 }
2556
2557 /* Warn for complex types converted to real or integer types. */
2558 else if (TREE_CODE (expr_type) == COMPLEX_TYPE
2559 && TREE_CODE (type) != COMPLEX_TYPE)
2560 give_warning = UNSAFE_IMAGINARY;
0e3a99ae
AS		 2561 }
2562
2563 return give_warning;
2564}
2565
2566/* Warns if the conversion of EXPR to TYPE may alter a value.
2567 This is a helper function for warnings_for_convert_and_check. */
2568
2569static void
68fca595 2570conversion_warning (location_t loc, tree type, tree expr)
0e3a99ae 2571{
0e3a99ae 2572 tree expr_type = TREE_TYPE (expr);
49b0aa18 2573 enum conversion_safety conversion_kind;
422c3a54 2574
49b0aa18 2575 if (!warn_conversion && !warn_sign_conversion && !warn_float_conversion)
0e3a99ae 2576 return;
422c3a54 2577
66f20604
MP		 2578 /* This may happen, because for LHS op= RHS we preevaluate
2579 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2580 means we could no longer see the code of the EXPR. */
2581 if (TREE_CODE (expr) == C_MAYBE_CONST_EXPR)
2582 expr = C_MAYBE_CONST_EXPR_EXPR (expr);
2583 if (TREE_CODE (expr) == SAVE_EXPR)
2584 expr = TREE_OPERAND (expr, 0);
2585
0e3a99ae
AS		 2586 switch (TREE_CODE (expr))
2587 {
2588 case EQ_EXPR:
2589 case NE_EXPR:
2590 case LE_EXPR:
2591 case GE_EXPR:
2592 case LT_EXPR:
2593 case GT_EXPR:
2594 case TRUTH_ANDIF_EXPR:
2595 case TRUTH_ORIF_EXPR:
2596 case TRUTH_AND_EXPR:
2597 case TRUTH_OR_EXPR:
2598 case TRUTH_XOR_EXPR:
2599 case TRUTH_NOT_EXPR:
2600 /* Conversion from boolean to a signed:1 bit-field (which only
2601 can hold the values 0 and -1) doesn't lose information - but
2602 it does change the value. */
2603 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
2604 warning_at (loc, OPT_Wconversion,
2605 "conversion to %qT from boolean expression", type);
2606 return;
2607
2608 case REAL_CST:
2609 case INTEGER_CST:
7a37fa90 2610 case COMPLEX_CST:
68fca595 2611 conversion_kind = unsafe_conversion_p (loc, type, expr, true);
49b0aa18
JC		 2612 if (conversion_kind == UNSAFE_REAL)
2613 warning_at (loc, OPT_Wfloat_conversion,
2614 "conversion to %qT alters %qT constant value",
2615 type, expr_type);
2616 else if (conversion_kind)
0e3a99ae
AS		 2617 warning_at (loc, OPT_Wconversion,
2618 "conversion to %qT alters %qT constant value",
2619 type, expr_type);
2620 return;
2621
2622 case COND_EXPR:
2623 {
3f46d6a5
MLI		 2624 /* In case of COND_EXPR, we do not care about the type of
2625 COND_EXPR, only about the conversion of each operand. */
2626 tree op1 = TREE_OPERAND (expr, 1);
2627 tree op2 = TREE_OPERAND (expr, 2);
2628
68fca595
MP		 2629 conversion_warning (loc, type, op1);
2630 conversion_warning (loc, type, op2);
3f46d6a5 2631 return;
0e3a99ae
AS		 2632 }
2633
2634 default: /* 'expr' is not a constant. */
68fca595 2635 conversion_kind = unsafe_conversion_p (loc, type, expr, true);
49b0aa18
JC		 2636 if (conversion_kind == UNSAFE_REAL)
2637 warning_at (loc, OPT_Wfloat_conversion,
2638 "conversion to %qT from %qT may alter its value",
2639 type, expr_type);
7a37fa90
MM		 2640 else if (conversion_kind == UNSAFE_IMAGINARY)
2641 warning_at (loc, OPT_Wconversion,
2642 "conversion to %qT from %qT discards imaginary component",
2643 type, expr_type);
49b0aa18 2644 else if (conversion_kind)
0e3a99ae 2645 warning_at (loc, OPT_Wconversion,
6312e84d
MLI		 2646 "conversion to %qT from %qT may alter its value",
2647 type, expr_type);
422c3a54
MLI		 2648 }
2649}
2650
07231d4f
MLI		 2651/* Produce warnings after a conversion. RESULT is the result of
2652 converting EXPR to TYPE. This is a helper function for
2653 convert_and_check and cp_convert_and_check. */
d74154d5 2654
07231d4f 2655void
68fca595
MP		 2656warnings_for_convert_and_check (location_t loc, tree type, tree expr,
2657 tree result)
d74154d5 2658{
68fca595 2659 loc = expansion_point_location_if_in_system_header (loc);
5a3c9cf2 2660
91c41804
RS		 2661 if (TREE_CODE (expr) == INTEGER_CST
2662 && (TREE_CODE (type) == INTEGER_TYPE
2663 || TREE_CODE (type) == ENUMERAL_TYPE)
2664 && !int_fits_type_p (expr, type))
2665 {
422c3a54
MLI		 2666 /* Do not diagnose overflow in a constant expression merely
2667 because a conversion overflowed. */
91c41804 2668 if (TREE_OVERFLOW (result))
d95787e6
RS		 2669 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
2670
91c41804 2671 if (TYPE_UNSIGNED (type))
422c3a54 2672 {
91c41804
RS		 2673 /* This detects cases like converting -129 or 256 to
2674 unsigned char. */
2675 if (!int_fits_type_p (expr, c_common_signed_type (type)))
5a3c9cf2
PC		 2676 warning_at (loc, OPT_Woverflow,
2677 "large integer implicitly truncated to unsigned type");
7060db96 2678 else
68fca595 2679 conversion_warning (loc, type, expr);
91c41804 2680 }
b8698a0f 2681 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
68fca595 2682 warning_at (loc, OPT_Woverflow,
f73fe417
MLI		 2683 "overflow in implicit constant conversion");
2684 /* No warning for converting 0x80000000 to int. */
2685 else if (pedantic
2686 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
2687 || TYPE_PRECISION (TREE_TYPE (expr))
2688 != TYPE_PRECISION (type)))
5a3c9cf2
PC		 2689 warning_at (loc, OPT_Woverflow,
2690 "overflow in implicit constant conversion");
f73fe417 2691
7060db96 2692 else
68fca595 2693 conversion_warning (loc, type, expr);
d74154d5 2694 }
ab22c1fa
CF		 2695 else if ((TREE_CODE (result) == INTEGER_CST
2696 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
5a3c9cf2
PC		 2697 warning_at (loc, OPT_Woverflow,
2698 "overflow in implicit constant conversion");
7060db96 2699 else
68fca595 2700 conversion_warning (loc, type, expr);
07231d4f
MLI		 2701}
2702
2703
2704/* Convert EXPR to TYPE, warning about conversion problems with constants.
2705 Invoke this function on every expression that is converted implicitly,
2706 i.e. because of language rules and not because of an explicit cast. */
2707
2708tree
68fca595 2709convert_and_check (location_t loc, tree type, tree expr)
07231d4f
MLI		 2710{
2711 tree result;
8ce94e44
JM		 2712 tree expr_for_warning;
2713
2714 /* Convert from a value with possible excess precision rather than
2715 via the semantic type, but do not warn about values not fitting
2716 exactly in the semantic type. */
2717 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
2718 {
2719 tree orig_type = TREE_TYPE (expr);
2720 expr = TREE_OPERAND (expr, 0);
2721 expr_for_warning = convert (orig_type, expr);
2722 if (orig_type == type)
2723 return expr_for_warning;
2724 }
2725 else
2726 expr_for_warning = expr;
07231d4f
MLI		 2727
2728 if (TREE_TYPE (expr) == type)
2729 return expr;
b8698a0f 2730
07231d4f
MLI		 2731 result = convert (type, expr);
2732
7d882b83
ILT		 2733 if (c_inhibit_evaluation_warnings == 0
2734 && !TREE_OVERFLOW_P (expr)
2735 && result != error_mark_node)
68fca595 2736 warnings_for_convert_and_check (loc, type, expr_for_warning, result);
07231d4f 2737
91c41804 2738 return result;
96571883
BK		 2739}
2740\f
235cfbc4
BS		 2741/* A node in a list that describes references to variables (EXPR), which are
2742 either read accesses if WRITER is zero, or write accesses, in which case
2743 WRITER is the parent of EXPR. */
2744struct tlist
2745{
2746 struct tlist *next;
2747 tree expr, writer;
2748};
2749
2750/* Used to implement a cache the results of a call to verify_tree. We only
2751 use this for SAVE_EXPRs. */
2752struct tlist_cache
2753{
2754 struct tlist_cache *next;
2755 struct tlist *cache_before_sp;
2756 struct tlist *cache_after_sp;
2757 tree expr;
2683ed8d
BS		 2758};
2759
235cfbc4
BS		 2760/* Obstack to use when allocating tlist structures, and corresponding
2761 firstobj. */
2762static struct obstack tlist_obstack;
2763static char *tlist_firstobj = 0;
2764
2765/* Keep track of the identifiers we've warned about, so we can avoid duplicate
2766 warnings. */
2767static struct tlist *warned_ids;
2768/* SAVE_EXPRs need special treatment. We process them only once and then
2769 cache the results. */
2770static struct tlist_cache *save_expr_cache;
2771
35b1a6fa
AJ		 2772static void add_tlist (struct tlist **, struct tlist *, tree, int);
2773static void merge_tlist (struct tlist **, struct tlist *, int);
2774static void verify_tree (tree, struct tlist **, struct tlist **, tree);
2775static int warning_candidate_p (tree);
1e4ae551 2776static bool candidate_equal_p (const_tree, const_tree);
35b1a6fa
AJ		 2777static void warn_for_collisions (struct tlist *);
2778static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
2779static struct tlist *new_tlist (struct tlist *, tree, tree);
2683ed8d 2780
235cfbc4
BS		 2781/* Create a new struct tlist and fill in its fields. */
2782static struct tlist *
35b1a6fa 2783new_tlist (struct tlist *next, tree t, tree writer)
235cfbc4
BS		 2784{
2785 struct tlist *l;
5d038c4c 2786 l = XOBNEW (&tlist_obstack, struct tlist);
235cfbc4
BS		 2787 l->next = next;
2788 l->expr = t;
2789 l->writer = writer;
2790 return l;
2791}
2792
2793/* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2794 is nonnull, we ignore any node we find which has a writer equal to it. */
2795
2796static void
35b1a6fa 2797add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
235cfbc4
BS		 2798{
2799 while (add)
2800 {
2801 struct tlist *next = add->next;
3f75a254 2802 if (!copy)
235cfbc4 2803 add->next = *to;
1e4ae551 2804 if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
235cfbc4
BS		 2805 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
2806 add = next;
2807 }
2808}
2809
2810/* Merge the nodes of ADD into TO. This merging process is done so that for
2811 each variable that already exists in TO, no new node is added; however if
2812 there is a write access recorded in ADD, and an occurrence on TO is only
2813 a read access, then the occurrence in TO will be modified to record the
2814 write. */
2683ed8d
BS		 2815
2816static void
35b1a6fa 2817merge_tlist (struct tlist **to, struct tlist *add, int copy)
235cfbc4
BS		 2818{
2819 struct tlist **end = to;
2820
2821 while (*end)
2822 end = &(*end)->next;
2823
2824 while (add)
2825 {
2826 int found = 0;
2827 struct tlist *tmp2;
2828 struct tlist *next = add->next;
2829
2830 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1e4ae551 2831 if (candidate_equal_p (tmp2->expr, add->expr))
235cfbc4
BS		 2832 {
2833 found = 1;
3f75a254 2834 if (!tmp2->writer)
235cfbc4
BS		 2835 tmp2->writer = add->writer;
2836 }
3f75a254 2837 if (!found)
235cfbc4 2838 {
c2bf53a1 2839 *end = copy ? new_tlist (NULL, add->expr, add->writer) : add;
235cfbc4
BS		 2840 end = &(*end)->next;
2841 *end = 0;
2842 }
2843 add = next;
2844 }
2845}
2846
2847/* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2848 references in list LIST conflict with it, excluding reads if ONLY writers
2849 is nonzero. */
2850
2851static void
35b1a6fa
AJ		 2852warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
2853 int only_writes)
235cfbc4
BS		 2854{
2855 struct tlist *tmp;
2856
2857 /* Avoid duplicate warnings. */
2858 for (tmp = warned_ids; tmp; tmp = tmp->next)
1e4ae551 2859 if (candidate_equal_p (tmp->expr, written))
235cfbc4
BS		 2860 return;
2861
2862 while (list)
2863 {
1e4ae551
MLI		 2864 if (candidate_equal_p (list->expr, written)
2865 && !candidate_equal_p (list->writer, writer)
2866 && (!only_writes || list->writer))
235cfbc4
BS		 2867 {
2868 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
8400e75e 2869 warning_at (EXPR_LOC_OR_LOC (writer, input_location),
ca085fd7
MLI		 2870 OPT_Wsequence_point, "operation on %qE may be undefined",
2871 list->expr);
235cfbc4
BS		 2872 }
2873 list = list->next;
2874 }
2875}
2876
2877/* Given a list LIST of references to variables, find whether any of these
2878 can cause conflicts due to missing sequence points. */
2879
2880static void
35b1a6fa 2881warn_for_collisions (struct tlist *list)
235cfbc4
BS		 2882{
2883 struct tlist *tmp;
35b1a6fa 2884
235cfbc4
BS		 2885 for (tmp = list; tmp; tmp = tmp->next)
2886 {
2887 if (tmp->writer)
2888 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
2889 }
2890}
2891
684d9f3b 2892/* Return nonzero if X is a tree that can be verified by the sequence point
235cfbc4
BS		 2893 warnings. */
2894static int
35b1a6fa 2895warning_candidate_p (tree x)
2683ed8d 2896{
07078664
JJ		 2897 if (DECL_P (x) && DECL_ARTIFICIAL (x))
2898 return 0;
2899
92e948a8
NF		 2900 if (TREE_CODE (x) == BLOCK)
2901 return 0;
2902
07078664 2903 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
1e4ae551 2904 (lvalue_p) crash on TRY/CATCH. */
07078664
JJ		 2905 if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x)))
2906 return 0;
2907
2908 if (!lvalue_p (x))
2909 return 0;
2910
2911 /* No point to track non-const calls, they will never satisfy
2912 operand_equal_p. */
2913 if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0)
2914 return 0;
2915
2916 if (TREE_CODE (x) == STRING_CST)
2917 return 0;
2918
2919 return 1;
1e4ae551
MLI		 2920}
2921
2922/* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2923static bool
2924candidate_equal_p (const_tree x, const_tree y)
2925{
2926 return (x == y) || (x && y && operand_equal_p (x, y, 0));
235cfbc4 2927}
2683ed8d 2928
235cfbc4
BS		 2929/* Walk the tree X, and record accesses to variables. If X is written by the
2930 parent tree, WRITER is the parent.
2931 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2932 expression or its only operand forces a sequence point, then everything up
2933 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2934 in PNO_SP.
2935 Once we return, we will have emitted warnings if any subexpression before
2936 such a sequence point could be undefined. On a higher level, however, the
2937 sequence point may not be relevant, and we'll merge the two lists.
2938
2939 Example: (b++, a) + b;
2940 The call that processes the COMPOUND_EXPR will store the increment of B
2941 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2942 processes the PLUS_EXPR will need to merge the two lists so that
2943 eventually, all accesses end up on the same list (and we'll warn about the
2944 unordered subexpressions b++ and b.
2945
2946 A note on merging. If we modify the former example so that our expression
2947 becomes
2948 (b++, b) + a
2949 care must be taken not simply to add all three expressions into the final
2950 PNO_SP list. The function merge_tlist takes care of that by merging the
2951 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2952 way, so that no more than one access to B is recorded. */
2683ed8d 2953
235cfbc4 2954static void
35b1a6fa
AJ		 2955verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2956 tree writer)
235cfbc4
BS		 2957{
2958 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
2959 enum tree_code code;
6615c446 2960 enum tree_code_class cl;
2683ed8d 2961
f9e1917e
JM		 2962 /* X may be NULL if it is the operand of an empty statement expression
2963 ({ }). */
2964 if (x == NULL)
2965 return;
2966
235cfbc4
BS		 2967 restart:
2968 code = TREE_CODE (x);
e3a64162 2969 cl = TREE_CODE_CLASS (code);
2683ed8d 2970
235cfbc4 2971 if (warning_candidate_p (x))
1e4ae551 2972 *pno_sp = new_tlist (*pno_sp, x, writer);
235cfbc4
BS		 2973
2974 switch (code)
2975 {
52a84e42 2976 case CONSTRUCTOR:
f7716d57 2977 case SIZEOF_EXPR:
52a84e42
BS		 2978 return;
2979
235cfbc4
BS		 2980 case COMPOUND_EXPR:
2981 case TRUTH_ANDIF_EXPR:
2982 case TRUTH_ORIF_EXPR:
2983 tmp_before = tmp_nosp = tmp_list3 = 0;
2984 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2985 warn_for_collisions (tmp_nosp);
2986 merge_tlist (pbefore_sp, tmp_before, 0);
2987 merge_tlist (pbefore_sp, tmp_nosp, 0);
2988 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
2989 merge_tlist (pbefore_sp, tmp_list3, 0);
2990 return;
2991
2992 case COND_EXPR:
2993 tmp_before = tmp_list2 = 0;
2994 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
2995 warn_for_collisions (tmp_list2);
2996 merge_tlist (pbefore_sp, tmp_before, 0);
c2bf53a1 2997 merge_tlist (pbefore_sp, tmp_list2, 0);
235cfbc4
BS		 2998
2999 tmp_list3 = tmp_nosp = 0;
3000 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
3001 warn_for_collisions (tmp_nosp);
3002 merge_tlist (pbefore_sp, tmp_list3, 0);
3003
3004 tmp_list3 = tmp_list2 = 0;
3005 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
3006 warn_for_collisions (tmp_list2);
3007 merge_tlist (pbefore_sp, tmp_list3, 0);
3008 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3009 two first, to avoid warning for (a ? b++ : b++). */
3010 merge_tlist (&tmp_nosp, tmp_list2, 0);
3011 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
3012 return;
3013
2683ed8d
BS		 3014 case PREDECREMENT_EXPR:
3015 case PREINCREMENT_EXPR:
3016 case POSTDECREMENT_EXPR:
3017 case POSTINCREMENT_EXPR:
235cfbc4
BS		 3018 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
3019 return;
3020
3021 case MODIFY_EXPR:
3022 tmp_before = tmp_nosp = tmp_list3 = 0;
3023 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
3024 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
3025 /* Expressions inside the LHS are not ordered wrt. the sequence points
3026 in the RHS. Example:
3027 *a = (a++, 2)
3028 Despite the fact that the modification of "a" is in the before_sp
3029 list (tmp_before), it conflicts with the use of "a" in the LHS.
3030 We can handle this by adding the contents of tmp_list3
3031 to those of tmp_before, and redoing the collision warnings for that
3032 list. */
3033 add_tlist (&tmp_before, tmp_list3, x, 1);
3034 warn_for_collisions (tmp_before);
3035 /* Exclude the LHS itself here; we first have to merge it into the
3036 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3037 didn't exclude the LHS, we'd get it twice, once as a read and once
3038 as a write. */
3039 add_tlist (pno_sp, tmp_list3, x, 0);
3040 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
3041
3042 merge_tlist (pbefore_sp, tmp_before, 0);
3043 if (warning_candidate_p (TREE_OPERAND (x, 0)))
3044 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
3045 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
3046 return;
2683ed8d
BS		 3047
3048 case CALL_EXPR:
235cfbc4
BS		 3049 /* We need to warn about conflicts among arguments and conflicts between
3050 args and the function address. Side effects of the function address,
3051 however, are not ordered by the sequence point of the call. */
5039610b
SL		 3052 {
3053 call_expr_arg_iterator iter;
3054 tree arg;
b8698a0f 3055 tmp_before = tmp_nosp = 0;
5039610b
SL		 3056 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
3057 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
3058 {
3059 tmp_list2 = tmp_list3 = 0;
3060 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
3061 merge_tlist (&tmp_list3, tmp_list2, 0);
3062 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
3063 }
3064 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
3065 warn_for_collisions (tmp_before);
3066 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
3067 return;
3068 }
2683ed8d
BS		 3069
3070 case TREE_LIST:
3071 /* Scan all the list, e.g. indices of multi dimensional array. */
3072 while (x)
3073 {
235cfbc4
BS		 3074 tmp_before = tmp_nosp = 0;
3075 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
3076 merge_tlist (&tmp_nosp, tmp_before, 0);
3077 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2683ed8d
BS		 3078 x = TREE_CHAIN (x);
3079 }
235cfbc4 3080 return;
2683ed8d 3081
235cfbc4
BS		 3082 case SAVE_EXPR:
3083 {
3084 struct tlist_cache *t;
3085 for (t = save_expr_cache; t; t = t->next)
1e4ae551 3086 if (candidate_equal_p (t->expr, x))
235cfbc4 3087 break;
2683ed8d 3088
3f75a254 3089 if (!t)
2683ed8d 3090 {
5d038c4c 3091 t = XOBNEW (&tlist_obstack, struct tlist_cache);
235cfbc4
BS		 3092 t->next = save_expr_cache;
3093 t->expr = x;
3094 save_expr_cache = t;
3095
3096 tmp_before = tmp_nosp = 0;
3097 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
3098 warn_for_collisions (tmp_nosp);
3099
3100 tmp_list3 = 0;
c2bf53a1 3101 merge_tlist (&tmp_list3, tmp_nosp, 0);
235cfbc4
BS		 3102 t->cache_before_sp = tmp_before;
3103 t->cache_after_sp = tmp_list3;
2683ed8d 3104 }
235cfbc4
BS		 3105 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
3106 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
3107 return;
3108 }
2683ed8d 3109
528c22f4
MLI		 3110 case ADDR_EXPR:
3111 x = TREE_OPERAND (x, 0);
3112 if (DECL_P (x))
3113 return;
3114 writer = 0;
3115 goto restart;
3116
6615c446
JO		 3117 default:
3118 /* For other expressions, simply recurse on their operands.
c22cacf3 3119 Manual tail recursion for unary expressions.
6615c446
JO		 3120 Other non-expressions need not be processed. */
3121 if (cl == tcc_unary)
3122 {
6615c446
JO		 3123 x = TREE_OPERAND (x, 0);
3124 writer = 0;
3125 goto restart;
3126 }
3127 else if (IS_EXPR_CODE_CLASS (cl))
3128 {
3129 int lp;
5039610b 3130 int max = TREE_OPERAND_LENGTH (x);
6615c446
JO		 3131 for (lp = 0; lp < max; lp++)
3132 {
3133 tmp_before = tmp_nosp = 0;
3134 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
3135 merge_tlist (&tmp_nosp, tmp_before, 0);
3136 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
3137 }
3138 }
3139 return;
2683ed8d 3140 }
2683ed8d
BS		 3141}
3142
8d9afc4e 3143/* Try to warn for undefined behavior in EXPR due to missing sequence
2683ed8d
BS		 3144 points. */
3145
24e47c76 3146DEBUG_FUNCTION void
35b1a6fa 3147verify_sequence_points (tree expr)
2683ed8d 3148{
235cfbc4 3149 struct tlist *before_sp = 0, *after_sp = 0;
2683ed8d 3150
235cfbc4
BS		 3151 warned_ids = 0;
3152 save_expr_cache = 0;
3153 if (tlist_firstobj == 0)
2683ed8d 3154 {
235cfbc4 3155 gcc_obstack_init (&tlist_obstack);
28dab132 3156 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
2683ed8d
BS		 3157 }
3158
235cfbc4
BS		 3159 verify_tree (expr, &before_sp, &after_sp, 0);
3160 warn_for_collisions (after_sp);
3161 obstack_free (&tlist_obstack, tlist_firstobj);
2683ed8d 3162}
b30f223b
RS		 3163\f
3164/* Validate the expression after `case' and apply default promotions. */
3165
a6c0a76c 3166static tree
62e4eb35 3167check_case_value (location_t loc, tree value)
b30f223b
RS		 3168{
3169 if (value == NULL_TREE)
3170 return value;
3171
522ddfa2
JM		 3172 if (TREE_CODE (value) == INTEGER_CST)
3173 /* Promote char or short to int. */
3174 value = perform_integral_promotions (value);
3175 else if (value != error_mark_node)
b30f223b 3176 {
62e4eb35 3177 error_at (loc, "case label does not reduce to an integer constant");
b30f223b
RS		 3178 value = error_mark_node;
3179 }
b30f223b 3180
bc690db1
RS		 3181 constant_expression_warning (value);
3182
b30f223b
RS		 3183 return value;
3184}
3185\f
a6c0a76c 3186/* See if the case values LOW and HIGH are in the range of the original
89dbed81 3187 type (i.e. before the default conversion to int) of the switch testing
a6c0a76c
SB		 3188 expression.
3189 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2a7e31df 3190 the type before promoting it. CASE_LOW_P is a pointer to the lower
a6c0a76c
SB		 3191 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3192 if the case is not a case range.
3193 The caller has to make sure that we are not called with NULL for
b155cfd9
MP		 3194 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3195 was a case value that doesn't fit into the range of the ORIG_TYPE.
0fa2e4df 3196 Returns true if the case label is in range of ORIG_TYPE (saturated or
a6c0a76c
SB		 3197 untouched) or false if the label is out of range. */
3198
3199static bool
9d548dfb 3200check_case_bounds (location_t loc, tree type, tree orig_type,
b155cfd9
MP		 3201 tree *case_low_p, tree *case_high_p,
3202 bool *outside_range_p)
a6c0a76c
SB		 3203{
3204 tree min_value, max_value;
3205 tree case_low = *case_low_p;
3206 tree case_high = case_high_p ? *case_high_p : case_low;
3207
3208 /* If there was a problem with the original type, do nothing. */
3209 if (orig_type == error_mark_node)
3210 return true;
3211
3212 min_value = TYPE_MIN_VALUE (orig_type);
3213 max_value = TYPE_MAX_VALUE (orig_type);
3214
0f62c7a0
MP		 3215 /* We'll really need integer constants here. */
3216 case_low = fold (case_low);
3217 case_high = fold (case_high);
3218
a6c0a76c
SB		 3219 /* Case label is less than minimum for type. */
3220 if (tree_int_cst_compare (case_low, min_value) < 0
3221 && tree_int_cst_compare (case_high, min_value) < 0)
3222 {
9d548dfb
MP		 3223 warning_at (loc, 0, "case label value is less than minimum value "
3224 "for type");
b155cfd9 3225 *outside_range_p = true;
a6c0a76c
SB		 3226 return false;
3227 }
9f63daea 3228
a6c0a76c
SB		 3229 /* Case value is greater than maximum for type. */
3230 if (tree_int_cst_compare (case_low, max_value) > 0
3231 && tree_int_cst_compare (case_high, max_value) > 0)
3232 {
9d548dfb 3233 warning_at (loc, 0, "case label value exceeds maximum value for type");
b155cfd9 3234 *outside_range_p = true;
a6c0a76c
SB		 3235 return false;
3236 }
3237
3238 /* Saturate lower case label value to minimum. */
3239 if (tree_int_cst_compare (case_high, min_value) >= 0
3240 && tree_int_cst_compare (case_low, min_value) < 0)
3241 {
9d548dfb
MP		 3242 warning_at (loc, 0, "lower value in case label range"
3243 " less than minimum value for type");
b155cfd9 3244 *outside_range_p = true;
a6c0a76c
SB		 3245 case_low = min_value;
3246 }
9f63daea 3247
a6c0a76c
SB		 3248 /* Saturate upper case label value to maximum. */
3249 if (tree_int_cst_compare (case_low, max_value) <= 0
3250 && tree_int_cst_compare (case_high, max_value) > 0)
3251 {
9d548dfb
MP		 3252 warning_at (loc, 0, "upper value in case label range"
3253 " exceeds maximum value for type");
b155cfd9 3254 *outside_range_p = true;
a6c0a76c
SB		 3255 case_high = max_value;
3256 }
3257
3258 if (*case_low_p != case_low)
3259 *case_low_p = convert (type, case_low);
3260 if (case_high_p && *case_high_p != case_high)
3261 *case_high_p = convert (type, case_high);
3262
3263 return true;
3264}
3265\f
b30f223b
RS		 3266/* Return an integer type with BITS bits of precision,
3267 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3268
3269tree
35b1a6fa 3270c_common_type_for_size (unsigned int bits, int unsignedp)
b30f223b 3271{
78a7c317
DD		 3272 int i;
3273
a311b52c
JM		 3274 if (bits == TYPE_PRECISION (integer_type_node))
3275 return unsignedp ? unsigned_type_node : integer_type_node;
3276
3fc7e390 3277 if (bits == TYPE_PRECISION (signed_char_type_node))
b30f223b
RS		 3278 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3279
3fc7e390 3280 if (bits == TYPE_PRECISION (short_integer_type_node))
b30f223b
RS		 3281 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3282
3fc7e390 3283 if (bits == TYPE_PRECISION (long_integer_type_node))
b30f223b
RS		 3284 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3285
3fc7e390 3286 if (bits == TYPE_PRECISION (long_long_integer_type_node))
b30f223b
RS		 3287 return (unsignedp ? long_long_unsigned_type_node
3288 : long_long_integer_type_node);
3289
78a7c317
DD		 3290 for (i = 0; i < NUM_INT_N_ENTS; i ++)
3291 if (int_n_enabled_p[i]
3292 && bits == int_n_data[i].bitsize)
3293 return (unsignedp ? int_n_trees[i].unsigned_type
3294 : int_n_trees[i].signed_type);
a6766312 3295
835f9b4d
GRK		 3296 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
3297 return (unsignedp ? widest_unsigned_literal_type_node
3298 : widest_integer_literal_type_node);
3299
3fc7e390
RS		 3300 if (bits <= TYPE_PRECISION (intQI_type_node))
3301 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3302
3303 if (bits <= TYPE_PRECISION (intHI_type_node))
3304 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3305
3306 if (bits <= TYPE_PRECISION (intSI_type_node))
3307 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3308
3309 if (bits <= TYPE_PRECISION (intDI_type_node))
3310 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3311
b30f223b
RS		 3312 return 0;
3313}
3314
ab22c1fa
CF		 3315/* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3316 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3317 and saturating if SATP is nonzero, otherwise not saturating. */
3318
3319tree
3320c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
3321 int unsignedp, int satp)
3322{
ef4bddc2 3323 machine_mode mode;
ab22c1fa
CF		 3324 if (ibit == 0)
3325 mode = unsignedp ? UQQmode : QQmode;
3326 else
3327 mode = unsignedp ? UHAmode : HAmode;
3328
3329 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
3330 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
3331 break;
3332
3333 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
3334 {
3335 sorry ("GCC cannot support operators with integer types and "
3336 "fixed-point types that have too many integral and "
3337 "fractional bits together");
3338 return 0;
3339 }
3340
3341 return c_common_type_for_mode (mode, satp);
3342}
3343
d1d3865f
ZW		 3344/* Used for communication between c_common_type_for_mode and
3345 c_register_builtin_type. */
793c625f 3346tree registered_builtin_types;
d1d3865f 3347
b30f223b
RS		 3348/* Return a data type that has machine mode MODE.
3349 If the mode is an integer,
ab22c1fa
CF		 3350 then UNSIGNEDP selects between signed and unsigned types.
3351 If the mode is a fixed-point mode,
3352 then UNSIGNEDP selects between saturating and nonsaturating types. */
b30f223b
RS		 3353
3354tree
ef4bddc2 3355c_common_type_for_mode (machine_mode mode, int unsignedp)
b30f223b 3356{
d1d3865f 3357 tree t;
78a7c317 3358 int i;
d1d3865f 3359
a311b52c
JM		 3360 if (mode == TYPE_MODE (integer_type_node))
3361 return unsignedp ? unsigned_type_node : integer_type_node;
3362
b30f223b
RS		 3363 if (mode == TYPE_MODE (signed_char_type_node))
3364 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3365
3366 if (mode == TYPE_MODE (short_integer_type_node))
3367 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3368
b30f223b
RS		 3369 if (mode == TYPE_MODE (long_integer_type_node))
3370 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3371
3372 if (mode == TYPE_MODE (long_long_integer_type_node))
3373 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
3374
78a7c317
DD		 3375 for (i = 0; i < NUM_INT_N_ENTS; i ++)
3376 if (int_n_enabled_p[i]
3377 && mode == int_n_data[i].m)
3378 return (unsignedp ? int_n_trees[i].unsigned_type
3379 : int_n_trees[i].signed_type);
a6766312 3380
835f9b4d 3381 if (mode == TYPE_MODE (widest_integer_literal_type_node))
d125d268 3382 return unsignedp ? widest_unsigned_literal_type_node
6de9cd9a 3383 : widest_integer_literal_type_node;
835f9b4d 3384
0afeef64 3385 if (mode == QImode)
3fc7e390
RS		 3386 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3387
0afeef64 3388 if (mode == HImode)
3fc7e390
RS		 3389 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3390
0afeef64 3391 if (mode == SImode)
3fc7e390
RS		 3392 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3393
0afeef64 3394 if (mode == DImode)
3fc7e390
RS		 3395 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3396
21a9616b 3397#if HOST_BITS_PER_WIDE_INT >= 64
a6d7e156
JL		 3398 if (mode == TYPE_MODE (intTI_type_node))
3399 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
21a9616b 3400#endif
a6d7e156 3401
b30f223b
RS		 3402 if (mode == TYPE_MODE (float_type_node))
3403 return float_type_node;
3404
3405 if (mode == TYPE_MODE (double_type_node))
3406 return double_type_node;
3407
3408 if (mode == TYPE_MODE (long_double_type_node))
3409 return long_double_type_node;
3410
ff42324e
NS		 3411 if (mode == TYPE_MODE (void_type_node))
3412 return void_type_node;
9f63daea 3413
b30f223b 3414 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
19b3ffbc
DD		 3415 return (unsignedp
3416 ? make_unsigned_type (GET_MODE_PRECISION (mode))
3417 : make_signed_type (GET_MODE_PRECISION (mode)));
b30f223b
RS		 3418
3419 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
19b3ffbc
DD		 3420 return (unsignedp
3421 ? make_unsigned_type (GET_MODE_PRECISION (mode))
3422 : make_signed_type (GET_MODE_PRECISION (mode)));
b30f223b 3423
7e7e470f
RH		 3424 if (COMPLEX_MODE_P (mode))
3425 {
ef4bddc2 3426 machine_mode inner_mode;
7e7e470f
RH		 3427 tree inner_type;
3428
3429 if (mode == TYPE_MODE (complex_float_type_node))
3430 return complex_float_type_node;
3431 if (mode == TYPE_MODE (complex_double_type_node))
3432 return complex_double_type_node;
3433 if (mode == TYPE_MODE (complex_long_double_type_node))
3434 return complex_long_double_type_node;
3435
3436 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
3437 return complex_integer_type_node;
3438
3439 inner_mode = GET_MODE_INNER (mode);
3440 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
3441 if (inner_type != NULL_TREE)
3442 return build_complex_type (inner_type);
3443 }
3444 else if (VECTOR_MODE_P (mode))
4a5eab38 3445 {
ef4bddc2 3446 machine_mode inner_mode = GET_MODE_INNER (mode);
4a5eab38
PB		 3447 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
3448 if (inner_type != NULL_TREE)
3449 return build_vector_type_for_mode (inner_type, mode);
0afeef64 3450 }
4061f623 3451
9a8ce21f
JG		 3452 if (mode == TYPE_MODE (dfloat32_type_node))
3453 return dfloat32_type_node;
3454 if (mode == TYPE_MODE (dfloat64_type_node))
3455 return dfloat64_type_node;
3456 if (mode == TYPE_MODE (dfloat128_type_node))
3457 return dfloat128_type_node;
3458
ab22c1fa
CF		 3459 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
3460 {
3461 if (mode == TYPE_MODE (short_fract_type_node))
3462 return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
3463 if (mode == TYPE_MODE (fract_type_node))
3464 return unsignedp ? sat_fract_type_node : fract_type_node;
3465 if (mode == TYPE_MODE (long_fract_type_node))
3466 return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
3467 if (mode == TYPE_MODE (long_long_fract_type_node))
3468 return unsignedp ? sat_long_long_fract_type_node
3469 : long_long_fract_type_node;
3470
3471 if (mode == TYPE_MODE (unsigned_short_fract_type_node))
3472 return unsignedp ? sat_unsigned_short_fract_type_node
3473 : unsigned_short_fract_type_node;
3474 if (mode == TYPE_MODE (unsigned_fract_type_node))
3475 return unsignedp ? sat_unsigned_fract_type_node
3476 : unsigned_fract_type_node;
3477 if (mode == TYPE_MODE (unsigned_long_fract_type_node))
3478 return unsignedp ? sat_unsigned_long_fract_type_node
3479 : unsigned_long_fract_type_node;
3480 if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
3481 return unsignedp ? sat_unsigned_long_long_fract_type_node
3482 : unsigned_long_long_fract_type_node;
3483
3484 if (mode == TYPE_MODE (short_accum_type_node))
3485 return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
3486 if (mode == TYPE_MODE (accum_type_node))
3487 return unsignedp ? sat_accum_type_node : accum_type_node;
3488 if (mode == TYPE_MODE (long_accum_type_node))
3489 return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
3490 if (mode == TYPE_MODE (long_long_accum_type_node))
3491 return unsignedp ? sat_long_long_accum_type_node
3492 : long_long_accum_type_node;
3493
3494 if (mode == TYPE_MODE (unsigned_short_accum_type_node))
3495 return unsignedp ? sat_unsigned_short_accum_type_node
3496 : unsigned_short_accum_type_node;
3497 if (mode == TYPE_MODE (unsigned_accum_type_node))
3498 return unsignedp ? sat_unsigned_accum_type_node
3499 : unsigned_accum_type_node;
3500 if (mode == TYPE_MODE (unsigned_long_accum_type_node))
3501 return unsignedp ? sat_unsigned_long_accum_type_node
3502 : unsigned_long_accum_type_node;
3503 if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
3504 return unsignedp ? sat_unsigned_long_long_accum_type_node
3505 : unsigned_long_long_accum_type_node;
3506
3507 if (mode == QQmode)
3508 return unsignedp ? sat_qq_type_node : qq_type_node;
3509 if (mode == HQmode)
3510 return unsignedp ? sat_hq_type_node : hq_type_node;
3511 if (mode == SQmode)
3512 return unsignedp ? sat_sq_type_node : sq_type_node;
3513 if (mode == DQmode)
3514 return unsignedp ? sat_dq_type_node : dq_type_node;
3515 if (mode == TQmode)
3516 return unsignedp ? sat_tq_type_node : tq_type_node;
3517
3518 if (mode == UQQmode)
3519 return unsignedp ? sat_uqq_type_node : uqq_type_node;
3520 if (mode == UHQmode)
3521 return unsignedp ? sat_uhq_type_node : uhq_type_node;
3522 if (mode == USQmode)
3523 return unsignedp ? sat_usq_type_node : usq_type_node;
3524 if (mode == UDQmode)
3525 return unsignedp ? sat_udq_type_node : udq_type_node;
3526 if (mode == UTQmode)
3527 return unsignedp ? sat_utq_type_node : utq_type_node;
3528
3529 if (mode == HAmode)
3530 return unsignedp ? sat_ha_type_node : ha_type_node;
3531 if (mode == SAmode)
3532 return unsignedp ? sat_sa_type_node : sa_type_node;
3533 if (mode == DAmode)
3534 return unsignedp ? sat_da_type_node : da_type_node;
3535 if (mode == TAmode)
3536 return unsignedp ? sat_ta_type_node : ta_type_node;
3537
3538 if (mode == UHAmode)
3539 return unsignedp ? sat_uha_type_node : uha_type_node;
3540 if (mode == USAmode)
3541 return unsignedp ? sat_usa_type_node : usa_type_node;
3542 if (mode == UDAmode)
3543 return unsignedp ? sat_uda_type_node : uda_type_node;
3544 if (mode == UTAmode)
3545 return unsignedp ? sat_uta_type_node : uta_type_node;
3546 }
3547
d1d3865f 3548 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
7a421706
MS		 3549 if (TYPE_MODE (TREE_VALUE (t)) == mode
3550 && !!unsignedp == !!TYPE_UNSIGNED (TREE_VALUE (t)))
d1d3865f
ZW		 3551 return TREE_VALUE (t);
3552
b30f223b
RS		 3553 return 0;
3554}
693a6128 3555
12753674
RE		 3556tree
3557c_common_unsigned_type (tree type)
3558{
3559 return c_common_signed_or_unsigned_type (1, type);
3560}
3561
693a6128
GRK		 3562/* Return a signed type the same as TYPE in other respects. */
3563
3564tree
35b1a6fa 3565c_common_signed_type (tree type)
693a6128 3566{
ceef8ce4 3567 return c_common_signed_or_unsigned_type (0, type);
693a6128
GRK		 3568}
3569
3570/* Return a type the same as TYPE except unsigned or
3571 signed according to UNSIGNEDP. */
3572
3573tree
35b1a6fa 3574c_common_signed_or_unsigned_type (int unsignedp, tree type)
693a6128 3575{
c74a03d2 3576 tree type1;
78a7c317 3577 int i;
693a6128 3578
c74a03d2
RAE		 3579 /* This block of code emulates the behavior of the old
3580 c_common_unsigned_type. In particular, it returns
3581 long_unsigned_type_node if passed a long, even when a int would
3582 have the same size. This is necessary for warnings to work
3583 correctly in archs where sizeof(int) == sizeof(long) */
3584
3585 type1 = TYPE_MAIN_VARIANT (type);
3586 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3587 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3588 if (type1 == integer_type_node || type1 == unsigned_type_node)
3589 return unsignedp ? unsigned_type_node : integer_type_node;
3590 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
3591 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3592 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
3593 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3594 if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
3595 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
78a7c317
DD		 3596
3597 for (i = 0; i < NUM_INT_N_ENTS; i ++)
3598 if (int_n_enabled_p[i]
3599 && (type1 == int_n_trees[i].unsigned_type
3600 || type1 == int_n_trees[i].signed_type))
3601 return (unsignedp ? int_n_trees[i].unsigned_type
3602 : int_n_trees[i].signed_type);
3603
c74a03d2
RAE		 3604 if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
3605 return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
3606#if HOST_BITS_PER_WIDE_INT >= 64
3607 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
3608 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3609#endif
3610 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
3611 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3612 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
3613 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3614 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
3615 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3616 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
3617 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3618
70d3fcab
AH		 3619#define C_COMMON_FIXED_TYPES(NAME) \
3620 if (type1 == short_ ## NAME ## _type_node \
3621 || type1 == unsigned_short_ ## NAME ## _type_node) \
3622 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3623 : short_ ## NAME ## _type_node; \
3624 if (type1 == NAME ## _type_node \
3625 || type1 == unsigned_ ## NAME ## _type_node) \
3626 return unsignedp ? unsigned_ ## NAME ## _type_node \
3627 : NAME ## _type_node; \
3628 if (type1 == long_ ## NAME ## _type_node \
3629 || type1 == unsigned_long_ ## NAME ## _type_node) \
3630 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3631 : long_ ## NAME ## _type_node; \
3632 if (type1 == long_long_ ## NAME ## _type_node \
3633 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3634 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3635 : long_long_ ## NAME ## _type_node;
3636
3637#define C_COMMON_FIXED_MODE_TYPES(NAME) \
3638 if (type1 == NAME ## _type_node \
3639 || type1 == u ## NAME ## _type_node) \
3640 return unsignedp ? u ## NAME ## _type_node \
3641 : NAME ## _type_node;
3642
3643#define C_COMMON_FIXED_TYPES_SAT(NAME) \
3644 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3645 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3646 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3647 : sat_ ## short_ ## NAME ## _type_node; \
3648 if (type1 == sat_ ## NAME ## _type_node \
3649 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3650 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3651 : sat_ ## NAME ## _type_node; \
3652 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3653 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3654 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3655 : sat_ ## long_ ## NAME ## _type_node; \
3656 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3657 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3658 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3659 : sat_ ## long_long_ ## NAME ## _type_node;
3660
3661#define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3662 if (type1 == sat_ ## NAME ## _type_node \
3663 || type1 == sat_ ## u ## NAME ## _type_node) \
3664 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3665 : sat_ ## NAME ## _type_node;
3666
3667 C_COMMON_FIXED_TYPES (fract);
3668 C_COMMON_FIXED_TYPES_SAT (fract);
3669 C_COMMON_FIXED_TYPES (accum);
3670 C_COMMON_FIXED_TYPES_SAT (accum);
3671
3672 C_COMMON_FIXED_MODE_TYPES (qq);
3673 C_COMMON_FIXED_MODE_TYPES (hq);
3674 C_COMMON_FIXED_MODE_TYPES (sq);
3675 C_COMMON_FIXED_MODE_TYPES (dq);
3676 C_COMMON_FIXED_MODE_TYPES (tq);
3677 C_COMMON_FIXED_MODE_TYPES_SAT (qq);
3678 C_COMMON_FIXED_MODE_TYPES_SAT (hq);
3679 C_COMMON_FIXED_MODE_TYPES_SAT (sq);
3680 C_COMMON_FIXED_MODE_TYPES_SAT (dq);
3681 C_COMMON_FIXED_MODE_TYPES_SAT (tq);
3682 C_COMMON_FIXED_MODE_TYPES (ha);
3683 C_COMMON_FIXED_MODE_TYPES (sa);
3684 C_COMMON_FIXED_MODE_TYPES (da);
3685 C_COMMON_FIXED_MODE_TYPES (ta);
3686 C_COMMON_FIXED_MODE_TYPES_SAT (ha);
3687 C_COMMON_FIXED_MODE_TYPES_SAT (sa);
3688 C_COMMON_FIXED_MODE_TYPES_SAT (da);
3689 C_COMMON_FIXED_MODE_TYPES_SAT (ta);
ab22c1fa 3690
bc15d0ef
JM		 3691 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3692 the precision; they have precision set to match their range, but
3693 may use a wider mode to match an ABI. If we change modes, we may
3694 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3695 the precision as well, so as to yield correct results for
3696 bit-field types. C++ does not have these separate bit-field
3697 types, and producing a signed or unsigned variant of an
3698 ENUMERAL_TYPE may cause other problems as well. */
3699
1e204133
RAE		 3700 if (!INTEGRAL_TYPE_P (type)
3701 || TYPE_UNSIGNED (type) == unsignedp)
3702 return type;
3703
bc15d0ef
JM		 3704#define TYPE_OK(node) \
3705 (TYPE_MODE (type) == TYPE_MODE (node) \
41b81065 3706 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
bc15d0ef 3707 if (TYPE_OK (signed_char_type_node))
693a6128 3708 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
bc15d0ef 3709 if (TYPE_OK (integer_type_node))
693a6128 3710 return unsignedp ? unsigned_type_node : integer_type_node;
bc15d0ef 3711 if (TYPE_OK (short_integer_type_node))
693a6128 3712 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
bc15d0ef 3713 if (TYPE_OK (long_integer_type_node))
693a6128 3714 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
bc15d0ef 3715 if (TYPE_OK (long_long_integer_type_node))
693a6128
GRK		 3716 return (unsignedp ? long_long_unsigned_type_node
3717 : long_long_integer_type_node);
78a7c317
DD		 3718
3719 for (i = 0; i < NUM_INT_N_ENTS; i ++)
3720 if (int_n_enabled_p[i]
3721 && TYPE_MODE (type) == int_n_data[i].m
3722 && TYPE_PRECISION (type) == int_n_data[i].bitsize)
3723 return (unsignedp ? int_n_trees[i].unsigned_type
3724 : int_n_trees[i].signed_type);
3725
bc15d0ef 3726 if (TYPE_OK (widest_integer_literal_type_node))
693a6128
GRK		 3727 return (unsignedp ? widest_unsigned_literal_type_node
3728 : widest_integer_literal_type_node);
4a063bec
RH		 3729
3730#if HOST_BITS_PER_WIDE_INT >= 64
bc15d0ef 3731 if (TYPE_OK (intTI_type_node))
4a063bec
RH		 3732 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3733#endif
bc15d0ef 3734 if (TYPE_OK (intDI_type_node))
4a063bec 3735 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
bc15d0ef 3736 if (TYPE_OK (intSI_type_node))
4a063bec 3737 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
bc15d0ef 3738 if (TYPE_OK (intHI_type_node))
4a063bec 3739 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
bc15d0ef 3740 if (TYPE_OK (intQI_type_node))
4a063bec 3741 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
bc15d0ef 3742#undef TYPE_OK
4a063bec 3743
41b81065 3744 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
693a6128 3745}
9649812a 3746
38a4afee
MM		 3747/* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3748
3749tree
3750c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
3751{
78a7c317
DD		 3752 int i;
3753
38a4afee
MM		 3754 /* Extended integer types of the same width as a standard type have
3755 lesser rank, so those of the same width as int promote to int or
3756 unsigned int and are valid for printf formats expecting int or
3757 unsigned int. To avoid such special cases, avoid creating
3758 extended integer types for bit-fields if a standard integer type
3759 is available. */
3760 if (width == TYPE_PRECISION (integer_type_node))
3761 return unsignedp ? unsigned_type_node : integer_type_node;
3762 if (width == TYPE_PRECISION (signed_char_type_node))
3763 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3764 if (width == TYPE_PRECISION (short_integer_type_node))
3765 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3766 if (width == TYPE_PRECISION (long_integer_type_node))
3767 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3768 if (width == TYPE_PRECISION (long_long_integer_type_node))
3769 return (unsignedp ? long_long_unsigned_type_node
3770 : long_long_integer_type_node);
78a7c317
DD		 3771 for (i = 0; i < NUM_INT_N_ENTS; i ++)
3772 if (int_n_enabled_p[i]
3773 && width == int_n_data[i].bitsize)
3774 return (unsignedp ? int_n_trees[i].unsigned_type
3775 : int_n_trees[i].signed_type);
38a4afee
MM		 3776 return build_nonstandard_integer_type (width, unsignedp);
3777}
3778
9649812a
MM		 3779/* The C version of the register_builtin_type langhook. */
3780
3781void
3782c_register_builtin_type (tree type, const char* name)
3783{
3784 tree decl;
3785
c2255bc4
AH		 3786 decl = build_decl (UNKNOWN_LOCATION,
3787 TYPE_DECL, get_identifier (name), type);
9649812a
MM		 3788 DECL_ARTIFICIAL (decl) = 1;
3789 if (!TYPE_NAME (type))
3790 TYPE_NAME (type) = decl;
3791 pushdecl (decl);
d1d3865f
ZW		 3792
3793 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
9649812a 3794}
6acfe908 3795\f
78ef5b89 3796/* Print an error message for invalid operands to arith operation
ba47d38d 3797 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
745e411d
DM		 3798 RICHLOC is a rich location for the message, containing either
3799 three separate locations for each of the operator and operands
3800
3801 lhs op rhs
3802 ~~~ ^~ ~~~
3803
3804 (C FE), or one location ranging over all over them
3805
3806 lhs op rhs
3807 ~~~~^~~~~~
3808
3809 (C++ FE). */
b30f223b
RS		 3810
3811void
745e411d 3812binary_op_error (rich_location *richloc, enum tree_code code,
ba47d38d 3813 tree type0, tree type1)
b30f223b 3814{
b3694847 3815 const char *opname;
89c78d7d 3816
b30f223b
RS		 3817 switch (code)
3818 {
b30f223b
RS		 3819 case PLUS_EXPR:
3820 opname = "+"; break;
3821 case MINUS_EXPR:
3822 opname = "-"; break;
3823 case MULT_EXPR:
3824 opname = "*"; break;
3825 case MAX_EXPR:
3826 opname = "max"; break;
3827 case MIN_EXPR:
3828 opname = "min"; break;
3829 case EQ_EXPR:
3830 opname = "=="; break;
3831 case NE_EXPR:
3832 opname = "!="; break;
3833 case LE_EXPR:
3834 opname = "<="; break;
3835 case GE_EXPR:
3836 opname = ">="; break;
3837 case LT_EXPR:
3838 opname = "<"; break;
3839 case GT_EXPR:
3840 opname = ">"; break;
3841 case LSHIFT_EXPR:
3842 opname = "<<"; break;
3843 case RSHIFT_EXPR:
3844 opname = ">>"; break;
3845 case TRUNC_MOD_EXPR:
047de90b 3846 case FLOOR_MOD_EXPR:
b30f223b
RS		 3847 opname = "%"; break;
3848 case TRUNC_DIV_EXPR:
047de90b 3849 case FLOOR_DIV_EXPR:
b30f223b
RS		 3850 opname = "/"; break;
3851 case BIT_AND_EXPR:
3852 opname = "&"; break;
3853 case BIT_IOR_EXPR:
3854 opname = "|"; break;
3855 case TRUTH_ANDIF_EXPR:
3856 opname = "&&"; break;
3857 case TRUTH_ORIF_EXPR:
3858 opname = "||"; break;
3859 case BIT_XOR_EXPR:
3860 opname = "^"; break;
6d819282 3861 default:
37b2f290 3862 gcc_unreachable ();
b30f223b 3863 }
745e411d
DM		 3864 error_at_rich_loc (richloc,
3865 "invalid operands to binary %s (have %qT and %qT)",
3866 opname, type0, type1);
b30f223b
RS		 3867}
3868\f
50f305ca
MLI		 3869/* Given an expression as a tree, return its original type. Do this
3870 by stripping any conversion that preserves the sign and precision. */
3871static tree
3872expr_original_type (tree expr)
3873{
3874 STRIP_SIGN_NOPS (expr);
3875 return TREE_TYPE (expr);
3876}
3877
b30f223b
RS		 3878/* Subroutine of build_binary_op, used for comparison operations.
3879 See if the operands have both been converted from subword integer types
3880 and, if so, perhaps change them both back to their original type.
94dccd9d
RS		 3881 This function is also responsible for converting the two operands
3882 to the proper common type for comparison.
b30f223b
RS		 3883
3884 The arguments of this function are all pointers to local variables
3885 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3886 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3887
393e8e8b
MP		 3888 LOC is the location of the comparison.
3889
b30f223b
RS		 3890 If this function returns nonzero, it means that the comparison has
3891 a constant value. What this function returns is an expression for
3892 that value. */
3893
3894tree
393e8e8b
MP		 3895shorten_compare (location_t loc, tree *op0_ptr, tree *op1_ptr,
3896 tree *restype_ptr, enum tree_code *rescode_ptr)
b30f223b 3897{
b3694847 3898 tree type;
b30f223b
RS		 3899 tree op0 = *op0_ptr;
3900 tree op1 = *op1_ptr;
3901 int unsignedp0, unsignedp1;
3902 int real1, real2;
3903 tree primop0, primop1;
3904 enum tree_code code = *rescode_ptr;
3905
3906 /* Throw away any conversions to wider types
3907 already present in the operands. */
3908
828fb3ba
JM		 3909 primop0 = c_common_get_narrower (op0, &unsignedp0);
3910 primop1 = c_common_get_narrower (op1, &unsignedp1);
b30f223b 3911
126e6609
JJ		 3912 /* If primopN is first sign-extended from primopN's precision to opN's
3913 precision, then zero-extended from opN's precision to
3914 *restype_ptr precision, shortenings might be invalid. */
3915 if (TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (TREE_TYPE (op0))
3916 && TYPE_PRECISION (TREE_TYPE (op0)) < TYPE_PRECISION (*restype_ptr)
3917 && !unsignedp0
3918 && TYPE_UNSIGNED (TREE_TYPE (op0)))
3919 primop0 = op0;
3920 if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1))
3921 && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr)
3922 && !unsignedp1
3923 && TYPE_UNSIGNED (TREE_TYPE (op1)))
3924 primop1 = op1;
3925
b30f223b
RS		 3926 /* Handle the case that OP0 does not *contain* a conversion
3927 but it *requires* conversion to FINAL_TYPE. */
3928
3929 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
8df83eae 3930 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
b30f223b 3931 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
8df83eae 3932 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
b30f223b
RS		 3933
3934 /* If one of the operands must be floated, we cannot optimize. */
3935 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
3936 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
3937
3938 /* If first arg is constant, swap the args (changing operation
5af6001b
RK		 3939 so value is preserved), for canonicalization. Don't do this if
3940 the second arg is 0. */
b30f223b 3941
5af6001b 3942 if (TREE_CONSTANT (primop0)
ab22c1fa
CF		 3943 && !integer_zerop (primop1) && !real_zerop (primop1)
3944 && !fixed_zerop (primop1))
b30f223b 3945 {
fab27f52
MM		 3946 std::swap (primop0, primop1);
3947 std::swap (op0, op1);
b30f223b
RS		 3948 *op0_ptr = op0;
3949 *op1_ptr = op1;
fab27f52
MM		 3950 std::swap (unsignedp0, unsignedp1);
3951 std::swap (real1, real2);
b30f223b
RS		 3952
3953 switch (code)
3954 {
3955 case LT_EXPR:
3956 code = GT_EXPR;
3957 break;
3958 case GT_EXPR:
3959 code = LT_EXPR;
3960 break;
3961 case LE_EXPR:
3962 code = GE_EXPR;
3963 break;
3964 case GE_EXPR:
3965 code = LE_EXPR;
3966 break;
6d819282
MK		 3967 default:
3968 break;
b30f223b
RS		 3969 }
3970 *rescode_ptr = code;
3971 }
3972
3973 /* If comparing an integer against a constant more bits wide,
3974 maybe we can deduce a value of 1 or 0 independent of the data.
3975 Or else truncate the constant now
3976 rather than extend the variable at run time.
3977
3978 This is only interesting if the constant is the wider arg.
3979 Also, it is not safe if the constant is unsigned and the
3980 variable arg is signed, since in this case the variable
3981 would be sign-extended and then regarded as unsigned.
3982 Our technique fails in this case because the lowest/highest
3983 possible unsigned results don't follow naturally from the
3984 lowest/highest possible values of the variable operand.
3985 For just EQ_EXPR and NE_EXPR there is another technique that
3986 could be used: see if the constant can be faithfully represented
3987 in the other operand's type, by truncating it and reextending it
3988 and see if that preserves the constant's value. */
3989
3990 if (!real1 && !real2
ab22c1fa 3991 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
b30f223b
RS		 3992 && TREE_CODE (primop1) == INTEGER_CST
3993 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
3994 {
3995 int min_gt, max_gt, min_lt, max_lt;
3996 tree maxval, minval;
3997 /* 1 if comparison is nominally unsigned. */
8df83eae 3998 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
b30f223b
RS		 3999 tree val;
4000
ceef8ce4
NB		 4001 type = c_common_signed_or_unsigned_type (unsignedp0,
4002 TREE_TYPE (primop0));
8bbd5685 4003
b30f223b
RS		 4004 maxval = TYPE_MAX_VALUE (type);
4005 minval = TYPE_MIN_VALUE (type);
4006
4007 if (unsignedp && !unsignedp0)
ceef8ce4 4008 *restype_ptr = c_common_signed_type (*restype_ptr);
b30f223b
RS		 4009
4010 if (TREE_TYPE (primop1) != *restype_ptr)
fae1b38d 4011 {
af9c6659
NS		 4012 /* Convert primop1 to target type, but do not introduce
4013 additional overflow. We know primop1 is an int_cst. */
807e902e 4014 primop1 = force_fit_type (*restype_ptr,
697e0b28
RS		 4015 wi::to_wide
4016 (primop1,
4017 TYPE_PRECISION (*restype_ptr)),
807e902e 4018 0, TREE_OVERFLOW (primop1));
fae1b38d 4019 }
b30f223b
RS		 4020 if (type != *restype_ptr)
4021 {
4022 minval = convert (*restype_ptr, minval);
4023 maxval = convert (*restype_ptr, maxval);
4024 }
4025
807e902e
KZ		 4026 min_gt = tree_int_cst_lt (primop1, minval);
4027 max_gt = tree_int_cst_lt (primop1, maxval);
4028 min_lt = tree_int_cst_lt (minval, primop1);
4029 max_lt = tree_int_cst_lt (maxval, primop1);
b30f223b
RS		 4030
4031 val = 0;
4032 /* This used to be a switch, but Genix compiler can't handle that. */
4033 if (code == NE_EXPR)
4034 {
4035 if (max_lt || min_gt)
de7df9eb 4036 val = truthvalue_true_node;
b30f223b
RS		 4037 }
4038 else if (code == EQ_EXPR)
4039 {
4040 if (max_lt || min_gt)
de7df9eb 4041 val = truthvalue_false_node;
b30f223b
RS		 4042 }
4043 else if (code == LT_EXPR)
4044 {
4045 if (max_lt)
de7df9eb 4046 val = truthvalue_true_node;
b30f223b 4047 if (!min_lt)
de7df9eb 4048 val = truthvalue_false_node;
b30f223b
RS		 4049 }
4050 else if (code == GT_EXPR)
4051 {
4052 if (min_gt)
de7df9eb 4053 val = truthvalue_true_node;
b30f223b 4054 if (!max_gt)
de7df9eb 4055 val = truthvalue_false_node;
b30f223b
RS		 4056 }
4057 else if (code == LE_EXPR)
4058 {
4059 if (!max_gt)
de7df9eb 4060 val = truthvalue_true_node;
b30f223b 4061 if (min_gt)
de7df9eb 4062 val = truthvalue_false_node;
b30f223b
RS		 4063 }
4064 else if (code == GE_EXPR)
4065 {
4066 if (!min_lt)
de7df9eb 4067 val = truthvalue_true_node;
b30f223b 4068 if (max_lt)
de7df9eb 4069 val = truthvalue_false_node;
b30f223b
RS		 4070 }
4071
4072 /* If primop0 was sign-extended and unsigned comparison specd,
4073 we did a signed comparison above using the signed type bounds.
4074 But the comparison we output must be unsigned.
4075
4076 Also, for inequalities, VAL is no good; but if the signed
4077 comparison had *any* fixed result, it follows that the
4078 unsigned comparison just tests the sign in reverse
4079 (positive values are LE, negative ones GE).
4080 So we can generate an unsigned comparison
4081 against an extreme value of the signed type. */
4082
4083 if (unsignedp && !unsignedp0)
4084 {
4085 if (val != 0)
4086 switch (code)
4087 {
4088 case LT_EXPR:
4089 case GE_EXPR:
4090 primop1 = TYPE_MIN_VALUE (type);
4091 val = 0;
4092 break;
4093
4094 case LE_EXPR:
4095 case GT_EXPR:
4096 primop1 = TYPE_MAX_VALUE (type);
4097 val = 0;
4098 break;
6d819282
MK		 4099
4100 default:
4101 break;
b30f223b 4102 }
12753674 4103 type = c_common_unsigned_type (type);
b30f223b
RS		 4104 }
4105
d0eccfcd 4106 if (TREE_CODE (primop0) != INTEGER_CST
269adb9d
JM		 4107 /* Don't warn if it's from a (non-system) macro. */
4108 && !(from_macro_expansion_at
4109 (expansion_point_location_if_in_system_header
4110 (EXPR_LOCATION (primop0)))))
b30f223b 4111 {
de7df9eb 4112 if (val == truthvalue_false_node)
50f305ca
MLI		 4113 warning_at (loc, OPT_Wtype_limits,
4114 "comparison is always false due to limited range of data type");
de7df9eb 4115 if (val == truthvalue_true_node)
50f305ca
MLI		 4116 warning_at (loc, OPT_Wtype_limits,
4117 "comparison is always true due to limited range of data type");
b30f223b
RS		 4118 }
4119
4120 if (val != 0)
4121 {
4122 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4123 if (TREE_SIDE_EFFECTS (primop0))
53fb4de3 4124 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
b30f223b
RS		 4125 return val;
4126 }
4127
4128 /* Value is not predetermined, but do the comparison
4129 in the type of the operand that is not constant.
4130 TYPE is already properly set. */
4131 }
9a8ce21f
JG		 4132
4133 /* If either arg is decimal float and the other is float, find the
4134 proper common type to use for comparison. */
6f450181
RB		 4135 else if (real1 && real2
4136 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4137 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))
4138 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
4139
4140 /* If either arg is decimal float and the other is float, fail. */
9a8ce21f
JG		 4141 else if (real1 && real2
4142 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4143 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
6f450181 4144 return 0;
9a8ce21f 4145
b30f223b 4146 else if (real1 && real2
766f6c30
RS		 4147 && (TYPE_PRECISION (TREE_TYPE (primop0))
4148 == TYPE_PRECISION (TREE_TYPE (primop1))))
b30f223b
RS		 4149 type = TREE_TYPE (primop0);
4150
4151 /* If args' natural types are both narrower than nominal type
4152 and both extend in the same manner, compare them
4153 in the type of the wider arg.
4154 Otherwise must actually extend both to the nominal
4155 common type lest different ways of extending
4156 alter the result.
4157 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4158
4159 else if (unsignedp0 == unsignedp1 && real1 == real2
4160 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
4161 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
4162 {
4163 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
ceef8ce4 4164 type = c_common_signed_or_unsigned_type (unsignedp0
8df83eae 4165 || TYPE_UNSIGNED (*restype_ptr),
ceef8ce4 4166 type);
b30f223b
RS		 4167 /* Make sure shorter operand is extended the right way
4168 to match the longer operand. */
ceef8ce4
NB		 4169 primop0
4170 = convert (c_common_signed_or_unsigned_type (unsignedp0,
4171 TREE_TYPE (primop0)),
4172 primop0);
4173 primop1
4174 = convert (c_common_signed_or_unsigned_type (unsignedp1,
4175 TREE_TYPE (primop1)),
4176 primop1);
b30f223b
RS		 4177 }
4178 else
4179 {
4180 /* Here we must do the comparison on the nominal type
4181 using the args exactly as we received them. */
4182 type = *restype_ptr;
4183 primop0 = op0;
4184 primop1 = op1;
4185
4186 if (!real1 && !real2 && integer_zerop (primop1)
8df83eae 4187 && TYPE_UNSIGNED (*restype_ptr))
b30f223b
RS		 4188 {
4189 tree value = 0;
50f305ca
MLI		 4190 /* All unsigned values are >= 0, so we warn. However,
4191 if OP0 is a constant that is >= 0, the signedness of
4192 the comparison isn't an issue, so suppress the
4193 warning. */
4194 bool warn =
8400e75e 4195 warn_type_limits && !in_system_header_at (loc)
50f305ca
MLI		 4196 && !(TREE_CODE (primop0) == INTEGER_CST
4197 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
4198 primop0)))
4199 /* Do not warn for enumeration types. */
4200 && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE);
4201
b30f223b
RS		 4202 switch (code)
4203 {
4204 case GE_EXPR:
50f305ca
MLI		 4205 if (warn)
4206 warning_at (loc, OPT_Wtype_limits,
4207 "comparison of unsigned expression >= 0 is always true");
de7df9eb 4208 value = truthvalue_true_node;
b30f223b
RS		 4209 break;
4210
4211 case LT_EXPR:
50f305ca
MLI		 4212 if (warn)
4213 warning_at (loc, OPT_Wtype_limits,
4214 "comparison of unsigned expression < 0 is always false");
de7df9eb 4215 value = truthvalue_false_node;
6d819282
MK		 4216 break;
4217
4218 default:
4219 break;
b30f223b
RS		 4220 }
4221
4222 if (value != 0)
4223 {
4224 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4225 if (TREE_SIDE_EFFECTS (primop0))
53fb4de3
RS		 4226 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
4227 primop0, value);
b30f223b
RS		 4228 return value;
4229 }
4230 }
4231 }
4232
4233 *op0_ptr = convert (type, primop0);
4234 *op1_ptr = convert (type, primop1);
4235
de7df9eb 4236 *restype_ptr = truthvalue_type_node;
b30f223b
RS		 4237
4238 return 0;
4239}
4240\f
7552da58
JJ		 4241/* Return a tree for the sum or difference (RESULTCODE says which)
4242 of pointer PTROP and integer INTOP. */
4243
4244tree
db3927fb 4245pointer_int_sum (location_t loc, enum tree_code resultcode,
fd9b0f32 4246 tree ptrop, tree intop, bool complain)
7552da58 4247{
6ac01510 4248 tree size_exp, ret;
7552da58 4249
7552da58 4250 /* The result is a pointer of the same type that is being added. */
7552da58
JJ		 4251 tree result_type = TREE_TYPE (ptrop);
4252
4253 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
4254 {
fd9b0f32
PC		 4255 if (complain && warn_pointer_arith)
4256 pedwarn (loc, OPT_Wpointer_arith,
4257 "pointer of type %<void *%> used in arithmetic");
4258 else if (!complain)
4259 return error_mark_node;
7552da58
JJ		 4260 size_exp = integer_one_node;
4261 }
4262 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
4263 {
fd9b0f32
PC		 4264 if (complain && warn_pointer_arith)
4265 pedwarn (loc, OPT_Wpointer_arith,
4266 "pointer to a function used in arithmetic");
4267 else if (!complain)
4268 return error_mark_node;
7552da58
JJ		 4269 size_exp = integer_one_node;
4270 }
7552da58 4271 else
4f2e1536 4272 size_exp = size_in_bytes_loc (loc, TREE_TYPE (result_type));
7552da58 4273
6ac01510
ILT		 4274 /* We are manipulating pointer values, so we don't need to warn
4275 about relying on undefined signed overflow. We disable the
4276 warning here because we use integer types so fold won't know that
4277 they are really pointers. */
4278 fold_defer_overflow_warnings ();
4279
7552da58
JJ		 4280 /* If what we are about to multiply by the size of the elements
4281 contains a constant term, apply distributive law
4282 and multiply that constant term separately.
4283 This helps produce common subexpressions. */
7552da58 4284 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
3f75a254 4285 && !TREE_CONSTANT (intop)
7552da58
JJ		 4286 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
4287 && TREE_CONSTANT (size_exp)
4288 /* If the constant comes from pointer subtraction,
4289 skip this optimization--it would cause an error. */
4290 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
4291 /* If the constant is unsigned, and smaller than the pointer size,
4292 then we must skip this optimization. This is because it could cause
4293 an overflow error if the constant is negative but INTOP is not. */
3f75a254 4294 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
7552da58
JJ		 4295 || (TYPE_PRECISION (TREE_TYPE (intop))
4296 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
4297 {
4298 enum tree_code subcode = resultcode;
4299 tree int_type = TREE_TYPE (intop);
4300 if (TREE_CODE (intop) == MINUS_EXPR)
4301 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
4302 /* Convert both subexpression types to the type of intop,
4303 because weird cases involving pointer arithmetic
4304 can result in a sum or difference with different type args. */
ba47d38d
AH		 4305 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
4306 subcode, ptrop,
7552da58
JJ		 4307 convert (int_type, TREE_OPERAND (intop, 1)), 1);
4308 intop = convert (int_type, TREE_OPERAND (intop, 0));
4309 }
4310
4311 /* Convert the integer argument to a type the same size as sizetype
4312 so the multiply won't overflow spuriously. */
7552da58 4313 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
8df83eae 4314 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
35b1a6fa 4315 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
8df83eae 4316 TYPE_UNSIGNED (sizetype)), intop);
7552da58
JJ		 4317
4318 /* Replace the integer argument with a suitable product by the object size.
9e9ef331 4319 Do this multiplication as signed, then convert to the appropriate type
65de6659 4320 for the pointer operation and disregard an overflow that occurred only
9e9ef331
EB		 4321 because of the sign-extension change in the latter conversion. */
4322 {
d90ec4f2
JM		 4323 tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop,
4324 convert (TREE_TYPE (intop), size_exp));
9e9ef331
EB		 4325 intop = convert (sizetype, t);
4326 if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
807e902e 4327 intop = wide_int_to_tree (TREE_TYPE (intop), intop);
9e9ef331 4328 }
5be014d5 4329
280f1ffa 4330 /* Create the sum or difference. */
5be014d5 4331 if (resultcode == MINUS_EXPR)
db3927fb 4332 intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
7552da58 4333
5d49b6a7 4334 ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
6ac01510
ILT		 4335
4336 fold_undefer_and_ignore_overflow_warnings ();
4337
4338 return ret;
7552da58
JJ		 4339}
4340\f
e5a94231
JM		 4341/* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4342 and if NON_CONST is known not to be permitted in an evaluated part
4343 of a constant expression. */
4344
4345tree
4346c_wrap_maybe_const (tree expr, bool non_const)
4347{
4348 bool nowarning = TREE_NO_WARNING (expr);
4349 location_t loc = EXPR_LOCATION (expr);
4350
4351 /* This should never be called for C++. */
4352 if (c_dialect_cxx ())
4353 gcc_unreachable ();
4354
4355 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4356 STRIP_TYPE_NOPS (expr);
4357 expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
4358 C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
4359 if (nowarning)
4360 TREE_NO_WARNING (expr) = 1;
4361 protected_set_expr_location (expr, loc);
4362
4363 return expr;
4364}
4365
928c19bb
JM		 4366/* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4367 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4368 around the SAVE_EXPR if needed so that c_fully_fold does not need
4369 to look inside SAVE_EXPRs. */
4370
4371tree
4372c_save_expr (tree expr)
4373{
4374 bool maybe_const = true;
4375 if (c_dialect_cxx ())
4376 return save_expr (expr);
4377 expr = c_fully_fold (expr, false, &maybe_const);
4378 expr = save_expr (expr);
4379 if (!maybe_const)
e5a94231 4380 expr = c_wrap_maybe_const (expr, true);
928c19bb
JM		 4381 return expr;
4382}
4383
b3c6d2ea
ILT		 4384/* Return whether EXPR is a declaration whose address can never be
4385 NULL. */
4386
4387bool
58f9752a 4388decl_with_nonnull_addr_p (const_tree expr)
b3c6d2ea
ILT		 4389{
4390 return (DECL_P (expr)
4391 && (TREE_CODE (expr) == PARM_DECL
4392 || TREE_CODE (expr) == LABEL_DECL
4393 || !DECL_WEAK (expr)));
4394}
4395
b30f223b 4396/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
85498824
JM		 4397 or for an `if' or `while' statement or ?..: exp. It should already
4398 have been validated to be of suitable type; otherwise, a bad
4399 diagnostic may result.
b30f223b 4400
ba47d38d
AH		 4401 The EXPR is located at LOCATION.
4402
b30f223b
RS		 4403 This preparation consists of taking the ordinary
4404 representation of an expression expr and producing a valid tree
4405 boolean expression describing whether expr is nonzero. We could
de7df9eb 4406 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
b30f223b
RS		 4407 but we optimize comparisons, &&, ||, and !.
4408
de7df9eb 4409 The resulting type should always be `truthvalue_type_node'. */
b30f223b
RS		 4410
4411tree
ba47d38d 4412c_common_truthvalue_conversion (location_t location, tree expr)
b30f223b 4413{
b30f223b
RS		 4414 switch (TREE_CODE (expr))
4415 {
d1a7edaf 4416 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
6f312d18
ZW		 4417 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
4418 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
4419 case ORDERED_EXPR: case UNORDERED_EXPR:
90ec750d
RS		 4420 if (TREE_TYPE (expr) == truthvalue_type_node)
4421 return expr;
c2255bc4 4422 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
90ec750d 4423 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
c2255bc4 4424 goto ret;
90ec750d 4425
b30f223b
RS		 4426 case TRUTH_ANDIF_EXPR:
4427 case TRUTH_ORIF_EXPR:
4428 case TRUTH_AND_EXPR:
4429 case TRUTH_OR_EXPR:
9379fac9 4430 case TRUTH_XOR_EXPR:
90ec750d
RS		 4431 if (TREE_TYPE (expr) == truthvalue_type_node)
4432 return expr;
c2255bc4 4433 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
b8698a0f 4434 c_common_truthvalue_conversion (location,
c2255bc4
AH		 4435 TREE_OPERAND (expr, 0)),
4436 c_common_truthvalue_conversion (location,
4437 TREE_OPERAND (expr, 1)));
4438 goto ret;
18c0f675 4439
18d00205 4440 case TRUTH_NOT_EXPR:
90ec750d
RS		 4441 if (TREE_TYPE (expr) == truthvalue_type_node)
4442 return expr;
c2255bc4
AH		 4443 expr = build1 (TREE_CODE (expr), truthvalue_type_node,
4444 c_common_truthvalue_conversion (location,
4445 TREE_OPERAND (expr, 0)));
4446 goto ret;
18d00205 4447
b30f223b
RS		 4448 case ERROR_MARK:
4449 return expr;
4450
4451 case INTEGER_CST:
d95787e6
RS		 4452 return integer_zerop (expr) ? truthvalue_false_node
4453 : truthvalue_true_node;
b30f223b
RS		 4454
4455 case REAL_CST:
010c4d9c
RS		 4456 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
4457 ? truthvalue_true_node
4458 : truthvalue_false_node;
b30f223b 4459
ab22c1fa
CF		 4460 case FIXED_CST:
4461 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
4462 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
4463 ? truthvalue_true_node
4464 : truthvalue_false_node;
4465
90ec750d 4466 case FUNCTION_DECL:
c9f9eb5d 4467 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
90ec750d
RS		 4468 /* Fall through. */
4469
b30f223b 4470 case ADDR_EXPR:
1998463c 4471 {
f6f08360 4472 tree inner = TREE_OPERAND (expr, 0);
b3c6d2ea 4473 if (decl_with_nonnull_addr_p (inner))
1998463c 4474 {
b3c6d2ea 4475 /* Common Ada/Pascal programmer's mistake. */
ba47d38d
AH		 4476 warning_at (location,
4477 OPT_Waddress,
4478 "the address of %qD will always evaluate as %<true%>",
4479 inner);
1998463c
SB		 4480 return truthvalue_true_node;
4481 }
33766b66 4482 break;
1998463c 4483 }
b30f223b 4484
766f6c30 4485 case COMPLEX_EXPR:
c2255bc4 4486 expr = build_binary_op (EXPR_LOCATION (expr),
ba47d38d 4487 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
b839fb3f 4488 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
ba47d38d
AH		 4489 c_common_truthvalue_conversion (location,
4490 TREE_OPERAND (expr, 0)),
4491 c_common_truthvalue_conversion (location,
4492 TREE_OPERAND (expr, 1)),
766f6c30 4493 0);
c2255bc4 4494 goto ret;
766f6c30 4495
b30f223b
RS		 4496 case NEGATE_EXPR:
4497 case ABS_EXPR:
4498 case FLOAT_EXPR:
8ce94e44 4499 case EXCESS_PRECISION_EXPR:
da7d8304 4500 /* These don't change whether an object is nonzero or zero. */
ba47d38d 4501 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
b30f223b
RS		 4502
4503 case LROTATE_EXPR:
4504 case RROTATE_EXPR:
da7d8304 4505 /* These don't change whether an object is zero or nonzero, but
b30f223b
RS		 4506 we can't ignore them if their second arg has side-effects. */
4507 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
c2255bc4
AH		 4508 {
4509 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
4510 TREE_OPERAND (expr, 1),
b8698a0f 4511 c_common_truthvalue_conversion
c2255bc4
AH		 4512 (location, TREE_OPERAND (expr, 0)));
4513 goto ret;
4514 }
b30f223b 4515 else
ba47d38d
AH		 4516 return c_common_truthvalue_conversion (location,
4517 TREE_OPERAND (expr, 0));
b57062ca 4518
b30f223b
RS		 4519 case COND_EXPR:
4520 /* Distribute the conversion into the arms of a COND_EXPR. */
928c19bb 4521 if (c_dialect_cxx ())
c2255bc4 4522 {
4cc4f2f4
JJ		 4523 tree op1 = TREE_OPERAND (expr, 1);
4524 tree op2 = TREE_OPERAND (expr, 2);
4525 /* In C++ one of the arms might have void type if it is throw. */
4526 if (!VOID_TYPE_P (TREE_TYPE (op1)))
4527 op1 = c_common_truthvalue_conversion (location, op1);
4528 if (!VOID_TYPE_P (TREE_TYPE (op2)))
4529 op2 = c_common_truthvalue_conversion (location, op2);
db3927fb 4530 expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
4cc4f2f4 4531 TREE_OPERAND (expr, 0), op1, op2);
c2255bc4
AH		 4532 goto ret;
4533 }
928c19bb 4534 else
c2255bc4
AH		 4535 {
4536 /* Folding will happen later for C. */
4537 expr = build3 (COND_EXPR, truthvalue_type_node,
4538 TREE_OPERAND (expr, 0),
4539 c_common_truthvalue_conversion (location,
4540 TREE_OPERAND (expr, 1)),
4541 c_common_truthvalue_conversion (location,
4542 TREE_OPERAND (expr, 2)));
4543 goto ret;
4544 }
b30f223b 4545
1043771b 4546 CASE_CONVERT:
1ee44b26
JM		 4547 {
4548 tree totype = TREE_TYPE (expr);
4549 tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
4550
076fecad
PP		 4551 if (POINTER_TYPE_P (totype)
4552 && TREE_CODE (fromtype) == REFERENCE_TYPE)
4553 {
4554 tree inner = expr;
4555 STRIP_NOPS (inner);
4556
4557 if (DECL_P (inner))
4558 warning_at (location,
4559 OPT_Waddress,
4560 "the compiler can assume that the address of "
4561 "%qD will always evaluate to %<true%>",
4562 inner);
4563 }
4564
1ee44b26
JM		 4565 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4566 since that affects how `default_conversion' will behave. */
4567 if (TREE_CODE (totype) == REFERENCE_TYPE
4568 || TREE_CODE (fromtype) == REFERENCE_TYPE)
4569 break;
4570 /* Don't strip a conversion from C++0x scoped enum, since they
4571 don't implicitly convert to other types. */
4572 if (TREE_CODE (fromtype) == ENUMERAL_TYPE
4573 && ENUM_IS_SCOPED (fromtype))
4574 break;
4575 /* If this isn't narrowing the argument, we can ignore it. */
4576 if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
4577 return c_common_truthvalue_conversion (location,
4578 TREE_OPERAND (expr, 0));
4579 }
b30f223b
RS		 4580 break;
4581
e2aab13d 4582 case MODIFY_EXPR:
fbc8d2d3
ILT		 4583 if (!TREE_NO_WARNING (expr)
4584 && warn_parentheses)
4585 {
4586 warning (OPT_Wparentheses,
4587 "suggest parentheses around assignment used as truth value");
4588 TREE_NO_WARNING (expr) = 1;
4589 }
e2aab13d 4590 break;
b57062ca 4591
6d819282
MK		 4592 default:
4593 break;
b30f223b
RS		 4594 }
4595
f0b996c5 4596 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
f0b8d9aa 4597 {
5386338c 4598 tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr));
c2255bc4 4599 expr = (build_binary_op
ba47d38d
AH		 4600 (EXPR_LOCATION (expr),
4601 (TREE_SIDE_EFFECTS (expr)
f0b8d9aa 4602 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
c9f9eb5d
AH		 4603 c_common_truthvalue_conversion
4604 (location,
4605 build_unary_op (location, REALPART_EXPR, t, 0)),
4606 c_common_truthvalue_conversion
4607 (location,
4608 build_unary_op (location, IMAGPART_EXPR, t, 0)),
f0b8d9aa 4609 0));
c2255bc4 4610 goto ret;
f0b8d9aa 4611 }
f0b996c5 4612
ab22c1fa
CF		 4613 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
4614 {
4615 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
4616 FCONST0 (TYPE_MODE
4617 (TREE_TYPE (expr))));
ca80e52b 4618 return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
ab22c1fa 4619 }
c2255bc4
AH		 4620 else
4621 return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
ab22c1fa 4622
c2255bc4
AH		 4623 ret:
4624 protected_set_expr_location (expr, location);
4625 return expr;
b30f223b
RS		 4626}
4627\f
9bc15050
RG		 4628static void def_builtin_1 (enum built_in_function fncode,
4629 const char *name,
4630 enum built_in_class fnclass,
4631 tree fntype, tree libtype,
4632 bool both_p, bool fallback_p, bool nonansi_p,
4633 tree fnattrs, bool implicit_p);
fc2aaf30 4634
3932261a
MM		 4635
4636/* Apply the TYPE_QUALS to the new DECL. */
4637
4638void
35b1a6fa 4639c_apply_type_quals_to_decl (int type_quals, tree decl)
3932261a 4640{
4b011bbf 4641 tree type = TREE_TYPE (decl);
9f63daea 4642
5a6159dd
AP		 4643 if (type == error_mark_node)
4644 return;
4b011bbf 4645
329af3c7
JM		 4646 if ((type_quals & TYPE_QUAL_CONST)
4647 || (type && TREE_CODE (type) == REFERENCE_TYPE))
4648 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4649 constructor can produce constant init, so rely on cp_finish_decl to
4650 clear TREE_READONLY if the variable has non-constant init. */
3932261a
MM		 4651 TREE_READONLY (decl) = 1;
4652 if (type_quals & TYPE_QUAL_VOLATILE)
4653 {
4654 TREE_SIDE_EFFECTS (decl) = 1;
4655 TREE_THIS_VOLATILE (decl) = 1;
4656 }
6946bc60 4657 if (type_quals & TYPE_QUAL_RESTRICT)
3932261a 4658 {
4b011bbf
JM		 4659 while (type && TREE_CODE (type) == ARRAY_TYPE)
4660 /* Allow 'restrict' on arrays of pointers.
4661 FIXME currently we just ignore it. */
4662 type = TREE_TYPE (type);
4663 if (!type
4664 || !POINTER_TYPE_P (type)
4665 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
bda67431 4666 error ("invalid use of %<restrict%>");
3932261a
MM		 4667 }
4668}
4669
ca752f39 4670struct c_type_hasher : ggc_ptr_hash<tree_node>
2a22f99c
TS		 4671{
4672 static hashval_t hash (tree);
4673 static bool equal (tree, tree);
4674};
4675
6de9cd9a
DN		 4676/* Hash function for the problem of multiple type definitions in
4677 different files. This must hash all types that will compare
4678 equal via comptypes to the same value. In practice it hashes
9cf737f8 4679 on some of the simple stuff and leaves the details to comptypes. */
6de9cd9a 4680
2a22f99c
TS		 4681hashval_t
4682c_type_hasher::hash (tree t)
6de9cd9a 4683{
a19e4d44 4684 int n_elements;
6de9cd9a 4685 int shift, size;
6de9cd9a
DN		 4686 tree t2;
4687 switch (TREE_CODE (t))
4688 {
8c27b7d4 4689 /* For pointers, hash on pointee type plus some swizzling. */
325c3691 4690 case POINTER_TYPE:
2a22f99c 4691 return hash (TREE_TYPE (t)) ^ 0x3003003;
325c3691
RH		 4692 /* Hash on number of elements and total size. */
4693 case ENUMERAL_TYPE:
4694 shift = 3;
4695 t2 = TYPE_VALUES (t);
4696 break;
4697 case RECORD_TYPE:
4698 shift = 0;
4699 t2 = TYPE_FIELDS (t);
4700 break;
4701 case QUAL_UNION_TYPE:
4702 shift = 1;
4703 t2 = TYPE_FIELDS (t);
4704 break;
4705 case UNION_TYPE:
4706 shift = 2;
4707 t2 = TYPE_FIELDS (t);
4708 break;
4709 default:
366de0ce 4710 gcc_unreachable ();
6de9cd9a 4711 }
a19e4d44
NF		 4712 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4713 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4714 n_elements = list_length (t2);
6fc3c3c0
TT		 4715 /* We might have a VLA here. */
4716 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
4717 size = 0;
4718 else
4719 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
a19e4d44 4720 return ((size << 24) | (n_elements << shift));
6de9cd9a
DN		 4721}
4722
2a22f99c
TS		 4723bool
4724c_type_hasher::equal (tree t1, tree t2)
4725{
4726 return lang_hooks.types_compatible_p (t1, t2);
4727}
4728
4729static GTY(()) hash_table<c_type_hasher> *type_hash_table;
4fe52ce9 4730
41472af8 4731/* Return the typed-based alias set for T, which may be an expression
3bdf5ad1 4732 or a type. Return -1 if we don't do anything special. */
41472af8 4733
4862826d 4734alias_set_type
35b1a6fa 4735c_common_get_alias_set (tree t)
41472af8 4736{
08bc2431 4737 tree u;
35b1a6fa 4738
cb9c2485
JM		 4739 /* For VLAs, use the alias set of the element type rather than the
4740 default of alias set 0 for types compared structurally. */
4741 if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
4742 {
4743 if (TREE_CODE (t) == ARRAY_TYPE)
4744 return get_alias_set (TREE_TYPE (t));
4745 return -1;
4746 }
4747
08bc2431
MM		 4748 /* Permit type-punning when accessing a union, provided the access
4749 is directly through the union. For example, this code does not
4750 permit taking the address of a union member and then storing
4751 through it. Even the type-punning allowed here is a GCC
4752 extension, albeit a common and useful one; the C standard says
4753 that such accesses have implementation-defined behavior. */
4754 for (u = t;
4755 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4756 u = TREE_OPERAND (u, 0))
4757 if (TREE_CODE (u) == COMPONENT_REF
4758 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4759 return 0;
ece32014 4760
74d86f4f 4761 /* That's all the expressions we handle specially. */
3f75a254 4762 if (!TYPE_P (t))
74d86f4f
RH		 4763 return -1;
4764
95bd1dd7 4765 /* The C standard guarantees that any object may be accessed via an
74d86f4f
RH		 4766 lvalue that has character type. */
4767 if (t == char_type_node
4768 || t == signed_char_type_node
4769 || t == unsigned_char_type_node)
3bdf5ad1 4770 return 0;
3932261a 4771
f824e5c3
RK		 4772 /* The C standard specifically allows aliasing between signed and
4773 unsigned variants of the same type. We treat the signed
4774 variant as canonical. */
8df83eae 4775 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
8f215dce 4776 {
ceef8ce4 4777 tree t1 = c_common_signed_type (t);
f824e5c3 4778
8f215dce
JJ		 4779 /* t1 == t can happen for boolean nodes which are always unsigned. */
4780 if (t1 != t)
4781 return get_alias_set (t1);
4782 }
ece32014 4783
6de9cd9a
DN		 4784 /* Handle the case of multiple type nodes referring to "the same" type,
4785 which occurs with IMA. These share an alias set. FIXME: Currently only
4786 C90 is handled. (In C99 type compatibility is not transitive, which
4787 complicates things mightily. The alias set splay trees can theoretically
4788 represent this, but insertion is tricky when you consider all the
4789 different orders things might arrive in.) */
4790
4791 if (c_language != clk_c || flag_isoc99)
4792 return -1;
4793
9cf737f8 4794 /* Save time if there's only one input file. */
d974312d 4795 if (num_in_fnames == 1)
6de9cd9a
DN		 4796 return -1;
4797
4798 /* Pointers need special handling if they point to any type that
4799 needs special handling (below). */
4800 if (TREE_CODE (t) == POINTER_TYPE)
4801 {
4802 tree t2;
4803 /* Find bottom type under any nested POINTERs. */
9f63daea 4804 for (t2 = TREE_TYPE (t);
762f7d9d
TT		 4805 TREE_CODE (t2) == POINTER_TYPE;
4806 t2 = TREE_TYPE (t2))
4807 ;
a868811e
MP		 4808 if (!RECORD_OR_UNION_TYPE_P (t2)
4809 && TREE_CODE (t2) != ENUMERAL_TYPE)
762f7d9d 4810 return -1;
6de9cd9a 4811 if (TYPE_SIZE (t2) == 0)
762f7d9d 4812 return -1;
6de9cd9a
DN		 4813 }
4814 /* These are the only cases that need special handling. */
a868811e 4815 if (!RECORD_OR_UNION_TYPE_P (t)
6de9cd9a 4816 && TREE_CODE (t) != ENUMERAL_TYPE
6de9cd9a
DN		 4817 && TREE_CODE (t) != POINTER_TYPE)
4818 return -1;
4819 /* Undefined? */
4820 if (TYPE_SIZE (t) == 0)
4821 return -1;
4822
9f63daea 4823 /* Look up t in hash table. Only one of the compatible types within each
6de9cd9a
DN		 4824 alias set is recorded in the table. */
4825 if (!type_hash_table)
2a22f99c
TS		 4826 type_hash_table = hash_table<c_type_hasher>::create_ggc (1021);
4827 tree *slot = type_hash_table->find_slot (t, INSERT);
6de9cd9a 4828 if (*slot != NULL)
6a3203c8
AP		 4829 {
4830 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
4831 return TYPE_ALIAS_SET ((tree)*slot);
4832 }
6de9cd9a
DN		 4833 else
4834 /* Our caller will assign and record (in t) a new alias set; all we need
4835 to do is remember t in the hash table. */
4836 *slot = t;
4837
3bdf5ad1 4838 return -1;
41472af8 4839}
0213a355 4840\f
c2255bc4 4841/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
296674db 4842 the IS_SIZEOF parameter indicates which operator is being applied.
c2255bc4
AH		 4843 The COMPLAIN flag controls whether we should diagnose possibly
4844 ill-formed constructs or not. LOC is the location of the SIZEOF or
296674db
JM		 4845 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4846 a type in any context should be returned, rather than the normal
4847 alignment for that type. */
03a08664 4848
0213a355 4849tree
c2255bc4 4850c_sizeof_or_alignof_type (location_t loc,
296674db
JM		 4851 tree type, bool is_sizeof, bool min_alignof,
4852 int complain)
0213a355 4853{
fa72b064
GDR		 4854 const char *op_name;
4855 tree value = NULL;
4856 enum tree_code type_code = TREE_CODE (type);
35b1a6fa 4857
03a08664 4858 op_name = is_sizeof ? "sizeof" : "__alignof__";
35b1a6fa 4859
fa72b064 4860 if (type_code == FUNCTION_TYPE)
0213a355 4861 {
03a08664 4862 if (is_sizeof)
fa72b064 4863 {
44d90fe1
PC		 4864 if (complain && warn_pointer_arith)
4865 pedwarn (loc, OPT_Wpointer_arith,
fcf73884 4866 "invalid application of %<sizeof%> to a function type");
5ade1ed2
DG		 4867 else if (!complain)
4868 return error_mark_node;
fa72b064
GDR		 4869 value = size_one_node;
4870 }
4871 else
d19fa6b5
JM		 4872 {
4873 if (complain)
4874 {
4875 if (c_dialect_cxx ())
c1771a20 4876 pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit "
d19fa6b5
JM		 4877 "%<alignof%> applied to a function type");
4878 else
c1771a20 4879 pedwarn (loc, OPT_Wpedantic, "ISO C does not permit "
d19fa6b5
JM		 4880 "%<_Alignof%> applied to a function type");
4881 }
4882 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
4883 }
fa72b064
GDR		 4884 }
4885 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
4886 {
35b1a6fa 4887 if (type_code == VOID_TYPE
44d90fe1
PC		 4888 && complain && warn_pointer_arith)
4889 pedwarn (loc, OPT_Wpointer_arith,
fcf73884 4890 "invalid application of %qs to a void type", op_name);
5ade1ed2
DG		 4891 else if (!complain)
4892 return error_mark_node;
fa72b064 4893 value = size_one_node;
0213a355 4894 }
73ac190a
PC		 4895 else if (!COMPLETE_TYPE_P (type)
4896 && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE))
0213a355 4897 {
ea793912 4898 if (complain)
73ac190a 4899 error_at (loc, "invalid application of %qs to incomplete type %qT",
c2255bc4 4900 op_name, type);
cb6addf4 4901 return error_mark_node;
0213a355 4902 }
73ac190a
PC		 4903 else if (c_dialect_cxx () && type_code == ARRAY_TYPE
4904 && !COMPLETE_TYPE_P (TREE_TYPE (type)))
4905 {
4906 if (complain)
4907 error_at (loc, "invalid application of %qs to array type %qT of "
4908 "incomplete element type", op_name, type);
4909 return error_mark_node;
4910 }
0213a355 4911 else
fa72b064 4912 {
03a08664 4913 if (is_sizeof)
fa72b064 4914 /* Convert in case a char is more than one unit. */
db3927fb
AH		 4915 value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
4916 size_int (TYPE_PRECISION (char_type_node)
4917 / BITS_PER_UNIT));
296674db 4918 else if (min_alignof)
2793eeab 4919 value = size_int (min_align_of_type (type));
fa72b064 4920 else
a4e9ffe5 4921 value = size_int (TYPE_ALIGN_UNIT (type));
fa72b064 4922 }
0213a355 4923
3ac8781c
RG		 4924 /* VALUE will have the middle-end integer type sizetype.
4925 However, we should really return a value of type `size_t',
4926 which is just a typedef for an ordinary integer type. */
db3927fb 4927 value = fold_convert_loc (loc, size_type_node, value);
35b1a6fa 4928
fa72b064 4929 return value;
0213a355
JM		 4930}
4931
4932/* Implement the __alignof keyword: Return the minimum required
837edd5f
GK		 4933 alignment of EXPR, measured in bytes. For VAR_DECLs,
4934 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
c2255bc4
AH		 4935 from an "aligned" __attribute__ specification). LOC is the
4936 location of the ALIGNOF operator. */
7f4edbcb 4937
0213a355 4938tree
c2255bc4 4939c_alignof_expr (location_t loc, tree expr)
0213a355
JM		 4940{
4941 tree t;
4942
837edd5f 4943 if (VAR_OR_FUNCTION_DECL_P (expr))
a4e9ffe5 4944 t = size_int (DECL_ALIGN_UNIT (expr));
35b1a6fa 4945
0213a355
JM		 4946 else if (TREE_CODE (expr) == COMPONENT_REF
4947 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
4948 {
c2255bc4 4949 error_at (loc, "%<__alignof%> applied to a bit-field");
0213a355
JM		 4950 t = size_one_node;
4951 }
4952 else if (TREE_CODE (expr) == COMPONENT_REF
173bf5be 4953 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
a4e9ffe5 4954 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
35b1a6fa 4955
22d03525 4956 else if (INDIRECT_REF_P (expr))
0213a355
JM		 4957 {
4958 tree t = TREE_OPERAND (expr, 0);
4959 tree best = t;
4960 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
35b1a6fa 4961
1043771b 4962 while (CONVERT_EXPR_P (t)
173bf5be 4963 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
0213a355
JM		 4964 {
4965 int thisalign;
4966
4967 t = TREE_OPERAND (t, 0);
4968 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4969 if (thisalign > bestalign)
4970 best = t, bestalign = thisalign;
4971 }
c2255bc4 4972 return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
0213a355
JM		 4973 }
4974 else
c2255bc4 4975 return c_alignof (loc, TREE_TYPE (expr));
0213a355 4976
db3927fb 4977 return fold_convert_loc (loc, size_type_node, t);
0213a355
JM		 4978}
4979\f
df061a43
RS		 4980/* Handle C and C++ default attributes. */
4981
4982enum built_in_attribute
4983{
4984#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4985#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
e384e6b5 4986#define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
df061a43
RS		 4987#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4988#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
df061a43
RS		 4989#include "builtin-attrs.def"
4990#undef DEF_ATTR_NULL_TREE
4991#undef DEF_ATTR_INT
e384e6b5 4992#undef DEF_ATTR_STRING
df061a43
RS		 4993#undef DEF_ATTR_IDENT
4994#undef DEF_ATTR_TREE_LIST
df061a43
RS		 4995 ATTR_LAST
4996};
4997
4998static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
4999
35b1a6fa 5000static void c_init_attributes (void);
df061a43 5001
a0274e3e 5002enum c_builtin_type
7f4edbcb 5003{
10841285
MM		 5004#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5005#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5006#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5007#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5008#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5009#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
10a0d495 5010#define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
f6a7cffc
TS		 5011#define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5012 ARG6) NAME,
5013#define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5014 ARG6, ARG7) NAME,
5015#define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5016 ARG6, ARG7, ARG8) NAME,
d9a6bd32
JJ		 5017#define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5018 ARG6, ARG7, ARG8, ARG9) NAME,
5019#define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5020 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5021#define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5022 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
10841285
MM		 5023#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5024#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5025#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
08291658 5026#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
10a0d495 5027#define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
f6a7cffc 5028#define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
56a9f6bc 5029 NAME,
3e32ee19
NS		 5030#define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5031 ARG6) NAME,
56a9f6bc
TS		 5032#define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5033 ARG6, ARG7) NAME,
10841285
MM		 5034#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5035#include "builtin-types.def"
5036#undef DEF_PRIMITIVE_TYPE
5037#undef DEF_FUNCTION_TYPE_0
5038#undef DEF_FUNCTION_TYPE_1
5039#undef DEF_FUNCTION_TYPE_2
5040#undef DEF_FUNCTION_TYPE_3
5041#undef DEF_FUNCTION_TYPE_4
10a0d495
JJ		 5042#undef DEF_FUNCTION_TYPE_5
5043#undef DEF_FUNCTION_TYPE_6
a0274e3e 5044#undef DEF_FUNCTION_TYPE_7
acf0174b 5045#undef DEF_FUNCTION_TYPE_8
d9a6bd32
JJ		 5046#undef DEF_FUNCTION_TYPE_9
5047#undef DEF_FUNCTION_TYPE_10
5048#undef DEF_FUNCTION_TYPE_11
10841285
MM		 5049#undef DEF_FUNCTION_TYPE_VAR_0
5050#undef DEF_FUNCTION_TYPE_VAR_1
5051#undef DEF_FUNCTION_TYPE_VAR_2
08291658 5052#undef DEF_FUNCTION_TYPE_VAR_3
10a0d495
JJ		 5053#undef DEF_FUNCTION_TYPE_VAR_4
5054#undef DEF_FUNCTION_TYPE_VAR_5
3e32ee19 5055#undef DEF_FUNCTION_TYPE_VAR_6
56a9f6bc 5056#undef DEF_FUNCTION_TYPE_VAR_7
10841285 5057#undef DEF_POINTER_TYPE
a0274e3e
JJ		 5058 BT_LAST
5059};
5060
5061typedef enum c_builtin_type builtin_type;
10841285 5062
a0274e3e
JJ		 5063/* A temporary array for c_common_nodes_and_builtins. Used in
5064 communication with def_fn_type. */
5065static tree builtin_types[(int) BT_LAST + 1];
10841285 5066
a0274e3e
JJ		 5067/* A helper function for c_common_nodes_and_builtins. Build function type
5068 for DEF with return type RET and N arguments. If VAR is true, then the
5069 function should be variadic after those N arguments.
5070
5071 Takes special care not to ICE if any of the types involved are
5072 error_mark_node, which indicates that said type is not in fact available
5073 (see builtin_type_for_size). In which case the function type as a whole
5074 should be error_mark_node. */
5075
5076static void
5077def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
5078{
8242dd04
NF		 5079 tree t;
5080 tree *args = XALLOCAVEC (tree, n);
a0274e3e
JJ		 5081 va_list list;
5082 int i;
5083
5084 va_start (list, n);
5085 for (i = 0; i < n; ++i)
5086 {
d75d71e0 5087 builtin_type a = (builtin_type) va_arg (list, int);
a0274e3e
JJ		 5088 t = builtin_types[a];
5089 if (t == error_mark_node)
5090 goto egress;
8242dd04 5091 args[i] = t;
a0274e3e 5092 }
a0274e3e 5093
a0274e3e
JJ		 5094 t = builtin_types[ret];
5095 if (t == error_mark_node)
5096 goto egress;
8242dd04
NF		 5097 if (var)
5098 t = build_varargs_function_type_array (t, n, args);
5099 else
5100 t = build_function_type_array (t, n, args);
a0274e3e
JJ		 5101
5102 egress:
5103 builtin_types[def] = t;
0edf1bb2 5104 va_end (list);
a0274e3e
JJ		 5105}
5106
c6d86fce
ILT		 5107/* Build builtin functions common to both C and C++ language
5108 frontends. */
5109
5110static void
5111c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
5112{
5113#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5114 builtin_types[ENUM] = VALUE;
5115#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5116 def_fn_type (ENUM, RETURN, 0, 0);
5117#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5118 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5119#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5120 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5121#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5122 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5123#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5124 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5125#define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5126 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5127#define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5128 ARG6) \
5129 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5130#define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5131 ARG6, ARG7) \
5132 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
acf0174b
JJ		 5133#define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5134 ARG6, ARG7, ARG8) \
5135 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5136 ARG7, ARG8);
d9a6bd32
JJ		 5137#define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5138 ARG6, ARG7, ARG8, ARG9) \
5139 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5140 ARG7, ARG8, ARG9);
5141#define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5142 ARG6, ARG7, ARG8, ARG9, ARG10) \
5143 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5144 ARG7, ARG8, ARG9, ARG10);
5145#define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5146 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5147 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5148 ARG7, ARG8, ARG9, ARG10, ARG11);
c6d86fce
ILT		 5149#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5150 def_fn_type (ENUM, RETURN, 1, 0);
5151#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5152 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5153#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5154 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5155#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5156 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5157#define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5158 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5159#define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5160 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3e32ee19
NS		 5161#define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5162 ARG6) \
5163 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
56a9f6bc
TS		 5164#define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5165 ARG6, ARG7) \
5166 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
c6d86fce
ILT		 5167#define DEF_POINTER_TYPE(ENUM, TYPE) \
5168 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5169
5170#include "builtin-types.def"
5171
5172#undef DEF_PRIMITIVE_TYPE
f6a7cffc 5173#undef DEF_FUNCTION_TYPE_0
c6d86fce
ILT		 5174#undef DEF_FUNCTION_TYPE_1
5175#undef DEF_FUNCTION_TYPE_2
5176#undef DEF_FUNCTION_TYPE_3
5177#undef DEF_FUNCTION_TYPE_4
5178#undef DEF_FUNCTION_TYPE_5
5179#undef DEF_FUNCTION_TYPE_6
f6a7cffc
TS		 5180#undef DEF_FUNCTION_TYPE_7
5181#undef DEF_FUNCTION_TYPE_8
d9a6bd32
JJ		 5182#undef DEF_FUNCTION_TYPE_9
5183#undef DEF_FUNCTION_TYPE_10
5184#undef DEF_FUNCTION_TYPE_11
c6d86fce
ILT		 5185#undef DEF_FUNCTION_TYPE_VAR_0
5186#undef DEF_FUNCTION_TYPE_VAR_1
5187#undef DEF_FUNCTION_TYPE_VAR_2
5188#undef DEF_FUNCTION_TYPE_VAR_3
5189#undef DEF_FUNCTION_TYPE_VAR_4
5190#undef DEF_FUNCTION_TYPE_VAR_5
3e32ee19 5191#undef DEF_FUNCTION_TYPE_VAR_6
56a9f6bc 5192#undef DEF_FUNCTION_TYPE_VAR_7
c6d86fce
ILT		 5193#undef DEF_POINTER_TYPE
5194 builtin_types[(int) BT_LAST] = NULL_TREE;
5195
5196 c_init_attributes ();
5197
5198#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5199 NONANSI_P, ATTRS, IMPLICIT, COND) \
5200 if (NAME && COND) \
5201 def_builtin_1 (ENUM, NAME, CLASS, \
5202 builtin_types[(int) TYPE], \
5203 builtin_types[(int) LIBTYPE], \
5204 BOTH_P, FALLBACK_P, NONANSI_P, \
5205 built_in_attributes[(int) ATTRS], IMPLICIT);
5206#include "builtins.def"
c6d86fce 5207
8de7ef2a
UB		 5208 targetm.init_builtins ();
5209
384c400a 5210 build_common_builtin_nodes ();
939b37da 5211
b72271b9 5212 if (flag_cilkplus)
939b37da 5213 cilk_init_builtins ();
c6d86fce
ILT		 5214}
5215
c1b61fca
JM		 5216/* Like get_identifier, but avoid warnings about null arguments when
5217 the argument may be NULL for targets where GCC lacks stdint.h type
5218 information. */
5219
5220static inline tree
5221c_get_ident (const char *id)
5222{
5223 return get_identifier (id);
5224}
5225
a0274e3e
JJ		 5226/* Build tree nodes and builtin functions common to both C and C++ language
5227 frontends. */
5228
5229void
5230c_common_nodes_and_builtins (void)
5231{
b6baa67d
KVH		 5232 int char16_type_size;
5233 int char32_type_size;
eaa7c03f
JM		 5234 int wchar_type_size;
5235 tree array_domain_type;
9f720c3e 5236 tree va_list_ref_type_node;
daf68dd7 5237 tree va_list_arg_type_node;
78a7c317 5238 int i;
d3707adb 5239
a011cd92 5240 build_common_tree_nodes (flag_signed_char);
fce5dddd 5241
eaa7c03f 5242 /* Define `int' and `char' first so that dbx will output them first. */
6496a589 5243 record_builtin_type (RID_INT, NULL, integer_type_node);
eaa7c03f
JM		 5244 record_builtin_type (RID_CHAR, "char", char_type_node);
5245
5246 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5247 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5248 but not C. Are the conditionals here needed? */
37fa72e9 5249 if (c_dialect_cxx ())
6496a589 5250 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
eaa7c03f
JM		 5251 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
5252 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
5253 record_builtin_type (RID_MAX, "long unsigned int",
5254 long_unsigned_type_node);
78a7c317
DD		 5255
5256 for (i = 0; i < NUM_INT_N_ENTS; i ++)
a6766312 5257 {
78a7c317
DD		 5258 char name[25];
5259
5260 sprintf (name, "__int%d", int_n_data[i].bitsize);
17958621 5261 record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name,
78a7c317
DD		 5262 int_n_trees[i].signed_type);
5263 sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
17958621 5264 record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type);
a6766312 5265 }
78a7c317 5266
37fa72e9 5267 if (c_dialect_cxx ())
eaa7c03f
JM		 5268 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
5269 record_builtin_type (RID_MAX, "long long int",
5270 long_long_integer_type_node);
5271 record_builtin_type (RID_MAX, "long long unsigned int",
5272 long_long_unsigned_type_node);
37fa72e9 5273 if (c_dialect_cxx ())
eaa7c03f
JM		 5274 record_builtin_type (RID_MAX, "long long unsigned",
5275 long_long_unsigned_type_node);
5276 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
5277 record_builtin_type (RID_MAX, "short unsigned int",
5278 short_unsigned_type_node);
37fa72e9 5279 if (c_dialect_cxx ())
eaa7c03f
JM		 5280 record_builtin_type (RID_MAX, "unsigned short",
5281 short_unsigned_type_node);
5282
5283 /* Define both `signed char' and `unsigned char'. */
5284 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
5285 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
5286
b0c48229
NB		 5287 /* These are types that c_common_type_for_size and
5288 c_common_type_for_mode use. */
c2255bc4
AH		 5289 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5290 TYPE_DECL, NULL_TREE,
ae2bcd98 5291 intQI_type_node));
c2255bc4
AH		 5292 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5293 TYPE_DECL, NULL_TREE,
ae2bcd98 5294 intHI_type_node));
c2255bc4
AH		 5295 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5296 TYPE_DECL, NULL_TREE,
ae2bcd98 5297 intSI_type_node));
c2255bc4
AH		 5298 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5299 TYPE_DECL, NULL_TREE,
ae2bcd98 5300 intDI_type_node));
eaa7c03f 5301#if HOST_BITS_PER_WIDE_INT >= 64
78a7c317
DD		 5302 /* Note that this is different than the __int128 type that's part of
5303 the generic __intN support. */
1e1b8649 5304 if (targetm.scalar_mode_supported_p (TImode))
c2255bc4
AH		 5305 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5306 TYPE_DECL,
1e1b8649
AP		 5307 get_identifier ("__int128_t"),
5308 intTI_type_node));
eaa7c03f 5309#endif
c2255bc4
AH		 5310 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5311 TYPE_DECL, NULL_TREE,
ae2bcd98 5312 unsigned_intQI_type_node));
c2255bc4
AH		 5313 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5314 TYPE_DECL, NULL_TREE,
ae2bcd98 5315 unsigned_intHI_type_node));
c2255bc4
AH		 5316 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5317 TYPE_DECL, NULL_TREE,
ae2bcd98 5318 unsigned_intSI_type_node));
c2255bc4
AH		 5319 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5320 TYPE_DECL, NULL_TREE,
ae2bcd98 5321 unsigned_intDI_type_node));
eaa7c03f 5322#if HOST_BITS_PER_WIDE_INT >= 64
1e1b8649 5323 if (targetm.scalar_mode_supported_p (TImode))
c2255bc4
AH		 5324 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5325 TYPE_DECL,
1e1b8649
AP		 5326 get_identifier ("__uint128_t"),
5327 unsigned_intTI_type_node));
eaa7c03f
JM		 5328#endif
5329
5330 /* Create the widest literal types. */
5331 widest_integer_literal_type_node
5332 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
c2255bc4
AH		 5333 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5334 TYPE_DECL, NULL_TREE,
ae2bcd98 5335 widest_integer_literal_type_node));
eaa7c03f
JM		 5336
5337 widest_unsigned_literal_type_node
5338 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
c2255bc4
AH		 5339 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5340 TYPE_DECL, NULL_TREE,
ae2bcd98 5341 widest_unsigned_literal_type_node));
eaa7c03f 5342
c9f8536c 5343 signed_size_type_node = c_common_signed_type (size_type_node);
eaa7c03f 5344
d1c38823
ZD		 5345 pid_type_node =
5346 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
5347
6496a589
KG		 5348 record_builtin_type (RID_FLOAT, NULL, float_type_node);
5349 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
eaa7c03f
JM		 5350 record_builtin_type (RID_MAX, "long double", long_double_type_node);
5351
9a8ce21f
JG		 5352 /* Only supported decimal floating point extension if the target
5353 actually supports underlying modes. */
b8698a0f 5354 if (targetm.scalar_mode_supported_p (SDmode)
9a8ce21f
JG		 5355 && targetm.scalar_mode_supported_p (DDmode)
5356 && targetm.scalar_mode_supported_p (TDmode))
5357 {
5358 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
5359 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
5360 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
5361 }
5362
ab22c1fa
CF		 5363 if (targetm.fixed_point_supported_p ())
5364 {
5365 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
5366 record_builtin_type (RID_FRACT, NULL, fract_type_node);
5367 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
5368 record_builtin_type (RID_MAX, "long long _Fract",
5369 long_long_fract_type_node);
5370 record_builtin_type (RID_MAX, "unsigned short _Fract",
5371 unsigned_short_fract_type_node);
5372 record_builtin_type (RID_MAX, "unsigned _Fract",
5373 unsigned_fract_type_node);
5374 record_builtin_type (RID_MAX, "unsigned long _Fract",
5375 unsigned_long_fract_type_node);
5376 record_builtin_type (RID_MAX, "unsigned long long _Fract",
5377 unsigned_long_long_fract_type_node);
5378 record_builtin_type (RID_MAX, "_Sat short _Fract",
5379 sat_short_fract_type_node);
5380 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
5381 record_builtin_type (RID_MAX, "_Sat long _Fract",
5382 sat_long_fract_type_node);
5383 record_builtin_type (RID_MAX, "_Sat long long _Fract",
5384 sat_long_long_fract_type_node);
5385 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
5386 sat_unsigned_short_fract_type_node);
5387 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
5388 sat_unsigned_fract_type_node);
5389 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
5390 sat_unsigned_long_fract_type_node);
5391 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
5392 sat_unsigned_long_long_fract_type_node);
5393 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
5394 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
5395 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
5396 record_builtin_type (RID_MAX, "long long _Accum",
5397 long_long_accum_type_node);
5398 record_builtin_type (RID_MAX, "unsigned short _Accum",
5399 unsigned_short_accum_type_node);
5400 record_builtin_type (RID_MAX, "unsigned _Accum",
5401 unsigned_accum_type_node);
5402 record_builtin_type (RID_MAX, "unsigned long _Accum",
5403 unsigned_long_accum_type_node);
5404 record_builtin_type (RID_MAX, "unsigned long long _Accum",
5405 unsigned_long_long_accum_type_node);
5406 record_builtin_type (RID_MAX, "_Sat short _Accum",
5407 sat_short_accum_type_node);
5408 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
5409 record_builtin_type (RID_MAX, "_Sat long _Accum",
5410 sat_long_accum_type_node);
5411 record_builtin_type (RID_MAX, "_Sat long long _Accum",
5412 sat_long_long_accum_type_node);
5413 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
5414 sat_unsigned_short_accum_type_node);
5415 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
5416 sat_unsigned_accum_type_node);
5417 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
5418 sat_unsigned_long_accum_type_node);
5419 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
5420 sat_unsigned_long_long_accum_type_node);
5421
5422 }
5423
c2255bc4
AH		 5424 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5425 TYPE_DECL,
ae2bcd98
RS		 5426 get_identifier ("complex int"),
5427 complex_integer_type_node));
c2255bc4
AH		 5428 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5429 TYPE_DECL,
ae2bcd98
RS		 5430 get_identifier ("complex float"),
5431 complex_float_type_node));
c2255bc4
AH		 5432 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5433 TYPE_DECL,
ae2bcd98
RS		 5434 get_identifier ("complex double"),
5435 complex_double_type_node));
5436 lang_hooks.decls.pushdecl
c2255bc4
AH		 5437 (build_decl (UNKNOWN_LOCATION,
5438 TYPE_DECL, get_identifier ("complex long double"),
43577e6b 5439 complex_long_double_type_node));
eaa7c03f 5440
498c0f27
JJ		 5441 if (c_dialect_cxx ())
5442 /* For C++, make fileptr_type_node a distinct void * type until
5443 FILE type is defined. */
8dd16ecc 5444 fileptr_type_node = build_variant_type_copy (ptr_type_node);
498c0f27 5445
6496a589 5446 record_builtin_type (RID_VOID, NULL, void_type_node);
eaa7c03f 5447
06d40de8
DG		 5448 /* Set the TYPE_NAME for any variants that were built before
5449 record_builtin_type gave names to the built-in types. */
5450 {
5451 tree void_name = TYPE_NAME (void_type_node);
5452 TYPE_NAME (void_type_node) = NULL_TREE;
5453 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
5454 = void_name;
5455 TYPE_NAME (void_type_node) = void_name;
5456 }
5457
eaa7c03f
JM		 5458 void_list_node = build_void_list_node ();
5459
5460 /* Make a type to be the domain of a few array types
5461 whose domains don't really matter.
5462 200 is small enough that it always fits in size_t
5463 and large enough that it can hold most function names for the
5464 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5465 array_domain_type = build_index_type (size_int (200));
5466
5467 /* Make a type for arrays of characters.
5468 With luck nothing will ever really depend on the length of this
5469 array type. */
5470 char_array_type_node
5471 = build_array_type (char_type_node, array_domain_type);
5472
10841285
MM		 5473 string_type_node = build_pointer_type (char_type_node);
5474 const_string_type_node
5475 = build_pointer_type (build_qualified_type
5476 (char_type_node, TYPE_QUAL_CONST));
5477
eaa7c03f 5478 /* This is special for C++ so functions can be overloaded. */
a11eba95 5479 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
eaa7c03f
JM		 5480 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
5481 wchar_type_size = TYPE_PRECISION (wchar_type_node);
207bf79d 5482 underlying_wchar_type_node = wchar_type_node;
37fa72e9 5483 if (c_dialect_cxx ())
eaa7c03f 5484 {
8df83eae 5485 if (TYPE_UNSIGNED (wchar_type_node))
eaa7c03f
JM		 5486 wchar_type_node = make_unsigned_type (wchar_type_size);
5487 else
5488 wchar_type_node = make_signed_type (wchar_type_size);
5489 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
5490 }
eaa7c03f
JM		 5491
5492 /* This is for wide string constants. */
5493 wchar_array_type_node
5494 = build_array_type (wchar_type_node, array_domain_type);
5495
b6baa67d
KVH		 5496 /* Define 'char16_t'. */
5497 char16_type_node = get_identifier (CHAR16_TYPE);
5498 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
5499 char16_type_size = TYPE_PRECISION (char16_type_node);
5500 if (c_dialect_cxx ())
5501 {
5502 char16_type_node = make_unsigned_type (char16_type_size);
5503
604b2bfc 5504 if (cxx_dialect >= cxx11)
b6baa67d
KVH		 5505 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
5506 }
5507
5508 /* This is for UTF-16 string constants. */
5509 char16_array_type_node
5510 = build_array_type (char16_type_node, array_domain_type);
5511
5512 /* Define 'char32_t'. */
5513 char32_type_node = get_identifier (CHAR32_TYPE);
5514 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
5515 char32_type_size = TYPE_PRECISION (char32_type_node);
5516 if (c_dialect_cxx ())
5517 {
5518 char32_type_node = make_unsigned_type (char32_type_size);
5519
604b2bfc 5520 if (cxx_dialect >= cxx11)
b6baa67d
KVH		 5521 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
5522 }
5523
5524 /* This is for UTF-32 string constants. */
5525 char32_array_type_node
5526 = build_array_type (char32_type_node, array_domain_type);
5527
5fd8e536
JM		 5528 wint_type_node =
5529 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
5530
5531 intmax_type_node =
5532 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
5533 uintmax_type_node =
5534 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
5535
207bf79d
JM		 5536 if (SIG_ATOMIC_TYPE)
5537 sig_atomic_type_node =
c1b61fca 5538 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
207bf79d
JM		 5539 if (INT8_TYPE)
5540 int8_type_node =
c1b61fca 5541 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
207bf79d
JM		 5542 if (INT16_TYPE)
5543 int16_type_node =
c1b61fca 5544 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
207bf79d
JM		 5545 if (INT32_TYPE)
5546 int32_type_node =
c1b61fca 5547 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
207bf79d
JM		 5548 if (INT64_TYPE)
5549 int64_type_node =
c1b61fca 5550 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
207bf79d
JM		 5551 if (UINT8_TYPE)
5552 uint8_type_node =
c1b61fca 5553 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
207bf79d 5554 if (UINT16_TYPE)
cca615af 5555 c_uint16_type_node = uint16_type_node =
c1b61fca 5556 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
207bf79d 5557 if (UINT32_TYPE)
cca615af 5558 c_uint32_type_node = uint32_type_node =
c1b61fca 5559 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
207bf79d 5560 if (UINT64_TYPE)
cca615af 5561 c_uint64_type_node = uint64_type_node =
c1b61fca 5562 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
207bf79d
JM		 5563 if (INT_LEAST8_TYPE)
5564 int_least8_type_node =
c1b61fca 5565 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
207bf79d
JM		 5566 if (INT_LEAST16_TYPE)
5567 int_least16_type_node =
c1b61fca 5568 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
207bf79d
JM		 5569 if (INT_LEAST32_TYPE)
5570 int_least32_type_node =
c1b61fca 5571 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
207bf79d
JM		 5572 if (INT_LEAST64_TYPE)
5573 int_least64_type_node =
c1b61fca 5574 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
207bf79d
JM		 5575 if (UINT_LEAST8_TYPE)
5576 uint_least8_type_node =
c1b61fca 5577 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
207bf79d
JM		 5578 if (UINT_LEAST16_TYPE)
5579 uint_least16_type_node =
c1b61fca 5580 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
207bf79d
JM		 5581 if (UINT_LEAST32_TYPE)
5582 uint_least32_type_node =
c1b61fca 5583 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
207bf79d
JM		 5584 if (UINT_LEAST64_TYPE)
5585 uint_least64_type_node =
c1b61fca 5586 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
207bf79d
JM		 5587 if (INT_FAST8_TYPE)
5588 int_fast8_type_node =
c1b61fca 5589 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
207bf79d
JM		 5590 if (INT_FAST16_TYPE)
5591 int_fast16_type_node =
c1b61fca 5592 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
207bf79d
JM		 5593 if (INT_FAST32_TYPE)
5594 int_fast32_type_node =
c1b61fca 5595 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
207bf79d
JM		 5596 if (INT_FAST64_TYPE)
5597 int_fast64_type_node =
c1b61fca 5598 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
207bf79d
JM		 5599 if (UINT_FAST8_TYPE)
5600 uint_fast8_type_node =
c1b61fca 5601 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
207bf79d
JM		 5602 if (UINT_FAST16_TYPE)
5603 uint_fast16_type_node =
c1b61fca 5604 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
207bf79d
JM		 5605 if (UINT_FAST32_TYPE)
5606 uint_fast32_type_node =
c1b61fca 5607 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
207bf79d
JM		 5608 if (UINT_FAST64_TYPE)
5609 uint_fast64_type_node =
c1b61fca 5610 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
207bf79d
JM		 5611 if (INTPTR_TYPE)
5612 intptr_type_node =
c1b61fca 5613 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
207bf79d
JM		 5614 if (UINTPTR_TYPE)
5615 uintptr_type_node =
c1b61fca 5616 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
207bf79d 5617
8242dd04
NF		 5618 default_function_type
5619 = build_varargs_function_type_list (integer_type_node, NULL_TREE);
5fd8e536
JM		 5620 ptrdiff_type_node
5621 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
12753674 5622 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
5fd8e536 5623
ae2bcd98 5624 lang_hooks.decls.pushdecl
c2255bc4
AH		 5625 (build_decl (UNKNOWN_LOCATION,
5626 TYPE_DECL, get_identifier ("__builtin_va_list"),
43577e6b 5627 va_list_type_node));
38f8b050 5628 if (targetm.enum_va_list_p)
d4048208
KT		 5629 {
5630 int l;
5631 const char *pname;
5632 tree ptype;
35cbb299 5633
38f8b050 5634 for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
d4048208
KT		 5635 {
5636 lang_hooks.decls.pushdecl
5637 (build_decl (UNKNOWN_LOCATION,
5638 TYPE_DECL, get_identifier (pname),
5639 ptype));
5640
5641 }
5642 }
daf68dd7 5643
daf68dd7 5644 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
9f720c3e
GK		 5645 {
5646 va_list_arg_type_node = va_list_ref_type_node =
5647 build_pointer_type (TREE_TYPE (va_list_type_node));
5648 }
daf68dd7 5649 else
9f720c3e
GK		 5650 {
5651 va_list_arg_type_node = va_list_type_node;
5652 va_list_ref_type_node = build_reference_type (va_list_type_node);
5653 }
35b1a6fa 5654
c6d86fce
ILT		 5655 if (!flag_preprocess_only)
5656 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
4677862a 5657
5b47282c 5658 main_identifier_node = get_identifier ("main");
b2f97e4a
MM		 5659
5660 /* Create the built-in __null node. It is important that this is
5661 not shared. */
807e902e 5662 null_node = make_int_cst (1, 1);
b2f97e4a 5663 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
a0274e3e
JJ		 5664
5665 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5666 memset (builtin_types, 0, sizeof (builtin_types));
7f4edbcb 5667}
d3707adb 5668
3b2db49f
MM		 5669/* The number of named compound-literals generated thus far. */
5670static GTY(()) int compound_literal_number;
5671
5672/* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5673
5674void
5675set_compound_literal_name (tree decl)
5676{
5677 char *name;
5678 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
5679 compound_literal_number);
5680 compound_literal_number++;
5681 DECL_NAME (decl) = get_identifier (name);
5682}
5683
2fe1d762
TV		 5684/* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5685 TYPE and operand OP. */
5686
5687static tree
5688build_va_arg_1 (location_t loc, tree type, tree op)
5689{
5690 tree expr = build1 (VA_ARG_EXPR, type, op);
5691 SET_EXPR_LOCATION (expr, loc);
5692 return expr;
5693}
5694
5695/* Return a VA_ARG_EXPR corresponding to a source-level expression
5696 va_arg (EXPR, TYPE) at source location LOC. */
5697
d3707adb 5698tree
c2255bc4 5699build_va_arg (location_t loc, tree expr, tree type)
d3707adb 5700{
c7b38fd5
TV		 5701 tree va_type = TREE_TYPE (expr);
5702 tree canon_va_type = (va_type == error_mark_node
5703 ? NULL_TREE
5704 : targetm.canonical_va_list_type (va_type));
5705
2fe1d762
TV		 5706 if (va_type == error_mark_node
5707 || canon_va_type == NULL_TREE)
c7b38fd5 5708 {
2fe1d762
TV		 5709 /* Let's handle things neutrallly, if expr:
5710 - has undeclared type, or
5711 - is not an va_list type. */
5712 return build_va_arg_1 (loc, type, expr);
c7b38fd5 5713 }
ecd0e562 5714
2fe1d762
TV		 5715 if (TREE_CODE (canon_va_type) != ARRAY_TYPE)
5716 {
5717 /* Case 1: Not an array type. */
5718
5719 /* Take the address, to get '&ap'. */
5720 mark_addressable (expr);
5721 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr);
5722
5723 /* Verify that &ap is still recognized as having va_list type. */
5724 tree canon_expr_type
5725 = targetm.canonical_va_list_type (TREE_TYPE (expr));
1e77281b
MP		 5726 if (canon_expr_type == NULL_TREE)
5727 {
5728 error_at (loc,
5729 "first argument to %<va_arg%> not of type %<va_list%>");
5730 return error_mark_node;
5731 }
2fe1d762
TV		 5732
5733 return build_va_arg_1 (loc, type, expr);
5734 }
5735
5736 /* Case 2: Array type.
5737
5738 Background:
5739
5740 For contrast, let's start with the simple case (case 1). If
5741 canon_va_type is not an array type, but say a char *, then when
5742 passing-by-value a va_list, the type of the va_list param decl is
5743 the same as for another va_list decl (all ap's are char *):
5744
5745 f2_1 (char * ap)
5746 D.1815 = VA_ARG (&ap, 0B, 1);
5747 return D.1815;
5748
5749 f2 (int i)
5750 char * ap.0;
5751 char * ap;
5752 __builtin_va_start (&ap, 0);
5753 ap.0 = ap;
5754 res = f2_1 (ap.0);
5755 __builtin_va_end (&ap);
5756 D.1812 = res;
5757 return D.1812;
5758
5759 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5760 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5761 the same as for another va_list decl (case 2a, struct ap[1]).
5762
5763 f2_1 (struct * ap)
5764 D.1844 = VA_ARG (ap, 0B, 0);
5765 return D.1844;
5766
5767 f2 (int i)
5768 struct ap[1];
5769 __builtin_va_start (&ap, 0);
5770 res = f2_1 (&ap);
5771 __builtin_va_end (&ap);
5772 D.1841 = res;
5773 return D.1841;
5774
5775 Case 2b is different because:
5776 - on the callee side, the parm decl has declared type va_list, but
5777 grokdeclarator changes the type of the parm decl to a pointer to the
5778 array elem type.
5779 - on the caller side, the pass-by-value uses &ap.
5780
5781 We unify these two cases (case 2a: va_list is array type,
5782 case 2b: va_list is pointer to array elem type), by adding '&' for the
5783 array type case, such that we have a pointer to array elem in both
5784 cases. */
5785
5786 if (TREE_CODE (va_type) == ARRAY_TYPE)
5787 {
5788 /* Case 2a: va_list is array type. */
5789
5790 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5791 elem type. */
5792 mark_addressable (expr);
5793 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)),
5794 expr);
5795
5796 /* Verify that &ap is still recognized as having va_list type. */
5797 tree canon_expr_type
5798 = targetm.canonical_va_list_type (TREE_TYPE (expr));
1e77281b
MP		 5799 if (canon_expr_type == NULL_TREE)
5800 {
5801 error_at (loc,
5802 "first argument to %<va_arg%> not of type %<va_list%>");
5803 return error_mark_node;
5804 }
2fe1d762
TV		 5805 }
5806 else
5807 {
5808 /* Case 2b: va_list is pointer to array elem type. */
5809 gcc_assert (POINTER_TYPE_P (va_type));
5810 gcc_assert (TREE_TYPE (va_type) == TREE_TYPE (canon_va_type));
5811
5812 /* Don't take the address. We've already got '&ap'. */
5813 ;
5814 }
5815
5816 return build_va_arg_1 (loc, type, expr);
d3707adb 5817}
fc2aaf30
JM		 5818
5819
7d14c755
JM		 5820/* Linked list of disabled built-in functions. */
5821
a79683d5 5822struct disabled_builtin
7d14c755
JM		 5823{
5824 const char *name;
5825 struct disabled_builtin *next;
a79683d5 5826};
7d14c755
JM		 5827static disabled_builtin *disabled_builtins = NULL;
5828
35b1a6fa 5829static bool builtin_function_disabled_p (const char *);
7d14c755
JM		 5830
5831/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5832 begins with "__builtin_", give an error. */
5833
5834void
35b1a6fa 5835disable_builtin_function (const char *name)
7d14c755
JM		 5836{
5837 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
bda67431 5838 error ("cannot disable built-in function %qs", name);
7d14c755
JM		 5839 else
5840 {
1ad463f4
BI		 5841 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
5842 new_disabled_builtin->name = name;
5843 new_disabled_builtin->next = disabled_builtins;
5844 disabled_builtins = new_disabled_builtin;
7d14c755
JM		 5845 }
5846}
5847
5848
5849/* Return true if the built-in function NAME has been disabled, false
5850 otherwise. */
5851
5852static bool
35b1a6fa 5853builtin_function_disabled_p (const char *name)
7d14c755
JM		 5854{
5855 disabled_builtin *p;
5856 for (p = disabled_builtins; p != NULL; p = p->next)
5857 {
5858 if (strcmp (name, p->name) == 0)
5859 return true;
5860 }
5861 return false;
5862}
5863
5864
9bc15050
RG		 5865/* Worker for DEF_BUILTIN.
5866 Possibly define a builtin function with one or two names.
5867 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5868 nonansi_p and flag_no_nonansi_builtin. */
fc2aaf30 5869
9bc15050
RG		 5870static void
5871def_builtin_1 (enum built_in_function fncode,
5872 const char *name,
5873 enum built_in_class fnclass,
5874 tree fntype, tree libtype,
5875 bool both_p, bool fallback_p, bool nonansi_p,
5876 tree fnattrs, bool implicit_p)
fc2aaf30 5877{
9bc15050
RG		 5878 tree decl;
5879 const char *libname;
5880
a0274e3e
JJ		 5881 if (fntype == error_mark_node)
5882 return;
5883
9bc15050
RG		 5884 gcc_assert ((!both_p && !fallback_p)
5885 || !strncmp (name, "__builtin_",
5886 strlen ("__builtin_")));
5887
5888 libname = name + strlen ("__builtin_");
c79efc4d
RÁE		 5889 decl = add_builtin_function (name, fntype, fncode, fnclass,
5890 (fallback_p ? libname : NULL),
5891 fnattrs);
e79983f4
MM		 5892
5893 set_builtin_decl (fncode, decl, implicit_p);
5894
9bc15050
RG		 5895 if (both_p
5896 && !flag_no_builtin && !builtin_function_disabled_p (libname)
7d14c755 5897 && !(nonansi_p && flag_no_nonansi_builtin))
c79efc4d
RÁE		 5898 add_builtin_function (libname, libtype, fncode, fnclass,
5899 NULL, fnattrs);
fc2aaf30 5900}
c530479e 5901\f
d72040f5
RH		 5902/* Nonzero if the type T promotes to int. This is (nearly) the
5903 integral promotions defined in ISO C99 6.3.1.1/2. */
5904
5905bool
58f9752a 5906c_promoting_integer_type_p (const_tree t)
d72040f5
RH		 5907{
5908 switch (TREE_CODE (t))
5909 {
5910 case INTEGER_TYPE:
5911 return (TYPE_MAIN_VARIANT (t) == char_type_node
5912 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
5913 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
5914 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
c6c04fca
RL		 5915 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
5916 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
d72040f5
RH		 5917
5918 case ENUMERAL_TYPE:
5919 /* ??? Technically all enumerations not larger than an int
5920 promote to an int. But this is used along code paths
5921 that only want to notice a size change. */
5922 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
5923
5924 case BOOLEAN_TYPE:
5925 return 1;
5926
5927 default:
5928 return 0;
5929 }
5930}
5931
c530479e
RH		 5932/* Return 1 if PARMS specifies a fixed number of parameters
5933 and none of their types is affected by default promotions. */
5934
5935int
58f9752a 5936self_promoting_args_p (const_tree parms)
c530479e 5937{
58f9752a 5938 const_tree t;
c530479e
RH		 5939 for (t = parms; t; t = TREE_CHAIN (t))
5940 {
b3694847 5941 tree type = TREE_VALUE (t);
7e8176d7 5942
694fea20
VR		 5943 if (type == error_mark_node)
5944 continue;
5945
c530479e
RH		 5946 if (TREE_CHAIN (t) == 0 && type != void_type_node)
5947 return 0;
5948
5949 if (type == 0)
5950 return 0;
5951
5952 if (TYPE_MAIN_VARIANT (type) == float_type_node)
5953 return 0;
5954
d72040f5 5955 if (c_promoting_integer_type_p (type))
c530479e
RH		 5956 return 0;
5957 }
5958 return 1;
5959}
5eda3d66 5960
12ea3302
GDR		 5961/* Recursively remove any '*' or '&' operator from TYPE. */
5962tree
5963strip_pointer_operator (tree t)
5964{
5965 while (POINTER_TYPE_P (t))
5966 t = TREE_TYPE (t);
5967 return t;
5968}
5969
ba992967
SP		 5970/* Recursively remove pointer or array type from TYPE. */
5971tree
5972strip_pointer_or_array_types (tree t)
5973{
5974 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
5975 t = TREE_TYPE (t);
5976 return t;
5977}
5978
8f17b5c5
MM		 5979/* Used to compare case labels. K1 and K2 are actually tree nodes
5980 representing case labels, or NULL_TREE for a `default' label.
5981 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5982 K2, and 0 if K1 and K2 are equal. */
5983
5984int
35b1a6fa 5985case_compare (splay_tree_key k1, splay_tree_key k2)
8f17b5c5
MM		 5986{
5987 /* Consider a NULL key (such as arises with a `default' label) to be
5988 smaller than anything else. */
5989 if (!k1)
5990 return k2 ? -1 : 0;
5991 else if (!k2)
5992 return k1 ? 1 : 0;
5993
5994 return tree_int_cst_compare ((tree) k1, (tree) k2);
5995}
5996
c2255bc4
AH		 5997/* Process a case label, located at LOC, for the range LOW_VALUE
5998 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5999 then this case label is actually a `default' label. If only
6000 HIGH_VALUE is NULL_TREE, then case label was declared using the
6001 usual C/C++ syntax, rather than the GNU case range extension.
6002 CASES is a tree containing all the case ranges processed so far;
b155cfd9
MP		 6003 COND is the condition for the switch-statement itself.
6004 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6005 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6006 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
8f17b5c5
MM		 6007
6008tree
c2255bc4 6009c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
b155cfd9 6010 tree low_value, tree high_value, bool *outside_range_p)
8f17b5c5
MM		 6011{
6012 tree type;
6013 tree label;
6014 tree case_label;
6015 splay_tree_node node;
6016
6017 /* Create the LABEL_DECL itself. */
c2255bc4 6018 label = create_artificial_label (loc);
8f17b5c5
MM		 6019
6020 /* If there was an error processing the switch condition, bail now
6021 before we get more confused. */
6022 if (!cond || cond == error_mark_node)
6de9cd9a 6023 goto error_out;
8f17b5c5 6024
35b1a6fa
AJ		 6025 if ((low_value && TREE_TYPE (low_value)
6026 && POINTER_TYPE_P (TREE_TYPE (low_value)))
8f17b5c5
MM		 6027 || (high_value && TREE_TYPE (high_value)
6028 && POINTER_TYPE_P (TREE_TYPE (high_value))))
522ddfa2 6029 {
c2255bc4 6030 error_at (loc, "pointers are not permitted as case values");
522ddfa2
JM		 6031 goto error_out;
6032 }
8f17b5c5
MM		 6033
6034 /* Case ranges are a GNU extension. */
fcf73884 6035 if (high_value)
c1771a20 6036 pedwarn (loc, OPT_Wpedantic,
fcf73884 6037 "range expressions in switch statements are non-standard");
8f17b5c5
MM		 6038
6039 type = TREE_TYPE (cond);
6040 if (low_value)
6041 {
62e4eb35 6042 low_value = check_case_value (loc, low_value);
68fca595 6043 low_value = convert_and_check (loc, type, low_value);
c0e22534
NS		 6044 if (low_value == error_mark_node)
6045 goto error_out;
8f17b5c5
MM		 6046 }
6047 if (high_value)
6048 {
62e4eb35 6049 high_value = check_case_value (loc, high_value);
68fca595 6050 high_value = convert_and_check (loc, type, high_value);
c0e22534
NS		 6051 if (high_value == error_mark_node)
6052 goto error_out;
8f17b5c5
MM		 6053 }
6054
c0e22534
NS		 6055 if (low_value && high_value)
6056 {
6057 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
c22cacf3
MS		 6058 really a case range, even though it was written that way.
6059 Remove the HIGH_VALUE to simplify later processing. */
c0e22534
NS		 6060 if (tree_int_cst_equal (low_value, high_value))
6061 high_value = NULL_TREE;
6062 else if (!tree_int_cst_lt (low_value, high_value))
c2255bc4 6063 warning_at (loc, 0, "empty range specified");
c0e22534 6064 }
8f17b5c5 6065
a6c0a76c
SB		 6066 /* See if the case is in range of the type of the original testing
6067 expression. If both low_value and high_value are out of range,
6068 don't insert the case label and return NULL_TREE. */
6069 if (low_value
9d548dfb 6070 && !check_case_bounds (loc, type, orig_type,
b155cfd9
MP		 6071 &low_value, high_value ? &high_value : NULL,
6072 outside_range_p))
a6c0a76c
SB		 6073 return NULL_TREE;
6074
8f17b5c5
MM		 6075 /* Look up the LOW_VALUE in the table of case labels we already
6076 have. */
6077 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
6078 /* If there was not an exact match, check for overlapping ranges.
6079 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6080 that's a `default' label and the only overlap is an exact match. */
6081 if (!node && (low_value || high_value))
6082 {
6083 splay_tree_node low_bound;
6084 splay_tree_node high_bound;
6085
6086 /* Even though there wasn't an exact match, there might be an
6087 overlap between this case range and another case range.
6088 Since we've (inductively) not allowed any overlapping case
6089 ranges, we simply need to find the greatest low case label
6090 that is smaller that LOW_VALUE, and the smallest low case
6091 label that is greater than LOW_VALUE. If there is an overlap
6092 it will occur in one of these two ranges. */
6093 low_bound = splay_tree_predecessor (cases,
6094 (splay_tree_key) low_value);
6095 high_bound = splay_tree_successor (cases,
6096 (splay_tree_key) low_value);
6097
6098 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6099 the LOW_VALUE, so there is no need to check unless the
6100 LOW_BOUND is in fact itself a case range. */
6101 if (low_bound
6102 && CASE_HIGH ((tree) low_bound->value)
6103 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
6104 low_value) >= 0)
6105 node = low_bound;
6106 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6107 range is bigger than the low end of the current range, so we
6108 are only interested if the current range is a real range, and
6109 not an ordinary case label. */
35b1a6fa 6110 else if (high_bound
8f17b5c5
MM		 6111 && high_value
6112 && (tree_int_cst_compare ((tree) high_bound->key,
6113 high_value)
6114 <= 0))
6115 node = high_bound;
6116 }
6117 /* If there was an overlap, issue an error. */
6118 if (node)
6119 {
8c161995 6120 tree duplicate = CASE_LABEL ((tree) node->value);
8f17b5c5
MM		 6121
6122 if (high_value)
6123 {
c2255bc4
AH		 6124 error_at (loc, "duplicate (or overlapping) case value");
6125 error_at (DECL_SOURCE_LOCATION (duplicate),
6126 "this is the first entry overlapping that value");
8f17b5c5
MM		 6127 }
6128 else if (low_value)
6129 {
c2255bc4
AH		 6130 error_at (loc, "duplicate case value") ;
6131 error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
8f17b5c5
MM		 6132 }
6133 else
6134 {
c2255bc4
AH		 6135 error_at (loc, "multiple default labels in one switch");
6136 error_at (DECL_SOURCE_LOCATION (duplicate),
6137 "this is the first default label");
8f17b5c5 6138 }
6de9cd9a 6139 goto error_out;
8f17b5c5
MM		 6140 }
6141
6142 /* Add a CASE_LABEL to the statement-tree. */
3d528853 6143 case_label = add_stmt (build_case_label (low_value, high_value, label));
8f17b5c5 6144 /* Register this case label in the splay tree. */
35b1a6fa 6145 splay_tree_insert (cases,
8f17b5c5
MM		 6146 (splay_tree_key) low_value,
6147 (splay_tree_value) case_label);
6148
6149 return case_label;
6de9cd9a
DN		 6150
6151 error_out:
9e14e18f 6152 /* Add a label so that the back-end doesn't think that the beginning of
6de9cd9a 6153 the switch is unreachable. Note that we do not add a case label, as
41806d92 6154 that just leads to duplicates and thence to failure later on. */
6de9cd9a
DN		 6155 if (!cases->root)
6156 {
c2255bc4
AH		 6157 tree t = create_artificial_label (loc);
6158 add_stmt (build_stmt (loc, LABEL_EXPR, t));
6de9cd9a
DN		 6159 }
6160 return error_mark_node;
6161}
6162
6163/* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6164 Used to verify that case values match up with enumerator values. */
6165
6166static void
6167match_case_to_enum_1 (tree key, tree type, tree label)
6168{
807e902e
KZ		 6169 char buf[WIDE_INT_PRINT_BUFFER_SIZE];
6170
6171 if (tree_fits_uhwi_p (key))
6172 print_dec (key, buf, UNSIGNED);
6173 else if (tree_fits_shwi_p (key))
6174 print_dec (key, buf, SIGNED);
6de9cd9a 6175 else
807e902e 6176 print_hex (key, buf);
6de9cd9a
DN		 6177
6178 if (TYPE_NAME (type) == 0)
c5d75364
MLI		 6179 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6180 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6181 "case value %qs not in enumerated type",
6182 buf);
6de9cd9a 6183 else
c5d75364
MLI		 6184 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6185 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6186 "case value %qs not in enumerated type %qT",
6187 buf, type);
6de9cd9a
DN		 6188}
6189
c782c2fe
RS		 6190/* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6191 Used to verify that case values match up with enumerator values. */
6192
6de9cd9a
DN		 6193static int
6194match_case_to_enum (splay_tree_node node, void *data)
6195{
6196 tree label = (tree) node->value;
28dab132 6197 tree type = (tree) data;
6de9cd9a
DN		 6198
6199 /* Skip default case. */
6200 if (!CASE_LOW (label))
6201 return 0;
6202
c782c2fe 6203 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6de9cd9a 6204 when we did our enum->case scan. Reset our scratch bit after. */
c782c2fe 6205 if (!CASE_LOW_SEEN (label))
6de9cd9a
DN		 6206 match_case_to_enum_1 (CASE_LOW (label), type, label);
6207 else
c782c2fe 6208 CASE_LOW_SEEN (label) = 0;
6de9cd9a 6209
c782c2fe
RS		 6210 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6211 not set, that means that CASE_HIGH did not appear when we did our
6212 enum->case scan. Reset our scratch bit after. */
6de9cd9a
DN		 6213 if (CASE_HIGH (label))
6214 {
c782c2fe
RS		 6215 if (!CASE_HIGH_SEEN (label))
6216 match_case_to_enum_1 (CASE_HIGH (label), type, label);
6217 else
6218 CASE_HIGH_SEEN (label) = 0;
6de9cd9a
DN		 6219 }
6220
6221 return 0;
6222}
6223
fbc315db
ILT		 6224/* Handle -Wswitch*. Called from the front end after parsing the
6225 switch construct. */
6226/* ??? Should probably be somewhere generic, since other languages
6227 besides C and C++ would want this. At the moment, however, C/C++
6228 are the only tree-ssa languages that support enumerations at all,
6229 so the point is moot. */
6de9cd9a 6230
fbc315db
ILT		 6231void
6232c_do_switch_warnings (splay_tree cases, location_t switch_location,
b155cfd9
MP		 6233 tree type, tree cond, bool bool_cond_p,
6234 bool outside_range_p)
6de9cd9a 6235{
9f63daea 6236 splay_tree_node default_node;
c782c2fe
RS		 6237 splay_tree_node node;
6238 tree chain;
6de9cd9a 6239
b155cfd9
MP		 6240 if (!warn_switch && !warn_switch_enum && !warn_switch_default
6241 && !warn_switch_bool)
6de9cd9a
DN		 6242 return;
6243
6de9cd9a 6244 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
44c21c7f 6245 if (!default_node)
fab922b1
MLI		 6246 warning_at (switch_location, OPT_Wswitch_default,
6247 "switch missing default case");
6de9cd9a 6248
b155cfd9
MP		 6249 /* There are certain cases where -Wswitch-bool warnings aren't
6250 desirable, such as
6251 switch (boolean)
6252 {
6253 case true: ...
6254 case false: ...
6255 }
6256 so be careful here. */
6257 if (warn_switch_bool && bool_cond_p)
6258 {
6259 splay_tree_node min_node;
6260 /* If there's a default node, it's also the value with the minimal
6261 key. So look at the penultimate key (if any). */
6262 if (default_node)
6263 min_node = splay_tree_successor (cases, (splay_tree_key) NULL);
6264 else
6265 min_node = splay_tree_min (cases);
6266 tree min = min_node ? (tree) min_node->key : NULL_TREE;
6267
6268 splay_tree_node max_node = splay_tree_max (cases);
6269 /* This might be a case range, so look at the value with the
6270 maximal key and then check CASE_HIGH. */
6271 tree max = max_node ? (tree) max_node->value : NULL_TREE;
6272 if (max)
6273 max = CASE_HIGH (max) ? CASE_HIGH (max) : CASE_LOW (max);
6274
6275 /* If there's a case value > 1 or < 0, that is outside bool
6276 range, warn. */
6277 if (outside_range_p
6278 || (max && wi::gts_p (max, 1))
6279 || (min && wi::lts_p (min, 0))
6280 /* And handle the
6281 switch (boolean)
6282 {
6283 case true: ...
6284 case false: ...
6285 default: ...
6286 }
6287 case, where we want to warn. */
6288 || (default_node
6289 && max && wi::eq_p (max, 1)
6290 && min && wi::eq_p (min, 0)))
6291 warning_at (switch_location, OPT_Wswitch_bool,
6292 "switch condition has boolean value");
6293 }
6294
026c3cfd 6295 /* From here on, we only care about enumerated types. */
c782c2fe
RS		 6296 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
6297 return;
6298
cdb88468
ILT		 6299 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6300 if (!warn_switch_enum && !warn_switch)
c782c2fe
RS		 6301 return;
6302
cdb88468
ILT		 6303 /* Check the cases. Warn about case values which are not members of
6304 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6305 there is no default case, check that exactly all enumeration
6306 literals are covered by the cases. */
6307
c782c2fe
RS		 6308 /* Clearing COND if it is not an integer constant simplifies
6309 the tests inside the loop below. */
6310 if (TREE_CODE (cond) != INTEGER_CST)
6311 cond = NULL_TREE;
6312
6313 /* The time complexity here is O(N*lg(N)) worst case, but for the
6314 common case of monotonically increasing enumerators, it is
6315 O(N), since the nature of the splay tree will keep the next
6316 element adjacent to the root at all times. */
6de9cd9a 6317
c782c2fe
RS		 6318 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
6319 {
6320 tree value = TREE_VALUE (chain);
adf2edec
DG		 6321 if (TREE_CODE (value) == CONST_DECL)
6322 value = DECL_INITIAL (value);
c782c2fe
RS		 6323 node = splay_tree_lookup (cases, (splay_tree_key) value);
6324 if (node)
6de9cd9a 6325 {
c782c2fe
RS		 6326 /* Mark the CASE_LOW part of the case entry as seen. */
6327 tree label = (tree) node->value;
6328 CASE_LOW_SEEN (label) = 1;
6329 continue;
6330 }
6331
6332 /* Even though there wasn't an exact match, there might be a
fa10beec 6333 case range which includes the enumerator's value. */
c782c2fe
RS		 6334 node = splay_tree_predecessor (cases, (splay_tree_key) value);
6335 if (node && CASE_HIGH ((tree) node->value))
6336 {
6337 tree label = (tree) node->value;
6338 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
6339 if (cmp >= 0)
6de9cd9a 6340 {
c782c2fe
RS		 6341 /* If we match the upper bound exactly, mark the CASE_HIGH
6342 part of the case entry as seen. */
6343 if (cmp == 0)
6344 CASE_HIGH_SEEN (label) = 1;
6345 continue;
6de9cd9a
DN		 6346 }
6347 }
6348
c782c2fe
RS		 6349 /* We've now determined that this enumerated literal isn't
6350 handled by the case labels of the switch statement. */
6de9cd9a 6351
c782c2fe
RS		 6352 /* If the switch expression is a constant, we only really care
6353 about whether that constant is handled by the switch. */
6354 if (cond && tree_int_cst_compare (cond, value))
6355 continue;
6de9cd9a 6356
683d6ff9 6357 /* If there is a default_node, the only relevant option is
cdb88468 6358 Wswitch-enum. Otherwise, if both are enabled then we prefer
683d6ff9
MLI		 6359 to warn using -Wswitch because -Wswitch is enabled by -Wall
6360 while -Wswitch-enum is explicit. */
cdb88468
ILT		 6361 warning_at (switch_location,
6362 (default_node || !warn_switch
6363 ? OPT_Wswitch_enum
6364 : OPT_Wswitch),
6365 "enumeration value %qE not handled in switch",
6366 TREE_PURPOSE (chain));
6de9cd9a 6367 }
c782c2fe
RS		 6368
6369 /* Warn if there are case expressions that don't correspond to
6370 enumerators. This can occur since C and C++ don't enforce
6371 type-checking of assignments to enumeration variables.
6372
6373 The time complexity here is now always O(N) worst case, since
6374 we should have marked both the lower bound and upper bound of
6375 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6376 above. This scan also resets those fields. */
683d6ff9 6377
c782c2fe 6378 splay_tree_foreach (cases, match_case_to_enum, type);
8f17b5c5
MM		 6379}
6380
6b665219 6381/* Finish an expression taking the address of LABEL (an
6a3799eb
AH		 6382 IDENTIFIER_NODE). Returns an expression for the address.
6383
6384 LOC is the location for the expression returned. */
15b732b2 6385
35b1a6fa 6386tree
6a3799eb 6387finish_label_address_expr (tree label, location_t loc)
15b732b2
NB		 6388{
6389 tree result;
6390
c1771a20 6391 pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard");
15b732b2 6392
6b665219
MM		 6393 if (label == error_mark_node)
6394 return error_mark_node;
6395
15b732b2
NB		 6396 label = lookup_label (label);
6397 if (label == NULL_TREE)
6398 result = null_pointer_node;
6399 else
6400 {
6401 TREE_USED (label) = 1;
6402 result = build1 (ADDR_EXPR, ptr_type_node, label);
5805e48d 6403 /* The current function is not necessarily uninlinable.
15b732b2
NB		 6404 Computed gotos are incompatible with inlining, but the value
6405 here could be used only in a diagnostic, for example. */
6a3799eb 6406 protected_set_expr_location (result, loc);
15b732b2
NB		 6407 }
6408
6409 return result;
6410}
19552aa5
JM		 6411\f
6412
6413/* Given a boolean expression ARG, return a tree representing an increment
6414 or decrement (as indicated by CODE) of ARG. The front end must check for
6415 invalid cases (e.g., decrement in C++). */
6416tree
35b1a6fa 6417boolean_increment (enum tree_code code, tree arg)
19552aa5
JM		 6418{
6419 tree val;
b5119fa1 6420 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
37fa72e9 6421
19552aa5
JM		 6422 arg = stabilize_reference (arg);
6423 switch (code)
6424 {
6425 case PREINCREMENT_EXPR:
53fb4de3 6426 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
19552aa5
JM		 6427 break;
6428 case POSTINCREMENT_EXPR:
53fb4de3 6429 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
19552aa5 6430 arg = save_expr (arg);
53fb4de3
RS		 6431 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6432 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
19552aa5
JM		 6433 break;
6434 case PREDECREMENT_EXPR:
53fb4de3 6435 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
db3927fb 6436 invert_truthvalue_loc (input_location, arg));
19552aa5
JM		 6437 break;
6438 case POSTDECREMENT_EXPR:
53fb4de3 6439 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
db3927fb 6440 invert_truthvalue_loc (input_location, arg));
19552aa5 6441 arg = save_expr (arg);
53fb4de3
RS		 6442 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6443 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
19552aa5
JM		 6444 break;
6445 default:
366de0ce 6446 gcc_unreachable ();
19552aa5
JM		 6447 }
6448 TREE_SIDE_EFFECTS (val) = 1;
6449 return val;
6450}
03dc0325 6451\f
207bf79d
JM		 6452/* Built-in macros for stddef.h and stdint.h, that require macros
6453 defined in this file. */
460bd0e3 6454void
35b1a6fa 6455c_stddef_cpp_builtins(void)
3df89291 6456{
5279d739
ZW		 6457 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
6458 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
6459 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
6460 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
85291069
JM		 6461 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
6462 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
c466b2cd
KVH		 6463 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
6464 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
207bf79d
JM		 6465 if (SIG_ATOMIC_TYPE)
6466 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
6467 if (INT8_TYPE)
6468 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
6469 if (INT16_TYPE)
6470 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
6471 if (INT32_TYPE)
6472 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
6473 if (INT64_TYPE)
6474 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
6475 if (UINT8_TYPE)
6476 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
6477 if (UINT16_TYPE)
6478 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
6479 if (UINT32_TYPE)
6480 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
6481 if (UINT64_TYPE)
6482 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
6483 if (INT_LEAST8_TYPE)
6484 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
6485 if (INT_LEAST16_TYPE)
6486 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
6487 if (INT_LEAST32_TYPE)
6488 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
6489 if (INT_LEAST64_TYPE)
6490 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
6491 if (UINT_LEAST8_TYPE)
6492 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
6493 if (UINT_LEAST16_TYPE)
6494 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
6495 if (UINT_LEAST32_TYPE)
6496 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
6497 if (UINT_LEAST64_TYPE)
6498 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
6499 if (INT_FAST8_TYPE)
6500 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
6501 if (INT_FAST16_TYPE)
6502 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
6503 if (INT_FAST32_TYPE)
6504 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
6505 if (INT_FAST64_TYPE)
6506 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
6507 if (UINT_FAST8_TYPE)
6508 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
6509 if (UINT_FAST16_TYPE)
6510 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
6511 if (UINT_FAST32_TYPE)
6512 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
6513 if (UINT_FAST64_TYPE)
6514 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
6515 if (INTPTR_TYPE)
6516 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
6517 if (UINTPTR_TYPE)
6518 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
676997cf
RH		 6519}
6520
6431177a 6521static void
35b1a6fa 6522c_init_attributes (void)
6431177a
JM		 6523{
6524 /* Fill in the built_in_attributes array. */
4a90aeeb 6525#define DEF_ATTR_NULL_TREE(ENUM) \
6431177a 6526 built_in_attributes[(int) ENUM] = NULL_TREE;
4a90aeeb 6527#define DEF_ATTR_INT(ENUM, VALUE) \
c62c040f 6528 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
e384e6b5
BS		 6529#define DEF_ATTR_STRING(ENUM, VALUE) \
6530 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6431177a
JM		 6531#define DEF_ATTR_IDENT(ENUM, STRING) \
6532 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6533#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6534 built_in_attributes[(int) ENUM] \
6535 = tree_cons (built_in_attributes[(int) PURPOSE], \
6536 built_in_attributes[(int) VALUE], \
6537 built_in_attributes[(int) CHAIN]);
6431177a
JM		 6538#include "builtin-attrs.def"
6539#undef DEF_ATTR_NULL_TREE
6540#undef DEF_ATTR_INT
6541#undef DEF_ATTR_IDENT
6542#undef DEF_ATTR_TREE_LIST
03dc0325 6543}
26f943fd 6544
943f82e7
JM		 6545/* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6546 identifier as an argument, so the front end shouldn't look it up. */
6547
6548bool
564a129d 6549attribute_takes_identifier_p (const_tree attr_id)
943f82e7 6550{
f231b5ff 6551 const struct attribute_spec *spec = lookup_attribute_spec (attr_id);
1b9b91a6
JM		 6552 if (spec == NULL)
6553 /* Unknown attribute that we'll end up ignoring, return true so we
6554 don't complain about an identifier argument. */
6555 return true;
6556 else if (!strcmp ("mode", spec->name)
6557 || !strcmp ("format", spec->name)
6558 || !strcmp ("cleanup", spec->name))
564a129d
JM		 6559 return true;
6560 else
6561 return targetm.attribute_takes_identifier_p (attr_id);
943f82e7
JM		 6562}
6563
349ae713
NB		 6564/* Attribute handlers common to C front ends. */
6565
6566/* Handle a "packed" attribute; arguments as in
6567 struct attribute_spec.handler. */
6568
6569static tree
e18476eb 6570handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
a742c759 6571 int flags, bool *no_add_attrs)
349ae713 6572{
c6e4cc53 6573 if (TYPE_P (*node))
349ae713
NB		 6574 {
6575 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 6576 *node = build_variant_type_copy (*node);
c6e4cc53 6577 TYPE_PACKED (*node) = 1;
349ae713
NB		 6578 }
6579 else if (TREE_CODE (*node) == FIELD_DECL)
646c0835 6580 {
2cd36c22
AN		 6581 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
6582 /* Still pack bitfields. */
6583 && ! DECL_INITIAL (*node))
646c0835
NS		 6584 warning (OPT_Wattributes,
6585 "%qE attribute ignored for field of type %qT",
6586 name, TREE_TYPE (*node));
6587 else
6588 DECL_PACKED (*node) = 1;
6589 }
349ae713 6590 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
c6e4cc53
NS		 6591 used for DECL_REGISTER. It wouldn't mean anything anyway.
6592 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6593 that changes what the typedef is typing. */
349ae713
NB		 6594 else
6595 {
5c498b10 6596 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6597 *no_add_attrs = true;
6598 }
6599
6600 return NULL_TREE;
6601}
6602
6603/* Handle a "nocommon" attribute; arguments as in
6604 struct attribute_spec.handler. */
6605
6606static tree
35b1a6fa 6607handle_nocommon_attribute (tree *node, tree name,
e18476eb
BI		 6608 tree ARG_UNUSED (args),
6609 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 6610{
0ae9bd27 6611 if (VAR_P (*node))
349ae713
NB		 6612 DECL_COMMON (*node) = 0;
6613 else
6614 {
5c498b10 6615 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6616 *no_add_attrs = true;
6617 }
6618
6619 return NULL_TREE;
6620}
6621
6622/* Handle a "common" attribute; arguments as in
6623 struct attribute_spec.handler. */
6624
6625static tree
e18476eb
BI		 6626handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6627 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 6628{
0ae9bd27 6629 if (VAR_P (*node))
349ae713
NB		 6630 DECL_COMMON (*node) = 1;
6631 else
6632 {
5c498b10 6633 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6634 *no_add_attrs = true;
6635 }
6636
6637 return NULL_TREE;
6638}
6639
6640/* Handle a "noreturn" attribute; arguments as in
6641 struct attribute_spec.handler. */
6642
6643static tree
e18476eb
BI		 6644handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6645 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 6646{
6647 tree type = TREE_TYPE (*node);
6648
6649 /* See FIXME comment in c_common_attribute_table. */
2debdb4f
NP		 6650 if (TREE_CODE (*node) == FUNCTION_DECL
6651 || objc_method_decl (TREE_CODE (*node)))
349ae713
NB		 6652 TREE_THIS_VOLATILE (*node) = 1;
6653 else if (TREE_CODE (type) == POINTER_TYPE
6654 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
6655 TREE_TYPE (*node)
6e7ceb17
PC		 6656 = (build_qualified_type
6657 (build_pointer_type
6658 (build_type_variant (TREE_TYPE (type),
6659 TYPE_READONLY (TREE_TYPE (type)), 1)),
6660 TYPE_QUALS (type)));
349ae713
NB		 6661 else
6662 {
5c498b10 6663 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6664 *no_add_attrs = true;
6665 }
6666
6667 return NULL_TREE;
6668}
6669
52bf96d2
JH		 6670/* Handle a "hot" and attribute; arguments as in
6671 struct attribute_spec.handler. */
6672
6673static tree
6674handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
ab442df7 6675 int ARG_UNUSED (flags), bool *no_add_attrs)
52bf96d2 6676{
e45abe1f
RH		 6677 if (TREE_CODE (*node) == FUNCTION_DECL
6678 || TREE_CODE (*node) == LABEL_DECL)
52bf96d2
JH		 6679 {
6680 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
6681 {
45484dcf
MP		 6682 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6683 "with attribute %qs", name, "cold");
52bf96d2
JH		 6684 *no_add_attrs = true;
6685 }
5779e713
MM		 6686 /* Most of the rest of the hot processing is done later with
6687 lookup_attribute. */
52bf96d2
JH		 6688 }
6689 else
6690 {
6691 warning (OPT_Wattributes, "%qE attribute ignored", name);
6692 *no_add_attrs = true;
6693 }
6694
6695 return NULL_TREE;
6696}
e45abe1f 6697
52bf96d2
JH		 6698/* Handle a "cold" and attribute; arguments as in
6699 struct attribute_spec.handler. */
6700
6701static tree
6702handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6703 int ARG_UNUSED (flags), bool *no_add_attrs)
6704{
e45abe1f
RH		 6705 if (TREE_CODE (*node) == FUNCTION_DECL
6706 || TREE_CODE (*node) == LABEL_DECL)
52bf96d2
JH		 6707 {
6708 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
6709 {
45484dcf
MP		 6710 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6711 "with attribute %qs", name, "hot");
52bf96d2
JH		 6712 *no_add_attrs = true;
6713 }
5779e713
MM		 6714 /* Most of the rest of the cold processing is done later with
6715 lookup_attribute. */
52bf96d2
JH		 6716 }
6717 else
6718 {
6719 warning (OPT_Wattributes, "%qE attribute ignored", name);
6720 *no_add_attrs = true;
6721 }
6722
6723 return NULL_TREE;
6724}
6725
e664c61c 6726/* Handle a "no_sanitize_address" attribute; arguments as in
77bc5132
JJ		 6727 struct attribute_spec.handler. */
6728
6729static tree
e664c61c
KS		 6730handle_no_sanitize_address_attribute (tree *node, tree name, tree, int,
6731 bool *no_add_attrs)
77bc5132
JJ		 6732{
6733 if (TREE_CODE (*node) != FUNCTION_DECL)
6734 {
6735 warning (OPT_Wattributes, "%qE attribute ignored", name);
6736 *no_add_attrs = true;
6737 }
6738
6739 return NULL_TREE;
6740}
6741
e664c61c
KS		 6742/* Handle a "no_address_safety_analysis" attribute; arguments as in
6743 struct attribute_spec.handler. */
6744
6745static tree
6746handle_no_address_safety_analysis_attribute (tree *node, tree name, tree, int,
6747 bool *no_add_attrs)
6748{
6749 if (TREE_CODE (*node) != FUNCTION_DECL)
6750 warning (OPT_Wattributes, "%qE attribute ignored", name);
6751 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node)))
6752 DECL_ATTRIBUTES (*node)
6753 = tree_cons (get_identifier ("no_sanitize_address"),
6754 NULL_TREE, DECL_ATTRIBUTES (*node));
6755 *no_add_attrs = true;
6756 return NULL_TREE;
6757}
6758
ce6923c5
MP		 6759/* Handle a "no_sanitize_undefined" attribute; arguments as in
6760 struct attribute_spec.handler. */
6761
6762static tree
6763handle_no_sanitize_undefined_attribute (tree *node, tree name, tree, int,
6764 bool *no_add_attrs)
6765{
6766 if (TREE_CODE (*node) != FUNCTION_DECL)
6767 {
6768 warning (OPT_Wattributes, "%qE attribute ignored", name);
6769 *no_add_attrs = true;
6770 }
6771
6772 return NULL_TREE;
6773}
6774
5434dc07
MD		 6775/* Handle a "stack_protect" attribute; arguments as in
6776 struct attribute_spec.handler. */
6777static tree
6778handle_stack_protect_attribute (tree *node, tree name, tree, int,
6779 bool *no_add_attrs)
6780{
6781 if (TREE_CODE (*node) != FUNCTION_DECL)
6782 {
6783 warning (OPT_Wattributes, "%qE attribute ignored", name);
6784 *no_add_attrs = true;
6785 }
6786 else
6787 DECL_ATTRIBUTES (*node)
6788 = tree_cons (get_identifier ("stack_protect"),
6789 NULL_TREE, DECL_ATTRIBUTES (*node));
6790
6791 return NULL_TREE;
6792}
6793
349ae713
NB		 6794/* Handle a "noinline" attribute; arguments as in
6795 struct attribute_spec.handler. */
6796
6797static tree
35b1a6fa 6798handle_noinline_attribute (tree *node, tree name,
e18476eb
BI		 6799 tree ARG_UNUSED (args),
6800 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 6801{
6802 if (TREE_CODE (*node) == FUNCTION_DECL)
45484dcf
MP		 6803 {
6804 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
6805 {
6806 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6807 "with attribute %qs", name, "always_inline");
6808 *no_add_attrs = true;
6809 }
6810 else
6811 DECL_UNINLINABLE (*node) = 1;
6812 }
349ae713
NB		 6813 else
6814 {
5c498b10 6815 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6816 *no_add_attrs = true;
6817 }
6818
6819 return NULL_TREE;
6820}
6821
86631ea3
MJ		 6822/* Handle a "noclone" attribute; arguments as in
6823 struct attribute_spec.handler. */
6824
6825static tree
6826handle_noclone_attribute (tree *node, tree name,
6827 tree ARG_UNUSED (args),
6828 int ARG_UNUSED (flags), bool *no_add_attrs)
6829{
6830 if (TREE_CODE (*node) != FUNCTION_DECL)
6831 {
6832 warning (OPT_Wattributes, "%qE attribute ignored", name);
6833 *no_add_attrs = true;
6834 }
6835
6836 return NULL_TREE;
6837}
6838
185c9e56
ML		 6839/* Handle a "no_icf" attribute; arguments as in
6840 struct attribute_spec.handler. */
6841
6842static tree
6843handle_noicf_attribute (tree *node, tree name,
6844 tree ARG_UNUSED (args),
6845 int ARG_UNUSED (flags), bool *no_add_attrs)
6846{
6847 if (TREE_CODE (*node) != FUNCTION_DECL)
6848 {
6849 warning (OPT_Wattributes, "%qE attribute ignored", name);
6850 *no_add_attrs = true;
6851 }
6852
6853 return NULL_TREE;
6854}
6855
6856
349ae713
NB		 6857/* Handle a "always_inline" attribute; arguments as in
6858 struct attribute_spec.handler. */
6859
6860static tree
35b1a6fa 6861handle_always_inline_attribute (tree *node, tree name,
e18476eb
BI		 6862 tree ARG_UNUSED (args),
6863 int ARG_UNUSED (flags),
a742c759 6864 bool *no_add_attrs)
349ae713
NB		 6865{
6866 if (TREE_CODE (*node) == FUNCTION_DECL)
6867 {
45484dcf
MP		 6868 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node)))
6869 {
6870 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6871 "with %qs attribute", name, "noinline");
6872 *no_add_attrs = true;
6873 }
3b1661a9
ES		 6874 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
6875 {
6876 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6877 "with %qs attribute", name, "target_clones");
6878 *no_add_attrs = true;
6879 }
45484dcf
MP		 6880 else
6881 /* Set the attribute and mark it for disregarding inline
6882 limits. */
6883 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
349ae713
NB		 6884 }
6885 else
6886 {
5c498b10 6887 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713 6888 *no_add_attrs = true;
4eb7fd83
JJ		 6889 }
6890
6891 return NULL_TREE;
6892}
6893
6894/* Handle a "gnu_inline" attribute; arguments as in
6895 struct attribute_spec.handler. */
6896
6897static tree
6898handle_gnu_inline_attribute (tree *node, tree name,
6899 tree ARG_UNUSED (args),
6900 int ARG_UNUSED (flags),
6901 bool *no_add_attrs)
6902{
6903 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6904 {
6905 /* Do nothing else, just set the attribute. We'll get at
6906 it later with lookup_attribute. */
6907 }
6908 else
6909 {
6910 warning (OPT_Wattributes, "%qE attribute ignored", name);
6911 *no_add_attrs = true;
46a4da10
JH		 6912 }
6913
6914 return NULL_TREE;
6915}
6916
6917/* Handle a "leaf" attribute; arguments as in
6918 struct attribute_spec.handler. */
6919
6920static tree
6921handle_leaf_attribute (tree *node, tree name,
6922 tree ARG_UNUSED (args),
6923 int ARG_UNUSED (flags), bool *no_add_attrs)
6924{
6925 if (TREE_CODE (*node) != FUNCTION_DECL)
6926 {
6927 warning (OPT_Wattributes, "%qE attribute ignored", name);
6928 *no_add_attrs = true;
6929 }
6930 if (!TREE_PUBLIC (*node))
6931 {
6932 warning (OPT_Wattributes, "%qE attribute has no effect on unit local functions", name);
6933 *no_add_attrs = true;
349ae713
NB		 6934 }
6935
6936 return NULL_TREE;
6937}
6938
d752cfdb
JJ		 6939/* Handle an "artificial" attribute; arguments as in
6940 struct attribute_spec.handler. */
6941
6942static tree
6943handle_artificial_attribute (tree *node, tree name,
6944 tree ARG_UNUSED (args),
6945 int ARG_UNUSED (flags),
6946 bool *no_add_attrs)
6947{
6948 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6949 {
6950 /* Do nothing else, just set the attribute. We'll get at
6951 it later with lookup_attribute. */
6952 }
6953 else
6954 {
6955 warning (OPT_Wattributes, "%qE attribute ignored", name);
6956 *no_add_attrs = true;
6957 }
6958
6959 return NULL_TREE;
6960}
6961
0691d1d4
RG		 6962/* Handle a "flatten" attribute; arguments as in
6963 struct attribute_spec.handler. */
6964
6965static tree
6966handle_flatten_attribute (tree *node, tree name,
c22cacf3
MS		 6967 tree args ATTRIBUTE_UNUSED,
6968 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
0691d1d4
RG		 6969{
6970 if (TREE_CODE (*node) == FUNCTION_DECL)
6971 /* Do nothing else, just set the attribute. We'll get at
6972 it later with lookup_attribute. */
6973 ;
6974 else
6975 {
6976 warning (OPT_Wattributes, "%qE attribute ignored", name);
6977 *no_add_attrs = true;
6978 }
6979
6980 return NULL_TREE;
6981}
6982
d2af6a68
JJ		 6983/* Handle a "warning" or "error" attribute; arguments as in
6984 struct attribute_spec.handler. */
6985
6986static tree
6987handle_error_attribute (tree *node, tree name, tree args,
6988 int ARG_UNUSED (flags), bool *no_add_attrs)
6989{
6990 if (TREE_CODE (*node) == FUNCTION_DECL
cf35e2b1 6991 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
d2af6a68
JJ		 6992 /* Do nothing else, just set the attribute. We'll get at
6993 it later with lookup_attribute. */
6994 ;
6995 else
6996 {
6997 warning (OPT_Wattributes, "%qE attribute ignored", name);
6998 *no_add_attrs = true;
6999 }
7000
7001 return NULL_TREE;
7002}
0691d1d4 7003
349ae713
NB		 7004/* Handle a "used" attribute; arguments as in
7005 struct attribute_spec.handler. */
7006
7007static tree
e18476eb
BI		 7008handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
7009 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 7010{
d7ddbe24
RH		 7011 tree node = *pnode;
7012
7013 if (TREE_CODE (node) == FUNCTION_DECL
0ae9bd27 7014 || (VAR_P (node) && TREE_STATIC (node))
3797cb21 7015 || (TREE_CODE (node) == TYPE_DECL))
4d7d0451 7016 {
4d7d0451 7017 TREE_USED (node) = 1;
8e3e233b 7018 DECL_PRESERVE_P (node) = 1;
0ae9bd27 7019 if (VAR_P (node))
ebfbbdc5 7020 DECL_READ_P (node) = 1;
4d7d0451 7021 }
349ae713
NB		 7022 else
7023 {
5c498b10 7024 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7025 *no_add_attrs = true;
7026 }
7027
7028 return NULL_TREE;
7029}
7030
7031/* Handle a "unused" attribute; arguments as in
7032 struct attribute_spec.handler. */
7033
d067e05f 7034tree
e18476eb
BI		 7035handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7036 int flags, bool *no_add_attrs)
349ae713
NB		 7037{
7038 if (DECL_P (*node))
7039 {
7040 tree decl = *node;
7041
7042 if (TREE_CODE (decl) == PARM_DECL
af05e6e5 7043 || VAR_OR_FUNCTION_DECL_P (decl)
349ae713 7044 || TREE_CODE (decl) == LABEL_DECL
d067e05f 7045 || TREE_CODE (decl) == CONST_DECL
349ae713 7046 || TREE_CODE (decl) == TYPE_DECL)
ebfbbdc5
JJ		 7047 {
7048 TREE_USED (decl) = 1;
0ae9bd27 7049 if (VAR_P (decl) || TREE_CODE (decl) == PARM_DECL)
ebfbbdc5
JJ		 7050 DECL_READ_P (decl) = 1;
7051 }
349ae713
NB		 7052 else
7053 {
5c498b10 7054 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7055 *no_add_attrs = true;
7056 }
7057 }
7058 else
7059 {
7060 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 7061 *node = build_variant_type_copy (*node);
349ae713
NB		 7062 TREE_USED (*node) = 1;
7063 }
7064
7065 return NULL_TREE;
7066}
7067
ce91e74c
JH		 7068/* Handle a "externally_visible" attribute; arguments as in
7069 struct attribute_spec.handler. */
7070
7071static tree
7072handle_externally_visible_attribute (tree *pnode, tree name,
7073 tree ARG_UNUSED (args),
7074 int ARG_UNUSED (flags),
7075 bool *no_add_attrs)
7076{
7077 tree node = *pnode;
7078
21b634ae 7079 if (VAR_OR_FUNCTION_DECL_P (node))
ce91e74c 7080 {
343d4b27
JJ		 7081 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
7082 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
7083 {
7084 warning (OPT_Wattributes,
7085 "%qE attribute have effect only on public objects", name);
7086 *no_add_attrs = true;
7087 }
ce91e74c 7088 }
ce91e74c
JH		 7089 else
7090 {
7091 warning (OPT_Wattributes, "%qE attribute ignored", name);
7092 *no_add_attrs = true;
7093 }
7094
7095 return NULL_TREE;
7096}
7097
7861b648
AK		 7098/* Handle the "no_reorder" attribute. Arguments as in
7099 struct attribute_spec.handler. */
7100
7101static tree
7102handle_no_reorder_attribute (tree *pnode,
7103 tree name,
7104 tree,
7105 int,
7106 bool *no_add_attrs)
7107{
7108 tree node = *pnode;
7109
21b634ae 7110 if (!VAR_OR_FUNCTION_DECL_P (node)
7861b648
AK		 7111 && !(TREE_STATIC (node) || DECL_EXTERNAL (node)))
7112 {
7113 warning (OPT_Wattributes,
7114 "%qE attribute only affects top level objects",
7115 name);
7116 *no_add_attrs = true;
7117 }
7118
7119 return NULL_TREE;
7120}
7121
349ae713
NB		 7122/* Handle a "const" attribute; arguments as in
7123 struct attribute_spec.handler. */
7124
7125static tree
e18476eb
BI		 7126handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7127 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7128{
7129 tree type = TREE_TYPE (*node);
7130
7131 /* See FIXME comment on noreturn in c_common_attribute_table. */
7132 if (TREE_CODE (*node) == FUNCTION_DECL)
7133 TREE_READONLY (*node) = 1;
7134 else if (TREE_CODE (type) == POINTER_TYPE
7135 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
7136 TREE_TYPE (*node)
6e7ceb17
PC		 7137 = (build_qualified_type
7138 (build_pointer_type
7139 (build_type_variant (TREE_TYPE (type), 1,
7140 TREE_THIS_VOLATILE (TREE_TYPE (type)))),
7141 TYPE_QUALS (type)));
349ae713
NB		 7142 else
7143 {
5c498b10 7144 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7145 *no_add_attrs = true;
7146 }
7147
7148 return NULL_TREE;
7149}
7150
ee45a32d
EB		 7151/* Handle a "scalar_storage_order" attribute; arguments as in
7152 struct attribute_spec.handler. */
7153
7154static tree
7155handle_scalar_storage_order_attribute (tree *node, tree name, tree args,
7156 int flags, bool *no_add_attrs)
7157{
7158 tree id = TREE_VALUE (args);
7159 tree type;
7160
7161 if (TREE_CODE (*node) == TYPE_DECL
7162 && ! (flags & ATTR_FLAG_CXX11))
7163 node = &TREE_TYPE (*node);
7164 type = *node;
7165
7166 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN)
7167 {
7168 error ("scalar_storage_order is not supported because endianness "
7169 "is not uniform");
7170 return NULL_TREE;
7171 }
7172
7173 if (RECORD_OR_UNION_TYPE_P (type) && !c_dialect_cxx ())
7174 {
7175 bool reverse = false;
7176
7177 if (TREE_CODE (id) == STRING_CST
7178 && strcmp (TREE_STRING_POINTER (id), "big-endian") == 0)
7179 reverse = !BYTES_BIG_ENDIAN;
7180 else if (TREE_CODE (id) == STRING_CST
7181 && strcmp (TREE_STRING_POINTER (id), "little-endian") == 0)
7182 reverse = BYTES_BIG_ENDIAN;
7183 else
7184 {
7185 error ("scalar_storage_order argument must be one of \"big-endian\""
7186 " or \"little-endian\"");
7187 return NULL_TREE;
7188 }
7189
7190 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7191 {
7192 if (reverse)
7193 /* A type variant isn't good enough, since we don't want a cast
7194 to such a type to be removed as a no-op. */
7195 *node = type = build_duplicate_type (type);
7196 }
7197
7198 TYPE_REVERSE_STORAGE_ORDER (type) = reverse;
7199 return NULL_TREE;
7200 }
7201
7202 warning (OPT_Wattributes, "%qE attribute ignored", name);
7203 *no_add_attrs = true;
7204 return NULL_TREE;
7205}
7206
349ae713
NB		 7207/* Handle a "transparent_union" attribute; arguments as in
7208 struct attribute_spec.handler. */
7209
7210static tree
35b1a6fa 7211handle_transparent_union_attribute (tree *node, tree name,
e18476eb 7212 tree ARG_UNUSED (args), int flags,
a742c759 7213 bool *no_add_attrs)
349ae713 7214{
4009f2e7 7215 tree type;
52dd234b
RH		 7216
7217 *no_add_attrs = true;
349ae713 7218
e28d52cf
DS		 7219 if (TREE_CODE (*node) == TYPE_DECL
7220 && ! (flags & ATTR_FLAG_CXX11))
4009f2e7
JM		 7221 node = &TREE_TYPE (*node);
7222 type = *node;
349ae713 7223
52dd234b 7224 if (TREE_CODE (type) == UNION_TYPE)
349ae713 7225 {
d58d6eb5
JM		 7226 /* Make sure that the first field will work for a transparent union.
7227 If the type isn't complete yet, leave the check to the code in
7228 finish_struct. */
7229 if (TYPE_SIZE (type))
7230 {
7231 tree first = first_field (type);
7232 if (first == NULL_TREE
7233 || DECL_ARTIFICIAL (first)
7234 || TYPE_MODE (type) != DECL_MODE (first))
7235 goto ignored;
7236 }
7237
349ae713 7238 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
52dd234b 7239 {
d58d6eb5
JM		 7240 /* If the type isn't complete yet, setting the flag
7241 on a variant wouldn't ever be checked. */
7242 if (!TYPE_SIZE (type))
7243 goto ignored;
7244
7245 /* build_duplicate_type doesn't work for C++. */
7246 if (c_dialect_cxx ())
52dd234b
RH		 7247 goto ignored;
7248
ee45a32d
EB		 7249 /* A type variant isn't good enough, since we don't want a cast
7250 to such a type to be removed as a no-op. */
52dd234b
RH		 7251 *node = type = build_duplicate_type (type);
7252 }
7253
75c8aac3
JH		 7254 for (tree t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7255 TYPE_TRANSPARENT_AGGR (t) = 1;
52dd234b 7256 return NULL_TREE;
349ae713
NB		 7257 }
7258
52dd234b
RH		 7259 ignored:
7260 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7261 return NULL_TREE;
7262}
7263
fc8600f9
MM		 7264/* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7265 get the requested priority for a constructor or destructor,
7266 possibly issuing diagnostics for invalid or reserved
7267 priorities. */
7268
7269static priority_type
7270get_priority (tree args, bool is_destructor)
7271{
7272 HOST_WIDE_INT pri;
b2f4bed8 7273 tree arg;
fc8600f9
MM		 7274
7275 if (!args)
7276 return DEFAULT_INIT_PRIORITY;
b8698a0f 7277
f6fc5c86
MM		 7278 if (!SUPPORTS_INIT_PRIORITY)
7279 {
7280 if (is_destructor)
7281 error ("destructor priorities are not supported");
7282 else
7283 error ("constructor priorities are not supported");
7284 return DEFAULT_INIT_PRIORITY;
7285 }
7286
b2f4bed8 7287 arg = TREE_VALUE (args);
fad7652e
JJ		 7288 if (TREE_CODE (arg) == IDENTIFIER_NODE)
7289 goto invalid;
7290 if (arg == error_mark_node)
7291 return DEFAULT_INIT_PRIORITY;
8d0d1915 7292 arg = default_conversion (arg);
9541ffee 7293 if (!tree_fits_shwi_p (arg)
b2f4bed8 7294 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
fc8600f9
MM		 7295 goto invalid;
7296
9439e9a1 7297 pri = tree_to_shwi (arg);
fc8600f9
MM		 7298 if (pri < 0 || pri > MAX_INIT_PRIORITY)
7299 goto invalid;
7300
7301 if (pri <= MAX_RESERVED_INIT_PRIORITY)
7302 {
7303 if (is_destructor)
7304 warning (0,
7305 "destructor priorities from 0 to %d are reserved "
b8698a0f 7306 "for the implementation",
fc8600f9
MM		 7307 MAX_RESERVED_INIT_PRIORITY);
7308 else
7309 warning (0,
7310 "constructor priorities from 0 to %d are reserved "
b8698a0f 7311 "for the implementation",
fc8600f9
MM		 7312 MAX_RESERVED_INIT_PRIORITY);
7313 }
7314 return pri;
7315
7316 invalid:
7317 if (is_destructor)
7318 error ("destructor priorities must be integers from 0 to %d inclusive",
7319 MAX_INIT_PRIORITY);
7320 else
7321 error ("constructor priorities must be integers from 0 to %d inclusive",
7322 MAX_INIT_PRIORITY);
7323 return DEFAULT_INIT_PRIORITY;
7324}
7325
349ae713
NB		 7326/* Handle a "constructor" attribute; arguments as in
7327 struct attribute_spec.handler. */
7328
7329static tree
fc8600f9 7330handle_constructor_attribute (tree *node, tree name, tree args,
e18476eb 7331 int ARG_UNUSED (flags),
a742c759 7332 bool *no_add_attrs)
349ae713
NB		 7333{
7334 tree decl = *node;
7335 tree type = TREE_TYPE (decl);
7336
7337 if (TREE_CODE (decl) == FUNCTION_DECL
7338 && TREE_CODE (type) == FUNCTION_TYPE
7339 && decl_function_context (decl) == 0)
7340 {
fc8600f9 7341 priority_type priority;
349ae713 7342 DECL_STATIC_CONSTRUCTOR (decl) = 1;
fc8600f9
MM		 7343 priority = get_priority (args, /*is_destructor=*/false);
7344 SET_DECL_INIT_PRIORITY (decl, priority);
349ae713
NB		 7345 TREE_USED (decl) = 1;
7346 }
7347 else
7348 {
5c498b10 7349 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7350 *no_add_attrs = true;
7351 }
7352
7353 return NULL_TREE;
7354}
7355
7356/* Handle a "destructor" attribute; arguments as in
7357 struct attribute_spec.handler. */
7358
7359static tree
fc8600f9 7360handle_destructor_attribute (tree *node, tree name, tree args,
e18476eb 7361 int ARG_UNUSED (flags),
a742c759 7362 bool *no_add_attrs)
349ae713
NB		 7363{
7364 tree decl = *node;
7365 tree type = TREE_TYPE (decl);
7366
7367 if (TREE_CODE (decl) == FUNCTION_DECL
7368 && TREE_CODE (type) == FUNCTION_TYPE
7369 && decl_function_context (decl) == 0)
7370 {
fc8600f9 7371 priority_type priority;
349ae713 7372 DECL_STATIC_DESTRUCTOR (decl) = 1;
fc8600f9
MM		 7373 priority = get_priority (args, /*is_destructor=*/true);
7374 SET_DECL_FINI_PRIORITY (decl, priority);
349ae713
NB		 7375 TREE_USED (decl) = 1;
7376 }
7377 else
7378 {
5c498b10 7379 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7380 *no_add_attrs = true;
7381 }
7382
7383 return NULL_TREE;
7384}
7385
4d451982
MLI		 7386/* Nonzero if the mode is a valid vector mode for this architecture.
7387 This returns nonzero even if there is no hardware support for the
7388 vector mode, but we can emulate with narrower modes. */
7389
7390static int
ef4bddc2 7391vector_mode_valid_p (machine_mode mode)
4d451982
MLI		 7392{
7393 enum mode_class mclass = GET_MODE_CLASS (mode);
ef4bddc2 7394 machine_mode innermode;
4d451982
MLI		 7395
7396 /* Doh! What's going on? */
7397 if (mclass != MODE_VECTOR_INT
7398 && mclass != MODE_VECTOR_FLOAT
7399 && mclass != MODE_VECTOR_FRACT
7400 && mclass != MODE_VECTOR_UFRACT
7401 && mclass != MODE_VECTOR_ACCUM
7402 && mclass != MODE_VECTOR_UACCUM)
7403 return 0;
7404
7405 /* Hardware support. Woo hoo! */
7406 if (targetm.vector_mode_supported_p (mode))
7407 return 1;
7408
7409 innermode = GET_MODE_INNER (mode);
7410
7411 /* We should probably return 1 if requesting V4DI and we have no DI,
7412 but we have V2DI, but this is probably very unlikely. */
7413
7414 /* If we have support for the inner mode, we can safely emulate it.
7415 We may not have V2DI, but me can emulate with a pair of DIs. */
7416 return targetm.scalar_mode_supported_p (innermode);
7417}
7418
7419
349ae713
NB		 7420/* Handle a "mode" attribute; arguments as in
7421 struct attribute_spec.handler. */
7422
7423static tree
e18476eb
BI		 7424handle_mode_attribute (tree *node, tree name, tree args,
7425 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7426{
7427 tree type = *node;
88388a52 7428 tree ident = TREE_VALUE (args);
349ae713
NB		 7429
7430 *no_add_attrs = true;
7431
88388a52 7432 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5c498b10 7433 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7434 else
7435 {
7436 int j;
88388a52 7437 const char *p = IDENTIFIER_POINTER (ident);
349ae713 7438 int len = strlen (p);
ef4bddc2 7439 machine_mode mode = VOIDmode;
349ae713 7440 tree typefm;
6dd53648 7441 bool valid_mode;
349ae713
NB		 7442
7443 if (len > 4 && p[0] == '_' && p[1] == '_'
7444 && p[len - 1] == '_' && p[len - 2] == '_')
7445 {
28dab132 7446 char *newp = (char *) alloca (len - 1);
349ae713
NB		 7447
7448 strcpy (newp, &p[2]);
7449 newp[len - 4] = '\0';
7450 p = newp;
7451 }
7452
7453 /* Change this type to have a type with the specified mode.
7454 First check for the special modes. */
3f75a254 7455 if (!strcmp (p, "byte"))
349ae713
NB		 7456 mode = byte_mode;
7457 else if (!strcmp (p, "word"))
7458 mode = word_mode;
3f75a254 7459 else if (!strcmp (p, "pointer"))
349ae713 7460 mode = ptr_mode;
c7ff6e7a
AK		 7461 else if (!strcmp (p, "libgcc_cmp_return"))
7462 mode = targetm.libgcc_cmp_return_mode ();
7463 else if (!strcmp (p, "libgcc_shift_count"))
7464 mode = targetm.libgcc_shift_count_mode ();
7b0518e3
UW		 7465 else if (!strcmp (p, "unwind_word"))
7466 mode = targetm.unwind_word_mode ();
349ae713
NB		 7467 else
7468 for (j = 0; j < NUM_MACHINE_MODES; j++)
7469 if (!strcmp (p, GET_MODE_NAME (j)))
61f03aba 7470 {
ef4bddc2 7471 mode = (machine_mode) j;
61f03aba
RH		 7472 break;
7473 }
349ae713
NB		 7474
7475 if (mode == VOIDmode)
4a5eab38 7476 {
88388a52 7477 error ("unknown machine mode %qE", ident);
4a5eab38
PB		 7478 return NULL_TREE;
7479 }
7480
6dd53648
RH		 7481 valid_mode = false;
7482 switch (GET_MODE_CLASS (mode))
4a5eab38 7483 {
6dd53648
RH		 7484 case MODE_INT:
7485 case MODE_PARTIAL_INT:
7486 case MODE_FLOAT:
9a8ce21f 7487 case MODE_DECIMAL_FLOAT:
ab22c1fa
CF		 7488 case MODE_FRACT:
7489 case MODE_UFRACT:
7490 case MODE_ACCUM:
7491 case MODE_UACCUM:
6dd53648
RH		 7492 valid_mode = targetm.scalar_mode_supported_p (mode);
7493 break;
7494
7495 case MODE_COMPLEX_INT:
7496 case MODE_COMPLEX_FLOAT:
7497 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
7498 break;
7499
7500 case MODE_VECTOR_INT:
7501 case MODE_VECTOR_FLOAT:
ab22c1fa
CF		 7502 case MODE_VECTOR_FRACT:
7503 case MODE_VECTOR_UFRACT:
7504 case MODE_VECTOR_ACCUM:
7505 case MODE_VECTOR_UACCUM:
5c498b10
DD		 7506 warning (OPT_Wattributes, "specifying vector types with "
7507 "__attribute__ ((mode)) is deprecated");
7508 warning (OPT_Wattributes,
7509 "use __attribute__ ((vector_size)) instead");
6dd53648
RH		 7510 valid_mode = vector_mode_valid_p (mode);
7511 break;
4a5eab38 7512
6dd53648
RH		 7513 default:
7514 break;
7515 }
7516 if (!valid_mode)
7517 {
9e637a26 7518 error ("unable to emulate %qs", p);
6dd53648
RH		 7519 return NULL_TREE;
7520 }
4a5eab38 7521
6dd53648 7522 if (POINTER_TYPE_P (type))
cb2a532e 7523 {
36c5e70a 7524 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
ef4bddc2 7525 tree (*fn)(tree, machine_mode, bool);
6dd53648 7526
36c5e70a 7527 if (!targetm.addr_space.valid_pointer_mode (mode, as))
cb2a532e 7528 {
9e637a26 7529 error ("invalid pointer mode %qs", p);
cb2a532e
AH		 7530 return NULL_TREE;
7531 }
7532
c22cacf3 7533 if (TREE_CODE (type) == POINTER_TYPE)
6dd53648 7534 fn = build_pointer_type_for_mode;
4977bab6 7535 else
6dd53648
RH		 7536 fn = build_reference_type_for_mode;
7537 typefm = fn (TREE_TYPE (type), mode, false);
cb2a532e 7538 }
6dd53648 7539 else
ab22c1fa
CF		 7540 {
7541 /* For fixed-point modes, we need to test if the signness of type
7542 and the machine mode are consistent. */
7543 if (ALL_FIXED_POINT_MODE_P (mode)
7544 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
7545 {
d8a07487 7546 error ("signedness of type and machine mode %qs don%'t match", p);
ab22c1fa
CF		 7547 return NULL_TREE;
7548 }
7549 /* For fixed-point modes, we need to pass saturating info. */
7550 typefm = lang_hooks.types.type_for_mode (mode,
7551 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
7552 : TYPE_UNSIGNED (type));
7553 }
ec8465a5 7554
6dd53648
RH		 7555 if (typefm == NULL_TREE)
7556 {
61f03aba 7557 error ("no data type for mode %qs", p);
6dd53648
RH		 7558 return NULL_TREE;
7559 }
ec8465a5
RK		 7560 else if (TREE_CODE (type) == ENUMERAL_TYPE)
7561 {
7562 /* For enumeral types, copy the precision from the integer
7563 type returned above. If not an INTEGER_TYPE, we can't use
7564 this mode for this type. */
7565 if (TREE_CODE (typefm) != INTEGER_TYPE)
7566 {
61f03aba 7567 error ("cannot use mode %qs for enumeral types", p);
ec8465a5
RK		 7568 return NULL_TREE;
7569 }
7570
99db1ef0
RH		 7571 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
7572 {
7573 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
7574 typefm = type;
7575 }
7576 else
7577 {
7578 /* We cannot build a type variant, as there's code that assumes
7579 that TYPE_MAIN_VARIANT has the same mode. This includes the
7580 debug generators. Instead, create a subrange type. This
7581 results in all of the enumeral values being emitted only once
7582 in the original, and the subtype gets them by reference. */
7583 if (TYPE_UNSIGNED (type))
7584 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
7585 else
7586 typefm = make_signed_type (TYPE_PRECISION (typefm));
7587 TREE_TYPE (typefm) = type;
7588 }
ec8465a5 7589 }
a2d36602
RH		 7590 else if (VECTOR_MODE_P (mode)
7591 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
7592 : TREE_CODE (type) != TREE_CODE (typefm))
61f03aba
RH		 7593 {
7594 error ("mode %qs applied to inappropriate type", p);
7595 return NULL_TREE;
7596 }
7597
6dd53648 7598 *node = typefm;
349ae713
NB		 7599 }
7600
7601 return NULL_TREE;
7602}
7603
7604/* Handle a "section" attribute; arguments as in
7605 struct attribute_spec.handler. */
7606
7607static tree
e18476eb
BI		 7608handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7609 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7610{
7611 tree decl = *node;
7612
0373796b 7613 if (!targetm_common.have_named_sections)
349ae713 7614 {
0373796b
JT		 7615 error_at (DECL_SOURCE_LOCATION (*node),
7616 "section attributes are not supported for this target");
7617 goto fail;
7618 }
9fb32434 7619
0373796b 7620 user_defined_section_attribute = true;
349ae713 7621
21b634ae 7622 if (!VAR_OR_FUNCTION_DECL_P (decl))
0373796b
JT		 7623 {
7624 error ("section attribute not allowed for %q+D", *node);
7625 goto fail;
349ae713 7626 }
0373796b
JT		 7627
7628 if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
349ae713 7629 {
0373796b
JT		 7630 error ("section attribute argument not a string constant");
7631 goto fail;
349ae713
NB		 7632 }
7633
0ae9bd27 7634 if (VAR_P (decl)
0373796b
JT		 7635 && current_function_decl != NULL_TREE
7636 && !TREE_STATIC (decl))
7637 {
7638 error_at (DECL_SOURCE_LOCATION (decl),
7639 "section attribute cannot be specified for local variables");
7640 goto fail;
7641 }
7642
7643 /* The decl may have already been given a section attribute
7644 from a previous declaration. Ensure they match. */
7645 if (DECL_SECTION_NAME (decl) != NULL
7646 && strcmp (DECL_SECTION_NAME (decl),
7647 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
7648 {
7649 error ("section of %q+D conflicts with previous declaration", *node);
7650 goto fail;
7651 }
7652
0ae9bd27 7653 if (VAR_P (decl)
0373796b
JT		 7654 && !targetm.have_tls && targetm.emutls.tmpl_section
7655 && DECL_THREAD_LOCAL_P (decl))
7656 {
7657 error ("section of %q+D cannot be overridden", *node);
7658 goto fail;
7659 }
7660
7661 set_decl_section_name (decl, TREE_STRING_POINTER (TREE_VALUE (args)));
7662 return NULL_TREE;
7663
7664fail:
7665 *no_add_attrs = true;
349ae713
NB		 7666 return NULL_TREE;
7667}
7668
d19fa6b5
JM		 7669/* Check whether ALIGN is a valid user-specified alignment. If so,
7670 return its base-2 log; if not, output an error and return -1. If
7671 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7672 no error. */
7673int
7674check_user_alignment (const_tree align, bool allow_zero)
7675{
7676 int i;
7677
661a0813
MP		 7678 if (error_operand_p (align))
7679 return -1;
a859517f
MP		 7680 if (TREE_CODE (align) != INTEGER_CST
7681 || !INTEGRAL_TYPE_P (TREE_TYPE (align)))
d19fa6b5
JM		 7682 {
7683 error ("requested alignment is not an integer constant");
7684 return -1;
7685 }
7686 else if (allow_zero && integer_zerop (align))
7687 return -1;
3f12f6e9
SKS		 7688 else if (tree_int_cst_sgn (align) == -1
7689 || (i = tree_log2 (align)) == -1)
d19fa6b5 7690 {
3f12f6e9 7691 error ("requested alignment is not a positive power of 2");
d19fa6b5
JM		 7692 return -1;
7693 }
7694 else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG)
7695 {
7696 error ("requested alignment is too large");
7697 return -1;
7698 }
7699 return i;
7700}
7701
e28d52cf
DS		 7702/*
7703 If in c++-11, check if the c++-11 alignment constraint with respect
7704 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7705 c++-11 mode, does nothing.
7706
7707 [dcl.align]2/ says:
7708
7709 [* if the constant expression evaluates to a fundamental alignment,
7710 the alignment requirement of the declared entity shall be the
7711 specified fundamental alignment.
7712
7713 * if the constant expression evaluates to an extended alignment
7714 and the implementation supports that alignment in the context
7715 of the declaration, the alignment of the declared entity shall
7716 be that alignment
7717
7718 * if the constant expression evaluates to an extended alignment
7719 and the implementation does not support that alignment in the
7720 context of the declaration, the program is ill-formed]. */
7721
7722static bool
7723check_cxx_fundamental_alignment_constraints (tree node,
7724 unsigned align_log,
7725 int flags)
7726{
7727 bool alignment_too_large_p = false;
7728 unsigned requested_alignment = 1U << align_log;
7729 unsigned max_align = 0;
7730
7731 if ((!(flags & ATTR_FLAG_CXX11) && !warn_cxx_compat)
7732 || (node == NULL_TREE || node == error_mark_node))
7733 return true;
7734
7735 if (cxx_fundamental_alignment_p (requested_alignment))
7736 return true;
7737
7738 if (DECL_P (node))
7739 {
7740 if (TREE_STATIC (node))
7741 {
7742 /* For file scope variables and static members, the target
7743 supports alignments that are at most
7744 MAX_OFILE_ALIGNMENT. */
7745 if (requested_alignment > (max_align = MAX_OFILE_ALIGNMENT))
7746 alignment_too_large_p = true;
7747 }
7748 else
7749 {
7750#ifdef BIGGEST_FIELD_ALIGNMENT
7751#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7752#else
7753#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7754#endif
7755 /* For non-static members, the target supports either
7756 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7757 if it is defined or BIGGEST_ALIGNMENT. */
7758 max_align = MAX_TARGET_FIELD_ALIGNMENT;
7759 if (TREE_CODE (node) == FIELD_DECL
7760 && requested_alignment > (max_align = MAX_TARGET_FIELD_ALIGNMENT))
7761 alignment_too_large_p = true;
7762#undef MAX_TARGET_FIELD_ALIGNMENT
7763 /* For stack variables, the target supports at most
7764 MAX_STACK_ALIGNMENT. */
7765 else if (decl_function_context (node) != NULL
7766 && requested_alignment > (max_align = MAX_STACK_ALIGNMENT))
7767 alignment_too_large_p = true;
7768 }
7769 }
7770 else if (TYPE_P (node))
7771 {
7772 /* Let's be liberal for types. */
7773 if (requested_alignment > (max_align = BIGGEST_ALIGNMENT))
7774 alignment_too_large_p = true;
7775 }
7776
7777 if (alignment_too_large_p)
7778 pedwarn (input_location, OPT_Wattributes,
7779 "requested alignment %d is larger than %d",
7780 requested_alignment, max_align);
7781
7782 return !alignment_too_large_p;
7783}
7784
349ae713
NB		 7785/* Handle a "aligned" attribute; arguments as in
7786 struct attribute_spec.handler. */
7787
7788static tree
e18476eb 7789handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
a742c759 7790 int flags, bool *no_add_attrs)
349ae713
NB		 7791{
7792 tree decl = NULL_TREE;
7793 tree *type = NULL;
7794 int is_type = 0;
5d77fb19 7795 tree align_expr;
349ae713
NB		 7796 int i;
7797
5d77fb19
MG		 7798 if (args)
7799 {
7800 align_expr = TREE_VALUE (args);
661a0813
MP		 7801 if (align_expr && TREE_CODE (align_expr) != IDENTIFIER_NODE
7802 && TREE_CODE (align_expr) != FUNCTION_DECL)
5d77fb19
MG		 7803 align_expr = default_conversion (align_expr);
7804 }
7805 else
7806 align_expr = size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT);
7807
349ae713
NB		 7808 if (DECL_P (*node))
7809 {
7810 decl = *node;
7811 type = &TREE_TYPE (decl);
7812 is_type = TREE_CODE (*node) == TYPE_DECL;
7813 }
7814 else if (TYPE_P (*node))
7815 type = node, is_type = 1;
7816
509063eb 7817 if ((i = check_user_alignment (align_expr, true)) == -1
e28d52cf 7818 || !check_cxx_fundamental_alignment_constraints (*node, i, flags))
d19fa6b5 7819 *no_add_attrs = true;
349ae713
NB		 7820 else if (is_type)
7821 {
0f559c16
JM		 7822 if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7823 /* OK, modify the type in place. */;
349ae713
NB		 7824 /* If we have a TYPE_DECL, then copy the type, so that we
7825 don't accidentally modify a builtin type. See pushdecl. */
0f559c16
JM		 7826 else if (decl && TREE_TYPE (decl) != error_mark_node
7827 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
349ae713
NB		 7828 {
7829 tree tt = TREE_TYPE (decl);
8dd16ecc 7830 *type = build_variant_type_copy (*type);
349ae713
NB		 7831 DECL_ORIGINAL_TYPE (decl) = tt;
7832 TYPE_NAME (*type) = decl;
7833 TREE_USED (*type) = TREE_USED (decl);
7834 TREE_TYPE (decl) = *type;
7835 }
0f559c16 7836 else
8dd16ecc 7837 *type = build_variant_type_copy (*type);
349ae713 7838
fe37c7af 7839 SET_TYPE_ALIGN (*type, (1U << i) * BITS_PER_UNIT);
349ae713
NB		 7840 TYPE_USER_ALIGN (*type) = 1;
7841 }
837edd5f 7842 else if (! VAR_OR_FUNCTION_DECL_P (decl)
349ae713
NB		 7843 && TREE_CODE (decl) != FIELD_DECL)
7844 {
dee15844 7845 error ("alignment may not be specified for %q+D", decl);
349ae713
NB		 7846 *no_add_attrs = true;
7847 }
e28d52cf
DS		 7848 else if (DECL_USER_ALIGN (decl)
7849 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
7850 /* C++-11 [dcl.align/4]:
7851
7852 When multiple alignment-specifiers are specified for an
7853 entity, the alignment requirement shall be set to the
7854 strictest specified alignment.
7855
7856 This formally comes from the c++11 specification but we are
7857 doing it for the GNU attribute syntax as well. */
7858 *no_add_attrs = true;
837edd5f 7859 else if (TREE_CODE (decl) == FUNCTION_DECL
d9223014 7860 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
837edd5f
GK		 7861 {
7862 if (DECL_USER_ALIGN (decl))
7863 error ("alignment for %q+D was previously specified as %d "
7864 "and may not be decreased", decl,
7865 DECL_ALIGN (decl) / BITS_PER_UNIT);
7866 else
7867 error ("alignment for %q+D must be at least %d", decl,
7868 DECL_ALIGN (decl) / BITS_PER_UNIT);
7869 *no_add_attrs = true;
7870 }
349ae713
NB		 7871 else
7872 {
fe37c7af 7873 SET_DECL_ALIGN (decl, (1U << i) * BITS_PER_UNIT);
349ae713
NB		 7874 DECL_USER_ALIGN (decl) = 1;
7875 }
7876
7877 return NULL_TREE;
7878}
7879
7880/* Handle a "weak" attribute; arguments as in
7881 struct attribute_spec.handler. */
7882
7883static tree
55af93a8 7884handle_weak_attribute (tree *node, tree name,
e18476eb
BI		 7885 tree ARG_UNUSED (args),
7886 int ARG_UNUSED (flags),
7887 bool * ARG_UNUSED (no_add_attrs))
349ae713 7888{
55af93a8 7889 if (TREE_CODE (*node) == FUNCTION_DECL
6b4e94bc
RG		 7890 && DECL_DECLARED_INLINE_P (*node))
7891 {
2aa9c6ae 7892 warning (OPT_Wattributes, "inline function %q+D declared weak", *node);
6b4e94bc
RG		 7893 *no_add_attrs = true;
7894 }
ba885ec5
NS		 7895 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
7896 {
7897 error ("indirect function %q+D cannot be declared weak", *node);
7898 *no_add_attrs = true;
7899 return NULL_TREE;
7900 }
21b634ae 7901 else if (VAR_OR_FUNCTION_DECL_P (*node))
c316b5e4 7902 declare_weak (*node);
55af93a8
DS		 7903 else
7904 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7905
7906 return NULL_TREE;
7907}
7908
4bb794e2
ST		 7909/* Handle a "noplt" attribute; arguments as in
7910 struct attribute_spec.handler. */
7911
7912static tree
7913handle_noplt_attribute (tree *node, tree name,
7914 tree ARG_UNUSED (args),
7915 int ARG_UNUSED (flags),
7916 bool * ARG_UNUSED (no_add_attrs))
7917{
7918 if (TREE_CODE (*node) != FUNCTION_DECL)
7919 {
7920 warning (OPT_Wattributes,
7921 "%qE attribute is only applicable on functions", name);
7922 *no_add_attrs = true;
7923 return NULL_TREE;
7924 }
7925 return NULL_TREE;
7926}
7927
ba885ec5
NS		 7928/* Handle an "alias" or "ifunc" attribute; arguments as in
7929 struct attribute_spec.handler, except that IS_ALIAS tells us
7930 whether this is an alias as opposed to ifunc attribute. */
349ae713
NB		 7931
7932static tree
ba885ec5
NS		 7933handle_alias_ifunc_attribute (bool is_alias, tree *node, tree name, tree args,
7934 bool *no_add_attrs)
349ae713
NB		 7935{
7936 tree decl = *node;
7937
ba885ec5 7938 if (TREE_CODE (decl) != FUNCTION_DECL
0ae9bd27 7939 && (!is_alias || !VAR_P (decl)))
feab5a67
JM		 7940 {
7941 warning (OPT_Wattributes, "%qE attribute ignored", name);
7942 *no_add_attrs = true;
7943 }
7944 else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
b8698a0f 7945 || (TREE_CODE (decl) != FUNCTION_DECL
a9b0b825
GK		 7946 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
7947 /* A static variable declaration is always a tentative definition,
7948 but the alias is a non-tentative definition which overrides. */
b8698a0f 7949 || (TREE_CODE (decl) != FUNCTION_DECL
a9b0b825 7950 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
349ae713 7951 {
ba885ec5 7952 error ("%q+D defined both normally and as %qE attribute", decl, name);
349ae713 7953 *no_add_attrs = true;
ba885ec5 7954 return NULL_TREE;
349ae713 7955 }
ba885ec5
NS		 7956 else if (!is_alias
7957 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
7958 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))))
7959 {
7960 error ("weak %q+D cannot be defined %qE", decl, name);
7961 *no_add_attrs = true;
7962 return NULL_TREE;
7963 }
f6a76b9f
RH		 7964
7965 /* Note that the very first time we process a nested declaration,
7966 decl_function_context will not be set. Indeed, *would* never
7967 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7968 we do below. After such frobbery, pushdecl would set the context.
7969 In any case, this is never what we want. */
7970 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
349ae713
NB		 7971 {
7972 tree id;
7973
7974 id = TREE_VALUE (args);
7975 if (TREE_CODE (id) != STRING_CST)
7976 {
ba885ec5 7977 error ("attribute %qE argument not a string", name);
349ae713
NB		 7978 *no_add_attrs = true;
7979 return NULL_TREE;
7980 }
7981 id = get_identifier (TREE_STRING_POINTER (id));
7982 /* This counts as a use of the object pointed to. */
7983 TREE_USED (id) = 1;
7984
7985 if (TREE_CODE (decl) == FUNCTION_DECL)
7986 DECL_INITIAL (decl) = error_mark_node;
7987 else
08346abd 7988 TREE_STATIC (decl) = 1;
ba885ec5
NS		 7989
7990 if (!is_alias)
7991 /* ifuncs are also aliases, so set that attribute too. */
7992 DECL_ATTRIBUTES (decl)
7993 = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
349ae713
NB		 7994 }
7995 else
7996 {
5c498b10 7997 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7998 *no_add_attrs = true;
7999 }
8000
f7217cde
JH		 8001 if (decl_in_symtab_p (*node))
8002 {
8003 struct symtab_node *n = symtab_node::get (decl);
8004 if (n && n->refuse_visibility_changes)
8005 {
8006 if (is_alias)
8007 error ("%+D declared alias after being used", decl);
8008 else
8009 error ("%+D declared ifunc after being used", decl);
8010 }
8011 }
8012
8013
349ae713
NB		 8014 return NULL_TREE;
8015}
8016
ba885ec5
NS		 8017/* Handle an "alias" or "ifunc" attribute; arguments as in
8018 struct attribute_spec.handler. */
8019
8020static tree
8021handle_ifunc_attribute (tree *node, tree name, tree args,
8022 int ARG_UNUSED (flags), bool *no_add_attrs)
8023{
8024 return handle_alias_ifunc_attribute (false, node, name, args, no_add_attrs);
8025}
8026
8027/* Handle an "alias" or "ifunc" attribute; arguments as in
8028 struct attribute_spec.handler. */
8029
8030static tree
8031handle_alias_attribute (tree *node, tree name, tree args,
8032 int ARG_UNUSED (flags), bool *no_add_attrs)
8033{
8034 return handle_alias_ifunc_attribute (true, node, name, args, no_add_attrs);
8035}
8036
a0203ca7
AO		 8037/* Handle a "weakref" attribute; arguments as in struct
8038 attribute_spec.handler. */
8039
8040static tree
8041handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8042 int flags, bool *no_add_attrs)
8043{
8044 tree attr = NULL_TREE;
8045
e1cf56b1
AO		 8046 /* We must ignore the attribute when it is associated with
8047 local-scoped decls, since attribute alias is ignored and many
8048 such symbols do not even have a DECL_WEAK field. */
e7b012c0
JJ		 8049 if (decl_function_context (*node)
8050 || current_function_decl
21b634ae 8051 || !VAR_OR_FUNCTION_DECL_P (*node))
e1cf56b1
AO		 8052 {
8053 warning (OPT_Wattributes, "%qE attribute ignored", name);
8054 *no_add_attrs = true;
8055 return NULL_TREE;
8056 }
8057
ba885ec5
NS		 8058 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
8059 {
8060 error ("indirect function %q+D cannot be declared weakref", *node);
8061 *no_add_attrs = true;
8062 return NULL_TREE;
8063 }
8064
a0203ca7
AO		 8065 /* The idea here is that `weakref("name")' mutates into `weakref,
8066 alias("name")', and weakref without arguments, in turn,
8067 implicitly adds weak. */
8068
8069 if (args)
8070 {
8071 attr = tree_cons (get_identifier ("alias"), args, attr);
8072 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
8073
8074 *no_add_attrs = true;
a9b0b825
GK		 8075
8076 decl_attributes (node, attr, flags);
a0203ca7
AO		 8077 }
8078 else
8079 {
8080 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
c5d75364
MLI		 8081 error_at (DECL_SOURCE_LOCATION (*node),
8082 "weakref attribute must appear before alias attribute");
a0203ca7 8083
a9b0b825
GK		 8084 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8085 and that isn't supported; and because it wants to add it to
8086 the list of weak decls, which isn't helpful. */
8087 DECL_WEAK (*node) = 1;
a0203ca7
AO		 8088 }
8089
f7217cde
JH		 8090 if (decl_in_symtab_p (*node))
8091 {
8092 struct symtab_node *n = symtab_node::get (*node);
8093 if (n && n->refuse_visibility_changes)
8094 error ("%+D declared weakref after being used", *node);
8095 }
8096
a0203ca7
AO		 8097 return NULL_TREE;
8098}
8099
349ae713
NB		 8100/* Handle an "visibility" attribute; arguments as in
8101 struct attribute_spec.handler. */
8102
8103static tree
35b1a6fa 8104handle_visibility_attribute (tree *node, tree name, tree args,
e18476eb 8105 int ARG_UNUSED (flags),
b9e75696 8106 bool *ARG_UNUSED (no_add_attrs))
349ae713
NB		 8107{
8108 tree decl = *node;
968b41a1 8109 tree id = TREE_VALUE (args);
b9e75696 8110 enum symbol_visibility vis;
349ae713 8111
d7afec4b
ND		 8112 if (TYPE_P (*node))
8113 {
b9e75696
JM		 8114 if (TREE_CODE (*node) == ENUMERAL_TYPE)
8115 /* OK */;
a868811e 8116 else if (!RECORD_OR_UNION_TYPE_P (*node))
b9e75696
JM		 8117 {
8118 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
8119 name);
8120 return NULL_TREE;
8121 }
8122 else if (TYPE_FIELDS (*node))
8123 {
8124 error ("%qE attribute ignored because %qT is already defined",
8125 name, *node);
8126 return NULL_TREE;
8127 }
d7afec4b 8128 }
3f75a254 8129 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
349ae713 8130 {
5c498b10 8131 warning (OPT_Wattributes, "%qE attribute ignored", name);
968b41a1 8132 return NULL_TREE;
349ae713 8133 }
349ae713 8134
968b41a1
MA		 8135 if (TREE_CODE (id) != STRING_CST)
8136 {
40b97a2e 8137 error ("visibility argument not a string");
968b41a1 8138 return NULL_TREE;
349ae713 8139 }
9f63daea 8140
d7afec4b
ND		 8141 /* If this is a type, set the visibility on the type decl. */
8142 if (TYPE_P (decl))
8143 {
8144 decl = TYPE_NAME (decl);
3f75a254 8145 if (!decl)
c22cacf3 8146 return NULL_TREE;
e8233ac2
AP		 8147 if (TREE_CODE (decl) == IDENTIFIER_NODE)
8148 {
5c498b10 8149 warning (OPT_Wattributes, "%qE attribute ignored on types",
e8233ac2
AP		 8150 name);
8151 return NULL_TREE;
8152 }
d7afec4b 8153 }
349ae713 8154
968b41a1 8155 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
b9e75696 8156 vis = VISIBILITY_DEFAULT;
968b41a1 8157 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
b9e75696 8158 vis = VISIBILITY_INTERNAL;
968b41a1 8159 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
b9e75696 8160 vis = VISIBILITY_HIDDEN;
968b41a1 8161 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
b9e75696 8162 vis = VISIBILITY_PROTECTED;
968b41a1 8163 else
b9e75696
JM		 8164 {
8165 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8166 vis = VISIBILITY_DEFAULT;
8167 }
8168
8169 if (DECL_VISIBILITY_SPECIFIED (decl)
3a687f8b
MM		 8170 && vis != DECL_VISIBILITY (decl))
8171 {
8172 tree attributes = (TYPE_P (*node)
8173 ? TYPE_ATTRIBUTES (*node)
8174 : DECL_ATTRIBUTES (decl));
8175 if (lookup_attribute ("visibility", attributes))
8176 error ("%qD redeclared with different visibility", decl);
8177 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8178 && lookup_attribute ("dllimport", attributes))
8179 error ("%qD was declared %qs which implies default visibility",
8180 decl, "dllimport");
8181 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8182 && lookup_attribute ("dllexport", attributes))
8183 error ("%qD was declared %qs which implies default visibility",
8184 decl, "dllexport");
8185 }
b9e75696
JM		 8186
8187 DECL_VISIBILITY (decl) = vis;
d7afec4b
ND		 8188 DECL_VISIBILITY_SPECIFIED (decl) = 1;
8189
b9e75696
JM		 8190 /* Go ahead and attach the attribute to the node as well. This is needed
8191 so we can determine whether we have VISIBILITY_DEFAULT because the
8192 visibility was not specified, or because it was explicitly overridden
8193 from the containing scope. */
968b41a1 8194
349ae713
NB		 8195 return NULL_TREE;
8196}
8197
b2ca3702
MM		 8198/* Determine the ELF symbol visibility for DECL, which is either a
8199 variable or a function. It is an error to use this function if a
8200 definition of DECL is not available in this translation unit.
8201 Returns true if the final visibility has been determined by this
8202 function; false if the caller is free to make additional
8203 modifications. */
8204
8205bool
8206c_determine_visibility (tree decl)
8207{
21b634ae 8208 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
b2ca3702
MM		 8209
8210 /* If the user explicitly specified the visibility with an
8211 attribute, honor that. DECL_VISIBILITY will have been set during
6d87092d
JM		 8212 the processing of the attribute. We check for an explicit
8213 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8214 to distinguish the use of an attribute from the use of a "#pragma
8215 GCC visibility push(...)"; in the latter case we still want other
8216 considerations to be able to overrule the #pragma. */
8217 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
8218 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8219 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
8220 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
b2ca3702
MM		 8221 return true;
8222
b9e75696
JM		 8223 /* Set default visibility to whatever the user supplied with
8224 visibility_specified depending on #pragma GCC visibility. */
8225 if (!DECL_VISIBILITY_SPECIFIED (decl))
8226 {
09812622
JJ		 8227 if (visibility_options.inpragma
8228 || DECL_VISIBILITY (decl) != default_visibility)
8229 {
8230 DECL_VISIBILITY (decl) = default_visibility;
8231 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
8232 /* If visibility changed and DECL already has DECL_RTL, ensure
8233 symbol flags are updated. */
0ae9bd27 8234 if (((VAR_P (decl) && TREE_STATIC (decl))
09812622
JJ		 8235 || TREE_CODE (decl) == FUNCTION_DECL)
8236 && DECL_RTL_SET_P (decl))
8237 make_decl_rtl (decl);
8238 }
b9e75696 8239 }
b2ca3702
MM		 8240 return false;
8241}
8242
dce81a1a
JJ		 8243/* Handle an "tls_model" attribute; arguments as in
8244 struct attribute_spec.handler. */
8245
8246static tree
35b1a6fa 8247handle_tls_model_attribute (tree *node, tree name, tree args,
e18476eb 8248 int ARG_UNUSED (flags), bool *no_add_attrs)
dce81a1a 8249{
c2f7fa15 8250 tree id;
dce81a1a 8251 tree decl = *node;
c2f7fa15 8252 enum tls_model kind;
dce81a1a 8253
c2f7fa15
SB		 8254 *no_add_attrs = true;
8255
0ae9bd27 8256 if (!VAR_P (decl) || !DECL_THREAD_LOCAL_P (decl))
dce81a1a 8257 {
5c498b10 8258 warning (OPT_Wattributes, "%qE attribute ignored", name);
c2f7fa15 8259 return NULL_TREE;
dce81a1a 8260 }
dce81a1a 8261
c2f7fa15
SB		 8262 kind = DECL_TLS_MODEL (decl);
8263 id = TREE_VALUE (args);
8264 if (TREE_CODE (id) != STRING_CST)
8265 {
8266 error ("tls_model argument not a string");
8267 return NULL_TREE;
dce81a1a
JJ		 8268 }
8269
c2f7fa15
SB		 8270 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
8271 kind = TLS_MODEL_LOCAL_EXEC;
8272 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
8273 kind = TLS_MODEL_INITIAL_EXEC;
8274 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
8275 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
8276 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
8277 kind = TLS_MODEL_GLOBAL_DYNAMIC;
8278 else
8279 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8280
56363ffd 8281 set_decl_tls_model (decl, kind);
dce81a1a
JJ		 8282 return NULL_TREE;
8283}
8284
349ae713
NB		 8285/* Handle a "no_instrument_function" attribute; arguments as in
8286 struct attribute_spec.handler. */
8287
8288static tree
35b1a6fa 8289handle_no_instrument_function_attribute (tree *node, tree name,
e18476eb
BI		 8290 tree ARG_UNUSED (args),
8291 int ARG_UNUSED (flags),
a742c759 8292 bool *no_add_attrs)
349ae713
NB		 8293{
8294 tree decl = *node;
8295
8296 if (TREE_CODE (decl) != FUNCTION_DECL)
8297 {
c5d75364
MLI		 8298 error_at (DECL_SOURCE_LOCATION (decl),
8299 "%qE attribute applies only to functions", name);
349ae713
NB		 8300 *no_add_attrs = true;
8301 }
349ae713
NB		 8302 else
8303 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
8304
8305 return NULL_TREE;
8306}
8307
8308/* Handle a "malloc" attribute; arguments as in
8309 struct attribute_spec.handler. */
8310
8311static tree
e18476eb
BI		 8312handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8313 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 8314{
3425638a
JM		 8315 if (TREE_CODE (*node) == FUNCTION_DECL
8316 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
349ae713 8317 DECL_IS_MALLOC (*node) = 1;
349ae713
NB		 8318 else
8319 {
5c498b10 8320 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8321 *no_add_attrs = true;
8322 }
8323
8324 return NULL_TREE;
8325}
8326
51bc54a6
DM		 8327/* Handle a "alloc_size" attribute; arguments as in
8328 struct attribute_spec.handler. */
8329
8330static tree
8331handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8332 int ARG_UNUSED (flags), bool *no_add_attrs)
8333{
f3f75f69 8334 unsigned arg_count = type_num_arguments (*node);
51bc54a6
DM		 8335 for (; args; args = TREE_CHAIN (args))
8336 {
8337 tree position = TREE_VALUE (args);
5d77fb19
MG		 8338 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8339 && TREE_CODE (position) != FUNCTION_DECL)
8340 position = default_conversion (position);
51bc54a6 8341
8fcbce72
JJ		 8342 if (!tree_fits_uhwi_p (position)
8343 || !arg_count
8344 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
51bc54a6 8345 {
b8698a0f 8346 warning (OPT_Wattributes,
51bc54a6
DM		 8347 "alloc_size parameter outside range");
8348 *no_add_attrs = true;
8349 return NULL_TREE;
8350 }
8351 }
8352 return NULL_TREE;
8353}
8354
8fcbce72
JJ		 8355/* Handle a "alloc_align" attribute; arguments as in
8356 struct attribute_spec.handler. */
8357
8358static tree
8359handle_alloc_align_attribute (tree *node, tree, tree args, int,
8360 bool *no_add_attrs)
8361{
8362 unsigned arg_count = type_num_arguments (*node);
8363 tree position = TREE_VALUE (args);
8364 if (position && TREE_CODE (position) != IDENTIFIER_NODE)
8365 position = default_conversion (position);
8366
8367 if (!tree_fits_uhwi_p (position)
8368 || !arg_count
8369 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
8370 {
8371 warning (OPT_Wattributes,
8372 "alloc_align parameter outside range");
8373 *no_add_attrs = true;
8374 return NULL_TREE;
8375 }
8376 return NULL_TREE;
8377}
8378
8379/* Handle a "assume_aligned" attribute; arguments as in
8380 struct attribute_spec.handler. */
8381
8382static tree
8383handle_assume_aligned_attribute (tree *, tree, tree args, int,
8384 bool *no_add_attrs)
8385{
8386 for (; args; args = TREE_CHAIN (args))
8387 {
8388 tree position = TREE_VALUE (args);
8389 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8390 && TREE_CODE (position) != FUNCTION_DECL)
8391 position = default_conversion (position);
8392
8393 if (TREE_CODE (position) != INTEGER_CST)
8394 {
8395 warning (OPT_Wattributes,
8396 "assume_aligned parameter not integer constant");
8397 *no_add_attrs = true;
8398 return NULL_TREE;
8399 }
8400 }
8401 return NULL_TREE;
8402}
8403
0b7b376d
RG		 8404/* Handle a "fn spec" attribute; arguments as in
8405 struct attribute_spec.handler. */
8406
8407static tree
8408handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
8409 tree args, int ARG_UNUSED (flags),
8410 bool *no_add_attrs ATTRIBUTE_UNUSED)
8411{
8412 gcc_assert (args
8413 && TREE_CODE (TREE_VALUE (args)) == STRING_CST
8414 && !TREE_CHAIN (args));
8415 return NULL_TREE;
8416}
8417
d5e254e1
IE		 8418/* Handle a "bnd_variable_size" attribute; arguments as in
8419 struct attribute_spec.handler. */
8420
8421static tree
8422handle_bnd_variable_size_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8423 int ARG_UNUSED (flags), bool *no_add_attrs)
8424{
8425 if (TREE_CODE (*node) != FIELD_DECL)
8426 {
8427 warning (OPT_Wattributes, "%qE attribute ignored", name);
8428 *no_add_attrs = true;
8429 }
8430
8431 return NULL_TREE;
8432}
8433
8434/* Handle a "bnd_legacy" attribute; arguments as in
8435 struct attribute_spec.handler. */
8436
8437static tree
8438handle_bnd_legacy (tree *node, tree name, tree ARG_UNUSED (args),
8439 int ARG_UNUSED (flags), bool *no_add_attrs)
8440{
8441 if (TREE_CODE (*node) != FUNCTION_DECL)
8442 {
8443 warning (OPT_Wattributes, "%qE attribute ignored", name);
8444 *no_add_attrs = true;
8445 }
8446
8447 return NULL_TREE;
8448}
8449
8450/* Handle a "bnd_instrument" attribute; arguments as in
8451 struct attribute_spec.handler. */
8452
8453static tree
8454handle_bnd_instrument (tree *node, tree name, tree ARG_UNUSED (args),
8455 int ARG_UNUSED (flags), bool *no_add_attrs)
8456{
8457 if (TREE_CODE (*node) != FUNCTION_DECL)
8458 {
8459 warning (OPT_Wattributes, "%qE attribute ignored", name);
8460 *no_add_attrs = true;
8461 }
8462
8463 return NULL_TREE;
8464}
8465
2a99e5e6
LL		 8466/* Handle a "warn_unused" attribute; arguments as in
8467 struct attribute_spec.handler. */
8468
8469static tree
8470handle_warn_unused_attribute (tree *node, tree name,
8471 tree args ATTRIBUTE_UNUSED,
8472 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
8473{
8474 if (TYPE_P (*node))
8475 /* Do nothing else, just set the attribute. We'll get at
8476 it later with lookup_attribute. */
8477 ;
8478 else
8479 {
8480 warning (OPT_Wattributes, "%qE attribute ignored", name);
8481 *no_add_attrs = true;
8482 }
8483
8484 return NULL_TREE;
8485}
8486
acf0174b
JJ		 8487/* Handle an "omp declare simd" attribute; arguments as in
8488 struct attribute_spec.handler. */
8489
8490static tree
8491handle_omp_declare_simd_attribute (tree *, tree, tree, int, bool *)
8492{
8493 return NULL_TREE;
8494}
8495
fff77217
KY		 8496/* Handle a "simd" attribute. */
8497
8498static tree
e7b69085 8499handle_simd_attribute (tree *node, tree name, tree args, int, bool *no_add_attrs)
fff77217
KY		 8500{
8501 if (TREE_CODE (*node) == FUNCTION_DECL)
8502 {
8503 if (lookup_attribute ("cilk simd function",
8504 DECL_ATTRIBUTES (*node)) != NULL)
8505 {
8506 error_at (DECL_SOURCE_LOCATION (*node),
8507 "%<__simd__%> attribute cannot be used in the same "
8508 "function marked as a Cilk Plus SIMD-enabled function");
8509 *no_add_attrs = true;
8510 }
8511 else
e7b69085
KY		 8512 {
8513 tree t = get_identifier ("omp declare simd");
8514 tree attr = NULL_TREE;
8515 if (args)
8516 {
8517 tree id = TREE_VALUE (args);
8518
8519 if (TREE_CODE (id) != STRING_CST)
8520 {
8521 error ("attribute %qE argument not a string", name);
8522 *no_add_attrs = true;
8523 return NULL_TREE;
8524 }
8525
8526 if (strcmp (TREE_STRING_POINTER (id), "notinbranch") == 0)
8527 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8528 OMP_CLAUSE_NOTINBRANCH);
8529 else
8530 if (strcmp (TREE_STRING_POINTER (id), "inbranch") == 0)
8531 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8532 OMP_CLAUSE_INBRANCH);
8533 else
8534 {
8535 error ("only %<inbranch%> and %<notinbranch%> flags are "
8536 "allowed for %<__simd__%> attribute");
8537 *no_add_attrs = true;
8538 return NULL_TREE;
8539 }
8540 }
8541
8542 DECL_ATTRIBUTES (*node) = tree_cons (t,
8543 build_tree_list (NULL_TREE,
8544 attr),
8545 DECL_ATTRIBUTES (*node));
8546 }
fff77217
KY		 8547 }
8548 else
8549 {
8550 warning (OPT_Wattributes, "%qE attribute ignored", name);
8551 *no_add_attrs = true;
8552 }
8553
8554 return NULL_TREE;
8555}
8556
acf0174b
JJ		 8557/* Handle an "omp declare target" attribute; arguments as in
8558 struct attribute_spec.handler. */
8559
8560static tree
8561handle_omp_declare_target_attribute (tree *, tree, tree, int, bool *)
8562{
8563 return NULL_TREE;
8564}
8565
6e9a3221
AN		 8566/* Handle a "returns_twice" attribute; arguments as in
8567 struct attribute_spec.handler. */
8568
8569static tree
8570handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8571 int ARG_UNUSED (flags), bool *no_add_attrs)
8572{
8573 if (TREE_CODE (*node) == FUNCTION_DECL)
8574 DECL_IS_RETURNS_TWICE (*node) = 1;
8575 else
8576 {
5c498b10 8577 warning (OPT_Wattributes, "%qE attribute ignored", name);
6e9a3221
AN		 8578 *no_add_attrs = true;
8579 }
8580
8581 return NULL_TREE;
8582}
8583
349ae713
NB		 8584/* Handle a "no_limit_stack" attribute; arguments as in
8585 struct attribute_spec.handler. */
8586
8587static tree
35b1a6fa 8588handle_no_limit_stack_attribute (tree *node, tree name,
e18476eb
BI		 8589 tree ARG_UNUSED (args),
8590 int ARG_UNUSED (flags),
a742c759 8591 bool *no_add_attrs)
349ae713
NB		 8592{
8593 tree decl = *node;
8594
8595 if (TREE_CODE (decl) != FUNCTION_DECL)
8596 {
c5d75364
MLI		 8597 error_at (DECL_SOURCE_LOCATION (decl),
8598 "%qE attribute applies only to functions", name);
349ae713
NB		 8599 *no_add_attrs = true;
8600 }
8601 else if (DECL_INITIAL (decl))
8602 {
c5d75364
MLI		 8603 error_at (DECL_SOURCE_LOCATION (decl),
8604 "can%'t set %qE attribute after definition", name);
349ae713
NB		 8605 *no_add_attrs = true;
8606 }
8607 else
8608 DECL_NO_LIMIT_STACK (decl) = 1;
8609
8610 return NULL_TREE;
8611}
8612
8613/* Handle a "pure" attribute; arguments as in
8614 struct attribute_spec.handler. */
8615
8616static tree
e18476eb
BI		 8617handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8618 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 8619{
8620 if (TREE_CODE (*node) == FUNCTION_DECL)
becfd6e5 8621 DECL_PURE_P (*node) = 1;
349ae713
NB		 8622 /* ??? TODO: Support types. */
8623 else
8624 {
5c498b10 8625 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8626 *no_add_attrs = true;
8627 }
8628
8629 return NULL_TREE;
8630}
8631
0a35513e
AH		 8632/* Digest an attribute list destined for a transactional memory statement.
8633 ALLOWED is the set of attributes that are allowed for this statement;
8634 return the attribute we parsed. Multiple attributes are never allowed. */
8635
8636int
8637parse_tm_stmt_attr (tree attrs, int allowed)
8638{
8639 tree a_seen = NULL;
8640 int m_seen = 0;
8641
8642 for ( ; attrs ; attrs = TREE_CHAIN (attrs))
8643 {
8644 tree a = TREE_PURPOSE (attrs);
8645 int m = 0;
8646
8647 if (is_attribute_p ("outer", a))
8648 m = TM_STMT_ATTR_OUTER;
8649
8650 if ((m & allowed) == 0)
8651 {
8652 warning (OPT_Wattributes, "%qE attribute directive ignored", a);
8653 continue;
8654 }
8655
8656 if (m_seen == 0)
8657 {
8658 a_seen = a;
8659 m_seen = m;
8660 }
8661 else if (m_seen == m)
8662 warning (OPT_Wattributes, "%qE attribute duplicated", a);
8663 else
8664 warning (OPT_Wattributes, "%qE attribute follows %qE", a, a_seen);
8665 }
8666
8667 return m_seen;
8668}
8669
8670/* Transform a TM attribute name into a maskable integer and back.
8671 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8672 to how the lack of an attribute is treated. */
8673
8674int
8675tm_attr_to_mask (tree attr)
8676{
8677 if (attr == NULL)
8678 return 0;
8679 if (is_attribute_p ("transaction_safe", attr))
8680 return TM_ATTR_SAFE;
8681 if (is_attribute_p ("transaction_callable", attr))
8682 return TM_ATTR_CALLABLE;
8683 if (is_attribute_p ("transaction_pure", attr))
8684 return TM_ATTR_PURE;
8685 if (is_attribute_p ("transaction_unsafe", attr))
8686 return TM_ATTR_IRREVOCABLE;
8687 if (is_attribute_p ("transaction_may_cancel_outer", attr))
8688 return TM_ATTR_MAY_CANCEL_OUTER;
8689 return 0;
8690}
8691
8692tree
8693tm_mask_to_attr (int mask)
8694{
8695 const char *str;
8696 switch (mask)
8697 {
8698 case TM_ATTR_SAFE:
8699 str = "transaction_safe";
8700 break;
8701 case TM_ATTR_CALLABLE:
8702 str = "transaction_callable";
8703 break;
8704 case TM_ATTR_PURE:
8705 str = "transaction_pure";
8706 break;
8707 case TM_ATTR_IRREVOCABLE:
8708 str = "transaction_unsafe";
8709 break;
8710 case TM_ATTR_MAY_CANCEL_OUTER:
8711 str = "transaction_may_cancel_outer";
8712 break;
8713 default:
8714 gcc_unreachable ();
8715 }
8716 return get_identifier (str);
8717}
8718
8719/* Return the first TM attribute seen in LIST. */
8720
8721tree
8722find_tm_attribute (tree list)
8723{
8724 for (; list ; list = TREE_CHAIN (list))
8725 {
8726 tree name = TREE_PURPOSE (list);
8727 if (tm_attr_to_mask (name) != 0)
8728 return name;
8729 }
8730 return NULL_TREE;
8731}
8732
8733/* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8734 Here we accept only function types, and verify that none of the other
8735 function TM attributes are also applied. */
8736/* ??? We need to accept class types for C++, but not C. This greatly
8737 complicates this function, since we can no longer rely on the extra
8738 processing given by function_type_required. */
8739
8740static tree
8741handle_tm_attribute (tree *node, tree name, tree args,
8742 int flags, bool *no_add_attrs)
8743{
8744 /* Only one path adds the attribute; others don't. */
8745 *no_add_attrs = true;
8746
8747 switch (TREE_CODE (*node))
8748 {
8749 case RECORD_TYPE:
8750 case UNION_TYPE:
8751 /* Only tm_callable and tm_safe apply to classes. */
8752 if (tm_attr_to_mask (name) & ~(TM_ATTR_SAFE | TM_ATTR_CALLABLE))
8753 goto ignored;
8754 /* FALLTHRU */
8755
8756 case FUNCTION_TYPE:
8757 case METHOD_TYPE:
8758 {
8759 tree old_name = find_tm_attribute (TYPE_ATTRIBUTES (*node));
8760 if (old_name == name)
8761 ;
8762 else if (old_name != NULL_TREE)
8763 error ("type was previously declared %qE", old_name);
8764 else
8765 *no_add_attrs = false;
8766 }
8767 break;
8768
b8fd7909
JM		 8769 case FUNCTION_DECL:
8770 {
8771 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8772 want to set transaction_safe on the type. */
8773 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name));
8774 if (!TYPE_P (DECL_CONTEXT (*node)))
8775 error_at (DECL_SOURCE_LOCATION (*node),
8776 "%<transaction_safe_dynamic%> may only be specified for "
8777 "a virtual function");
8778 *no_add_attrs = false;
8779 decl_attributes (&TREE_TYPE (*node),
8780 build_tree_list (get_identifier ("transaction_safe"),
8781 NULL_TREE),
8782 0);
8783 break;
8784 }
8785
0a35513e
AH		 8786 case POINTER_TYPE:
8787 {
8788 enum tree_code subcode = TREE_CODE (TREE_TYPE (*node));
8789 if (subcode == FUNCTION_TYPE || subcode == METHOD_TYPE)
8790 {
8791 tree fn_tmp = TREE_TYPE (*node);
8792 decl_attributes (&fn_tmp, tree_cons (name, args, NULL), 0);
8793 *node = build_pointer_type (fn_tmp);
8794 break;
8795 }
8796 }
8797 /* FALLTHRU */
8798
8799 default:
8800 /* If a function is next, pass it on to be tried next. */
8801 if (flags & (int) ATTR_FLAG_FUNCTION_NEXT)
8802 return tree_cons (name, args, NULL);
8803
8804 ignored:
8805 warning (OPT_Wattributes, "%qE attribute ignored", name);
8806 break;
8807 }
8808
8809 return NULL_TREE;
8810}
8811
8812/* Handle the TM_WRAP attribute; arguments as in
8813 struct attribute_spec.handler. */
8814
8815static tree
8816handle_tm_wrap_attribute (tree *node, tree name, tree args,
8817 int ARG_UNUSED (flags), bool *no_add_attrs)
8818{
8819 tree decl = *node;
8820
8821 /* We don't need the attribute even on success, since we
8822 record the entry in an external table. */
8823 *no_add_attrs = true;
8824
8825 if (TREE_CODE (decl) != FUNCTION_DECL)
8826 warning (OPT_Wattributes, "%qE attribute ignored", name);
8827 else
8828 {
8829 tree wrap_decl = TREE_VALUE (args);
661a0813
MP		 8830 if (error_operand_p (wrap_decl))
8831 ;
8832 else if (TREE_CODE (wrap_decl) != IDENTIFIER_NODE
21b634ae 8833 && !VAR_OR_FUNCTION_DECL_P (wrap_decl))
0a35513e
AH		 8834 error ("%qE argument not an identifier", name);
8835 else
8836 {
8837 if (TREE_CODE (wrap_decl) == IDENTIFIER_NODE)
8838 wrap_decl = lookup_name (wrap_decl);
8839 if (wrap_decl && TREE_CODE (wrap_decl) == FUNCTION_DECL)
8840 {
8841 if (lang_hooks.types_compatible_p (TREE_TYPE (decl),
8842 TREE_TYPE (wrap_decl)))
8843 record_tm_replacement (wrap_decl, decl);
8844 else
8845 error ("%qD is not compatible with %qD", wrap_decl, decl);
8846 }
8847 else
c07d7c02 8848 error ("%qE argument is not a function", name);
0a35513e
AH		 8849 }
8850 }
8851
8852 return NULL_TREE;
8853}
8854
8855/* Ignore the given attribute. Used when this attribute may be usefully
8856 overridden by the target, but is not used generically. */
8857
8858static tree
8859ignore_attribute (tree * ARG_UNUSED (node), tree ARG_UNUSED (name),
8860 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8861 bool *no_add_attrs)
8862{
8863 *no_add_attrs = true;
8864 return NULL_TREE;
8865}
8866
dcd6de6d
ZD		 8867/* Handle a "no vops" attribute; arguments as in
8868 struct attribute_spec.handler. */
8869
8870static tree
8871handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
8872 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8873 bool *ARG_UNUSED (no_add_attrs))
8874{
8875 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
8876 DECL_IS_NOVOPS (*node) = 1;
8877 return NULL_TREE;
8878}
8879
349ae713
NB		 8880/* Handle a "deprecated" attribute; arguments as in
8881 struct attribute_spec.handler. */
35b1a6fa 8882
349ae713 8883static tree
35b1a6fa 8884handle_deprecated_attribute (tree *node, tree name,
9b86d6bb 8885 tree args, int flags,
a742c759 8886 bool *no_add_attrs)
349ae713
NB		 8887{
8888 tree type = NULL_TREE;
8889 int warn = 0;
c51a1ba9 8890 tree what = NULL_TREE;
35b1a6fa 8891
9b86d6bb
L		 8892 if (!args)
8893 *no_add_attrs = true;
8894 else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
8895 {
8896 error ("deprecated message is not a string");
8897 *no_add_attrs = true;
8898 }
8899
349ae713
NB		 8900 if (DECL_P (*node))
8901 {
8902 tree decl = *node;
8903 type = TREE_TYPE (decl);
35b1a6fa 8904
349ae713
NB		 8905 if (TREE_CODE (decl) == TYPE_DECL
8906 || TREE_CODE (decl) == PARM_DECL
21b634ae 8907 || VAR_OR_FUNCTION_DECL_P (decl)
a1178b30 8908 || TREE_CODE (decl) == FIELD_DECL
fd5c817a 8909 || TREE_CODE (decl) == CONST_DECL
a1178b30 8910 || objc_method_decl (TREE_CODE (decl)))
349ae713
NB		 8911 TREE_DEPRECATED (decl) = 1;
8912 else
8913 warn = 1;
8914 }
8915 else if (TYPE_P (*node))
8916 {
8917 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 8918 *node = build_variant_type_copy (*node);
349ae713
NB		 8919 TREE_DEPRECATED (*node) = 1;
8920 type = *node;
8921 }
8922 else
8923 warn = 1;
35b1a6fa 8924
349ae713
NB		 8925 if (warn)
8926 {
8927 *no_add_attrs = true;
8928 if (type && TYPE_NAME (type))
8929 {
8930 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
c51a1ba9 8931 what = TYPE_NAME (*node);
349ae713
NB		 8932 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
8933 && DECL_NAME (TYPE_NAME (type)))
c51a1ba9 8934 what = DECL_NAME (TYPE_NAME (type));
349ae713
NB		 8935 }
8936 if (what)
5c498b10 8937 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
349ae713 8938 else
5c498b10 8939 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8940 }
8941
8942 return NULL_TREE;
8943}
8944
349ae713
NB		 8945/* Handle a "vector_size" attribute; arguments as in
8946 struct attribute_spec.handler. */
8947
8948static tree
35b1a6fa 8949handle_vector_size_attribute (tree *node, tree name, tree args,
e18476eb 8950 int ARG_UNUSED (flags),
a742c759 8951 bool *no_add_attrs)
349ae713
NB		 8952{
8953 unsigned HOST_WIDE_INT vecsize, nunits;
ef4bddc2 8954 machine_mode orig_mode;
4a5eab38 8955 tree type = *node, new_type, size;
349ae713
NB		 8956
8957 *no_add_attrs = true;
8958
4a5eab38 8959 size = TREE_VALUE (args);
661a0813
MP		 8960 if (size && TREE_CODE (size) != IDENTIFIER_NODE
8961 && TREE_CODE (size) != FUNCTION_DECL)
5d77fb19 8962 size = default_conversion (size);
4a5eab38 8963
cc269bb6 8964 if (!tree_fits_uhwi_p (size))
349ae713 8965 {
5c498b10 8966 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8967 return NULL_TREE;
8968 }
8969
8970 /* Get the vector size (in bytes). */
ae7e9ddd 8971 vecsize = tree_to_uhwi (size);
349ae713
NB		 8972
8973 /* We need to provide for vector pointers, vector arrays, and
8974 functions returning vectors. For example:
8975
8976 __attribute__((vector_size(16))) short *foo;
8977
8978 In this case, the mode is SI, but the type being modified is
8979 HI, so we need to look further. */
8980
8981 while (POINTER_TYPE_P (type)
8982 || TREE_CODE (type) == FUNCTION_TYPE
43dc123f 8983 || TREE_CODE (type) == METHOD_TYPE
270e749d
JJ		 8984 || TREE_CODE (type) == ARRAY_TYPE
8985 || TREE_CODE (type) == OFFSET_TYPE)
349ae713
NB		 8986 type = TREE_TYPE (type);
8987
8988 /* Get the mode of the type being modified. */
8989 orig_mode = TYPE_MODE (type);
8990
270e749d
JJ		 8991 if ((!INTEGRAL_TYPE_P (type)
8992 && !SCALAR_FLOAT_TYPE_P (type)
8993 && !FIXED_POINT_TYPE_P (type))
3d8bf70f 8994 || (!SCALAR_FLOAT_MODE_P (orig_mode)
ab22c1fa
CF		 8995 && GET_MODE_CLASS (orig_mode) != MODE_INT
8996 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
cc269bb6 8997 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
e4e5261f 8998 || TREE_CODE (type) == BOOLEAN_TYPE)
349ae713 8999 {
c51a1ba9 9000 error ("invalid vector type for attribute %qE", name);
349ae713
NB		 9001 return NULL_TREE;
9002 }
9003
ae7e9ddd 9004 if (vecsize % tree_to_uhwi (TYPE_SIZE_UNIT (type)))
ee8960e5
JJ		 9005 {
9006 error ("vector size not an integral multiple of component size");
9007 return NULL;
9008 }
9009
9010 if (vecsize == 0)
9011 {
9012 error ("zero vector size");
9013 return NULL;
9014 }
9015
349ae713 9016 /* Calculate how many units fit in the vector. */
ae7e9ddd 9017 nunits = vecsize / tree_to_uhwi (TYPE_SIZE_UNIT (type));
26277d41 9018 if (nunits & (nunits - 1))
349ae713 9019 {
26277d41 9020 error ("number of components of the vector not a power of two");
349ae713
NB		 9021 return NULL_TREE;
9022 }
9023
26277d41 9024 new_type = build_vector_type (type, nunits);
349ae713
NB		 9025
9026 /* Build back pointers if needed. */
5dc11954 9027 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
349ae713
NB		 9028
9029 return NULL_TREE;
9030}
9031
b34c7881
JT		 9032/* Handle the "nonnull" attribute. */
9033static tree
e18476eb
BI		 9034handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
9035 tree args, int ARG_UNUSED (flags),
a742c759 9036 bool *no_add_attrs)
b34c7881
JT		 9037{
9038 tree type = *node;
9039 unsigned HOST_WIDE_INT attr_arg_num;
9040
9041 /* If no arguments are specified, all pointer arguments should be
95bd1dd7 9042 non-null. Verify a full prototype is given so that the arguments
4d926e34
MS		 9043 will have the correct types when we actually check them later.
9044 Avoid diagnosing type-generic built-ins since those have no
9045 prototype. */
3f75a254 9046 if (!args)
b34c7881 9047 {
4d926e34
MS		 9048 if (!prototype_p (type)
9049 && (!TYPE_ATTRIBUTES (type)
9050 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type))))
b34c7881
JT		 9051 {
9052 error ("nonnull attribute without arguments on a non-prototype");
6de9cd9a 9053 *no_add_attrs = true;
b34c7881
JT		 9054 }
9055 return NULL_TREE;
9056 }
9057
9058 /* Argument list specified. Verify that each argument number references
9059 a pointer argument. */
5d77fb19 9060 for (attr_arg_num = 1; args; attr_arg_num++, args = TREE_CHAIN (args))
b34c7881 9061 {
6de9cd9a 9062 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
b34c7881 9063
5d77fb19
MG		 9064 tree arg = TREE_VALUE (args);
9065 if (arg && TREE_CODE (arg) != IDENTIFIER_NODE
9066 && TREE_CODE (arg) != FUNCTION_DECL)
9067 arg = default_conversion (arg);
9068
9069 if (!get_nonnull_operand (arg, &arg_num))
b34c7881 9070 {
40b97a2e 9071 error ("nonnull argument has invalid operand number (argument %lu)",
b34c7881
JT		 9072 (unsigned long) attr_arg_num);
9073 *no_add_attrs = true;
9074 return NULL_TREE;
9075 }
9076
e19a18d4 9077 if (prototype_p (type))
b34c7881 9078 {
e19a18d4
NF		 9079 function_args_iterator iter;
9080 tree argument;
9081
9082 function_args_iter_init (&iter, type);
9083 for (ck_num = 1; ; ck_num++, function_args_iter_next (&iter))
b34c7881 9084 {
e19a18d4
NF		 9085 argument = function_args_iter_cond (&iter);
9086 if (argument == NULL_TREE || ck_num == arg_num)
b34c7881 9087 break;
b34c7881
JT		 9088 }
9089
3f75a254 9090 if (!argument
e19a18d4 9091 || TREE_CODE (argument) == VOID_TYPE)
b34c7881 9092 {
40b97a2e 9093 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
b34c7881
JT		 9094 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9095 *no_add_attrs = true;
9096 return NULL_TREE;
9097 }
9098
e19a18d4 9099 if (TREE_CODE (argument) != POINTER_TYPE)
b34c7881 9100 {
40b97a2e 9101 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
b34c7881
JT		 9102 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9103 *no_add_attrs = true;
9104 return NULL_TREE;
9105 }
9106 }
9107 }
9108
9109 return NULL_TREE;
9110}
9111
9112/* Check the argument list of a function call for null in argument slots
94a0dd7b 9113 that are marked as requiring a non-null pointer argument. The NARGS
3342fd71 9114 arguments are passed in the array ARGARRAY. */
b34c7881
JT		 9115
9116static void
3342fd71 9117check_function_nonnull (location_t loc, tree attrs, int nargs, tree *argarray)
b34c7881 9118{
332f1d24 9119 tree a;
94a0dd7b 9120 int i;
b34c7881 9121
332f1d24
JJ		 9122 attrs = lookup_attribute ("nonnull", attrs);
9123 if (attrs == NULL_TREE)
9124 return;
9125
9126 a = attrs;
9127 /* See if any of the nonnull attributes has no arguments. If so,
9128 then every pointer argument is checked (in which case the check
9129 for pointer type is done in check_nonnull_arg). */
9130 if (TREE_VALUE (a) != NULL_TREE)
9131 do
9132 a = lookup_attribute ("nonnull", TREE_CHAIN (a));
9133 while (a != NULL_TREE && TREE_VALUE (a) != NULL_TREE);
9134
9135 if (a != NULL_TREE)
9136 for (i = 0; i < nargs; i++)
3342fd71 9137 check_function_arguments_recurse (check_nonnull_arg, &loc, argarray[i],
332f1d24
JJ		 9138 i + 1);
9139 else
b34c7881 9140 {
332f1d24
JJ		 9141 /* Walk the argument list. If we encounter an argument number we
9142 should check for non-null, do it. */
9143 for (i = 0; i < nargs; i++)
b34c7881 9144 {
332f1d24 9145 for (a = attrs; ; a = TREE_CHAIN (a))
6de9cd9a 9146 {
332f1d24
JJ		 9147 a = lookup_attribute ("nonnull", a);
9148 if (a == NULL_TREE || nonnull_check_p (TREE_VALUE (a), i + 1))
9149 break;
6de9cd9a 9150 }
332f1d24
JJ		 9151
9152 if (a != NULL_TREE)
3342fd71 9153 check_function_arguments_recurse (check_nonnull_arg, &loc,
332f1d24 9154 argarray[i], i + 1);
b34c7881
JT		 9155 }
9156 }
9157}
9158
254986c7 9159/* Check that the Nth argument of a function call (counting backwards
94a0dd7b
SL		 9160 from the end) is a (pointer)0. The NARGS arguments are passed in the
9161 array ARGARRAY. */
3d091dac
KG		 9162
9163static void
dde05067 9164check_function_sentinel (const_tree fntype, int nargs, tree *argarray)
3d091dac 9165{
dde05067 9166 tree attr = lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype));
3d091dac
KG		 9167
9168 if (attr)
9169 {
94a0dd7b
SL		 9170 int len = 0;
9171 int pos = 0;
9172 tree sentinel;
dde05067
NF		 9173 function_args_iterator iter;
9174 tree t;
c22cacf3 9175
94a0dd7b 9176 /* Skip over the named arguments. */
dde05067 9177 FOREACH_FUNCTION_ARGS (fntype, t, iter)
c22cacf3 9178 {
dde05067
NF		 9179 if (len == nargs)
9180 break;
94a0dd7b
SL		 9181 len++;
9182 }
254986c7 9183
94a0dd7b
SL		 9184 if (TREE_VALUE (attr))
9185 {
9186 tree p = TREE_VALUE (TREE_VALUE (attr));
9187 pos = TREE_INT_CST_LOW (p);
9188 }
254986c7 9189
94a0dd7b
SL		 9190 /* The sentinel must be one of the varargs, i.e.
9191 in position >= the number of fixed arguments. */
9192 if ((nargs - 1 - pos) < len)
9193 {
7332899a 9194 warning (OPT_Wformat_,
94a0dd7b
SL		 9195 "not enough variable arguments to fit a sentinel");
9196 return;
3d091dac 9197 }
94a0dd7b
SL		 9198
9199 /* Validate the sentinel. */
9200 sentinel = argarray[nargs - 1 - pos];
9201 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
9202 || !integer_zerop (sentinel))
9203 /* Although __null (in C++) is only an integer we allow it
9204 nevertheless, as we are guaranteed that it's exactly
9205 as wide as a pointer, and we don't want to force
9206 users to cast the NULL they have written there.
9207 We warn with -Wstrict-null-sentinel, though. */
9208 && (warn_strict_null_sentinel || null_node != sentinel))
7332899a 9209 warning (OPT_Wformat_, "missing sentinel in function call");
3d091dac
KG		 9210 }
9211}
9212
b34c7881
JT		 9213/* Helper for check_function_nonnull; given a list of operands which
9214 must be non-null in ARGS, determine if operand PARAM_NUM should be
9215 checked. */
9216
9217static bool
35b1a6fa 9218nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
b34c7881 9219{
6de9cd9a 9220 unsigned HOST_WIDE_INT arg_num = 0;
b34c7881
JT		 9221
9222 for (; args; args = TREE_CHAIN (args))
9223 {
366de0ce
NS		 9224 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
9225
9226 gcc_assert (found);
b34c7881
JT		 9227
9228 if (arg_num == param_num)
9229 return true;
9230 }
9231 return false;
9232}
9233
9234/* Check that the function argument PARAM (which is operand number
9235 PARAM_NUM) is non-null. This is called by check_function_nonnull
9236 via check_function_arguments_recurse. */
9237
9238static void
3342fd71 9239check_nonnull_arg (void *ctx, tree param, unsigned HOST_WIDE_INT param_num)
b34c7881 9240{
3342fd71
BS		 9241 location_t *ploc = (location_t *) ctx;
9242
b34c7881
JT		 9243 /* Just skip checking the argument if it's not a pointer. This can
9244 happen if the "nonnull" attribute was given without an operand
9245 list (which means to check every pointer argument). */
9246
9247 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
9248 return;
9249
9250 if (integer_zerop (param))
3342fd71
BS		 9251 warning_at (*ploc, OPT_Wnonnull, "null argument where non-null required "
9252 "(argument %lu)", (unsigned long) param_num);
b34c7881
JT		 9253}
9254
9255/* Helper for nonnull attribute handling; fetch the operand number
9256 from the attribute argument list. */
9257
9258static bool
35b1a6fa 9259get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
b34c7881 9260{
807e902e
KZ		 9261 /* Verify the arg number is a small constant. */
9262 if (tree_fits_uhwi_p (arg_num_expr))
9263 {
9264 *valp = TREE_INT_CST_LOW (arg_num_expr);
9265 return true;
9266 }
9267 else
b34c7881 9268 return false;
b34c7881 9269}
39f2f3c8
RS		 9270
9271/* Handle a "nothrow" attribute; arguments as in
9272 struct attribute_spec.handler. */
9273
9274static tree
e18476eb
BI		 9275handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9276 int ARG_UNUSED (flags), bool *no_add_attrs)
39f2f3c8
RS		 9277{
9278 if (TREE_CODE (*node) == FUNCTION_DECL)
9279 TREE_NOTHROW (*node) = 1;
9280 /* ??? TODO: Support types. */
9281 else
9282 {
5c498b10 9283 warning (OPT_Wattributes, "%qE attribute ignored", name);
39f2f3c8
RS		 9284 *no_add_attrs = true;
9285 }
9286
9287 return NULL_TREE;
9288}
0bfa5f65
RH		 9289
9290/* Handle a "cleanup" attribute; arguments as in
9291 struct attribute_spec.handler. */
9292
9293static tree
35b1a6fa 9294handle_cleanup_attribute (tree *node, tree name, tree args,
e18476eb 9295 int ARG_UNUSED (flags), bool *no_add_attrs)
0bfa5f65
RH		 9296{
9297 tree decl = *node;
9298 tree cleanup_id, cleanup_decl;
9299
9300 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9301 for global destructors in C++. This requires infrastructure that
9302 we don't have generically at the moment. It's also not a feature
9303 we'd be missing too much, since we do have attribute constructor. */
0ae9bd27 9304 if (!VAR_P (decl) || TREE_STATIC (decl))
0bfa5f65 9305 {
5c498b10 9306 warning (OPT_Wattributes, "%qE attribute ignored", name);
0bfa5f65
RH		 9307 *no_add_attrs = true;
9308 return NULL_TREE;
9309 }
9310
9311 /* Verify that the argument is a function in scope. */
9312 /* ??? We could support pointers to functions here as well, if
9313 that was considered desirable. */
9314 cleanup_id = TREE_VALUE (args);
9315 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
9316 {
40b97a2e 9317 error ("cleanup argument not an identifier");
0bfa5f65
RH		 9318 *no_add_attrs = true;
9319 return NULL_TREE;
9320 }
10e6657a 9321 cleanup_decl = lookup_name (cleanup_id);
0bfa5f65
RH		 9322 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
9323 {
40b97a2e 9324 error ("cleanup argument not a function");
0bfa5f65
RH		 9325 *no_add_attrs = true;
9326 return NULL_TREE;
9327 }
9328
35b1a6fa 9329 /* That the function has proper type is checked with the
0bfa5f65
RH		 9330 eventual call to build_function_call. */
9331
9332 return NULL_TREE;
9333}
72954a4f
JM		 9334
9335/* Handle a "warn_unused_result" attribute. No special handling. */
9336
9337static tree
9338handle_warn_unused_result_attribute (tree *node, tree name,
e18476eb
BI		 9339 tree ARG_UNUSED (args),
9340 int ARG_UNUSED (flags), bool *no_add_attrs)
72954a4f
JM		 9341{
9342 /* Ignore the attribute for functions not returning any value. */
9343 if (VOID_TYPE_P (TREE_TYPE (*node)))
9344 {
5c498b10 9345 warning (OPT_Wattributes, "%qE attribute ignored", name);
72954a4f
JM		 9346 *no_add_attrs = true;
9347 }
9348
9349 return NULL_TREE;
9350}
3d091dac
KG		 9351
9352/* Handle a "sentinel" attribute. */
9353
9354static tree
254986c7 9355handle_sentinel_attribute (tree *node, tree name, tree args,
3d091dac
KG		 9356 int ARG_UNUSED (flags), bool *no_add_attrs)
9357{
f4da8dce 9358 if (!prototype_p (*node))
3d091dac 9359 {
5c498b10
DD		 9360 warning (OPT_Wattributes,
9361 "%qE attribute requires prototypes with named arguments", name);
3d091dac 9362 *no_add_attrs = true;
3d091dac 9363 }
254986c7
KG		 9364 else
9365 {
dcf0c47e 9366 if (!stdarg_p (*node))
c22cacf3 9367 {
5c498b10
DD		 9368 warning (OPT_Wattributes,
9369 "%qE attribute only applies to variadic functions", name);
254986c7
KG		 9370 *no_add_attrs = true;
9371 }
9372 }
c22cacf3 9373
254986c7 9374 if (args)
3d091dac 9375 {
254986c7 9376 tree position = TREE_VALUE (args);
661a0813
MP		 9377 if (position && TREE_CODE (position) != IDENTIFIER_NODE
9378 && TREE_CODE (position) != FUNCTION_DECL)
9379 position = default_conversion (position);
254986c7 9380
661a0813
MP		 9381 if (TREE_CODE (position) != INTEGER_CST
9382 || !INTEGRAL_TYPE_P (TREE_TYPE (position)))
c22cacf3 9383 {
b8698a0f 9384 warning (OPT_Wattributes,
aa86a51b 9385 "requested position is not an integer constant");
254986c7
KG		 9386 *no_add_attrs = true;
9387 }
9388 else
c22cacf3 9389 {
254986c7
KG		 9390 if (tree_int_cst_lt (position, integer_zero_node))
9391 {
aa86a51b
DM		 9392 warning (OPT_Wattributes,
9393 "requested position is less than zero");
254986c7
KG		 9394 *no_add_attrs = true;
9395 }
9396 }
3d091dac 9397 }
c22cacf3 9398
3d091dac
KG		 9399 return NULL_TREE;
9400}
b5d32c25
KG		 9401
9402/* Handle a "type_generic" attribute. */
9403
9404static tree
9405handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
9406 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
9407 bool * ARG_UNUSED (no_add_attrs))
9408{
3bf5906b
KG		 9409 /* Ensure we have a function type. */
9410 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
b8698a0f 9411
3bf5906b 9412 /* Ensure we have a variadic function. */
dcf0c47e 9413 gcc_assert (!prototype_p (*node) || stdarg_p (*node));
b5d32c25
KG		 9414
9415 return NULL_TREE;
9416}
ab442df7 9417
5779e713 9418/* Handle a "target" attribute. */
ab442df7
MM		 9419
9420static tree
5779e713 9421handle_target_attribute (tree *node, tree name, tree args, int flags,
ab442df7
MM		 9422 bool *no_add_attrs)
9423{
9424 /* Ensure we have a function type. */
9425 if (TREE_CODE (*node) != FUNCTION_DECL)
9426 {
9427 warning (OPT_Wattributes, "%qE attribute ignored", name);
9428 *no_add_attrs = true;
9429 }
3b1661a9
ES		 9430 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
9431 {
9432 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9433 "with %qs attribute", name, "target_clones");
9434 *no_add_attrs = true;
9435 }
ab442df7 9436 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
32887460 9437 flags))
ab442df7
MM		 9438 *no_add_attrs = true;
9439
9440 return NULL_TREE;
9441}
9442
3b1661a9
ES		 9443/* Handle a "target_clones" attribute. */
9444
9445static tree
9446handle_target_clones_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9447 int ARG_UNUSED (flags), bool *no_add_attrs)
9448{
9449 /* Ensure we have a function type. */
9450 if (TREE_CODE (*node) == FUNCTION_DECL)
9451 {
9452 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
9453 {
9454 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9455 "with %qs attribute", name, "always_inline");
9456 *no_add_attrs = true;
9457 }
9458 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node)))
9459 {
9460 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9461 "with %qs attribute", name, "target");
9462 *no_add_attrs = true;
9463 }
9464 else
9465 /* Do not inline functions with multiple clone targets. */
9466 DECL_UNINLINABLE (*node) = 1;
9467 }
9468 else
9469 {
9470 warning (OPT_Wattributes, "%qE attribute ignored", name);
9471 *no_add_attrs = true;
9472 }
9473 return NULL_TREE;
9474}
9475
ab442df7
MM		 9476/* Arguments being collected for optimization. */
9477typedef const char *const_char_p; /* For DEF_VEC_P. */
9771b263 9478static GTY(()) vec<const_char_p, va_gc> *optimize_args;
ab442df7
MM		 9479
9480
9481/* Inner function to convert a TREE_LIST to argv string to parse the optimize
9482 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9483 false for #pragma GCC optimize. */
9484
9485bool
9486parse_optimize_options (tree args, bool attr_p)
9487{
9488 bool ret = true;
9489 unsigned opt_argc;
9490 unsigned i;
9491 const char **opt_argv;
6e2f1956
JM		 9492 struct cl_decoded_option *decoded_options;
9493 unsigned int decoded_options_count;
ab442df7
MM		 9494 tree ap;
9495
9496 /* Build up argv vector. Just in case the string is stored away, use garbage
9497 collected strings. */
9771b263
DN		 9498 vec_safe_truncate (optimize_args, 0);
9499 vec_safe_push (optimize_args, (const char *) NULL);
ab442df7
MM		 9500
9501 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
9502 {
9503 tree value = TREE_VALUE (ap);
9504
9505 if (TREE_CODE (value) == INTEGER_CST)
9506 {
9507 char buffer[20];
9508 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
9771b263 9509 vec_safe_push (optimize_args, ggc_strdup (buffer));
ab442df7
MM		 9510 }
9511
9512 else if (TREE_CODE (value) == STRING_CST)
9513 {
9514 /* Split string into multiple substrings. */
9515 size_t len = TREE_STRING_LENGTH (value);
9516 char *p = ASTRDUP (TREE_STRING_POINTER (value));
9517 char *end = p + len;
9518 char *comma;
9519 char *next_p = p;
9520
9521 while (next_p != NULL)
9522 {
9523 size_t len2;
9524 char *q, *r;
9525
9526 p = next_p;
9527 comma = strchr (p, ',');
9528 if (comma)
9529 {
9530 len2 = comma - p;
9531 *comma = '\0';
9532 next_p = comma+1;
9533 }
9534 else
9535 {
9536 len2 = end - p;
9537 next_p = NULL;
9538 }
9539
a9429e29 9540 r = q = (char *) ggc_alloc_atomic (len2 + 3);
ab442df7
MM		 9541
9542 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9543 options. */
9544 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
9545 {
9546 ret = false;
9547 if (attr_p)
9548 warning (OPT_Wattributes,
a80a7051 9549 "bad option %qs to attribute %<optimize%>", p);
ab442df7
MM		 9550 else
9551 warning (OPT_Wpragmas,
a80a7051 9552 "bad option %qs to pragma %<optimize%>", p);
ab442df7
MM		 9553 continue;
9554 }
9555
9556 if (*p != '-')
9557 {
9558 *r++ = '-';
9559
9560 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9561 itself is -Os, and any other switch begins with a -f. */
9562 if ((*p >= '0' && *p <= '9')
9563 || (p[0] == 's' && p[1] == '\0'))
9564 *r++ = 'O';
9565 else if (*p != 'O')
9566 *r++ = 'f';
9567 }
9568
9569 memcpy (r, p, len2);
9570 r[len2] = '\0';
9771b263 9571 vec_safe_push (optimize_args, (const char *) q);
ab442df7
MM		 9572 }
9573
9574 }
9575 }
9576
9771b263 9577 opt_argc = optimize_args->length ();
ab442df7
MM		 9578 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
9579
9580 for (i = 1; i < opt_argc; i++)
9771b263 9581 opt_argv[i] = (*optimize_args)[i];
ab442df7
MM		 9582
9583 /* Now parse the options. */
a75bfaa6
JM		 9584 decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv,
9585 &decoded_options,
9586 &decoded_options_count);
bfd67b47
RB		 9587 /* Drop non-Optimization options. */
9588 unsigned j = 1;
9589 for (i = 1; i < decoded_options_count; ++i)
9590 {
9591 if (! (cl_options[decoded_options[i].opt_index].flags & CL_OPTIMIZATION))
9592 {
9593 ret = false;
9594 if (attr_p)
9595 warning (OPT_Wattributes,
a80a7051 9596 "bad option %qs to attribute %<optimize%>",
bfd67b47
RB		 9597 decoded_options[i].orig_option_with_args_text);
9598 else
9599 warning (OPT_Wpragmas,
a80a7051 9600 "bad option %qs to pragma %<optimize%>",
bfd67b47
RB		 9601 decoded_options[i].orig_option_with_args_text);
9602 continue;
9603 }
9604 if (i != j)
9605 decoded_options[j] = decoded_options[i];
9606 j++;
9607 }
9608 decoded_options_count = j;
9609 /* And apply them. */
a75bfaa6 9610 decode_options (&global_options, &global_options_set,
a4d8c676
JM		 9611 decoded_options, decoded_options_count,
9612 input_location, global_dc);
ab442df7 9613
2b7e2984
SE		 9614 targetm.override_options_after_change();
9615
9771b263 9616 optimize_args->truncate (0);
ab442df7
MM		 9617 return ret;
9618}
9619
9620/* For handling "optimize" attribute. arguments as in
9621 struct attribute_spec.handler. */
9622
9623static tree
9624handle_optimize_attribute (tree *node, tree name, tree args,
9625 int ARG_UNUSED (flags), bool *no_add_attrs)
9626{
9627 /* Ensure we have a function type. */
9628 if (TREE_CODE (*node) != FUNCTION_DECL)
9629 {
9630 warning (OPT_Wattributes, "%qE attribute ignored", name);
9631 *no_add_attrs = true;
9632 }
9633 else
9634 {
9635 struct cl_optimization cur_opts;
9636 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
9637
9638 /* Save current options. */
46625112 9639 cl_optimization_save (&cur_opts, &global_options);
ab442df7
MM		 9640
9641 /* If we previously had some optimization options, use them as the
9642 default. */
9643 if (old_opts)
46625112
JM		 9644 cl_optimization_restore (&global_options,
9645 TREE_OPTIMIZATION (old_opts));
ab442df7
MM		 9646
9647 /* Parse options, and update the vector. */
9648 parse_optimize_options (args, true);
9649 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
bf7b5747 9650 = build_optimization_node (&global_options);
ab442df7
MM		 9651
9652 /* Restore current options. */
46625112 9653 cl_optimization_restore (&global_options, &cur_opts);
ab442df7
MM		 9654 }
9655
9656 return NULL_TREE;
9657}
7458026b
ILT		 9658
9659/* Handle a "no_split_stack" attribute. */
9660
9661static tree
9662handle_no_split_stack_attribute (tree *node, tree name,
9663 tree ARG_UNUSED (args),
9664 int ARG_UNUSED (flags),
9665 bool *no_add_attrs)
9666{
9667 tree decl = *node;
9668
9669 if (TREE_CODE (decl) != FUNCTION_DECL)
9670 {
9671 error_at (DECL_SOURCE_LOCATION (decl),
9672 "%qE attribute applies only to functions", name);
9673 *no_add_attrs = true;
9674 }
9675 else if (DECL_INITIAL (decl))
9676 {
9677 error_at (DECL_SOURCE_LOCATION (decl),
9678 "can%'t set %qE attribute after definition", name);
9679 *no_add_attrs = true;
9680 }
9681
9682 return NULL_TREE;
9683}
826cacfe
MG		 9684
9685/* Handle a "returns_nonnull" attribute; arguments as in
9686 struct attribute_spec.handler. */
9687
9688static tree
9689handle_returns_nonnull_attribute (tree *node, tree, tree, int,
9690 bool *no_add_attrs)
9691{
9692 // Even without a prototype we still have a return type we can check.
9693 if (TREE_CODE (TREE_TYPE (*node)) != POINTER_TYPE)
9694 {
9695 error ("returns_nonnull attribute on a function not returning a pointer");
9696 *no_add_attrs = true;
9697 }
9698 return NULL_TREE;
9699}
9700
976d5a22
TT		 9701/* Handle a "designated_init" attribute; arguments as in
9702 struct attribute_spec.handler. */
9703
9704static tree
9705handle_designated_init_attribute (tree *node, tree name, tree, int,
9706 bool *no_add_attrs)
9707{
9708 if (TREE_CODE (*node) != RECORD_TYPE)
9709 {
9710 error ("%qE attribute is only valid on %<struct%> type", name);
9711 *no_add_attrs = true;
9712 }
9713 return NULL_TREE;
9714}
9715
b34c7881 9716\f
dde05067 9717/* Check for valid arguments being passed to a function with FNTYPE.
3342fd71
BS		 9718 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9719 diagnostics. */
b34c7881 9720void
3342fd71
BS		 9721check_function_arguments (location_t loc, const_tree fntype, int nargs,
9722 tree *argarray)
b34c7881
JT		 9723{
9724 /* Check for null being passed in a pointer argument that must be
9725 non-null. We also need to do this if format checking is enabled. */
9726
9727 if (warn_nonnull)
3342fd71 9728 check_function_nonnull (loc, TYPE_ATTRIBUTES (fntype), nargs, argarray);
b34c7881
JT		 9729
9730 /* Check for errors in format strings. */
9731
e6c69da0 9732 if (warn_format || warn_suggest_attribute_format)
dde05067 9733 check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray);
7876a414
KG		 9734
9735 if (warn_format)
dde05067 9736 check_function_sentinel (fntype, nargs, argarray);
b34c7881
JT		 9737}
9738
9739/* Generic argument checking recursion routine. PARAM is the argument to
9740 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9741 once the argument is resolved. CTX is context for the callback. */
9742void
35b1a6fa
AJ		 9743check_function_arguments_recurse (void (*callback)
9744 (void *, tree, unsigned HOST_WIDE_INT),
9745 void *ctx, tree param,
9746 unsigned HOST_WIDE_INT param_num)
b34c7881 9747{
1043771b 9748 if (CONVERT_EXPR_P (param)
1344f9a3
JM		 9749 && (TYPE_PRECISION (TREE_TYPE (param))
9750 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
b34c7881
JT		 9751 {
9752 /* Strip coercion. */
9753 check_function_arguments_recurse (callback, ctx,
6de9cd9a 9754 TREE_OPERAND (param, 0), param_num);
b34c7881
JT		 9755 return;
9756 }
9757
9758 if (TREE_CODE (param) == CALL_EXPR)
9759 {
5039610b 9760 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
b34c7881
JT		 9761 tree attrs;
9762 bool found_format_arg = false;
9763
9764 /* See if this is a call to a known internationalization function
9765 that modifies a format arg. Such a function may have multiple
9766 format_arg attributes (for example, ngettext). */
9767
9768 for (attrs = TYPE_ATTRIBUTES (type);
9769 attrs;
9770 attrs = TREE_CHAIN (attrs))
9771 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
9772 {
5039610b 9773 tree inner_arg;
b34c7881
JT		 9774 tree format_num_expr;
9775 int format_num;
9776 int i;
5039610b 9777 call_expr_arg_iterator iter;
b34c7881
JT		 9778
9779 /* Extract the argument number, which was previously checked
9780 to be valid. */
9781 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
b34c7881 9782
6b3b8c27 9783 format_num = tree_to_uhwi (format_num_expr);
b34c7881 9784
5039610b
SL		 9785 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
9786 inner_arg != 0;
9787 inner_arg = next_call_expr_arg (&iter), i++)
b34c7881
JT		 9788 if (i == format_num)
9789 {
9790 check_function_arguments_recurse (callback, ctx,
5039610b 9791 inner_arg, param_num);
b34c7881
JT		 9792 found_format_arg = true;
9793 break;
9794 }
9795 }
9796
9797 /* If we found a format_arg attribute and did a recursive check,
9798 we are done with checking this argument. Otherwise, we continue
9799 and this will be considered a non-literal. */
9800 if (found_format_arg)
9801 return;
9802 }
9803
9804 if (TREE_CODE (param) == COND_EXPR)
9805 {
7f26f7df
JM		 9806 /* Simplify to avoid warning for an impossible case. */
9807 param = fold_for_warn (param);
9808 if (TREE_CODE (param) == COND_EXPR)
9809 {
9810 /* Check both halves of the conditional expression. */
9811 check_function_arguments_recurse (callback, ctx,
9812 TREE_OPERAND (param, 1),
9813 param_num);
9814 check_function_arguments_recurse (callback, ctx,
9815 TREE_OPERAND (param, 2),
9816 param_num);
9817 return;
9818 }
b34c7881
JT		 9819 }
9820
9821 (*callback) (ctx, param, param_num);
9822}
e2500fed 9823
a98c2819
MLI		 9824/* Checks for a builtin function FNDECL that the number of arguments
9825 NARGS against the required number REQUIRED and issues an error if
9826 there is a mismatch. Returns true if the number of arguments is
79ce98bc 9827 correct, otherwise false. LOC is the location of FNDECL. */
83322951
RG		 9828
9829static bool
79ce98bc
MP		 9830builtin_function_validate_nargs (location_t loc, tree fndecl, int nargs,
9831 int required)
83322951
RG		 9832{
9833 if (nargs < required)
9834 {
e01b4e16 9835 error_at (loc, "too few arguments to function %qE", fndecl);
83322951
RG		 9836 return false;
9837 }
9838 else if (nargs > required)
9839 {
79ce98bc 9840 error_at (loc, "too many arguments to function %qE", fndecl);
83322951
RG		 9841 return false;
9842 }
9843 return true;
9844}
9845
79ce98bc
MP		 9846/* Helper macro for check_builtin_function_arguments. */
9847#define ARG_LOCATION(N) \
9848 (arg_loc.is_empty () \
9849 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
9850 : expansion_point_location (arg_loc[(N)]))
9851
83322951 9852/* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
79ce98bc
MP		 9853 Returns false if there was an error, otherwise true. LOC is the
9854 location of the function; ARG_LOC is a vector of locations of the
9855 arguments. */
83322951
RG		 9856
9857bool
79ce98bc
MP		 9858check_builtin_function_arguments (location_t loc, vec<location_t> arg_loc,
9859 tree fndecl, int nargs, tree *args)
83322951
RG		 9860{
9861 if (!DECL_BUILT_IN (fndecl)
9862 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
9863 return true;
9864
9865 switch (DECL_FUNCTION_CODE (fndecl))
9866 {
35886f0b
MS		 9867 case BUILT_IN_ALLOCA_WITH_ALIGN:
9868 {
9869 /* Get the requested alignment (in bits) if it's a constant
9870 integer expression. */
9871 unsigned HOST_WIDE_INT align
9872 = tree_fits_uhwi_p (args[1]) ? tree_to_uhwi (args[1]) : 0;
9873
9874 /* Determine if the requested alignment is a power of 2. */
9875 if ((align & (align - 1)))
9876 align = 0;
9877
9878 /* The maximum alignment in bits corresponding to the same
9879 maximum in bytes enforced in check_user_alignment(). */
9880 unsigned maxalign = (UINT_MAX >> 1) + 1;
79ce98bc 9881
35886f0b
MS		 9882 /* Reject invalid alignments. */
9883 if (align < BITS_PER_UNIT || maxalign < align)
9884 {
79ce98bc 9885 error_at (ARG_LOCATION (1),
35886f0b
MS		 9886 "second argument to function %qE must be a constant "
9887 "integer power of 2 between %qi and %qu bits",
9888 fndecl, BITS_PER_UNIT, maxalign);
9889 return false;
9890 }
79ce98bc 9891 return true;
35886f0b
MS		 9892 }
9893
83322951 9894 case BUILT_IN_CONSTANT_P:
79ce98bc 9895 return builtin_function_validate_nargs (loc, fndecl, nargs, 1);
83322951
RG		 9896
9897 case BUILT_IN_ISFINITE:
9898 case BUILT_IN_ISINF:
05f41289 9899 case BUILT_IN_ISINF_SIGN:
83322951
RG		 9900 case BUILT_IN_ISNAN:
9901 case BUILT_IN_ISNORMAL:
61717a45 9902 case BUILT_IN_SIGNBIT:
79ce98bc 9903 if (builtin_function_validate_nargs (loc, fndecl, nargs, 1))
83322951
RG		 9904 {
9905 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
9906 {
79ce98bc
MP		 9907 error_at (ARG_LOCATION (0), "non-floating-point argument in "
9908 "call to function %qE", fndecl);
83322951
RG		 9909 return false;
9910 }
9911 return true;
9912 }
9913 return false;
9914
9915 case BUILT_IN_ISGREATER:
9916 case BUILT_IN_ISGREATEREQUAL:
9917 case BUILT_IN_ISLESS:
9918 case BUILT_IN_ISLESSEQUAL:
9919 case BUILT_IN_ISLESSGREATER:
9920 case BUILT_IN_ISUNORDERED:
79ce98bc 9921 if (builtin_function_validate_nargs (loc, fndecl, nargs, 2))
83322951
RG		 9922 {
9923 enum tree_code code0, code1;
9924 code0 = TREE_CODE (TREE_TYPE (args[0]));
9925 code1 = TREE_CODE (TREE_TYPE (args[1]));
9926 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
9927 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9928 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
9929 {
79ce98bc
MP		 9930 error_at (loc, "non-floating-point arguments in call to "
9931 "function %qE", fndecl);
83322951
RG		 9932 return false;
9933 }
9934 return true;
9935 }
9936 return false;
9937
3bf5906b 9938 case BUILT_IN_FPCLASSIFY:
79ce98bc 9939 if (builtin_function_validate_nargs (loc, fndecl, nargs, 6))
3bf5906b 9940 {
79ce98bc 9941 for (unsigned int i = 0; i < 5; i++)
3bf5906b
KG		 9942 if (TREE_CODE (args[i]) != INTEGER_CST)
9943 {
79ce98bc
MP		 9944 error_at (ARG_LOCATION (i), "non-const integer argument %u in "
9945 "call to function %qE", i + 1, fndecl);
3bf5906b
KG		 9946 return false;
9947 }
9948
9949 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
9950 {
79ce98bc
MP		 9951 error_at (ARG_LOCATION (5), "non-floating-point argument in "
9952 "call to function %qE", fndecl);
3bf5906b
KG		 9953 return false;
9954 }
9955 return true;
9956 }
9957 return false;
9958
45d439ac 9959 case BUILT_IN_ASSUME_ALIGNED:
79ce98bc 9960 if (builtin_function_validate_nargs (loc, fndecl, nargs, 2 + (nargs > 2)))
45d439ac
JJ		 9961 {
9962 if (nargs >= 3 && TREE_CODE (TREE_TYPE (args[2])) != INTEGER_TYPE)
9963 {
79ce98bc
MP		 9964 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
9965 "function %qE", fndecl);
45d439ac
JJ		 9966 return false;
9967 }
9968 return true;
9969 }
9970 return false;
9971
1304953e
JJ		 9972 case BUILT_IN_ADD_OVERFLOW:
9973 case BUILT_IN_SUB_OVERFLOW:
9974 case BUILT_IN_MUL_OVERFLOW:
79ce98bc 9975 if (builtin_function_validate_nargs (loc, fndecl, nargs, 3))
1304953e
JJ		 9976 {
9977 unsigned i;
9978 for (i = 0; i < 2; i++)
9979 if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i])))
9980 {
79ce98bc
MP		 9981 error_at (ARG_LOCATION (i), "argument %u in call to function "
9982 "%qE does not have integral type", i + 1, fndecl);
1304953e
JJ		 9983 return false;
9984 }
9985 if (TREE_CODE (TREE_TYPE (args[2])) != POINTER_TYPE
9986 || TREE_CODE (TREE_TYPE (TREE_TYPE (args[2]))) != INTEGER_TYPE)
9987 {
79ce98bc
MP		 9988 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
9989 "does not have pointer to integer type", fndecl);
1304953e
JJ		 9990 return false;
9991 }
9992 return true;
9993 }
9994 return false;
9995
44a845ca
MS		 9996 case BUILT_IN_ADD_OVERFLOW_P:
9997 case BUILT_IN_SUB_OVERFLOW_P:
9998 case BUILT_IN_MUL_OVERFLOW_P:
9999 if (builtin_function_validate_nargs (loc, fndecl, nargs, 3))
10000 {
10001 unsigned i;
10002 for (i = 0; i < 3; i++)
10003 if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i])))
10004 {
10005 error_at (ARG_LOCATION (i), "argument %u in call to function "
10006 "%qE does not have integral type", i + 1, fndecl);
10007 return false;
10008 }
10009 return true;
10010 }
10011 return false;
10012
83322951
RG		 10013 default:
10014 return true;
10015 }
10016}
10017
d07605f5
AP		 10018/* Function to help qsort sort FIELD_DECLs by name order. */
10019
10020int
10021field_decl_cmp (const void *x_p, const void *y_p)
10022{
28dab132
BI		 10023 const tree *const x = (const tree *const) x_p;
10024 const tree *const y = (const tree *const) y_p;
10025
d07605f5
AP		 10026 if (DECL_NAME (*x) == DECL_NAME (*y))
10027 /* A nontype is "greater" than a type. */
10028 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
10029 if (DECL_NAME (*x) == NULL_TREE)
10030 return -1;
10031 if (DECL_NAME (*y) == NULL_TREE)
10032 return 1;
10033 if (DECL_NAME (*x) < DECL_NAME (*y))
10034 return -1;
10035 return 1;
10036}
10037
10038static struct {
10039 gt_pointer_operator new_value;
10040 void *cookie;
10041} resort_data;
10042
10043/* This routine compares two fields like field_decl_cmp but using the
10044pointer operator in resort_data. */
10045
10046static int
10047resort_field_decl_cmp (const void *x_p, const void *y_p)
10048{
28dab132
BI		 10049 const tree *const x = (const tree *const) x_p;
10050 const tree *const y = (const tree *const) y_p;
d07605f5
AP		 10051
10052 if (DECL_NAME (*x) == DECL_NAME (*y))
10053 /* A nontype is "greater" than a type. */
10054 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
10055 if (DECL_NAME (*x) == NULL_TREE)
10056 return -1;
10057 if (DECL_NAME (*y) == NULL_TREE)
10058 return 1;
10059 {
10060 tree d1 = DECL_NAME (*x);
10061 tree d2 = DECL_NAME (*y);
10062 resort_data.new_value (&d1, resort_data.cookie);
10063 resort_data.new_value (&d2, resort_data.cookie);
10064 if (d1 < d2)
10065 return -1;
10066 }
10067 return 1;
10068}
10069
10070/* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10071
10072void
10073resort_sorted_fields (void *obj,
e18476eb 10074 void * ARG_UNUSED (orig_obj),
6de9cd9a
DN		 10075 gt_pointer_operator new_value,
10076 void *cookie)
d07605f5 10077{
e18476eb 10078 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
d07605f5
AP		 10079 resort_data.new_value = new_value;
10080 resort_data.cookie = cookie;
10081 qsort (&sf->elts[0], sf->len, sizeof (tree),
6de9cd9a 10082 resort_field_decl_cmp);
d07605f5
AP		 10083}
10084
0a3ee0fd
GDR		 10085/* Subroutine of c_parse_error.
10086 Return the result of concatenating LHS and RHS. RHS is really
10087 a string literal, its first character is indicated by RHS_START and
3292fb42 10088 RHS_SIZE is its length (including the terminating NUL character).
0a3ee0fd
GDR		 10089
10090 The caller is responsible for deleting the returned pointer. */
10091
10092static char *
10093catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
10094{
10095 const int lhs_size = strlen (lhs);
10096 char *result = XNEWVEC (char, lhs_size + rhs_size);
10097 strncpy (result, lhs, lhs_size);
10098 strncpy (result + lhs_size, rhs_start, rhs_size);
10099 return result;
10100}
10101
4b794eaf 10102/* Issue the error given by GMSGID, indicating that it occurred before
4bb8ca28
MM		 10103 TOKEN, which had the associated VALUE. */
10104
10105void
b8698a0f 10106c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
cfc93532 10107 tree value, unsigned char token_flags)
4bb8ca28 10108{
0a3ee0fd
GDR		 10109#define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10110
10111 char *message = NULL;
4bb8ca28 10112
cfc93532 10113 if (token_type == CPP_EOF)
4b794eaf 10114 message = catenate_messages (gmsgid, " at end of input");
b8698a0f
L		 10115 else if (token_type == CPP_CHAR
10116 || token_type == CPP_WCHAR
cfc93532 10117 || token_type == CPP_CHAR16
fe95b036
ESR		 10118 || token_type == CPP_CHAR32
10119 || token_type == CPP_UTF8CHAR)
4bb8ca28
MM		 10120 {
10121 unsigned int val = TREE_INT_CST_LOW (value);
b6baa67d
KVH		 10122 const char *prefix;
10123
cfc93532 10124 switch (token_type)
b6baa67d
KVH		 10125 {
10126 default:
10127 prefix = "";
10128 break;
10129 case CPP_WCHAR:
10130 prefix = "L";
10131 break;
10132 case CPP_CHAR16:
10133 prefix = "u";
10134 break;
10135 case CPP_CHAR32:
10136 prefix = "U";
10137 break;
fe95b036
ESR		 10138 case CPP_UTF8CHAR:
10139 prefix = "u8";
10140 break;
b6baa67d
KVH		 10141 }
10142
4bb8ca28 10143 if (val <= UCHAR_MAX && ISGRAPH (val))
c22cacf3 10144 message = catenate_messages (gmsgid, " before %s'%c'");
4bb8ca28 10145 else
c22cacf3 10146 message = catenate_messages (gmsgid, " before %s'\\x%x'");
0a3ee0fd 10147
b6baa67d 10148 error (message, prefix, val);
0a3ee0fd
GDR		 10149 free (message);
10150 message = NULL;
4bb8ca28 10151 }
65e5a578
ESR		 10152 else if (token_type == CPP_CHAR_USERDEF
10153 || token_type == CPP_WCHAR_USERDEF
10154 || token_type == CPP_CHAR16_USERDEF
fe95b036
ESR		 10155 || token_type == CPP_CHAR32_USERDEF
10156 || token_type == CPP_UTF8CHAR_USERDEF)
65e5a578
ESR		 10157 message = catenate_messages (gmsgid,
10158 " before user-defined character literal");
10159 else if (token_type == CPP_STRING_USERDEF
10160 || token_type == CPP_WSTRING_USERDEF
10161 || token_type == CPP_STRING16_USERDEF
10162 || token_type == CPP_STRING32_USERDEF
10163 || token_type == CPP_UTF8STRING_USERDEF)
10164 message = catenate_messages (gmsgid, " before user-defined string literal");
b8698a0f
L		 10165 else if (token_type == CPP_STRING
10166 || token_type == CPP_WSTRING
cfc93532 10167 || token_type == CPP_STRING16
2c6e3f55
JJ		 10168 || token_type == CPP_STRING32
10169 || token_type == CPP_UTF8STRING)
4b794eaf 10170 message = catenate_messages (gmsgid, " before string constant");
cfc93532 10171 else if (token_type == CPP_NUMBER)
4b794eaf 10172 message = catenate_messages (gmsgid, " before numeric constant");
cfc93532 10173 else if (token_type == CPP_NAME)
0a3ee0fd 10174 {
4b794eaf 10175 message = catenate_messages (gmsgid, " before %qE");
c51a1ba9 10176 error (message, value);
0a3ee0fd
GDR		 10177 free (message);
10178 message = NULL;
10179 }
cfc93532 10180 else if (token_type == CPP_PRAGMA)
bc4071dd 10181 message = catenate_messages (gmsgid, " before %<#pragma%>");
cfc93532 10182 else if (token_type == CPP_PRAGMA_EOL)
bc4071dd 10183 message = catenate_messages (gmsgid, " before end of line");
34429675
JM		 10184 else if (token_type == CPP_DECLTYPE)
10185 message = catenate_messages (gmsgid, " before %<decltype%>");
cfc93532 10186 else if (token_type < N_TTYPES)
0a3ee0fd 10187 {
4b794eaf 10188 message = catenate_messages (gmsgid, " before %qs token");
cfc93532 10189 error (message, cpp_type2name (token_type, token_flags));
0a3ee0fd
GDR		 10190 free (message);
10191 message = NULL;
10192 }
4bb8ca28 10193 else
4b794eaf 10194 error (gmsgid);
0a3ee0fd
GDR		 10195
10196 if (message)
10197 {
10198 error (message);
10199 free (message);
10200 }
c22cacf3 10201#undef catenate_messages
4bb8ca28
MM		 10202}
10203
87cf0651
SB		 10204/* Return the gcc option code associated with the reason for a cpp
10205 message, or 0 if none. */
10206
10207static int
10208c_option_controlling_cpp_error (int reason)
10209{
b559c810 10210 const struct cpp_reason_option_codes_t *entry;
87cf0651 10211
b559c810 10212 for (entry = cpp_reason_option_codes; entry->reason != CPP_W_NONE; entry++)
87cf0651
SB		 10213 {
10214 if (entry->reason == reason)
10215 return entry->option_code;
10216 }
10217 return 0;
10218}
10219
148e4216 10220/* Callback from cpp_error for PFILE to print diagnostics from the
87cf0651
SB		 10221 preprocessor. The diagnostic is of type LEVEL, with REASON set
10222 to the reason code if LEVEL is represents a warning, at location
8a645150
DM		 10223 RICHLOC unless this is after lexing and the compiler's location
10224 should be used instead; MSG is the translated message and AP
148e4216
JM		 10225 the arguments. Returns true if a diagnostic was emitted, false
10226 otherwise. */
10227
10228bool
87cf0651 10229c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason,
8a645150 10230 rich_location *richloc,
148e4216
JM		 10231 const char *msg, va_list *ap)
10232{
10233 diagnostic_info diagnostic;
10234 diagnostic_t dlevel;
e3339d0f 10235 bool save_warn_system_headers = global_dc->dc_warn_system_headers;
148e4216
JM		 10236 bool ret;
10237
10238 switch (level)
10239 {
10240 case CPP_DL_WARNING_SYSHDR:
10241 if (flag_no_output)
10242 return false;
e3339d0f 10243 global_dc->dc_warn_system_headers = 1;
148e4216
JM		 10244 /* Fall through. */
10245 case CPP_DL_WARNING:
10246 if (flag_no_output)
10247 return false;
10248 dlevel = DK_WARNING;
10249 break;
10250 case CPP_DL_PEDWARN:
10251 if (flag_no_output && !flag_pedantic_errors)
10252 return false;
10253 dlevel = DK_PEDWARN;
10254 break;
10255 case CPP_DL_ERROR:
10256 dlevel = DK_ERROR;
10257 break;
10258 case CPP_DL_ICE:
10259 dlevel = DK_ICE;
10260 break;
10261 case CPP_DL_NOTE:
10262 dlevel = DK_NOTE;
10263 break;
47580d22
JM		 10264 case CPP_DL_FATAL:
10265 dlevel = DK_FATAL;
10266 break;
148e4216
JM		 10267 default:
10268 gcc_unreachable ();
10269 }
10270 if (done_lexing)
f79520bb 10271 richloc->set_range (line_table, 0, input_location, true);
148e4216 10272 diagnostic_set_info_translated (&diagnostic, msg, ap,
8a645150 10273 richloc, dlevel);
87cf0651
SB		 10274 diagnostic_override_option_index (&diagnostic,
10275 c_option_controlling_cpp_error (reason));
148e4216
JM		 10276 ret = report_diagnostic (&diagnostic);
10277 if (level == CPP_DL_WARNING_SYSHDR)
e3339d0f 10278 global_dc->dc_warn_system_headers = save_warn_system_headers;
148e4216
JM		 10279 return ret;
10280}
10281
c5ff069d
ZW		 10282/* Convert a character from the host to the target execution character
10283 set. cpplib handles this, mostly. */
10284
10285HOST_WIDE_INT
10286c_common_to_target_charset (HOST_WIDE_INT c)
10287{
10288 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10289 zero-extended under -fno-signed-char. cpplib insists that characters
10290 and character constants are always unsigned. Hence we must convert
10291 back and forth. */
10292 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
10293
10294 uc = cpp_host_to_exec_charset (parse_in, uc);
10295
10296 if (flag_signed_char)
10297 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
10298 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
10299 else
10300 return uc;
10301}
10302
cf9e9959
EB		 10303/* Fold an offsetof-like expression. EXPR is a nested sequence of component
10304 references with an INDIRECT_REF of a constant at the bottom; much like the
10305 traditional rendering of offsetof as a macro. Return the folded result. */
ee8a6a3e 10306
cf9e9959 10307tree
c85158de 10308fold_offsetof_1 (tree expr, enum tree_code ctx)
ee8a6a3e 10309{
ee8a6a3e 10310 tree base, off, t;
c85158de
MS		 10311 tree_code code = TREE_CODE (expr);
10312 switch (code)
ee8a6a3e
RH		 10313 {
10314 case ERROR_MARK:
10315 return expr;
10316
545b7d8c
VR		 10317 case VAR_DECL:
10318 error ("cannot apply %<offsetof%> to static data member %qD", expr);
10319 return error_mark_node;
10320
6d4d7b0e 10321 case CALL_EXPR:
8d5f60ac 10322 case TARGET_EXPR:
6d4d7b0e
PB		 10323 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10324 return error_mark_node;
10325
6d4d7b0e
PB		 10326 case NOP_EXPR:
10327 case INDIRECT_REF:
cf9e9959 10328 if (!TREE_CONSTANT (TREE_OPERAND (expr, 0)))
61c3c490
DS		 10329 {
10330 error ("cannot apply %<offsetof%> to a non constant address");
10331 return error_mark_node;
10332 }
cf9e9959 10333 return TREE_OPERAND (expr, 0);
6d4d7b0e 10334
ee8a6a3e 10335 case COMPONENT_REF:
c85158de 10336 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
ee8a6a3e
RH		 10337 if (base == error_mark_node)
10338 return base;
10339
10340 t = TREE_OPERAND (expr, 1);
10341 if (DECL_C_BIT_FIELD (t))
10342 {
10343 error ("attempt to take address of bit-field structure "
c51a1ba9 10344 "member %qD", t);
ee8a6a3e
RH		 10345 return error_mark_node;
10346 }
db3927fb 10347 off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t),
386b1f1f 10348 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t))
db3927fb 10349 / BITS_PER_UNIT));
ee8a6a3e
RH		 10350 break;
10351
10352 case ARRAY_REF:
c85158de 10353 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
ee8a6a3e
RH		 10354 if (base == error_mark_node)
10355 return base;
10356
10357 t = TREE_OPERAND (expr, 1);
61c3c490
DS		 10358
10359 /* Check if the offset goes beyond the upper bound of the array. */
cf9e9959 10360 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) >= 0)
d32599a6
JJ		 10361 {
10362 tree upbound = array_ref_up_bound (expr);
10363 if (upbound != NULL_TREE
10364 && TREE_CODE (upbound) == INTEGER_CST
10365 && !tree_int_cst_equal (upbound,
10366 TYPE_MAX_VALUE (TREE_TYPE (upbound))))
10367 {
c85158de
MS		 10368 if (ctx != ARRAY_REF && ctx != COMPONENT_REF)
10369 upbound = size_binop (PLUS_EXPR, upbound,
10370 build_int_cst (TREE_TYPE (upbound), 1));
d32599a6
JJ		 10371 if (tree_int_cst_lt (upbound, t))
10372 {
10373 tree v;
10374
10375 for (v = TREE_OPERAND (expr, 0);
10376 TREE_CODE (v) == COMPONENT_REF;
10377 v = TREE_OPERAND (v, 0))
10378 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0)))
10379 == RECORD_TYPE)
10380 {
910ad8de
NF		 10381 tree fld_chain = DECL_CHAIN (TREE_OPERAND (v, 1));
10382 for (; fld_chain; fld_chain = DECL_CHAIN (fld_chain))
d32599a6
JJ		 10383 if (TREE_CODE (fld_chain) == FIELD_DECL)
10384 break;
10385
10386 if (fld_chain)
10387 break;
10388 }
10389 /* Don't warn if the array might be considered a poor
10390 man's flexible array member with a very permissive
10391 definition thereof. */
10392 if (TREE_CODE (v) == ARRAY_REF
10393 || TREE_CODE (v) == COMPONENT_REF)
10394 warning (OPT_Warray_bounds,
10395 "index %E denotes an offset "
10396 "greater than size of %qT",
10397 t, TREE_TYPE (TREE_OPERAND (expr, 0)));
10398 }
10399 }
10400 }
cf9e9959
EB		 10401
10402 t = convert (sizetype, t);
10403 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
ee8a6a3e
RH		 10404 break;
10405
1916c916
VR		 10406 case COMPOUND_EXPR:
10407 /* Handle static members of volatile structs. */
10408 t = TREE_OPERAND (expr, 1);
0ae9bd27 10409 gcc_assert (VAR_P (t));
cf9e9959 10410 return fold_offsetof_1 (t);
1916c916 10411
ee8a6a3e 10412 default:
366de0ce 10413 gcc_unreachable ();
ee8a6a3e
RH		 10414 }
10415
cf9e9959 10416 return fold_build_pointer_plus (base, off);
ee8a6a3e
RH		 10417}
10418
cf9e9959
EB		 10419/* Likewise, but convert it to the return type of offsetof. */
10420
ee8a6a3e 10421tree
cf9e9959 10422fold_offsetof (tree expr)
ee8a6a3e 10423{
cf9e9959 10424 return convert (size_type_node, fold_offsetof_1 (expr));
ee8a6a3e
RH		 10425}
10426
d166d4c3
AK		 10427/* Warn for A ?: C expressions (with B omitted) where A is a boolean
10428 expression, because B will always be true. */
10429
10430void
10431warn_for_omitted_condop (location_t location, tree cond)
10432{
10433 if (truth_value_p (TREE_CODE (cond)))
10434 warning_at (location, OPT_Wparentheses,
10435 "the omitted middle operand in ?: will always be %<true%>, "
10436 "suggest explicit middle operand");
10437}
10438
4816c593
NF		 10439/* Give an error for storing into ARG, which is 'const'. USE indicates
10440 how ARG was being used. */
10441
10442void
c02065fc 10443readonly_error (location_t loc, tree arg, enum lvalue_use use)
4816c593
NF		 10444{
10445 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
10446 || use == lv_asm);
10447 /* Using this macro rather than (for example) arrays of messages
10448 ensures that all the format strings are checked at compile
10449 time. */
10450#define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10451 : (use == lv_increment ? (I) \
10452 : (use == lv_decrement ? (D) : (AS))))
10453 if (TREE_CODE (arg) == COMPONENT_REF)
10454 {
10455 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
c02065fc
AH		 10456 error_at (loc, READONLY_MSG (G_("assignment of member "
10457 "%qD in read-only object"),
10458 G_("increment of member "
10459 "%qD in read-only object"),
10460 G_("decrement of member "
10461 "%qD in read-only object"),
10462 G_("member %qD in read-only object "
10463 "used as %<asm%> output")),
10464 TREE_OPERAND (arg, 1));
4816c593 10465 else
c02065fc
AH		 10466 error_at (loc, READONLY_MSG (G_("assignment of read-only member %qD"),
10467 G_("increment of read-only member %qD"),
10468 G_("decrement of read-only member %qD"),
10469 G_("read-only member %qD used as %<asm%> output")),
10470 TREE_OPERAND (arg, 1));
4816c593 10471 }
0ae9bd27 10472 else if (VAR_P (arg))
c02065fc
AH		 10473 error_at (loc, READONLY_MSG (G_("assignment of read-only variable %qD"),
10474 G_("increment of read-only variable %qD"),
10475 G_("decrement of read-only variable %qD"),
10476 G_("read-only variable %qD used as %<asm%> output")),
10477 arg);
4816c593 10478 else if (TREE_CODE (arg) == PARM_DECL)
c02065fc
AH		 10479 error_at (loc, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10480 G_("increment of read-only parameter %qD"),
10481 G_("decrement of read-only parameter %qD"),
10482 G_("read-only parameter %qD use as %<asm%> output")),
10483 arg);
4816c593
NF		 10484 else if (TREE_CODE (arg) == RESULT_DECL)
10485 {
10486 gcc_assert (c_dialect_cxx ());
c02065fc
AH		 10487 error_at (loc, READONLY_MSG (G_("assignment of "
10488 "read-only named return value %qD"),
10489 G_("increment of "
10490 "read-only named return value %qD"),
10491 G_("decrement of "
10492 "read-only named return value %qD"),
10493 G_("read-only named return value %qD "
10494 "used as %<asm%>output")),
10495 arg);
4816c593
NF		 10496 }
10497 else if (TREE_CODE (arg) == FUNCTION_DECL)
c02065fc
AH		 10498 error_at (loc, READONLY_MSG (G_("assignment of function %qD"),
10499 G_("increment of function %qD"),
10500 G_("decrement of function %qD"),
10501 G_("function %qD used as %<asm%> output")),
10502 arg);
4816c593 10503 else
c02065fc
AH		 10504 error_at (loc, READONLY_MSG (G_("assignment of read-only location %qE"),
10505 G_("increment of read-only location %qE"),
10506 G_("decrement of read-only location %qE"),
10507 G_("read-only location %qE used as %<asm%> output")),
10508 arg);
4816c593
NF		 10509}
10510
37dc0d8d 10511/* Print an error message for an invalid lvalue. USE says
7bd11157
TT		 10512 how the lvalue is being used and so selects the error message. LOC
10513 is the location for the error. */
5ae9ba3e 10514
37dc0d8d 10515void
7bd11157 10516lvalue_error (location_t loc, enum lvalue_use use)
5ae9ba3e 10517{
37dc0d8d 10518 switch (use)
5ae9ba3e 10519 {
37dc0d8d 10520 case lv_assign:
7bd11157 10521 error_at (loc, "lvalue required as left operand of assignment");
37dc0d8d
JM		 10522 break;
10523 case lv_increment:
7bd11157 10524 error_at (loc, "lvalue required as increment operand");
37dc0d8d
JM		 10525 break;
10526 case lv_decrement:
7bd11157 10527 error_at (loc, "lvalue required as decrement operand");
37dc0d8d
JM		 10528 break;
10529 case lv_addressof:
7bd11157 10530 error_at (loc, "lvalue required as unary %<&%> operand");
37dc0d8d
JM		 10531 break;
10532 case lv_asm:
7bd11157 10533 error_at (loc, "lvalue required in asm statement");
37dc0d8d
JM		 10534 break;
10535 default:
10536 gcc_unreachable ();
5ae9ba3e 10537 }
5ae9ba3e 10538}
7a6daeb0
NF		 10539
10540/* Print an error message for an invalid indirection of type TYPE.
10541 ERRSTRING is the name of the operator for the indirection. */
10542
10543void
10544invalid_indirection_error (location_t loc, tree type, ref_operator errstring)
10545{
10546 switch (errstring)
10547 {
10548 case RO_NULL:
10549 gcc_assert (c_dialect_cxx ());
10550 error_at (loc, "invalid type argument (have %qT)", type);
10551 break;
10552 case RO_ARRAY_INDEXING:
10553 error_at (loc,
10554 "invalid type argument of array indexing (have %qT)",
10555 type);
10556 break;
10557 case RO_UNARY_STAR:
10558 error_at (loc,
10559 "invalid type argument of unary %<*%> (have %qT)",
10560 type);
10561 break;
10562 case RO_ARROW:
10563 error_at (loc,
10564 "invalid type argument of %<->%> (have %qT)",
10565 type);
10566 break;
55a7f02f
MP		 10567 case RO_ARROW_STAR:
10568 error_at (loc,
10569 "invalid type argument of %<->*%> (have %qT)",
10570 type);
10571 break;
7a6daeb0
NF		 10572 case RO_IMPLICIT_CONVERSION:
10573 error_at (loc,
10574 "invalid type argument of implicit conversion (have %qT)",
10575 type);
10576 break;
10577 default:
10578 gcc_unreachable ();
10579 }
10580}
aab038d5
RH		 10581\f
10582/* *PTYPE is an incomplete array. Complete it with a domain based on
10583 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10584 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10585 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10586
10587int
10588complete_array_type (tree *ptype, tree initial_value, bool do_default)
10589{
10590 tree maxindex, type, main_type, elt, unqual_elt;
10591 int failure = 0, quals;
06d40de8 10592 hashval_t hashcode = 0;
40d3d530 10593 bool overflow_p = false;
aab038d5
RH		 10594
10595 maxindex = size_zero_node;
10596 if (initial_value)
10597 {
10598 if (TREE_CODE (initial_value) == STRING_CST)
10599 {
10600 int eltsize
10601 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
10602 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
10603 }
10604 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
10605 {
9771b263 10606 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (initial_value);
aab038d5 10607
9771b263 10608 if (vec_safe_is_empty (v))
aab038d5
RH		 10609 {
10610 if (pedantic)
10611 failure = 3;
830c740f 10612 maxindex = ssize_int (-1);
aab038d5
RH		 10613 }
10614 else
10615 {
10616 tree curindex;
4038c495
GB		 10617 unsigned HOST_WIDE_INT cnt;
10618 constructor_elt *ce;
cff7525f 10619 bool fold_p = false;
aab038d5 10620
9771b263 10621 if ((*v)[0].index)
40d3d530
JR		 10622 maxindex = (*v)[0].index, fold_p = true;
10623
aab038d5
RH		 10624 curindex = maxindex;
10625
9771b263 10626 for (cnt = 1; vec_safe_iterate (v, cnt, &ce); cnt++)
aab038d5 10627 {
cff7525f 10628 bool curfold_p = false;
4038c495 10629 if (ce->index)
cff7525f 10630 curindex = ce->index, curfold_p = true;
aab038d5 10631 else
cff7525f
JH		 10632 {
10633 if (fold_p)
40d3d530
JR		 10634 {
10635 /* Since we treat size types now as ordinary
10636 unsigned types, we need an explicit overflow
10637 check. */
10638 tree orig = curindex;
10639 curindex = fold_convert (sizetype, curindex);
10640 overflow_p |= tree_int_cst_lt (curindex, orig);
10641 }
db3927fb
AH		 10642 curindex = size_binop (PLUS_EXPR, curindex,
10643 size_one_node);
cff7525f 10644 }
aab038d5 10645 if (tree_int_cst_lt (maxindex, curindex))
cff7525f 10646 maxindex = curindex, fold_p = curfold_p;
aab038d5 10647 }
40d3d530
JR		 10648 if (fold_p)
10649 {
10650 tree orig = maxindex;
10651 maxindex = fold_convert (sizetype, maxindex);
10652 overflow_p |= tree_int_cst_lt (maxindex, orig);
10653 }
aab038d5
RH		 10654 }
10655 }
10656 else
10657 {
10658 /* Make an error message unless that happened already. */
10659 if (initial_value != error_mark_node)
10660 failure = 1;
10661 }
10662 }
10663 else
10664 {
10665 failure = 2;
10666 if (!do_default)
10667 return failure;
10668 }
10669
10670 type = *ptype;
10671 elt = TREE_TYPE (type);
10672 quals = TYPE_QUALS (strip_array_types (elt));
10673 if (quals == 0)
10674 unqual_elt = elt;
10675 else
36c5e70a 10676 unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals));
aab038d5
RH		 10677
10678 /* Using build_distinct_type_copy and modifying things afterward instead
10679 of using build_array_type to create a new type preserves all of the
10680 TYPE_LANG_FLAG_? bits that the front end may have set. */
10681 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
10682 TREE_TYPE (main_type) = unqual_elt;
e6313a78
RG		 10683 TYPE_DOMAIN (main_type)
10684 = build_range_type (TREE_TYPE (maxindex),
10685 build_int_cst (TREE_TYPE (maxindex), 0), maxindex);
aab038d5
RH		 10686 layout_type (main_type);
10687
06d40de8
DG		 10688 /* Make sure we have the canonical MAIN_TYPE. */
10689 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
b8698a0f 10690 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
06d40de8
DG		 10691 hashcode);
10692 main_type = type_hash_canon (hashcode, main_type);
10693
9ae165a0
DG		 10694 /* Fix the canonical type. */
10695 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
10696 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
10697 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
10698 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
10699 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
10700 != TYPE_DOMAIN (main_type)))
b8698a0f 10701 TYPE_CANONICAL (main_type)
9ae165a0
DG		 10702 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
10703 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
10704 else
10705 TYPE_CANONICAL (main_type) = main_type;
10706
aab038d5
RH		 10707 if (quals == 0)
10708 type = main_type;
10709 else
10710 type = c_build_qualified_type (main_type, quals);
10711
7bfcb402
JM		 10712 if (COMPLETE_TYPE_P (type)
10713 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
40d3d530 10714 && (overflow_p || TREE_OVERFLOW (TYPE_SIZE_UNIT (type))))
7bfcb402
JM		 10715 {
10716 error ("size of array is too large");
10717 /* If we proceed with the array type as it is, we'll eventually
386b1f1f 10718 crash in tree_to_[su]hwi(). */
7bfcb402
JM		 10719 type = error_mark_node;
10720 }
10721
aab038d5
RH		 10722 *ptype = type;
10723 return failure;
10724}
5ae9ba3e 10725
30cd1c5d
AS		 10726/* Like c_mark_addressable but don't check register qualifier. */
10727void
10728c_common_mark_addressable_vec (tree t)
10729{
10730 while (handled_component_p (t))
10731 t = TREE_OPERAND (t, 0);
0ae9bd27 10732 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
30cd1c5d
AS		 10733 return;
10734 TREE_ADDRESSABLE (t) = 1;
10735}
10736
10737
48ae6c13
RH		 10738\f
10739/* Used to help initialize the builtin-types.def table. When a type of
10740 the correct size doesn't exist, use error_mark_node instead of NULL.
10741 The later results in segfaults even when a decl using the type doesn't
10742 get invoked. */
10743
10744tree
10745builtin_type_for_size (int size, bool unsignedp)
10746{
21fa2faf 10747 tree type = c_common_type_for_size (size, unsignedp);
48ae6c13
RH		 10748 return type ? type : error_mark_node;
10749}
10750
10751/* A helper function for resolve_overloaded_builtin in resolving the
10752 overloaded __sync_ builtins. Returns a positive power of 2 if the
10753 first operand of PARAMS is a pointer to a supported data type.
7a127fa7
MS		 10754 Returns 0 if an error is encountered.
10755 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10756 built-ins. */
48ae6c13
RH		 10757
10758static int
7a127fa7 10759sync_resolve_size (tree function, vec<tree, va_gc> *params, bool fetch)
48ae6c13 10760{
7a127fa7
MS		 10761 /* Type of the argument. */
10762 tree argtype;
10763 /* Type the argument points to. */
48ae6c13
RH		 10764 tree type;
10765 int size;
10766
ba6b3795 10767 if (vec_safe_is_empty (params))
48ae6c13
RH		 10768 {
10769 error ("too few arguments to function %qE", function);
10770 return 0;
10771 }
10772
7a127fa7 10773 argtype = type = TREE_TYPE ((*params)[0]);
6415bd5d
JM		 10774 if (TREE_CODE (type) == ARRAY_TYPE)
10775 {
10776 /* Force array-to-pointer decay for C++. */
10777 gcc_assert (c_dialect_cxx());
10778 (*params)[0] = default_conversion ((*params)[0]);
10779 type = TREE_TYPE ((*params)[0]);
10780 }
48ae6c13
RH		 10781 if (TREE_CODE (type) != POINTER_TYPE)
10782 goto incompatible;
10783
10784 type = TREE_TYPE (type);
10785 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
10786 goto incompatible;
10787
7a127fa7
MS		 10788 if (fetch && TREE_CODE (type) == BOOLEAN_TYPE)
10789 goto incompatible;
10790
ae7e9ddd 10791 size = tree_to_uhwi (TYPE_SIZE_UNIT (type));
a0274e3e 10792 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
48ae6c13
RH		 10793 return size;
10794
10795 incompatible:
9f04a53e
MS		 10796 /* Issue the diagnostic only if the argument is valid, otherwise
10797 it would be redundant at best and could be misleading. */
10798 if (argtype != error_mark_node)
10799 error ("operand type %qT is incompatible with argument %d of %qE",
10800 argtype, 1, function);
48ae6c13
RH		 10801 return 0;
10802}
10803
c22cacf3 10804/* A helper function for resolve_overloaded_builtin. Adds casts to
48ae6c13
RH		 10805 PARAMS to make arguments match up with those of FUNCTION. Drops
10806 the variadic arguments at the end. Returns false if some error
10807 was encountered; true on success. */
10808
10809static bool
86951993 10810sync_resolve_params (location_t loc, tree orig_function, tree function,
9771b263 10811 vec<tree, va_gc> *params, bool orig_format)
48ae6c13 10812{
e19a18d4 10813 function_args_iterator iter;
48ae6c13 10814 tree ptype;
bbbbb16a 10815 unsigned int parmnum;
48ae6c13 10816
e19a18d4 10817 function_args_iter_init (&iter, TREE_TYPE (function));
48ae6c13
RH		 10818 /* We've declared the implementation functions to use "volatile void *"
10819 as the pointer parameter, so we shouldn't get any complaints from the
10820 call to check_function_arguments what ever type the user used. */
e19a18d4 10821 function_args_iter_next (&iter);
9771b263 10822 ptype = TREE_TYPE (TREE_TYPE ((*params)[0]));
267bac10 10823 ptype = TYPE_MAIN_VARIANT (ptype);
48ae6c13
RH		 10824
10825 /* For the rest of the values, we need to cast these to FTYPE, so that we
10826 don't get warnings for passing pointer types, etc. */
bbbbb16a 10827 parmnum = 0;
e19a18d4 10828 while (1)
48ae6c13 10829 {
e19a18d4
NF		 10830 tree val, arg_type;
10831
10832 arg_type = function_args_iter_cond (&iter);
10833 /* XXX void_type_node belies the abstraction. */
10834 if (arg_type == void_type_node)
10835 break;
48ae6c13 10836
bbbbb16a 10837 ++parmnum;
9771b263 10838 if (params->length () <= parmnum)
48ae6c13 10839 {
86951993 10840 error_at (loc, "too few arguments to function %qE", orig_function);
48ae6c13
RH		 10841 return false;
10842 }
10843
e3793c6f
JJ		 10844 /* Only convert parameters if arg_type is unsigned integer type with
10845 new format sync routines, i.e. don't attempt to convert pointer
10846 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10847 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10848 kinds). */
10849 if (TREE_CODE (arg_type) == INTEGER_TYPE && TYPE_UNSIGNED (arg_type))
86951993
AM		 10850 {
10851 /* Ideally for the first conversion we'd use convert_for_assignment
10852 so that we get warnings for anything that doesn't match the pointer
10853 type. This isn't portable across the C and C++ front ends atm. */
9771b263 10854 val = (*params)[parmnum];
86951993
AM		 10855 val = convert (ptype, val);
10856 val = convert (arg_type, val);
9771b263 10857 (*params)[parmnum] = val;
86951993 10858 }
48ae6c13 10859
e19a18d4 10860 function_args_iter_next (&iter);
48ae6c13
RH		 10861 }
10862
86951993 10863 /* __atomic routines are not variadic. */
9771b263 10864 if (!orig_format && params->length () != parmnum + 1)
86951993
AM		 10865 {
10866 error_at (loc, "too many arguments to function %qE", orig_function);
10867 return false;
10868 }
10869
48ae6c13
RH		 10870 /* The definition of these primitives is variadic, with the remaining
10871 being "an optional list of variables protected by the memory barrier".
10872 No clue what that's supposed to mean, precisely, but we consider all
10873 call-clobbered variables to be protected so we're safe. */
9771b263 10874 params->truncate (parmnum + 1);
48ae6c13
RH		 10875
10876 return true;
10877}
10878
c22cacf3 10879/* A helper function for resolve_overloaded_builtin. Adds a cast to
48ae6c13
RH		 10880 RESULT to make it match the type of the first pointer argument in
10881 PARAMS. */
10882
10883static tree
86951993 10884sync_resolve_return (tree first_param, tree result, bool orig_format)
48ae6c13 10885{
bbbbb16a 10886 tree ptype = TREE_TYPE (TREE_TYPE (first_param));
86951993 10887 tree rtype = TREE_TYPE (result);
99db1ef0 10888 ptype = TYPE_MAIN_VARIANT (ptype);
86951993
AM		 10889
10890 /* New format doesn't require casting unless the types are the same size. */
10891 if (orig_format || tree_int_cst_equal (TYPE_SIZE (ptype), TYPE_SIZE (rtype)))
10892 return convert (ptype, result);
10893 else
10894 return result;
10895}
10896
10897/* This function verifies the PARAMS to generic atomic FUNCTION.
10898 It returns the size if all the parameters are the same size, otherwise
10899 0 is returned if the parameters are invalid. */
10900
10901static int
9771b263
DN		 10902get_atomic_generic_size (location_t loc, tree function,
10903 vec<tree, va_gc> *params)
86951993
AM		 10904{
10905 unsigned int n_param;
10906 unsigned int n_model;
10907 unsigned int x;
10908 int size_0;
10909 tree type_0;
10910
10911 /* Determine the parameter makeup. */
10912 switch (DECL_FUNCTION_CODE (function))
10913 {
10914 case BUILT_IN_ATOMIC_EXCHANGE:
10915 n_param = 4;
10916 n_model = 1;
10917 break;
10918 case BUILT_IN_ATOMIC_LOAD:
10919 case BUILT_IN_ATOMIC_STORE:
10920 n_param = 3;
10921 n_model = 1;
10922 break;
10923 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
10924 n_param = 6;
10925 n_model = 2;
10926 break;
10927 default:
c466c4ff 10928 gcc_unreachable ();
86951993
AM		 10929 }
10930
9771b263 10931 if (vec_safe_length (params) != n_param)
86951993
AM		 10932 {
10933 error_at (loc, "incorrect number of arguments to function %qE", function);
10934 return 0;
10935 }
10936
10937 /* Get type of first parameter, and determine its size. */
9771b263 10938 type_0 = TREE_TYPE ((*params)[0]);
6415bd5d
JM		 10939 if (TREE_CODE (type_0) == ARRAY_TYPE)
10940 {
10941 /* Force array-to-pointer decay for C++. */
10942 gcc_assert (c_dialect_cxx());
10943 (*params)[0] = default_conversion ((*params)[0]);
10944 type_0 = TREE_TYPE ((*params)[0]);
10945 }
c466c4ff
AM		 10946 if (TREE_CODE (type_0) != POINTER_TYPE || VOID_TYPE_P (TREE_TYPE (type_0)))
10947 {
10948 error_at (loc, "argument 1 of %qE must be a non-void pointer type",
10949 function);
10950 return 0;
10951 }
10952
10953 /* Types must be compile time constant sizes. */
10954 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0)))) != INTEGER_CST)
86951993 10955 {
c466c4ff
AM		 10956 error_at (loc,
10957 "argument 1 of %qE must be a pointer to a constant size type",
10958 function);
86951993
AM		 10959 return 0;
10960 }
c466c4ff 10961
ae7e9ddd 10962 size_0 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0)));
86951993 10963
c466c4ff
AM		 10964 /* Zero size objects are not allowed. */
10965 if (size_0 == 0)
10966 {
10967 error_at (loc,
10968 "argument 1 of %qE must be a pointer to a nonzero size object",
10969 function);
10970 return 0;
10971 }
10972
86951993
AM		 10973 /* Check each other parameter is a pointer and the same size. */
10974 for (x = 0; x < n_param - n_model; x++)
10975 {
10976 int size;
9771b263 10977 tree type = TREE_TYPE ((*params)[x]);
688010ba 10978 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
86951993
AM		 10979 if (n_param == 6 && x == 3)
10980 continue;
10981 if (!POINTER_TYPE_P (type))
10982 {
10983 error_at (loc, "argument %d of %qE must be a pointer type", x + 1,
10984 function);
10985 return 0;
10986 }
7b56b2f8
MP		 10987 tree type_size = TYPE_SIZE_UNIT (TREE_TYPE (type));
10988 size = type_size ? tree_to_uhwi (type_size) : 0;
86951993
AM		 10989 if (size != size_0)
10990 {
10991 error_at (loc, "size mismatch in argument %d of %qE", x + 1,
10992 function);
10993 return 0;
10994 }
10995 }
10996
10997 /* Check memory model parameters for validity. */
10998 for (x = n_param - n_model ; x < n_param; x++)
10999 {
9771b263 11000 tree p = (*params)[x];
86951993
AM		 11001 if (TREE_CODE (p) == INTEGER_CST)
11002 {
ae7e9ddd 11003 int i = tree_to_uhwi (p);
46b35980 11004 if (i < 0 || (memmodel_base (i) >= MEMMODEL_LAST))
86951993
AM		 11005 {
11006 warning_at (loc, OPT_Winvalid_memory_model,
11007 "invalid memory model argument %d of %qE", x + 1,
11008 function);
86951993
AM		 11009 }
11010 }
11011 else
11012 if (!INTEGRAL_TYPE_P (TREE_TYPE (p)))
11013 {
11014 error_at (loc, "non-integer memory model argument %d of %qE", x + 1,
11015 function);
11016 return 0;
11017 }
11018 }
11019
11020 return size_0;
11021}
11022
11023
11024/* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11025 at the beginning of the parameter list PARAMS representing the size of the
11026 objects. This is to match the library ABI requirement. LOC is the location
11027 of the function call.
11028 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11029 returned to allow the external call to be constructed. */
11030
11031static tree
11032add_atomic_size_parameter (unsigned n, location_t loc, tree function,
9771b263 11033 vec<tree, va_gc> *params)
86951993
AM		 11034{
11035 tree size_node;
11036
11037 /* Insert a SIZE_T parameter as the first param. If there isn't
11038 enough space, allocate a new vector and recursively re-build with that. */
9771b263 11039 if (!params->space (1))
86951993
AM		 11040 {
11041 unsigned int z, len;
9771b263 11042 vec<tree, va_gc> *v;
86951993
AM		 11043 tree f;
11044
9771b263
DN		 11045 len = params->length ();
11046 vec_alloc (v, len + 1);
8edbfaa6 11047 v->quick_push (build_int_cst (size_type_node, n));
86951993 11048 for (z = 0; z < len; z++)
9771b263 11049 v->quick_push ((*params)[z]);
81e5eca8 11050 f = build_function_call_vec (loc, vNULL, function, v, NULL);
9771b263 11051 vec_free (v);
86951993
AM		 11052 return f;
11053 }
11054
11055 /* Add the size parameter and leave as a function call for processing. */
11056 size_node = build_int_cst (size_type_node, n);
9771b263 11057 params->quick_insert (0, size_node);
86951993
AM		 11058 return NULL_TREE;
11059}
11060
11061
6b28e197
JM		 11062/* Return whether atomic operations for naturally aligned N-byte
11063 arguments are supported, whether inline or through libatomic. */
11064static bool
11065atomic_size_supported_p (int n)
11066{
11067 switch (n)
11068 {
11069 case 1:
11070 case 2:
11071 case 4:
11072 case 8:
11073 return true;
11074
11075 case 16:
11076 return targetm.scalar_mode_supported_p (TImode);
11077
11078 default:
11079 return false;
11080 }
11081}
11082
86951993
AM		 11083/* This will process an __atomic_exchange function call, determine whether it
11084 needs to be mapped to the _N variation, or turned into a library call.
11085 LOC is the location of the builtin call.
11086 FUNCTION is the DECL that has been invoked;
11087 PARAMS is the argument list for the call. The return value is non-null
11088 TRUE is returned if it is translated into the proper format for a call to the
11089 external library, and NEW_RETURN is set the tree for that function.
11090 FALSE is returned if processing for the _N variation is required, and
026c3cfd 11091 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 11092static bool
11093resolve_overloaded_atomic_exchange (location_t loc, tree function,
9771b263 11094 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 11095{
11096 tree p0, p1, p2, p3;
11097 tree I_type, I_type_ptr;
11098 int n = get_atomic_generic_size (loc, function, params);
11099
c466c4ff
AM		 11100 /* Size of 0 is an error condition. */
11101 if (n == 0)
11102 {
11103 *new_return = error_mark_node;
11104 return true;
11105 }
11106
86951993 11107 /* If not a lock-free size, change to the library generic format. */
6b28e197 11108 if (!atomic_size_supported_p (n))
86951993
AM		 11109 {
11110 *new_return = add_atomic_size_parameter (n, loc, function, params);
11111 return true;
11112 }
11113
11114 /* Otherwise there is a lockfree match, transform the call from:
11115 void fn(T* mem, T* desired, T* return, model)
11116 into
11117 *return = (T) (fn (In* mem, (In) *desired, model)) */
11118
9771b263
DN		 11119 p0 = (*params)[0];
11120 p1 = (*params)[1];
11121 p2 = (*params)[2];
11122 p3 = (*params)[3];
86951993
AM		 11123
11124 /* Create pointer to appropriate size. */
11125 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11126 I_type_ptr = build_pointer_type (I_type);
11127
11128 /* Convert object pointer to required type. */
11129 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11130 (*params)[0] = p0;
86951993
AM		 11131 /* Convert new value to required type, and dereference it. */
11132 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11133 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
9771b263 11134 (*params)[1] = p1;
86951993
AM		 11135
11136 /* Move memory model to the 3rd position, and end param list. */
9771b263
DN		 11137 (*params)[2] = p3;
11138 params->truncate (3);
86951993
AM		 11139
11140 /* Convert return pointer and dereference it for later assignment. */
11141 *new_return = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11142
11143 return false;
48ae6c13
RH		 11144}
11145
86951993
AM		 11146
11147/* This will process an __atomic_compare_exchange function call, determine
11148 whether it needs to be mapped to the _N variation, or turned into a lib call.
11149 LOC is the location of the builtin call.
11150 FUNCTION is the DECL that has been invoked;
11151 PARAMS is the argument list for the call. The return value is non-null
11152 TRUE is returned if it is translated into the proper format for a call to the
11153 external library, and NEW_RETURN is set the tree for that function.
11154 FALSE is returned if processing for the _N variation is required. */
11155
11156static bool
11157resolve_overloaded_atomic_compare_exchange (location_t loc, tree function,
9771b263 11158 vec<tree, va_gc> *params,
86951993
AM		 11159 tree *new_return)
11160{
11161 tree p0, p1, p2;
11162 tree I_type, I_type_ptr;
11163 int n = get_atomic_generic_size (loc, function, params);
11164
c466c4ff
AM		 11165 /* Size of 0 is an error condition. */
11166 if (n == 0)
11167 {
11168 *new_return = error_mark_node;
11169 return true;
11170 }
11171
86951993 11172 /* If not a lock-free size, change to the library generic format. */
6b28e197 11173 if (!atomic_size_supported_p (n))
86951993
AM		 11174 {
11175 /* The library generic format does not have the weak parameter, so
11176 remove it from the param list. Since a parameter has been removed,
11177 we can be sure that there is room for the SIZE_T parameter, meaning
11178 there will not be a recursive rebuilding of the parameter list, so
11179 there is no danger this will be done twice. */
11180 if (n > 0)
11181 {
9771b263
DN		 11182 (*params)[3] = (*params)[4];
11183 (*params)[4] = (*params)[5];
11184 params->truncate (5);
86951993
AM		 11185 }
11186 *new_return = add_atomic_size_parameter (n, loc, function, params);
11187 return true;
11188 }
11189
11190 /* Otherwise, there is a match, so the call needs to be transformed from:
11191 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11192 into
11193 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11194
9771b263
DN		 11195 p0 = (*params)[0];
11196 p1 = (*params)[1];
11197 p2 = (*params)[2];
86951993
AM		 11198
11199 /* Create pointer to appropriate size. */
11200 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11201 I_type_ptr = build_pointer_type (I_type);
11202
11203 /* Convert object pointer to required type. */
11204 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11205 (*params)[0] = p0;
86951993
AM		 11206
11207 /* Convert expected pointer to required type. */
11208 p1 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p1);
9771b263 11209 (*params)[1] = p1;
86951993
AM		 11210
11211 /* Convert desired value to required type, and dereference it. */
11212 p2 = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11213 p2 = build1 (VIEW_CONVERT_EXPR, I_type, p2);
9771b263 11214 (*params)[2] = p2;
86951993
AM		 11215
11216 /* The rest of the parameters are fine. NULL means no special return value
11217 processing.*/
11218 *new_return = NULL;
11219 return false;
11220}
11221
11222
11223/* This will process an __atomic_load function call, determine whether it
11224 needs to be mapped to the _N variation, or turned into a library call.
11225 LOC is the location of the builtin call.
11226 FUNCTION is the DECL that has been invoked;
11227 PARAMS is the argument list for the call. The return value is non-null
11228 TRUE is returned if it is translated into the proper format for a call to the
11229 external library, and NEW_RETURN is set the tree for that function.
11230 FALSE is returned if processing for the _N variation is required, and
026c3cfd 11231 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 11232
11233static bool
11234resolve_overloaded_atomic_load (location_t loc, tree function,
9771b263 11235 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 11236{
11237 tree p0, p1, p2;
11238 tree I_type, I_type_ptr;
11239 int n = get_atomic_generic_size (loc, function, params);
11240
c466c4ff
AM		 11241 /* Size of 0 is an error condition. */
11242 if (n == 0)
11243 {
11244 *new_return = error_mark_node;
11245 return true;
11246 }
11247
86951993 11248 /* If not a lock-free size, change to the library generic format. */
6b28e197 11249 if (!atomic_size_supported_p (n))
86951993
AM		 11250 {
11251 *new_return = add_atomic_size_parameter (n, loc, function, params);
11252 return true;
11253 }
11254
11255 /* Otherwise, there is a match, so the call needs to be transformed from:
11256 void fn(T* mem, T* return, model)
11257 into
11258 *return = (T) (fn ((In *) mem, model)) */
11259
9771b263
DN		 11260 p0 = (*params)[0];
11261 p1 = (*params)[1];
11262 p2 = (*params)[2];
86951993
AM		 11263
11264 /* Create pointer to appropriate size. */
11265 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11266 I_type_ptr = build_pointer_type (I_type);
11267
11268 /* Convert object pointer to required type. */
11269 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11270 (*params)[0] = p0;
86951993
AM		 11271
11272 /* Move memory model to the 2nd position, and end param list. */
9771b263
DN		 11273 (*params)[1] = p2;
11274 params->truncate (2);
86951993
AM		 11275
11276 /* Convert return pointer and dereference it for later assignment. */
11277 *new_return = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11278
11279 return false;
11280}
11281
11282
11283/* This will process an __atomic_store function call, determine whether it
11284 needs to be mapped to the _N variation, or turned into a library call.
11285 LOC is the location of the builtin call.
11286 FUNCTION is the DECL that has been invoked;
11287 PARAMS is the argument list for the call. The return value is non-null
11288 TRUE is returned if it is translated into the proper format for a call to the
11289 external library, and NEW_RETURN is set the tree for that function.
11290 FALSE is returned if processing for the _N variation is required, and
026c3cfd 11291 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 11292
11293static bool
11294resolve_overloaded_atomic_store (location_t loc, tree function,
9771b263 11295 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 11296{
11297 tree p0, p1;
11298 tree I_type, I_type_ptr;
11299 int n = get_atomic_generic_size (loc, function, params);
11300
c466c4ff
AM		 11301 /* Size of 0 is an error condition. */
11302 if (n == 0)
11303 {
11304 *new_return = error_mark_node;
11305 return true;
11306 }
11307
86951993 11308 /* If not a lock-free size, change to the library generic format. */
6b28e197 11309 if (!atomic_size_supported_p (n))
86951993
AM		 11310 {
11311 *new_return = add_atomic_size_parameter (n, loc, function, params);
11312 return true;
11313 }
11314
11315 /* Otherwise, there is a match, so the call needs to be transformed from:
11316 void fn(T* mem, T* value, model)
11317 into
11318 fn ((In *) mem, (In) *value, model) */
11319
9771b263
DN		 11320 p0 = (*params)[0];
11321 p1 = (*params)[1];
86951993
AM		 11322
11323 /* Create pointer to appropriate size. */
11324 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11325 I_type_ptr = build_pointer_type (I_type);
11326
11327 /* Convert object pointer to required type. */
11328 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11329 (*params)[0] = p0;
86951993
AM		 11330
11331 /* Convert new value to required type, and dereference it. */
11332 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11333 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
9771b263 11334 (*params)[1] = p1;
86951993
AM		 11335
11336 /* The memory model is in the right spot already. Return is void. */
11337 *new_return = NULL_TREE;
11338
11339 return false;
11340}
11341
11342
48ae6c13
RH		 11343/* Some builtin functions are placeholders for other expressions. This
11344 function should be called immediately after parsing the call expression
11345 before surrounding code has committed to the type of the expression.
11346
c2255bc4
AH		 11347 LOC is the location of the builtin call.
11348
48ae6c13
RH		 11349 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11350 PARAMS is the argument list for the call. The return value is non-null
11351 when expansion is complete, and null if normal processing should
11352 continue. */
11353
11354tree
9771b263
DN		 11355resolve_overloaded_builtin (location_t loc, tree function,
11356 vec<tree, va_gc> *params)
48ae6c13
RH		 11357{
11358 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
7a127fa7
MS		 11359
11360 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11361 Those are not valid to call with a pointer to _Bool (or C++ bool)
11362 and so must be rejected. */
11363 bool fetch_op = true;
86951993
AM		 11364 bool orig_format = true;
11365 tree new_return = NULL_TREE;
11366
58646b77
PB		 11367 switch (DECL_BUILT_IN_CLASS (function))
11368 {
11369 case BUILT_IN_NORMAL:
11370 break;
11371 case BUILT_IN_MD:
11372 if (targetm.resolve_overloaded_builtin)
c2255bc4 11373 return targetm.resolve_overloaded_builtin (loc, function, params);
58646b77 11374 else
c22cacf3 11375 return NULL_TREE;
58646b77
PB		 11376 default:
11377 return NULL_TREE;
11378 }
c22cacf3 11379
58646b77 11380 /* Handle BUILT_IN_NORMAL here. */
48ae6c13
RH		 11381 switch (orig_code)
11382 {
86951993
AM		 11383 case BUILT_IN_ATOMIC_EXCHANGE:
11384 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11385 case BUILT_IN_ATOMIC_LOAD:
11386 case BUILT_IN_ATOMIC_STORE:
11387 {
11388 /* Handle these 4 together so that they can fall through to the next
11389 case if the call is transformed to an _N variant. */
11390 switch (orig_code)
11391 {
11392 case BUILT_IN_ATOMIC_EXCHANGE:
11393 {
11394 if (resolve_overloaded_atomic_exchange (loc, function, params,
11395 &new_return))
11396 return new_return;
11397 /* Change to the _N variant. */
11398 orig_code = BUILT_IN_ATOMIC_EXCHANGE_N;
11399 break;
11400 }
11401
11402 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11403 {
11404 if (resolve_overloaded_atomic_compare_exchange (loc, function,
11405 params,
11406 &new_return))
11407 return new_return;
11408 /* Change to the _N variant. */
11409 orig_code = BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N;
11410 break;
11411 }
11412 case BUILT_IN_ATOMIC_LOAD:
11413 {
11414 if (resolve_overloaded_atomic_load (loc, function, params,
11415 &new_return))
11416 return new_return;
11417 /* Change to the _N variant. */
11418 orig_code = BUILT_IN_ATOMIC_LOAD_N;
11419 break;
11420 }
11421 case BUILT_IN_ATOMIC_STORE:
11422 {
11423 if (resolve_overloaded_atomic_store (loc, function, params,
11424 &new_return))
11425 return new_return;
11426 /* Change to the _N variant. */
11427 orig_code = BUILT_IN_ATOMIC_STORE_N;
11428 break;
11429 }
11430 default:
11431 gcc_unreachable ();
11432 }
11433 /* Fallthrough to the normal processing. */
11434 }
11435 case BUILT_IN_ATOMIC_EXCHANGE_N:
11436 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N:
11437 case BUILT_IN_ATOMIC_LOAD_N:
11438 case BUILT_IN_ATOMIC_STORE_N:
7a127fa7
MS		 11439 {
11440 fetch_op = false;
11441 /* Fallthrough to further processing. */
11442 }
86951993
AM		 11443 case BUILT_IN_ATOMIC_ADD_FETCH_N:
11444 case BUILT_IN_ATOMIC_SUB_FETCH_N:
11445 case BUILT_IN_ATOMIC_AND_FETCH_N:
11446 case BUILT_IN_ATOMIC_NAND_FETCH_N:
11447 case BUILT_IN_ATOMIC_XOR_FETCH_N:
11448 case BUILT_IN_ATOMIC_OR_FETCH_N:
11449 case BUILT_IN_ATOMIC_FETCH_ADD_N:
11450 case BUILT_IN_ATOMIC_FETCH_SUB_N:
11451 case BUILT_IN_ATOMIC_FETCH_AND_N:
11452 case BUILT_IN_ATOMIC_FETCH_NAND_N:
11453 case BUILT_IN_ATOMIC_FETCH_XOR_N:
11454 case BUILT_IN_ATOMIC_FETCH_OR_N:
11455 {
11456 orig_format = false;
11457 /* Fallthru for parameter processing. */
11458 }
e0a8ecf2
AM		 11459 case BUILT_IN_SYNC_FETCH_AND_ADD_N:
11460 case BUILT_IN_SYNC_FETCH_AND_SUB_N:
11461 case BUILT_IN_SYNC_FETCH_AND_OR_N:
11462 case BUILT_IN_SYNC_FETCH_AND_AND_N:
11463 case BUILT_IN_SYNC_FETCH_AND_XOR_N:
11464 case BUILT_IN_SYNC_FETCH_AND_NAND_N:
11465 case BUILT_IN_SYNC_ADD_AND_FETCH_N:
11466 case BUILT_IN_SYNC_SUB_AND_FETCH_N:
11467 case BUILT_IN_SYNC_OR_AND_FETCH_N:
11468 case BUILT_IN_SYNC_AND_AND_FETCH_N:
11469 case BUILT_IN_SYNC_XOR_AND_FETCH_N:
11470 case BUILT_IN_SYNC_NAND_AND_FETCH_N:
11471 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N:
11472 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N:
11473 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N:
11474 case BUILT_IN_SYNC_LOCK_RELEASE_N:
48ae6c13 11475 {
7a127fa7
MS		 11476 /* The following are not _FETCH_OPs and must be accepted with
11477 pointers to _Bool (or C++ bool). */
11478 if (fetch_op)
11479 fetch_op =
11480 (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11481 && orig_code != BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11482 && orig_code != BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11483 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N);
11484
11485 int n = sync_resolve_size (function, params, fetch_op);
bbbbb16a 11486 tree new_function, first_param, result;
e79983f4 11487 enum built_in_function fncode;
48ae6c13
RH		 11488
11489 if (n == 0)
11490 return error_mark_node;
11491
e79983f4
MM		 11492 fncode = (enum built_in_function)((int)orig_code + exact_log2 (n) + 1);
11493 new_function = builtin_decl_explicit (fncode);
86951993
AM		 11494 if (!sync_resolve_params (loc, function, new_function, params,
11495 orig_format))
48ae6c13
RH		 11496 return error_mark_node;
11497
9771b263 11498 first_param = (*params)[0];
81e5eca8
MP		 11499 result = build_function_call_vec (loc, vNULL, new_function, params,
11500 NULL);
86951993
AM		 11501 if (result == error_mark_node)
11502 return result;
e0a8ecf2 11503 if (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
86951993
AM		 11504 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N
11505 && orig_code != BUILT_IN_ATOMIC_STORE_N)
11506 result = sync_resolve_return (first_param, result, orig_format);
48ae6c13 11507
14ba7b28
MP		 11508 if (fetch_op)
11509 /* Prevent -Wunused-value warning. */
11510 TREE_USED (result) = true;
11511
86951993
AM		 11512 /* If new_return is set, assign function to that expr and cast the
11513 result to void since the generic interface returned void. */
11514 if (new_return)
11515 {
11516 /* Cast function result from I{1,2,4,8,16} to the required type. */
11517 result = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (new_return), result);
11518 result = build2 (MODIFY_EXPR, TREE_TYPE (new_return), new_return,
11519 result);
11520 TREE_SIDE_EFFECTS (result) = 1;
11521 protected_set_expr_location (result, loc);
11522 result = convert (void_type_node, result);
11523 }
48ae6c13
RH		 11524 return result;
11525 }
11526
11527 default:
58646b77 11528 return NULL_TREE;
48ae6c13
RH		 11529 }
11530}
11531
0af94e6f
JR		 11532/* vector_types_compatible_elements_p is used in type checks of vectors
11533 values used as operands of binary operators. Where it returns true, and
11534 the other checks of the caller succeed (being vector types in he first
11535 place, and matching number of elements), we can just treat the types
11536 as essentially the same.
11537 Contrast with vector_targets_convertible_p, which is used for vector
11538 pointer types, and vector_types_convertible_p, which will allow
11539 language-specific matches under the control of flag_lax_vector_conversions,
11540 and might still require a conversion. */
11541/* True if vector types T1 and T2 can be inputs to the same binary
11542 operator without conversion.
11543 We don't check the overall vector size here because some of our callers
11544 want to give different error messages when the vectors are compatible
11545 except for the element count. */
11546
5bed876a 11547bool
0af94e6f 11548vector_types_compatible_elements_p (tree t1, tree t2)
5bed876a 11549{
0af94e6f
JR		 11550 bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2);
11551 t1 = TREE_TYPE (t1);
11552 t2 = TREE_TYPE (t2);
11553
5bed876a
AH		 11554 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
11555
ab22c1fa
CF		 11556 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
11557 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
11558 || c2 == FIXED_POINT_TYPE));
5bed876a 11559
0af94e6f
JR		 11560 t1 = c_common_signed_type (t1);
11561 t2 = c_common_signed_type (t2);
5bed876a
AH		 11562 /* Equality works here because c_common_signed_type uses
11563 TYPE_MAIN_VARIANT. */
0af94e6f
JR		 11564 if (t1 == t2)
11565 return true;
11566 if (opaque && c1 == c2
11567 && (c1 == INTEGER_TYPE || c1 == REAL_TYPE)
11568 && TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
11569 return true;
11570 return false;
5bed876a
AH		 11571}
11572
104f8784
KG		 11573/* Check for missing format attributes on function pointers. LTYPE is
11574 the new type or left-hand side type. RTYPE is the old type or
11575 right-hand side type. Returns TRUE if LTYPE is missing the desired
11576 attribute. */
11577
11578bool
11579check_missing_format_attribute (tree ltype, tree rtype)
11580{
11581 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
11582 tree ra;
11583
11584 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
11585 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
11586 break;
11587 if (ra)
11588 {
11589 tree la;
11590 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
11591 if (is_attribute_p ("format", TREE_PURPOSE (la)))
11592 break;
11593 return !la;
11594 }
11595 else
11596 return false;
11597}
11598
ff6b6641
GDR		 11599/* Subscripting with type char is likely to lose on a machine where
11600 chars are signed. So warn on any machine, but optionally. Don't
11601 warn for unsigned char since that type is safe. Don't warn for
11602 signed char because anyone who uses that must have done so
11603 deliberately. Furthermore, we reduce the false positive load by
11604 warning only for non-constant value of type char. */
11605
11606void
5bd012f8 11607warn_array_subscript_with_type_char (location_t loc, tree index)
ff6b6641
GDR		 11608{
11609 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
11610 && TREE_CODE (index) != INTEGER_CST)
5bd012f8
MP		 11611 warning_at (loc, OPT_Wchar_subscripts,
11612 "array subscript has type %<char%>");
ff6b6641
GDR		 11613}
11614
2a67bec2
ILT		 11615/* Implement -Wparentheses for the unexpected C precedence rules, to
11616 cover cases like x + y << z which readers are likely to
11617 misinterpret. We have seen an expression in which CODE is a binary
100d537d
MLI		 11618 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11619 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11620 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11621 expression was not formed using a binary or unary operator, or it
11622 was enclosed in parentheses. */
2a67bec2
ILT		 11623
11624void
5d9de0d0 11625warn_about_parentheses (location_t loc, enum tree_code code,
fb3e178a 11626 enum tree_code code_left, tree arg_left,
100d537d 11627 enum tree_code code_right, tree arg_right)
2a67bec2
ILT		 11628{
11629 if (!warn_parentheses)
11630 return;
11631
100d537d
MLI		 11632 /* This macro tests that the expression ARG with original tree code
11633 CODE appears to be a boolean expression. or the result of folding a
11634 boolean expression. */
11635#define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11636 (truth_value_p (TREE_CODE (ARG)) \
11637 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11638 /* Folding may create 0 or 1 integers from other expressions. */ \
11639 || ((CODE) != INTEGER_CST \
11640 && (integer_onep (ARG) || integer_zerop (ARG))))
11641
b8698a0f 11642 switch (code)
2a67bec2 11643 {
100d537d 11644 case LSHIFT_EXPR:
5d9de0d0
PC		 11645 if (code_left == PLUS_EXPR)
11646 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11647 "suggest parentheses around %<+%> inside %<<<%>");
11648 else if (code_right == PLUS_EXPR)
11649 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11650 "suggest parentheses around %<+%> inside %<<<%>");
11651 else if (code_left == MINUS_EXPR)
11652 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11653 "suggest parentheses around %<-%> inside %<<<%>");
11654 else if (code_right == MINUS_EXPR)
11655 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11656 "suggest parentheses around %<-%> inside %<<<%>");
100d537d 11657 return;
2a67bec2 11658
100d537d 11659 case RSHIFT_EXPR:
5d9de0d0
PC		 11660 if (code_left == PLUS_EXPR)
11661 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11662 "suggest parentheses around %<+%> inside %<>>%>");
11663 else if (code_right == PLUS_EXPR)
11664 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11665 "suggest parentheses around %<+%> inside %<>>%>");
11666 else if (code_left == MINUS_EXPR)
11667 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11668 "suggest parentheses around %<-%> inside %<>>%>");
11669 else if (code_right == MINUS_EXPR)
11670 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11671 "suggest parentheses around %<-%> inside %<>>%>");
100d537d 11672 return;
2a67bec2 11673
100d537d 11674 case TRUTH_ORIF_EXPR:
5d9de0d0
PC		 11675 if (code_left == TRUTH_ANDIF_EXPR)
11676 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11677 "suggest parentheses around %<&&%> within %<||%>");
11678 else if (code_right == TRUTH_ANDIF_EXPR)
11679 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11680 "suggest parentheses around %<&&%> within %<||%>");
100d537d
MLI		 11681 return;
11682
11683 case BIT_IOR_EXPR:
2a67bec2 11684 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
5d9de0d0
PC		 11685 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11686 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11687 "suggest parentheses around arithmetic in operand of %<|%>");
11688 else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
11689 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11690 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11691 "suggest parentheses around arithmetic in operand of %<|%>");
2a67bec2 11692 /* Check cases like x|y==z */
5d9de0d0
PC		 11693 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11694 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11695 "suggest parentheses around comparison in operand of %<|%>");
11696 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11697 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11698 "suggest parentheses around comparison in operand of %<|%>");
11699 /* Check cases like !x | y */
11700 else if (code_left == TRUTH_NOT_EXPR
11701 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
5d9de0d0
PC		 11702 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11703 "suggest parentheses around operand of "
11704 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
100d537d 11705 return;
2a67bec2 11706
100d537d 11707 case BIT_XOR_EXPR:
2a67bec2 11708 if (code_left == BIT_AND_EXPR
5d9de0d0
PC		 11709 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11710 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11711 "suggest parentheses around arithmetic in operand of %<^%>");
11712 else if (code_right == BIT_AND_EXPR
11713 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11714 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11715 "suggest parentheses around arithmetic in operand of %<^%>");
2a67bec2 11716 /* Check cases like x^y==z */
5d9de0d0
PC		 11717 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11718 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11719 "suggest parentheses around comparison in operand of %<^%>");
11720 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11721 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11722 "suggest parentheses around comparison in operand of %<^%>");
11723 return;
2a67bec2 11724
100d537d 11725 case BIT_AND_EXPR:
5d9de0d0
PC		 11726 if (code_left == PLUS_EXPR)
11727 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11728 "suggest parentheses around %<+%> in operand of %<&%>");
11729 else if (code_right == PLUS_EXPR)
11730 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11731 "suggest parentheses around %<+%> in operand of %<&%>");
5d9de0d0
PC		 11732 else if (code_left == MINUS_EXPR)
11733 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11734 "suggest parentheses around %<-%> in operand of %<&%>");
11735 else if (code_right == MINUS_EXPR)
11736 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11737 "suggest parentheses around %<-%> in operand of %<&%>");
2a67bec2 11738 /* Check cases like x&y==z */
5d9de0d0
PC		 11739 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11740 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11741 "suggest parentheses around comparison in operand of %<&%>");
11742 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11743 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11744 "suggest parentheses around comparison in operand of %<&%>");
11745 /* Check cases like !x & y */
11746 else if (code_left == TRUTH_NOT_EXPR
11747 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
5d9de0d0
PC		 11748 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11749 "suggest parentheses around operand of "
11750 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
100d537d 11751 return;
2a67bec2 11752
100d537d 11753 case EQ_EXPR:
5d9de0d0
PC		 11754 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11755 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11756 "suggest parentheses around comparison in operand of %<==%>");
11757 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11758 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11759 "suggest parentheses around comparison in operand of %<==%>");
11760 return;
11761 case NE_EXPR:
5d9de0d0
PC		 11762 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11763 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11764 "suggest parentheses around comparison in operand of %<!=%>");
11765 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11766 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11767 "suggest parentheses around comparison in operand of %<!=%>");
11768 return;
11769
11770 default:
5d9de0d0
PC		 11771 if (TREE_CODE_CLASS (code) == tcc_comparison)
11772 {
11773 if (TREE_CODE_CLASS (code_left) == tcc_comparison
fb3e178a
JJ		 11774 && code_left != NE_EXPR && code_left != EQ_EXPR
11775 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
5d9de0d0
PC		 11776 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11777 "comparisons like %<X<=Y<=Z%> do not "
11778 "have their mathematical meaning");
11779 else if (TREE_CODE_CLASS (code_right) == tcc_comparison
fb3e178a 11780 && code_right != NE_EXPR && code_right != EQ_EXPR
5d9de0d0
PC		 11781 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))
11782 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11783 "comparisons like %<X<=Y<=Z%> do not "
11784 "have their mathematical meaning");
11785 }
100d537d 11786 return;
e7917d06 11787 }
100d537d 11788#undef NOT_A_BOOLEAN_EXPR_P
2a67bec2
ILT		 11789}
11790
c616e51b
MLI		 11791/* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11792
11793void
11794warn_for_unused_label (tree label)
11795{
11796 if (!TREE_USED (label))
11797 {
11798 if (DECL_INITIAL (label))
11799 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
11800 else
11801 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
11802 }
11803}
ff6b6641 11804
c9f9eb5d
AH		 11805/* Warn for division by zero according to the value of DIVISOR. LOC
11806 is the location of the division operator. */
2e9cb75e
MLI		 11807
11808void
c9f9eb5d 11809warn_for_div_by_zero (location_t loc, tree divisor)
2e9cb75e 11810{
ab22c1fa
CF		 11811 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11812 about division by zero. Do not issue a warning if DIVISOR has a
2e9cb75e
MLI		 11813 floating-point type, since we consider 0.0/0.0 a valid way of
11814 generating a NaN. */
7d882b83 11815 if (c_inhibit_evaluation_warnings == 0
ab22c1fa 11816 && (integer_zerop (divisor) || fixed_zerop (divisor)))
c9f9eb5d 11817 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
2e9cb75e
MLI		 11818}
11819
c1e1f433
BS		 11820/* Warn for patterns where memset appears to be used incorrectly. The
11821 warning location should be LOC. ARG0, and ARG2 are the first and
11822 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
11823 each argument that was a literal zero. */
11824
11825void
11826warn_for_memset (location_t loc, tree arg0, tree arg2,
11827 int literal_zero_mask)
11828{
11829 if (warn_memset_transposed_args
11830 && integer_zerop (arg2)
11831 && (literal_zero_mask & (1 << 2)) != 0
11832 && (literal_zero_mask & (1 << 1)) == 0)
11833 warning_at (loc, OPT_Wmemset_transposed_args,
11834 "%<memset%> used with constant zero length "
11835 "parameter; this could be due to transposed "
11836 "parameters");
11837
11838 if (warn_memset_elt_size && TREE_CODE (arg2) == INTEGER_CST)
11839 {
11840 STRIP_NOPS (arg0);
11841 if (TREE_CODE (arg0) == ADDR_EXPR)
11842 arg0 = TREE_OPERAND (arg0, 0);
11843 tree type = TREE_TYPE (arg0);
11844 if (TREE_CODE (type) == ARRAY_TYPE)
11845 {
11846 tree elt_type = TREE_TYPE (type);
11847 tree domain = TYPE_DOMAIN (type);
11848 if (!integer_onep (TYPE_SIZE_UNIT (elt_type))
2fff3db8 11849 && domain != NULL_TREE
c1e1f433
BS		 11850 && TYPE_MAXVAL (domain)
11851 && TYPE_MINVAL (domain)
11852 && integer_zerop (TYPE_MINVAL (domain))
11853 && integer_onep (fold_build2 (MINUS_EXPR, domain,
11854 arg2,
11855 TYPE_MAXVAL (domain))))
11856 warning_at (loc, OPT_Wmemset_elt_size,
11857 "%<memset%> used with length equal to "
11858 "number of elements without multiplication "
11859 "by element size");
11860 }
11861 }
11862}
11863
2d12797c
MLI		 11864/* Subroutine of build_binary_op. Give warnings for comparisons
11865 between signed and unsigned quantities that may fail. Do the
11866 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11867 so that casts will be considered, but default promotions won't
ba47d38d
AH		 11868 be.
11869
11870 LOCATION is the location of the comparison operator.
2d12797c
MLI		 11871
11872 The arguments of this function map directly to local variables
11873 of build_binary_op. */
11874
b8698a0f 11875void
ba47d38d 11876warn_for_sign_compare (location_t location,
b8698a0f
L		 11877 tree orig_op0, tree orig_op1,
11878 tree op0, tree op1,
2d12797c
MLI		 11879 tree result_type, enum tree_code resultcode)
11880{
11881 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
11882 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
11883 int unsignedp0, unsignedp1;
b8698a0f 11884
2d12797c
MLI		 11885 /* In C++, check for comparison of different enum types. */
11886 if (c_dialect_cxx()
11887 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
11888 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
11889 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
ead51d36 11890 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
2d12797c 11891 {
ba47d38d
AH		 11892 warning_at (location,
11893 OPT_Wsign_compare, "comparison between types %qT and %qT",
11894 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
2d12797c
MLI		 11895 }
11896
11897 /* Do not warn if the comparison is being done in a signed type,
11898 since the signed type will only be chosen if it can represent
11899 all the values of the unsigned type. */
11900 if (!TYPE_UNSIGNED (result_type))
11901 /* OK */;
11902 /* Do not warn if both operands are unsigned. */
11903 else if (op0_signed == op1_signed)
11904 /* OK */;
11905 else
11906 {
ead51d36 11907 tree sop, uop, base_type;
2d12797c 11908 bool ovf;
ead51d36 11909
2d12797c
MLI		 11910 if (op0_signed)
11911 sop = orig_op0, uop = orig_op1;
b8698a0f 11912 else
2d12797c
MLI		 11913 sop = orig_op1, uop = orig_op0;
11914
b8698a0f 11915 STRIP_TYPE_NOPS (sop);
2d12797c 11916 STRIP_TYPE_NOPS (uop);
ead51d36
JJ		 11917 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
11918 ? TREE_TYPE (result_type) : result_type);
2d12797c
MLI		 11919
11920 /* Do not warn if the signed quantity is an unsuffixed integer
11921 literal (or some static constant expression involving such
11922 literals or a conditional expression involving such literals)
11923 and it is non-negative. */
11924 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
11925 /* OK */;
11926 /* Do not warn if the comparison is an equality operation, the
11927 unsigned quantity is an integral constant, and it would fit
11928 in the result if the result were signed. */
11929 else if (TREE_CODE (uop) == INTEGER_CST
11930 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
ead51d36 11931 && int_fits_type_p (uop, c_common_signed_type (base_type)))
2d12797c
MLI		 11932 /* OK */;
11933 /* In C, do not warn if the unsigned quantity is an enumeration
11934 constant and its maximum value would fit in the result if the
11935 result were signed. */
11936 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
11937 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
11938 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
ead51d36 11939 c_common_signed_type (base_type)))
2d12797c 11940 /* OK */;
b8698a0f 11941 else
ba47d38d 11942 warning_at (location,
b8698a0f 11943 OPT_Wsign_compare,
ba47d38d 11944 "comparison between signed and unsigned integer expressions");
2d12797c 11945 }
b8698a0f 11946
2d12797c
MLI		 11947 /* Warn if two unsigned values are being compared in a size larger
11948 than their original size, and one (and only one) is the result of
11949 a `~' operator. This comparison will always fail.
b8698a0f 11950
2d12797c
MLI		 11951 Also warn if one operand is a constant, and the constant does not
11952 have all bits set that are set in the ~ operand when it is
11953 extended. */
11954
828fb3ba
JM		 11955 op0 = c_common_get_narrower (op0, &unsignedp0);
11956 op1 = c_common_get_narrower (op1, &unsignedp1);
b8698a0f 11957
2d12797c
MLI		 11958 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
11959 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
11960 {
11961 if (TREE_CODE (op0) == BIT_NOT_EXPR)
828fb3ba 11962 op0 = c_common_get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
2d12797c 11963 if (TREE_CODE (op1) == BIT_NOT_EXPR)
828fb3ba 11964 op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
2d12797c 11965
9541ffee 11966 if (tree_fits_shwi_p (op0) || tree_fits_shwi_p (op1))
2d12797c
MLI		 11967 {
11968 tree primop;
11969 HOST_WIDE_INT constant, mask;
11970 int unsignedp;
11971 unsigned int bits;
b8698a0f 11972
9541ffee 11973 if (tree_fits_shwi_p (op0))
2d12797c
MLI		 11974 {
11975 primop = op1;
11976 unsignedp = unsignedp1;
9439e9a1 11977 constant = tree_to_shwi (op0);
2d12797c
MLI		 11978 }
11979 else
11980 {
11981 primop = op0;
11982 unsignedp = unsignedp0;
9439e9a1 11983 constant = tree_to_shwi (op1);
2d12797c 11984 }
b8698a0f 11985
2d12797c
MLI		 11986 bits = TYPE_PRECISION (TREE_TYPE (primop));
11987 if (bits < TYPE_PRECISION (result_type)
11988 && bits < HOST_BITS_PER_LONG && unsignedp)
11989 {
aa256c4a 11990 mask = (~ (unsigned HOST_WIDE_INT) 0) << bits;
2d12797c
MLI		 11991 if ((mask & constant) != mask)
11992 {
11993 if (constant == 0)
0a756a3f
MP		 11994 warning_at (location, OPT_Wsign_compare,
11995 "promoted ~unsigned is always non-zero");
2d12797c 11996 else
b8698a0f 11997 warning_at (location, OPT_Wsign_compare,
ba47d38d 11998 "comparison of promoted ~unsigned with constant");
2d12797c
MLI		 11999 }
12000 }
12001 }
12002 else if (unsignedp0 && unsignedp1
12003 && (TYPE_PRECISION (TREE_TYPE (op0))
12004 < TYPE_PRECISION (result_type))
12005 && (TYPE_PRECISION (TREE_TYPE (op1))
12006 < TYPE_PRECISION (result_type)))
ba47d38d 12007 warning_at (location, OPT_Wsign_compare,
2d12797c
MLI		 12008 "comparison of promoted ~unsigned with unsigned");
12009 }
12010}
12011
c5ee1358
MM		 12012/* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12013 type via c_common_type. If -Wdouble-promotion is in use, and the
12014 conditions for warning have been met, issue a warning. GMSGID is
12015 the warning message. It must have two %T specifiers for the type
12016 that was converted (generally "float") and the type to which it was
12017 converted (generally "double), respectively. LOC is the location
12018 to which the awrning should refer. */
12019
12020void
12021do_warn_double_promotion (tree result_type, tree type1, tree type2,
12022 const char *gmsgid, location_t loc)
12023{
12024 tree source_type;
12025
12026 if (!warn_double_promotion)
12027 return;
12028 /* If the conversion will not occur at run-time, there is no need to
12029 warn about it. */
12030 if (c_inhibit_evaluation_warnings)
12031 return;
12032 if (TYPE_MAIN_VARIANT (result_type) != double_type_node
12033 && TYPE_MAIN_VARIANT (result_type) != complex_double_type_node)
12034 return;
12035 if (TYPE_MAIN_VARIANT (type1) == float_type_node
12036 || TYPE_MAIN_VARIANT (type1) == complex_float_type_node)
12037 source_type = type1;
12038 else if (TYPE_MAIN_VARIANT (type2) == float_type_node
12039 || TYPE_MAIN_VARIANT (type2) == complex_float_type_node)
12040 source_type = type2;
12041 else
12042 return;
12043 warning_at (loc, OPT_Wdouble_promotion, gmsgid, source_type, result_type);
12044}
12045
da2e71c9
MLI		 12046/* Possibly warn about unused parameters. */
12047
12048void
12049do_warn_unused_parameter (tree fn)
12050{
12051 tree decl;
12052
12053 for (decl = DECL_ARGUMENTS (fn);
12054 decl; decl = DECL_CHAIN (decl))
12055 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
12056 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl)
12057 && !TREE_NO_WARNING (decl))
12058 warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wunused_parameter,
12059 "unused parameter %qD", decl);
12060}
12061
12062
d0940d56
DS		 12063/* Setup a TYPE_DECL node as a typedef representation.
12064
12065 X is a TYPE_DECL for a typedef statement. Create a brand new
12066 ..._TYPE node (which will be just a variant of the existing
12067 ..._TYPE node with identical properties) and then install X
12068 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12069
12070 The whole point here is to end up with a situation where each
12071 and every ..._TYPE node the compiler creates will be uniquely
12072 associated with AT MOST one node representing a typedef name.
12073 This way, even though the compiler substitutes corresponding
12074 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12075 early on, later parts of the compiler can always do the reverse
12076 translation and get back the corresponding typedef name. For
12077 example, given:
12078
12079 typedef struct S MY_TYPE;
12080 MY_TYPE object;
12081
12082 Later parts of the compiler might only know that `object' was of
12083 type `struct S' if it were not for code just below. With this
12084 code however, later parts of the compiler see something like:
12085
12086 struct S' == struct S
12087 typedef struct S' MY_TYPE;
12088 struct S' object;
12089
12090 And they can then deduce (from the node for type struct S') that
12091 the original object declaration was:
12092
12093 MY_TYPE object;
12094
12095 Being able to do this is important for proper support of protoize,
12096 and also for generating precise symbolic debugging information
12097 which takes full account of the programmer's (typedef) vocabulary.
12098
12099 Obviously, we don't want to generate a duplicate ..._TYPE node if
12100 the TYPE_DECL node that we are now processing really represents a
12101 standard built-in type. */
12102
12103void
12104set_underlying_type (tree x)
12105{
12106 if (x == error_mark_node)
12107 return;
12108 if (DECL_IS_BUILTIN (x))
12109 {
12110 if (TYPE_NAME (TREE_TYPE (x)) == 0)
12111 TYPE_NAME (TREE_TYPE (x)) = x;
12112 }
12113 else if (TREE_TYPE (x) != error_mark_node
12114 && DECL_ORIGINAL_TYPE (x) == NULL_TREE)
12115 {
12116 tree tt = TREE_TYPE (x);
12117 DECL_ORIGINAL_TYPE (x) = tt;
12118 tt = build_variant_type_copy (tt);
12119 TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
12120 TYPE_NAME (tt) = x;
12121 TREE_USED (tt) = TREE_USED (x);
12122 TREE_TYPE (x) = tt;
12123 }
12124}
12125
b646ba3f
DS		 12126/* Record the types used by the current global variable declaration
12127 being parsed, so that we can decide later to emit their debug info.
12128 Those types are in types_used_by_cur_var_decl, and we are going to
12129 store them in the types_used_by_vars_hash hash table.
12130 DECL is the declaration of the global variable that has been parsed. */
12131
12132void
12133record_types_used_by_current_var_decl (tree decl)
12134{
12135 gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl));
12136
9771b263 12137 while (types_used_by_cur_var_decl && !types_used_by_cur_var_decl->is_empty ())
b646ba3f 12138 {
9771b263 12139 tree type = types_used_by_cur_var_decl->pop ();
bc87224e 12140 types_used_by_var_decl_insert (type, decl);
b646ba3f
DS		 12141 }
12142}
12143
3797cb21
DS		 12144/* If DECL is a typedef that is declared in the current function,
12145 record it for the purpose of -Wunused-local-typedefs. */
12146
12147void
12148record_locally_defined_typedef (tree decl)
12149{
12150 struct c_language_function *l;
12151
12152 if (!warn_unused_local_typedefs
12153 || cfun == NULL
12154 /* if this is not a locally defined typedef then we are not
12155 interested. */
12156 || !is_typedef_decl (decl)
12157 || !decl_function_context (decl))
12158 return;
12159
12160 l = (struct c_language_function *) cfun->language;
9771b263 12161 vec_safe_push (l->local_typedefs, decl);
3797cb21
DS		 12162}
12163
12164/* If T is a TYPE_DECL declared locally, mark it as used. */
12165
12166void
12167maybe_record_typedef_use (tree t)
12168{
12169 if (!is_typedef_decl (t))
12170 return;
12171
12172 TREE_USED (t) = true;
12173}
12174
12175/* Warn if there are some unused locally defined typedefs in the
12176 current function. */
12177
12178void
12179maybe_warn_unused_local_typedefs (void)
12180{
12181 int i;
12182 tree decl;
12183 /* The number of times we have emitted -Wunused-local-typedefs
12184 warnings. If this is different from errorcount, that means some
12185 unrelated errors have been issued. In which case, we'll avoid
12186 emitting "unused-local-typedefs" warnings. */
12187 static int unused_local_typedefs_warn_count;
12188 struct c_language_function *l;
12189
12190 if (cfun == NULL)
12191 return;
12192
12193 if ((l = (struct c_language_function *) cfun->language) == NULL)
12194 return;
12195
12196 if (warn_unused_local_typedefs
12197 && errorcount == unused_local_typedefs_warn_count)
12198 {
9771b263 12199 FOR_EACH_VEC_SAFE_ELT (l->local_typedefs, i, decl)
3797cb21
DS		 12200 if (!TREE_USED (decl))
12201 warning_at (DECL_SOURCE_LOCATION (decl),
12202 OPT_Wunused_local_typedefs,
12203 "typedef %qD locally defined but not used", decl);
12204 unused_local_typedefs_warn_count = errorcount;
12205 }
12206
9771b263 12207 vec_free (l->local_typedefs);
3797cb21
DS		 12208}
12209
04159acf
MP		 12210/* Warn about boolean expression compared with an integer value different
12211 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12212 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12213 are the operands of the comparison. The caller must ensure that
12214 either operand is a boolean expression. */
12215
12216void
12217maybe_warn_bool_compare (location_t loc, enum tree_code code, tree op0,
12218 tree op1)
12219{
12220 if (TREE_CODE_CLASS (code) != tcc_comparison)
12221 return;
12222
f479b43d
JM		 12223 tree f, cst;
12224 if (f = fold_for_warn (op0),
12225 TREE_CODE (f) == INTEGER_CST)
12226 cst = op0 = f;
12227 else if (f = fold_for_warn (op1),
12228 TREE_CODE (f) == INTEGER_CST)
12229 cst = op1 = f;
12230 else
04159acf
MP		 12231 return;
12232
12233 if (!integer_zerop (cst) && !integer_onep (cst))
12234 {
716c0ba6
MP		 12235 int sign = (TREE_CODE (op0) == INTEGER_CST
12236 ? tree_int_cst_sgn (cst) : -tree_int_cst_sgn (cst));
04159acf
MP		 12237 if (code == EQ_EXPR
12238 || ((code == GT_EXPR || code == GE_EXPR) && sign < 0)
12239 || ((code == LT_EXPR || code == LE_EXPR) && sign > 0))
12240 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12241 "with boolean expression is always false", cst);
12242 else
12243 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12244 "with boolean expression is always true", cst);
12245 }
716c0ba6
MP		 12246 else if (integer_zerop (cst) || integer_onep (cst))
12247 {
577cd070
MP		 12248 /* If the non-constant operand isn't of a boolean type, we
12249 don't want to warn here. */
12250 tree noncst = TREE_CODE (op0) == INTEGER_CST ? op1 : op0;
12251 /* Handle booleans promoted to integers. */
12252 if (CONVERT_EXPR_P (noncst)
12253 && TREE_TYPE (noncst) == integer_type_node
12254 && TREE_CODE (TREE_TYPE (TREE_OPERAND (noncst, 0))) == BOOLEAN_TYPE)
12255 /* Warn. */;
12256 else if (TREE_CODE (TREE_TYPE (noncst)) != BOOLEAN_TYPE
12257 && !truth_value_p (TREE_CODE (noncst)))
12258 return;
716c0ba6
MP		 12259 /* Do some magic to get the right diagnostics. */
12260 bool flag = TREE_CODE (op0) == INTEGER_CST;
12261 flag = integer_zerop (cst) ? flag : !flag;
12262 if ((code == GE_EXPR && !flag) || (code == LE_EXPR && flag))
12263 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12264 "with boolean expression is always true", cst);
12265 else if ((code == LT_EXPR && !flag) || (code == GT_EXPR && flag))
12266 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12267 "with boolean expression is always false", cst);
12268 }
04159acf
MP		 12269}
12270
451b5e48
MP		 12271/* Warn if signed left shift overflows. We don't warn
12272 about left-shifting 1 into the sign bit in C++14; cf.
12273 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12274 LOC is a location of the shift; OP0 and OP1 are the operands.
12275 Return true if an overflow is detected, false otherwise. */
12276
12277bool
12278maybe_warn_shift_overflow (location_t loc, tree op0, tree op1)
12279{
12280 if (TREE_CODE (op0) != INTEGER_CST
12281 || TREE_CODE (op1) != INTEGER_CST)
12282 return false;
12283
12284 tree type0 = TREE_TYPE (op0);
12285 unsigned int prec0 = TYPE_PRECISION (type0);
12286
12287 /* Left-hand operand must be signed. */
12288 if (TYPE_UNSIGNED (type0))
12289 return false;
12290
b893e375
MP		 12291 unsigned int min_prec = (wi::min_precision (op0, SIGNED)
12292 + TREE_INT_CST_LOW (op1));
c5404f1c
PB		 12293 /* Handle the case of left-shifting 1 into the sign bit.
12294 * However, shifting 1 _out_ of the sign bit, as in
12295 * INT_MIN << 1, is considered an overflow.
12296 */
12297 if (!tree_int_cst_sign_bit(op0) && min_prec == prec0 + 1)
451b5e48
MP		 12298 {
12299 /* Never warn for C++14 onwards. */
12300 if (cxx_dialect >= cxx14)
12301 return false;
12302 /* Otherwise only if -Wshift-overflow=2. But return
12303 true to signal an overflow for the sake of integer
12304 constant expressions. */
12305 if (warn_shift_overflow < 2)
12306 return true;
12307 }
12308
451b5e48
MP		 12309 bool overflowed = min_prec > prec0;
12310 if (overflowed && c_inhibit_evaluation_warnings == 0)
12311 warning_at (loc, OPT_Wshift_overflow_,
12312 "result of %qE requires %u bits to represent, "
12313 "but %qT only has %u bits",
12314 build2_loc (loc, LSHIFT_EXPR, type0, op0, op1),
12315 min_prec, type0, prec0);
12316
12317 return overflowed;
12318}
12319
c166b898
ILT		 12320/* The C and C++ parsers both use vectors to hold function arguments.
12321 For efficiency, we keep a cache of unused vectors. This is the
12322 cache. */
12323
9771b263
DN		 12324typedef vec<tree, va_gc> *tree_gc_vec;
12325static GTY((deletable)) vec<tree_gc_vec, va_gc> *tree_vector_cache;
c166b898
ILT		 12326
12327/* Return a new vector from the cache. If the cache is empty,
12328 allocate a new vector. These vectors are GC'ed, so it is OK if the
12329 pointer is not released.. */
12330
9771b263 12331vec<tree, va_gc> *
c166b898
ILT		 12332make_tree_vector (void)
12333{
9771b263
DN		 12334 if (tree_vector_cache && !tree_vector_cache->is_empty ())
12335 return tree_vector_cache->pop ();
c166b898
ILT		 12336 else
12337 {
9771b263 12338 /* Passing 0 to vec::alloc returns NULL, and our callers require
c166b898
ILT		 12339 that we always return a non-NULL value. The vector code uses
12340 4 when growing a NULL vector, so we do too. */
9771b263
DN		 12341 vec<tree, va_gc> *v;
12342 vec_alloc (v, 4);
12343 return v;
c166b898
ILT		 12344 }
12345}
12346
12347/* Release a vector of trees back to the cache. */
12348
12349void
9771b263 12350release_tree_vector (vec<tree, va_gc> *vec)
c166b898
ILT		 12351{
12352 if (vec != NULL)
12353 {
9771b263
DN		 12354 vec->truncate (0);
12355 vec_safe_push (tree_vector_cache, vec);
c166b898
ILT		 12356 }
12357}
12358
12359/* Get a new tree vector holding a single tree. */
12360
9771b263 12361vec<tree, va_gc> *
c166b898
ILT		 12362make_tree_vector_single (tree t)
12363{
9771b263
DN		 12364 vec<tree, va_gc> *ret = make_tree_vector ();
12365 ret->quick_push (t);
c166b898
ILT		 12366 return ret;
12367}
12368
c12ff9d8
JM		 12369/* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12370
9771b263 12371vec<tree, va_gc> *
c12ff9d8
JM		 12372make_tree_vector_from_list (tree list)
12373{
9771b263 12374 vec<tree, va_gc> *ret = make_tree_vector ();
c12ff9d8 12375 for (; list; list = TREE_CHAIN (list))
9771b263 12376 vec_safe_push (ret, TREE_VALUE (list));
c12ff9d8
JM		 12377 return ret;
12378}
12379
c166b898
ILT		 12380/* Get a new tree vector which is a copy of an existing one. */
12381
9771b263
DN		 12382vec<tree, va_gc> *
12383make_tree_vector_copy (const vec<tree, va_gc> *orig)
c166b898 12384{
9771b263 12385 vec<tree, va_gc> *ret;
c166b898
ILT		 12386 unsigned int ix;
12387 tree t;
12388
12389 ret = make_tree_vector ();
9771b263
DN		 12390 vec_safe_reserve (ret, vec_safe_length (orig));
12391 FOR_EACH_VEC_SAFE_ELT (orig, ix, t)
12392 ret->quick_push (t);
c166b898
ILT		 12393 return ret;
12394}
12395
a9aa2c3a
NF		 12396/* Return true if KEYWORD starts a type specifier. */
12397
12398bool
12399keyword_begins_type_specifier (enum rid keyword)
12400{
12401 switch (keyword)
12402 {
38b7bc7f 12403 case RID_AUTO_TYPE:
a9aa2c3a
NF		 12404 case RID_INT:
12405 case RID_CHAR:
12406 case RID_FLOAT:
12407 case RID_DOUBLE:
12408 case RID_VOID:
a9aa2c3a
NF		 12409 case RID_UNSIGNED:
12410 case RID_LONG:
12411 case RID_SHORT:
12412 case RID_SIGNED:
12413 case RID_DFLOAT32:
12414 case RID_DFLOAT64:
12415 case RID_DFLOAT128:
12416 case RID_FRACT:
12417 case RID_ACCUM:
12418 case RID_BOOL:
12419 case RID_WCHAR:
12420 case RID_CHAR16:
12421 case RID_CHAR32:
12422 case RID_SAT:
12423 case RID_COMPLEX:
12424 case RID_TYPEOF:
12425 case RID_STRUCT:
12426 case RID_CLASS:
12427 case RID_UNION:
12428 case RID_ENUM:
12429 return true;
12430 default:
78a7c317
DD		 12431 if (keyword >= RID_FIRST_INT_N
12432 && keyword < RID_FIRST_INT_N + NUM_INT_N_ENTS
12433 && int_n_enabled_p[keyword-RID_FIRST_INT_N])
12434 return true;
a9aa2c3a
NF		 12435 return false;
12436 }
12437}
12438
12439/* Return true if KEYWORD names a type qualifier. */
12440
12441bool
12442keyword_is_type_qualifier (enum rid keyword)
12443{
12444 switch (keyword)
12445 {
12446 case RID_CONST:
12447 case RID_VOLATILE:
12448 case RID_RESTRICT:
267bac10 12449 case RID_ATOMIC:
a9aa2c3a
NF		 12450 return true;
12451 default:
12452 return false;
12453 }
12454}
12455
12456/* Return true if KEYWORD names a storage class specifier.
12457
12458 RID_TYPEDEF is not included in this list despite `typedef' being
12459 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12460 such for syntactic convenience only. */
12461
12462bool
12463keyword_is_storage_class_specifier (enum rid keyword)
12464{
12465 switch (keyword)
12466 {
12467 case RID_STATIC:
12468 case RID_EXTERN:
12469 case RID_REGISTER:
12470 case RID_AUTO:
12471 case RID_MUTABLE:
12472 case RID_THREAD:
12473 return true;
12474 default:
12475 return false;
12476 }
12477}
12478
ba9e6dd5
NF		 12479/* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12480
12481static bool
12482keyword_is_function_specifier (enum rid keyword)
12483{
12484 switch (keyword)
12485 {
12486 case RID_INLINE:
bbceee64 12487 case RID_NORETURN:
ba9e6dd5
NF		 12488 case RID_VIRTUAL:
12489 case RID_EXPLICIT:
12490 return true;
12491 default:
12492 return false;
12493 }
12494}
12495
12496/* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12497 declaration-specifier (C99 6.7). */
12498
12499bool
12500keyword_is_decl_specifier (enum rid keyword)
12501{
12502 if (keyword_is_storage_class_specifier (keyword)
12503 || keyword_is_type_qualifier (keyword)
12504 || keyword_is_function_specifier (keyword))
12505 return true;
12506
12507 switch (keyword)
12508 {
12509 case RID_TYPEDEF:
12510 case RID_FRIEND:
12511 case RID_CONSTEXPR:
12512 return true;
12513 default:
12514 return false;
12515 }
12516}
12517
81f653d6
NF		 12518/* Initialize language-specific-bits of tree_contains_struct. */
12519
12520void
12521c_common_init_ts (void)
12522{
12523 MARK_TS_TYPED (C_MAYBE_CONST_EXPR);
12524 MARK_TS_TYPED (EXCESS_PRECISION_EXPR);
36536d79 12525 MARK_TS_TYPED (ARRAY_NOTATION_REF);
81f653d6
NF		 12526}
12527
3ce4f9e4
ESR		 12528/* Build a user-defined numeric literal out of an integer constant type VALUE
12529 with identifier SUFFIX. */
12530
12531tree
2d7aa578
ESR		 12532build_userdef_literal (tree suffix_id, tree value,
12533 enum overflow_type overflow, tree num_string)
3ce4f9e4
ESR		 12534{
12535 tree literal = make_node (USERDEF_LITERAL);
12536 USERDEF_LITERAL_SUFFIX_ID (literal) = suffix_id;
12537 USERDEF_LITERAL_VALUE (literal) = value;
2d7aa578 12538 USERDEF_LITERAL_OVERFLOW (literal) = overflow;
3ce4f9e4
ESR		 12539 USERDEF_LITERAL_NUM_STRING (literal) = num_string;
12540 return literal;
12541}
12542
f17a223d
RB		 12543/* For vector[index], convert the vector to an array of the underlying type.
12544 Return true if the resulting ARRAY_REF should not be an lvalue. */
aa7da51a
JJ		 12545
12546bool
f17a223d
RB		 12547convert_vector_to_array_for_subscript (location_t loc,
12548 tree *vecp, tree index)
7edaa4d2 12549{
aa7da51a 12550 bool ret = false;
31521951 12551 if (VECTOR_TYPE_P (TREE_TYPE (*vecp)))
7edaa4d2
MG		 12552 {
12553 tree type = TREE_TYPE (*vecp);
7edaa4d2 12554
aa7da51a 12555 ret = !lvalue_p (*vecp);
f17a223d 12556
7edaa4d2 12557 if (TREE_CODE (index) == INTEGER_CST)
cc269bb6 12558 if (!tree_fits_uhwi_p (index)
7d362f6c 12559 || tree_to_uhwi (index) >= TYPE_VECTOR_SUBPARTS (type))
7edaa4d2
MG		 12560 warning_at (loc, OPT_Warray_bounds, "index value is out of bound");
12561
f17a223d
RB		 12562 /* We are building an ARRAY_REF so mark the vector as addressable
12563 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12564 for function parameters. */
12565 c_common_mark_addressable_vec (*vecp);
12566
12567 *vecp = build1 (VIEW_CONVERT_EXPR,
12568 build_array_type_nelts (TREE_TYPE (type),
12569 TYPE_VECTOR_SUBPARTS (type)),
12570 *vecp);
7edaa4d2 12571 }
aa7da51a 12572 return ret;
7edaa4d2
MG		 12573}
12574
a212e43f
MG		 12575/* Determine which of the operands, if any, is a scalar that needs to be
12576 converted to a vector, for the range of operations. */
12577enum stv_conv
12578scalar_to_vector (location_t loc, enum tree_code code, tree op0, tree op1,
12579 bool complain)
12580{
12581 tree type0 = TREE_TYPE (op0);
12582 tree type1 = TREE_TYPE (op1);
12583 bool integer_only_op = false;
12584 enum stv_conv ret = stv_firstarg;
12585
31521951 12586 gcc_assert (VECTOR_TYPE_P (type0) || VECTOR_TYPE_P (type1));
a212e43f
MG		 12587 switch (code)
12588 {
12589 /* Most GENERIC binary expressions require homogeneous arguments.
12590 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12591 argument that is a vector and a second one that is a scalar, so
12592 we never return stv_secondarg for them. */
12593 case RSHIFT_EXPR:
12594 case LSHIFT_EXPR:
12595 if (TREE_CODE (type0) == INTEGER_TYPE
12596 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12597 {
68fca595 12598 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12599 {
12600 if (complain)
12601 error_at (loc, "conversion of scalar %qT to vector %qT "
12602 "involves truncation", type0, type1);
12603 return stv_error;
12604 }
12605 else
12606 return stv_firstarg;
12607 }
12608 break;
12609
12610 case BIT_IOR_EXPR:
12611 case BIT_XOR_EXPR:
12612 case BIT_AND_EXPR:
12613 integer_only_op = true;
12614 /* ... fall through ... */
12615
93100c6b
MG		 12616 case VEC_COND_EXPR:
12617
a212e43f
MG		 12618 case PLUS_EXPR:
12619 case MINUS_EXPR:
12620 case MULT_EXPR:
12621 case TRUNC_DIV_EXPR:
12622 case CEIL_DIV_EXPR:
12623 case FLOOR_DIV_EXPR:
12624 case ROUND_DIV_EXPR:
12625 case EXACT_DIV_EXPR:
12626 case TRUNC_MOD_EXPR:
12627 case FLOOR_MOD_EXPR:
12628 case RDIV_EXPR:
12629 case EQ_EXPR:
12630 case NE_EXPR:
12631 case LE_EXPR:
12632 case GE_EXPR:
12633 case LT_EXPR:
12634 case GT_EXPR:
12635 /* What about UNLT_EXPR? */
31521951 12636 if (VECTOR_TYPE_P (type0))
a212e43f 12637 {
a212e43f 12638 ret = stv_secondarg;
6b4db501
MM		 12639 std::swap (type0, type1);
12640 std::swap (op0, op1);
a212e43f
MG		 12641 }
12642
12643 if (TREE_CODE (type0) == INTEGER_TYPE
12644 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12645 {
68fca595 12646 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12647 {
12648 if (complain)
12649 error_at (loc, "conversion of scalar %qT to vector %qT "
12650 "involves truncation", type0, type1);
12651 return stv_error;
12652 }
12653 return ret;
12654 }
12655 else if (!integer_only_op
12656 /* Allow integer --> real conversion if safe. */
12657 && (TREE_CODE (type0) == REAL_TYPE
12658 || TREE_CODE (type0) == INTEGER_TYPE)
12659 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1)))
12660 {
68fca595 12661 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12662 {
12663 if (complain)
12664 error_at (loc, "conversion of scalar %qT to vector %qT "
12665 "involves truncation", type0, type1);
12666 return stv_error;
12667 }
12668 return ret;
12669 }
12670 default:
12671 break;
12672 }
12673
12674 return stv_nothing;
12675}
12676
e28d52cf
DS		 12677/* Return true iff ALIGN is an integral constant that is a fundamental
12678 alignment, as defined by [basic.align] in the c++-11
12679 specifications.
12680
12681 That is:
12682
12683 [A fundamental alignment is represented by an alignment less than or
12684 equal to the greatest alignment supported by the implementation
12685 in all contexts, which is equal to
12686 alignof(max_align_t)]. */
12687
12688bool
12689cxx_fundamental_alignment_p (unsigned align)
12690{
12691 return (align <= MAX (TYPE_ALIGN (long_long_integer_type_node),
12692 TYPE_ALIGN (long_double_type_node)));
12693}
12694
f04dda30
MP		 12695/* Return true if T is a pointer to a zero-sized aggregate. */
12696
12697bool
12698pointer_to_zero_sized_aggr_p (tree t)
12699{
12700 if (!POINTER_TYPE_P (t))
12701 return false;
12702 t = TREE_TYPE (t);
12703 return (TYPE_SIZE (t) && integer_zerop (TYPE_SIZE (t)));
12704}
12705
1807ffc1
MS		 12706/* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12707 with no library fallback or for an ADDR_EXPR whose operand is such type
12708 issues an error pointing to the location LOC.
12709 Returns true when the expression has been diagnosed and false
12710 otherwise. */
12711bool
12712reject_gcc_builtin (const_tree expr, location_t loc /* = UNKNOWN_LOCATION */)
12713{
12714 if (TREE_CODE (expr) == ADDR_EXPR)
12715 expr = TREE_OPERAND (expr, 0);
12716
12717 if (TREE_TYPE (expr)
12718 && TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
1be56bc5 12719 && TREE_CODE (expr) == FUNCTION_DECL
1807ffc1
MS		 12720 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12721 false positives for user-declared built-ins such as abs or
12722 strlen, and for C++ operators new and delete.
12723 The c_decl_implicit() test avoids false positives for implicitly
12724 declared built-ins with library fallbacks (such as abs). */
12725 && DECL_BUILT_IN (expr)
12726 && DECL_IS_BUILTIN (expr)
12727 && !c_decl_implicit (expr)
12728 && !DECL_ASSEMBLER_NAME_SET_P (expr))
12729 {
12730 if (loc == UNKNOWN_LOCATION)
12731 loc = EXPR_LOC_OR_LOC (expr, input_location);
12732
12733 /* Reject arguments that are built-in functions with
12734 no library fallback. */
12735 error_at (loc, "built-in function %qE must be directly called", expr);
12736
12737 return true;
12738 }
12739
12740 return false;
12741}
12742
3e3b8d63
MP		 12743/* If we're creating an if-else-if condition chain, first see if we
12744 already have this COND in the CHAIN. If so, warn and don't add COND
12745 into the vector, otherwise add the COND there. LOC is the location
12746 of COND. */
12747
12748void
12749warn_duplicated_cond_add_or_warn (location_t loc, tree cond, vec<tree> **chain)
12750{
12751 /* No chain has been created yet. Do nothing. */
12752 if (*chain == NULL)
12753 return;
12754
12755 if (TREE_SIDE_EFFECTS (cond))
12756 {
12757 /* Uh-oh! This condition has a side-effect, thus invalidates
12758 the whole chain. */
12759 delete *chain;
12760 *chain = NULL;
12761 return;
12762 }
12763
12764 unsigned int ix;
12765 tree t;
12766 bool found = false;
12767 FOR_EACH_VEC_ELT (**chain, ix, t)
12768 if (operand_equal_p (cond, t, 0))
12769 {
12770 if (warning_at (loc, OPT_Wduplicated_cond,
12771 "duplicated %<if%> condition"))
12772 inform (EXPR_LOCATION (t), "previously used here");
12773 found = true;
12774 break;
12775 }
12776
12777 if (!found
12778 && !CONSTANT_CLASS_P (cond)
12779 /* Don't infinitely grow the chain. */
12780 && (*chain)->length () < 512)
12781 (*chain)->safe_push (cond);
12782}
12783
e78bede6
MP		 12784/* Check if array size calculations overflow or if the array covers more
12785 than half of the address space. Return true if the size of the array
12786 is valid, false otherwise. TYPE is the type of the array and NAME is
12787 the name of the array, or NULL_TREE for unnamed arrays. */
12788
12789bool
12790valid_array_size_p (location_t loc, tree type, tree name)
12791{
12792 if (type != error_mark_node
12793 && COMPLETE_TYPE_P (type)
12794 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
12795 && !valid_constant_size_p (TYPE_SIZE_UNIT (type)))
12796 {
12797 if (name)
12798 error_at (loc, "size of array %qE is too large", name);
12799 else
12800 error_at (loc, "size of unnamed array is too large");
12801 return false;
12802 }
12803 return true;
12804}
12805
174f6622
ES		 12806/* Read SOURCE_DATE_EPOCH from environment to have a deterministic
12807 timestamp to replace embedded current dates to get reproducible
12808 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
15c98b2e 12809
174f6622 12810time_t
15c98b2e 12811cb_get_source_date_epoch (cpp_reader *pfile ATTRIBUTE_UNUSED)
174f6622
ES		 12812{
12813 char *source_date_epoch;
12814 long long epoch;
12815 char *endptr;
12816
12817 source_date_epoch = getenv ("SOURCE_DATE_EPOCH");
12818 if (!source_date_epoch)
12819 return (time_t) -1;
12820
12821 errno = 0;
12822 epoch = strtoll (source_date_epoch, &endptr, 10);
15c98b2e
ES		 12823 if (errno != 0 || endptr == source_date_epoch || *endptr != '\0'
12824 || epoch < 0 || epoch > MAX_SOURCE_DATE_EPOCH)
12825 {
12826 error_at (input_location, "environment variable SOURCE_DATE_EPOCH must "
12827 "expand to a non-negative integer less than or equal to %wd",
12828 MAX_SOURCE_DATE_EPOCH);
12829 return (time_t) -1;
12830 }
174f6622
ES		 12831
12832 return (time_t) epoch;
12833}
12834
5c3a10fb
MP		 12835/* Check and possibly warn if two declarations have contradictory
12836 attributes, such as always_inline vs. noinline. */
12837
12838bool
12839diagnose_mismatched_attributes (tree olddecl, tree newdecl)
12840{
12841 bool warned = false;
12842
12843 tree a1 = lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl));
12844 tree a2 = lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl));
12845 /* An optimization attribute applied on a declaration after the
12846 definition is likely not what the user wanted. */
12847 if (a2 != NULL_TREE
12848 && DECL_SAVED_TREE (olddecl) != NULL_TREE
12849 && (a1 == NULL_TREE || !attribute_list_equal (a1, a2)))
12850 warned |= warning (OPT_Wattributes,
12851 "optimization attribute on %qD follows "
12852 "definition but the attribute doesn%'t match",
12853 newdecl);
12854
12855 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
12856 if (DECL_DECLARED_INLINE_P (newdecl)
12857 && DECL_UNINLINABLE (olddecl)
12858 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
12859 warned |= warning (OPT_Wattributes, "inline declaration of %qD follows "
12860 "declaration with attribute noinline", newdecl);
12861 else if (DECL_DECLARED_INLINE_P (olddecl)
12862 && DECL_UNINLINABLE (newdecl)
12863 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
12864 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12865 "noinline follows inline declaration ", newdecl);
12866 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))
12867 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl)))
12868 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12869 "%qs follows declaration with attribute %qs",
12870 newdecl, "noinline", "always_inline");
12871 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl))
12872 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
12873 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12874 "%qs follows declaration with attribute %qs",
12875 newdecl, "always_inline", "noinline");
12876 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl))
12877 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl)))
12878 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12879 "%qs follows declaration with attribute %qs",
12880 newdecl, "cold", "hot");
12881 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl))
12882 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl)))
12883 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12884 "%qs follows declaration with attribute %qs",
12885 newdecl, "hot", "cold");
12886 return warned;
12887}
12888
39dabefd 12889#include "gt-c-family-c-common.h"
Mirror of https://gcc.gnu.org/git/gcc.git