]> 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
re PR middle-end/69156 (gcc.dg/pr59630.c: ICE: verify_gimple failed: non-trivial...
[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
AJ		 329static tree handle_used_attribute (tree *, tree, tree, int, bool *);
330static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
ce91e74c
JH		 331static tree handle_externally_visible_attribute (tree *, tree, tree, int,
332 bool *);
7861b648
AK		 333static tree handle_no_reorder_attribute (tree *, tree, tree, int,
334 bool *);
35b1a6fa
AJ		 335static tree handle_const_attribute (tree *, tree, tree, int, bool *);
336static tree handle_transparent_union_attribute (tree *, tree, tree,
337 int, bool *);
ee45a32d
EB		 338static tree handle_scalar_storage_order_attribute (tree *, tree, tree,
339 int, bool *);
35b1a6fa
AJ		 340static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
341static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
342static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
343static tree handle_section_attribute (tree *, tree, tree, int, bool *);
344static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
345static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
4bb794e2 346static tree handle_noplt_attribute (tree *, tree, tree, int, bool *) ;
ba885ec5
NS		 347static tree handle_alias_ifunc_attribute (bool, tree *, tree, tree, bool *);
348static tree handle_ifunc_attribute (tree *, tree, tree, int, bool *);
35b1a6fa 349static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
a0203ca7 350static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
35b1a6fa
AJ		 351static tree handle_visibility_attribute (tree *, tree, tree, int,
352 bool *);
353static tree handle_tls_model_attribute (tree *, tree, tree, int,
354 bool *);
355static tree handle_no_instrument_function_attribute (tree *, tree,
356 tree, int, bool *);
357static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
6e9a3221 358static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
35b1a6fa
AJ		 359static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
360 bool *);
361static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
0a35513e
AH		 362static tree handle_tm_attribute (tree *, tree, tree, int, bool *);
363static tree handle_tm_wrap_attribute (tree *, tree, tree, int, bool *);
dcd6de6d 364static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
35b1a6fa
AJ		 365static tree handle_deprecated_attribute (tree *, tree, tree, int,
366 bool *);
367static tree handle_vector_size_attribute (tree *, tree, tree, int,
368 bool *);
369static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
370static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
371static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
72954a4f
JM		 372static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
373 bool *);
3d091dac 374static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
b5d32c25 375static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
51bc54a6 376static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
8fcbce72
JJ		 377static tree handle_alloc_align_attribute (tree *, tree, tree, int, bool *);
378static tree handle_assume_aligned_attribute (tree *, tree, tree, int, bool *);
5779e713 379static tree handle_target_attribute (tree *, tree, tree, int, bool *);
3b1661a9 380static tree handle_target_clones_attribute (tree *, tree, tree, int, bool *);
ab442df7 381static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
0a35513e 382static tree ignore_attribute (tree *, tree, tree, int, bool *);
7458026b 383static tree handle_no_split_stack_attribute (tree *, tree, tree, int, bool *);
0b7b376d 384static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
2a99e5e6 385static tree handle_warn_unused_attribute (tree *, tree, tree, int, bool *);
826cacfe 386static tree handle_returns_nonnull_attribute (tree *, tree, tree, int, bool *);
acf0174b
JJ		 387static tree handle_omp_declare_simd_attribute (tree *, tree, tree, int,
388 bool *);
fff77217 389static tree handle_simd_attribute (tree *, tree, tree, int, bool *);
acf0174b
JJ		 390static tree handle_omp_declare_target_attribute (tree *, tree, tree, int,
391 bool *);
976d5a22 392static tree handle_designated_init_attribute (tree *, tree, tree, int, bool *);
d5e254e1
IE		 393static tree handle_bnd_variable_size_attribute (tree *, tree, tree, int, bool *);
394static tree handle_bnd_legacy (tree *, tree, tree, int, bool *);
395static tree handle_bnd_instrument (tree *, tree, tree, int, bool *);
35b1a6fa 396
94a0dd7b 397static void check_function_nonnull (tree, int, tree *);
35b1a6fa
AJ		 398static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
399static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
400static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
d07605f5 401static int resort_field_decl_cmp (const void *, const void *);
b34c7881 402
eea1139b
ILT		 403/* Reserved words. The third field is a mask: keywords are disabled
404 if they match the mask.
405
406 Masks for languages:
407 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
408 C --std=c99: D_CXXONLY | D_OBJC
409 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
410 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
411 C++ --std=c0x: D_CONLY | D_OBJC
412 ObjC++ is like C++ except that D_OBJC is not set
413
414 If -fno-asm is used, D_ASM is added to the mask. If
415 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
416 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
1973201f 417 In C with -Wc++-compat, we warn if D_CXXWARN is set.
eea1139b 418
1973201f
NP		 419 Note the complication of the D_CXX_OBJC keywords. These are
420 reserved words such as 'class'. In C++, 'class' is a reserved
421 word. In Objective-C++ it is too. In Objective-C, it is a
422 reserved word too, but only if it follows an '@' sign.
423*/
eea1139b
ILT		 424const struct c_common_resword c_common_reswords[] =
425{
d19fa6b5
JM		 426 { "_Alignas", RID_ALIGNAS, D_CONLY },
427 { "_Alignof", RID_ALIGNOF, D_CONLY },
267bac10 428 { "_Atomic", RID_ATOMIC, D_CONLY },
eea1139b
ILT		 429 { "_Bool", RID_BOOL, D_CONLY },
430 { "_Complex", RID_COMPLEX, 0 },
939b37da
BI		 431 { "_Cilk_spawn", RID_CILK_SPAWN, 0 },
432 { "_Cilk_sync", RID_CILK_SYNC, 0 },
9a771876 433 { "_Cilk_for", RID_CILK_FOR, 0 },
fa5da7de 434 { "_Imaginary", RID_IMAGINARY, D_CONLY },
eea1139b
ILT		 435 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
436 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
437 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
438 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
439 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
440 { "_Sat", RID_SAT, D_CONLY | D_EXT },
32912286 441 { "_Static_assert", RID_STATIC_ASSERT, D_CONLY },
bbceee64 442 { "_Noreturn", RID_NORETURN, D_CONLY },
433cc7b0 443 { "_Generic", RID_GENERIC, D_CONLY },
582d9b50 444 { "_Thread_local", RID_THREAD, D_CONLY },
eea1139b
ILT		 445 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
446 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
447 { "__alignof", RID_ALIGNOF, 0 },
448 { "__alignof__", RID_ALIGNOF, 0 },
449 { "__asm", RID_ASM, 0 },
450 { "__asm__", RID_ASM, 0 },
451 { "__attribute", RID_ATTRIBUTE, 0 },
452 { "__attribute__", RID_ATTRIBUTE, 0 },
38b7bc7f 453 { "__auto_type", RID_AUTO_TYPE, D_CONLY },
4daba884 454 { "__bases", RID_BASES, D_CXXONLY },
74893f25
RH		 455 { "__builtin_call_with_static_chain",
456 RID_BUILTIN_CALL_WITH_STATIC_CHAIN, D_CONLY },
eea1139b 457 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
d4a83c10 458 { "__builtin_complex", RID_BUILTIN_COMPLEX, D_CONLY },
9e1a8dd1 459 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE, 0 },
eea1139b
ILT		 460 { "__builtin_offsetof", RID_OFFSETOF, 0 },
461 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
462 { "__builtin_va_arg", RID_VA_ARG, 0 },
463 { "__complex", RID_COMPLEX, 0 },
464 { "__complex__", RID_COMPLEX, 0 },
465 { "__const", RID_CONST, 0 },
466 { "__const__", RID_CONST, 0 },
467 { "__decltype", RID_DECLTYPE, D_CXXONLY },
4daba884 468 { "__direct_bases", RID_DIRECT_BASES, D_CXXONLY },
eea1139b
ILT		 469 { "__extension__", RID_EXTENSION, 0 },
470 { "__func__", RID_C99_FUNCTION_NAME, 0 },
471 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
472 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
473 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
474 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
475 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
476 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
477 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
478 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
3c0d13bf
PC		 479 { "__imag", RID_IMAGPART, 0 },
480 { "__imag__", RID_IMAGPART, 0 },
481 { "__inline", RID_INLINE, 0 },
482 { "__inline__", RID_INLINE, 0 },
eea1139b
ILT		 483 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
484 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
485 { "__is_class", RID_IS_CLASS, D_CXXONLY },
eea1139b
ILT		 486 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
487 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
b3908fcc 488 { "__is_final", RID_IS_FINAL, D_CXXONLY },
3c0d13bf 489 { "__is_literal_type", RID_IS_LITERAL_TYPE, D_CXXONLY },
eea1139b
ILT		 490 { "__is_pod", RID_IS_POD, D_CXXONLY },
491 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
971e17ff 492 { "__is_same_as", RID_IS_SAME_AS, D_CXXONLY },
c32097d8
JM		 493 { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY },
494 { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY },
dd5d5481
JM		 495 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE, D_CXXONLY },
496 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE, D_CXXONLY },
b752325e 497 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE, D_CXXONLY },
eea1139b 498 { "__is_union", RID_IS_UNION, D_CXXONLY },
eea1139b
ILT		 499 { "__label__", RID_LABEL, 0 },
500 { "__null", RID_NULL, 0 },
501 { "__real", RID_REALPART, 0 },
502 { "__real__", RID_REALPART, 0 },
503 { "__restrict", RID_RESTRICT, 0 },
504 { "__restrict__", RID_RESTRICT, 0 },
505 { "__signed", RID_SIGNED, 0 },
506 { "__signed__", RID_SIGNED, 0 },
507 { "__thread", RID_THREAD, 0 },
0a35513e
AH		 508 { "__transaction_atomic", RID_TRANSACTION_ATOMIC, 0 },
509 { "__transaction_relaxed", RID_TRANSACTION_RELAXED, 0 },
510 { "__transaction_cancel", RID_TRANSACTION_CANCEL, 0 },
eea1139b
ILT		 511 { "__typeof", RID_TYPEOF, 0 },
512 { "__typeof__", RID_TYPEOF, 0 },
3c0d13bf 513 { "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY },
eea1139b
ILT		 514 { "__volatile", RID_VOLATILE, 0 },
515 { "__volatile__", RID_VOLATILE, 0 },
36a85135
JM		 516 { "alignas", RID_ALIGNAS, D_CXXONLY | D_CXX11 | D_CXXWARN },
517 { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 518 { "asm", RID_ASM, D_ASM },
519 { "auto", RID_AUTO, 0 },
03c3034e 520 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 521 { "break", RID_BREAK, 0 },
522 { "case", RID_CASE, 0 },
2696a995 523 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
eea1139b 524 { "char", RID_CHAR, 0 },
36a85135
JM		 525 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX11 | D_CXXWARN },
526 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995 527 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
eea1139b 528 { "const", RID_CONST, 0 },
36a85135 529 { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 530 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
531 { "continue", RID_CONTINUE, 0 },
36a85135 532 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b 533 { "default", RID_DEFAULT, 0 },
2696a995 534 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 535 { "do", RID_DO, 0 },
536 { "double", RID_DOUBLE, 0 },
537 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
538 { "else", RID_ELSE, 0 },
539 { "enum", RID_ENUM, 0 },
2696a995
KG		 540 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
541 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
eea1139b 542 { "extern", RID_EXTERN, 0 },
2696a995 543 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 544 { "float", RID_FLOAT, 0 },
545 { "for", RID_FOR, 0 },
2696a995 546 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 547 { "goto", RID_GOTO, 0 },
548 { "if", RID_IF, 0 },
549 { "inline", RID_INLINE, D_EXT89 },
550 { "int", RID_INT, 0 },
551 { "long", RID_LONG, 0 },
552 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
2696a995
KG		 553 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
554 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
36a85135
JM		 555 { "noexcept", RID_NOEXCEPT, D_CXXONLY | D_CXX11 | D_CXXWARN },
556 { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995
KG		 557 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
558 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
559 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
560 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
eea1139b
ILT		 561 { "register", RID_REGISTER, 0 },
562 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
563 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
564 { "return", RID_RETURN, 0 },
565 { "short", RID_SHORT, 0 },
566 { "signed", RID_SIGNED, 0 },
567 { "sizeof", RID_SIZEOF, 0 },
568 { "static", RID_STATIC, 0 },
36a85135 569 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX11 | D_CXXWARN },
eea1139b
ILT		 570 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
571 { "struct", RID_STRUCT, 0 },
572 { "switch", RID_SWITCH, 0 },
2696a995
KG		 573 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
574 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
36a85135 575 { "thread_local", RID_THREAD, D_CXXONLY | D_CXX11 | D_CXXWARN },
2696a995
KG		 576 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
577 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
578 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
eea1139b 579 { "typedef", RID_TYPEDEF, 0 },
2696a995
KG		 580 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
581 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 582 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
583 { "union", RID_UNION, 0 },
584 { "unsigned", RID_UNSIGNED, 0 },
2696a995
KG		 585 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
586 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
eea1139b
ILT		 587 { "void", RID_VOID, 0 },
588 { "volatile", RID_VOLATILE, 0 },
589 { "wchar_t", RID_WCHAR, D_CXXONLY },
590 { "while", RID_WHILE, 0 },
971e17ff 591
b8fd7909
JM		 592 /* C++ transactional memory. */
593 { "synchronized", RID_SYNCHRONIZED, D_CXX_OBJC | D_TRANSMEM },
594 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT, D_CXXONLY | D_TRANSMEM },
595 { "atomic_cancel", RID_ATOMIC_CANCEL, D_CXXONLY | D_TRANSMEM },
596 { "atomic_commit", RID_TRANSACTION_ATOMIC, D_CXXONLY | D_TRANSMEM },
597
971e17ff
AS		 598 /* Concepts-related keywords */
599 { "concept", RID_CONCEPT, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
600 { "requires", RID_REQUIRES, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
601
eea1139b
ILT		 602 /* These Objective-C keywords are recognized only immediately after
603 an '@'. */
604 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
605 { "defs", RID_AT_DEFS, D_OBJC },
606 { "encode", RID_AT_ENCODE, D_OBJC },
607 { "end", RID_AT_END, D_OBJC },
608 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
609 { "interface", RID_AT_INTERFACE, D_OBJC },
610 { "protocol", RID_AT_PROTOCOL, D_OBJC },
611 { "selector", RID_AT_SELECTOR, D_OBJC },
612 { "finally", RID_AT_FINALLY, D_OBJC },
92902b1b
IS		 613 { "optional", RID_AT_OPTIONAL, D_OBJC },
614 { "required", RID_AT_REQUIRED, D_OBJC },
668ea4b1 615 { "property", RID_AT_PROPERTY, D_OBJC },
c37d8c30 616 { "package", RID_AT_PACKAGE, D_OBJC },
da57d1b9
NP		 617 { "synthesize", RID_AT_SYNTHESIZE, D_OBJC },
618 { "dynamic", RID_AT_DYNAMIC, D_OBJC },
eea1139b
ILT		 619 /* These are recognized only in protocol-qualifier context
620 (see above) */
621 { "bycopy", RID_BYCOPY, D_OBJC },
622 { "byref", RID_BYREF, D_OBJC },
623 { "in", RID_IN, D_OBJC },
624 { "inout", RID_INOUT, D_OBJC },
625 { "oneway", RID_ONEWAY, D_OBJC },
626 { "out", RID_OUT, D_OBJC },
668ea4b1 627 /* These are recognized inside a property attribute list */
200290f2
NP		 628 { "assign", RID_ASSIGN, D_OBJC },
629 { "copy", RID_COPY, D_OBJC },
668ea4b1 630 { "getter", RID_GETTER, D_OBJC },
200290f2
NP		 631 { "nonatomic", RID_NONATOMIC, D_OBJC },
632 { "readonly", RID_READONLY, D_OBJC },
633 { "readwrite", RID_READWRITE, D_OBJC },
634 { "retain", RID_RETAIN, D_OBJC },
668ea4b1 635 { "setter", RID_SETTER, D_OBJC },
eea1139b
ILT		 636};
637
638const unsigned int num_c_common_reswords =
639 sizeof c_common_reswords / sizeof (struct c_common_resword);
640
d5e254e1
IE		 641/* Table of machine-independent attributes common to all C-like languages.
642
643 All attributes referencing arguments should be additionally processed
644 in chkp_copy_function_type_adding_bounds for correct instrumentation
645 by Pointer Bounds Checker.
646 Current list of processed common attributes: nonnull. */
349ae713
NB		 647const struct attribute_spec c_common_attribute_table[] =
648{
62d784f7
KT		 649 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
650 affects_type_identity } */
349ae713 651 { "packed", 0, 0, false, false, false,
62d784f7 652 handle_packed_attribute , false},
349ae713 653 { "nocommon", 0, 0, true, false, false,
62d784f7 654 handle_nocommon_attribute, false},
349ae713 655 { "common", 0, 0, true, false, false,
62d784f7 656 handle_common_attribute, false },
349ae713
NB		 657 /* FIXME: logically, noreturn attributes should be listed as
658 "false, true, true" and apply to function types. But implementing this
659 would require all the places in the compiler that use TREE_THIS_VOLATILE
660 on a decl to identify non-returning functions to be located and fixed
661 to check the function type instead. */
662 { "noreturn", 0, 0, true, false, false,
62d784f7 663 handle_noreturn_attribute, false },
349ae713 664 { "volatile", 0, 0, true, false, false,
62d784f7 665 handle_noreturn_attribute, false },
5434dc07
MD		 666 { "stack_protect", 0, 0, true, false, false,
667 handle_stack_protect_attribute, false },
349ae713 668 { "noinline", 0, 0, true, false, false,
62d784f7 669 handle_noinline_attribute, false },
86631ea3 670 { "noclone", 0, 0, true, false, false,
62d784f7 671 handle_noclone_attribute, false },
185c9e56
ML		 672 { "no_icf", 0, 0, true, false, false,
673 handle_noicf_attribute, false },
46a4da10 674 { "leaf", 0, 0, true, false, false,
62d784f7 675 handle_leaf_attribute, false },
349ae713 676 { "always_inline", 0, 0, true, false, false,
62d784f7 677 handle_always_inline_attribute, false },
4eb7fd83 678 { "gnu_inline", 0, 0, true, false, false,
62d784f7 679 handle_gnu_inline_attribute, false },
d752cfdb 680 { "artificial", 0, 0, true, false, false,
62d784f7 681 handle_artificial_attribute, false },
0691d1d4 682 { "flatten", 0, 0, true, false, false,
62d784f7 683 handle_flatten_attribute, false },
349ae713 684 { "used", 0, 0, true, false, false,
62d784f7 685 handle_used_attribute, false },
349ae713 686 { "unused", 0, 0, false, false, false,
62d784f7 687 handle_unused_attribute, false },
ce91e74c 688 { "externally_visible", 0, 0, true, false, false,
62d784f7 689 handle_externally_visible_attribute, false },
7861b648
AK		 690 { "no_reorder", 0, 0, true, false, false,
691 handle_no_reorder_attribute, false },
349ae713
NB		 692 /* The same comments as for noreturn attributes apply to const ones. */
693 { "const", 0, 0, true, false, false,
62d784f7 694 handle_const_attribute, false },
ee45a32d
EB		 695 { "scalar_storage_order", 1, 1, false, false, false,
696 handle_scalar_storage_order_attribute, false },
349ae713 697 { "transparent_union", 0, 0, false, false, false,
62d784f7 698 handle_transparent_union_attribute, false },
fc8600f9 699 { "constructor", 0, 1, true, false, false,
62d784f7 700 handle_constructor_attribute, false },
fc8600f9 701 { "destructor", 0, 1, true, false, false,
62d784f7 702 handle_destructor_attribute, false },
349ae713 703 { "mode", 1, 1, false, true, false,
62d784f7 704 handle_mode_attribute, false },
349ae713 705 { "section", 1, 1, true, false, false,
62d784f7 706 handle_section_attribute, false },
349ae713 707 { "aligned", 0, 1, false, false, false,
62d784f7 708 handle_aligned_attribute, false },
349ae713 709 { "weak", 0, 0, true, false, false,
62d784f7 710 handle_weak_attribute, false },
4bb794e2
ST		 711 { "noplt", 0, 0, true, false, false,
712 handle_noplt_attribute, false },
ba885ec5 713 { "ifunc", 1, 1, true, false, false,
62d784f7 714 handle_ifunc_attribute, false },
349ae713 715 { "alias", 1, 1, true, false, false,
62d784f7 716 handle_alias_attribute, false },
a0203ca7 717 { "weakref", 0, 1, true, false, false,
62d784f7 718 handle_weakref_attribute, false },
349ae713 719 { "no_instrument_function", 0, 0, true, false, false,
62d784f7
KT		 720 handle_no_instrument_function_attribute,
721 false },
349ae713 722 { "malloc", 0, 0, true, false, false,
62d784f7 723 handle_malloc_attribute, false },
6e9a3221 724 { "returns_twice", 0, 0, true, false, false,
62d784f7 725 handle_returns_twice_attribute, false },
349ae713 726 { "no_stack_limit", 0, 0, true, false, false,
62d784f7 727 handle_no_limit_stack_attribute, false },
349ae713 728 { "pure", 0, 0, true, false, false,
62d784f7 729 handle_pure_attribute, false },
0a35513e
AH		 730 { "transaction_callable", 0, 0, false, true, false,
731 handle_tm_attribute, false },
732 { "transaction_unsafe", 0, 0, false, true, false,
b8fd7909 733 handle_tm_attribute, true },
0a35513e 734 { "transaction_safe", 0, 0, false, true, false,
b8fd7909
JM		 735 handle_tm_attribute, true },
736 { "transaction_safe_dynamic", 0, 0, true, false, false,
0a35513e
AH		 737 handle_tm_attribute, false },
738 { "transaction_may_cancel_outer", 0, 0, false, true, false,
739 handle_tm_attribute, false },
740 /* ??? These two attributes didn't make the transition from the
741 Intel language document to the multi-vendor language document. */
742 { "transaction_pure", 0, 0, false, true, false,
743 handle_tm_attribute, false },
744 { "transaction_wrap", 1, 1, true, false, false,
745 handle_tm_wrap_attribute, false },
dcd6de6d
ZD		 746 /* For internal use (marking of builtins) only. The name contains space
747 to prevent its usage in source code. */
748 { "no vops", 0, 0, true, false, false,
62d784f7 749 handle_novops_attribute, false },
9b86d6bb 750 { "deprecated", 0, 1, false, false, false,
62d784f7 751 handle_deprecated_attribute, false },
349ae713 752 { "vector_size", 1, 1, false, true, false,
62d784f7 753 handle_vector_size_attribute, false },
d7afec4b 754 { "visibility", 1, 1, false, false, false,
62d784f7 755 handle_visibility_attribute, false },
dce81a1a 756 { "tls_model", 1, 1, true, false, false,
62d784f7 757 handle_tls_model_attribute, false },
b34c7881 758 { "nonnull", 0, -1, false, true, true,
62d784f7 759 handle_nonnull_attribute, false },
39f2f3c8 760 { "nothrow", 0, 0, true, false, false,
62d784f7
KT		 761 handle_nothrow_attribute, false },
762 { "may_alias", 0, 0, false, true, false, NULL, false },
0bfa5f65 763 { "cleanup", 1, 1, true, false, false,
62d784f7 764 handle_cleanup_attribute, false },
72954a4f 765 { "warn_unused_result", 0, 0, false, true, true,
62d784f7 766 handle_warn_unused_result_attribute, false },
254986c7 767 { "sentinel", 0, 1, false, true, true,
62d784f7 768 handle_sentinel_attribute, false },
b5d32c25
KG		 769 /* For internal use (marking of builtins) only. The name contains space
770 to prevent its usage in source code. */
771 { "type generic", 0, 0, false, true, true,
62d784f7 772 handle_type_generic_attribute, false },
51bc54a6 773 { "alloc_size", 1, 2, false, true, true,
62d784f7 774 handle_alloc_size_attribute, false },
52bf96d2 775 { "cold", 0, 0, true, false, false,
62d784f7 776 handle_cold_attribute, false },
52bf96d2 777 { "hot", 0, 0, true, false, false,
62d784f7 778 handle_hot_attribute, false },
77bc5132
JJ		 779 { "no_address_safety_analysis",
780 0, 0, true, false, false,
781 handle_no_address_safety_analysis_attribute,
782 false },
e664c61c
KS		 783 { "no_sanitize_address", 0, 0, true, false, false,
784 handle_no_sanitize_address_attribute,
785 false },
de35aa66
MS		 786 { "no_sanitize_thread", 0, 0, true, false, false,
787 handle_no_sanitize_address_attribute,
788 false },
ce6923c5
MP		 789 { "no_sanitize_undefined", 0, 0, true, false, false,
790 handle_no_sanitize_undefined_attribute,
791 false },
d2af6a68 792 { "warning", 1, 1, true, false, false,
62d784f7 793 handle_error_attribute, false },
d2af6a68 794 { "error", 1, 1, true, false, false,
62d784f7 795 handle_error_attribute, false },
5779e713 796 { "target", 1, -1, true, false, false,
62d784f7 797 handle_target_attribute, false },
3b1661a9
ES		 798 { "target_clones", 1, -1, true, false, false,
799 handle_target_clones_attribute, false },
ab442df7 800 { "optimize", 1, -1, true, false, false,
62d784f7 801 handle_optimize_attribute, false },
0a35513e
AH		 802 /* For internal use only. The leading '*' both prevents its usage in
803 source code and signals that it may be overridden by machine tables. */
804 { "*tm regparm", 0, 0, false, true, true,
805 ignore_attribute, false },
7458026b 806 { "no_split_stack", 0, 0, true, false, false,
62d784f7 807 handle_no_split_stack_attribute, false },
0b7b376d
RG		 808 /* For internal use (marking of builtins and runtime functions) only.
809 The name contains space to prevent its usage in source code. */
810 { "fn spec", 1, 1, false, true, true,
62d784f7 811 handle_fnspec_attribute, false },
2a99e5e6
LL		 812 { "warn_unused", 0, 0, false, false, false,
813 handle_warn_unused_attribute, false },
826cacfe
MG		 814 { "returns_nonnull", 0, 0, false, true, true,
815 handle_returns_nonnull_attribute, false },
acf0174b
JJ		 816 { "omp declare simd", 0, -1, true, false, false,
817 handle_omp_declare_simd_attribute, false },
41958c28
BI		 818 { "cilk simd function", 0, -1, true, false, false,
819 handle_omp_declare_simd_attribute, false },
e7b69085 820 { "simd", 0, 1, true, false, false,
fff77217 821 handle_simd_attribute, false },
acf0174b
JJ		 822 { "omp declare target", 0, 0, true, false, false,
823 handle_omp_declare_target_attribute, false },
4a38b02b
IV		 824 { "omp declare target link", 0, 0, true, false, false,
825 handle_omp_declare_target_attribute, false },
8fcbce72
JJ		 826 { "alloc_align", 1, 1, false, true, true,
827 handle_alloc_align_attribute, false },
828 { "assume_aligned", 1, 2, false, true, true,
829 handle_assume_aligned_attribute, false },
976d5a22
TT		 830 { "designated_init", 0, 0, false, true, false,
831 handle_designated_init_attribute, false },
d5e254e1
IE		 832 { "bnd_variable_size", 0, 0, true, false, false,
833 handle_bnd_variable_size_attribute, false },
834 { "bnd_legacy", 0, 0, true, false, false,
835 handle_bnd_legacy, false },
836 { "bnd_instrument", 0, 0, true, false, false,
837 handle_bnd_instrument, false },
62d784f7 838 { NULL, 0, 0, false, false, false, NULL, false }
349ae713
NB		 839};
840
841/* Give the specifications for the format attributes, used by C and all
d5e254e1 842 descendants.
349ae713 843
d5e254e1
IE		 844 All attributes referencing arguments should be additionally processed
845 in chkp_copy_function_type_adding_bounds for correct instrumentation
846 by Pointer Bounds Checker.
847 Current list of processed format attributes: format, format_arg. */
349ae713
NB		 848const struct attribute_spec c_common_format_attribute_table[] =
849{
62d784f7
KT		 850 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
851 affects_type_identity } */
349ae713 852 { "format", 3, 3, false, true, true,
62d784f7 853 handle_format_attribute, false },
349ae713 854 { "format_arg", 1, 1, false, true, true,
62d784f7
KT		 855 handle_format_arg_attribute, false },
856 { NULL, 0, 0, false, false, false, NULL, false }
349ae713
NB		 857};
858
36c5e70a 859/* Return identifier for address space AS. */
3ef0694c 860
36c5e70a
BE		 861const char *
862c_addr_space_name (addr_space_t as)
863{
3ef0694c
UW		 864 int rid = RID_FIRST_ADDR_SPACE + as;
865 gcc_assert (ridpointers [rid]);
866 return IDENTIFIER_POINTER (ridpointers [rid]);
36c5e70a
BE		 867}
868
ec5c56db 869/* Push current bindings for the function name VAR_DECLS. */
7da551a2
RS		 870
871void
35b1a6fa 872start_fname_decls (void)
7da551a2 873{
0ba8a114
NS		 874 unsigned ix;
875 tree saved = NULL_TREE;
35b1a6fa 876
0ba8a114
NS		 877 for (ix = 0; fname_vars[ix].decl; ix++)
878 {
879 tree decl = *fname_vars[ix].decl;
7da551a2 880
0ba8a114
NS		 881 if (decl)
882 {
c62c040f
RG		 883 saved = tree_cons (decl, build_int_cst (integer_type_node, ix),
884 saved);
0ba8a114
NS		 885 *fname_vars[ix].decl = NULL_TREE;
886 }
887 }
888 if (saved || saved_function_name_decls)
889 /* Normally they'll have been NULL, so only push if we've got a
890 stack, or they are non-NULL. */
891 saved_function_name_decls = tree_cons (saved, NULL_TREE,
892 saved_function_name_decls);
893}
894
325c3691
RH		 895/* Finish up the current bindings, adding them into the current function's
896 statement tree. This must be done _before_ finish_stmt_tree is called.
897 If there is no current function, we must be at file scope and no statements
898 are involved. Pop the previous bindings. */
0ba8a114
NS		 899
900void
35b1a6fa 901finish_fname_decls (void)
0ba8a114
NS		 902{
903 unsigned ix;
325c3691 904 tree stmts = NULL_TREE;
0ba8a114
NS		 905 tree stack = saved_function_name_decls;
906
907 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
325c3691 908 append_to_statement_list (TREE_VALUE (stack), &stmts);
35b1a6fa 909
325c3691 910 if (stmts)
0ba8a114 911 {
325c3691 912 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
bfaba7a9 913
325c3691
RH		 914 if (TREE_CODE (*bodyp) == BIND_EXPR)
915 bodyp = &BIND_EXPR_BODY (*bodyp);
6cce57b0 916
86ad3aa9 917 append_to_statement_list_force (*bodyp, &stmts);
325c3691 918 *bodyp = stmts;
0ba8a114 919 }
35b1a6fa 920
0ba8a114
NS		 921 for (ix = 0; fname_vars[ix].decl; ix++)
922 *fname_vars[ix].decl = NULL_TREE;
35b1a6fa 923
0ba8a114 924 if (stack)
7da551a2 925 {
ec5c56db 926 /* We had saved values, restore them. */
0ba8a114
NS		 927 tree saved;
928
929 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
930 {
931 tree decl = TREE_PURPOSE (saved);
932 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
35b1a6fa 933
0ba8a114
NS		 934 *fname_vars[ix].decl = decl;
935 }
936 stack = TREE_CHAIN (stack);
7da551a2 937 }
0ba8a114
NS		 938 saved_function_name_decls = stack;
939}
940
6cce57b0 941/* Return the text name of the current function, suitably prettified
0d0bc036 942 by PRETTY_P. Return string must be freed by caller. */
0ba8a114
NS		 943
944const char *
35b1a6fa 945fname_as_string (int pretty_p)
0ba8a114 946{
47ab33b2 947 const char *name = "top level";
0d0bc036 948 char *namep;
46c2514e
TT		 949 int vrb = 2, len;
950 cpp_string cstr = { 0, 0 }, strname;
47ab33b2 951
3f75a254 952 if (!pretty_p)
47ab33b2
MA		 953 {
954 name = "";
955 vrb = 0;
956 }
957
958 if (current_function_decl)
ae2bcd98 959 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
47ab33b2 960
46c2514e 961 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
0d0bc036 962
46c2514e
TT		 963 namep = XNEWVEC (char, len);
964 snprintf (namep, len, "\"%s\"", name);
965 strname.text = (unsigned char *) namep;
966 strname.len = len - 1;
0d0bc036 967
b6baa67d 968 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
46c2514e
TT		 969 {
970 XDELETEVEC (namep);
971 return (const char *) cstr.text;
0d0bc036 972 }
0d0bc036
AH		 973
974 return namep;
0ba8a114
NS		 975}
976
0ba8a114
NS		 977/* Return the VAR_DECL for a const char array naming the current
978 function. If the VAR_DECL has not yet been created, create it
979 now. RID indicates how it should be formatted and IDENTIFIER_NODE
980 ID is its name (unfortunately C and C++ hold the RID values of
981 keywords in different places, so we can't derive RID from ID in
3ba09659
AH		 982 this language independent code. LOC is the location of the
983 function. */
0ba8a114
NS		 984
985tree
3ba09659 986fname_decl (location_t loc, unsigned int rid, tree id)
0ba8a114
NS		 987{
988 unsigned ix;
989 tree decl = NULL_TREE;
990
991 for (ix = 0; fname_vars[ix].decl; ix++)
992 if (fname_vars[ix].rid == rid)
993 break;
994
995 decl = *fname_vars[ix].decl;
996 if (!decl)
7da551a2 997 {
8d3e27d1
DJ		 998 /* If a tree is built here, it would normally have the lineno of
999 the current statement. Later this tree will be moved to the
1000 beginning of the function and this line number will be wrong.
1001 To avoid this problem set the lineno to 0 here; that prevents
4b7e68e7 1002 it from appearing in the RTL. */
325c3691 1003 tree stmts;
3c20847b 1004 location_t saved_location = input_location;
3c20847b 1005 input_location = UNKNOWN_LOCATION;
35b1a6fa 1006
325c3691 1007 stmts = push_stmt_list ();
c2255bc4 1008 decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty);
325c3691
RH		 1009 stmts = pop_stmt_list (stmts);
1010 if (!IS_EMPTY_STMT (stmts))
1011 saved_function_name_decls
1012 = tree_cons (decl, stmts, saved_function_name_decls);
0ba8a114 1013 *fname_vars[ix].decl = decl;
3c20847b 1014 input_location = saved_location;
7da551a2 1015 }
0ba8a114 1016 if (!ix && !current_function_decl)
3ba09659 1017 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
6cce57b0 1018
0ba8a114 1019 return decl;
7da551a2
RS		 1020}
1021
b84a3874 1022/* Given a STRING_CST, give it a suitable array-of-chars data type. */
b30f223b
RS		 1023
1024tree
35b1a6fa 1025fix_string_type (tree value)
b30f223b 1026{
b84a3874
RH		 1027 int length = TREE_STRING_LENGTH (value);
1028 int nchars;
c162c75e
MA		 1029 tree e_type, i_type, a_type;
1030
b57062ca 1031 /* Compute the number of elements, for the array type. */
b6baa67d
KVH		 1032 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
1033 {
1034 nchars = length;
1035 e_type = char_type_node;
1036 }
1037 else if (TREE_TYPE (value) == char16_array_type_node)
1038 {
1039 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
1040 e_type = char16_type_node;
1041 }
1042 else if (TREE_TYPE (value) == char32_array_type_node)
1043 {
1044 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
1045 e_type = char32_type_node;
1046 }
1047 else
1048 {
1049 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
1050 e_type = wchar_type_node;
1051 }
b30f223b 1052
89a42ac8
ZW		 1053 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1054 limit in C++98 Annex B is very large (65536) and is not normative,
1055 so we do not diagnose it (warn_overlength_strings is forced off
1056 in c_common_post_options). */
1057 if (warn_overlength_strings)
1058 {
1059 const int nchars_max = flag_isoc99 ? 4095 : 509;
1060 const int relevant_std = flag_isoc99 ? 99 : 90;
1061 if (nchars - 1 > nchars_max)
1062 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1063 separate the %d from the 'C'. 'ISO' should not be
1064 translated, but it may be moved after 'C%d' in languages
1065 where modifiers follow nouns. */
509c9d60 1066 pedwarn (input_location, OPT_Woverlength_strings,
fcf73884 1067 "string length %qd is greater than the length %qd "
89a42ac8
ZW		 1068 "ISO C%d compilers are required to support",
1069 nchars - 1, nchars_max, relevant_std);
1070 }
1326a48b 1071
cfb10bd3
GDR		 1072 /* Create the array type for the string constant. The ISO C++
1073 standard says that a string literal has type `const char[N]' or
1074 `const wchar_t[N]'. We use the same logic when invoked as a C
1075 front-end with -Wwrite-strings.
1076 ??? We should change the type of an expression depending on the
1077 state of a warning flag. We should just be warning -- see how
1078 this is handled in the C++ front-end for the deprecated implicit
1079 conversion from string literals to `char*' or `wchar_t*'.
c162c75e
MA		 1080
1081 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1082 array type being the unqualified version of that type.
1083 Therefore, if we are constructing an array of const char, we must
1084 construct the matching unqualified array type first. The C front
1085 end does not require this, but it does no harm, so we do it
1086 unconditionally. */
c62c040f 1087 i_type = build_index_type (size_int (nchars - 1));
c162c75e 1088 a_type = build_array_type (e_type, i_type);
cfb10bd3 1089 if (c_dialect_cxx() || warn_write_strings)
46df2823 1090 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
d9cf7c82 1091
c162c75e 1092 TREE_TYPE (value) = a_type;
ccd4c832 1093 TREE_CONSTANT (value) = 1;
3521b33c 1094 TREE_READONLY (value) = 1;
b30f223b
RS		 1095 TREE_STATIC (value) = 1;
1096 return value;
1097}
1098\f
f479b43d
JM		 1099/* Fold X for consideration by one of the warning functions when checking
1100 whether an expression has a constant value. */
1101
1102static tree
1103fold_for_warn (tree x)
1104{
1105 if (c_dialect_cxx ())
1106 return c_fully_fold (x, /*for_init*/false, /*maybe_constp*/NULL);
1107 else
1108 /* The C front-end has already folded X appropriately. */
1109 return x;
1110}
1111
d74154d5
RS		 1112/* Print a warning if a constant expression had overflow in folding.
1113 Invoke this function on every expression that the language
1114 requires to be a constant expression.
1115 Note the ANSI C standard says it is erroneous for a
1116 constant expression to overflow. */
96571883
BK		 1117
1118void
35b1a6fa 1119constant_expression_warning (tree value)
393eda6a 1120{
b8698a0f 1121 if (warn_overflow && pedantic
393eda6a
MLI		 1122 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1123 || TREE_CODE (value) == FIXED_CST
1124 || TREE_CODE (value) == VECTOR_CST
1125 || TREE_CODE (value) == COMPLEX_CST)
1126 && TREE_OVERFLOW (value))
509c9d60 1127 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
393eda6a
MLI		 1128}
1129
1130/* The same as above but print an unconditional error. */
1131void
1132constant_expression_error (tree value)
96571883 1133{
c05f751c 1134 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
ab22c1fa 1135 || TREE_CODE (value) == FIXED_CST
69ef87e2 1136 || TREE_CODE (value) == VECTOR_CST
c05f751c 1137 || TREE_CODE (value) == COMPLEX_CST)
393eda6a
MLI		 1138 && TREE_OVERFLOW (value))
1139 error ("overflow in constant expression");
d74154d5
RS		 1140}
1141
59c0753d
MLI		 1142/* Print a warning if an expression had overflow in folding and its
1143 operands hadn't.
1144
d74154d5
RS		 1145 Invoke this function on every expression that
1146 (1) appears in the source code, and
59c0753d 1147 (2) is a constant expression that overflowed, and
d74154d5 1148 (3) is not already checked by convert_and_check;
59c0753d
MLI		 1149 however, do not invoke this function on operands of explicit casts
1150 or when the expression is the result of an operator and any operand
1151 already overflowed. */
d74154d5
RS		 1152
1153void
c2255bc4 1154overflow_warning (location_t loc, tree value)
d74154d5 1155{
7d882b83
ILT		 1156 if (c_inhibit_evaluation_warnings != 0)
1157 return;
59c0753d
MLI		 1158
1159 switch (TREE_CODE (value))
69ef87e2 1160 {
59c0753d 1161 case INTEGER_CST:
c2255bc4 1162 warning_at (loc, OPT_Woverflow, "integer overflow in expression");
59c0753d 1163 break;
b8698a0f 1164
59c0753d 1165 case REAL_CST:
c2255bc4
AH		 1166 warning_at (loc, OPT_Woverflow,
1167 "floating point overflow in expression");
59c0753d 1168 break;
b8698a0f 1169
ab22c1fa 1170 case FIXED_CST:
c2255bc4 1171 warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
ab22c1fa
CF		 1172 break;
1173
59c0753d 1174 case VECTOR_CST:
c2255bc4 1175 warning_at (loc, OPT_Woverflow, "vector overflow in expression");
59c0753d 1176 break;
b8698a0f 1177
59c0753d
MLI		 1178 case COMPLEX_CST:
1179 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
c2255bc4
AH		 1180 warning_at (loc, OPT_Woverflow,
1181 "complex integer overflow in expression");
59c0753d 1182 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
c2255bc4
AH		 1183 warning_at (loc, OPT_Woverflow,
1184 "complex floating point overflow in expression");
59c0753d
MLI		 1185 break;
1186
1187 default:
1188 break;
69ef87e2 1189 }
d74154d5
RS		 1190}
1191
ca409efd
MLI		 1192/* Warn about uses of logical || / && operator in a context where it
1193 is likely that the bitwise equivalent was intended by the
1194 programmer. We have seen an expression in which CODE is a binary
a243fb4a
MLI		 1195 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1196 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
63a08740 1197void
a243fb4a 1198warn_logical_operator (location_t location, enum tree_code code, tree type,
b8698a0f 1199 enum tree_code code_left, tree op_left,
ca409efd 1200 enum tree_code ARG_UNUSED (code_right), tree op_right)
63a08740 1201{
a243fb4a
MLI		 1202 int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
1203 int in0_p, in1_p, in_p;
1204 tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
1205 bool strict_overflow_p = false;
1206
ca409efd
MLI		 1207 if (code != TRUTH_ANDIF_EXPR
1208 && code != TRUTH_AND_EXPR
1209 && code != TRUTH_ORIF_EXPR
1210 && code != TRUTH_OR_EXPR)
1211 return;
1212
b8787813
MP		 1213 /* We don't want to warn if either operand comes from a macro
1214 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1215 see PR61534. */
1216 if (from_macro_expansion_at (EXPR_LOCATION (op_left))
1217 || from_macro_expansion_at (EXPR_LOCATION (op_right)))
1218 return;
1219
ca409efd
MLI		 1220 /* Warn if &&/|| are being used in a context where it is
1221 likely that the bitwise equivalent was intended by the
1222 programmer. That is, an expression such as op && MASK
1223 where op should not be any boolean expression, nor a
1224 constant, and mask seems to be a non-boolean integer constant. */
f479b43d
JM		 1225 if (TREE_CODE (op_right) == CONST_DECL)
1226 /* An enumerator counts as a constant. */
1227 op_right = DECL_INITIAL (op_right);
ca409efd
MLI		 1228 if (!truth_value_p (code_left)
1229 && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
1230 && !CONSTANT_CLASS_P (op_left)
1231 && !TREE_NO_WARNING (op_left)
1232 && TREE_CODE (op_right) == INTEGER_CST
1233 && !integer_zerop (op_right)
1234 && !integer_onep (op_right))
63a08740 1235 {
a243fb4a 1236 if (or_op)
ca409efd
MLI		 1237 warning_at (location, OPT_Wlogical_op, "logical %<or%>"
1238 " applied to non-boolean constant");
1239 else
1240 warning_at (location, OPT_Wlogical_op, "logical %<and%>"
1241 " applied to non-boolean constant");
1242 TREE_NO_WARNING (op_left) = true;
a243fb4a
MLI		 1243 return;
1244 }
1245
1246 /* We do not warn for constants because they are typical of macro
1247 expansions that test for features. */
f479b43d
JM		 1248 if (CONSTANT_CLASS_P (fold_for_warn (op_left))
1249 || CONSTANT_CLASS_P (fold_for_warn (op_right)))
a243fb4a
MLI		 1250 return;
1251
1252 /* This warning only makes sense with logical operands. */
1253 if (!(truth_value_p (TREE_CODE (op_left))
1254 || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
1255 || !(truth_value_p (TREE_CODE (op_right))
1256 || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
1257 return;
1258
3c9aabbd
MG		 1259 /* The range computations only work with scalars. */
1260 if (VECTOR_TYPE_P (TREE_TYPE (op_left))
1261 || VECTOR_TYPE_P (TREE_TYPE (op_right)))
1262 return;
a243fb4a 1263
f2c4a785
MLI		 1264 /* We first test whether either side separately is trivially true
1265 (with OR) or trivially false (with AND). If so, do not warn.
1266 This is a common idiom for testing ranges of data types in
1267 portable code. */
1268 lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
1269 if (!lhs)
1270 return;
1271 if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
a243fb4a
MLI		 1272 lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
1273
f2c4a785
MLI		 1274 /* If this is an OR operation, invert both sides; now, the result
1275 should be always false to get a warning. */
1276 if (or_op)
1277 in0_p = !in0_p;
1278
1279 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in0_p, low0, high0);
1e537948 1280 if (tem && integer_zerop (tem))
f2c4a785
MLI		 1281 return;
1282
1283 rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
1284 if (!rhs)
1285 return;
1286 if (TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
a243fb4a 1287 rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
b8698a0f 1288
f2c4a785
MLI		 1289 /* If this is an OR operation, invert both sides; now, the result
1290 should be always false to get a warning. */
a243fb4a 1291 if (or_op)
f2c4a785 1292 in1_p = !in1_p;
b8698a0f 1293
f2c4a785 1294 tem = build_range_check (UNKNOWN_LOCATION, type, rhs, in1_p, low1, high1);
1e537948 1295 if (tem && integer_zerop (tem))
f2c4a785
MLI		 1296 return;
1297
1298 /* If both expressions have the same operand, if we can merge the
8c2b7f79 1299 ranges, ... */
f2c4a785 1300 if (operand_equal_p (lhs, rhs, 0)
a243fb4a 1301 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
8c2b7f79 1302 in1_p, low1, high1))
a243fb4a 1303 {
8c2b7f79
MP		 1304 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in_p, low, high);
1305 /* ... and if the range test is always false, then warn. */
1306 if (tem && integer_zerop (tem))
1307 {
1308 if (or_op)
1309 warning_at (location, OPT_Wlogical_op,
1310 "logical %<or%> of collectively exhaustive tests is "
1311 "always true");
1312 else
1313 warning_at (location, OPT_Wlogical_op,
1314 "logical %<and%> of mutually exclusive tests is "
1315 "always false");
1316 }
1317 /* Or warn if the operands have exactly the same range, e.g.
1318 A > 0 && A > 0. */
a68ae2e1
MP		 1319 else if (tree_int_cst_equal (low0, low1)
1320 && tree_int_cst_equal (high0, high1))
8c2b7f79
MP		 1321 {
1322 if (or_op)
1323 warning_at (location, OPT_Wlogical_op,
1324 "logical %<or%> of equal expressions");
1325 else
1326 warning_at (location, OPT_Wlogical_op,
1327 "logical %<and%> of equal expressions");
1328 }
63a08740
DM		 1329 }
1330}
1331
05b28fd6
MP		 1332/* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1333 with constant indices. */
1334
1335static tree
1336find_array_ref_with_const_idx_r (tree *expr_p, int *walk_subtrees, void *data)
1337{
1338 tree expr = *expr_p;
1339
1340 if ((TREE_CODE (expr) == ARRAY_REF
1341 || TREE_CODE (expr) == ARRAY_RANGE_REF)
1342 && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)
1343 {
1344 *(bool *) data = true;
1345 *walk_subtrees = 0;
1346 }
1347
1348 return NULL_TREE;
1349}
1350
1351/* Warn if a self-comparison always evaluates to true or false. LOC
1352 is the location of the comparison with code CODE, LHS and RHS are
1353 operands of the comparison. */
1354
1355void
1356warn_tautological_cmp (location_t loc, enum tree_code code, tree lhs, tree rhs)
1357{
1358 if (TREE_CODE_CLASS (code) != tcc_comparison)
1359 return;
1360
f2afe6dd
MP		 1361 /* Don't warn for various macro expansions. */
1362 if (from_macro_expansion_at (loc)
1363 || from_macro_expansion_at (EXPR_LOCATION (lhs))
1364 || from_macro_expansion_at (EXPR_LOCATION (rhs)))
1365 return;
1366
05b28fd6
MP		 1367 /* We do not warn for constants because they are typical of macro
1368 expansions that test for features, sizeof, and similar. */
f479b43d
JM		 1369 if (CONSTANT_CLASS_P (fold_for_warn (lhs))
1370 || CONSTANT_CLASS_P (fold_for_warn (rhs)))
05b28fd6
MP		 1371 return;
1372
1373 /* Don't warn for e.g.
1374 HOST_WIDE_INT n;
1375 ...
1376 if (n == (long) n) ...
1377 */
1378 if ((CONVERT_EXPR_P (lhs) || TREE_CODE (lhs) == NON_LVALUE_EXPR)
1379 || (CONVERT_EXPR_P (rhs) || TREE_CODE (rhs) == NON_LVALUE_EXPR))
1380 return;
1381
173864e8
MP		 1382 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1383 It could be a NaN, and NaN never compares equal to anything, even
1384 itself. */
1385 if (FLOAT_TYPE_P (TREE_TYPE (lhs)) || FLOAT_TYPE_P (TREE_TYPE (rhs)))
1386 return;
1387
05b28fd6
MP		 1388 if (operand_equal_p (lhs, rhs, 0))
1389 {
1390 /* Don't warn about array references with constant indices;
1391 these are likely to come from a macro. */
1392 bool found = false;
1393 walk_tree_without_duplicates (&lhs, find_array_ref_with_const_idx_r,
1394 &found);
1395 if (found)
1396 return;
1397 const bool always_true = (code == EQ_EXPR || code == LE_EXPR
1398 || code == GE_EXPR || code == UNLE_EXPR
1399 || code == UNGE_EXPR || code == UNEQ_EXPR);
1400 if (always_true)
1401 warning_at (loc, OPT_Wtautological_compare,
1402 "self-comparison always evaluates to true");
1403 else
1404 warning_at (loc, OPT_Wtautological_compare,
1405 "self-comparison always evaluates to false");
1406 }
1407}
1408
742938c9
MP		 1409/* Warn about logical not used on the left hand side operand of a comparison.
1410 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
59ea0364 1411 Do not warn if RHS is of a boolean type. */
742938c9
MP		 1412
1413void
1414warn_logical_not_parentheses (location_t location, enum tree_code code,
59ea0364 1415 tree rhs)
742938c9 1416{
59ea0364
MP		 1417 if (TREE_CODE_CLASS (code) != tcc_comparison
1418 || TREE_TYPE (rhs) == NULL_TREE
1419 || TREE_CODE (TREE_TYPE (rhs)) == BOOLEAN_TYPE)
742938c9
MP		 1420 return;
1421
7ccb1a11
JJ		 1422 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1423 !(x == 0) or !(y != 0). */
1424 if ((code == EQ_EXPR || code == NE_EXPR)
1425 && integer_zerop (rhs))
1426 return;
1427
742938c9
MP		 1428 warning_at (location, OPT_Wlogical_not_parentheses,
1429 "logical not is only applied to the left hand side of "
1430 "comparison");
1431}
63a08740 1432
fd4116f4
MLI		 1433/* Warn if EXP contains any computations whose results are not used.
1434 Return true if a warning is printed; false otherwise. LOCUS is the
1435 (potential) location of the expression. */
1436
1437bool
1438warn_if_unused_value (const_tree exp, location_t locus)
1439{
1440 restart:
1441 if (TREE_USED (exp) || TREE_NO_WARNING (exp))
1442 return false;
1443
1444 /* Don't warn about void constructs. This includes casting to void,
1445 void function calls, and statement expressions with a final cast
1446 to void. */
1447 if (VOID_TYPE_P (TREE_TYPE (exp)))
1448 return false;
1449
1450 if (EXPR_HAS_LOCATION (exp))
1451 locus = EXPR_LOCATION (exp);
1452
1453 switch (TREE_CODE (exp))
1454 {
1455 case PREINCREMENT_EXPR:
1456 case POSTINCREMENT_EXPR:
1457 case PREDECREMENT_EXPR:
1458 case POSTDECREMENT_EXPR:
1459 case MODIFY_EXPR:
1460 case INIT_EXPR:
1461 case TARGET_EXPR:
1462 case CALL_EXPR:
1463 case TRY_CATCH_EXPR:
1464 case WITH_CLEANUP_EXPR:
1465 case EXIT_EXPR:
1466 case VA_ARG_EXPR:
1467 return false;
1468
1469 case BIND_EXPR:
1470 /* For a binding, warn if no side effect within it. */
1471 exp = BIND_EXPR_BODY (exp);
1472 goto restart;
1473
1474 case SAVE_EXPR:
1475 case NON_LVALUE_EXPR:
007a787d 1476 case NOP_EXPR:
fd4116f4
MLI		 1477 exp = TREE_OPERAND (exp, 0);
1478 goto restart;
1479
1480 case TRUTH_ORIF_EXPR:
1481 case TRUTH_ANDIF_EXPR:
1482 /* In && or ||, warn if 2nd operand has no side effect. */
1483 exp = TREE_OPERAND (exp, 1);
1484 goto restart;
1485
1486 case COMPOUND_EXPR:
1487 if (warn_if_unused_value (TREE_OPERAND (exp, 0), locus))
1488 return true;
1489 /* Let people do `(foo (), 0)' without a warning. */
1490 if (TREE_CONSTANT (TREE_OPERAND (exp, 1)))
1491 return false;
1492 exp = TREE_OPERAND (exp, 1);
1493 goto restart;
1494
1495 case COND_EXPR:
1496 /* If this is an expression with side effects, don't warn; this
1497 case commonly appears in macro expansions. */
1498 if (TREE_SIDE_EFFECTS (exp))
1499 return false;
1500 goto warn;
1501
1502 case INDIRECT_REF:
1503 /* Don't warn about automatic dereferencing of references, since
1504 the user cannot control it. */
1505 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
1506 {
1507 exp = TREE_OPERAND (exp, 0);
1508 goto restart;
1509 }
1510 /* Fall through. */
1511
1512 default:
1513 /* Referencing a volatile value is a side effect, so don't warn. */
1514 if ((DECL_P (exp) || REFERENCE_CLASS_P (exp))
1515 && TREE_THIS_VOLATILE (exp))
1516 return false;
1517
1518 /* If this is an expression which has no operands, there is no value
1519 to be unused. There are no such language-independent codes,
1520 but front ends may define such. */
1521 if (EXPRESSION_CLASS_P (exp) && TREE_OPERAND_LENGTH (exp) == 0)
1522 return false;
1523
1524 warn:
1525 return warning_at (locus, OPT_Wunused_value, "value computed is not used");
1526 }
1527}
1528
1529
de9c56a4
RG		 1530/* Print a warning about casts that might indicate violation
1531 of strict aliasing rules if -Wstrict-aliasing is used and
3f0a2a47
DM		 1532 strict aliasing mode is in effect. OTYPE is the original
1533 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
de9c56a4 1534
79bedddc 1535bool
3f0a2a47 1536strict_aliasing_warning (tree otype, tree type, tree expr)
de9c56a4 1537{
255d3827
RG		 1538 /* Strip pointer conversion chains and get to the correct original type. */
1539 STRIP_NOPS (expr);
1540 otype = TREE_TYPE (expr);
1541
ac7ee6ad
RG		 1542 if (!(flag_strict_aliasing
1543 && POINTER_TYPE_P (type)
1544 && POINTER_TYPE_P (otype)
1545 && !VOID_TYPE_P (TREE_TYPE (type)))
1546 /* If the type we are casting to is a ref-all pointer
1547 dereferencing it is always valid. */
1548 || TYPE_REF_CAN_ALIAS_ALL (type))
79bedddc
SR		 1549 return false;
1550
1551 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
de9c56a4 1552 && (DECL_P (TREE_OPERAND (expr, 0))
79bedddc 1553 || handled_component_p (TREE_OPERAND (expr, 0))))
de9c56a4
RG		 1554 {
1555 /* Casting the address of an object to non void pointer. Warn
1556 if the cast breaks type based aliasing. */
79bedddc
SR		 1557 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1558 {
1559 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1560 "might break strict-aliasing rules");
1561 return true;
1562 }
de9c56a4
RG		 1563 else
1564 {
b8698a0f 1565 /* warn_strict_aliasing >= 3. This includes the default (3).
79bedddc 1566 Only warn if the cast is dereferenced immediately. */
4862826d 1567 alias_set_type set1 =
79bedddc 1568 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
4862826d 1569 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
de9c56a4 1570
4653cae5
RG		 1571 if (set1 != set2 && set2 != 0
1572 && (set1 == 0 || !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
KZ		 4014 primop1 = force_fit_type (*restype_ptr,
4015 wide_int::from
4016 (primop1,
4017 TYPE_PRECISION (*restype_ptr),
4018 TYPE_SIGN (TREE_TYPE (primop1))),
4019 0, TREE_OVERFLOW (primop1));
fae1b38d 4020 }
b30f223b
RS		 4021 if (type != *restype_ptr)
4022 {
4023 minval = convert (*restype_ptr, minval);
4024 maxval = convert (*restype_ptr, maxval);
4025 }
4026
807e902e
KZ		 4027 min_gt = tree_int_cst_lt (primop1, minval);
4028 max_gt = tree_int_cst_lt (primop1, maxval);
4029 min_lt = tree_int_cst_lt (minval, primop1);
4030 max_lt = tree_int_cst_lt (maxval, primop1);
b30f223b
RS		 4031
4032 val = 0;
4033 /* This used to be a switch, but Genix compiler can't handle that. */
4034 if (code == NE_EXPR)
4035 {
4036 if (max_lt || min_gt)
de7df9eb 4037 val = truthvalue_true_node;
b30f223b
RS		 4038 }
4039 else if (code == EQ_EXPR)
4040 {
4041 if (max_lt || min_gt)
de7df9eb 4042 val = truthvalue_false_node;
b30f223b
RS		 4043 }
4044 else if (code == LT_EXPR)
4045 {
4046 if (max_lt)
de7df9eb 4047 val = truthvalue_true_node;
b30f223b 4048 if (!min_lt)
de7df9eb 4049 val = truthvalue_false_node;
b30f223b
RS		 4050 }
4051 else if (code == GT_EXPR)
4052 {
4053 if (min_gt)
de7df9eb 4054 val = truthvalue_true_node;
b30f223b 4055 if (!max_gt)
de7df9eb 4056 val = truthvalue_false_node;
b30f223b
RS		 4057 }
4058 else if (code == LE_EXPR)
4059 {
4060 if (!max_gt)
de7df9eb 4061 val = truthvalue_true_node;
b30f223b 4062 if (min_gt)
de7df9eb 4063 val = truthvalue_false_node;
b30f223b
RS		 4064 }
4065 else if (code == GE_EXPR)
4066 {
4067 if (!min_lt)
de7df9eb 4068 val = truthvalue_true_node;
b30f223b 4069 if (max_lt)
de7df9eb 4070 val = truthvalue_false_node;
b30f223b
RS		 4071 }
4072
4073 /* If primop0 was sign-extended and unsigned comparison specd,
4074 we did a signed comparison above using the signed type bounds.
4075 But the comparison we output must be unsigned.
4076
4077 Also, for inequalities, VAL is no good; but if the signed
4078 comparison had *any* fixed result, it follows that the
4079 unsigned comparison just tests the sign in reverse
4080 (positive values are LE, negative ones GE).
4081 So we can generate an unsigned comparison
4082 against an extreme value of the signed type. */
4083
4084 if (unsignedp && !unsignedp0)
4085 {
4086 if (val != 0)
4087 switch (code)
4088 {
4089 case LT_EXPR:
4090 case GE_EXPR:
4091 primop1 = TYPE_MIN_VALUE (type);
4092 val = 0;
4093 break;
4094
4095 case LE_EXPR:
4096 case GT_EXPR:
4097 primop1 = TYPE_MAX_VALUE (type);
4098 val = 0;
4099 break;
6d819282
MK		 4100
4101 default:
4102 break;
b30f223b 4103 }
12753674 4104 type = c_common_unsigned_type (type);
b30f223b
RS		 4105 }
4106
d0eccfcd 4107 if (TREE_CODE (primop0) != INTEGER_CST
269adb9d
JM		 4108 /* Don't warn if it's from a (non-system) macro. */
4109 && !(from_macro_expansion_at
4110 (expansion_point_location_if_in_system_header
4111 (EXPR_LOCATION (primop0)))))
b30f223b 4112 {
de7df9eb 4113 if (val == truthvalue_false_node)
50f305ca
MLI		 4114 warning_at (loc, OPT_Wtype_limits,
4115 "comparison is always false due to limited range of data type");
de7df9eb 4116 if (val == truthvalue_true_node)
50f305ca
MLI		 4117 warning_at (loc, OPT_Wtype_limits,
4118 "comparison is always true due to limited range of data type");
b30f223b
RS		 4119 }
4120
4121 if (val != 0)
4122 {
4123 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4124 if (TREE_SIDE_EFFECTS (primop0))
53fb4de3 4125 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
b30f223b
RS		 4126 return val;
4127 }
4128
4129 /* Value is not predetermined, but do the comparison
4130 in the type of the operand that is not constant.
4131 TYPE is already properly set. */
4132 }
9a8ce21f
JG		 4133
4134 /* If either arg is decimal float and the other is float, find the
4135 proper common type to use for comparison. */
6f450181
RB		 4136 else if (real1 && real2
4137 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4138 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))
4139 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
4140
4141 /* If either arg is decimal float and the other is float, fail. */
9a8ce21f
JG		 4142 else if (real1 && real2
4143 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4144 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
6f450181 4145 return 0;
9a8ce21f 4146
b30f223b 4147 else if (real1 && real2
766f6c30
RS		 4148 && (TYPE_PRECISION (TREE_TYPE (primop0))
4149 == TYPE_PRECISION (TREE_TYPE (primop1))))
b30f223b
RS		 4150 type = TREE_TYPE (primop0);
4151
4152 /* If args' natural types are both narrower than nominal type
4153 and both extend in the same manner, compare them
4154 in the type of the wider arg.
4155 Otherwise must actually extend both to the nominal
4156 common type lest different ways of extending
4157 alter the result.
4158 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4159
4160 else if (unsignedp0 == unsignedp1 && real1 == real2
4161 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
4162 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
4163 {
4164 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
ceef8ce4 4165 type = c_common_signed_or_unsigned_type (unsignedp0
8df83eae 4166 || TYPE_UNSIGNED (*restype_ptr),
ceef8ce4 4167 type);
b30f223b
RS		 4168 /* Make sure shorter operand is extended the right way
4169 to match the longer operand. */
ceef8ce4
NB		 4170 primop0
4171 = convert (c_common_signed_or_unsigned_type (unsignedp0,
4172 TREE_TYPE (primop0)),
4173 primop0);
4174 primop1
4175 = convert (c_common_signed_or_unsigned_type (unsignedp1,
4176 TREE_TYPE (primop1)),
4177 primop1);
b30f223b
RS		 4178 }
4179 else
4180 {
4181 /* Here we must do the comparison on the nominal type
4182 using the args exactly as we received them. */
4183 type = *restype_ptr;
4184 primop0 = op0;
4185 primop1 = op1;
4186
4187 if (!real1 && !real2 && integer_zerop (primop1)
8df83eae 4188 && TYPE_UNSIGNED (*restype_ptr))
b30f223b
RS		 4189 {
4190 tree value = 0;
50f305ca
MLI		 4191 /* All unsigned values are >= 0, so we warn. However,
4192 if OP0 is a constant that is >= 0, the signedness of
4193 the comparison isn't an issue, so suppress the
4194 warning. */
4195 bool warn =
8400e75e 4196 warn_type_limits && !in_system_header_at (loc)
50f305ca
MLI		 4197 && !(TREE_CODE (primop0) == INTEGER_CST
4198 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
4199 primop0)))
4200 /* Do not warn for enumeration types. */
4201 && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE);
4202
b30f223b
RS		 4203 switch (code)
4204 {
4205 case GE_EXPR:
50f305ca
MLI		 4206 if (warn)
4207 warning_at (loc, OPT_Wtype_limits,
4208 "comparison of unsigned expression >= 0 is always true");
de7df9eb 4209 value = truthvalue_true_node;
b30f223b
RS		 4210 break;
4211
4212 case LT_EXPR:
50f305ca
MLI		 4213 if (warn)
4214 warning_at (loc, OPT_Wtype_limits,
4215 "comparison of unsigned expression < 0 is always false");
de7df9eb 4216 value = truthvalue_false_node;
6d819282
MK		 4217 break;
4218
4219 default:
4220 break;
b30f223b
RS		 4221 }
4222
4223 if (value != 0)
4224 {
4225 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4226 if (TREE_SIDE_EFFECTS (primop0))
53fb4de3
RS		 4227 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
4228 primop0, value);
b30f223b
RS		 4229 return value;
4230 }
4231 }
4232 }
4233
4234 *op0_ptr = convert (type, primop0);
4235 *op1_ptr = convert (type, primop1);
4236
de7df9eb 4237 *restype_ptr = truthvalue_type_node;
b30f223b
RS		 4238
4239 return 0;
4240}
4241\f
7552da58
JJ		 4242/* Return a tree for the sum or difference (RESULTCODE says which)
4243 of pointer PTROP and integer INTOP. */
4244
4245tree
db3927fb 4246pointer_int_sum (location_t loc, enum tree_code resultcode,
fd9b0f32 4247 tree ptrop, tree intop, bool complain)
7552da58 4248{
6ac01510 4249 tree size_exp, ret;
7552da58 4250
7552da58 4251 /* The result is a pointer of the same type that is being added. */
7552da58
JJ		 4252 tree result_type = TREE_TYPE (ptrop);
4253
4254 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
4255 {
fd9b0f32
PC		 4256 if (complain && warn_pointer_arith)
4257 pedwarn (loc, OPT_Wpointer_arith,
4258 "pointer of type %<void *%> used in arithmetic");
4259 else if (!complain)
4260 return error_mark_node;
7552da58
JJ		 4261 size_exp = integer_one_node;
4262 }
4263 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
4264 {
fd9b0f32
PC		 4265 if (complain && warn_pointer_arith)
4266 pedwarn (loc, OPT_Wpointer_arith,
4267 "pointer to a function used in arithmetic");
4268 else if (!complain)
4269 return error_mark_node;
7552da58
JJ		 4270 size_exp = integer_one_node;
4271 }
7552da58
JJ		 4272 else
4273 size_exp = size_in_bytes (TREE_TYPE (result_type));
4274
6ac01510
ILT		 4275 /* We are manipulating pointer values, so we don't need to warn
4276 about relying on undefined signed overflow. We disable the
4277 warning here because we use integer types so fold won't know that
4278 they are really pointers. */
4279 fold_defer_overflow_warnings ();
4280
7552da58
JJ		 4281 /* If what we are about to multiply by the size of the elements
4282 contains a constant term, apply distributive law
4283 and multiply that constant term separately.
4284 This helps produce common subexpressions. */
7552da58 4285 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
3f75a254 4286 && !TREE_CONSTANT (intop)
7552da58
JJ		 4287 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
4288 && TREE_CONSTANT (size_exp)
4289 /* If the constant comes from pointer subtraction,
4290 skip this optimization--it would cause an error. */
4291 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
4292 /* If the constant is unsigned, and smaller than the pointer size,
4293 then we must skip this optimization. This is because it could cause
4294 an overflow error if the constant is negative but INTOP is not. */
3f75a254 4295 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
7552da58
JJ		 4296 || (TYPE_PRECISION (TREE_TYPE (intop))
4297 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
4298 {
4299 enum tree_code subcode = resultcode;
4300 tree int_type = TREE_TYPE (intop);
4301 if (TREE_CODE (intop) == MINUS_EXPR)
4302 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
4303 /* Convert both subexpression types to the type of intop,
4304 because weird cases involving pointer arithmetic
4305 can result in a sum or difference with different type args. */
ba47d38d
AH		 4306 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
4307 subcode, ptrop,
7552da58
JJ		 4308 convert (int_type, TREE_OPERAND (intop, 1)), 1);
4309 intop = convert (int_type, TREE_OPERAND (intop, 0));
4310 }
4311
4312 /* Convert the integer argument to a type the same size as sizetype
4313 so the multiply won't overflow spuriously. */
7552da58 4314 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
8df83eae 4315 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
35b1a6fa 4316 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
8df83eae 4317 TYPE_UNSIGNED (sizetype)), intop);
7552da58
JJ		 4318
4319 /* Replace the integer argument with a suitable product by the object size.
9e9ef331 4320 Do this multiplication as signed, then convert to the appropriate type
65de6659 4321 for the pointer operation and disregard an overflow that occurred only
9e9ef331
EB		 4322 because of the sign-extension change in the latter conversion. */
4323 {
d90ec4f2
JM		 4324 tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop,
4325 convert (TREE_TYPE (intop), size_exp));
9e9ef331
EB		 4326 intop = convert (sizetype, t);
4327 if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
807e902e 4328 intop = wide_int_to_tree (TREE_TYPE (intop), intop);
9e9ef331 4329 }
5be014d5 4330
280f1ffa 4331 /* Create the sum or difference. */
5be014d5 4332 if (resultcode == MINUS_EXPR)
db3927fb 4333 intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
7552da58 4334
5d49b6a7 4335 ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
6ac01510
ILT		 4336
4337 fold_undefer_and_ignore_overflow_warnings ();
4338
4339 return ret;
7552da58
JJ		 4340}
4341\f
e5a94231
JM		 4342/* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4343 and if NON_CONST is known not to be permitted in an evaluated part
4344 of a constant expression. */
4345
4346tree
4347c_wrap_maybe_const (tree expr, bool non_const)
4348{
4349 bool nowarning = TREE_NO_WARNING (expr);
4350 location_t loc = EXPR_LOCATION (expr);
4351
4352 /* This should never be called for C++. */
4353 if (c_dialect_cxx ())
4354 gcc_unreachable ();
4355
4356 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4357 STRIP_TYPE_NOPS (expr);
4358 expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
4359 C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
4360 if (nowarning)
4361 TREE_NO_WARNING (expr) = 1;
4362 protected_set_expr_location (expr, loc);
4363
4364 return expr;
4365}
4366
928c19bb
JM		 4367/* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4368 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4369 around the SAVE_EXPR if needed so that c_fully_fold does not need
4370 to look inside SAVE_EXPRs. */
4371
4372tree
4373c_save_expr (tree expr)
4374{
4375 bool maybe_const = true;
4376 if (c_dialect_cxx ())
4377 return save_expr (expr);
4378 expr = c_fully_fold (expr, false, &maybe_const);
4379 expr = save_expr (expr);
4380 if (!maybe_const)
e5a94231 4381 expr = c_wrap_maybe_const (expr, true);
928c19bb
JM		 4382 return expr;
4383}
4384
b3c6d2ea
ILT		 4385/* Return whether EXPR is a declaration whose address can never be
4386 NULL. */
4387
4388bool
58f9752a 4389decl_with_nonnull_addr_p (const_tree expr)
b3c6d2ea
ILT		 4390{
4391 return (DECL_P (expr)
4392 && (TREE_CODE (expr) == PARM_DECL
4393 || TREE_CODE (expr) == LABEL_DECL
4394 || !DECL_WEAK (expr)));
4395}
4396
b30f223b 4397/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
85498824
JM		 4398 or for an `if' or `while' statement or ?..: exp. It should already
4399 have been validated to be of suitable type; otherwise, a bad
4400 diagnostic may result.
b30f223b 4401
ba47d38d
AH		 4402 The EXPR is located at LOCATION.
4403
b30f223b
RS		 4404 This preparation consists of taking the ordinary
4405 representation of an expression expr and producing a valid tree
4406 boolean expression describing whether expr is nonzero. We could
de7df9eb 4407 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
b30f223b
RS		 4408 but we optimize comparisons, &&, ||, and !.
4409
de7df9eb 4410 The resulting type should always be `truthvalue_type_node'. */
b30f223b
RS		 4411
4412tree
ba47d38d 4413c_common_truthvalue_conversion (location_t location, tree expr)
b30f223b 4414{
b30f223b
RS		 4415 switch (TREE_CODE (expr))
4416 {
d1a7edaf 4417 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
6f312d18
ZW		 4418 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
4419 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
4420 case ORDERED_EXPR: case UNORDERED_EXPR:
90ec750d
RS		 4421 if (TREE_TYPE (expr) == truthvalue_type_node)
4422 return expr;
c2255bc4 4423 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
90ec750d 4424 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
c2255bc4 4425 goto ret;
90ec750d 4426
b30f223b
RS		 4427 case TRUTH_ANDIF_EXPR:
4428 case TRUTH_ORIF_EXPR:
4429 case TRUTH_AND_EXPR:
4430 case TRUTH_OR_EXPR:
9379fac9 4431 case TRUTH_XOR_EXPR:
90ec750d
RS		 4432 if (TREE_TYPE (expr) == truthvalue_type_node)
4433 return expr;
c2255bc4 4434 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
b8698a0f 4435 c_common_truthvalue_conversion (location,
c2255bc4
AH		 4436 TREE_OPERAND (expr, 0)),
4437 c_common_truthvalue_conversion (location,
4438 TREE_OPERAND (expr, 1)));
4439 goto ret;
18c0f675 4440
18d00205 4441 case TRUTH_NOT_EXPR:
90ec750d
RS		 4442 if (TREE_TYPE (expr) == truthvalue_type_node)
4443 return expr;
c2255bc4
AH		 4444 expr = build1 (TREE_CODE (expr), truthvalue_type_node,
4445 c_common_truthvalue_conversion (location,
4446 TREE_OPERAND (expr, 0)));
4447 goto ret;
18d00205 4448
b30f223b
RS		 4449 case ERROR_MARK:
4450 return expr;
4451
4452 case INTEGER_CST:
d95787e6
RS		 4453 return integer_zerop (expr) ? truthvalue_false_node
4454 : truthvalue_true_node;
b30f223b
RS		 4455
4456 case REAL_CST:
010c4d9c
RS		 4457 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
4458 ? truthvalue_true_node
4459 : truthvalue_false_node;
b30f223b 4460
ab22c1fa
CF		 4461 case FIXED_CST:
4462 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
4463 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
4464 ? truthvalue_true_node
4465 : truthvalue_false_node;
4466
90ec750d 4467 case FUNCTION_DECL:
c9f9eb5d 4468 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
90ec750d
RS		 4469 /* Fall through. */
4470
b30f223b 4471 case ADDR_EXPR:
1998463c 4472 {
f6f08360 4473 tree inner = TREE_OPERAND (expr, 0);
b3c6d2ea 4474 if (decl_with_nonnull_addr_p (inner))
1998463c 4475 {
b3c6d2ea 4476 /* Common Ada/Pascal programmer's mistake. */
ba47d38d
AH		 4477 warning_at (location,
4478 OPT_Waddress,
4479 "the address of %qD will always evaluate as %<true%>",
4480 inner);
1998463c
SB		 4481 return truthvalue_true_node;
4482 }
33766b66 4483 break;
1998463c 4484 }
b30f223b 4485
766f6c30 4486 case COMPLEX_EXPR:
c2255bc4 4487 expr = build_binary_op (EXPR_LOCATION (expr),
ba47d38d 4488 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
b839fb3f 4489 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
ba47d38d
AH		 4490 c_common_truthvalue_conversion (location,
4491 TREE_OPERAND (expr, 0)),
4492 c_common_truthvalue_conversion (location,
4493 TREE_OPERAND (expr, 1)),
766f6c30 4494 0);
c2255bc4 4495 goto ret;
766f6c30 4496
b30f223b
RS		 4497 case NEGATE_EXPR:
4498 case ABS_EXPR:
4499 case FLOAT_EXPR:
8ce94e44 4500 case EXCESS_PRECISION_EXPR:
da7d8304 4501 /* These don't change whether an object is nonzero or zero. */
ba47d38d 4502 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
b30f223b
RS		 4503
4504 case LROTATE_EXPR:
4505 case RROTATE_EXPR:
da7d8304 4506 /* These don't change whether an object is zero or nonzero, but
b30f223b
RS		 4507 we can't ignore them if their second arg has side-effects. */
4508 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
c2255bc4
AH		 4509 {
4510 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
4511 TREE_OPERAND (expr, 1),
b8698a0f 4512 c_common_truthvalue_conversion
c2255bc4
AH		 4513 (location, TREE_OPERAND (expr, 0)));
4514 goto ret;
4515 }
b30f223b 4516 else
ba47d38d
AH		 4517 return c_common_truthvalue_conversion (location,
4518 TREE_OPERAND (expr, 0));
b57062ca 4519
b30f223b
RS		 4520 case COND_EXPR:
4521 /* Distribute the conversion into the arms of a COND_EXPR. */
928c19bb 4522 if (c_dialect_cxx ())
c2255bc4 4523 {
4cc4f2f4
JJ		 4524 tree op1 = TREE_OPERAND (expr, 1);
4525 tree op2 = TREE_OPERAND (expr, 2);
4526 /* In C++ one of the arms might have void type if it is throw. */
4527 if (!VOID_TYPE_P (TREE_TYPE (op1)))
4528 op1 = c_common_truthvalue_conversion (location, op1);
4529 if (!VOID_TYPE_P (TREE_TYPE (op2)))
4530 op2 = c_common_truthvalue_conversion (location, op2);
db3927fb 4531 expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
4cc4f2f4 4532 TREE_OPERAND (expr, 0), op1, op2);
c2255bc4
AH		 4533 goto ret;
4534 }
928c19bb 4535 else
c2255bc4
AH		 4536 {
4537 /* Folding will happen later for C. */
4538 expr = build3 (COND_EXPR, truthvalue_type_node,
4539 TREE_OPERAND (expr, 0),
4540 c_common_truthvalue_conversion (location,
4541 TREE_OPERAND (expr, 1)),
4542 c_common_truthvalue_conversion (location,
4543 TREE_OPERAND (expr, 2)));
4544 goto ret;
4545 }
b30f223b 4546
1043771b 4547 CASE_CONVERT:
1ee44b26
JM		 4548 {
4549 tree totype = TREE_TYPE (expr);
4550 tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
4551
076fecad
PP		 4552 if (POINTER_TYPE_P (totype)
4553 && TREE_CODE (fromtype) == REFERENCE_TYPE)
4554 {
4555 tree inner = expr;
4556 STRIP_NOPS (inner);
4557
4558 if (DECL_P (inner))
4559 warning_at (location,
4560 OPT_Waddress,
4561 "the compiler can assume that the address of "
4562 "%qD will always evaluate to %<true%>",
4563 inner);
4564 }
4565
1ee44b26
JM		 4566 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4567 since that affects how `default_conversion' will behave. */
4568 if (TREE_CODE (totype) == REFERENCE_TYPE
4569 || TREE_CODE (fromtype) == REFERENCE_TYPE)
4570 break;
4571 /* Don't strip a conversion from C++0x scoped enum, since they
4572 don't implicitly convert to other types. */
4573 if (TREE_CODE (fromtype) == ENUMERAL_TYPE
4574 && ENUM_IS_SCOPED (fromtype))
4575 break;
4576 /* If this isn't narrowing the argument, we can ignore it. */
4577 if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
4578 return c_common_truthvalue_conversion (location,
4579 TREE_OPERAND (expr, 0));
4580 }
b30f223b
RS		 4581 break;
4582
e2aab13d 4583 case MODIFY_EXPR:
fbc8d2d3
ILT		 4584 if (!TREE_NO_WARNING (expr)
4585 && warn_parentheses)
4586 {
4587 warning (OPT_Wparentheses,
4588 "suggest parentheses around assignment used as truth value");
4589 TREE_NO_WARNING (expr) = 1;
4590 }
e2aab13d 4591 break;
b57062ca 4592
6d819282
MK		 4593 default:
4594 break;
b30f223b
RS		 4595 }
4596
f0b996c5 4597 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
f0b8d9aa 4598 {
5386338c 4599 tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr));
c2255bc4 4600 expr = (build_binary_op
ba47d38d
AH		 4601 (EXPR_LOCATION (expr),
4602 (TREE_SIDE_EFFECTS (expr)
f0b8d9aa 4603 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
c9f9eb5d
AH		 4604 c_common_truthvalue_conversion
4605 (location,
4606 build_unary_op (location, REALPART_EXPR, t, 0)),
4607 c_common_truthvalue_conversion
4608 (location,
4609 build_unary_op (location, IMAGPART_EXPR, t, 0)),
f0b8d9aa 4610 0));
c2255bc4 4611 goto ret;
f0b8d9aa 4612 }
f0b996c5 4613
ab22c1fa
CF		 4614 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
4615 {
4616 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
4617 FCONST0 (TYPE_MODE
4618 (TREE_TYPE (expr))));
ca80e52b 4619 return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
ab22c1fa 4620 }
c2255bc4
AH		 4621 else
4622 return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
ab22c1fa 4623
c2255bc4
AH		 4624 ret:
4625 protected_set_expr_location (expr, location);
4626 return expr;
b30f223b
RS		 4627}
4628\f
9bc15050
RG		 4629static void def_builtin_1 (enum built_in_function fncode,
4630 const char *name,
4631 enum built_in_class fnclass,
4632 tree fntype, tree libtype,
4633 bool both_p, bool fallback_p, bool nonansi_p,
4634 tree fnattrs, bool implicit_p);
fc2aaf30 4635
3932261a
MM		 4636
4637/* Apply the TYPE_QUALS to the new DECL. */
4638
4639void
35b1a6fa 4640c_apply_type_quals_to_decl (int type_quals, tree decl)
3932261a 4641{
4b011bbf 4642 tree type = TREE_TYPE (decl);
9f63daea 4643
5a6159dd
AP		 4644 if (type == error_mark_node)
4645 return;
4b011bbf 4646
329af3c7
JM		 4647 if ((type_quals & TYPE_QUAL_CONST)
4648 || (type && TREE_CODE (type) == REFERENCE_TYPE))
4649 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4650 constructor can produce constant init, so rely on cp_finish_decl to
4651 clear TREE_READONLY if the variable has non-constant init. */
3932261a
MM		 4652 TREE_READONLY (decl) = 1;
4653 if (type_quals & TYPE_QUAL_VOLATILE)
4654 {
4655 TREE_SIDE_EFFECTS (decl) = 1;
4656 TREE_THIS_VOLATILE (decl) = 1;
4657 }
6946bc60 4658 if (type_quals & TYPE_QUAL_RESTRICT)
3932261a 4659 {
4b011bbf
JM		 4660 while (type && TREE_CODE (type) == ARRAY_TYPE)
4661 /* Allow 'restrict' on arrays of pointers.
4662 FIXME currently we just ignore it. */
4663 type = TREE_TYPE (type);
4664 if (!type
4665 || !POINTER_TYPE_P (type)
4666 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
bda67431 4667 error ("invalid use of %<restrict%>");
3932261a
MM		 4668 }
4669}
4670
ca752f39 4671struct c_type_hasher : ggc_ptr_hash<tree_node>
2a22f99c
TS		 4672{
4673 static hashval_t hash (tree);
4674 static bool equal (tree, tree);
4675};
4676
6de9cd9a
DN		 4677/* Hash function for the problem of multiple type definitions in
4678 different files. This must hash all types that will compare
4679 equal via comptypes to the same value. In practice it hashes
9cf737f8 4680 on some of the simple stuff and leaves the details to comptypes. */
6de9cd9a 4681
2a22f99c
TS		 4682hashval_t
4683c_type_hasher::hash (tree t)
6de9cd9a 4684{
a19e4d44 4685 int n_elements;
6de9cd9a 4686 int shift, size;
6de9cd9a
DN		 4687 tree t2;
4688 switch (TREE_CODE (t))
4689 {
8c27b7d4 4690 /* For pointers, hash on pointee type plus some swizzling. */
325c3691 4691 case POINTER_TYPE:
2a22f99c 4692 return hash (TREE_TYPE (t)) ^ 0x3003003;
325c3691
RH		 4693 /* Hash on number of elements and total size. */
4694 case ENUMERAL_TYPE:
4695 shift = 3;
4696 t2 = TYPE_VALUES (t);
4697 break;
4698 case RECORD_TYPE:
4699 shift = 0;
4700 t2 = TYPE_FIELDS (t);
4701 break;
4702 case QUAL_UNION_TYPE:
4703 shift = 1;
4704 t2 = TYPE_FIELDS (t);
4705 break;
4706 case UNION_TYPE:
4707 shift = 2;
4708 t2 = TYPE_FIELDS (t);
4709 break;
4710 default:
366de0ce 4711 gcc_unreachable ();
6de9cd9a 4712 }
a19e4d44
NF		 4713 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4714 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4715 n_elements = list_length (t2);
6fc3c3c0
TT		 4716 /* We might have a VLA here. */
4717 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
4718 size = 0;
4719 else
4720 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
a19e4d44 4721 return ((size << 24) | (n_elements << shift));
6de9cd9a
DN		 4722}
4723
2a22f99c
TS		 4724bool
4725c_type_hasher::equal (tree t1, tree t2)
4726{
4727 return lang_hooks.types_compatible_p (t1, t2);
4728}
4729
4730static GTY(()) hash_table<c_type_hasher> *type_hash_table;
4fe52ce9 4731
41472af8 4732/* Return the typed-based alias set for T, which may be an expression
3bdf5ad1 4733 or a type. Return -1 if we don't do anything special. */
41472af8 4734
4862826d 4735alias_set_type
35b1a6fa 4736c_common_get_alias_set (tree t)
41472af8 4737{
08bc2431 4738 tree u;
35b1a6fa 4739
cb9c2485
JM		 4740 /* For VLAs, use the alias set of the element type rather than the
4741 default of alias set 0 for types compared structurally. */
4742 if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
4743 {
4744 if (TREE_CODE (t) == ARRAY_TYPE)
4745 return get_alias_set (TREE_TYPE (t));
4746 return -1;
4747 }
4748
08bc2431
MM		 4749 /* Permit type-punning when accessing a union, provided the access
4750 is directly through the union. For example, this code does not
4751 permit taking the address of a union member and then storing
4752 through it. Even the type-punning allowed here is a GCC
4753 extension, albeit a common and useful one; the C standard says
4754 that such accesses have implementation-defined behavior. */
4755 for (u = t;
4756 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4757 u = TREE_OPERAND (u, 0))
4758 if (TREE_CODE (u) == COMPONENT_REF
4759 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4760 return 0;
ece32014 4761
74d86f4f 4762 /* That's all the expressions we handle specially. */
3f75a254 4763 if (!TYPE_P (t))
74d86f4f
RH		 4764 return -1;
4765
95bd1dd7 4766 /* The C standard guarantees that any object may be accessed via an
74d86f4f
RH		 4767 lvalue that has character type. */
4768 if (t == char_type_node
4769 || t == signed_char_type_node
4770 || t == unsigned_char_type_node)
3bdf5ad1 4771 return 0;
3932261a 4772
f824e5c3
RK		 4773 /* The C standard specifically allows aliasing between signed and
4774 unsigned variants of the same type. We treat the signed
4775 variant as canonical. */
8df83eae 4776 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
8f215dce 4777 {
ceef8ce4 4778 tree t1 = c_common_signed_type (t);
f824e5c3 4779
8f215dce
JJ		 4780 /* t1 == t can happen for boolean nodes which are always unsigned. */
4781 if (t1 != t)
4782 return get_alias_set (t1);
4783 }
ece32014 4784
6de9cd9a
DN		 4785 /* Handle the case of multiple type nodes referring to "the same" type,
4786 which occurs with IMA. These share an alias set. FIXME: Currently only
4787 C90 is handled. (In C99 type compatibility is not transitive, which
4788 complicates things mightily. The alias set splay trees can theoretically
4789 represent this, but insertion is tricky when you consider all the
4790 different orders things might arrive in.) */
4791
4792 if (c_language != clk_c || flag_isoc99)
4793 return -1;
4794
9cf737f8 4795 /* Save time if there's only one input file. */
d974312d 4796 if (num_in_fnames == 1)
6de9cd9a
DN		 4797 return -1;
4798
4799 /* Pointers need special handling if they point to any type that
4800 needs special handling (below). */
4801 if (TREE_CODE (t) == POINTER_TYPE)
4802 {
4803 tree t2;
4804 /* Find bottom type under any nested POINTERs. */
9f63daea 4805 for (t2 = TREE_TYPE (t);
762f7d9d
TT		 4806 TREE_CODE (t2) == POINTER_TYPE;
4807 t2 = TREE_TYPE (t2))
4808 ;
a868811e
MP		 4809 if (!RECORD_OR_UNION_TYPE_P (t2)
4810 && TREE_CODE (t2) != ENUMERAL_TYPE)
762f7d9d 4811 return -1;
6de9cd9a 4812 if (TYPE_SIZE (t2) == 0)
762f7d9d 4813 return -1;
6de9cd9a
DN		 4814 }
4815 /* These are the only cases that need special handling. */
a868811e 4816 if (!RECORD_OR_UNION_TYPE_P (t)
6de9cd9a 4817 && TREE_CODE (t) != ENUMERAL_TYPE
6de9cd9a
DN		 4818 && TREE_CODE (t) != POINTER_TYPE)
4819 return -1;
4820 /* Undefined? */
4821 if (TYPE_SIZE (t) == 0)
4822 return -1;
4823
9f63daea 4824 /* Look up t in hash table. Only one of the compatible types within each
6de9cd9a
DN		 4825 alias set is recorded in the table. */
4826 if (!type_hash_table)
2a22f99c
TS		 4827 type_hash_table = hash_table<c_type_hasher>::create_ggc (1021);
4828 tree *slot = type_hash_table->find_slot (t, INSERT);
6de9cd9a 4829 if (*slot != NULL)
6a3203c8
AP		 4830 {
4831 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
4832 return TYPE_ALIAS_SET ((tree)*slot);
4833 }
6de9cd9a
DN		 4834 else
4835 /* Our caller will assign and record (in t) a new alias set; all we need
4836 to do is remember t in the hash table. */
4837 *slot = t;
4838
3bdf5ad1 4839 return -1;
41472af8 4840}
0213a355 4841\f
c2255bc4 4842/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
296674db 4843 the IS_SIZEOF parameter indicates which operator is being applied.
c2255bc4
AH		 4844 The COMPLAIN flag controls whether we should diagnose possibly
4845 ill-formed constructs or not. LOC is the location of the SIZEOF or
296674db
JM		 4846 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4847 a type in any context should be returned, rather than the normal
4848 alignment for that type. */
03a08664 4849
0213a355 4850tree
c2255bc4 4851c_sizeof_or_alignof_type (location_t loc,
296674db
JM		 4852 tree type, bool is_sizeof, bool min_alignof,
4853 int complain)
0213a355 4854{
fa72b064
GDR		 4855 const char *op_name;
4856 tree value = NULL;
4857 enum tree_code type_code = TREE_CODE (type);
35b1a6fa 4858
03a08664 4859 op_name = is_sizeof ? "sizeof" : "__alignof__";
35b1a6fa 4860
fa72b064 4861 if (type_code == FUNCTION_TYPE)
0213a355 4862 {
03a08664 4863 if (is_sizeof)
fa72b064 4864 {
44d90fe1
PC		 4865 if (complain && warn_pointer_arith)
4866 pedwarn (loc, OPT_Wpointer_arith,
fcf73884 4867 "invalid application of %<sizeof%> to a function type");
5ade1ed2
DG		 4868 else if (!complain)
4869 return error_mark_node;
fa72b064
GDR		 4870 value = size_one_node;
4871 }
4872 else
d19fa6b5
JM		 4873 {
4874 if (complain)
4875 {
4876 if (c_dialect_cxx ())
c1771a20 4877 pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit "
d19fa6b5
JM		 4878 "%<alignof%> applied to a function type");
4879 else
c1771a20 4880 pedwarn (loc, OPT_Wpedantic, "ISO C does not permit "
d19fa6b5
JM		 4881 "%<_Alignof%> applied to a function type");
4882 }
4883 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
4884 }
fa72b064
GDR		 4885 }
4886 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
4887 {
35b1a6fa 4888 if (type_code == VOID_TYPE
44d90fe1
PC		 4889 && complain && warn_pointer_arith)
4890 pedwarn (loc, OPT_Wpointer_arith,
fcf73884 4891 "invalid application of %qs to a void type", op_name);
5ade1ed2
DG		 4892 else if (!complain)
4893 return error_mark_node;
fa72b064 4894 value = size_one_node;
0213a355 4895 }
73ac190a
PC		 4896 else if (!COMPLETE_TYPE_P (type)
4897 && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE))
0213a355 4898 {
ea793912 4899 if (complain)
73ac190a 4900 error_at (loc, "invalid application of %qs to incomplete type %qT",
c2255bc4 4901 op_name, type);
cb6addf4 4902 return error_mark_node;
0213a355 4903 }
73ac190a
PC		 4904 else if (c_dialect_cxx () && type_code == ARRAY_TYPE
4905 && !COMPLETE_TYPE_P (TREE_TYPE (type)))
4906 {
4907 if (complain)
4908 error_at (loc, "invalid application of %qs to array type %qT of "
4909 "incomplete element type", op_name, type);
4910 return error_mark_node;
4911 }
0213a355 4912 else
fa72b064 4913 {
03a08664 4914 if (is_sizeof)
fa72b064 4915 /* Convert in case a char is more than one unit. */
db3927fb
AH		 4916 value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
4917 size_int (TYPE_PRECISION (char_type_node)
4918 / BITS_PER_UNIT));
296674db 4919 else if (min_alignof)
2793eeab 4920 value = size_int (min_align_of_type (type));
fa72b064 4921 else
a4e9ffe5 4922 value = size_int (TYPE_ALIGN_UNIT (type));
fa72b064 4923 }
0213a355 4924
3ac8781c
RG		 4925 /* VALUE will have the middle-end integer type sizetype.
4926 However, we should really return a value of type `size_t',
4927 which is just a typedef for an ordinary integer type. */
db3927fb 4928 value = fold_convert_loc (loc, size_type_node, value);
35b1a6fa 4929
fa72b064 4930 return value;
0213a355
JM		 4931}
4932
4933/* Implement the __alignof keyword: Return the minimum required
837edd5f
GK		 4934 alignment of EXPR, measured in bytes. For VAR_DECLs,
4935 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
c2255bc4
AH		 4936 from an "aligned" __attribute__ specification). LOC is the
4937 location of the ALIGNOF operator. */
7f4edbcb 4938
0213a355 4939tree
c2255bc4 4940c_alignof_expr (location_t loc, tree expr)
0213a355
JM		 4941{
4942 tree t;
4943
837edd5f 4944 if (VAR_OR_FUNCTION_DECL_P (expr))
a4e9ffe5 4945 t = size_int (DECL_ALIGN_UNIT (expr));
35b1a6fa 4946
0213a355
JM		 4947 else if (TREE_CODE (expr) == COMPONENT_REF
4948 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
4949 {
c2255bc4 4950 error_at (loc, "%<__alignof%> applied to a bit-field");
0213a355
JM		 4951 t = size_one_node;
4952 }
4953 else if (TREE_CODE (expr) == COMPONENT_REF
173bf5be 4954 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
a4e9ffe5 4955 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
35b1a6fa 4956
22d03525 4957 else if (INDIRECT_REF_P (expr))
0213a355
JM		 4958 {
4959 tree t = TREE_OPERAND (expr, 0);
4960 tree best = t;
4961 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
35b1a6fa 4962
1043771b 4963 while (CONVERT_EXPR_P (t)
173bf5be 4964 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
0213a355
JM		 4965 {
4966 int thisalign;
4967
4968 t = TREE_OPERAND (t, 0);
4969 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4970 if (thisalign > bestalign)
4971 best = t, bestalign = thisalign;
4972 }
c2255bc4 4973 return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
0213a355
JM		 4974 }
4975 else
c2255bc4 4976 return c_alignof (loc, TREE_TYPE (expr));
0213a355 4977
db3927fb 4978 return fold_convert_loc (loc, size_type_node, t);
0213a355
JM		 4979}
4980\f
df061a43
RS		 4981/* Handle C and C++ default attributes. */
4982
4983enum built_in_attribute
4984{
4985#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4986#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
e384e6b5 4987#define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
df061a43
RS		 4988#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4989#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
df061a43
RS		 4990#include "builtin-attrs.def"
4991#undef DEF_ATTR_NULL_TREE
4992#undef DEF_ATTR_INT
e384e6b5 4993#undef DEF_ATTR_STRING
df061a43
RS		 4994#undef DEF_ATTR_IDENT
4995#undef DEF_ATTR_TREE_LIST
df061a43
RS		 4996 ATTR_LAST
4997};
4998
4999static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
5000
35b1a6fa 5001static void c_init_attributes (void);
df061a43 5002
a0274e3e 5003enum c_builtin_type
7f4edbcb 5004{
10841285
MM		 5005#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5006#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5007#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5008#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5009#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5010#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
10a0d495 5011#define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
f6a7cffc
TS		 5012#define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5013 ARG6) NAME,
5014#define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5015 ARG6, ARG7) NAME,
5016#define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5017 ARG6, ARG7, ARG8) NAME,
d9a6bd32
JJ		 5018#define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5019 ARG6, ARG7, ARG8, ARG9) NAME,
5020#define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5021 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5022#define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5023 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
10841285
MM		 5024#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5025#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5026#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
08291658 5027#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
10a0d495 5028#define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
f6a7cffc 5029#define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
56a9f6bc 5030 NAME,
3e32ee19
NS		 5031#define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5032 ARG6) NAME,
56a9f6bc
TS		 5033#define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5034 ARG6, ARG7) NAME,
10841285
MM		 5035#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5036#include "builtin-types.def"
5037#undef DEF_PRIMITIVE_TYPE
5038#undef DEF_FUNCTION_TYPE_0
5039#undef DEF_FUNCTION_TYPE_1
5040#undef DEF_FUNCTION_TYPE_2
5041#undef DEF_FUNCTION_TYPE_3
5042#undef DEF_FUNCTION_TYPE_4
10a0d495
JJ		 5043#undef DEF_FUNCTION_TYPE_5
5044#undef DEF_FUNCTION_TYPE_6
a0274e3e 5045#undef DEF_FUNCTION_TYPE_7
acf0174b 5046#undef DEF_FUNCTION_TYPE_8
d9a6bd32
JJ		 5047#undef DEF_FUNCTION_TYPE_9
5048#undef DEF_FUNCTION_TYPE_10
5049#undef DEF_FUNCTION_TYPE_11
10841285
MM		 5050#undef DEF_FUNCTION_TYPE_VAR_0
5051#undef DEF_FUNCTION_TYPE_VAR_1
5052#undef DEF_FUNCTION_TYPE_VAR_2
08291658 5053#undef DEF_FUNCTION_TYPE_VAR_3
10a0d495
JJ		 5054#undef DEF_FUNCTION_TYPE_VAR_4
5055#undef DEF_FUNCTION_TYPE_VAR_5
3e32ee19 5056#undef DEF_FUNCTION_TYPE_VAR_6
56a9f6bc 5057#undef DEF_FUNCTION_TYPE_VAR_7
10841285 5058#undef DEF_POINTER_TYPE
a0274e3e
JJ		 5059 BT_LAST
5060};
5061
5062typedef enum c_builtin_type builtin_type;
10841285 5063
a0274e3e
JJ		 5064/* A temporary array for c_common_nodes_and_builtins. Used in
5065 communication with def_fn_type. */
5066static tree builtin_types[(int) BT_LAST + 1];
10841285 5067
a0274e3e
JJ		 5068/* A helper function for c_common_nodes_and_builtins. Build function type
5069 for DEF with return type RET and N arguments. If VAR is true, then the
5070 function should be variadic after those N arguments.
5071
5072 Takes special care not to ICE if any of the types involved are
5073 error_mark_node, which indicates that said type is not in fact available
5074 (see builtin_type_for_size). In which case the function type as a whole
5075 should be error_mark_node. */
5076
5077static void
5078def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
5079{
8242dd04
NF		 5080 tree t;
5081 tree *args = XALLOCAVEC (tree, n);
a0274e3e
JJ		 5082 va_list list;
5083 int i;
5084
5085 va_start (list, n);
5086 for (i = 0; i < n; ++i)
5087 {
d75d71e0 5088 builtin_type a = (builtin_type) va_arg (list, int);
a0274e3e
JJ		 5089 t = builtin_types[a];
5090 if (t == error_mark_node)
5091 goto egress;
8242dd04 5092 args[i] = t;
a0274e3e 5093 }
a0274e3e 5094
a0274e3e
JJ		 5095 t = builtin_types[ret];
5096 if (t == error_mark_node)
5097 goto egress;
8242dd04
NF		 5098 if (var)
5099 t = build_varargs_function_type_array (t, n, args);
5100 else
5101 t = build_function_type_array (t, n, args);
a0274e3e
JJ		 5102
5103 egress:
5104 builtin_types[def] = t;
0edf1bb2 5105 va_end (list);
a0274e3e
JJ		 5106}
5107
c6d86fce
ILT		 5108/* Build builtin functions common to both C and C++ language
5109 frontends. */
5110
5111static void
5112c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
5113{
5114#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5115 builtin_types[ENUM] = VALUE;
5116#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5117 def_fn_type (ENUM, RETURN, 0, 0);
5118#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5119 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5120#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5121 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5122#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5123 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5124#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5125 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5126#define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5127 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5128#define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5129 ARG6) \
5130 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5131#define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5132 ARG6, ARG7) \
5133 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
acf0174b
JJ		 5134#define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5135 ARG6, ARG7, ARG8) \
5136 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5137 ARG7, ARG8);
d9a6bd32
JJ		 5138#define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5139 ARG6, ARG7, ARG8, ARG9) \
5140 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5141 ARG7, ARG8, ARG9);
5142#define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5143 ARG6, ARG7, ARG8, ARG9, ARG10) \
5144 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5145 ARG7, ARG8, ARG9, ARG10);
5146#define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5147 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5148 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5149 ARG7, ARG8, ARG9, ARG10, ARG11);
c6d86fce
ILT		 5150#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5151 def_fn_type (ENUM, RETURN, 1, 0);
5152#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5153 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5154#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5155 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5156#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5157 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5158#define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5159 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5160#define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5161 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3e32ee19
NS		 5162#define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5163 ARG6) \
5164 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
56a9f6bc
TS		 5165#define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5166 ARG6, ARG7) \
5167 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
c6d86fce
ILT		 5168#define DEF_POINTER_TYPE(ENUM, TYPE) \
5169 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5170
5171#include "builtin-types.def"
5172
5173#undef DEF_PRIMITIVE_TYPE
f6a7cffc 5174#undef DEF_FUNCTION_TYPE_0
c6d86fce
ILT		 5175#undef DEF_FUNCTION_TYPE_1
5176#undef DEF_FUNCTION_TYPE_2
5177#undef DEF_FUNCTION_TYPE_3
5178#undef DEF_FUNCTION_TYPE_4
5179#undef DEF_FUNCTION_TYPE_5
5180#undef DEF_FUNCTION_TYPE_6
f6a7cffc
TS		 5181#undef DEF_FUNCTION_TYPE_7
5182#undef DEF_FUNCTION_TYPE_8
d9a6bd32
JJ		 5183#undef DEF_FUNCTION_TYPE_9
5184#undef DEF_FUNCTION_TYPE_10
5185#undef DEF_FUNCTION_TYPE_11
c6d86fce
ILT		 5186#undef DEF_FUNCTION_TYPE_VAR_0
5187#undef DEF_FUNCTION_TYPE_VAR_1
5188#undef DEF_FUNCTION_TYPE_VAR_2
5189#undef DEF_FUNCTION_TYPE_VAR_3
5190#undef DEF_FUNCTION_TYPE_VAR_4
5191#undef DEF_FUNCTION_TYPE_VAR_5
3e32ee19 5192#undef DEF_FUNCTION_TYPE_VAR_6
56a9f6bc 5193#undef DEF_FUNCTION_TYPE_VAR_7
c6d86fce
ILT		 5194#undef DEF_POINTER_TYPE
5195 builtin_types[(int) BT_LAST] = NULL_TREE;
5196
5197 c_init_attributes ();
5198
5199#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5200 NONANSI_P, ATTRS, IMPLICIT, COND) \
5201 if (NAME && COND) \
5202 def_builtin_1 (ENUM, NAME, CLASS, \
5203 builtin_types[(int) TYPE], \
5204 builtin_types[(int) LIBTYPE], \
5205 BOTH_P, FALLBACK_P, NONANSI_P, \
5206 built_in_attributes[(int) ATTRS], IMPLICIT);
5207#include "builtins.def"
c6d86fce 5208
8de7ef2a
UB		 5209 targetm.init_builtins ();
5210
384c400a 5211 build_common_builtin_nodes ();
939b37da 5212
b72271b9 5213 if (flag_cilkplus)
939b37da 5214 cilk_init_builtins ();
c6d86fce
ILT		 5215}
5216
c1b61fca
JM		 5217/* Like get_identifier, but avoid warnings about null arguments when
5218 the argument may be NULL for targets where GCC lacks stdint.h type
5219 information. */
5220
5221static inline tree
5222c_get_ident (const char *id)
5223{
5224 return get_identifier (id);
5225}
5226
a0274e3e
JJ		 5227/* Build tree nodes and builtin functions common to both C and C++ language
5228 frontends. */
5229
5230void
5231c_common_nodes_and_builtins (void)
5232{
b6baa67d
KVH		 5233 int char16_type_size;
5234 int char32_type_size;
eaa7c03f
JM		 5235 int wchar_type_size;
5236 tree array_domain_type;
9f720c3e 5237 tree va_list_ref_type_node;
daf68dd7 5238 tree va_list_arg_type_node;
78a7c317 5239 int i;
d3707adb 5240
1a072294 5241 build_common_tree_nodes (flag_signed_char, flag_short_double);
fce5dddd 5242
eaa7c03f 5243 /* Define `int' and `char' first so that dbx will output them first. */
6496a589 5244 record_builtin_type (RID_INT, NULL, integer_type_node);
eaa7c03f
JM		 5245 record_builtin_type (RID_CHAR, "char", char_type_node);
5246
5247 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5248 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5249 but not C. Are the conditionals here needed? */
37fa72e9 5250 if (c_dialect_cxx ())
6496a589 5251 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
eaa7c03f
JM		 5252 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
5253 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
5254 record_builtin_type (RID_MAX, "long unsigned int",
5255 long_unsigned_type_node);
78a7c317
DD		 5256
5257 for (i = 0; i < NUM_INT_N_ENTS; i ++)
a6766312 5258 {
78a7c317
DD		 5259 char name[25];
5260
5261 sprintf (name, "__int%d", int_n_data[i].bitsize);
17958621 5262 record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name,
78a7c317
DD		 5263 int_n_trees[i].signed_type);
5264 sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
17958621 5265 record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type);
a6766312 5266 }
78a7c317 5267
37fa72e9 5268 if (c_dialect_cxx ())
eaa7c03f
JM		 5269 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
5270 record_builtin_type (RID_MAX, "long long int",
5271 long_long_integer_type_node);
5272 record_builtin_type (RID_MAX, "long long unsigned int",
5273 long_long_unsigned_type_node);
37fa72e9 5274 if (c_dialect_cxx ())
eaa7c03f
JM		 5275 record_builtin_type (RID_MAX, "long long unsigned",
5276 long_long_unsigned_type_node);
5277 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
5278 record_builtin_type (RID_MAX, "short unsigned int",
5279 short_unsigned_type_node);
37fa72e9 5280 if (c_dialect_cxx ())
eaa7c03f
JM		 5281 record_builtin_type (RID_MAX, "unsigned short",
5282 short_unsigned_type_node);
5283
5284 /* Define both `signed char' and `unsigned char'. */
5285 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
5286 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
5287
b0c48229
NB		 5288 /* These are types that c_common_type_for_size and
5289 c_common_type_for_mode use. */
c2255bc4
AH		 5290 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5291 TYPE_DECL, NULL_TREE,
ae2bcd98 5292 intQI_type_node));
c2255bc4
AH		 5293 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5294 TYPE_DECL, NULL_TREE,
ae2bcd98 5295 intHI_type_node));
c2255bc4
AH		 5296 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5297 TYPE_DECL, NULL_TREE,
ae2bcd98 5298 intSI_type_node));
c2255bc4
AH		 5299 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5300 TYPE_DECL, NULL_TREE,
ae2bcd98 5301 intDI_type_node));
eaa7c03f 5302#if HOST_BITS_PER_WIDE_INT >= 64
78a7c317
DD		 5303 /* Note that this is different than the __int128 type that's part of
5304 the generic __intN support. */
1e1b8649 5305 if (targetm.scalar_mode_supported_p (TImode))
c2255bc4
AH		 5306 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5307 TYPE_DECL,
1e1b8649
AP		 5308 get_identifier ("__int128_t"),
5309 intTI_type_node));
eaa7c03f 5310#endif
c2255bc4
AH		 5311 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5312 TYPE_DECL, NULL_TREE,
ae2bcd98 5313 unsigned_intQI_type_node));
c2255bc4
AH		 5314 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5315 TYPE_DECL, NULL_TREE,
ae2bcd98 5316 unsigned_intHI_type_node));
c2255bc4
AH		 5317 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5318 TYPE_DECL, NULL_TREE,
ae2bcd98 5319 unsigned_intSI_type_node));
c2255bc4
AH		 5320 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5321 TYPE_DECL, NULL_TREE,
ae2bcd98 5322 unsigned_intDI_type_node));
eaa7c03f 5323#if HOST_BITS_PER_WIDE_INT >= 64
1e1b8649 5324 if (targetm.scalar_mode_supported_p (TImode))
c2255bc4
AH		 5325 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5326 TYPE_DECL,
1e1b8649
AP		 5327 get_identifier ("__uint128_t"),
5328 unsigned_intTI_type_node));
eaa7c03f
JM		 5329#endif
5330
5331 /* Create the widest literal types. */
5332 widest_integer_literal_type_node
5333 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
c2255bc4
AH		 5334 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5335 TYPE_DECL, NULL_TREE,
ae2bcd98 5336 widest_integer_literal_type_node));
eaa7c03f
JM		 5337
5338 widest_unsigned_literal_type_node
5339 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
c2255bc4
AH		 5340 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5341 TYPE_DECL, NULL_TREE,
ae2bcd98 5342 widest_unsigned_literal_type_node));
eaa7c03f 5343
c9f8536c 5344 signed_size_type_node = c_common_signed_type (size_type_node);
eaa7c03f 5345
d1c38823
ZD		 5346 pid_type_node =
5347 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
5348
6496a589
KG		 5349 record_builtin_type (RID_FLOAT, NULL, float_type_node);
5350 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
eaa7c03f
JM		 5351 record_builtin_type (RID_MAX, "long double", long_double_type_node);
5352
9a8ce21f
JG		 5353 /* Only supported decimal floating point extension if the target
5354 actually supports underlying modes. */
b8698a0f 5355 if (targetm.scalar_mode_supported_p (SDmode)
9a8ce21f
JG		 5356 && targetm.scalar_mode_supported_p (DDmode)
5357 && targetm.scalar_mode_supported_p (TDmode))
5358 {
5359 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
5360 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
5361 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
5362 }
5363
ab22c1fa
CF		 5364 if (targetm.fixed_point_supported_p ())
5365 {
5366 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
5367 record_builtin_type (RID_FRACT, NULL, fract_type_node);
5368 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
5369 record_builtin_type (RID_MAX, "long long _Fract",
5370 long_long_fract_type_node);
5371 record_builtin_type (RID_MAX, "unsigned short _Fract",
5372 unsigned_short_fract_type_node);
5373 record_builtin_type (RID_MAX, "unsigned _Fract",
5374 unsigned_fract_type_node);
5375 record_builtin_type (RID_MAX, "unsigned long _Fract",
5376 unsigned_long_fract_type_node);
5377 record_builtin_type (RID_MAX, "unsigned long long _Fract",
5378 unsigned_long_long_fract_type_node);
5379 record_builtin_type (RID_MAX, "_Sat short _Fract",
5380 sat_short_fract_type_node);
5381 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
5382 record_builtin_type (RID_MAX, "_Sat long _Fract",
5383 sat_long_fract_type_node);
5384 record_builtin_type (RID_MAX, "_Sat long long _Fract",
5385 sat_long_long_fract_type_node);
5386 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
5387 sat_unsigned_short_fract_type_node);
5388 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
5389 sat_unsigned_fract_type_node);
5390 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
5391 sat_unsigned_long_fract_type_node);
5392 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
5393 sat_unsigned_long_long_fract_type_node);
5394 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
5395 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
5396 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
5397 record_builtin_type (RID_MAX, "long long _Accum",
5398 long_long_accum_type_node);
5399 record_builtin_type (RID_MAX, "unsigned short _Accum",
5400 unsigned_short_accum_type_node);
5401 record_builtin_type (RID_MAX, "unsigned _Accum",
5402 unsigned_accum_type_node);
5403 record_builtin_type (RID_MAX, "unsigned long _Accum",
5404 unsigned_long_accum_type_node);
5405 record_builtin_type (RID_MAX, "unsigned long long _Accum",
5406 unsigned_long_long_accum_type_node);
5407 record_builtin_type (RID_MAX, "_Sat short _Accum",
5408 sat_short_accum_type_node);
5409 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
5410 record_builtin_type (RID_MAX, "_Sat long _Accum",
5411 sat_long_accum_type_node);
5412 record_builtin_type (RID_MAX, "_Sat long long _Accum",
5413 sat_long_long_accum_type_node);
5414 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
5415 sat_unsigned_short_accum_type_node);
5416 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
5417 sat_unsigned_accum_type_node);
5418 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
5419 sat_unsigned_long_accum_type_node);
5420 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
5421 sat_unsigned_long_long_accum_type_node);
5422
5423 }
5424
c2255bc4
AH		 5425 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5426 TYPE_DECL,
ae2bcd98
RS		 5427 get_identifier ("complex int"),
5428 complex_integer_type_node));
c2255bc4
AH		 5429 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5430 TYPE_DECL,
ae2bcd98
RS		 5431 get_identifier ("complex float"),
5432 complex_float_type_node));
c2255bc4
AH		 5433 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5434 TYPE_DECL,
ae2bcd98
RS		 5435 get_identifier ("complex double"),
5436 complex_double_type_node));
5437 lang_hooks.decls.pushdecl
c2255bc4
AH		 5438 (build_decl (UNKNOWN_LOCATION,
5439 TYPE_DECL, get_identifier ("complex long double"),
43577e6b 5440 complex_long_double_type_node));
eaa7c03f 5441
498c0f27
JJ		 5442 if (c_dialect_cxx ())
5443 /* For C++, make fileptr_type_node a distinct void * type until
5444 FILE type is defined. */
8dd16ecc 5445 fileptr_type_node = build_variant_type_copy (ptr_type_node);
498c0f27 5446
6496a589 5447 record_builtin_type (RID_VOID, NULL, void_type_node);
eaa7c03f 5448
06d40de8
DG		 5449 /* Set the TYPE_NAME for any variants that were built before
5450 record_builtin_type gave names to the built-in types. */
5451 {
5452 tree void_name = TYPE_NAME (void_type_node);
5453 TYPE_NAME (void_type_node) = NULL_TREE;
5454 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
5455 = void_name;
5456 TYPE_NAME (void_type_node) = void_name;
5457 }
5458
eaa7c03f
JM		 5459 void_list_node = build_void_list_node ();
5460
5461 /* Make a type to be the domain of a few array types
5462 whose domains don't really matter.
5463 200 is small enough that it always fits in size_t
5464 and large enough that it can hold most function names for the
5465 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5466 array_domain_type = build_index_type (size_int (200));
5467
5468 /* Make a type for arrays of characters.
5469 With luck nothing will ever really depend on the length of this
5470 array type. */
5471 char_array_type_node
5472 = build_array_type (char_type_node, array_domain_type);
5473
10841285
MM		 5474 string_type_node = build_pointer_type (char_type_node);
5475 const_string_type_node
5476 = build_pointer_type (build_qualified_type
5477 (char_type_node, TYPE_QUAL_CONST));
5478
eaa7c03f 5479 /* This is special for C++ so functions can be overloaded. */
a11eba95 5480 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
eaa7c03f
JM		 5481 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
5482 wchar_type_size = TYPE_PRECISION (wchar_type_node);
207bf79d 5483 underlying_wchar_type_node = wchar_type_node;
37fa72e9 5484 if (c_dialect_cxx ())
eaa7c03f 5485 {
8df83eae 5486 if (TYPE_UNSIGNED (wchar_type_node))
eaa7c03f
JM		 5487 wchar_type_node = make_unsigned_type (wchar_type_size);
5488 else
5489 wchar_type_node = make_signed_type (wchar_type_size);
5490 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
5491 }
eaa7c03f
JM		 5492
5493 /* This is for wide string constants. */
5494 wchar_array_type_node
5495 = build_array_type (wchar_type_node, array_domain_type);
5496
b6baa67d
KVH		 5497 /* Define 'char16_t'. */
5498 char16_type_node = get_identifier (CHAR16_TYPE);
5499 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
5500 char16_type_size = TYPE_PRECISION (char16_type_node);
5501 if (c_dialect_cxx ())
5502 {
5503 char16_type_node = make_unsigned_type (char16_type_size);
5504
604b2bfc 5505 if (cxx_dialect >= cxx11)
b6baa67d
KVH		 5506 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
5507 }
5508
5509 /* This is for UTF-16 string constants. */
5510 char16_array_type_node
5511 = build_array_type (char16_type_node, array_domain_type);
5512
5513 /* Define 'char32_t'. */
5514 char32_type_node = get_identifier (CHAR32_TYPE);
5515 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
5516 char32_type_size = TYPE_PRECISION (char32_type_node);
5517 if (c_dialect_cxx ())
5518 {
5519 char32_type_node = make_unsigned_type (char32_type_size);
5520
604b2bfc 5521 if (cxx_dialect >= cxx11)
b6baa67d
KVH		 5522 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
5523 }
5524
5525 /* This is for UTF-32 string constants. */
5526 char32_array_type_node
5527 = build_array_type (char32_type_node, array_domain_type);
5528
5fd8e536
JM		 5529 wint_type_node =
5530 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
5531
5532 intmax_type_node =
5533 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
5534 uintmax_type_node =
5535 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
5536
207bf79d
JM		 5537 if (SIG_ATOMIC_TYPE)
5538 sig_atomic_type_node =
c1b61fca 5539 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
207bf79d
JM		 5540 if (INT8_TYPE)
5541 int8_type_node =
c1b61fca 5542 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
207bf79d
JM		 5543 if (INT16_TYPE)
5544 int16_type_node =
c1b61fca 5545 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
207bf79d
JM		 5546 if (INT32_TYPE)
5547 int32_type_node =
c1b61fca 5548 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
207bf79d
JM		 5549 if (INT64_TYPE)
5550 int64_type_node =
c1b61fca 5551 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
207bf79d
JM		 5552 if (UINT8_TYPE)
5553 uint8_type_node =
c1b61fca 5554 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
207bf79d 5555 if (UINT16_TYPE)
cca615af 5556 c_uint16_type_node = uint16_type_node =
c1b61fca 5557 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
207bf79d 5558 if (UINT32_TYPE)
cca615af 5559 c_uint32_type_node = uint32_type_node =
c1b61fca 5560 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
207bf79d 5561 if (UINT64_TYPE)
cca615af 5562 c_uint64_type_node = uint64_type_node =
c1b61fca 5563 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
207bf79d
JM		 5564 if (INT_LEAST8_TYPE)
5565 int_least8_type_node =
c1b61fca 5566 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
207bf79d
JM		 5567 if (INT_LEAST16_TYPE)
5568 int_least16_type_node =
c1b61fca 5569 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
207bf79d
JM		 5570 if (INT_LEAST32_TYPE)
5571 int_least32_type_node =
c1b61fca 5572 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
207bf79d
JM		 5573 if (INT_LEAST64_TYPE)
5574 int_least64_type_node =
c1b61fca 5575 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
207bf79d
JM		 5576 if (UINT_LEAST8_TYPE)
5577 uint_least8_type_node =
c1b61fca 5578 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
207bf79d
JM		 5579 if (UINT_LEAST16_TYPE)
5580 uint_least16_type_node =
c1b61fca 5581 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
207bf79d
JM		 5582 if (UINT_LEAST32_TYPE)
5583 uint_least32_type_node =
c1b61fca 5584 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
207bf79d
JM		 5585 if (UINT_LEAST64_TYPE)
5586 uint_least64_type_node =
c1b61fca 5587 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
207bf79d
JM		 5588 if (INT_FAST8_TYPE)
5589 int_fast8_type_node =
c1b61fca 5590 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
207bf79d
JM		 5591 if (INT_FAST16_TYPE)
5592 int_fast16_type_node =
c1b61fca 5593 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
207bf79d
JM		 5594 if (INT_FAST32_TYPE)
5595 int_fast32_type_node =
c1b61fca 5596 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
207bf79d
JM		 5597 if (INT_FAST64_TYPE)
5598 int_fast64_type_node =
c1b61fca 5599 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
207bf79d
JM		 5600 if (UINT_FAST8_TYPE)
5601 uint_fast8_type_node =
c1b61fca 5602 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
207bf79d
JM		 5603 if (UINT_FAST16_TYPE)
5604 uint_fast16_type_node =
c1b61fca 5605 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
207bf79d
JM		 5606 if (UINT_FAST32_TYPE)
5607 uint_fast32_type_node =
c1b61fca 5608 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
207bf79d
JM		 5609 if (UINT_FAST64_TYPE)
5610 uint_fast64_type_node =
c1b61fca 5611 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
207bf79d
JM		 5612 if (INTPTR_TYPE)
5613 intptr_type_node =
c1b61fca 5614 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
207bf79d
JM		 5615 if (UINTPTR_TYPE)
5616 uintptr_type_node =
c1b61fca 5617 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
207bf79d 5618
8242dd04
NF		 5619 default_function_type
5620 = build_varargs_function_type_list (integer_type_node, NULL_TREE);
5fd8e536
JM		 5621 ptrdiff_type_node
5622 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
12753674 5623 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
5fd8e536 5624
ae2bcd98 5625 lang_hooks.decls.pushdecl
c2255bc4
AH		 5626 (build_decl (UNKNOWN_LOCATION,
5627 TYPE_DECL, get_identifier ("__builtin_va_list"),
43577e6b 5628 va_list_type_node));
38f8b050 5629 if (targetm.enum_va_list_p)
d4048208
KT		 5630 {
5631 int l;
5632 const char *pname;
5633 tree ptype;
35cbb299 5634
38f8b050 5635 for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
d4048208
KT		 5636 {
5637 lang_hooks.decls.pushdecl
5638 (build_decl (UNKNOWN_LOCATION,
5639 TYPE_DECL, get_identifier (pname),
5640 ptype));
5641
5642 }
5643 }
daf68dd7 5644
daf68dd7 5645 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
9f720c3e
GK		 5646 {
5647 va_list_arg_type_node = va_list_ref_type_node =
5648 build_pointer_type (TREE_TYPE (va_list_type_node));
5649 }
daf68dd7 5650 else
9f720c3e
GK		 5651 {
5652 va_list_arg_type_node = va_list_type_node;
5653 va_list_ref_type_node = build_reference_type (va_list_type_node);
5654 }
35b1a6fa 5655
c6d86fce
ILT		 5656 if (!flag_preprocess_only)
5657 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
4677862a 5658
5b47282c 5659 main_identifier_node = get_identifier ("main");
b2f97e4a
MM		 5660
5661 /* Create the built-in __null node. It is important that this is
5662 not shared. */
807e902e 5663 null_node = make_int_cst (1, 1);
b2f97e4a 5664 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
a0274e3e
JJ		 5665
5666 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5667 memset (builtin_types, 0, sizeof (builtin_types));
7f4edbcb 5668}
d3707adb 5669
3b2db49f
MM		 5670/* The number of named compound-literals generated thus far. */
5671static GTY(()) int compound_literal_number;
5672
5673/* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5674
5675void
5676set_compound_literal_name (tree decl)
5677{
5678 char *name;
5679 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
5680 compound_literal_number);
5681 compound_literal_number++;
5682 DECL_NAME (decl) = get_identifier (name);
5683}
5684
2fe1d762
TV		 5685/* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5686 TYPE and operand OP. */
5687
5688static tree
5689build_va_arg_1 (location_t loc, tree type, tree op)
5690{
5691 tree expr = build1 (VA_ARG_EXPR, type, op);
5692 SET_EXPR_LOCATION (expr, loc);
5693 return expr;
5694}
5695
5696/* Return a VA_ARG_EXPR corresponding to a source-level expression
5697 va_arg (EXPR, TYPE) at source location LOC. */
5698
d3707adb 5699tree
c2255bc4 5700build_va_arg (location_t loc, tree expr, tree type)
d3707adb 5701{
c7b38fd5
TV		 5702 tree va_type = TREE_TYPE (expr);
5703 tree canon_va_type = (va_type == error_mark_node
5704 ? NULL_TREE
5705 : targetm.canonical_va_list_type (va_type));
5706
2fe1d762
TV		 5707 if (va_type == error_mark_node
5708 || canon_va_type == NULL_TREE)
c7b38fd5 5709 {
2fe1d762
TV		 5710 /* Let's handle things neutrallly, if expr:
5711 - has undeclared type, or
5712 - is not an va_list type. */
5713 return build_va_arg_1 (loc, type, expr);
c7b38fd5 5714 }
ecd0e562 5715
2fe1d762
TV		 5716 if (TREE_CODE (canon_va_type) != ARRAY_TYPE)
5717 {
5718 /* Case 1: Not an array type. */
5719
5720 /* Take the address, to get '&ap'. */
5721 mark_addressable (expr);
5722 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr);
5723
5724 /* Verify that &ap is still recognized as having va_list type. */
5725 tree canon_expr_type
5726 = targetm.canonical_va_list_type (TREE_TYPE (expr));
5727 gcc_assert (canon_expr_type != NULL_TREE);
5728
5729 return build_va_arg_1 (loc, type, expr);
5730 }
5731
5732 /* Case 2: Array type.
5733
5734 Background:
5735
5736 For contrast, let's start with the simple case (case 1). If
5737 canon_va_type is not an array type, but say a char *, then when
5738 passing-by-value a va_list, the type of the va_list param decl is
5739 the same as for another va_list decl (all ap's are char *):
5740
5741 f2_1 (char * ap)
5742 D.1815 = VA_ARG (&ap, 0B, 1);
5743 return D.1815;
5744
5745 f2 (int i)
5746 char * ap.0;
5747 char * ap;
5748 __builtin_va_start (&ap, 0);
5749 ap.0 = ap;
5750 res = f2_1 (ap.0);
5751 __builtin_va_end (&ap);
5752 D.1812 = res;
5753 return D.1812;
5754
5755 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5756 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5757 the same as for another va_list decl (case 2a, struct ap[1]).
5758
5759 f2_1 (struct * ap)
5760 D.1844 = VA_ARG (ap, 0B, 0);
5761 return D.1844;
5762
5763 f2 (int i)
5764 struct ap[1];
5765 __builtin_va_start (&ap, 0);
5766 res = f2_1 (&ap);
5767 __builtin_va_end (&ap);
5768 D.1841 = res;
5769 return D.1841;
5770
5771 Case 2b is different because:
5772 - on the callee side, the parm decl has declared type va_list, but
5773 grokdeclarator changes the type of the parm decl to a pointer to the
5774 array elem type.
5775 - on the caller side, the pass-by-value uses &ap.
5776
5777 We unify these two cases (case 2a: va_list is array type,
5778 case 2b: va_list is pointer to array elem type), by adding '&' for the
5779 array type case, such that we have a pointer to array elem in both
5780 cases. */
5781
5782 if (TREE_CODE (va_type) == ARRAY_TYPE)
5783 {
5784 /* Case 2a: va_list is array type. */
5785
5786 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5787 elem type. */
5788 mark_addressable (expr);
5789 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)),
5790 expr);
5791
5792 /* Verify that &ap is still recognized as having va_list type. */
5793 tree canon_expr_type
5794 = targetm.canonical_va_list_type (TREE_TYPE (expr));
5795 gcc_assert (canon_expr_type != NULL_TREE);
5796 }
5797 else
5798 {
5799 /* Case 2b: va_list is pointer to array elem type. */
5800 gcc_assert (POINTER_TYPE_P (va_type));
5801 gcc_assert (TREE_TYPE (va_type) == TREE_TYPE (canon_va_type));
5802
5803 /* Don't take the address. We've already got '&ap'. */
5804 ;
5805 }
5806
5807 return build_va_arg_1 (loc, type, expr);
d3707adb 5808}
fc2aaf30
JM		 5809
5810
7d14c755
JM		 5811/* Linked list of disabled built-in functions. */
5812
a79683d5 5813struct disabled_builtin
7d14c755
JM		 5814{
5815 const char *name;
5816 struct disabled_builtin *next;
a79683d5 5817};
7d14c755
JM		 5818static disabled_builtin *disabled_builtins = NULL;
5819
35b1a6fa 5820static bool builtin_function_disabled_p (const char *);
7d14c755
JM		 5821
5822/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5823 begins with "__builtin_", give an error. */
5824
5825void
35b1a6fa 5826disable_builtin_function (const char *name)
7d14c755
JM		 5827{
5828 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
bda67431 5829 error ("cannot disable built-in function %qs", name);
7d14c755
JM		 5830 else
5831 {
1ad463f4
BI		 5832 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
5833 new_disabled_builtin->name = name;
5834 new_disabled_builtin->next = disabled_builtins;
5835 disabled_builtins = new_disabled_builtin;
7d14c755
JM		 5836 }
5837}
5838
5839
5840/* Return true if the built-in function NAME has been disabled, false
5841 otherwise. */
5842
5843static bool
35b1a6fa 5844builtin_function_disabled_p (const char *name)
7d14c755
JM		 5845{
5846 disabled_builtin *p;
5847 for (p = disabled_builtins; p != NULL; p = p->next)
5848 {
5849 if (strcmp (name, p->name) == 0)
5850 return true;
5851 }
5852 return false;
5853}
5854
5855
9bc15050
RG		 5856/* Worker for DEF_BUILTIN.
5857 Possibly define a builtin function with one or two names.
5858 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5859 nonansi_p and flag_no_nonansi_builtin. */
fc2aaf30 5860
9bc15050
RG		 5861static void
5862def_builtin_1 (enum built_in_function fncode,
5863 const char *name,
5864 enum built_in_class fnclass,
5865 tree fntype, tree libtype,
5866 bool both_p, bool fallback_p, bool nonansi_p,
5867 tree fnattrs, bool implicit_p)
fc2aaf30 5868{
9bc15050
RG		 5869 tree decl;
5870 const char *libname;
5871
a0274e3e
JJ		 5872 if (fntype == error_mark_node)
5873 return;
5874
9bc15050
RG		 5875 gcc_assert ((!both_p && !fallback_p)
5876 || !strncmp (name, "__builtin_",
5877 strlen ("__builtin_")));
5878
5879 libname = name + strlen ("__builtin_");
c79efc4d
RÁE		 5880 decl = add_builtin_function (name, fntype, fncode, fnclass,
5881 (fallback_p ? libname : NULL),
5882 fnattrs);
e79983f4
MM		 5883
5884 set_builtin_decl (fncode, decl, implicit_p);
5885
9bc15050
RG		 5886 if (both_p
5887 && !flag_no_builtin && !builtin_function_disabled_p (libname)
7d14c755 5888 && !(nonansi_p && flag_no_nonansi_builtin))
c79efc4d
RÁE		 5889 add_builtin_function (libname, libtype, fncode, fnclass,
5890 NULL, fnattrs);
fc2aaf30 5891}
c530479e 5892\f
d72040f5
RH		 5893/* Nonzero if the type T promotes to int. This is (nearly) the
5894 integral promotions defined in ISO C99 6.3.1.1/2. */
5895
5896bool
58f9752a 5897c_promoting_integer_type_p (const_tree t)
d72040f5
RH		 5898{
5899 switch (TREE_CODE (t))
5900 {
5901 case INTEGER_TYPE:
5902 return (TYPE_MAIN_VARIANT (t) == char_type_node
5903 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
5904 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
5905 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
c6c04fca
RL		 5906 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
5907 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
d72040f5
RH		 5908
5909 case ENUMERAL_TYPE:
5910 /* ??? Technically all enumerations not larger than an int
5911 promote to an int. But this is used along code paths
5912 that only want to notice a size change. */
5913 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
5914
5915 case BOOLEAN_TYPE:
5916 return 1;
5917
5918 default:
5919 return 0;
5920 }
5921}
5922
c530479e
RH		 5923/* Return 1 if PARMS specifies a fixed number of parameters
5924 and none of their types is affected by default promotions. */
5925
5926int
58f9752a 5927self_promoting_args_p (const_tree parms)
c530479e 5928{
58f9752a 5929 const_tree t;
c530479e
RH		 5930 for (t = parms; t; t = TREE_CHAIN (t))
5931 {
b3694847 5932 tree type = TREE_VALUE (t);
7e8176d7 5933
694fea20
VR		 5934 if (type == error_mark_node)
5935 continue;
5936
c530479e
RH		 5937 if (TREE_CHAIN (t) == 0 && type != void_type_node)
5938 return 0;
5939
5940 if (type == 0)
5941 return 0;
5942
5943 if (TYPE_MAIN_VARIANT (type) == float_type_node)
5944 return 0;
5945
d72040f5 5946 if (c_promoting_integer_type_p (type))
c530479e
RH		 5947 return 0;
5948 }
5949 return 1;
5950}
5eda3d66 5951
12ea3302
GDR		 5952/* Recursively remove any '*' or '&' operator from TYPE. */
5953tree
5954strip_pointer_operator (tree t)
5955{
5956 while (POINTER_TYPE_P (t))
5957 t = TREE_TYPE (t);
5958 return t;
5959}
5960
ba992967
SP		 5961/* Recursively remove pointer or array type from TYPE. */
5962tree
5963strip_pointer_or_array_types (tree t)
5964{
5965 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
5966 t = TREE_TYPE (t);
5967 return t;
5968}
5969
8f17b5c5
MM		 5970/* Used to compare case labels. K1 and K2 are actually tree nodes
5971 representing case labels, or NULL_TREE for a `default' label.
5972 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5973 K2, and 0 if K1 and K2 are equal. */
5974
5975int
35b1a6fa 5976case_compare (splay_tree_key k1, splay_tree_key k2)
8f17b5c5
MM		 5977{
5978 /* Consider a NULL key (such as arises with a `default' label) to be
5979 smaller than anything else. */
5980 if (!k1)
5981 return k2 ? -1 : 0;
5982 else if (!k2)
5983 return k1 ? 1 : 0;
5984
5985 return tree_int_cst_compare ((tree) k1, (tree) k2);
5986}
5987
c2255bc4
AH		 5988/* Process a case label, located at LOC, for the range LOW_VALUE
5989 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5990 then this case label is actually a `default' label. If only
5991 HIGH_VALUE is NULL_TREE, then case label was declared using the
5992 usual C/C++ syntax, rather than the GNU case range extension.
5993 CASES is a tree containing all the case ranges processed so far;
b155cfd9
MP		 5994 COND is the condition for the switch-statement itself.
5995 OUTSIDE_RANGE_P says whether there was a case value that doesn't
5996 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
5997 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
8f17b5c5
MM		 5998
5999tree
c2255bc4 6000c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
b155cfd9 6001 tree low_value, tree high_value, bool *outside_range_p)
8f17b5c5
MM		 6002{
6003 tree type;
6004 tree label;
6005 tree case_label;
6006 splay_tree_node node;
6007
6008 /* Create the LABEL_DECL itself. */
c2255bc4 6009 label = create_artificial_label (loc);
8f17b5c5
MM		 6010
6011 /* If there was an error processing the switch condition, bail now
6012 before we get more confused. */
6013 if (!cond || cond == error_mark_node)
6de9cd9a 6014 goto error_out;
8f17b5c5 6015
35b1a6fa
AJ		 6016 if ((low_value && TREE_TYPE (low_value)
6017 && POINTER_TYPE_P (TREE_TYPE (low_value)))
8f17b5c5
MM		 6018 || (high_value && TREE_TYPE (high_value)
6019 && POINTER_TYPE_P (TREE_TYPE (high_value))))
522ddfa2 6020 {
c2255bc4 6021 error_at (loc, "pointers are not permitted as case values");
522ddfa2
JM		 6022 goto error_out;
6023 }
8f17b5c5
MM		 6024
6025 /* Case ranges are a GNU extension. */
fcf73884 6026 if (high_value)
c1771a20 6027 pedwarn (loc, OPT_Wpedantic,
fcf73884 6028 "range expressions in switch statements are non-standard");
8f17b5c5
MM		 6029
6030 type = TREE_TYPE (cond);
6031 if (low_value)
6032 {
62e4eb35 6033 low_value = check_case_value (loc, low_value);
68fca595 6034 low_value = convert_and_check (loc, type, low_value);
c0e22534
NS		 6035 if (low_value == error_mark_node)
6036 goto error_out;
8f17b5c5
MM		 6037 }
6038 if (high_value)
6039 {
62e4eb35 6040 high_value = check_case_value (loc, high_value);
68fca595 6041 high_value = convert_and_check (loc, type, high_value);
c0e22534
NS		 6042 if (high_value == error_mark_node)
6043 goto error_out;
8f17b5c5
MM		 6044 }
6045
c0e22534
NS		 6046 if (low_value && high_value)
6047 {
6048 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
c22cacf3
MS		 6049 really a case range, even though it was written that way.
6050 Remove the HIGH_VALUE to simplify later processing. */
c0e22534
NS		 6051 if (tree_int_cst_equal (low_value, high_value))
6052 high_value = NULL_TREE;
6053 else if (!tree_int_cst_lt (low_value, high_value))
c2255bc4 6054 warning_at (loc, 0, "empty range specified");
c0e22534 6055 }
8f17b5c5 6056
a6c0a76c
SB		 6057 /* See if the case is in range of the type of the original testing
6058 expression. If both low_value and high_value are out of range,
6059 don't insert the case label and return NULL_TREE. */
6060 if (low_value
9d548dfb 6061 && !check_case_bounds (loc, type, orig_type,
b155cfd9
MP		 6062 &low_value, high_value ? &high_value : NULL,
6063 outside_range_p))
a6c0a76c
SB		 6064 return NULL_TREE;
6065
8f17b5c5
MM		 6066 /* Look up the LOW_VALUE in the table of case labels we already
6067 have. */
6068 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
6069 /* If there was not an exact match, check for overlapping ranges.
6070 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6071 that's a `default' label and the only overlap is an exact match. */
6072 if (!node && (low_value || high_value))
6073 {
6074 splay_tree_node low_bound;
6075 splay_tree_node high_bound;
6076
6077 /* Even though there wasn't an exact match, there might be an
6078 overlap between this case range and another case range.
6079 Since we've (inductively) not allowed any overlapping case
6080 ranges, we simply need to find the greatest low case label
6081 that is smaller that LOW_VALUE, and the smallest low case
6082 label that is greater than LOW_VALUE. If there is an overlap
6083 it will occur in one of these two ranges. */
6084 low_bound = splay_tree_predecessor (cases,
6085 (splay_tree_key) low_value);
6086 high_bound = splay_tree_successor (cases,
6087 (splay_tree_key) low_value);
6088
6089 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6090 the LOW_VALUE, so there is no need to check unless the
6091 LOW_BOUND is in fact itself a case range. */
6092 if (low_bound
6093 && CASE_HIGH ((tree) low_bound->value)
6094 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
6095 low_value) >= 0)
6096 node = low_bound;
6097 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6098 range is bigger than the low end of the current range, so we
6099 are only interested if the current range is a real range, and
6100 not an ordinary case label. */
35b1a6fa 6101 else if (high_bound
8f17b5c5
MM		 6102 && high_value
6103 && (tree_int_cst_compare ((tree) high_bound->key,
6104 high_value)
6105 <= 0))
6106 node = high_bound;
6107 }
6108 /* If there was an overlap, issue an error. */
6109 if (node)
6110 {
8c161995 6111 tree duplicate = CASE_LABEL ((tree) node->value);
8f17b5c5
MM		 6112
6113 if (high_value)
6114 {
c2255bc4
AH		 6115 error_at (loc, "duplicate (or overlapping) case value");
6116 error_at (DECL_SOURCE_LOCATION (duplicate),
6117 "this is the first entry overlapping that value");
8f17b5c5
MM		 6118 }
6119 else if (low_value)
6120 {
c2255bc4
AH		 6121 error_at (loc, "duplicate case value") ;
6122 error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
8f17b5c5
MM		 6123 }
6124 else
6125 {
c2255bc4
AH		 6126 error_at (loc, "multiple default labels in one switch");
6127 error_at (DECL_SOURCE_LOCATION (duplicate),
6128 "this is the first default label");
8f17b5c5 6129 }
6de9cd9a 6130 goto error_out;
8f17b5c5
MM		 6131 }
6132
6133 /* Add a CASE_LABEL to the statement-tree. */
3d528853 6134 case_label = add_stmt (build_case_label (low_value, high_value, label));
8f17b5c5 6135 /* Register this case label in the splay tree. */
35b1a6fa 6136 splay_tree_insert (cases,
8f17b5c5
MM		 6137 (splay_tree_key) low_value,
6138 (splay_tree_value) case_label);
6139
6140 return case_label;
6de9cd9a
DN		 6141
6142 error_out:
9e14e18f 6143 /* Add a label so that the back-end doesn't think that the beginning of
6de9cd9a 6144 the switch is unreachable. Note that we do not add a case label, as
41806d92 6145 that just leads to duplicates and thence to failure later on. */
6de9cd9a
DN		 6146 if (!cases->root)
6147 {
c2255bc4
AH		 6148 tree t = create_artificial_label (loc);
6149 add_stmt (build_stmt (loc, LABEL_EXPR, t));
6de9cd9a
DN		 6150 }
6151 return error_mark_node;
6152}
6153
6154/* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6155 Used to verify that case values match up with enumerator values. */
6156
6157static void
6158match_case_to_enum_1 (tree key, tree type, tree label)
6159{
807e902e
KZ		 6160 char buf[WIDE_INT_PRINT_BUFFER_SIZE];
6161
6162 if (tree_fits_uhwi_p (key))
6163 print_dec (key, buf, UNSIGNED);
6164 else if (tree_fits_shwi_p (key))
6165 print_dec (key, buf, SIGNED);
6de9cd9a 6166 else
807e902e 6167 print_hex (key, buf);
6de9cd9a
DN		 6168
6169 if (TYPE_NAME (type) == 0)
c5d75364
MLI		 6170 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6171 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6172 "case value %qs not in enumerated type",
6173 buf);
6de9cd9a 6174 else
c5d75364
MLI		 6175 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6176 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6177 "case value %qs not in enumerated type %qT",
6178 buf, type);
6de9cd9a
DN		 6179}
6180
c782c2fe
RS		 6181/* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6182 Used to verify that case values match up with enumerator values. */
6183
6de9cd9a
DN		 6184static int
6185match_case_to_enum (splay_tree_node node, void *data)
6186{
6187 tree label = (tree) node->value;
28dab132 6188 tree type = (tree) data;
6de9cd9a
DN		 6189
6190 /* Skip default case. */
6191 if (!CASE_LOW (label))
6192 return 0;
6193
c782c2fe 6194 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6de9cd9a 6195 when we did our enum->case scan. Reset our scratch bit after. */
c782c2fe 6196 if (!CASE_LOW_SEEN (label))
6de9cd9a
DN		 6197 match_case_to_enum_1 (CASE_LOW (label), type, label);
6198 else
c782c2fe 6199 CASE_LOW_SEEN (label) = 0;
6de9cd9a 6200
c782c2fe
RS		 6201 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6202 not set, that means that CASE_HIGH did not appear when we did our
6203 enum->case scan. Reset our scratch bit after. */
6de9cd9a
DN		 6204 if (CASE_HIGH (label))
6205 {
c782c2fe
RS		 6206 if (!CASE_HIGH_SEEN (label))
6207 match_case_to_enum_1 (CASE_HIGH (label), type, label);
6208 else
6209 CASE_HIGH_SEEN (label) = 0;
6de9cd9a
DN		 6210 }
6211
6212 return 0;
6213}
6214
fbc315db
ILT		 6215/* Handle -Wswitch*. Called from the front end after parsing the
6216 switch construct. */
6217/* ??? Should probably be somewhere generic, since other languages
6218 besides C and C++ would want this. At the moment, however, C/C++
6219 are the only tree-ssa languages that support enumerations at all,
6220 so the point is moot. */
6de9cd9a 6221
fbc315db
ILT		 6222void
6223c_do_switch_warnings (splay_tree cases, location_t switch_location,
b155cfd9
MP		 6224 tree type, tree cond, bool bool_cond_p,
6225 bool outside_range_p)
6de9cd9a 6226{
9f63daea 6227 splay_tree_node default_node;
c782c2fe
RS		 6228 splay_tree_node node;
6229 tree chain;
6de9cd9a 6230
b155cfd9
MP		 6231 if (!warn_switch && !warn_switch_enum && !warn_switch_default
6232 && !warn_switch_bool)
6de9cd9a
DN		 6233 return;
6234
6de9cd9a 6235 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
44c21c7f 6236 if (!default_node)
fab922b1
MLI		 6237 warning_at (switch_location, OPT_Wswitch_default,
6238 "switch missing default case");
6de9cd9a 6239
b155cfd9
MP		 6240 /* There are certain cases where -Wswitch-bool warnings aren't
6241 desirable, such as
6242 switch (boolean)
6243 {
6244 case true: ...
6245 case false: ...
6246 }
6247 so be careful here. */
6248 if (warn_switch_bool && bool_cond_p)
6249 {
6250 splay_tree_node min_node;
6251 /* If there's a default node, it's also the value with the minimal
6252 key. So look at the penultimate key (if any). */
6253 if (default_node)
6254 min_node = splay_tree_successor (cases, (splay_tree_key) NULL);
6255 else
6256 min_node = splay_tree_min (cases);
6257 tree min = min_node ? (tree) min_node->key : NULL_TREE;
6258
6259 splay_tree_node max_node = splay_tree_max (cases);
6260 /* This might be a case range, so look at the value with the
6261 maximal key and then check CASE_HIGH. */
6262 tree max = max_node ? (tree) max_node->value : NULL_TREE;
6263 if (max)
6264 max = CASE_HIGH (max) ? CASE_HIGH (max) : CASE_LOW (max);
6265
6266 /* If there's a case value > 1 or < 0, that is outside bool
6267 range, warn. */
6268 if (outside_range_p
6269 || (max && wi::gts_p (max, 1))
6270 || (min && wi::lts_p (min, 0))
6271 /* And handle the
6272 switch (boolean)
6273 {
6274 case true: ...
6275 case false: ...
6276 default: ...
6277 }
6278 case, where we want to warn. */
6279 || (default_node
6280 && max && wi::eq_p (max, 1)
6281 && min && wi::eq_p (min, 0)))
6282 warning_at (switch_location, OPT_Wswitch_bool,
6283 "switch condition has boolean value");
6284 }
6285
026c3cfd 6286 /* From here on, we only care about enumerated types. */
c782c2fe
RS		 6287 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
6288 return;
6289
cdb88468
ILT		 6290 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6291 if (!warn_switch_enum && !warn_switch)
c782c2fe
RS		 6292 return;
6293
cdb88468
ILT		 6294 /* Check the cases. Warn about case values which are not members of
6295 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6296 there is no default case, check that exactly all enumeration
6297 literals are covered by the cases. */
6298
c782c2fe
RS		 6299 /* Clearing COND if it is not an integer constant simplifies
6300 the tests inside the loop below. */
6301 if (TREE_CODE (cond) != INTEGER_CST)
6302 cond = NULL_TREE;
6303
6304 /* The time complexity here is O(N*lg(N)) worst case, but for the
6305 common case of monotonically increasing enumerators, it is
6306 O(N), since the nature of the splay tree will keep the next
6307 element adjacent to the root at all times. */
6de9cd9a 6308
c782c2fe
RS		 6309 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
6310 {
6311 tree value = TREE_VALUE (chain);
adf2edec
DG		 6312 if (TREE_CODE (value) == CONST_DECL)
6313 value = DECL_INITIAL (value);
c782c2fe
RS		 6314 node = splay_tree_lookup (cases, (splay_tree_key) value);
6315 if (node)
6de9cd9a 6316 {
c782c2fe
RS		 6317 /* Mark the CASE_LOW part of the case entry as seen. */
6318 tree label = (tree) node->value;
6319 CASE_LOW_SEEN (label) = 1;
6320 continue;
6321 }
6322
6323 /* Even though there wasn't an exact match, there might be a
fa10beec 6324 case range which includes the enumerator's value. */
c782c2fe
RS		 6325 node = splay_tree_predecessor (cases, (splay_tree_key) value);
6326 if (node && CASE_HIGH ((tree) node->value))
6327 {
6328 tree label = (tree) node->value;
6329 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
6330 if (cmp >= 0)
6de9cd9a 6331 {
c782c2fe
RS		 6332 /* If we match the upper bound exactly, mark the CASE_HIGH
6333 part of the case entry as seen. */
6334 if (cmp == 0)
6335 CASE_HIGH_SEEN (label) = 1;
6336 continue;
6de9cd9a
DN		 6337 }
6338 }
6339
c782c2fe
RS		 6340 /* We've now determined that this enumerated literal isn't
6341 handled by the case labels of the switch statement. */
6de9cd9a 6342
c782c2fe
RS		 6343 /* If the switch expression is a constant, we only really care
6344 about whether that constant is handled by the switch. */
6345 if (cond && tree_int_cst_compare (cond, value))
6346 continue;
6de9cd9a 6347
683d6ff9 6348 /* If there is a default_node, the only relevant option is
cdb88468 6349 Wswitch-enum. Otherwise, if both are enabled then we prefer
683d6ff9
MLI		 6350 to warn using -Wswitch because -Wswitch is enabled by -Wall
6351 while -Wswitch-enum is explicit. */
cdb88468
ILT		 6352 warning_at (switch_location,
6353 (default_node || !warn_switch
6354 ? OPT_Wswitch_enum
6355 : OPT_Wswitch),
6356 "enumeration value %qE not handled in switch",
6357 TREE_PURPOSE (chain));
6de9cd9a 6358 }
c782c2fe
RS		 6359
6360 /* Warn if there are case expressions that don't correspond to
6361 enumerators. This can occur since C and C++ don't enforce
6362 type-checking of assignments to enumeration variables.
6363
6364 The time complexity here is now always O(N) worst case, since
6365 we should have marked both the lower bound and upper bound of
6366 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6367 above. This scan also resets those fields. */
683d6ff9 6368
c782c2fe 6369 splay_tree_foreach (cases, match_case_to_enum, type);
8f17b5c5
MM		 6370}
6371
6b665219 6372/* Finish an expression taking the address of LABEL (an
6a3799eb
AH		 6373 IDENTIFIER_NODE). Returns an expression for the address.
6374
6375 LOC is the location for the expression returned. */
15b732b2 6376
35b1a6fa 6377tree
6a3799eb 6378finish_label_address_expr (tree label, location_t loc)
15b732b2
NB		 6379{
6380 tree result;
6381
c1771a20 6382 pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard");
15b732b2 6383
6b665219
MM		 6384 if (label == error_mark_node)
6385 return error_mark_node;
6386
15b732b2
NB		 6387 label = lookup_label (label);
6388 if (label == NULL_TREE)
6389 result = null_pointer_node;
6390 else
6391 {
6392 TREE_USED (label) = 1;
6393 result = build1 (ADDR_EXPR, ptr_type_node, label);
5805e48d 6394 /* The current function is not necessarily uninlinable.
15b732b2
NB		 6395 Computed gotos are incompatible with inlining, but the value
6396 here could be used only in a diagnostic, for example. */
6a3799eb 6397 protected_set_expr_location (result, loc);
15b732b2
NB		 6398 }
6399
6400 return result;
6401}
19552aa5
JM		 6402\f
6403
6404/* Given a boolean expression ARG, return a tree representing an increment
6405 or decrement (as indicated by CODE) of ARG. The front end must check for
6406 invalid cases (e.g., decrement in C++). */
6407tree
35b1a6fa 6408boolean_increment (enum tree_code code, tree arg)
19552aa5
JM		 6409{
6410 tree val;
b5119fa1 6411 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
37fa72e9 6412
19552aa5
JM		 6413 arg = stabilize_reference (arg);
6414 switch (code)
6415 {
6416 case PREINCREMENT_EXPR:
53fb4de3 6417 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
19552aa5
JM		 6418 break;
6419 case POSTINCREMENT_EXPR:
53fb4de3 6420 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
19552aa5 6421 arg = save_expr (arg);
53fb4de3
RS		 6422 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6423 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
19552aa5
JM		 6424 break;
6425 case PREDECREMENT_EXPR:
53fb4de3 6426 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
db3927fb 6427 invert_truthvalue_loc (input_location, arg));
19552aa5
JM		 6428 break;
6429 case POSTDECREMENT_EXPR:
53fb4de3 6430 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
db3927fb 6431 invert_truthvalue_loc (input_location, arg));
19552aa5 6432 arg = save_expr (arg);
53fb4de3
RS		 6433 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6434 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
19552aa5
JM		 6435 break;
6436 default:
366de0ce 6437 gcc_unreachable ();
19552aa5
JM		 6438 }
6439 TREE_SIDE_EFFECTS (val) = 1;
6440 return val;
6441}
03dc0325 6442\f
207bf79d
JM		 6443/* Built-in macros for stddef.h and stdint.h, that require macros
6444 defined in this file. */
460bd0e3 6445void
35b1a6fa 6446c_stddef_cpp_builtins(void)
3df89291 6447{
5279d739
ZW		 6448 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
6449 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
6450 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
6451 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
85291069
JM		 6452 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
6453 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
c466b2cd
KVH		 6454 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
6455 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
207bf79d
JM		 6456 if (SIG_ATOMIC_TYPE)
6457 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
6458 if (INT8_TYPE)
6459 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
6460 if (INT16_TYPE)
6461 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
6462 if (INT32_TYPE)
6463 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
6464 if (INT64_TYPE)
6465 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
6466 if (UINT8_TYPE)
6467 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
6468 if (UINT16_TYPE)
6469 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
6470 if (UINT32_TYPE)
6471 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
6472 if (UINT64_TYPE)
6473 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
6474 if (INT_LEAST8_TYPE)
6475 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
6476 if (INT_LEAST16_TYPE)
6477 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
6478 if (INT_LEAST32_TYPE)
6479 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
6480 if (INT_LEAST64_TYPE)
6481 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
6482 if (UINT_LEAST8_TYPE)
6483 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
6484 if (UINT_LEAST16_TYPE)
6485 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
6486 if (UINT_LEAST32_TYPE)
6487 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
6488 if (UINT_LEAST64_TYPE)
6489 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
6490 if (INT_FAST8_TYPE)
6491 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
6492 if (INT_FAST16_TYPE)
6493 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
6494 if (INT_FAST32_TYPE)
6495 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
6496 if (INT_FAST64_TYPE)
6497 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
6498 if (UINT_FAST8_TYPE)
6499 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
6500 if (UINT_FAST16_TYPE)
6501 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
6502 if (UINT_FAST32_TYPE)
6503 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
6504 if (UINT_FAST64_TYPE)
6505 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
6506 if (INTPTR_TYPE)
6507 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
6508 if (UINTPTR_TYPE)
6509 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
676997cf
RH		 6510}
6511
6431177a 6512static void
35b1a6fa 6513c_init_attributes (void)
6431177a
JM		 6514{
6515 /* Fill in the built_in_attributes array. */
4a90aeeb 6516#define DEF_ATTR_NULL_TREE(ENUM) \
6431177a 6517 built_in_attributes[(int) ENUM] = NULL_TREE;
4a90aeeb 6518#define DEF_ATTR_INT(ENUM, VALUE) \
c62c040f 6519 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
e384e6b5
BS		 6520#define DEF_ATTR_STRING(ENUM, VALUE) \
6521 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6431177a
JM		 6522#define DEF_ATTR_IDENT(ENUM, STRING) \
6523 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6524#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6525 built_in_attributes[(int) ENUM] \
6526 = tree_cons (built_in_attributes[(int) PURPOSE], \
6527 built_in_attributes[(int) VALUE], \
6528 built_in_attributes[(int) CHAIN]);
6431177a
JM		 6529#include "builtin-attrs.def"
6530#undef DEF_ATTR_NULL_TREE
6531#undef DEF_ATTR_INT
6532#undef DEF_ATTR_IDENT
6533#undef DEF_ATTR_TREE_LIST
03dc0325 6534}
26f943fd 6535
943f82e7
JM		 6536/* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6537 identifier as an argument, so the front end shouldn't look it up. */
6538
6539bool
564a129d 6540attribute_takes_identifier_p (const_tree attr_id)
943f82e7 6541{
f231b5ff 6542 const struct attribute_spec *spec = lookup_attribute_spec (attr_id);
1b9b91a6
JM		 6543 if (spec == NULL)
6544 /* Unknown attribute that we'll end up ignoring, return true so we
6545 don't complain about an identifier argument. */
6546 return true;
6547 else if (!strcmp ("mode", spec->name)
6548 || !strcmp ("format", spec->name)
6549 || !strcmp ("cleanup", spec->name))
564a129d
JM		 6550 return true;
6551 else
6552 return targetm.attribute_takes_identifier_p (attr_id);
943f82e7
JM		 6553}
6554
349ae713
NB		 6555/* Attribute handlers common to C front ends. */
6556
6557/* Handle a "packed" attribute; arguments as in
6558 struct attribute_spec.handler. */
6559
6560static tree
e18476eb 6561handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
a742c759 6562 int flags, bool *no_add_attrs)
349ae713 6563{
c6e4cc53 6564 if (TYPE_P (*node))
349ae713
NB		 6565 {
6566 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 6567 *node = build_variant_type_copy (*node);
c6e4cc53 6568 TYPE_PACKED (*node) = 1;
349ae713
NB		 6569 }
6570 else if (TREE_CODE (*node) == FIELD_DECL)
646c0835 6571 {
2cd36c22
AN		 6572 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
6573 /* Still pack bitfields. */
6574 && ! DECL_INITIAL (*node))
646c0835
NS		 6575 warning (OPT_Wattributes,
6576 "%qE attribute ignored for field of type %qT",
6577 name, TREE_TYPE (*node));
6578 else
6579 DECL_PACKED (*node) = 1;
6580 }
349ae713 6581 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
c6e4cc53
NS		 6582 used for DECL_REGISTER. It wouldn't mean anything anyway.
6583 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6584 that changes what the typedef is typing. */
349ae713
NB		 6585 else
6586 {
5c498b10 6587 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6588 *no_add_attrs = true;
6589 }
6590
6591 return NULL_TREE;
6592}
6593
6594/* Handle a "nocommon" attribute; arguments as in
6595 struct attribute_spec.handler. */
6596
6597static tree
35b1a6fa 6598handle_nocommon_attribute (tree *node, tree name,
e18476eb
BI		 6599 tree ARG_UNUSED (args),
6600 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 6601{
0ae9bd27 6602 if (VAR_P (*node))
349ae713
NB		 6603 DECL_COMMON (*node) = 0;
6604 else
6605 {
5c498b10 6606 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6607 *no_add_attrs = true;
6608 }
6609
6610 return NULL_TREE;
6611}
6612
6613/* Handle a "common" attribute; arguments as in
6614 struct attribute_spec.handler. */
6615
6616static tree
e18476eb
BI		 6617handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6618 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 6619{
0ae9bd27 6620 if (VAR_P (*node))
349ae713
NB		 6621 DECL_COMMON (*node) = 1;
6622 else
6623 {
5c498b10 6624 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6625 *no_add_attrs = true;
6626 }
6627
6628 return NULL_TREE;
6629}
6630
6631/* Handle a "noreturn" attribute; arguments as in
6632 struct attribute_spec.handler. */
6633
6634static tree
e18476eb
BI		 6635handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6636 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 6637{
6638 tree type = TREE_TYPE (*node);
6639
6640 /* See FIXME comment in c_common_attribute_table. */
2debdb4f
NP		 6641 if (TREE_CODE (*node) == FUNCTION_DECL
6642 || objc_method_decl (TREE_CODE (*node)))
349ae713
NB		 6643 TREE_THIS_VOLATILE (*node) = 1;
6644 else if (TREE_CODE (type) == POINTER_TYPE
6645 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
6646 TREE_TYPE (*node)
6e7ceb17
PC		 6647 = (build_qualified_type
6648 (build_pointer_type
6649 (build_type_variant (TREE_TYPE (type),
6650 TYPE_READONLY (TREE_TYPE (type)), 1)),
6651 TYPE_QUALS (type)));
349ae713
NB		 6652 else
6653 {
5c498b10 6654 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6655 *no_add_attrs = true;
6656 }
6657
6658 return NULL_TREE;
6659}
6660
52bf96d2
JH		 6661/* Handle a "hot" and attribute; arguments as in
6662 struct attribute_spec.handler. */
6663
6664static tree
6665handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
ab442df7 6666 int ARG_UNUSED (flags), bool *no_add_attrs)
52bf96d2 6667{
e45abe1f
RH		 6668 if (TREE_CODE (*node) == FUNCTION_DECL
6669 || TREE_CODE (*node) == LABEL_DECL)
52bf96d2
JH		 6670 {
6671 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
6672 {
45484dcf
MP		 6673 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6674 "with attribute %qs", name, "cold");
52bf96d2
JH		 6675 *no_add_attrs = true;
6676 }
5779e713
MM		 6677 /* Most of the rest of the hot processing is done later with
6678 lookup_attribute. */
52bf96d2
JH		 6679 }
6680 else
6681 {
6682 warning (OPT_Wattributes, "%qE attribute ignored", name);
6683 *no_add_attrs = true;
6684 }
6685
6686 return NULL_TREE;
6687}
e45abe1f 6688
52bf96d2
JH		 6689/* Handle a "cold" and attribute; arguments as in
6690 struct attribute_spec.handler. */
6691
6692static tree
6693handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6694 int ARG_UNUSED (flags), bool *no_add_attrs)
6695{
e45abe1f
RH		 6696 if (TREE_CODE (*node) == FUNCTION_DECL
6697 || TREE_CODE (*node) == LABEL_DECL)
52bf96d2
JH		 6698 {
6699 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
6700 {
45484dcf
MP		 6701 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6702 "with attribute %qs", name, "hot");
52bf96d2
JH		 6703 *no_add_attrs = true;
6704 }
5779e713
MM		 6705 /* Most of the rest of the cold processing is done later with
6706 lookup_attribute. */
52bf96d2
JH		 6707 }
6708 else
6709 {
6710 warning (OPT_Wattributes, "%qE attribute ignored", name);
6711 *no_add_attrs = true;
6712 }
6713
6714 return NULL_TREE;
6715}
6716
e664c61c 6717/* Handle a "no_sanitize_address" attribute; arguments as in
77bc5132
JJ		 6718 struct attribute_spec.handler. */
6719
6720static tree
e664c61c
KS		 6721handle_no_sanitize_address_attribute (tree *node, tree name, tree, int,
6722 bool *no_add_attrs)
77bc5132
JJ		 6723{
6724 if (TREE_CODE (*node) != FUNCTION_DECL)
6725 {
6726 warning (OPT_Wattributes, "%qE attribute ignored", name);
6727 *no_add_attrs = true;
6728 }
6729
6730 return NULL_TREE;
6731}
6732
e664c61c
KS		 6733/* Handle a "no_address_safety_analysis" attribute; arguments as in
6734 struct attribute_spec.handler. */
6735
6736static tree
6737handle_no_address_safety_analysis_attribute (tree *node, tree name, tree, int,
6738 bool *no_add_attrs)
6739{
6740 if (TREE_CODE (*node) != FUNCTION_DECL)
6741 warning (OPT_Wattributes, "%qE attribute ignored", name);
6742 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node)))
6743 DECL_ATTRIBUTES (*node)
6744 = tree_cons (get_identifier ("no_sanitize_address"),
6745 NULL_TREE, DECL_ATTRIBUTES (*node));
6746 *no_add_attrs = true;
6747 return NULL_TREE;
6748}
6749
ce6923c5
MP		 6750/* Handle a "no_sanitize_undefined" attribute; arguments as in
6751 struct attribute_spec.handler. */
6752
6753static tree
6754handle_no_sanitize_undefined_attribute (tree *node, tree name, tree, int,
6755 bool *no_add_attrs)
6756{
6757 if (TREE_CODE (*node) != FUNCTION_DECL)
6758 {
6759 warning (OPT_Wattributes, "%qE attribute ignored", name);
6760 *no_add_attrs = true;
6761 }
6762
6763 return NULL_TREE;
6764}
6765
5434dc07
MD		 6766/* Handle a "stack_protect" attribute; arguments as in
6767 struct attribute_spec.handler. */
6768static tree
6769handle_stack_protect_attribute (tree *node, tree name, tree, int,
6770 bool *no_add_attrs)
6771{
6772 if (TREE_CODE (*node) != FUNCTION_DECL)
6773 {
6774 warning (OPT_Wattributes, "%qE attribute ignored", name);
6775 *no_add_attrs = true;
6776 }
6777 else
6778 DECL_ATTRIBUTES (*node)
6779 = tree_cons (get_identifier ("stack_protect"),
6780 NULL_TREE, DECL_ATTRIBUTES (*node));
6781
6782 return NULL_TREE;
6783}
6784
349ae713
NB		 6785/* Handle a "noinline" attribute; arguments as in
6786 struct attribute_spec.handler. */
6787
6788static tree
35b1a6fa 6789handle_noinline_attribute (tree *node, tree name,
e18476eb
BI		 6790 tree ARG_UNUSED (args),
6791 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 6792{
6793 if (TREE_CODE (*node) == FUNCTION_DECL)
45484dcf
MP		 6794 {
6795 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
6796 {
6797 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6798 "with attribute %qs", name, "always_inline");
6799 *no_add_attrs = true;
6800 }
6801 else
6802 DECL_UNINLINABLE (*node) = 1;
6803 }
349ae713
NB		 6804 else
6805 {
5c498b10 6806 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 6807 *no_add_attrs = true;
6808 }
6809
6810 return NULL_TREE;
6811}
6812
86631ea3
MJ		 6813/* Handle a "noclone" attribute; arguments as in
6814 struct attribute_spec.handler. */
6815
6816static tree
6817handle_noclone_attribute (tree *node, tree name,
6818 tree ARG_UNUSED (args),
6819 int ARG_UNUSED (flags), bool *no_add_attrs)
6820{
6821 if (TREE_CODE (*node) != FUNCTION_DECL)
6822 {
6823 warning (OPT_Wattributes, "%qE attribute ignored", name);
6824 *no_add_attrs = true;
6825 }
6826
6827 return NULL_TREE;
6828}
6829
185c9e56
ML		 6830/* Handle a "no_icf" attribute; arguments as in
6831 struct attribute_spec.handler. */
6832
6833static tree
6834handle_noicf_attribute (tree *node, tree name,
6835 tree ARG_UNUSED (args),
6836 int ARG_UNUSED (flags), bool *no_add_attrs)
6837{
6838 if (TREE_CODE (*node) != FUNCTION_DECL)
6839 {
6840 warning (OPT_Wattributes, "%qE attribute ignored", name);
6841 *no_add_attrs = true;
6842 }
6843
6844 return NULL_TREE;
6845}
6846
6847
349ae713
NB		 6848/* Handle a "always_inline" attribute; arguments as in
6849 struct attribute_spec.handler. */
6850
6851static tree
35b1a6fa 6852handle_always_inline_attribute (tree *node, tree name,
e18476eb
BI		 6853 tree ARG_UNUSED (args),
6854 int ARG_UNUSED (flags),
a742c759 6855 bool *no_add_attrs)
349ae713
NB		 6856{
6857 if (TREE_CODE (*node) == FUNCTION_DECL)
6858 {
45484dcf
MP		 6859 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node)))
6860 {
6861 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6862 "with %qs attribute", name, "noinline");
6863 *no_add_attrs = true;
6864 }
3b1661a9
ES		 6865 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
6866 {
6867 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6868 "with %qs attribute", name, "target_clones");
6869 *no_add_attrs = true;
6870 }
45484dcf
MP		 6871 else
6872 /* Set the attribute and mark it for disregarding inline
6873 limits. */
6874 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
349ae713
NB		 6875 }
6876 else
6877 {
5c498b10 6878 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713 6879 *no_add_attrs = true;
4eb7fd83
JJ		 6880 }
6881
6882 return NULL_TREE;
6883}
6884
6885/* Handle a "gnu_inline" attribute; arguments as in
6886 struct attribute_spec.handler. */
6887
6888static tree
6889handle_gnu_inline_attribute (tree *node, tree name,
6890 tree ARG_UNUSED (args),
6891 int ARG_UNUSED (flags),
6892 bool *no_add_attrs)
6893{
6894 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6895 {
6896 /* Do nothing else, just set the attribute. We'll get at
6897 it later with lookup_attribute. */
6898 }
6899 else
6900 {
6901 warning (OPT_Wattributes, "%qE attribute ignored", name);
6902 *no_add_attrs = true;
46a4da10
JH		 6903 }
6904
6905 return NULL_TREE;
6906}
6907
6908/* Handle a "leaf" attribute; arguments as in
6909 struct attribute_spec.handler. */
6910
6911static tree
6912handle_leaf_attribute (tree *node, tree name,
6913 tree ARG_UNUSED (args),
6914 int ARG_UNUSED (flags), bool *no_add_attrs)
6915{
6916 if (TREE_CODE (*node) != FUNCTION_DECL)
6917 {
6918 warning (OPT_Wattributes, "%qE attribute ignored", name);
6919 *no_add_attrs = true;
6920 }
6921 if (!TREE_PUBLIC (*node))
6922 {
6923 warning (OPT_Wattributes, "%qE attribute has no effect on unit local functions", name);
6924 *no_add_attrs = true;
349ae713
NB		 6925 }
6926
6927 return NULL_TREE;
6928}
6929
d752cfdb
JJ		 6930/* Handle an "artificial" attribute; arguments as in
6931 struct attribute_spec.handler. */
6932
6933static tree
6934handle_artificial_attribute (tree *node, tree name,
6935 tree ARG_UNUSED (args),
6936 int ARG_UNUSED (flags),
6937 bool *no_add_attrs)
6938{
6939 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6940 {
6941 /* Do nothing else, just set the attribute. We'll get at
6942 it later with lookup_attribute. */
6943 }
6944 else
6945 {
6946 warning (OPT_Wattributes, "%qE attribute ignored", name);
6947 *no_add_attrs = true;
6948 }
6949
6950 return NULL_TREE;
6951}
6952
0691d1d4
RG		 6953/* Handle a "flatten" attribute; arguments as in
6954 struct attribute_spec.handler. */
6955
6956static tree
6957handle_flatten_attribute (tree *node, tree name,
c22cacf3
MS		 6958 tree args ATTRIBUTE_UNUSED,
6959 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
0691d1d4
RG		 6960{
6961 if (TREE_CODE (*node) == FUNCTION_DECL)
6962 /* Do nothing else, just set the attribute. We'll get at
6963 it later with lookup_attribute. */
6964 ;
6965 else
6966 {
6967 warning (OPT_Wattributes, "%qE attribute ignored", name);
6968 *no_add_attrs = true;
6969 }
6970
6971 return NULL_TREE;
6972}
6973
d2af6a68
JJ		 6974/* Handle a "warning" or "error" attribute; arguments as in
6975 struct attribute_spec.handler. */
6976
6977static tree
6978handle_error_attribute (tree *node, tree name, tree args,
6979 int ARG_UNUSED (flags), bool *no_add_attrs)
6980{
6981 if (TREE_CODE (*node) == FUNCTION_DECL
cf35e2b1 6982 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
d2af6a68
JJ		 6983 /* Do nothing else, just set the attribute. We'll get at
6984 it later with lookup_attribute. */
6985 ;
6986 else
6987 {
6988 warning (OPT_Wattributes, "%qE attribute ignored", name);
6989 *no_add_attrs = true;
6990 }
6991
6992 return NULL_TREE;
6993}
0691d1d4 6994
349ae713
NB		 6995/* Handle a "used" attribute; arguments as in
6996 struct attribute_spec.handler. */
6997
6998static tree
e18476eb
BI		 6999handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
7000 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 7001{
d7ddbe24
RH		 7002 tree node = *pnode;
7003
7004 if (TREE_CODE (node) == FUNCTION_DECL
0ae9bd27 7005 || (VAR_P (node) && TREE_STATIC (node))
3797cb21 7006 || (TREE_CODE (node) == TYPE_DECL))
4d7d0451 7007 {
4d7d0451 7008 TREE_USED (node) = 1;
8e3e233b 7009 DECL_PRESERVE_P (node) = 1;
0ae9bd27 7010 if (VAR_P (node))
ebfbbdc5 7011 DECL_READ_P (node) = 1;
4d7d0451 7012 }
349ae713
NB		 7013 else
7014 {
5c498b10 7015 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7016 *no_add_attrs = true;
7017 }
7018
7019 return NULL_TREE;
7020}
7021
7022/* Handle a "unused" attribute; arguments as in
7023 struct attribute_spec.handler. */
7024
7025static tree
e18476eb
BI		 7026handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7027 int flags, bool *no_add_attrs)
349ae713
NB		 7028{
7029 if (DECL_P (*node))
7030 {
7031 tree decl = *node;
7032
7033 if (TREE_CODE (decl) == PARM_DECL
af05e6e5 7034 || VAR_OR_FUNCTION_DECL_P (decl)
349ae713
NB		 7035 || TREE_CODE (decl) == LABEL_DECL
7036 || TREE_CODE (decl) == TYPE_DECL)
ebfbbdc5
JJ		 7037 {
7038 TREE_USED (decl) = 1;
0ae9bd27 7039 if (VAR_P (decl) || TREE_CODE (decl) == PARM_DECL)
ebfbbdc5
JJ		 7040 DECL_READ_P (decl) = 1;
7041 }
349ae713
NB		 7042 else
7043 {
5c498b10 7044 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7045 *no_add_attrs = true;
7046 }
7047 }
7048 else
7049 {
7050 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 7051 *node = build_variant_type_copy (*node);
349ae713
NB		 7052 TREE_USED (*node) = 1;
7053 }
7054
7055 return NULL_TREE;
7056}
7057
ce91e74c
JH		 7058/* Handle a "externally_visible" attribute; arguments as in
7059 struct attribute_spec.handler. */
7060
7061static tree
7062handle_externally_visible_attribute (tree *pnode, tree name,
7063 tree ARG_UNUSED (args),
7064 int ARG_UNUSED (flags),
7065 bool *no_add_attrs)
7066{
7067 tree node = *pnode;
7068
21b634ae 7069 if (VAR_OR_FUNCTION_DECL_P (node))
ce91e74c 7070 {
343d4b27
JJ		 7071 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
7072 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
7073 {
7074 warning (OPT_Wattributes,
7075 "%qE attribute have effect only on public objects", name);
7076 *no_add_attrs = true;
7077 }
ce91e74c 7078 }
ce91e74c
JH		 7079 else
7080 {
7081 warning (OPT_Wattributes, "%qE attribute ignored", name);
7082 *no_add_attrs = true;
7083 }
7084
7085 return NULL_TREE;
7086}
7087
7861b648
AK		 7088/* Handle the "no_reorder" attribute. Arguments as in
7089 struct attribute_spec.handler. */
7090
7091static tree
7092handle_no_reorder_attribute (tree *pnode,
7093 tree name,
7094 tree,
7095 int,
7096 bool *no_add_attrs)
7097{
7098 tree node = *pnode;
7099
21b634ae 7100 if (!VAR_OR_FUNCTION_DECL_P (node)
7861b648
AK		 7101 && !(TREE_STATIC (node) || DECL_EXTERNAL (node)))
7102 {
7103 warning (OPT_Wattributes,
7104 "%qE attribute only affects top level objects",
7105 name);
7106 *no_add_attrs = true;
7107 }
7108
7109 return NULL_TREE;
7110}
7111
349ae713
NB		 7112/* Handle a "const" attribute; arguments as in
7113 struct attribute_spec.handler. */
7114
7115static tree
e18476eb
BI		 7116handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7117 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7118{
7119 tree type = TREE_TYPE (*node);
7120
7121 /* See FIXME comment on noreturn in c_common_attribute_table. */
7122 if (TREE_CODE (*node) == FUNCTION_DECL)
7123 TREE_READONLY (*node) = 1;
7124 else if (TREE_CODE (type) == POINTER_TYPE
7125 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
7126 TREE_TYPE (*node)
6e7ceb17
PC		 7127 = (build_qualified_type
7128 (build_pointer_type
7129 (build_type_variant (TREE_TYPE (type), 1,
7130 TREE_THIS_VOLATILE (TREE_TYPE (type)))),
7131 TYPE_QUALS (type)));
349ae713
NB		 7132 else
7133 {
5c498b10 7134 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7135 *no_add_attrs = true;
7136 }
7137
7138 return NULL_TREE;
7139}
7140
ee45a32d
EB		 7141/* Handle a "scalar_storage_order" attribute; arguments as in
7142 struct attribute_spec.handler. */
7143
7144static tree
7145handle_scalar_storage_order_attribute (tree *node, tree name, tree args,
7146 int flags, bool *no_add_attrs)
7147{
7148 tree id = TREE_VALUE (args);
7149 tree type;
7150
7151 if (TREE_CODE (*node) == TYPE_DECL
7152 && ! (flags & ATTR_FLAG_CXX11))
7153 node = &TREE_TYPE (*node);
7154 type = *node;
7155
7156 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN)
7157 {
7158 error ("scalar_storage_order is not supported because endianness "
7159 "is not uniform");
7160 return NULL_TREE;
7161 }
7162
7163 if (RECORD_OR_UNION_TYPE_P (type) && !c_dialect_cxx ())
7164 {
7165 bool reverse = false;
7166
7167 if (TREE_CODE (id) == STRING_CST
7168 && strcmp (TREE_STRING_POINTER (id), "big-endian") == 0)
7169 reverse = !BYTES_BIG_ENDIAN;
7170 else if (TREE_CODE (id) == STRING_CST
7171 && strcmp (TREE_STRING_POINTER (id), "little-endian") == 0)
7172 reverse = BYTES_BIG_ENDIAN;
7173 else
7174 {
7175 error ("scalar_storage_order argument must be one of \"big-endian\""
7176 " or \"little-endian\"");
7177 return NULL_TREE;
7178 }
7179
7180 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7181 {
7182 if (reverse)
7183 /* A type variant isn't good enough, since we don't want a cast
7184 to such a type to be removed as a no-op. */
7185 *node = type = build_duplicate_type (type);
7186 }
7187
7188 TYPE_REVERSE_STORAGE_ORDER (type) = reverse;
7189 return NULL_TREE;
7190 }
7191
7192 warning (OPT_Wattributes, "%qE attribute ignored", name);
7193 *no_add_attrs = true;
7194 return NULL_TREE;
7195}
7196
349ae713
NB		 7197/* Handle a "transparent_union" attribute; arguments as in
7198 struct attribute_spec.handler. */
7199
7200static tree
35b1a6fa 7201handle_transparent_union_attribute (tree *node, tree name,
e18476eb 7202 tree ARG_UNUSED (args), int flags,
a742c759 7203 bool *no_add_attrs)
349ae713 7204{
4009f2e7 7205 tree type;
52dd234b
RH		 7206
7207 *no_add_attrs = true;
349ae713 7208
e28d52cf
DS		 7209 if (TREE_CODE (*node) == TYPE_DECL
7210 && ! (flags & ATTR_FLAG_CXX11))
4009f2e7
JM		 7211 node = &TREE_TYPE (*node);
7212 type = *node;
349ae713 7213
52dd234b 7214 if (TREE_CODE (type) == UNION_TYPE)
349ae713 7215 {
d58d6eb5
JM		 7216 /* Make sure that the first field will work for a transparent union.
7217 If the type isn't complete yet, leave the check to the code in
7218 finish_struct. */
7219 if (TYPE_SIZE (type))
7220 {
7221 tree first = first_field (type);
7222 if (first == NULL_TREE
7223 || DECL_ARTIFICIAL (first)
7224 || TYPE_MODE (type) != DECL_MODE (first))
7225 goto ignored;
7226 }
7227
349ae713 7228 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
52dd234b 7229 {
d58d6eb5
JM		 7230 /* If the type isn't complete yet, setting the flag
7231 on a variant wouldn't ever be checked. */
7232 if (!TYPE_SIZE (type))
7233 goto ignored;
7234
7235 /* build_duplicate_type doesn't work for C++. */
7236 if (c_dialect_cxx ())
52dd234b
RH		 7237 goto ignored;
7238
ee45a32d
EB		 7239 /* A type variant isn't good enough, since we don't want a cast
7240 to such a type to be removed as a no-op. */
52dd234b
RH		 7241 *node = type = build_duplicate_type (type);
7242 }
7243
75c8aac3
JH		 7244 for (tree t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7245 TYPE_TRANSPARENT_AGGR (t) = 1;
52dd234b 7246 return NULL_TREE;
349ae713
NB		 7247 }
7248
52dd234b
RH		 7249 ignored:
7250 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7251 return NULL_TREE;
7252}
7253
fc8600f9
MM		 7254/* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7255 get the requested priority for a constructor or destructor,
7256 possibly issuing diagnostics for invalid or reserved
7257 priorities. */
7258
7259static priority_type
7260get_priority (tree args, bool is_destructor)
7261{
7262 HOST_WIDE_INT pri;
b2f4bed8 7263 tree arg;
fc8600f9
MM		 7264
7265 if (!args)
7266 return DEFAULT_INIT_PRIORITY;
b8698a0f 7267
f6fc5c86
MM		 7268 if (!SUPPORTS_INIT_PRIORITY)
7269 {
7270 if (is_destructor)
7271 error ("destructor priorities are not supported");
7272 else
7273 error ("constructor priorities are not supported");
7274 return DEFAULT_INIT_PRIORITY;
7275 }
7276
b2f4bed8 7277 arg = TREE_VALUE (args);
fad7652e
JJ		 7278 if (TREE_CODE (arg) == IDENTIFIER_NODE)
7279 goto invalid;
7280 if (arg == error_mark_node)
7281 return DEFAULT_INIT_PRIORITY;
8d0d1915 7282 arg = default_conversion (arg);
9541ffee 7283 if (!tree_fits_shwi_p (arg)
b2f4bed8 7284 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
fc8600f9
MM		 7285 goto invalid;
7286
9439e9a1 7287 pri = tree_to_shwi (arg);
fc8600f9
MM		 7288 if (pri < 0 || pri > MAX_INIT_PRIORITY)
7289 goto invalid;
7290
7291 if (pri <= MAX_RESERVED_INIT_PRIORITY)
7292 {
7293 if (is_destructor)
7294 warning (0,
7295 "destructor priorities from 0 to %d are reserved "
b8698a0f 7296 "for the implementation",
fc8600f9
MM		 7297 MAX_RESERVED_INIT_PRIORITY);
7298 else
7299 warning (0,
7300 "constructor priorities from 0 to %d are reserved "
b8698a0f 7301 "for the implementation",
fc8600f9
MM		 7302 MAX_RESERVED_INIT_PRIORITY);
7303 }
7304 return pri;
7305
7306 invalid:
7307 if (is_destructor)
7308 error ("destructor priorities must be integers from 0 to %d inclusive",
7309 MAX_INIT_PRIORITY);
7310 else
7311 error ("constructor priorities must be integers from 0 to %d inclusive",
7312 MAX_INIT_PRIORITY);
7313 return DEFAULT_INIT_PRIORITY;
7314}
7315
349ae713
NB		 7316/* Handle a "constructor" attribute; arguments as in
7317 struct attribute_spec.handler. */
7318
7319static tree
fc8600f9 7320handle_constructor_attribute (tree *node, tree name, tree args,
e18476eb 7321 int ARG_UNUSED (flags),
a742c759 7322 bool *no_add_attrs)
349ae713
NB		 7323{
7324 tree decl = *node;
7325 tree type = TREE_TYPE (decl);
7326
7327 if (TREE_CODE (decl) == FUNCTION_DECL
7328 && TREE_CODE (type) == FUNCTION_TYPE
7329 && decl_function_context (decl) == 0)
7330 {
fc8600f9 7331 priority_type priority;
349ae713 7332 DECL_STATIC_CONSTRUCTOR (decl) = 1;
fc8600f9
MM		 7333 priority = get_priority (args, /*is_destructor=*/false);
7334 SET_DECL_INIT_PRIORITY (decl, priority);
349ae713
NB		 7335 TREE_USED (decl) = 1;
7336 }
7337 else
7338 {
5c498b10 7339 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7340 *no_add_attrs = true;
7341 }
7342
7343 return NULL_TREE;
7344}
7345
7346/* Handle a "destructor" attribute; arguments as in
7347 struct attribute_spec.handler. */
7348
7349static tree
fc8600f9 7350handle_destructor_attribute (tree *node, tree name, tree args,
e18476eb 7351 int ARG_UNUSED (flags),
a742c759 7352 bool *no_add_attrs)
349ae713
NB		 7353{
7354 tree decl = *node;
7355 tree type = TREE_TYPE (decl);
7356
7357 if (TREE_CODE (decl) == FUNCTION_DECL
7358 && TREE_CODE (type) == FUNCTION_TYPE
7359 && decl_function_context (decl) == 0)
7360 {
fc8600f9 7361 priority_type priority;
349ae713 7362 DECL_STATIC_DESTRUCTOR (decl) = 1;
fc8600f9
MM		 7363 priority = get_priority (args, /*is_destructor=*/true);
7364 SET_DECL_FINI_PRIORITY (decl, priority);
349ae713
NB		 7365 TREE_USED (decl) = 1;
7366 }
7367 else
7368 {
5c498b10 7369 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7370 *no_add_attrs = true;
7371 }
7372
7373 return NULL_TREE;
7374}
7375
4d451982
MLI		 7376/* Nonzero if the mode is a valid vector mode for this architecture.
7377 This returns nonzero even if there is no hardware support for the
7378 vector mode, but we can emulate with narrower modes. */
7379
7380static int
ef4bddc2 7381vector_mode_valid_p (machine_mode mode)
4d451982
MLI		 7382{
7383 enum mode_class mclass = GET_MODE_CLASS (mode);
ef4bddc2 7384 machine_mode innermode;
4d451982
MLI		 7385
7386 /* Doh! What's going on? */
7387 if (mclass != MODE_VECTOR_INT
7388 && mclass != MODE_VECTOR_FLOAT
7389 && mclass != MODE_VECTOR_FRACT
7390 && mclass != MODE_VECTOR_UFRACT
7391 && mclass != MODE_VECTOR_ACCUM
7392 && mclass != MODE_VECTOR_UACCUM)
7393 return 0;
7394
7395 /* Hardware support. Woo hoo! */
7396 if (targetm.vector_mode_supported_p (mode))
7397 return 1;
7398
7399 innermode = GET_MODE_INNER (mode);
7400
7401 /* We should probably return 1 if requesting V4DI and we have no DI,
7402 but we have V2DI, but this is probably very unlikely. */
7403
7404 /* If we have support for the inner mode, we can safely emulate it.
7405 We may not have V2DI, but me can emulate with a pair of DIs. */
7406 return targetm.scalar_mode_supported_p (innermode);
7407}
7408
7409
349ae713
NB		 7410/* Handle a "mode" attribute; arguments as in
7411 struct attribute_spec.handler. */
7412
7413static tree
e18476eb
BI		 7414handle_mode_attribute (tree *node, tree name, tree args,
7415 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7416{
7417 tree type = *node;
88388a52 7418 tree ident = TREE_VALUE (args);
349ae713
NB		 7419
7420 *no_add_attrs = true;
7421
88388a52 7422 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5c498b10 7423 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7424 else
7425 {
7426 int j;
88388a52 7427 const char *p = IDENTIFIER_POINTER (ident);
349ae713 7428 int len = strlen (p);
ef4bddc2 7429 machine_mode mode = VOIDmode;
349ae713 7430 tree typefm;
6dd53648 7431 bool valid_mode;
349ae713
NB		 7432
7433 if (len > 4 && p[0] == '_' && p[1] == '_'
7434 && p[len - 1] == '_' && p[len - 2] == '_')
7435 {
28dab132 7436 char *newp = (char *) alloca (len - 1);
349ae713
NB		 7437
7438 strcpy (newp, &p[2]);
7439 newp[len - 4] = '\0';
7440 p = newp;
7441 }
7442
7443 /* Change this type to have a type with the specified mode.
7444 First check for the special modes. */
3f75a254 7445 if (!strcmp (p, "byte"))
349ae713
NB		 7446 mode = byte_mode;
7447 else if (!strcmp (p, "word"))
7448 mode = word_mode;
3f75a254 7449 else if (!strcmp (p, "pointer"))
349ae713 7450 mode = ptr_mode;
c7ff6e7a
AK		 7451 else if (!strcmp (p, "libgcc_cmp_return"))
7452 mode = targetm.libgcc_cmp_return_mode ();
7453 else if (!strcmp (p, "libgcc_shift_count"))
7454 mode = targetm.libgcc_shift_count_mode ();
7b0518e3
UW		 7455 else if (!strcmp (p, "unwind_word"))
7456 mode = targetm.unwind_word_mode ();
349ae713
NB		 7457 else
7458 for (j = 0; j < NUM_MACHINE_MODES; j++)
7459 if (!strcmp (p, GET_MODE_NAME (j)))
61f03aba 7460 {
ef4bddc2 7461 mode = (machine_mode) j;
61f03aba
RH		 7462 break;
7463 }
349ae713
NB		 7464
7465 if (mode == VOIDmode)
4a5eab38 7466 {
88388a52 7467 error ("unknown machine mode %qE", ident);
4a5eab38
PB		 7468 return NULL_TREE;
7469 }
7470
6dd53648
RH		 7471 valid_mode = false;
7472 switch (GET_MODE_CLASS (mode))
4a5eab38 7473 {
6dd53648
RH		 7474 case MODE_INT:
7475 case MODE_PARTIAL_INT:
7476 case MODE_FLOAT:
9a8ce21f 7477 case MODE_DECIMAL_FLOAT:
ab22c1fa
CF		 7478 case MODE_FRACT:
7479 case MODE_UFRACT:
7480 case MODE_ACCUM:
7481 case MODE_UACCUM:
6dd53648
RH		 7482 valid_mode = targetm.scalar_mode_supported_p (mode);
7483 break;
7484
7485 case MODE_COMPLEX_INT:
7486 case MODE_COMPLEX_FLOAT:
7487 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
7488 break;
7489
7490 case MODE_VECTOR_INT:
7491 case MODE_VECTOR_FLOAT:
ab22c1fa
CF		 7492 case MODE_VECTOR_FRACT:
7493 case MODE_VECTOR_UFRACT:
7494 case MODE_VECTOR_ACCUM:
7495 case MODE_VECTOR_UACCUM:
5c498b10
DD		 7496 warning (OPT_Wattributes, "specifying vector types with "
7497 "__attribute__ ((mode)) is deprecated");
7498 warning (OPT_Wattributes,
7499 "use __attribute__ ((vector_size)) instead");
6dd53648
RH		 7500 valid_mode = vector_mode_valid_p (mode);
7501 break;
4a5eab38 7502
6dd53648
RH		 7503 default:
7504 break;
7505 }
7506 if (!valid_mode)
7507 {
9e637a26 7508 error ("unable to emulate %qs", p);
6dd53648
RH		 7509 return NULL_TREE;
7510 }
4a5eab38 7511
6dd53648 7512 if (POINTER_TYPE_P (type))
cb2a532e 7513 {
36c5e70a 7514 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
ef4bddc2 7515 tree (*fn)(tree, machine_mode, bool);
6dd53648 7516
36c5e70a 7517 if (!targetm.addr_space.valid_pointer_mode (mode, as))
cb2a532e 7518 {
9e637a26 7519 error ("invalid pointer mode %qs", p);
cb2a532e
AH		 7520 return NULL_TREE;
7521 }
7522
c22cacf3 7523 if (TREE_CODE (type) == POINTER_TYPE)
6dd53648 7524 fn = build_pointer_type_for_mode;
4977bab6 7525 else
6dd53648
RH		 7526 fn = build_reference_type_for_mode;
7527 typefm = fn (TREE_TYPE (type), mode, false);
cb2a532e 7528 }
6dd53648 7529 else
ab22c1fa
CF		 7530 {
7531 /* For fixed-point modes, we need to test if the signness of type
7532 and the machine mode are consistent. */
7533 if (ALL_FIXED_POINT_MODE_P (mode)
7534 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
7535 {
d8a07487 7536 error ("signedness of type and machine mode %qs don%'t match", p);
ab22c1fa
CF		 7537 return NULL_TREE;
7538 }
7539 /* For fixed-point modes, we need to pass saturating info. */
7540 typefm = lang_hooks.types.type_for_mode (mode,
7541 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
7542 : TYPE_UNSIGNED (type));
7543 }
ec8465a5 7544
6dd53648
RH		 7545 if (typefm == NULL_TREE)
7546 {
61f03aba 7547 error ("no data type for mode %qs", p);
6dd53648
RH		 7548 return NULL_TREE;
7549 }
ec8465a5
RK		 7550 else if (TREE_CODE (type) == ENUMERAL_TYPE)
7551 {
7552 /* For enumeral types, copy the precision from the integer
7553 type returned above. If not an INTEGER_TYPE, we can't use
7554 this mode for this type. */
7555 if (TREE_CODE (typefm) != INTEGER_TYPE)
7556 {
61f03aba 7557 error ("cannot use mode %qs for enumeral types", p);
ec8465a5
RK		 7558 return NULL_TREE;
7559 }
7560
99db1ef0
RH		 7561 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
7562 {
7563 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
7564 typefm = type;
7565 }
7566 else
7567 {
7568 /* We cannot build a type variant, as there's code that assumes
7569 that TYPE_MAIN_VARIANT has the same mode. This includes the
7570 debug generators. Instead, create a subrange type. This
7571 results in all of the enumeral values being emitted only once
7572 in the original, and the subtype gets them by reference. */
7573 if (TYPE_UNSIGNED (type))
7574 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
7575 else
7576 typefm = make_signed_type (TYPE_PRECISION (typefm));
7577 TREE_TYPE (typefm) = type;
7578 }
ec8465a5 7579 }
a2d36602
RH		 7580 else if (VECTOR_MODE_P (mode)
7581 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
7582 : TREE_CODE (type) != TREE_CODE (typefm))
61f03aba
RH		 7583 {
7584 error ("mode %qs applied to inappropriate type", p);
7585 return NULL_TREE;
7586 }
7587
6dd53648 7588 *node = typefm;
349ae713
NB		 7589 }
7590
7591 return NULL_TREE;
7592}
7593
7594/* Handle a "section" attribute; arguments as in
7595 struct attribute_spec.handler. */
7596
7597static tree
e18476eb
BI		 7598handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7599 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 7600{
7601 tree decl = *node;
7602
0373796b 7603 if (!targetm_common.have_named_sections)
349ae713 7604 {
0373796b
JT		 7605 error_at (DECL_SOURCE_LOCATION (*node),
7606 "section attributes are not supported for this target");
7607 goto fail;
7608 }
9fb32434 7609
0373796b 7610 user_defined_section_attribute = true;
349ae713 7611
21b634ae 7612 if (!VAR_OR_FUNCTION_DECL_P (decl))
0373796b
JT		 7613 {
7614 error ("section attribute not allowed for %q+D", *node);
7615 goto fail;
349ae713 7616 }
0373796b
JT		 7617
7618 if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
349ae713 7619 {
0373796b
JT		 7620 error ("section attribute argument not a string constant");
7621 goto fail;
349ae713
NB		 7622 }
7623
0ae9bd27 7624 if (VAR_P (decl)
0373796b
JT		 7625 && current_function_decl != NULL_TREE
7626 && !TREE_STATIC (decl))
7627 {
7628 error_at (DECL_SOURCE_LOCATION (decl),
7629 "section attribute cannot be specified for local variables");
7630 goto fail;
7631 }
7632
7633 /* The decl may have already been given a section attribute
7634 from a previous declaration. Ensure they match. */
7635 if (DECL_SECTION_NAME (decl) != NULL
7636 && strcmp (DECL_SECTION_NAME (decl),
7637 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
7638 {
7639 error ("section of %q+D conflicts with previous declaration", *node);
7640 goto fail;
7641 }
7642
0ae9bd27 7643 if (VAR_P (decl)
0373796b
JT		 7644 && !targetm.have_tls && targetm.emutls.tmpl_section
7645 && DECL_THREAD_LOCAL_P (decl))
7646 {
7647 error ("section of %q+D cannot be overridden", *node);
7648 goto fail;
7649 }
7650
7651 set_decl_section_name (decl, TREE_STRING_POINTER (TREE_VALUE (args)));
7652 return NULL_TREE;
7653
7654fail:
7655 *no_add_attrs = true;
349ae713
NB		 7656 return NULL_TREE;
7657}
7658
d19fa6b5
JM		 7659/* Check whether ALIGN is a valid user-specified alignment. If so,
7660 return its base-2 log; if not, output an error and return -1. If
7661 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7662 no error. */
7663int
7664check_user_alignment (const_tree align, bool allow_zero)
7665{
7666 int i;
7667
661a0813
MP		 7668 if (error_operand_p (align))
7669 return -1;
a859517f
MP		 7670 if (TREE_CODE (align) != INTEGER_CST
7671 || !INTEGRAL_TYPE_P (TREE_TYPE (align)))
d19fa6b5
JM		 7672 {
7673 error ("requested alignment is not an integer constant");
7674 return -1;
7675 }
7676 else if (allow_zero && integer_zerop (align))
7677 return -1;
3f12f6e9
SKS		 7678 else if (tree_int_cst_sgn (align) == -1
7679 || (i = tree_log2 (align)) == -1)
d19fa6b5 7680 {
3f12f6e9 7681 error ("requested alignment is not a positive power of 2");
d19fa6b5
JM		 7682 return -1;
7683 }
7684 else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG)
7685 {
7686 error ("requested alignment is too large");
7687 return -1;
7688 }
7689 return i;
7690}
7691
e28d52cf
DS		 7692/*
7693 If in c++-11, check if the c++-11 alignment constraint with respect
7694 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7695 c++-11 mode, does nothing.
7696
7697 [dcl.align]2/ says:
7698
7699 [* if the constant expression evaluates to a fundamental alignment,
7700 the alignment requirement of the declared entity shall be the
7701 specified fundamental alignment.
7702
7703 * if the constant expression evaluates to an extended alignment
7704 and the implementation supports that alignment in the context
7705 of the declaration, the alignment of the declared entity shall
7706 be that alignment
7707
7708 * if the constant expression evaluates to an extended alignment
7709 and the implementation does not support that alignment in the
7710 context of the declaration, the program is ill-formed]. */
7711
7712static bool
7713check_cxx_fundamental_alignment_constraints (tree node,
7714 unsigned align_log,
7715 int flags)
7716{
7717 bool alignment_too_large_p = false;
7718 unsigned requested_alignment = 1U << align_log;
7719 unsigned max_align = 0;
7720
7721 if ((!(flags & ATTR_FLAG_CXX11) && !warn_cxx_compat)
7722 || (node == NULL_TREE || node == error_mark_node))
7723 return true;
7724
7725 if (cxx_fundamental_alignment_p (requested_alignment))
7726 return true;
7727
7728 if (DECL_P (node))
7729 {
7730 if (TREE_STATIC (node))
7731 {
7732 /* For file scope variables and static members, the target
7733 supports alignments that are at most
7734 MAX_OFILE_ALIGNMENT. */
7735 if (requested_alignment > (max_align = MAX_OFILE_ALIGNMENT))
7736 alignment_too_large_p = true;
7737 }
7738 else
7739 {
7740#ifdef BIGGEST_FIELD_ALIGNMENT
7741#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7742#else
7743#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7744#endif
7745 /* For non-static members, the target supports either
7746 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7747 if it is defined or BIGGEST_ALIGNMENT. */
7748 max_align = MAX_TARGET_FIELD_ALIGNMENT;
7749 if (TREE_CODE (node) == FIELD_DECL
7750 && requested_alignment > (max_align = MAX_TARGET_FIELD_ALIGNMENT))
7751 alignment_too_large_p = true;
7752#undef MAX_TARGET_FIELD_ALIGNMENT
7753 /* For stack variables, the target supports at most
7754 MAX_STACK_ALIGNMENT. */
7755 else if (decl_function_context (node) != NULL
7756 && requested_alignment > (max_align = MAX_STACK_ALIGNMENT))
7757 alignment_too_large_p = true;
7758 }
7759 }
7760 else if (TYPE_P (node))
7761 {
7762 /* Let's be liberal for types. */
7763 if (requested_alignment > (max_align = BIGGEST_ALIGNMENT))
7764 alignment_too_large_p = true;
7765 }
7766
7767 if (alignment_too_large_p)
7768 pedwarn (input_location, OPT_Wattributes,
7769 "requested alignment %d is larger than %d",
7770 requested_alignment, max_align);
7771
7772 return !alignment_too_large_p;
7773}
7774
349ae713
NB		 7775/* Handle a "aligned" attribute; arguments as in
7776 struct attribute_spec.handler. */
7777
7778static tree
e18476eb 7779handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
a742c759 7780 int flags, bool *no_add_attrs)
349ae713
NB		 7781{
7782 tree decl = NULL_TREE;
7783 tree *type = NULL;
7784 int is_type = 0;
5d77fb19 7785 tree align_expr;
349ae713
NB		 7786 int i;
7787
5d77fb19
MG		 7788 if (args)
7789 {
7790 align_expr = TREE_VALUE (args);
661a0813
MP		 7791 if (align_expr && TREE_CODE (align_expr) != IDENTIFIER_NODE
7792 && TREE_CODE (align_expr) != FUNCTION_DECL)
5d77fb19
MG		 7793 align_expr = default_conversion (align_expr);
7794 }
7795 else
7796 align_expr = size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT);
7797
349ae713
NB		 7798 if (DECL_P (*node))
7799 {
7800 decl = *node;
7801 type = &TREE_TYPE (decl);
7802 is_type = TREE_CODE (*node) == TYPE_DECL;
7803 }
7804 else if (TYPE_P (*node))
7805 type = node, is_type = 1;
7806
e28d52cf
DS		 7807 if ((i = check_user_alignment (align_expr, false)) == -1
7808 || !check_cxx_fundamental_alignment_constraints (*node, i, flags))
d19fa6b5 7809 *no_add_attrs = true;
349ae713
NB		 7810 else if (is_type)
7811 {
0f559c16
JM		 7812 if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7813 /* OK, modify the type in place. */;
349ae713
NB		 7814 /* If we have a TYPE_DECL, then copy the type, so that we
7815 don't accidentally modify a builtin type. See pushdecl. */
0f559c16
JM		 7816 else if (decl && TREE_TYPE (decl) != error_mark_node
7817 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
349ae713
NB		 7818 {
7819 tree tt = TREE_TYPE (decl);
8dd16ecc 7820 *type = build_variant_type_copy (*type);
349ae713
NB		 7821 DECL_ORIGINAL_TYPE (decl) = tt;
7822 TYPE_NAME (*type) = decl;
7823 TREE_USED (*type) = TREE_USED (decl);
7824 TREE_TYPE (decl) = *type;
7825 }
0f559c16 7826 else
8dd16ecc 7827 *type = build_variant_type_copy (*type);
349ae713 7828
d9223014 7829 TYPE_ALIGN (*type) = (1U << i) * BITS_PER_UNIT;
349ae713
NB		 7830 TYPE_USER_ALIGN (*type) = 1;
7831 }
837edd5f 7832 else if (! VAR_OR_FUNCTION_DECL_P (decl)
349ae713
NB		 7833 && TREE_CODE (decl) != FIELD_DECL)
7834 {
dee15844 7835 error ("alignment may not be specified for %q+D", decl);
349ae713
NB		 7836 *no_add_attrs = true;
7837 }
e28d52cf
DS		 7838 else if (DECL_USER_ALIGN (decl)
7839 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
7840 /* C++-11 [dcl.align/4]:
7841
7842 When multiple alignment-specifiers are specified for an
7843 entity, the alignment requirement shall be set to the
7844 strictest specified alignment.
7845
7846 This formally comes from the c++11 specification but we are
7847 doing it for the GNU attribute syntax as well. */
7848 *no_add_attrs = true;
837edd5f 7849 else if (TREE_CODE (decl) == FUNCTION_DECL
d9223014 7850 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
837edd5f
GK		 7851 {
7852 if (DECL_USER_ALIGN (decl))
7853 error ("alignment for %q+D was previously specified as %d "
7854 "and may not be decreased", decl,
7855 DECL_ALIGN (decl) / BITS_PER_UNIT);
7856 else
7857 error ("alignment for %q+D must be at least %d", decl,
7858 DECL_ALIGN (decl) / BITS_PER_UNIT);
7859 *no_add_attrs = true;
7860 }
349ae713
NB		 7861 else
7862 {
d9223014 7863 DECL_ALIGN (decl) = (1U << i) * BITS_PER_UNIT;
349ae713
NB		 7864 DECL_USER_ALIGN (decl) = 1;
7865 }
7866
7867 return NULL_TREE;
7868}
7869
7870/* Handle a "weak" attribute; arguments as in
7871 struct attribute_spec.handler. */
7872
7873static tree
55af93a8 7874handle_weak_attribute (tree *node, tree name,
e18476eb
BI		 7875 tree ARG_UNUSED (args),
7876 int ARG_UNUSED (flags),
7877 bool * ARG_UNUSED (no_add_attrs))
349ae713 7878{
55af93a8 7879 if (TREE_CODE (*node) == FUNCTION_DECL
6b4e94bc
RG		 7880 && DECL_DECLARED_INLINE_P (*node))
7881 {
2aa9c6ae 7882 warning (OPT_Wattributes, "inline function %q+D declared weak", *node);
6b4e94bc
RG		 7883 *no_add_attrs = true;
7884 }
ba885ec5
NS		 7885 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
7886 {
7887 error ("indirect function %q+D cannot be declared weak", *node);
7888 *no_add_attrs = true;
7889 return NULL_TREE;
7890 }
21b634ae 7891 else if (VAR_OR_FUNCTION_DECL_P (*node))
c316b5e4 7892 declare_weak (*node);
55af93a8
DS		 7893 else
7894 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7895
7896 return NULL_TREE;
7897}
7898
4bb794e2
ST		 7899/* Handle a "noplt" attribute; arguments as in
7900 struct attribute_spec.handler. */
7901
7902static tree
7903handle_noplt_attribute (tree *node, tree name,
7904 tree ARG_UNUSED (args),
7905 int ARG_UNUSED (flags),
7906 bool * ARG_UNUSED (no_add_attrs))
7907{
7908 if (TREE_CODE (*node) != FUNCTION_DECL)
7909 {
7910 warning (OPT_Wattributes,
7911 "%qE attribute is only applicable on functions", name);
7912 *no_add_attrs = true;
7913 return NULL_TREE;
7914 }
7915 return NULL_TREE;
7916}
7917
ba885ec5
NS		 7918/* Handle an "alias" or "ifunc" attribute; arguments as in
7919 struct attribute_spec.handler, except that IS_ALIAS tells us
7920 whether this is an alias as opposed to ifunc attribute. */
349ae713
NB		 7921
7922static tree
ba885ec5
NS		 7923handle_alias_ifunc_attribute (bool is_alias, tree *node, tree name, tree args,
7924 bool *no_add_attrs)
349ae713
NB		 7925{
7926 tree decl = *node;
7927
ba885ec5 7928 if (TREE_CODE (decl) != FUNCTION_DECL
0ae9bd27 7929 && (!is_alias || !VAR_P (decl)))
feab5a67
JM		 7930 {
7931 warning (OPT_Wattributes, "%qE attribute ignored", name);
7932 *no_add_attrs = true;
7933 }
7934 else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
b8698a0f 7935 || (TREE_CODE (decl) != FUNCTION_DECL
a9b0b825
GK		 7936 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
7937 /* A static variable declaration is always a tentative definition,
7938 but the alias is a non-tentative definition which overrides. */
b8698a0f 7939 || (TREE_CODE (decl) != FUNCTION_DECL
a9b0b825 7940 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
349ae713 7941 {
ba885ec5 7942 error ("%q+D defined both normally and as %qE attribute", decl, name);
349ae713 7943 *no_add_attrs = true;
ba885ec5 7944 return NULL_TREE;
349ae713 7945 }
ba885ec5
NS		 7946 else if (!is_alias
7947 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
7948 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))))
7949 {
7950 error ("weak %q+D cannot be defined %qE", decl, name);
7951 *no_add_attrs = true;
7952 return NULL_TREE;
7953 }
f6a76b9f
RH		 7954
7955 /* Note that the very first time we process a nested declaration,
7956 decl_function_context will not be set. Indeed, *would* never
7957 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7958 we do below. After such frobbery, pushdecl would set the context.
7959 In any case, this is never what we want. */
7960 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
349ae713
NB		 7961 {
7962 tree id;
7963
7964 id = TREE_VALUE (args);
7965 if (TREE_CODE (id) != STRING_CST)
7966 {
ba885ec5 7967 error ("attribute %qE argument not a string", name);
349ae713
NB		 7968 *no_add_attrs = true;
7969 return NULL_TREE;
7970 }
7971 id = get_identifier (TREE_STRING_POINTER (id));
7972 /* This counts as a use of the object pointed to. */
7973 TREE_USED (id) = 1;
7974
7975 if (TREE_CODE (decl) == FUNCTION_DECL)
7976 DECL_INITIAL (decl) = error_mark_node;
7977 else
08346abd 7978 TREE_STATIC (decl) = 1;
ba885ec5
NS		 7979
7980 if (!is_alias)
7981 /* ifuncs are also aliases, so set that attribute too. */
7982 DECL_ATTRIBUTES (decl)
7983 = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
349ae713
NB		 7984 }
7985 else
7986 {
5c498b10 7987 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 7988 *no_add_attrs = true;
7989 }
7990
f7217cde
JH		 7991 if (decl_in_symtab_p (*node))
7992 {
7993 struct symtab_node *n = symtab_node::get (decl);
7994 if (n && n->refuse_visibility_changes)
7995 {
7996 if (is_alias)
7997 error ("%+D declared alias after being used", decl);
7998 else
7999 error ("%+D declared ifunc after being used", decl);
8000 }
8001 }
8002
8003
349ae713
NB		 8004 return NULL_TREE;
8005}
8006
ba885ec5
NS		 8007/* Handle an "alias" or "ifunc" attribute; arguments as in
8008 struct attribute_spec.handler. */
8009
8010static tree
8011handle_ifunc_attribute (tree *node, tree name, tree args,
8012 int ARG_UNUSED (flags), bool *no_add_attrs)
8013{
8014 return handle_alias_ifunc_attribute (false, node, name, args, no_add_attrs);
8015}
8016
8017/* Handle an "alias" or "ifunc" attribute; arguments as in
8018 struct attribute_spec.handler. */
8019
8020static tree
8021handle_alias_attribute (tree *node, tree name, tree args,
8022 int ARG_UNUSED (flags), bool *no_add_attrs)
8023{
8024 return handle_alias_ifunc_attribute (true, node, name, args, no_add_attrs);
8025}
8026
a0203ca7
AO		 8027/* Handle a "weakref" attribute; arguments as in struct
8028 attribute_spec.handler. */
8029
8030static tree
8031handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8032 int flags, bool *no_add_attrs)
8033{
8034 tree attr = NULL_TREE;
8035
e1cf56b1
AO		 8036 /* We must ignore the attribute when it is associated with
8037 local-scoped decls, since attribute alias is ignored and many
8038 such symbols do not even have a DECL_WEAK field. */
e7b012c0
JJ		 8039 if (decl_function_context (*node)
8040 || current_function_decl
21b634ae 8041 || !VAR_OR_FUNCTION_DECL_P (*node))
e1cf56b1
AO		 8042 {
8043 warning (OPT_Wattributes, "%qE attribute ignored", name);
8044 *no_add_attrs = true;
8045 return NULL_TREE;
8046 }
8047
ba885ec5
NS		 8048 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
8049 {
8050 error ("indirect function %q+D cannot be declared weakref", *node);
8051 *no_add_attrs = true;
8052 return NULL_TREE;
8053 }
8054
a0203ca7
AO		 8055 /* The idea here is that `weakref("name")' mutates into `weakref,
8056 alias("name")', and weakref without arguments, in turn,
8057 implicitly adds weak. */
8058
8059 if (args)
8060 {
8061 attr = tree_cons (get_identifier ("alias"), args, attr);
8062 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
8063
8064 *no_add_attrs = true;
a9b0b825
GK		 8065
8066 decl_attributes (node, attr, flags);
a0203ca7
AO		 8067 }
8068 else
8069 {
8070 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
c5d75364
MLI		 8071 error_at (DECL_SOURCE_LOCATION (*node),
8072 "weakref attribute must appear before alias attribute");
a0203ca7 8073
a9b0b825
GK		 8074 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8075 and that isn't supported; and because it wants to add it to
8076 the list of weak decls, which isn't helpful. */
8077 DECL_WEAK (*node) = 1;
a0203ca7
AO		 8078 }
8079
f7217cde
JH		 8080 if (decl_in_symtab_p (*node))
8081 {
8082 struct symtab_node *n = symtab_node::get (*node);
8083 if (n && n->refuse_visibility_changes)
8084 error ("%+D declared weakref after being used", *node);
8085 }
8086
a0203ca7
AO		 8087 return NULL_TREE;
8088}
8089
349ae713
NB		 8090/* Handle an "visibility" attribute; arguments as in
8091 struct attribute_spec.handler. */
8092
8093static tree
35b1a6fa 8094handle_visibility_attribute (tree *node, tree name, tree args,
e18476eb 8095 int ARG_UNUSED (flags),
b9e75696 8096 bool *ARG_UNUSED (no_add_attrs))
349ae713
NB		 8097{
8098 tree decl = *node;
968b41a1 8099 tree id = TREE_VALUE (args);
b9e75696 8100 enum symbol_visibility vis;
349ae713 8101
d7afec4b
ND		 8102 if (TYPE_P (*node))
8103 {
b9e75696
JM		 8104 if (TREE_CODE (*node) == ENUMERAL_TYPE)
8105 /* OK */;
a868811e 8106 else if (!RECORD_OR_UNION_TYPE_P (*node))
b9e75696
JM		 8107 {
8108 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
8109 name);
8110 return NULL_TREE;
8111 }
8112 else if (TYPE_FIELDS (*node))
8113 {
8114 error ("%qE attribute ignored because %qT is already defined",
8115 name, *node);
8116 return NULL_TREE;
8117 }
d7afec4b 8118 }
3f75a254 8119 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
349ae713 8120 {
5c498b10 8121 warning (OPT_Wattributes, "%qE attribute ignored", name);
968b41a1 8122 return NULL_TREE;
349ae713 8123 }
349ae713 8124
968b41a1
MA		 8125 if (TREE_CODE (id) != STRING_CST)
8126 {
40b97a2e 8127 error ("visibility argument not a string");
968b41a1 8128 return NULL_TREE;
349ae713 8129 }
9f63daea 8130
d7afec4b
ND		 8131 /* If this is a type, set the visibility on the type decl. */
8132 if (TYPE_P (decl))
8133 {
8134 decl = TYPE_NAME (decl);
3f75a254 8135 if (!decl)
c22cacf3 8136 return NULL_TREE;
e8233ac2
AP		 8137 if (TREE_CODE (decl) == IDENTIFIER_NODE)
8138 {
5c498b10 8139 warning (OPT_Wattributes, "%qE attribute ignored on types",
e8233ac2
AP		 8140 name);
8141 return NULL_TREE;
8142 }
d7afec4b 8143 }
349ae713 8144
968b41a1 8145 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
b9e75696 8146 vis = VISIBILITY_DEFAULT;
968b41a1 8147 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
b9e75696 8148 vis = VISIBILITY_INTERNAL;
968b41a1 8149 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
b9e75696 8150 vis = VISIBILITY_HIDDEN;
968b41a1 8151 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
b9e75696 8152 vis = VISIBILITY_PROTECTED;
968b41a1 8153 else
b9e75696
JM		 8154 {
8155 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8156 vis = VISIBILITY_DEFAULT;
8157 }
8158
8159 if (DECL_VISIBILITY_SPECIFIED (decl)
3a687f8b
MM		 8160 && vis != DECL_VISIBILITY (decl))
8161 {
8162 tree attributes = (TYPE_P (*node)
8163 ? TYPE_ATTRIBUTES (*node)
8164 : DECL_ATTRIBUTES (decl));
8165 if (lookup_attribute ("visibility", attributes))
8166 error ("%qD redeclared with different visibility", decl);
8167 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8168 && lookup_attribute ("dllimport", attributes))
8169 error ("%qD was declared %qs which implies default visibility",
8170 decl, "dllimport");
8171 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8172 && lookup_attribute ("dllexport", attributes))
8173 error ("%qD was declared %qs which implies default visibility",
8174 decl, "dllexport");
8175 }
b9e75696
JM		 8176
8177 DECL_VISIBILITY (decl) = vis;
d7afec4b
ND		 8178 DECL_VISIBILITY_SPECIFIED (decl) = 1;
8179
b9e75696
JM		 8180 /* Go ahead and attach the attribute to the node as well. This is needed
8181 so we can determine whether we have VISIBILITY_DEFAULT because the
8182 visibility was not specified, or because it was explicitly overridden
8183 from the containing scope. */
968b41a1 8184
349ae713
NB		 8185 return NULL_TREE;
8186}
8187
b2ca3702
MM		 8188/* Determine the ELF symbol visibility for DECL, which is either a
8189 variable or a function. It is an error to use this function if a
8190 definition of DECL is not available in this translation unit.
8191 Returns true if the final visibility has been determined by this
8192 function; false if the caller is free to make additional
8193 modifications. */
8194
8195bool
8196c_determine_visibility (tree decl)
8197{
21b634ae 8198 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
b2ca3702
MM		 8199
8200 /* If the user explicitly specified the visibility with an
8201 attribute, honor that. DECL_VISIBILITY will have been set during
6d87092d
JM		 8202 the processing of the attribute. We check for an explicit
8203 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8204 to distinguish the use of an attribute from the use of a "#pragma
8205 GCC visibility push(...)"; in the latter case we still want other
8206 considerations to be able to overrule the #pragma. */
8207 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
8208 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8209 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
8210 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
b2ca3702
MM		 8211 return true;
8212
b9e75696
JM		 8213 /* Set default visibility to whatever the user supplied with
8214 visibility_specified depending on #pragma GCC visibility. */
8215 if (!DECL_VISIBILITY_SPECIFIED (decl))
8216 {
09812622
JJ		 8217 if (visibility_options.inpragma
8218 || DECL_VISIBILITY (decl) != default_visibility)
8219 {
8220 DECL_VISIBILITY (decl) = default_visibility;
8221 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
8222 /* If visibility changed and DECL already has DECL_RTL, ensure
8223 symbol flags are updated. */
0ae9bd27 8224 if (((VAR_P (decl) && TREE_STATIC (decl))
09812622
JJ		 8225 || TREE_CODE (decl) == FUNCTION_DECL)
8226 && DECL_RTL_SET_P (decl))
8227 make_decl_rtl (decl);
8228 }
b9e75696 8229 }
b2ca3702
MM		 8230 return false;
8231}
8232
dce81a1a
JJ		 8233/* Handle an "tls_model" attribute; arguments as in
8234 struct attribute_spec.handler. */
8235
8236static tree
35b1a6fa 8237handle_tls_model_attribute (tree *node, tree name, tree args,
e18476eb 8238 int ARG_UNUSED (flags), bool *no_add_attrs)
dce81a1a 8239{
c2f7fa15 8240 tree id;
dce81a1a 8241 tree decl = *node;
c2f7fa15 8242 enum tls_model kind;
dce81a1a 8243
c2f7fa15
SB		 8244 *no_add_attrs = true;
8245
0ae9bd27 8246 if (!VAR_P (decl) || !DECL_THREAD_LOCAL_P (decl))
dce81a1a 8247 {
5c498b10 8248 warning (OPT_Wattributes, "%qE attribute ignored", name);
c2f7fa15 8249 return NULL_TREE;
dce81a1a 8250 }
dce81a1a 8251
c2f7fa15
SB		 8252 kind = DECL_TLS_MODEL (decl);
8253 id = TREE_VALUE (args);
8254 if (TREE_CODE (id) != STRING_CST)
8255 {
8256 error ("tls_model argument not a string");
8257 return NULL_TREE;
dce81a1a
JJ		 8258 }
8259
c2f7fa15
SB		 8260 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
8261 kind = TLS_MODEL_LOCAL_EXEC;
8262 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
8263 kind = TLS_MODEL_INITIAL_EXEC;
8264 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
8265 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
8266 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
8267 kind = TLS_MODEL_GLOBAL_DYNAMIC;
8268 else
8269 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8270
56363ffd 8271 set_decl_tls_model (decl, kind);
dce81a1a
JJ		 8272 return NULL_TREE;
8273}
8274
349ae713
NB		 8275/* Handle a "no_instrument_function" attribute; arguments as in
8276 struct attribute_spec.handler. */
8277
8278static tree
35b1a6fa 8279handle_no_instrument_function_attribute (tree *node, tree name,
e18476eb
BI		 8280 tree ARG_UNUSED (args),
8281 int ARG_UNUSED (flags),
a742c759 8282 bool *no_add_attrs)
349ae713
NB		 8283{
8284 tree decl = *node;
8285
8286 if (TREE_CODE (decl) != FUNCTION_DECL)
8287 {
c5d75364
MLI		 8288 error_at (DECL_SOURCE_LOCATION (decl),
8289 "%qE attribute applies only to functions", name);
349ae713
NB		 8290 *no_add_attrs = true;
8291 }
349ae713
NB		 8292 else
8293 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
8294
8295 return NULL_TREE;
8296}
8297
8298/* Handle a "malloc" attribute; arguments as in
8299 struct attribute_spec.handler. */
8300
8301static tree
e18476eb
BI		 8302handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8303 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713 8304{
3425638a
JM		 8305 if (TREE_CODE (*node) == FUNCTION_DECL
8306 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
349ae713 8307 DECL_IS_MALLOC (*node) = 1;
349ae713
NB		 8308 else
8309 {
5c498b10 8310 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8311 *no_add_attrs = true;
8312 }
8313
8314 return NULL_TREE;
8315}
8316
51bc54a6
DM		 8317/* Handle a "alloc_size" attribute; arguments as in
8318 struct attribute_spec.handler. */
8319
8320static tree
8321handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8322 int ARG_UNUSED (flags), bool *no_add_attrs)
8323{
f3f75f69 8324 unsigned arg_count = type_num_arguments (*node);
51bc54a6
DM		 8325 for (; args; args = TREE_CHAIN (args))
8326 {
8327 tree position = TREE_VALUE (args);
5d77fb19
MG		 8328 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8329 && TREE_CODE (position) != FUNCTION_DECL)
8330 position = default_conversion (position);
51bc54a6 8331
8fcbce72
JJ		 8332 if (!tree_fits_uhwi_p (position)
8333 || !arg_count
8334 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
51bc54a6 8335 {
b8698a0f 8336 warning (OPT_Wattributes,
51bc54a6
DM		 8337 "alloc_size parameter outside range");
8338 *no_add_attrs = true;
8339 return NULL_TREE;
8340 }
8341 }
8342 return NULL_TREE;
8343}
8344
8fcbce72
JJ		 8345/* Handle a "alloc_align" attribute; arguments as in
8346 struct attribute_spec.handler. */
8347
8348static tree
8349handle_alloc_align_attribute (tree *node, tree, tree args, int,
8350 bool *no_add_attrs)
8351{
8352 unsigned arg_count = type_num_arguments (*node);
8353 tree position = TREE_VALUE (args);
8354 if (position && TREE_CODE (position) != IDENTIFIER_NODE)
8355 position = default_conversion (position);
8356
8357 if (!tree_fits_uhwi_p (position)
8358 || !arg_count
8359 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
8360 {
8361 warning (OPT_Wattributes,
8362 "alloc_align parameter outside range");
8363 *no_add_attrs = true;
8364 return NULL_TREE;
8365 }
8366 return NULL_TREE;
8367}
8368
8369/* Handle a "assume_aligned" attribute; arguments as in
8370 struct attribute_spec.handler. */
8371
8372static tree
8373handle_assume_aligned_attribute (tree *, tree, tree args, int,
8374 bool *no_add_attrs)
8375{
8376 for (; args; args = TREE_CHAIN (args))
8377 {
8378 tree position = TREE_VALUE (args);
8379 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8380 && TREE_CODE (position) != FUNCTION_DECL)
8381 position = default_conversion (position);
8382
8383 if (TREE_CODE (position) != INTEGER_CST)
8384 {
8385 warning (OPT_Wattributes,
8386 "assume_aligned parameter not integer constant");
8387 *no_add_attrs = true;
8388 return NULL_TREE;
8389 }
8390 }
8391 return NULL_TREE;
8392}
8393
0b7b376d
RG		 8394/* Handle a "fn spec" attribute; arguments as in
8395 struct attribute_spec.handler. */
8396
8397static tree
8398handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
8399 tree args, int ARG_UNUSED (flags),
8400 bool *no_add_attrs ATTRIBUTE_UNUSED)
8401{
8402 gcc_assert (args
8403 && TREE_CODE (TREE_VALUE (args)) == STRING_CST
8404 && !TREE_CHAIN (args));
8405 return NULL_TREE;
8406}
8407
d5e254e1
IE		 8408/* Handle a "bnd_variable_size" attribute; arguments as in
8409 struct attribute_spec.handler. */
8410
8411static tree
8412handle_bnd_variable_size_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8413 int ARG_UNUSED (flags), bool *no_add_attrs)
8414{
8415 if (TREE_CODE (*node) != FIELD_DECL)
8416 {
8417 warning (OPT_Wattributes, "%qE attribute ignored", name);
8418 *no_add_attrs = true;
8419 }
8420
8421 return NULL_TREE;
8422}
8423
8424/* Handle a "bnd_legacy" attribute; arguments as in
8425 struct attribute_spec.handler. */
8426
8427static tree
8428handle_bnd_legacy (tree *node, tree name, tree ARG_UNUSED (args),
8429 int ARG_UNUSED (flags), bool *no_add_attrs)
8430{
8431 if (TREE_CODE (*node) != FUNCTION_DECL)
8432 {
8433 warning (OPT_Wattributes, "%qE attribute ignored", name);
8434 *no_add_attrs = true;
8435 }
8436
8437 return NULL_TREE;
8438}
8439
8440/* Handle a "bnd_instrument" attribute; arguments as in
8441 struct attribute_spec.handler. */
8442
8443static tree
8444handle_bnd_instrument (tree *node, tree name, tree ARG_UNUSED (args),
8445 int ARG_UNUSED (flags), bool *no_add_attrs)
8446{
8447 if (TREE_CODE (*node) != FUNCTION_DECL)
8448 {
8449 warning (OPT_Wattributes, "%qE attribute ignored", name);
8450 *no_add_attrs = true;
8451 }
8452
8453 return NULL_TREE;
8454}
8455
2a99e5e6
LL		 8456/* Handle a "warn_unused" attribute; arguments as in
8457 struct attribute_spec.handler. */
8458
8459static tree
8460handle_warn_unused_attribute (tree *node, tree name,
8461 tree args ATTRIBUTE_UNUSED,
8462 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
8463{
8464 if (TYPE_P (*node))
8465 /* Do nothing else, just set the attribute. We'll get at
8466 it later with lookup_attribute. */
8467 ;
8468 else
8469 {
8470 warning (OPT_Wattributes, "%qE attribute ignored", name);
8471 *no_add_attrs = true;
8472 }
8473
8474 return NULL_TREE;
8475}
8476
acf0174b
JJ		 8477/* Handle an "omp declare simd" attribute; arguments as in
8478 struct attribute_spec.handler. */
8479
8480static tree
8481handle_omp_declare_simd_attribute (tree *, tree, tree, int, bool *)
8482{
8483 return NULL_TREE;
8484}
8485
fff77217
KY		 8486/* Handle a "simd" attribute. */
8487
8488static tree
e7b69085 8489handle_simd_attribute (tree *node, tree name, tree args, int, bool *no_add_attrs)
fff77217
KY		 8490{
8491 if (TREE_CODE (*node) == FUNCTION_DECL)
8492 {
8493 if (lookup_attribute ("cilk simd function",
8494 DECL_ATTRIBUTES (*node)) != NULL)
8495 {
8496 error_at (DECL_SOURCE_LOCATION (*node),
8497 "%<__simd__%> attribute cannot be used in the same "
8498 "function marked as a Cilk Plus SIMD-enabled function");
8499 *no_add_attrs = true;
8500 }
8501 else
e7b69085
KY		 8502 {
8503 tree t = get_identifier ("omp declare simd");
8504 tree attr = NULL_TREE;
8505 if (args)
8506 {
8507 tree id = TREE_VALUE (args);
8508
8509 if (TREE_CODE (id) != STRING_CST)
8510 {
8511 error ("attribute %qE argument not a string", name);
8512 *no_add_attrs = true;
8513 return NULL_TREE;
8514 }
8515
8516 if (strcmp (TREE_STRING_POINTER (id), "notinbranch") == 0)
8517 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8518 OMP_CLAUSE_NOTINBRANCH);
8519 else
8520 if (strcmp (TREE_STRING_POINTER (id), "inbranch") == 0)
8521 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8522 OMP_CLAUSE_INBRANCH);
8523 else
8524 {
8525 error ("only %<inbranch%> and %<notinbranch%> flags are "
8526 "allowed for %<__simd__%> attribute");
8527 *no_add_attrs = true;
8528 return NULL_TREE;
8529 }
8530 }
8531
8532 DECL_ATTRIBUTES (*node) = tree_cons (t,
8533 build_tree_list (NULL_TREE,
8534 attr),
8535 DECL_ATTRIBUTES (*node));
8536 }
fff77217
KY		 8537 }
8538 else
8539 {
8540 warning (OPT_Wattributes, "%qE attribute ignored", name);
8541 *no_add_attrs = true;
8542 }
8543
8544 return NULL_TREE;
8545}
8546
acf0174b
JJ		 8547/* Handle an "omp declare target" attribute; arguments as in
8548 struct attribute_spec.handler. */
8549
8550static tree
8551handle_omp_declare_target_attribute (tree *, tree, tree, int, bool *)
8552{
8553 return NULL_TREE;
8554}
8555
6e9a3221
AN		 8556/* Handle a "returns_twice" attribute; arguments as in
8557 struct attribute_spec.handler. */
8558
8559static tree
8560handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8561 int ARG_UNUSED (flags), bool *no_add_attrs)
8562{
8563 if (TREE_CODE (*node) == FUNCTION_DECL)
8564 DECL_IS_RETURNS_TWICE (*node) = 1;
8565 else
8566 {
5c498b10 8567 warning (OPT_Wattributes, "%qE attribute ignored", name);
6e9a3221
AN		 8568 *no_add_attrs = true;
8569 }
8570
8571 return NULL_TREE;
8572}
8573
349ae713
NB		 8574/* Handle a "no_limit_stack" attribute; arguments as in
8575 struct attribute_spec.handler. */
8576
8577static tree
35b1a6fa 8578handle_no_limit_stack_attribute (tree *node, tree name,
e18476eb
BI		 8579 tree ARG_UNUSED (args),
8580 int ARG_UNUSED (flags),
a742c759 8581 bool *no_add_attrs)
349ae713
NB		 8582{
8583 tree decl = *node;
8584
8585 if (TREE_CODE (decl) != FUNCTION_DECL)
8586 {
c5d75364
MLI		 8587 error_at (DECL_SOURCE_LOCATION (decl),
8588 "%qE attribute applies only to functions", name);
349ae713
NB		 8589 *no_add_attrs = true;
8590 }
8591 else if (DECL_INITIAL (decl))
8592 {
c5d75364
MLI		 8593 error_at (DECL_SOURCE_LOCATION (decl),
8594 "can%'t set %qE attribute after definition", name);
349ae713
NB		 8595 *no_add_attrs = true;
8596 }
8597 else
8598 DECL_NO_LIMIT_STACK (decl) = 1;
8599
8600 return NULL_TREE;
8601}
8602
8603/* Handle a "pure" attribute; arguments as in
8604 struct attribute_spec.handler. */
8605
8606static tree
e18476eb
BI		 8607handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8608 int ARG_UNUSED (flags), bool *no_add_attrs)
349ae713
NB		 8609{
8610 if (TREE_CODE (*node) == FUNCTION_DECL)
becfd6e5 8611 DECL_PURE_P (*node) = 1;
349ae713
NB		 8612 /* ??? TODO: Support types. */
8613 else
8614 {
5c498b10 8615 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8616 *no_add_attrs = true;
8617 }
8618
8619 return NULL_TREE;
8620}
8621
0a35513e
AH		 8622/* Digest an attribute list destined for a transactional memory statement.
8623 ALLOWED is the set of attributes that are allowed for this statement;
8624 return the attribute we parsed. Multiple attributes are never allowed. */
8625
8626int
8627parse_tm_stmt_attr (tree attrs, int allowed)
8628{
8629 tree a_seen = NULL;
8630 int m_seen = 0;
8631
8632 for ( ; attrs ; attrs = TREE_CHAIN (attrs))
8633 {
8634 tree a = TREE_PURPOSE (attrs);
8635 int m = 0;
8636
8637 if (is_attribute_p ("outer", a))
8638 m = TM_STMT_ATTR_OUTER;
8639
8640 if ((m & allowed) == 0)
8641 {
8642 warning (OPT_Wattributes, "%qE attribute directive ignored", a);
8643 continue;
8644 }
8645
8646 if (m_seen == 0)
8647 {
8648 a_seen = a;
8649 m_seen = m;
8650 }
8651 else if (m_seen == m)
8652 warning (OPT_Wattributes, "%qE attribute duplicated", a);
8653 else
8654 warning (OPT_Wattributes, "%qE attribute follows %qE", a, a_seen);
8655 }
8656
8657 return m_seen;
8658}
8659
8660/* Transform a TM attribute name into a maskable integer and back.
8661 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8662 to how the lack of an attribute is treated. */
8663
8664int
8665tm_attr_to_mask (tree attr)
8666{
8667 if (attr == NULL)
8668 return 0;
8669 if (is_attribute_p ("transaction_safe", attr))
8670 return TM_ATTR_SAFE;
8671 if (is_attribute_p ("transaction_callable", attr))
8672 return TM_ATTR_CALLABLE;
8673 if (is_attribute_p ("transaction_pure", attr))
8674 return TM_ATTR_PURE;
8675 if (is_attribute_p ("transaction_unsafe", attr))
8676 return TM_ATTR_IRREVOCABLE;
8677 if (is_attribute_p ("transaction_may_cancel_outer", attr))
8678 return TM_ATTR_MAY_CANCEL_OUTER;
8679 return 0;
8680}
8681
8682tree
8683tm_mask_to_attr (int mask)
8684{
8685 const char *str;
8686 switch (mask)
8687 {
8688 case TM_ATTR_SAFE:
8689 str = "transaction_safe";
8690 break;
8691 case TM_ATTR_CALLABLE:
8692 str = "transaction_callable";
8693 break;
8694 case TM_ATTR_PURE:
8695 str = "transaction_pure";
8696 break;
8697 case TM_ATTR_IRREVOCABLE:
8698 str = "transaction_unsafe";
8699 break;
8700 case TM_ATTR_MAY_CANCEL_OUTER:
8701 str = "transaction_may_cancel_outer";
8702 break;
8703 default:
8704 gcc_unreachable ();
8705 }
8706 return get_identifier (str);
8707}
8708
8709/* Return the first TM attribute seen in LIST. */
8710
8711tree
8712find_tm_attribute (tree list)
8713{
8714 for (; list ; list = TREE_CHAIN (list))
8715 {
8716 tree name = TREE_PURPOSE (list);
8717 if (tm_attr_to_mask (name) != 0)
8718 return name;
8719 }
8720 return NULL_TREE;
8721}
8722
8723/* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8724 Here we accept only function types, and verify that none of the other
8725 function TM attributes are also applied. */
8726/* ??? We need to accept class types for C++, but not C. This greatly
8727 complicates this function, since we can no longer rely on the extra
8728 processing given by function_type_required. */
8729
8730static tree
8731handle_tm_attribute (tree *node, tree name, tree args,
8732 int flags, bool *no_add_attrs)
8733{
8734 /* Only one path adds the attribute; others don't. */
8735 *no_add_attrs = true;
8736
8737 switch (TREE_CODE (*node))
8738 {
8739 case RECORD_TYPE:
8740 case UNION_TYPE:
8741 /* Only tm_callable and tm_safe apply to classes. */
8742 if (tm_attr_to_mask (name) & ~(TM_ATTR_SAFE | TM_ATTR_CALLABLE))
8743 goto ignored;
8744 /* FALLTHRU */
8745
8746 case FUNCTION_TYPE:
8747 case METHOD_TYPE:
8748 {
8749 tree old_name = find_tm_attribute (TYPE_ATTRIBUTES (*node));
8750 if (old_name == name)
8751 ;
8752 else if (old_name != NULL_TREE)
8753 error ("type was previously declared %qE", old_name);
8754 else
8755 *no_add_attrs = false;
8756 }
8757 break;
8758
b8fd7909
JM		 8759 case FUNCTION_DECL:
8760 {
8761 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8762 want to set transaction_safe on the type. */
8763 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name));
8764 if (!TYPE_P (DECL_CONTEXT (*node)))
8765 error_at (DECL_SOURCE_LOCATION (*node),
8766 "%<transaction_safe_dynamic%> may only be specified for "
8767 "a virtual function");
8768 *no_add_attrs = false;
8769 decl_attributes (&TREE_TYPE (*node),
8770 build_tree_list (get_identifier ("transaction_safe"),
8771 NULL_TREE),
8772 0);
8773 break;
8774 }
8775
0a35513e
AH		 8776 case POINTER_TYPE:
8777 {
8778 enum tree_code subcode = TREE_CODE (TREE_TYPE (*node));
8779 if (subcode == FUNCTION_TYPE || subcode == METHOD_TYPE)
8780 {
8781 tree fn_tmp = TREE_TYPE (*node);
8782 decl_attributes (&fn_tmp, tree_cons (name, args, NULL), 0);
8783 *node = build_pointer_type (fn_tmp);
8784 break;
8785 }
8786 }
8787 /* FALLTHRU */
8788
8789 default:
8790 /* If a function is next, pass it on to be tried next. */
8791 if (flags & (int) ATTR_FLAG_FUNCTION_NEXT)
8792 return tree_cons (name, args, NULL);
8793
8794 ignored:
8795 warning (OPT_Wattributes, "%qE attribute ignored", name);
8796 break;
8797 }
8798
8799 return NULL_TREE;
8800}
8801
8802/* Handle the TM_WRAP attribute; arguments as in
8803 struct attribute_spec.handler. */
8804
8805static tree
8806handle_tm_wrap_attribute (tree *node, tree name, tree args,
8807 int ARG_UNUSED (flags), bool *no_add_attrs)
8808{
8809 tree decl = *node;
8810
8811 /* We don't need the attribute even on success, since we
8812 record the entry in an external table. */
8813 *no_add_attrs = true;
8814
8815 if (TREE_CODE (decl) != FUNCTION_DECL)
8816 warning (OPT_Wattributes, "%qE attribute ignored", name);
8817 else
8818 {
8819 tree wrap_decl = TREE_VALUE (args);
661a0813
MP		 8820 if (error_operand_p (wrap_decl))
8821 ;
8822 else if (TREE_CODE (wrap_decl) != IDENTIFIER_NODE
21b634ae 8823 && !VAR_OR_FUNCTION_DECL_P (wrap_decl))
0a35513e
AH		 8824 error ("%qE argument not an identifier", name);
8825 else
8826 {
8827 if (TREE_CODE (wrap_decl) == IDENTIFIER_NODE)
8828 wrap_decl = lookup_name (wrap_decl);
8829 if (wrap_decl && TREE_CODE (wrap_decl) == FUNCTION_DECL)
8830 {
8831 if (lang_hooks.types_compatible_p (TREE_TYPE (decl),
8832 TREE_TYPE (wrap_decl)))
8833 record_tm_replacement (wrap_decl, decl);
8834 else
8835 error ("%qD is not compatible with %qD", wrap_decl, decl);
8836 }
8837 else
c07d7c02 8838 error ("%qE argument is not a function", name);
0a35513e
AH		 8839 }
8840 }
8841
8842 return NULL_TREE;
8843}
8844
8845/* Ignore the given attribute. Used when this attribute may be usefully
8846 overridden by the target, but is not used generically. */
8847
8848static tree
8849ignore_attribute (tree * ARG_UNUSED (node), tree ARG_UNUSED (name),
8850 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8851 bool *no_add_attrs)
8852{
8853 *no_add_attrs = true;
8854 return NULL_TREE;
8855}
8856
dcd6de6d
ZD		 8857/* Handle a "no vops" attribute; arguments as in
8858 struct attribute_spec.handler. */
8859
8860static tree
8861handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
8862 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8863 bool *ARG_UNUSED (no_add_attrs))
8864{
8865 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
8866 DECL_IS_NOVOPS (*node) = 1;
8867 return NULL_TREE;
8868}
8869
349ae713
NB		 8870/* Handle a "deprecated" attribute; arguments as in
8871 struct attribute_spec.handler. */
35b1a6fa 8872
349ae713 8873static tree
35b1a6fa 8874handle_deprecated_attribute (tree *node, tree name,
9b86d6bb 8875 tree args, int flags,
a742c759 8876 bool *no_add_attrs)
349ae713
NB		 8877{
8878 tree type = NULL_TREE;
8879 int warn = 0;
c51a1ba9 8880 tree what = NULL_TREE;
35b1a6fa 8881
9b86d6bb
L		 8882 if (!args)
8883 *no_add_attrs = true;
8884 else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
8885 {
8886 error ("deprecated message is not a string");
8887 *no_add_attrs = true;
8888 }
8889
349ae713
NB		 8890 if (DECL_P (*node))
8891 {
8892 tree decl = *node;
8893 type = TREE_TYPE (decl);
35b1a6fa 8894
349ae713
NB		 8895 if (TREE_CODE (decl) == TYPE_DECL
8896 || TREE_CODE (decl) == PARM_DECL
21b634ae 8897 || VAR_OR_FUNCTION_DECL_P (decl)
a1178b30 8898 || TREE_CODE (decl) == FIELD_DECL
fd5c817a 8899 || TREE_CODE (decl) == CONST_DECL
a1178b30 8900 || objc_method_decl (TREE_CODE (decl)))
349ae713
NB		 8901 TREE_DEPRECATED (decl) = 1;
8902 else
8903 warn = 1;
8904 }
8905 else if (TYPE_P (*node))
8906 {
8907 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8dd16ecc 8908 *node = build_variant_type_copy (*node);
349ae713
NB		 8909 TREE_DEPRECATED (*node) = 1;
8910 type = *node;
8911 }
8912 else
8913 warn = 1;
35b1a6fa 8914
349ae713
NB		 8915 if (warn)
8916 {
8917 *no_add_attrs = true;
8918 if (type && TYPE_NAME (type))
8919 {
8920 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
c51a1ba9 8921 what = TYPE_NAME (*node);
349ae713
NB		 8922 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
8923 && DECL_NAME (TYPE_NAME (type)))
c51a1ba9 8924 what = DECL_NAME (TYPE_NAME (type));
349ae713
NB		 8925 }
8926 if (what)
5c498b10 8927 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
349ae713 8928 else
5c498b10 8929 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8930 }
8931
8932 return NULL_TREE;
8933}
8934
349ae713
NB		 8935/* Handle a "vector_size" attribute; arguments as in
8936 struct attribute_spec.handler. */
8937
8938static tree
35b1a6fa 8939handle_vector_size_attribute (tree *node, tree name, tree args,
e18476eb 8940 int ARG_UNUSED (flags),
a742c759 8941 bool *no_add_attrs)
349ae713
NB		 8942{
8943 unsigned HOST_WIDE_INT vecsize, nunits;
ef4bddc2 8944 machine_mode orig_mode;
4a5eab38 8945 tree type = *node, new_type, size;
349ae713
NB		 8946
8947 *no_add_attrs = true;
8948
4a5eab38 8949 size = TREE_VALUE (args);
661a0813
MP		 8950 if (size && TREE_CODE (size) != IDENTIFIER_NODE
8951 && TREE_CODE (size) != FUNCTION_DECL)
5d77fb19 8952 size = default_conversion (size);
4a5eab38 8953
cc269bb6 8954 if (!tree_fits_uhwi_p (size))
349ae713 8955 {
5c498b10 8956 warning (OPT_Wattributes, "%qE attribute ignored", name);
349ae713
NB		 8957 return NULL_TREE;
8958 }
8959
8960 /* Get the vector size (in bytes). */
ae7e9ddd 8961 vecsize = tree_to_uhwi (size);
349ae713
NB		 8962
8963 /* We need to provide for vector pointers, vector arrays, and
8964 functions returning vectors. For example:
8965
8966 __attribute__((vector_size(16))) short *foo;
8967
8968 In this case, the mode is SI, but the type being modified is
8969 HI, so we need to look further. */
8970
8971 while (POINTER_TYPE_P (type)
8972 || TREE_CODE (type) == FUNCTION_TYPE
43dc123f 8973 || TREE_CODE (type) == METHOD_TYPE
270e749d
JJ		 8974 || TREE_CODE (type) == ARRAY_TYPE
8975 || TREE_CODE (type) == OFFSET_TYPE)
349ae713
NB		 8976 type = TREE_TYPE (type);
8977
8978 /* Get the mode of the type being modified. */
8979 orig_mode = TYPE_MODE (type);
8980
270e749d
JJ		 8981 if ((!INTEGRAL_TYPE_P (type)
8982 && !SCALAR_FLOAT_TYPE_P (type)
8983 && !FIXED_POINT_TYPE_P (type))
3d8bf70f 8984 || (!SCALAR_FLOAT_MODE_P (orig_mode)
ab22c1fa
CF		 8985 && GET_MODE_CLASS (orig_mode) != MODE_INT
8986 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
cc269bb6 8987 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
e4e5261f 8988 || TREE_CODE (type) == BOOLEAN_TYPE)
349ae713 8989 {
c51a1ba9 8990 error ("invalid vector type for attribute %qE", name);
349ae713
NB		 8991 return NULL_TREE;
8992 }
8993
ae7e9ddd 8994 if (vecsize % tree_to_uhwi (TYPE_SIZE_UNIT (type)))
ee8960e5
JJ		 8995 {
8996 error ("vector size not an integral multiple of component size");
8997 return NULL;
8998 }
8999
9000 if (vecsize == 0)
9001 {
9002 error ("zero vector size");
9003 return NULL;
9004 }
9005
349ae713 9006 /* Calculate how many units fit in the vector. */
ae7e9ddd 9007 nunits = vecsize / tree_to_uhwi (TYPE_SIZE_UNIT (type));
26277d41 9008 if (nunits & (nunits - 1))
349ae713 9009 {
26277d41 9010 error ("number of components of the vector not a power of two");
349ae713
NB		 9011 return NULL_TREE;
9012 }
9013
26277d41 9014 new_type = build_vector_type (type, nunits);
349ae713
NB		 9015
9016 /* Build back pointers if needed. */
5dc11954 9017 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
349ae713
NB		 9018
9019 return NULL_TREE;
9020}
9021
b34c7881
JT		 9022/* Handle the "nonnull" attribute. */
9023static tree
e18476eb
BI		 9024handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
9025 tree args, int ARG_UNUSED (flags),
a742c759 9026 bool *no_add_attrs)
b34c7881
JT		 9027{
9028 tree type = *node;
9029 unsigned HOST_WIDE_INT attr_arg_num;
9030
9031 /* If no arguments are specified, all pointer arguments should be
95bd1dd7 9032 non-null. Verify a full prototype is given so that the arguments
b34c7881 9033 will have the correct types when we actually check them later. */
3f75a254 9034 if (!args)
b34c7881 9035 {
f4da8dce 9036 if (!prototype_p (type))
b34c7881
JT		 9037 {
9038 error ("nonnull attribute without arguments on a non-prototype");
6de9cd9a 9039 *no_add_attrs = true;
b34c7881
JT		 9040 }
9041 return NULL_TREE;
9042 }
9043
9044 /* Argument list specified. Verify that each argument number references
9045 a pointer argument. */
5d77fb19 9046 for (attr_arg_num = 1; args; attr_arg_num++, args = TREE_CHAIN (args))
b34c7881 9047 {
6de9cd9a 9048 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
b34c7881 9049
5d77fb19
MG		 9050 tree arg = TREE_VALUE (args);
9051 if (arg && TREE_CODE (arg) != IDENTIFIER_NODE
9052 && TREE_CODE (arg) != FUNCTION_DECL)
9053 arg = default_conversion (arg);
9054
9055 if (!get_nonnull_operand (arg, &arg_num))
b34c7881 9056 {
40b97a2e 9057 error ("nonnull argument has invalid operand number (argument %lu)",
b34c7881
JT		 9058 (unsigned long) attr_arg_num);
9059 *no_add_attrs = true;
9060 return NULL_TREE;
9061 }
9062
e19a18d4 9063 if (prototype_p (type))
b34c7881 9064 {
e19a18d4
NF		 9065 function_args_iterator iter;
9066 tree argument;
9067
9068 function_args_iter_init (&iter, type);
9069 for (ck_num = 1; ; ck_num++, function_args_iter_next (&iter))
b34c7881 9070 {
e19a18d4
NF		 9071 argument = function_args_iter_cond (&iter);
9072 if (argument == NULL_TREE || ck_num == arg_num)
b34c7881 9073 break;
b34c7881
JT		 9074 }
9075
3f75a254 9076 if (!argument
e19a18d4 9077 || TREE_CODE (argument) == VOID_TYPE)
b34c7881 9078 {
40b97a2e 9079 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
b34c7881
JT		 9080 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9081 *no_add_attrs = true;
9082 return NULL_TREE;
9083 }
9084
e19a18d4 9085 if (TREE_CODE (argument) != POINTER_TYPE)
b34c7881 9086 {
40b97a2e 9087 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
b34c7881
JT		 9088 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9089 *no_add_attrs = true;
9090 return NULL_TREE;
9091 }
9092 }
9093 }
9094
9095 return NULL_TREE;
9096}
9097
9098/* Check the argument list of a function call for null in argument slots
94a0dd7b
SL		 9099 that are marked as requiring a non-null pointer argument. The NARGS
9100 arguments are passed in the array ARGARRAY.
9101*/
b34c7881
JT		 9102
9103static void
94a0dd7b 9104check_function_nonnull (tree attrs, int nargs, tree *argarray)
b34c7881 9105{
332f1d24 9106 tree a;
94a0dd7b 9107 int i;
b34c7881 9108
332f1d24
JJ		 9109 attrs = lookup_attribute ("nonnull", attrs);
9110 if (attrs == NULL_TREE)
9111 return;
9112
9113 a = attrs;
9114 /* See if any of the nonnull attributes has no arguments. If so,
9115 then every pointer argument is checked (in which case the check
9116 for pointer type is done in check_nonnull_arg). */
9117 if (TREE_VALUE (a) != NULL_TREE)
9118 do
9119 a = lookup_attribute ("nonnull", TREE_CHAIN (a));
9120 while (a != NULL_TREE && TREE_VALUE (a) != NULL_TREE);
9121
9122 if (a != NULL_TREE)
9123 for (i = 0; i < nargs; i++)
9124 check_function_arguments_recurse (check_nonnull_arg, NULL, argarray[i],
9125 i + 1);
9126 else
b34c7881 9127 {
332f1d24
JJ		 9128 /* Walk the argument list. If we encounter an argument number we
9129 should check for non-null, do it. */
9130 for (i = 0; i < nargs; i++)
b34c7881 9131 {
332f1d24 9132 for (a = attrs; ; a = TREE_CHAIN (a))
6de9cd9a 9133 {
332f1d24
JJ		 9134 a = lookup_attribute ("nonnull", a);
9135 if (a == NULL_TREE || nonnull_check_p (TREE_VALUE (a), i + 1))
9136 break;
6de9cd9a 9137 }
332f1d24
JJ		 9138
9139 if (a != NULL_TREE)
9140 check_function_arguments_recurse (check_nonnull_arg, NULL,
9141 argarray[i], i + 1);
b34c7881
JT		 9142 }
9143 }
9144}
9145
254986c7 9146/* Check that the Nth argument of a function call (counting backwards
94a0dd7b
SL		 9147 from the end) is a (pointer)0. The NARGS arguments are passed in the
9148 array ARGARRAY. */
3d091dac
KG		 9149
9150static void
dde05067 9151check_function_sentinel (const_tree fntype, int nargs, tree *argarray)
3d091dac 9152{
dde05067 9153 tree attr = lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype));
3d091dac
KG		 9154
9155 if (attr)
9156 {
94a0dd7b
SL		 9157 int len = 0;
9158 int pos = 0;
9159 tree sentinel;
dde05067
NF		 9160 function_args_iterator iter;
9161 tree t;
c22cacf3 9162
94a0dd7b 9163 /* Skip over the named arguments. */
dde05067 9164 FOREACH_FUNCTION_ARGS (fntype, t, iter)
c22cacf3 9165 {
dde05067
NF		 9166 if (len == nargs)
9167 break;
94a0dd7b
SL		 9168 len++;
9169 }
254986c7 9170
94a0dd7b
SL		 9171 if (TREE_VALUE (attr))
9172 {
9173 tree p = TREE_VALUE (TREE_VALUE (attr));
9174 pos = TREE_INT_CST_LOW (p);
9175 }
254986c7 9176
94a0dd7b
SL		 9177 /* The sentinel must be one of the varargs, i.e.
9178 in position >= the number of fixed arguments. */
9179 if ((nargs - 1 - pos) < len)
9180 {
7332899a 9181 warning (OPT_Wformat_,
94a0dd7b
SL		 9182 "not enough variable arguments to fit a sentinel");
9183 return;
3d091dac 9184 }
94a0dd7b
SL		 9185
9186 /* Validate the sentinel. */
9187 sentinel = argarray[nargs - 1 - pos];
9188 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
9189 || !integer_zerop (sentinel))
9190 /* Although __null (in C++) is only an integer we allow it
9191 nevertheless, as we are guaranteed that it's exactly
9192 as wide as a pointer, and we don't want to force
9193 users to cast the NULL they have written there.
9194 We warn with -Wstrict-null-sentinel, though. */
9195 && (warn_strict_null_sentinel || null_node != sentinel))
7332899a 9196 warning (OPT_Wformat_, "missing sentinel in function call");
3d091dac
KG		 9197 }
9198}
9199
b34c7881
JT		 9200/* Helper for check_function_nonnull; given a list of operands which
9201 must be non-null in ARGS, determine if operand PARAM_NUM should be
9202 checked. */
9203
9204static bool
35b1a6fa 9205nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
b34c7881 9206{
6de9cd9a 9207 unsigned HOST_WIDE_INT arg_num = 0;
b34c7881
JT		 9208
9209 for (; args; args = TREE_CHAIN (args))
9210 {
366de0ce
NS		 9211 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
9212
9213 gcc_assert (found);
b34c7881
JT		 9214
9215 if (arg_num == param_num)
9216 return true;
9217 }
9218 return false;
9219}
9220
9221/* Check that the function argument PARAM (which is operand number
9222 PARAM_NUM) is non-null. This is called by check_function_nonnull
9223 via check_function_arguments_recurse. */
9224
9225static void
e18476eb 9226check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
35b1a6fa 9227 unsigned HOST_WIDE_INT param_num)
b34c7881
JT		 9228{
9229 /* Just skip checking the argument if it's not a pointer. This can
9230 happen if the "nonnull" attribute was given without an operand
9231 list (which means to check every pointer argument). */
9232
9233 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
9234 return;
9235
9236 if (integer_zerop (param))
30480ec4
DD		 9237 warning (OPT_Wnonnull, "null argument where non-null required "
9238 "(argument %lu)", (unsigned long) param_num);
b34c7881
JT		 9239}
9240
9241/* Helper for nonnull attribute handling; fetch the operand number
9242 from the attribute argument list. */
9243
9244static bool
35b1a6fa 9245get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
b34c7881 9246{
807e902e
KZ		 9247 /* Verify the arg number is a small constant. */
9248 if (tree_fits_uhwi_p (arg_num_expr))
9249 {
9250 *valp = TREE_INT_CST_LOW (arg_num_expr);
9251 return true;
9252 }
9253 else
b34c7881 9254 return false;
b34c7881 9255}
39f2f3c8
RS		 9256
9257/* Handle a "nothrow" attribute; arguments as in
9258 struct attribute_spec.handler. */
9259
9260static tree
e18476eb
BI		 9261handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9262 int ARG_UNUSED (flags), bool *no_add_attrs)
39f2f3c8
RS		 9263{
9264 if (TREE_CODE (*node) == FUNCTION_DECL)
9265 TREE_NOTHROW (*node) = 1;
9266 /* ??? TODO: Support types. */
9267 else
9268 {
5c498b10 9269 warning (OPT_Wattributes, "%qE attribute ignored", name);
39f2f3c8
RS		 9270 *no_add_attrs = true;
9271 }
9272
9273 return NULL_TREE;
9274}
0bfa5f65
RH		 9275
9276/* Handle a "cleanup" attribute; arguments as in
9277 struct attribute_spec.handler. */
9278
9279static tree
35b1a6fa 9280handle_cleanup_attribute (tree *node, tree name, tree args,
e18476eb 9281 int ARG_UNUSED (flags), bool *no_add_attrs)
0bfa5f65
RH		 9282{
9283 tree decl = *node;
9284 tree cleanup_id, cleanup_decl;
9285
9286 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9287 for global destructors in C++. This requires infrastructure that
9288 we don't have generically at the moment. It's also not a feature
9289 we'd be missing too much, since we do have attribute constructor. */
0ae9bd27 9290 if (!VAR_P (decl) || TREE_STATIC (decl))
0bfa5f65 9291 {
5c498b10 9292 warning (OPT_Wattributes, "%qE attribute ignored", name);
0bfa5f65
RH		 9293 *no_add_attrs = true;
9294 return NULL_TREE;
9295 }
9296
9297 /* Verify that the argument is a function in scope. */
9298 /* ??? We could support pointers to functions here as well, if
9299 that was considered desirable. */
9300 cleanup_id = TREE_VALUE (args);
9301 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
9302 {
40b97a2e 9303 error ("cleanup argument not an identifier");
0bfa5f65
RH		 9304 *no_add_attrs = true;
9305 return NULL_TREE;
9306 }
10e6657a 9307 cleanup_decl = lookup_name (cleanup_id);
0bfa5f65
RH		 9308 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
9309 {
40b97a2e 9310 error ("cleanup argument not a function");
0bfa5f65
RH		 9311 *no_add_attrs = true;
9312 return NULL_TREE;
9313 }
9314
35b1a6fa 9315 /* That the function has proper type is checked with the
0bfa5f65
RH		 9316 eventual call to build_function_call. */
9317
9318 return NULL_TREE;
9319}
72954a4f
JM		 9320
9321/* Handle a "warn_unused_result" attribute. No special handling. */
9322
9323static tree
9324handle_warn_unused_result_attribute (tree *node, tree name,
e18476eb
BI		 9325 tree ARG_UNUSED (args),
9326 int ARG_UNUSED (flags), bool *no_add_attrs)
72954a4f
JM		 9327{
9328 /* Ignore the attribute for functions not returning any value. */
9329 if (VOID_TYPE_P (TREE_TYPE (*node)))
9330 {
5c498b10 9331 warning (OPT_Wattributes, "%qE attribute ignored", name);
72954a4f
JM		 9332 *no_add_attrs = true;
9333 }
9334
9335 return NULL_TREE;
9336}
3d091dac
KG		 9337
9338/* Handle a "sentinel" attribute. */
9339
9340static tree
254986c7 9341handle_sentinel_attribute (tree *node, tree name, tree args,
3d091dac
KG		 9342 int ARG_UNUSED (flags), bool *no_add_attrs)
9343{
f4da8dce 9344 if (!prototype_p (*node))
3d091dac 9345 {
5c498b10
DD		 9346 warning (OPT_Wattributes,
9347 "%qE attribute requires prototypes with named arguments", name);
3d091dac 9348 *no_add_attrs = true;
3d091dac 9349 }
254986c7
KG		 9350 else
9351 {
dcf0c47e 9352 if (!stdarg_p (*node))
c22cacf3 9353 {
5c498b10
DD		 9354 warning (OPT_Wattributes,
9355 "%qE attribute only applies to variadic functions", name);
254986c7
KG		 9356 *no_add_attrs = true;
9357 }
9358 }
c22cacf3 9359
254986c7 9360 if (args)
3d091dac 9361 {
254986c7 9362 tree position = TREE_VALUE (args);
661a0813
MP		 9363 if (position && TREE_CODE (position) != IDENTIFIER_NODE
9364 && TREE_CODE (position) != FUNCTION_DECL)
9365 position = default_conversion (position);
254986c7 9366
661a0813
MP		 9367 if (TREE_CODE (position) != INTEGER_CST
9368 || !INTEGRAL_TYPE_P (TREE_TYPE (position)))
c22cacf3 9369 {
b8698a0f 9370 warning (OPT_Wattributes,
aa86a51b 9371 "requested position is not an integer constant");
254986c7
KG		 9372 *no_add_attrs = true;
9373 }
9374 else
c22cacf3 9375 {
254986c7
KG		 9376 if (tree_int_cst_lt (position, integer_zero_node))
9377 {
aa86a51b
DM		 9378 warning (OPT_Wattributes,
9379 "requested position is less than zero");
254986c7
KG		 9380 *no_add_attrs = true;
9381 }
9382 }
3d091dac 9383 }
c22cacf3 9384
3d091dac
KG		 9385 return NULL_TREE;
9386}
b5d32c25
KG		 9387
9388/* Handle a "type_generic" attribute. */
9389
9390static tree
9391handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
9392 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
9393 bool * ARG_UNUSED (no_add_attrs))
9394{
3bf5906b
KG		 9395 /* Ensure we have a function type. */
9396 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
b8698a0f 9397
3bf5906b 9398 /* Ensure we have a variadic function. */
dcf0c47e 9399 gcc_assert (!prototype_p (*node) || stdarg_p (*node));
b5d32c25
KG		 9400
9401 return NULL_TREE;
9402}
ab442df7 9403
5779e713 9404/* Handle a "target" attribute. */
ab442df7
MM		 9405
9406static tree
5779e713 9407handle_target_attribute (tree *node, tree name, tree args, int flags,
ab442df7
MM		 9408 bool *no_add_attrs)
9409{
9410 /* Ensure we have a function type. */
9411 if (TREE_CODE (*node) != FUNCTION_DECL)
9412 {
9413 warning (OPT_Wattributes, "%qE attribute ignored", name);
9414 *no_add_attrs = true;
9415 }
3b1661a9
ES		 9416 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
9417 {
9418 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9419 "with %qs attribute", name, "target_clones");
9420 *no_add_attrs = true;
9421 }
ab442df7 9422 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
32887460 9423 flags))
ab442df7
MM		 9424 *no_add_attrs = true;
9425
9426 return NULL_TREE;
9427}
9428
3b1661a9
ES		 9429/* Handle a "target_clones" attribute. */
9430
9431static tree
9432handle_target_clones_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9433 int ARG_UNUSED (flags), bool *no_add_attrs)
9434{
9435 /* Ensure we have a function type. */
9436 if (TREE_CODE (*node) == FUNCTION_DECL)
9437 {
9438 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
9439 {
9440 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9441 "with %qs attribute", name, "always_inline");
9442 *no_add_attrs = true;
9443 }
9444 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node)))
9445 {
9446 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9447 "with %qs attribute", name, "target");
9448 *no_add_attrs = true;
9449 }
9450 else
9451 /* Do not inline functions with multiple clone targets. */
9452 DECL_UNINLINABLE (*node) = 1;
9453 }
9454 else
9455 {
9456 warning (OPT_Wattributes, "%qE attribute ignored", name);
9457 *no_add_attrs = true;
9458 }
9459 return NULL_TREE;
9460}
9461
ab442df7
MM		 9462/* Arguments being collected for optimization. */
9463typedef const char *const_char_p; /* For DEF_VEC_P. */
9771b263 9464static GTY(()) vec<const_char_p, va_gc> *optimize_args;
ab442df7
MM		 9465
9466
9467/* Inner function to convert a TREE_LIST to argv string to parse the optimize
9468 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9469 false for #pragma GCC optimize. */
9470
9471bool
9472parse_optimize_options (tree args, bool attr_p)
9473{
9474 bool ret = true;
9475 unsigned opt_argc;
9476 unsigned i;
9477 const char **opt_argv;
6e2f1956
JM		 9478 struct cl_decoded_option *decoded_options;
9479 unsigned int decoded_options_count;
ab442df7
MM		 9480 tree ap;
9481
9482 /* Build up argv vector. Just in case the string is stored away, use garbage
9483 collected strings. */
9771b263
DN		 9484 vec_safe_truncate (optimize_args, 0);
9485 vec_safe_push (optimize_args, (const char *) NULL);
ab442df7
MM		 9486
9487 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
9488 {
9489 tree value = TREE_VALUE (ap);
9490
9491 if (TREE_CODE (value) == INTEGER_CST)
9492 {
9493 char buffer[20];
9494 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
9771b263 9495 vec_safe_push (optimize_args, ggc_strdup (buffer));
ab442df7
MM		 9496 }
9497
9498 else if (TREE_CODE (value) == STRING_CST)
9499 {
9500 /* Split string into multiple substrings. */
9501 size_t len = TREE_STRING_LENGTH (value);
9502 char *p = ASTRDUP (TREE_STRING_POINTER (value));
9503 char *end = p + len;
9504 char *comma;
9505 char *next_p = p;
9506
9507 while (next_p != NULL)
9508 {
9509 size_t len2;
9510 char *q, *r;
9511
9512 p = next_p;
9513 comma = strchr (p, ',');
9514 if (comma)
9515 {
9516 len2 = comma - p;
9517 *comma = '\0';
9518 next_p = comma+1;
9519 }
9520 else
9521 {
9522 len2 = end - p;
9523 next_p = NULL;
9524 }
9525
a9429e29 9526 r = q = (char *) ggc_alloc_atomic (len2 + 3);
ab442df7
MM		 9527
9528 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9529 options. */
9530 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
9531 {
9532 ret = false;
9533 if (attr_p)
9534 warning (OPT_Wattributes,
06730c5d 9535 "bad option %s to optimize attribute", p);
ab442df7
MM		 9536 else
9537 warning (OPT_Wpragmas,
de621752 9538 "bad option %s to pragma attribute", p);
ab442df7
MM		 9539 continue;
9540 }
9541
9542 if (*p != '-')
9543 {
9544 *r++ = '-';
9545
9546 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9547 itself is -Os, and any other switch begins with a -f. */
9548 if ((*p >= '0' && *p <= '9')
9549 || (p[0] == 's' && p[1] == '\0'))
9550 *r++ = 'O';
9551 else if (*p != 'O')
9552 *r++ = 'f';
9553 }
9554
9555 memcpy (r, p, len2);
9556 r[len2] = '\0';
9771b263 9557 vec_safe_push (optimize_args, (const char *) q);
ab442df7
MM		 9558 }
9559
9560 }
9561 }
9562
9771b263 9563 opt_argc = optimize_args->length ();
ab442df7
MM		 9564 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
9565
9566 for (i = 1; i < opt_argc; i++)
9771b263 9567 opt_argv[i] = (*optimize_args)[i];
ab442df7
MM		 9568
9569 /* Now parse the options. */
a75bfaa6
JM		 9570 decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv,
9571 &decoded_options,
9572 &decoded_options_count);
9573 decode_options (&global_options, &global_options_set,
a4d8c676
JM		 9574 decoded_options, decoded_options_count,
9575 input_location, global_dc);
ab442df7 9576
2b7e2984
SE		 9577 targetm.override_options_after_change();
9578
9771b263 9579 optimize_args->truncate (0);
ab442df7
MM		 9580 return ret;
9581}
9582
9583/* For handling "optimize" attribute. arguments as in
9584 struct attribute_spec.handler. */
9585
9586static tree
9587handle_optimize_attribute (tree *node, tree name, tree args,
9588 int ARG_UNUSED (flags), bool *no_add_attrs)
9589{
9590 /* Ensure we have a function type. */
9591 if (TREE_CODE (*node) != FUNCTION_DECL)
9592 {
9593 warning (OPT_Wattributes, "%qE attribute ignored", name);
9594 *no_add_attrs = true;
9595 }
9596 else
9597 {
9598 struct cl_optimization cur_opts;
9599 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
9600
9601 /* Save current options. */
46625112 9602 cl_optimization_save (&cur_opts, &global_options);
ab442df7
MM		 9603
9604 /* If we previously had some optimization options, use them as the
9605 default. */
9606 if (old_opts)
46625112
JM		 9607 cl_optimization_restore (&global_options,
9608 TREE_OPTIMIZATION (old_opts));
ab442df7
MM		 9609
9610 /* Parse options, and update the vector. */
9611 parse_optimize_options (args, true);
9612 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
bf7b5747 9613 = build_optimization_node (&global_options);
ab442df7
MM		 9614
9615 /* Restore current options. */
46625112 9616 cl_optimization_restore (&global_options, &cur_opts);
ab442df7
MM		 9617 }
9618
9619 return NULL_TREE;
9620}
7458026b
ILT		 9621
9622/* Handle a "no_split_stack" attribute. */
9623
9624static tree
9625handle_no_split_stack_attribute (tree *node, tree name,
9626 tree ARG_UNUSED (args),
9627 int ARG_UNUSED (flags),
9628 bool *no_add_attrs)
9629{
9630 tree decl = *node;
9631
9632 if (TREE_CODE (decl) != FUNCTION_DECL)
9633 {
9634 error_at (DECL_SOURCE_LOCATION (decl),
9635 "%qE attribute applies only to functions", name);
9636 *no_add_attrs = true;
9637 }
9638 else if (DECL_INITIAL (decl))
9639 {
9640 error_at (DECL_SOURCE_LOCATION (decl),
9641 "can%'t set %qE attribute after definition", name);
9642 *no_add_attrs = true;
9643 }
9644
9645 return NULL_TREE;
9646}
826cacfe
MG		 9647
9648/* Handle a "returns_nonnull" attribute; arguments as in
9649 struct attribute_spec.handler. */
9650
9651static tree
9652handle_returns_nonnull_attribute (tree *node, tree, tree, int,
9653 bool *no_add_attrs)
9654{
9655 // Even without a prototype we still have a return type we can check.
9656 if (TREE_CODE (TREE_TYPE (*node)) != POINTER_TYPE)
9657 {
9658 error ("returns_nonnull attribute on a function not returning a pointer");
9659 *no_add_attrs = true;
9660 }
9661 return NULL_TREE;
9662}
9663
976d5a22
TT		 9664/* Handle a "designated_init" attribute; arguments as in
9665 struct attribute_spec.handler. */
9666
9667static tree
9668handle_designated_init_attribute (tree *node, tree name, tree, int,
9669 bool *no_add_attrs)
9670{
9671 if (TREE_CODE (*node) != RECORD_TYPE)
9672 {
9673 error ("%qE attribute is only valid on %<struct%> type", name);
9674 *no_add_attrs = true;
9675 }
9676 return NULL_TREE;
9677}
9678
b34c7881 9679\f
dde05067
NF		 9680/* Check for valid arguments being passed to a function with FNTYPE.
9681 There are NARGS arguments in the array ARGARRAY. */
b34c7881 9682void
dde05067 9683check_function_arguments (const_tree fntype, int nargs, tree *argarray)
b34c7881
JT		 9684{
9685 /* Check for null being passed in a pointer argument that must be
9686 non-null. We also need to do this if format checking is enabled. */
9687
9688 if (warn_nonnull)
dde05067 9689 check_function_nonnull (TYPE_ATTRIBUTES (fntype), nargs, argarray);
b34c7881
JT		 9690
9691 /* Check for errors in format strings. */
9692
e6c69da0 9693 if (warn_format || warn_suggest_attribute_format)
dde05067 9694 check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray);
7876a414
KG		 9695
9696 if (warn_format)
dde05067 9697 check_function_sentinel (fntype, nargs, argarray);
b34c7881
JT		 9698}
9699
9700/* Generic argument checking recursion routine. PARAM is the argument to
9701 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9702 once the argument is resolved. CTX is context for the callback. */
9703void
35b1a6fa
AJ		 9704check_function_arguments_recurse (void (*callback)
9705 (void *, tree, unsigned HOST_WIDE_INT),
9706 void *ctx, tree param,
9707 unsigned HOST_WIDE_INT param_num)
b34c7881 9708{
1043771b 9709 if (CONVERT_EXPR_P (param)
1344f9a3
JM		 9710 && (TYPE_PRECISION (TREE_TYPE (param))
9711 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
b34c7881
JT		 9712 {
9713 /* Strip coercion. */
9714 check_function_arguments_recurse (callback, ctx,
6de9cd9a 9715 TREE_OPERAND (param, 0), param_num);
b34c7881
JT		 9716 return;
9717 }
9718
9719 if (TREE_CODE (param) == CALL_EXPR)
9720 {
5039610b 9721 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
b34c7881
JT		 9722 tree attrs;
9723 bool found_format_arg = false;
9724
9725 /* See if this is a call to a known internationalization function
9726 that modifies a format arg. Such a function may have multiple
9727 format_arg attributes (for example, ngettext). */
9728
9729 for (attrs = TYPE_ATTRIBUTES (type);
9730 attrs;
9731 attrs = TREE_CHAIN (attrs))
9732 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
9733 {
5039610b 9734 tree inner_arg;
b34c7881
JT		 9735 tree format_num_expr;
9736 int format_num;
9737 int i;
5039610b 9738 call_expr_arg_iterator iter;
b34c7881
JT		 9739
9740 /* Extract the argument number, which was previously checked
9741 to be valid. */
9742 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
b34c7881 9743
6b3b8c27 9744 format_num = tree_to_uhwi (format_num_expr);
b34c7881 9745
5039610b
SL		 9746 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
9747 inner_arg != 0;
9748 inner_arg = next_call_expr_arg (&iter), i++)
b34c7881
JT		 9749 if (i == format_num)
9750 {
9751 check_function_arguments_recurse (callback, ctx,
5039610b 9752 inner_arg, param_num);
b34c7881
JT		 9753 found_format_arg = true;
9754 break;
9755 }
9756 }
9757
9758 /* If we found a format_arg attribute and did a recursive check,
9759 we are done with checking this argument. Otherwise, we continue
9760 and this will be considered a non-literal. */
9761 if (found_format_arg)
9762 return;
9763 }
9764
9765 if (TREE_CODE (param) == COND_EXPR)
9766 {
f479b43d 9767 tree cond = fold_for_warn (TREE_OPERAND (param, 0));
b34c7881 9768 /* Check both halves of the conditional expression. */
f479b43d
JM		 9769 if (!integer_zerop (cond))
9770 check_function_arguments_recurse (callback, ctx,
9771 TREE_OPERAND (param, 1), param_num);
9772 if (!integer_nonzerop (cond))
9773 check_function_arguments_recurse (callback, ctx,
9774 TREE_OPERAND (param, 2), param_num);
b34c7881
JT		 9775 return;
9776 }
9777
9778 (*callback) (ctx, param, param_num);
9779}
e2500fed 9780
a98c2819
MLI		 9781/* Checks for a builtin function FNDECL that the number of arguments
9782 NARGS against the required number REQUIRED and issues an error if
9783 there is a mismatch. Returns true if the number of arguments is
9784 correct, otherwise false. */
83322951
RG		 9785
9786static bool
a98c2819 9787builtin_function_validate_nargs (tree fndecl, int nargs, int required)
83322951
RG		 9788{
9789 if (nargs < required)
9790 {
a98c2819
MLI		 9791 error_at (input_location,
9792 "not enough arguments to function %qE", fndecl);
83322951
RG		 9793 return false;
9794 }
9795 else if (nargs > required)
9796 {
a98c2819
MLI		 9797 error_at (input_location,
9798 "too many arguments to function %qE", fndecl);
83322951
RG		 9799 return false;
9800 }
9801 return true;
9802}
9803
9804/* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9805 Returns false if there was an error, otherwise true. */
9806
9807bool
9808check_builtin_function_arguments (tree fndecl, int nargs, tree *args)
9809{
9810 if (!DECL_BUILT_IN (fndecl)
9811 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
9812 return true;
9813
9814 switch (DECL_FUNCTION_CODE (fndecl))
9815 {
9816 case BUILT_IN_CONSTANT_P:
a98c2819 9817 return builtin_function_validate_nargs (fndecl, nargs, 1);
83322951
RG		 9818
9819 case BUILT_IN_ISFINITE:
9820 case BUILT_IN_ISINF:
05f41289 9821 case BUILT_IN_ISINF_SIGN:
83322951
RG		 9822 case BUILT_IN_ISNAN:
9823 case BUILT_IN_ISNORMAL:
61717a45 9824 case BUILT_IN_SIGNBIT:
a98c2819 9825 if (builtin_function_validate_nargs (fndecl, nargs, 1))
83322951
RG		 9826 {
9827 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
9828 {
9829 error ("non-floating-point argument in call to "
9830 "function %qE", fndecl);
9831 return false;
9832 }
9833 return true;
9834 }
9835 return false;
9836
9837 case BUILT_IN_ISGREATER:
9838 case BUILT_IN_ISGREATEREQUAL:
9839 case BUILT_IN_ISLESS:
9840 case BUILT_IN_ISLESSEQUAL:
9841 case BUILT_IN_ISLESSGREATER:
9842 case BUILT_IN_ISUNORDERED:
a98c2819 9843 if (builtin_function_validate_nargs (fndecl, nargs, 2))
83322951
RG		 9844 {
9845 enum tree_code code0, code1;
9846 code0 = TREE_CODE (TREE_TYPE (args[0]));
9847 code1 = TREE_CODE (TREE_TYPE (args[1]));
9848 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
9849 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9850 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
9851 {
9852 error ("non-floating-point arguments in call to "
9853 "function %qE", fndecl);
9854 return false;
9855 }
9856 return true;
9857 }
9858 return false;
9859
3bf5906b 9860 case BUILT_IN_FPCLASSIFY:
a98c2819 9861 if (builtin_function_validate_nargs (fndecl, nargs, 6))
3bf5906b
KG		 9862 {
9863 unsigned i;
b8698a0f 9864
3bf5906b
KG		 9865 for (i=0; i<5; i++)
9866 if (TREE_CODE (args[i]) != INTEGER_CST)
9867 {
9868 error ("non-const integer argument %u in call to function %qE",
9869 i+1, fndecl);
9870 return false;
9871 }
9872
9873 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
9874 {
9875 error ("non-floating-point argument in call to function %qE",
9876 fndecl);
9877 return false;
9878 }
9879 return true;
9880 }
9881 return false;
9882
45d439ac
JJ		 9883 case BUILT_IN_ASSUME_ALIGNED:
9884 if (builtin_function_validate_nargs (fndecl, nargs, 2 + (nargs > 2)))
9885 {
9886 if (nargs >= 3 && TREE_CODE (TREE_TYPE (args[2])) != INTEGER_TYPE)
9887 {
9888 error ("non-integer argument 3 in call to function %qE", fndecl);
9889 return false;
9890 }
9891 return true;
9892 }
9893 return false;
9894
1304953e
JJ		 9895 case BUILT_IN_ADD_OVERFLOW:
9896 case BUILT_IN_SUB_OVERFLOW:
9897 case BUILT_IN_MUL_OVERFLOW:
9898 if (builtin_function_validate_nargs (fndecl, nargs, 3))
9899 {
9900 unsigned i;
9901 for (i = 0; i < 2; i++)
9902 if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i])))
9903 {
9904 error ("argument %u in call to function %qE does not have "
9905 "integral type", i + 1, fndecl);
9906 return false;
9907 }
9908 if (TREE_CODE (TREE_TYPE (args[2])) != POINTER_TYPE
9909 || TREE_CODE (TREE_TYPE (TREE_TYPE (args[2]))) != INTEGER_TYPE)
9910 {
9911 error ("argument 3 in call to function %qE does not have "
9912 "pointer to integer type", fndecl);
9913 return false;
9914 }
9915 return true;
9916 }
9917 return false;
9918
83322951
RG		 9919 default:
9920 return true;
9921 }
9922}
9923
d07605f5
AP		 9924/* Function to help qsort sort FIELD_DECLs by name order. */
9925
9926int
9927field_decl_cmp (const void *x_p, const void *y_p)
9928{
28dab132
BI		 9929 const tree *const x = (const tree *const) x_p;
9930 const tree *const y = (const tree *const) y_p;
9931
d07605f5
AP		 9932 if (DECL_NAME (*x) == DECL_NAME (*y))
9933 /* A nontype is "greater" than a type. */
9934 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
9935 if (DECL_NAME (*x) == NULL_TREE)
9936 return -1;
9937 if (DECL_NAME (*y) == NULL_TREE)
9938 return 1;
9939 if (DECL_NAME (*x) < DECL_NAME (*y))
9940 return -1;
9941 return 1;
9942}
9943
9944static struct {
9945 gt_pointer_operator new_value;
9946 void *cookie;
9947} resort_data;
9948
9949/* This routine compares two fields like field_decl_cmp but using the
9950pointer operator in resort_data. */
9951
9952static int
9953resort_field_decl_cmp (const void *x_p, const void *y_p)
9954{
28dab132
BI		 9955 const tree *const x = (const tree *const) x_p;
9956 const tree *const y = (const tree *const) y_p;
d07605f5
AP		 9957
9958 if (DECL_NAME (*x) == DECL_NAME (*y))
9959 /* A nontype is "greater" than a type. */
9960 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
9961 if (DECL_NAME (*x) == NULL_TREE)
9962 return -1;
9963 if (DECL_NAME (*y) == NULL_TREE)
9964 return 1;
9965 {
9966 tree d1 = DECL_NAME (*x);
9967 tree d2 = DECL_NAME (*y);
9968 resort_data.new_value (&d1, resort_data.cookie);
9969 resort_data.new_value (&d2, resort_data.cookie);
9970 if (d1 < d2)
9971 return -1;
9972 }
9973 return 1;
9974}
9975
9976/* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9977
9978void
9979resort_sorted_fields (void *obj,
e18476eb 9980 void * ARG_UNUSED (orig_obj),
6de9cd9a
DN		 9981 gt_pointer_operator new_value,
9982 void *cookie)
d07605f5 9983{
e18476eb 9984 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
d07605f5
AP		 9985 resort_data.new_value = new_value;
9986 resort_data.cookie = cookie;
9987 qsort (&sf->elts[0], sf->len, sizeof (tree),
6de9cd9a 9988 resort_field_decl_cmp);
d07605f5
AP		 9989}
9990
0a3ee0fd
GDR		 9991/* Subroutine of c_parse_error.
9992 Return the result of concatenating LHS and RHS. RHS is really
9993 a string literal, its first character is indicated by RHS_START and
3292fb42 9994 RHS_SIZE is its length (including the terminating NUL character).
0a3ee0fd
GDR		 9995
9996 The caller is responsible for deleting the returned pointer. */
9997
9998static char *
9999catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
10000{
10001 const int lhs_size = strlen (lhs);
10002 char *result = XNEWVEC (char, lhs_size + rhs_size);
10003 strncpy (result, lhs, lhs_size);
10004 strncpy (result + lhs_size, rhs_start, rhs_size);
10005 return result;
10006}
10007
4b794eaf 10008/* Issue the error given by GMSGID, indicating that it occurred before
4bb8ca28
MM		 10009 TOKEN, which had the associated VALUE. */
10010
10011void
b8698a0f 10012c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
cfc93532 10013 tree value, unsigned char token_flags)
4bb8ca28 10014{
0a3ee0fd
GDR		 10015#define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10016
10017 char *message = NULL;
4bb8ca28 10018
cfc93532 10019 if (token_type == CPP_EOF)
4b794eaf 10020 message = catenate_messages (gmsgid, " at end of input");
b8698a0f
L		 10021 else if (token_type == CPP_CHAR
10022 || token_type == CPP_WCHAR
cfc93532 10023 || token_type == CPP_CHAR16
fe95b036
ESR		 10024 || token_type == CPP_CHAR32
10025 || token_type == CPP_UTF8CHAR)
4bb8ca28
MM		 10026 {
10027 unsigned int val = TREE_INT_CST_LOW (value);
b6baa67d
KVH		 10028 const char *prefix;
10029
cfc93532 10030 switch (token_type)
b6baa67d
KVH		 10031 {
10032 default:
10033 prefix = "";
10034 break;
10035 case CPP_WCHAR:
10036 prefix = "L";
10037 break;
10038 case CPP_CHAR16:
10039 prefix = "u";
10040 break;
10041 case CPP_CHAR32:
10042 prefix = "U";
10043 break;
fe95b036
ESR		 10044 case CPP_UTF8CHAR:
10045 prefix = "u8";
10046 break;
b6baa67d
KVH		 10047 }
10048
4bb8ca28 10049 if (val <= UCHAR_MAX && ISGRAPH (val))
c22cacf3 10050 message = catenate_messages (gmsgid, " before %s'%c'");
4bb8ca28 10051 else
c22cacf3 10052 message = catenate_messages (gmsgid, " before %s'\\x%x'");
0a3ee0fd 10053
b6baa67d 10054 error (message, prefix, val);
0a3ee0fd
GDR		 10055 free (message);
10056 message = NULL;
4bb8ca28 10057 }
65e5a578
ESR		 10058 else if (token_type == CPP_CHAR_USERDEF
10059 || token_type == CPP_WCHAR_USERDEF
10060 || token_type == CPP_CHAR16_USERDEF
fe95b036
ESR		 10061 || token_type == CPP_CHAR32_USERDEF
10062 || token_type == CPP_UTF8CHAR_USERDEF)
65e5a578
ESR		 10063 message = catenate_messages (gmsgid,
10064 " before user-defined character literal");
10065 else if (token_type == CPP_STRING_USERDEF
10066 || token_type == CPP_WSTRING_USERDEF
10067 || token_type == CPP_STRING16_USERDEF
10068 || token_type == CPP_STRING32_USERDEF
10069 || token_type == CPP_UTF8STRING_USERDEF)
10070 message = catenate_messages (gmsgid, " before user-defined string literal");
b8698a0f
L		 10071 else if (token_type == CPP_STRING
10072 || token_type == CPP_WSTRING
cfc93532 10073 || token_type == CPP_STRING16
2c6e3f55
JJ		 10074 || token_type == CPP_STRING32
10075 || token_type == CPP_UTF8STRING)
4b794eaf 10076 message = catenate_messages (gmsgid, " before string constant");
cfc93532 10077 else if (token_type == CPP_NUMBER)
4b794eaf 10078 message = catenate_messages (gmsgid, " before numeric constant");
cfc93532 10079 else if (token_type == CPP_NAME)
0a3ee0fd 10080 {
4b794eaf 10081 message = catenate_messages (gmsgid, " before %qE");
c51a1ba9 10082 error (message, value);
0a3ee0fd
GDR		 10083 free (message);
10084 message = NULL;
10085 }
cfc93532 10086 else if (token_type == CPP_PRAGMA)
bc4071dd 10087 message = catenate_messages (gmsgid, " before %<#pragma%>");
cfc93532 10088 else if (token_type == CPP_PRAGMA_EOL)
bc4071dd 10089 message = catenate_messages (gmsgid, " before end of line");
34429675
JM		 10090 else if (token_type == CPP_DECLTYPE)
10091 message = catenate_messages (gmsgid, " before %<decltype%>");
cfc93532 10092 else if (token_type < N_TTYPES)
0a3ee0fd 10093 {
4b794eaf 10094 message = catenate_messages (gmsgid, " before %qs token");
cfc93532 10095 error (message, cpp_type2name (token_type, token_flags));
0a3ee0fd
GDR		 10096 free (message);
10097 message = NULL;
10098 }
4bb8ca28 10099 else
4b794eaf 10100 error (gmsgid);
0a3ee0fd
GDR		 10101
10102 if (message)
10103 {
10104 error (message);
10105 free (message);
10106 }
c22cacf3 10107#undef catenate_messages
4bb8ca28
MM		 10108}
10109
87cf0651
SB		 10110/* Return the gcc option code associated with the reason for a cpp
10111 message, or 0 if none. */
10112
10113static int
10114c_option_controlling_cpp_error (int reason)
10115{
b559c810 10116 const struct cpp_reason_option_codes_t *entry;
87cf0651 10117
b559c810 10118 for (entry = cpp_reason_option_codes; entry->reason != CPP_W_NONE; entry++)
87cf0651
SB		 10119 {
10120 if (entry->reason == reason)
10121 return entry->option_code;
10122 }
10123 return 0;
10124}
10125
148e4216 10126/* Callback from cpp_error for PFILE to print diagnostics from the
87cf0651
SB		 10127 preprocessor. The diagnostic is of type LEVEL, with REASON set
10128 to the reason code if LEVEL is represents a warning, at location
8a645150
DM		 10129 RICHLOC unless this is after lexing and the compiler's location
10130 should be used instead; MSG is the translated message and AP
148e4216
JM		 10131 the arguments. Returns true if a diagnostic was emitted, false
10132 otherwise. */
10133
10134bool
87cf0651 10135c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason,
8a645150 10136 rich_location *richloc,
148e4216
JM		 10137 const char *msg, va_list *ap)
10138{
10139 diagnostic_info diagnostic;
10140 diagnostic_t dlevel;
e3339d0f 10141 bool save_warn_system_headers = global_dc->dc_warn_system_headers;
148e4216
JM		 10142 bool ret;
10143
10144 switch (level)
10145 {
10146 case CPP_DL_WARNING_SYSHDR:
10147 if (flag_no_output)
10148 return false;
e3339d0f 10149 global_dc->dc_warn_system_headers = 1;
148e4216
JM		 10150 /* Fall through. */
10151 case CPP_DL_WARNING:
10152 if (flag_no_output)
10153 return false;
10154 dlevel = DK_WARNING;
10155 break;
10156 case CPP_DL_PEDWARN:
10157 if (flag_no_output && !flag_pedantic_errors)
10158 return false;
10159 dlevel = DK_PEDWARN;
10160 break;
10161 case CPP_DL_ERROR:
10162 dlevel = DK_ERROR;
10163 break;
10164 case CPP_DL_ICE:
10165 dlevel = DK_ICE;
10166 break;
10167 case CPP_DL_NOTE:
10168 dlevel = DK_NOTE;
10169 break;
47580d22
JM		 10170 case CPP_DL_FATAL:
10171 dlevel = DK_FATAL;
10172 break;
148e4216
JM		 10173 default:
10174 gcc_unreachable ();
10175 }
10176 if (done_lexing)
f79520bb 10177 richloc->set_range (line_table, 0, input_location, true);
148e4216 10178 diagnostic_set_info_translated (&diagnostic, msg, ap,
8a645150 10179 richloc, dlevel);
87cf0651
SB		 10180 diagnostic_override_option_index (&diagnostic,
10181 c_option_controlling_cpp_error (reason));
148e4216
JM		 10182 ret = report_diagnostic (&diagnostic);
10183 if (level == CPP_DL_WARNING_SYSHDR)
e3339d0f 10184 global_dc->dc_warn_system_headers = save_warn_system_headers;
148e4216
JM		 10185 return ret;
10186}
10187
c5ff069d
ZW		 10188/* Convert a character from the host to the target execution character
10189 set. cpplib handles this, mostly. */
10190
10191HOST_WIDE_INT
10192c_common_to_target_charset (HOST_WIDE_INT c)
10193{
10194 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10195 zero-extended under -fno-signed-char. cpplib insists that characters
10196 and character constants are always unsigned. Hence we must convert
10197 back and forth. */
10198 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
10199
10200 uc = cpp_host_to_exec_charset (parse_in, uc);
10201
10202 if (flag_signed_char)
10203 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
10204 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
10205 else
10206 return uc;
10207}
10208
cf9e9959
EB		 10209/* Fold an offsetof-like expression. EXPR is a nested sequence of component
10210 references with an INDIRECT_REF of a constant at the bottom; much like the
10211 traditional rendering of offsetof as a macro. Return the folded result. */
ee8a6a3e 10212
cf9e9959 10213tree
c85158de 10214fold_offsetof_1 (tree expr, enum tree_code ctx)
ee8a6a3e 10215{
ee8a6a3e 10216 tree base, off, t;
c85158de
MS		 10217 tree_code code = TREE_CODE (expr);
10218 switch (code)
ee8a6a3e
RH		 10219 {
10220 case ERROR_MARK:
10221 return expr;
10222
545b7d8c
VR		 10223 case VAR_DECL:
10224 error ("cannot apply %<offsetof%> to static data member %qD", expr);
10225 return error_mark_node;
10226
6d4d7b0e 10227 case CALL_EXPR:
8d5f60ac 10228 case TARGET_EXPR:
6d4d7b0e
PB		 10229 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10230 return error_mark_node;
10231
6d4d7b0e
PB		 10232 case NOP_EXPR:
10233 case INDIRECT_REF:
cf9e9959 10234 if (!TREE_CONSTANT (TREE_OPERAND (expr, 0)))
61c3c490
DS		 10235 {
10236 error ("cannot apply %<offsetof%> to a non constant address");
10237 return error_mark_node;
10238 }
cf9e9959 10239 return TREE_OPERAND (expr, 0);
6d4d7b0e 10240
ee8a6a3e 10241 case COMPONENT_REF:
c85158de 10242 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
ee8a6a3e
RH		 10243 if (base == error_mark_node)
10244 return base;
10245
10246 t = TREE_OPERAND (expr, 1);
10247 if (DECL_C_BIT_FIELD (t))
10248 {
10249 error ("attempt to take address of bit-field structure "
c51a1ba9 10250 "member %qD", t);
ee8a6a3e
RH		 10251 return error_mark_node;
10252 }
db3927fb 10253 off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t),
386b1f1f 10254 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t))
db3927fb 10255 / BITS_PER_UNIT));
ee8a6a3e
RH		 10256 break;
10257
10258 case ARRAY_REF:
c85158de 10259 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
ee8a6a3e
RH		 10260 if (base == error_mark_node)
10261 return base;
10262
10263 t = TREE_OPERAND (expr, 1);
61c3c490
DS		 10264
10265 /* Check if the offset goes beyond the upper bound of the array. */
cf9e9959 10266 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) >= 0)
d32599a6
JJ		 10267 {
10268 tree upbound = array_ref_up_bound (expr);
10269 if (upbound != NULL_TREE
10270 && TREE_CODE (upbound) == INTEGER_CST
10271 && !tree_int_cst_equal (upbound,
10272 TYPE_MAX_VALUE (TREE_TYPE (upbound))))
10273 {
c85158de
MS		 10274 if (ctx != ARRAY_REF && ctx != COMPONENT_REF)
10275 upbound = size_binop (PLUS_EXPR, upbound,
10276 build_int_cst (TREE_TYPE (upbound), 1));
d32599a6
JJ		 10277 if (tree_int_cst_lt (upbound, t))
10278 {
10279 tree v;
10280
10281 for (v = TREE_OPERAND (expr, 0);
10282 TREE_CODE (v) == COMPONENT_REF;
10283 v = TREE_OPERAND (v, 0))
10284 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0)))
10285 == RECORD_TYPE)
10286 {
910ad8de
NF		 10287 tree fld_chain = DECL_CHAIN (TREE_OPERAND (v, 1));
10288 for (; fld_chain; fld_chain = DECL_CHAIN (fld_chain))
d32599a6
JJ		 10289 if (TREE_CODE (fld_chain) == FIELD_DECL)
10290 break;
10291
10292 if (fld_chain)
10293 break;
10294 }
10295 /* Don't warn if the array might be considered a poor
10296 man's flexible array member with a very permissive
10297 definition thereof. */
10298 if (TREE_CODE (v) == ARRAY_REF
10299 || TREE_CODE (v) == COMPONENT_REF)
10300 warning (OPT_Warray_bounds,
10301 "index %E denotes an offset "
10302 "greater than size of %qT",
10303 t, TREE_TYPE (TREE_OPERAND (expr, 0)));
10304 }
10305 }
10306 }
cf9e9959
EB		 10307
10308 t = convert (sizetype, t);
10309 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
ee8a6a3e
RH		 10310 break;
10311
1916c916
VR		 10312 case COMPOUND_EXPR:
10313 /* Handle static members of volatile structs. */
10314 t = TREE_OPERAND (expr, 1);
0ae9bd27 10315 gcc_assert (VAR_P (t));
cf9e9959 10316 return fold_offsetof_1 (t);
1916c916 10317
ee8a6a3e 10318 default:
366de0ce 10319 gcc_unreachable ();
ee8a6a3e
RH		 10320 }
10321
cf9e9959 10322 return fold_build_pointer_plus (base, off);
ee8a6a3e
RH		 10323}
10324
cf9e9959
EB		 10325/* Likewise, but convert it to the return type of offsetof. */
10326
ee8a6a3e 10327tree
cf9e9959 10328fold_offsetof (tree expr)
ee8a6a3e 10329{
cf9e9959 10330 return convert (size_type_node, fold_offsetof_1 (expr));
ee8a6a3e
RH		 10331}
10332
d166d4c3
AK		 10333/* Warn for A ?: C expressions (with B omitted) where A is a boolean
10334 expression, because B will always be true. */
10335
10336void
10337warn_for_omitted_condop (location_t location, tree cond)
10338{
10339 if (truth_value_p (TREE_CODE (cond)))
10340 warning_at (location, OPT_Wparentheses,
10341 "the omitted middle operand in ?: will always be %<true%>, "
10342 "suggest explicit middle operand");
10343}
10344
4816c593
NF		 10345/* Give an error for storing into ARG, which is 'const'. USE indicates
10346 how ARG was being used. */
10347
10348void
c02065fc 10349readonly_error (location_t loc, tree arg, enum lvalue_use use)
4816c593
NF		 10350{
10351 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
10352 || use == lv_asm);
10353 /* Using this macro rather than (for example) arrays of messages
10354 ensures that all the format strings are checked at compile
10355 time. */
10356#define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10357 : (use == lv_increment ? (I) \
10358 : (use == lv_decrement ? (D) : (AS))))
10359 if (TREE_CODE (arg) == COMPONENT_REF)
10360 {
10361 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
c02065fc
AH		 10362 error_at (loc, READONLY_MSG (G_("assignment of member "
10363 "%qD in read-only object"),
10364 G_("increment of member "
10365 "%qD in read-only object"),
10366 G_("decrement of member "
10367 "%qD in read-only object"),
10368 G_("member %qD in read-only object "
10369 "used as %<asm%> output")),
10370 TREE_OPERAND (arg, 1));
4816c593 10371 else
c02065fc
AH		 10372 error_at (loc, READONLY_MSG (G_("assignment of read-only member %qD"),
10373 G_("increment of read-only member %qD"),
10374 G_("decrement of read-only member %qD"),
10375 G_("read-only member %qD used as %<asm%> output")),
10376 TREE_OPERAND (arg, 1));
4816c593 10377 }
0ae9bd27 10378 else if (VAR_P (arg))
c02065fc
AH		 10379 error_at (loc, READONLY_MSG (G_("assignment of read-only variable %qD"),
10380 G_("increment of read-only variable %qD"),
10381 G_("decrement of read-only variable %qD"),
10382 G_("read-only variable %qD used as %<asm%> output")),
10383 arg);
4816c593 10384 else if (TREE_CODE (arg) == PARM_DECL)
c02065fc
AH		 10385 error_at (loc, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10386 G_("increment of read-only parameter %qD"),
10387 G_("decrement of read-only parameter %qD"),
10388 G_("read-only parameter %qD use as %<asm%> output")),
10389 arg);
4816c593
NF		 10390 else if (TREE_CODE (arg) == RESULT_DECL)
10391 {
10392 gcc_assert (c_dialect_cxx ());
c02065fc
AH		 10393 error_at (loc, READONLY_MSG (G_("assignment of "
10394 "read-only named return value %qD"),
10395 G_("increment of "
10396 "read-only named return value %qD"),
10397 G_("decrement of "
10398 "read-only named return value %qD"),
10399 G_("read-only named return value %qD "
10400 "used as %<asm%>output")),
10401 arg);
4816c593
NF		 10402 }
10403 else if (TREE_CODE (arg) == FUNCTION_DECL)
c02065fc
AH		 10404 error_at (loc, READONLY_MSG (G_("assignment of function %qD"),
10405 G_("increment of function %qD"),
10406 G_("decrement of function %qD"),
10407 G_("function %qD used as %<asm%> output")),
10408 arg);
4816c593 10409 else
c02065fc
AH		 10410 error_at (loc, READONLY_MSG (G_("assignment of read-only location %qE"),
10411 G_("increment of read-only location %qE"),
10412 G_("decrement of read-only location %qE"),
10413 G_("read-only location %qE used as %<asm%> output")),
10414 arg);
4816c593
NF		 10415}
10416
37dc0d8d 10417/* Print an error message for an invalid lvalue. USE says
7bd11157
TT		 10418 how the lvalue is being used and so selects the error message. LOC
10419 is the location for the error. */
5ae9ba3e 10420
37dc0d8d 10421void
7bd11157 10422lvalue_error (location_t loc, enum lvalue_use use)
5ae9ba3e 10423{
37dc0d8d 10424 switch (use)
5ae9ba3e 10425 {
37dc0d8d 10426 case lv_assign:
7bd11157 10427 error_at (loc, "lvalue required as left operand of assignment");
37dc0d8d
JM		 10428 break;
10429 case lv_increment:
7bd11157 10430 error_at (loc, "lvalue required as increment operand");
37dc0d8d
JM		 10431 break;
10432 case lv_decrement:
7bd11157 10433 error_at (loc, "lvalue required as decrement operand");
37dc0d8d
JM		 10434 break;
10435 case lv_addressof:
7bd11157 10436 error_at (loc, "lvalue required as unary %<&%> operand");
37dc0d8d
JM		 10437 break;
10438 case lv_asm:
7bd11157 10439 error_at (loc, "lvalue required in asm statement");
37dc0d8d
JM		 10440 break;
10441 default:
10442 gcc_unreachable ();
5ae9ba3e 10443 }
5ae9ba3e 10444}
7a6daeb0
NF		 10445
10446/* Print an error message for an invalid indirection of type TYPE.
10447 ERRSTRING is the name of the operator for the indirection. */
10448
10449void
10450invalid_indirection_error (location_t loc, tree type, ref_operator errstring)
10451{
10452 switch (errstring)
10453 {
10454 case RO_NULL:
10455 gcc_assert (c_dialect_cxx ());
10456 error_at (loc, "invalid type argument (have %qT)", type);
10457 break;
10458 case RO_ARRAY_INDEXING:
10459 error_at (loc,
10460 "invalid type argument of array indexing (have %qT)",
10461 type);
10462 break;
10463 case RO_UNARY_STAR:
10464 error_at (loc,
10465 "invalid type argument of unary %<*%> (have %qT)",
10466 type);
10467 break;
10468 case RO_ARROW:
10469 error_at (loc,
10470 "invalid type argument of %<->%> (have %qT)",
10471 type);
10472 break;
55a7f02f
MP		 10473 case RO_ARROW_STAR:
10474 error_at (loc,
10475 "invalid type argument of %<->*%> (have %qT)",
10476 type);
10477 break;
7a6daeb0
NF		 10478 case RO_IMPLICIT_CONVERSION:
10479 error_at (loc,
10480 "invalid type argument of implicit conversion (have %qT)",
10481 type);
10482 break;
10483 default:
10484 gcc_unreachable ();
10485 }
10486}
aab038d5
RH		 10487\f
10488/* *PTYPE is an incomplete array. Complete it with a domain based on
10489 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10490 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10491 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10492
10493int
10494complete_array_type (tree *ptype, tree initial_value, bool do_default)
10495{
10496 tree maxindex, type, main_type, elt, unqual_elt;
10497 int failure = 0, quals;
06d40de8 10498 hashval_t hashcode = 0;
40d3d530 10499 bool overflow_p = false;
aab038d5
RH		 10500
10501 maxindex = size_zero_node;
10502 if (initial_value)
10503 {
10504 if (TREE_CODE (initial_value) == STRING_CST)
10505 {
10506 int eltsize
10507 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
10508 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
10509 }
10510 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
10511 {
9771b263 10512 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (initial_value);
aab038d5 10513
9771b263 10514 if (vec_safe_is_empty (v))
aab038d5
RH		 10515 {
10516 if (pedantic)
10517 failure = 3;
830c740f 10518 maxindex = ssize_int (-1);
aab038d5
RH		 10519 }
10520 else
10521 {
10522 tree curindex;
4038c495
GB		 10523 unsigned HOST_WIDE_INT cnt;
10524 constructor_elt *ce;
cff7525f 10525 bool fold_p = false;
aab038d5 10526
9771b263 10527 if ((*v)[0].index)
40d3d530
JR		 10528 maxindex = (*v)[0].index, fold_p = true;
10529
aab038d5
RH		 10530 curindex = maxindex;
10531
9771b263 10532 for (cnt = 1; vec_safe_iterate (v, cnt, &ce); cnt++)
aab038d5 10533 {
cff7525f 10534 bool curfold_p = false;
4038c495 10535 if (ce->index)
cff7525f 10536 curindex = ce->index, curfold_p = true;
aab038d5 10537 else
cff7525f
JH		 10538 {
10539 if (fold_p)
40d3d530
JR		 10540 {
10541 /* Since we treat size types now as ordinary
10542 unsigned types, we need an explicit overflow
10543 check. */
10544 tree orig = curindex;
10545 curindex = fold_convert (sizetype, curindex);
10546 overflow_p |= tree_int_cst_lt (curindex, orig);
10547 }
db3927fb
AH		 10548 curindex = size_binop (PLUS_EXPR, curindex,
10549 size_one_node);
cff7525f 10550 }
aab038d5 10551 if (tree_int_cst_lt (maxindex, curindex))
cff7525f 10552 maxindex = curindex, fold_p = curfold_p;
aab038d5 10553 }
40d3d530
JR		 10554 if (fold_p)
10555 {
10556 tree orig = maxindex;
10557 maxindex = fold_convert (sizetype, maxindex);
10558 overflow_p |= tree_int_cst_lt (maxindex, orig);
10559 }
aab038d5
RH		 10560 }
10561 }
10562 else
10563 {
10564 /* Make an error message unless that happened already. */
10565 if (initial_value != error_mark_node)
10566 failure = 1;
10567 }
10568 }
10569 else
10570 {
10571 failure = 2;
10572 if (!do_default)
10573 return failure;
10574 }
10575
10576 type = *ptype;
10577 elt = TREE_TYPE (type);
10578 quals = TYPE_QUALS (strip_array_types (elt));
10579 if (quals == 0)
10580 unqual_elt = elt;
10581 else
36c5e70a 10582 unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals));
aab038d5
RH		 10583
10584 /* Using build_distinct_type_copy and modifying things afterward instead
10585 of using build_array_type to create a new type preserves all of the
10586 TYPE_LANG_FLAG_? bits that the front end may have set. */
10587 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
10588 TREE_TYPE (main_type) = unqual_elt;
e6313a78
RG		 10589 TYPE_DOMAIN (main_type)
10590 = build_range_type (TREE_TYPE (maxindex),
10591 build_int_cst (TREE_TYPE (maxindex), 0), maxindex);
aab038d5
RH		 10592 layout_type (main_type);
10593
06d40de8
DG		 10594 /* Make sure we have the canonical MAIN_TYPE. */
10595 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
b8698a0f 10596 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
06d40de8
DG		 10597 hashcode);
10598 main_type = type_hash_canon (hashcode, main_type);
10599
9ae165a0
DG		 10600 /* Fix the canonical type. */
10601 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
10602 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
10603 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
10604 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
10605 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
10606 != TYPE_DOMAIN (main_type)))
b8698a0f 10607 TYPE_CANONICAL (main_type)
9ae165a0
DG		 10608 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
10609 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
10610 else
10611 TYPE_CANONICAL (main_type) = main_type;
10612
aab038d5
RH		 10613 if (quals == 0)
10614 type = main_type;
10615 else
10616 type = c_build_qualified_type (main_type, quals);
10617
7bfcb402
JM		 10618 if (COMPLETE_TYPE_P (type)
10619 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
40d3d530 10620 && (overflow_p || TREE_OVERFLOW (TYPE_SIZE_UNIT (type))))
7bfcb402
JM		 10621 {
10622 error ("size of array is too large");
10623 /* If we proceed with the array type as it is, we'll eventually
386b1f1f 10624 crash in tree_to_[su]hwi(). */
7bfcb402
JM		 10625 type = error_mark_node;
10626 }
10627
aab038d5
RH		 10628 *ptype = type;
10629 return failure;
10630}
5ae9ba3e 10631
30cd1c5d
AS		 10632/* Like c_mark_addressable but don't check register qualifier. */
10633void
10634c_common_mark_addressable_vec (tree t)
10635{
10636 while (handled_component_p (t))
10637 t = TREE_OPERAND (t, 0);
0ae9bd27 10638 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
30cd1c5d
AS		 10639 return;
10640 TREE_ADDRESSABLE (t) = 1;
10641}
10642
10643
48ae6c13
RH		 10644\f
10645/* Used to help initialize the builtin-types.def table. When a type of
10646 the correct size doesn't exist, use error_mark_node instead of NULL.
10647 The later results in segfaults even when a decl using the type doesn't
10648 get invoked. */
10649
10650tree
10651builtin_type_for_size (int size, bool unsignedp)
10652{
21fa2faf 10653 tree type = c_common_type_for_size (size, unsignedp);
48ae6c13
RH		 10654 return type ? type : error_mark_node;
10655}
10656
10657/* A helper function for resolve_overloaded_builtin in resolving the
10658 overloaded __sync_ builtins. Returns a positive power of 2 if the
10659 first operand of PARAMS is a pointer to a supported data type.
7a127fa7
MS		 10660 Returns 0 if an error is encountered.
10661 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10662 built-ins. */
48ae6c13
RH		 10663
10664static int
7a127fa7 10665sync_resolve_size (tree function, vec<tree, va_gc> *params, bool fetch)
48ae6c13 10666{
7a127fa7
MS		 10667 /* Type of the argument. */
10668 tree argtype;
10669 /* Type the argument points to. */
48ae6c13
RH		 10670 tree type;
10671 int size;
10672
9771b263 10673 if (!params)
48ae6c13
RH		 10674 {
10675 error ("too few arguments to function %qE", function);
10676 return 0;
10677 }
10678
7a127fa7 10679 argtype = type = TREE_TYPE ((*params)[0]);
6415bd5d
JM		 10680 if (TREE_CODE (type) == ARRAY_TYPE)
10681 {
10682 /* Force array-to-pointer decay for C++. */
10683 gcc_assert (c_dialect_cxx());
10684 (*params)[0] = default_conversion ((*params)[0]);
10685 type = TREE_TYPE ((*params)[0]);
10686 }
48ae6c13
RH		 10687 if (TREE_CODE (type) != POINTER_TYPE)
10688 goto incompatible;
10689
10690 type = TREE_TYPE (type);
10691 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
10692 goto incompatible;
10693
7a127fa7
MS		 10694 if (fetch && TREE_CODE (type) == BOOLEAN_TYPE)
10695 goto incompatible;
10696
ae7e9ddd 10697 size = tree_to_uhwi (TYPE_SIZE_UNIT (type));
a0274e3e 10698 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
48ae6c13
RH		 10699 return size;
10700
10701 incompatible:
7a127fa7
MS		 10702 error ("operand type %qT is incompatible with argument %d of %qE",
10703 argtype, 1, function);
48ae6c13
RH		 10704 return 0;
10705}
10706
c22cacf3 10707/* A helper function for resolve_overloaded_builtin. Adds casts to
48ae6c13
RH		 10708 PARAMS to make arguments match up with those of FUNCTION. Drops
10709 the variadic arguments at the end. Returns false if some error
10710 was encountered; true on success. */
10711
10712static bool
86951993 10713sync_resolve_params (location_t loc, tree orig_function, tree function,
9771b263 10714 vec<tree, va_gc> *params, bool orig_format)
48ae6c13 10715{
e19a18d4 10716 function_args_iterator iter;
48ae6c13 10717 tree ptype;
bbbbb16a 10718 unsigned int parmnum;
48ae6c13 10719
e19a18d4 10720 function_args_iter_init (&iter, TREE_TYPE (function));
48ae6c13
RH		 10721 /* We've declared the implementation functions to use "volatile void *"
10722 as the pointer parameter, so we shouldn't get any complaints from the
10723 call to check_function_arguments what ever type the user used. */
e19a18d4 10724 function_args_iter_next (&iter);
9771b263 10725 ptype = TREE_TYPE (TREE_TYPE ((*params)[0]));
267bac10 10726 ptype = TYPE_MAIN_VARIANT (ptype);
48ae6c13
RH		 10727
10728 /* For the rest of the values, we need to cast these to FTYPE, so that we
10729 don't get warnings for passing pointer types, etc. */
bbbbb16a 10730 parmnum = 0;
e19a18d4 10731 while (1)
48ae6c13 10732 {
e19a18d4
NF		 10733 tree val, arg_type;
10734
10735 arg_type = function_args_iter_cond (&iter);
10736 /* XXX void_type_node belies the abstraction. */
10737 if (arg_type == void_type_node)
10738 break;
48ae6c13 10739
bbbbb16a 10740 ++parmnum;
9771b263 10741 if (params->length () <= parmnum)
48ae6c13 10742 {
86951993 10743 error_at (loc, "too few arguments to function %qE", orig_function);
48ae6c13
RH		 10744 return false;
10745 }
10746
e3793c6f
JJ		 10747 /* Only convert parameters if arg_type is unsigned integer type with
10748 new format sync routines, i.e. don't attempt to convert pointer
10749 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10750 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10751 kinds). */
10752 if (TREE_CODE (arg_type) == INTEGER_TYPE && TYPE_UNSIGNED (arg_type))
86951993
AM		 10753 {
10754 /* Ideally for the first conversion we'd use convert_for_assignment
10755 so that we get warnings for anything that doesn't match the pointer
10756 type. This isn't portable across the C and C++ front ends atm. */
9771b263 10757 val = (*params)[parmnum];
86951993
AM		 10758 val = convert (ptype, val);
10759 val = convert (arg_type, val);
9771b263 10760 (*params)[parmnum] = val;
86951993 10761 }
48ae6c13 10762
e19a18d4 10763 function_args_iter_next (&iter);
48ae6c13
RH		 10764 }
10765
86951993 10766 /* __atomic routines are not variadic. */
9771b263 10767 if (!orig_format && params->length () != parmnum + 1)
86951993
AM		 10768 {
10769 error_at (loc, "too many arguments to function %qE", orig_function);
10770 return false;
10771 }
10772
48ae6c13
RH		 10773 /* The definition of these primitives is variadic, with the remaining
10774 being "an optional list of variables protected by the memory barrier".
10775 No clue what that's supposed to mean, precisely, but we consider all
10776 call-clobbered variables to be protected so we're safe. */
9771b263 10777 params->truncate (parmnum + 1);
48ae6c13
RH		 10778
10779 return true;
10780}
10781
c22cacf3 10782/* A helper function for resolve_overloaded_builtin. Adds a cast to
48ae6c13
RH		 10783 RESULT to make it match the type of the first pointer argument in
10784 PARAMS. */
10785
10786static tree
86951993 10787sync_resolve_return (tree first_param, tree result, bool orig_format)
48ae6c13 10788{
bbbbb16a 10789 tree ptype = TREE_TYPE (TREE_TYPE (first_param));
86951993 10790 tree rtype = TREE_TYPE (result);
99db1ef0 10791 ptype = TYPE_MAIN_VARIANT (ptype);
86951993
AM		 10792
10793 /* New format doesn't require casting unless the types are the same size. */
10794 if (orig_format || tree_int_cst_equal (TYPE_SIZE (ptype), TYPE_SIZE (rtype)))
10795 return convert (ptype, result);
10796 else
10797 return result;
10798}
10799
10800/* This function verifies the PARAMS to generic atomic FUNCTION.
10801 It returns the size if all the parameters are the same size, otherwise
10802 0 is returned if the parameters are invalid. */
10803
10804static int
9771b263
DN		 10805get_atomic_generic_size (location_t loc, tree function,
10806 vec<tree, va_gc> *params)
86951993
AM		 10807{
10808 unsigned int n_param;
10809 unsigned int n_model;
10810 unsigned int x;
10811 int size_0;
10812 tree type_0;
10813
10814 /* Determine the parameter makeup. */
10815 switch (DECL_FUNCTION_CODE (function))
10816 {
10817 case BUILT_IN_ATOMIC_EXCHANGE:
10818 n_param = 4;
10819 n_model = 1;
10820 break;
10821 case BUILT_IN_ATOMIC_LOAD:
10822 case BUILT_IN_ATOMIC_STORE:
10823 n_param = 3;
10824 n_model = 1;
10825 break;
10826 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
10827 n_param = 6;
10828 n_model = 2;
10829 break;
10830 default:
c466c4ff 10831 gcc_unreachable ();
86951993
AM		 10832 }
10833
9771b263 10834 if (vec_safe_length (params) != n_param)
86951993
AM		 10835 {
10836 error_at (loc, "incorrect number of arguments to function %qE", function);
10837 return 0;
10838 }
10839
10840 /* Get type of first parameter, and determine its size. */
9771b263 10841 type_0 = TREE_TYPE ((*params)[0]);
6415bd5d
JM		 10842 if (TREE_CODE (type_0) == ARRAY_TYPE)
10843 {
10844 /* Force array-to-pointer decay for C++. */
10845 gcc_assert (c_dialect_cxx());
10846 (*params)[0] = default_conversion ((*params)[0]);
10847 type_0 = TREE_TYPE ((*params)[0]);
10848 }
c466c4ff
AM		 10849 if (TREE_CODE (type_0) != POINTER_TYPE || VOID_TYPE_P (TREE_TYPE (type_0)))
10850 {
10851 error_at (loc, "argument 1 of %qE must be a non-void pointer type",
10852 function);
10853 return 0;
10854 }
10855
10856 /* Types must be compile time constant sizes. */
10857 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0)))) != INTEGER_CST)
86951993 10858 {
c466c4ff
AM		 10859 error_at (loc,
10860 "argument 1 of %qE must be a pointer to a constant size type",
10861 function);
86951993
AM		 10862 return 0;
10863 }
c466c4ff 10864
ae7e9ddd 10865 size_0 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0)));
86951993 10866
c466c4ff
AM		 10867 /* Zero size objects are not allowed. */
10868 if (size_0 == 0)
10869 {
10870 error_at (loc,
10871 "argument 1 of %qE must be a pointer to a nonzero size object",
10872 function);
10873 return 0;
10874 }
10875
86951993
AM		 10876 /* Check each other parameter is a pointer and the same size. */
10877 for (x = 0; x < n_param - n_model; x++)
10878 {
10879 int size;
9771b263 10880 tree type = TREE_TYPE ((*params)[x]);
688010ba 10881 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
86951993
AM		 10882 if (n_param == 6 && x == 3)
10883 continue;
10884 if (!POINTER_TYPE_P (type))
10885 {
10886 error_at (loc, "argument %d of %qE must be a pointer type", x + 1,
10887 function);
10888 return 0;
10889 }
7b56b2f8
MP		 10890 tree type_size = TYPE_SIZE_UNIT (TREE_TYPE (type));
10891 size = type_size ? tree_to_uhwi (type_size) : 0;
86951993
AM		 10892 if (size != size_0)
10893 {
10894 error_at (loc, "size mismatch in argument %d of %qE", x + 1,
10895 function);
10896 return 0;
10897 }
10898 }
10899
10900 /* Check memory model parameters for validity. */
10901 for (x = n_param - n_model ; x < n_param; x++)
10902 {
9771b263 10903 tree p = (*params)[x];
86951993
AM		 10904 if (TREE_CODE (p) == INTEGER_CST)
10905 {
ae7e9ddd 10906 int i = tree_to_uhwi (p);
46b35980 10907 if (i < 0 || (memmodel_base (i) >= MEMMODEL_LAST))
86951993
AM		 10908 {
10909 warning_at (loc, OPT_Winvalid_memory_model,
10910 "invalid memory model argument %d of %qE", x + 1,
10911 function);
86951993
AM		 10912 }
10913 }
10914 else
10915 if (!INTEGRAL_TYPE_P (TREE_TYPE (p)))
10916 {
10917 error_at (loc, "non-integer memory model argument %d of %qE", x + 1,
10918 function);
10919 return 0;
10920 }
10921 }
10922
10923 return size_0;
10924}
10925
10926
10927/* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10928 at the beginning of the parameter list PARAMS representing the size of the
10929 objects. This is to match the library ABI requirement. LOC is the location
10930 of the function call.
10931 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10932 returned to allow the external call to be constructed. */
10933
10934static tree
10935add_atomic_size_parameter (unsigned n, location_t loc, tree function,
9771b263 10936 vec<tree, va_gc> *params)
86951993
AM		 10937{
10938 tree size_node;
10939
10940 /* Insert a SIZE_T parameter as the first param. If there isn't
10941 enough space, allocate a new vector and recursively re-build with that. */
9771b263 10942 if (!params->space (1))
86951993
AM		 10943 {
10944 unsigned int z, len;
9771b263 10945 vec<tree, va_gc> *v;
86951993
AM		 10946 tree f;
10947
9771b263
DN		 10948 len = params->length ();
10949 vec_alloc (v, len + 1);
8edbfaa6 10950 v->quick_push (build_int_cst (size_type_node, n));
86951993 10951 for (z = 0; z < len; z++)
9771b263 10952 v->quick_push ((*params)[z]);
81e5eca8 10953 f = build_function_call_vec (loc, vNULL, function, v, NULL);
9771b263 10954 vec_free (v);
86951993
AM		 10955 return f;
10956 }
10957
10958 /* Add the size parameter and leave as a function call for processing. */
10959 size_node = build_int_cst (size_type_node, n);
9771b263 10960 params->quick_insert (0, size_node);
86951993
AM		 10961 return NULL_TREE;
10962}
10963
10964
6b28e197
JM		 10965/* Return whether atomic operations for naturally aligned N-byte
10966 arguments are supported, whether inline or through libatomic. */
10967static bool
10968atomic_size_supported_p (int n)
10969{
10970 switch (n)
10971 {
10972 case 1:
10973 case 2:
10974 case 4:
10975 case 8:
10976 return true;
10977
10978 case 16:
10979 return targetm.scalar_mode_supported_p (TImode);
10980
10981 default:
10982 return false;
10983 }
10984}
10985
86951993
AM		 10986/* This will process an __atomic_exchange function call, determine whether it
10987 needs to be mapped to the _N variation, or turned into a library call.
10988 LOC is the location of the builtin call.
10989 FUNCTION is the DECL that has been invoked;
10990 PARAMS is the argument list for the call. The return value is non-null
10991 TRUE is returned if it is translated into the proper format for a call to the
10992 external library, and NEW_RETURN is set the tree for that function.
10993 FALSE is returned if processing for the _N variation is required, and
026c3cfd 10994 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 10995static bool
10996resolve_overloaded_atomic_exchange (location_t loc, tree function,
9771b263 10997 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 10998{
10999 tree p0, p1, p2, p3;
11000 tree I_type, I_type_ptr;
11001 int n = get_atomic_generic_size (loc, function, params);
11002
c466c4ff
AM		 11003 /* Size of 0 is an error condition. */
11004 if (n == 0)
11005 {
11006 *new_return = error_mark_node;
11007 return true;
11008 }
11009
86951993 11010 /* If not a lock-free size, change to the library generic format. */
6b28e197 11011 if (!atomic_size_supported_p (n))
86951993
AM		 11012 {
11013 *new_return = add_atomic_size_parameter (n, loc, function, params);
11014 return true;
11015 }
11016
11017 /* Otherwise there is a lockfree match, transform the call from:
11018 void fn(T* mem, T* desired, T* return, model)
11019 into
11020 *return = (T) (fn (In* mem, (In) *desired, model)) */
11021
9771b263
DN		 11022 p0 = (*params)[0];
11023 p1 = (*params)[1];
11024 p2 = (*params)[2];
11025 p3 = (*params)[3];
86951993
AM		 11026
11027 /* Create pointer to appropriate size. */
11028 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11029 I_type_ptr = build_pointer_type (I_type);
11030
11031 /* Convert object pointer to required type. */
11032 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11033 (*params)[0] = p0;
86951993
AM		 11034 /* Convert new value to required type, and dereference it. */
11035 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11036 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
9771b263 11037 (*params)[1] = p1;
86951993
AM		 11038
11039 /* Move memory model to the 3rd position, and end param list. */
9771b263
DN		 11040 (*params)[2] = p3;
11041 params->truncate (3);
86951993
AM		 11042
11043 /* Convert return pointer and dereference it for later assignment. */
11044 *new_return = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11045
11046 return false;
48ae6c13
RH		 11047}
11048
86951993
AM		 11049
11050/* This will process an __atomic_compare_exchange function call, determine
11051 whether it needs to be mapped to the _N variation, or turned into a lib call.
11052 LOC is the location of the builtin call.
11053 FUNCTION is the DECL that has been invoked;
11054 PARAMS is the argument list for the call. The return value is non-null
11055 TRUE is returned if it is translated into the proper format for a call to the
11056 external library, and NEW_RETURN is set the tree for that function.
11057 FALSE is returned if processing for the _N variation is required. */
11058
11059static bool
11060resolve_overloaded_atomic_compare_exchange (location_t loc, tree function,
9771b263 11061 vec<tree, va_gc> *params,
86951993
AM		 11062 tree *new_return)
11063{
11064 tree p0, p1, p2;
11065 tree I_type, I_type_ptr;
11066 int n = get_atomic_generic_size (loc, function, params);
11067
c466c4ff
AM		 11068 /* Size of 0 is an error condition. */
11069 if (n == 0)
11070 {
11071 *new_return = error_mark_node;
11072 return true;
11073 }
11074
86951993 11075 /* If not a lock-free size, change to the library generic format. */
6b28e197 11076 if (!atomic_size_supported_p (n))
86951993
AM		 11077 {
11078 /* The library generic format does not have the weak parameter, so
11079 remove it from the param list. Since a parameter has been removed,
11080 we can be sure that there is room for the SIZE_T parameter, meaning
11081 there will not be a recursive rebuilding of the parameter list, so
11082 there is no danger this will be done twice. */
11083 if (n > 0)
11084 {
9771b263
DN		 11085 (*params)[3] = (*params)[4];
11086 (*params)[4] = (*params)[5];
11087 params->truncate (5);
86951993
AM		 11088 }
11089 *new_return = add_atomic_size_parameter (n, loc, function, params);
11090 return true;
11091 }
11092
11093 /* Otherwise, there is a match, so the call needs to be transformed from:
11094 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11095 into
11096 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11097
9771b263
DN		 11098 p0 = (*params)[0];
11099 p1 = (*params)[1];
11100 p2 = (*params)[2];
86951993
AM		 11101
11102 /* Create pointer to appropriate size. */
11103 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11104 I_type_ptr = build_pointer_type (I_type);
11105
11106 /* Convert object pointer to required type. */
11107 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11108 (*params)[0] = p0;
86951993
AM		 11109
11110 /* Convert expected pointer to required type. */
11111 p1 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p1);
9771b263 11112 (*params)[1] = p1;
86951993
AM		 11113
11114 /* Convert desired value to required type, and dereference it. */
11115 p2 = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11116 p2 = build1 (VIEW_CONVERT_EXPR, I_type, p2);
9771b263 11117 (*params)[2] = p2;
86951993
AM		 11118
11119 /* The rest of the parameters are fine. NULL means no special return value
11120 processing.*/
11121 *new_return = NULL;
11122 return false;
11123}
11124
11125
11126/* This will process an __atomic_load function call, determine whether it
11127 needs to be mapped to the _N variation, or turned into a library call.
11128 LOC is the location of the builtin call.
11129 FUNCTION is the DECL that has been invoked;
11130 PARAMS is the argument list for the call. The return value is non-null
11131 TRUE is returned if it is translated into the proper format for a call to the
11132 external library, and NEW_RETURN is set the tree for that function.
11133 FALSE is returned if processing for the _N variation is required, and
026c3cfd 11134 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 11135
11136static bool
11137resolve_overloaded_atomic_load (location_t loc, tree function,
9771b263 11138 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 11139{
11140 tree p0, p1, p2;
11141 tree I_type, I_type_ptr;
11142 int n = get_atomic_generic_size (loc, function, params);
11143
c466c4ff
AM		 11144 /* Size of 0 is an error condition. */
11145 if (n == 0)
11146 {
11147 *new_return = error_mark_node;
11148 return true;
11149 }
11150
86951993 11151 /* If not a lock-free size, change to the library generic format. */
6b28e197 11152 if (!atomic_size_supported_p (n))
86951993
AM		 11153 {
11154 *new_return = add_atomic_size_parameter (n, loc, function, params);
11155 return true;
11156 }
11157
11158 /* Otherwise, there is a match, so the call needs to be transformed from:
11159 void fn(T* mem, T* return, model)
11160 into
11161 *return = (T) (fn ((In *) mem, model)) */
11162
9771b263
DN		 11163 p0 = (*params)[0];
11164 p1 = (*params)[1];
11165 p2 = (*params)[2];
86951993
AM		 11166
11167 /* Create pointer to appropriate size. */
11168 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11169 I_type_ptr = build_pointer_type (I_type);
11170
11171 /* Convert object pointer to required type. */
11172 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11173 (*params)[0] = p0;
86951993
AM		 11174
11175 /* Move memory model to the 2nd position, and end param list. */
9771b263
DN		 11176 (*params)[1] = p2;
11177 params->truncate (2);
86951993
AM		 11178
11179 /* Convert return pointer and dereference it for later assignment. */
11180 *new_return = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11181
11182 return false;
11183}
11184
11185
11186/* This will process an __atomic_store function call, determine whether it
11187 needs to be mapped to the _N variation, or turned into a library call.
11188 LOC is the location of the builtin call.
11189 FUNCTION is the DECL that has been invoked;
11190 PARAMS is the argument list for the call. The return value is non-null
11191 TRUE is returned if it is translated into the proper format for a call to the
11192 external library, and NEW_RETURN is set the tree for that function.
11193 FALSE is returned if processing for the _N variation is required, and
026c3cfd 11194 NEW_RETURN is set to the return value the result is copied into. */
86951993
AM		 11195
11196static bool
11197resolve_overloaded_atomic_store (location_t loc, tree function,
9771b263 11198 vec<tree, va_gc> *params, tree *new_return)
86951993
AM		 11199{
11200 tree p0, p1;
11201 tree I_type, I_type_ptr;
11202 int n = get_atomic_generic_size (loc, function, params);
11203
c466c4ff
AM		 11204 /* Size of 0 is an error condition. */
11205 if (n == 0)
11206 {
11207 *new_return = error_mark_node;
11208 return true;
11209 }
11210
86951993 11211 /* If not a lock-free size, change to the library generic format. */
6b28e197 11212 if (!atomic_size_supported_p (n))
86951993
AM		 11213 {
11214 *new_return = add_atomic_size_parameter (n, loc, function, params);
11215 return true;
11216 }
11217
11218 /* Otherwise, there is a match, so the call needs to be transformed from:
11219 void fn(T* mem, T* value, model)
11220 into
11221 fn ((In *) mem, (In) *value, model) */
11222
9771b263
DN		 11223 p0 = (*params)[0];
11224 p1 = (*params)[1];
86951993
AM		 11225
11226 /* Create pointer to appropriate size. */
11227 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11228 I_type_ptr = build_pointer_type (I_type);
11229
11230 /* Convert object pointer to required type. */
11231 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
9771b263 11232 (*params)[0] = p0;
86951993
AM		 11233
11234 /* Convert new value to required type, and dereference it. */
11235 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11236 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
9771b263 11237 (*params)[1] = p1;
86951993
AM		 11238
11239 /* The memory model is in the right spot already. Return is void. */
11240 *new_return = NULL_TREE;
11241
11242 return false;
11243}
11244
11245
48ae6c13
RH		 11246/* Some builtin functions are placeholders for other expressions. This
11247 function should be called immediately after parsing the call expression
11248 before surrounding code has committed to the type of the expression.
11249
c2255bc4
AH		 11250 LOC is the location of the builtin call.
11251
48ae6c13
RH		 11252 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11253 PARAMS is the argument list for the call. The return value is non-null
11254 when expansion is complete, and null if normal processing should
11255 continue. */
11256
11257tree
9771b263
DN		 11258resolve_overloaded_builtin (location_t loc, tree function,
11259 vec<tree, va_gc> *params)
48ae6c13
RH		 11260{
11261 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
7a127fa7
MS		 11262
11263 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11264 Those are not valid to call with a pointer to _Bool (or C++ bool)
11265 and so must be rejected. */
11266 bool fetch_op = true;
86951993
AM		 11267 bool orig_format = true;
11268 tree new_return = NULL_TREE;
11269
58646b77
PB		 11270 switch (DECL_BUILT_IN_CLASS (function))
11271 {
11272 case BUILT_IN_NORMAL:
11273 break;
11274 case BUILT_IN_MD:
11275 if (targetm.resolve_overloaded_builtin)
c2255bc4 11276 return targetm.resolve_overloaded_builtin (loc, function, params);
58646b77 11277 else
c22cacf3 11278 return NULL_TREE;
58646b77
PB		 11279 default:
11280 return NULL_TREE;
11281 }
c22cacf3 11282
58646b77 11283 /* Handle BUILT_IN_NORMAL here. */
48ae6c13
RH		 11284 switch (orig_code)
11285 {
86951993
AM		 11286 case BUILT_IN_ATOMIC_EXCHANGE:
11287 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11288 case BUILT_IN_ATOMIC_LOAD:
11289 case BUILT_IN_ATOMIC_STORE:
11290 {
11291 /* Handle these 4 together so that they can fall through to the next
11292 case if the call is transformed to an _N variant. */
11293 switch (orig_code)
11294 {
11295 case BUILT_IN_ATOMIC_EXCHANGE:
11296 {
11297 if (resolve_overloaded_atomic_exchange (loc, function, params,
11298 &new_return))
11299 return new_return;
11300 /* Change to the _N variant. */
11301 orig_code = BUILT_IN_ATOMIC_EXCHANGE_N;
11302 break;
11303 }
11304
11305 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11306 {
11307 if (resolve_overloaded_atomic_compare_exchange (loc, function,
11308 params,
11309 &new_return))
11310 return new_return;
11311 /* Change to the _N variant. */
11312 orig_code = BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N;
11313 break;
11314 }
11315 case BUILT_IN_ATOMIC_LOAD:
11316 {
11317 if (resolve_overloaded_atomic_load (loc, function, params,
11318 &new_return))
11319 return new_return;
11320 /* Change to the _N variant. */
11321 orig_code = BUILT_IN_ATOMIC_LOAD_N;
11322 break;
11323 }
11324 case BUILT_IN_ATOMIC_STORE:
11325 {
11326 if (resolve_overloaded_atomic_store (loc, function, params,
11327 &new_return))
11328 return new_return;
11329 /* Change to the _N variant. */
11330 orig_code = BUILT_IN_ATOMIC_STORE_N;
11331 break;
11332 }
11333 default:
11334 gcc_unreachable ();
11335 }
11336 /* Fallthrough to the normal processing. */
11337 }
11338 case BUILT_IN_ATOMIC_EXCHANGE_N:
11339 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N:
11340 case BUILT_IN_ATOMIC_LOAD_N:
11341 case BUILT_IN_ATOMIC_STORE_N:
7a127fa7
MS		 11342 {
11343 fetch_op = false;
11344 /* Fallthrough to further processing. */
11345 }
86951993
AM		 11346 case BUILT_IN_ATOMIC_ADD_FETCH_N:
11347 case BUILT_IN_ATOMIC_SUB_FETCH_N:
11348 case BUILT_IN_ATOMIC_AND_FETCH_N:
11349 case BUILT_IN_ATOMIC_NAND_FETCH_N:
11350 case BUILT_IN_ATOMIC_XOR_FETCH_N:
11351 case BUILT_IN_ATOMIC_OR_FETCH_N:
11352 case BUILT_IN_ATOMIC_FETCH_ADD_N:
11353 case BUILT_IN_ATOMIC_FETCH_SUB_N:
11354 case BUILT_IN_ATOMIC_FETCH_AND_N:
11355 case BUILT_IN_ATOMIC_FETCH_NAND_N:
11356 case BUILT_IN_ATOMIC_FETCH_XOR_N:
11357 case BUILT_IN_ATOMIC_FETCH_OR_N:
11358 {
11359 orig_format = false;
11360 /* Fallthru for parameter processing. */
11361 }
e0a8ecf2
AM		 11362 case BUILT_IN_SYNC_FETCH_AND_ADD_N:
11363 case BUILT_IN_SYNC_FETCH_AND_SUB_N:
11364 case BUILT_IN_SYNC_FETCH_AND_OR_N:
11365 case BUILT_IN_SYNC_FETCH_AND_AND_N:
11366 case BUILT_IN_SYNC_FETCH_AND_XOR_N:
11367 case BUILT_IN_SYNC_FETCH_AND_NAND_N:
11368 case BUILT_IN_SYNC_ADD_AND_FETCH_N:
11369 case BUILT_IN_SYNC_SUB_AND_FETCH_N:
11370 case BUILT_IN_SYNC_OR_AND_FETCH_N:
11371 case BUILT_IN_SYNC_AND_AND_FETCH_N:
11372 case BUILT_IN_SYNC_XOR_AND_FETCH_N:
11373 case BUILT_IN_SYNC_NAND_AND_FETCH_N:
11374 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N:
11375 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N:
11376 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N:
11377 case BUILT_IN_SYNC_LOCK_RELEASE_N:
48ae6c13 11378 {
7a127fa7
MS		 11379 /* The following are not _FETCH_OPs and must be accepted with
11380 pointers to _Bool (or C++ bool). */
11381 if (fetch_op)
11382 fetch_op =
11383 (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11384 && orig_code != BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11385 && orig_code != BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11386 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N);
11387
11388 int n = sync_resolve_size (function, params, fetch_op);
bbbbb16a 11389 tree new_function, first_param, result;
e79983f4 11390 enum built_in_function fncode;
48ae6c13
RH		 11391
11392 if (n == 0)
11393 return error_mark_node;
11394
e79983f4
MM		 11395 fncode = (enum built_in_function)((int)orig_code + exact_log2 (n) + 1);
11396 new_function = builtin_decl_explicit (fncode);
86951993
AM		 11397 if (!sync_resolve_params (loc, function, new_function, params,
11398 orig_format))
48ae6c13
RH		 11399 return error_mark_node;
11400
9771b263 11401 first_param = (*params)[0];
81e5eca8
MP		 11402 result = build_function_call_vec (loc, vNULL, new_function, params,
11403 NULL);
86951993
AM		 11404 if (result == error_mark_node)
11405 return result;
e0a8ecf2 11406 if (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
86951993
AM		 11407 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N
11408 && orig_code != BUILT_IN_ATOMIC_STORE_N)
11409 result = sync_resolve_return (first_param, result, orig_format);
48ae6c13 11410
86951993
AM		 11411 /* If new_return is set, assign function to that expr and cast the
11412 result to void since the generic interface returned void. */
11413 if (new_return)
11414 {
11415 /* Cast function result from I{1,2,4,8,16} to the required type. */
11416 result = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (new_return), result);
11417 result = build2 (MODIFY_EXPR, TREE_TYPE (new_return), new_return,
11418 result);
11419 TREE_SIDE_EFFECTS (result) = 1;
11420 protected_set_expr_location (result, loc);
11421 result = convert (void_type_node, result);
11422 }
48ae6c13
RH		 11423 return result;
11424 }
11425
11426 default:
58646b77 11427 return NULL_TREE;
48ae6c13
RH		 11428 }
11429}
11430
0af94e6f
JR		 11431/* vector_types_compatible_elements_p is used in type checks of vectors
11432 values used as operands of binary operators. Where it returns true, and
11433 the other checks of the caller succeed (being vector types in he first
11434 place, and matching number of elements), we can just treat the types
11435 as essentially the same.
11436 Contrast with vector_targets_convertible_p, which is used for vector
11437 pointer types, and vector_types_convertible_p, which will allow
11438 language-specific matches under the control of flag_lax_vector_conversions,
11439 and might still require a conversion. */
11440/* True if vector types T1 and T2 can be inputs to the same binary
11441 operator without conversion.
11442 We don't check the overall vector size here because some of our callers
11443 want to give different error messages when the vectors are compatible
11444 except for the element count. */
11445
5bed876a 11446bool
0af94e6f 11447vector_types_compatible_elements_p (tree t1, tree t2)
5bed876a 11448{
0af94e6f
JR		 11449 bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2);
11450 t1 = TREE_TYPE (t1);
11451 t2 = TREE_TYPE (t2);
11452
5bed876a
AH		 11453 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
11454
ab22c1fa
CF		 11455 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
11456 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
11457 || c2 == FIXED_POINT_TYPE));
5bed876a 11458
0af94e6f
JR		 11459 t1 = c_common_signed_type (t1);
11460 t2 = c_common_signed_type (t2);
5bed876a
AH		 11461 /* Equality works here because c_common_signed_type uses
11462 TYPE_MAIN_VARIANT. */
0af94e6f
JR		 11463 if (t1 == t2)
11464 return true;
11465 if (opaque && c1 == c2
11466 && (c1 == INTEGER_TYPE || c1 == REAL_TYPE)
11467 && TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
11468 return true;
11469 return false;
5bed876a
AH		 11470}
11471
104f8784
KG		 11472/* Check for missing format attributes on function pointers. LTYPE is
11473 the new type or left-hand side type. RTYPE is the old type or
11474 right-hand side type. Returns TRUE if LTYPE is missing the desired
11475 attribute. */
11476
11477bool
11478check_missing_format_attribute (tree ltype, tree rtype)
11479{
11480 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
11481 tree ra;
11482
11483 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
11484 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
11485 break;
11486 if (ra)
11487 {
11488 tree la;
11489 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
11490 if (is_attribute_p ("format", TREE_PURPOSE (la)))
11491 break;
11492 return !la;
11493 }
11494 else
11495 return false;
11496}
11497
ff6b6641
GDR		 11498/* Subscripting with type char is likely to lose on a machine where
11499 chars are signed. So warn on any machine, but optionally. Don't
11500 warn for unsigned char since that type is safe. Don't warn for
11501 signed char because anyone who uses that must have done so
11502 deliberately. Furthermore, we reduce the false positive load by
11503 warning only for non-constant value of type char. */
11504
11505void
5bd012f8 11506warn_array_subscript_with_type_char (location_t loc, tree index)
ff6b6641
GDR		 11507{
11508 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
11509 && TREE_CODE (index) != INTEGER_CST)
5bd012f8
MP		 11510 warning_at (loc, OPT_Wchar_subscripts,
11511 "array subscript has type %<char%>");
ff6b6641
GDR		 11512}
11513
2a67bec2
ILT		 11514/* Implement -Wparentheses for the unexpected C precedence rules, to
11515 cover cases like x + y << z which readers are likely to
11516 misinterpret. We have seen an expression in which CODE is a binary
100d537d
MLI		 11517 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11518 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11519 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11520 expression was not formed using a binary or unary operator, or it
11521 was enclosed in parentheses. */
2a67bec2
ILT		 11522
11523void
5d9de0d0 11524warn_about_parentheses (location_t loc, enum tree_code code,
fb3e178a 11525 enum tree_code code_left, tree arg_left,
100d537d 11526 enum tree_code code_right, tree arg_right)
2a67bec2
ILT		 11527{
11528 if (!warn_parentheses)
11529 return;
11530
100d537d
MLI		 11531 /* This macro tests that the expression ARG with original tree code
11532 CODE appears to be a boolean expression. or the result of folding a
11533 boolean expression. */
11534#define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11535 (truth_value_p (TREE_CODE (ARG)) \
11536 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11537 /* Folding may create 0 or 1 integers from other expressions. */ \
11538 || ((CODE) != INTEGER_CST \
11539 && (integer_onep (ARG) || integer_zerop (ARG))))
11540
b8698a0f 11541 switch (code)
2a67bec2 11542 {
100d537d 11543 case LSHIFT_EXPR:
5d9de0d0
PC		 11544 if (code_left == PLUS_EXPR)
11545 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11546 "suggest parentheses around %<+%> inside %<<<%>");
11547 else if (code_right == PLUS_EXPR)
11548 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11549 "suggest parentheses around %<+%> inside %<<<%>");
11550 else if (code_left == MINUS_EXPR)
11551 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11552 "suggest parentheses around %<-%> inside %<<<%>");
11553 else if (code_right == MINUS_EXPR)
11554 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11555 "suggest parentheses around %<-%> inside %<<<%>");
100d537d 11556 return;
2a67bec2 11557
100d537d 11558 case RSHIFT_EXPR:
5d9de0d0
PC		 11559 if (code_left == PLUS_EXPR)
11560 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11561 "suggest parentheses around %<+%> inside %<>>%>");
11562 else if (code_right == PLUS_EXPR)
11563 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11564 "suggest parentheses around %<+%> inside %<>>%>");
11565 else if (code_left == MINUS_EXPR)
11566 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11567 "suggest parentheses around %<-%> inside %<>>%>");
11568 else if (code_right == MINUS_EXPR)
11569 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11570 "suggest parentheses around %<-%> inside %<>>%>");
100d537d 11571 return;
2a67bec2 11572
100d537d 11573 case TRUTH_ORIF_EXPR:
5d9de0d0
PC		 11574 if (code_left == TRUTH_ANDIF_EXPR)
11575 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11576 "suggest parentheses around %<&&%> within %<||%>");
11577 else if (code_right == TRUTH_ANDIF_EXPR)
11578 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11579 "suggest parentheses around %<&&%> within %<||%>");
100d537d
MLI		 11580 return;
11581
11582 case BIT_IOR_EXPR:
2a67bec2 11583 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
5d9de0d0
PC		 11584 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11585 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11586 "suggest parentheses around arithmetic in operand of %<|%>");
11587 else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
11588 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11589 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11590 "suggest parentheses around arithmetic in operand of %<|%>");
2a67bec2 11591 /* Check cases like x|y==z */
5d9de0d0
PC		 11592 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11593 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11594 "suggest parentheses around comparison in operand of %<|%>");
11595 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11596 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11597 "suggest parentheses around comparison in operand of %<|%>");
11598 /* Check cases like !x | y */
11599 else if (code_left == TRUTH_NOT_EXPR
11600 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
5d9de0d0
PC		 11601 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11602 "suggest parentheses around operand of "
11603 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
100d537d 11604 return;
2a67bec2 11605
100d537d 11606 case BIT_XOR_EXPR:
2a67bec2 11607 if (code_left == BIT_AND_EXPR
5d9de0d0
PC		 11608 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11609 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11610 "suggest parentheses around arithmetic in operand of %<^%>");
11611 else if (code_right == BIT_AND_EXPR
11612 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11613 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11614 "suggest parentheses around arithmetic in operand of %<^%>");
2a67bec2 11615 /* Check cases like x^y==z */
5d9de0d0
PC		 11616 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11617 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11618 "suggest parentheses around comparison in operand of %<^%>");
11619 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11620 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11621 "suggest parentheses around comparison in operand of %<^%>");
11622 return;
2a67bec2 11623
100d537d 11624 case BIT_AND_EXPR:
5d9de0d0
PC		 11625 if (code_left == PLUS_EXPR)
11626 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11627 "suggest parentheses around %<+%> in operand of %<&%>");
11628 else if (code_right == PLUS_EXPR)
11629 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11630 "suggest parentheses around %<+%> in operand of %<&%>");
5d9de0d0
PC		 11631 else if (code_left == MINUS_EXPR)
11632 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11633 "suggest parentheses around %<-%> in operand of %<&%>");
11634 else if (code_right == MINUS_EXPR)
11635 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d 11636 "suggest parentheses around %<-%> in operand of %<&%>");
2a67bec2 11637 /* Check cases like x&y==z */
5d9de0d0
PC		 11638 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11639 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11640 "suggest parentheses around comparison in operand of %<&%>");
11641 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11642 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11643 "suggest parentheses around comparison in operand of %<&%>");
11644 /* Check cases like !x & y */
11645 else if (code_left == TRUTH_NOT_EXPR
11646 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
5d9de0d0
PC		 11647 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11648 "suggest parentheses around operand of "
11649 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
100d537d 11650 return;
2a67bec2 11651
100d537d 11652 case EQ_EXPR:
5d9de0d0
PC		 11653 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11654 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11655 "suggest parentheses around comparison in operand of %<==%>");
11656 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11657 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11658 "suggest parentheses around comparison in operand of %<==%>");
11659 return;
11660 case NE_EXPR:
5d9de0d0
PC		 11661 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11662 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11663 "suggest parentheses around comparison in operand of %<!=%>");
11664 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11665 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
100d537d
MLI		 11666 "suggest parentheses around comparison in operand of %<!=%>");
11667 return;
11668
11669 default:
5d9de0d0
PC		 11670 if (TREE_CODE_CLASS (code) == tcc_comparison)
11671 {
11672 if (TREE_CODE_CLASS (code_left) == tcc_comparison
fb3e178a
JJ		 11673 && code_left != NE_EXPR && code_left != EQ_EXPR
11674 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
5d9de0d0
PC		 11675 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11676 "comparisons like %<X<=Y<=Z%> do not "
11677 "have their mathematical meaning");
11678 else if (TREE_CODE_CLASS (code_right) == tcc_comparison
fb3e178a 11679 && code_right != NE_EXPR && code_right != EQ_EXPR
5d9de0d0
PC		 11680 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))
11681 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11682 "comparisons like %<X<=Y<=Z%> do not "
11683 "have their mathematical meaning");
11684 }
100d537d 11685 return;
e7917d06 11686 }
100d537d 11687#undef NOT_A_BOOLEAN_EXPR_P
2a67bec2
ILT		 11688}
11689
c616e51b
MLI		 11690/* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11691
11692void
11693warn_for_unused_label (tree label)
11694{
11695 if (!TREE_USED (label))
11696 {
11697 if (DECL_INITIAL (label))
11698 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
11699 else
11700 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
11701 }
11702}
ff6b6641 11703
c9f9eb5d
AH		 11704/* Warn for division by zero according to the value of DIVISOR. LOC
11705 is the location of the division operator. */
2e9cb75e
MLI		 11706
11707void
c9f9eb5d 11708warn_for_div_by_zero (location_t loc, tree divisor)
2e9cb75e 11709{
ab22c1fa
CF		 11710 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11711 about division by zero. Do not issue a warning if DIVISOR has a
2e9cb75e
MLI		 11712 floating-point type, since we consider 0.0/0.0 a valid way of
11713 generating a NaN. */
7d882b83 11714 if (c_inhibit_evaluation_warnings == 0
ab22c1fa 11715 && (integer_zerop (divisor) || fixed_zerop (divisor)))
c9f9eb5d 11716 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
2e9cb75e
MLI		 11717}
11718
2d12797c
MLI		 11719/* Subroutine of build_binary_op. Give warnings for comparisons
11720 between signed and unsigned quantities that may fail. Do the
11721 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11722 so that casts will be considered, but default promotions won't
ba47d38d
AH		 11723 be.
11724
11725 LOCATION is the location of the comparison operator.
2d12797c
MLI		 11726
11727 The arguments of this function map directly to local variables
11728 of build_binary_op. */
11729
b8698a0f 11730void
ba47d38d 11731warn_for_sign_compare (location_t location,
b8698a0f
L		 11732 tree orig_op0, tree orig_op1,
11733 tree op0, tree op1,
2d12797c
MLI		 11734 tree result_type, enum tree_code resultcode)
11735{
11736 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
11737 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
11738 int unsignedp0, unsignedp1;
b8698a0f 11739
2d12797c
MLI		 11740 /* In C++, check for comparison of different enum types. */
11741 if (c_dialect_cxx()
11742 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
11743 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
11744 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
ead51d36 11745 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
2d12797c 11746 {
ba47d38d
AH		 11747 warning_at (location,
11748 OPT_Wsign_compare, "comparison between types %qT and %qT",
11749 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
2d12797c
MLI		 11750 }
11751
11752 /* Do not warn if the comparison is being done in a signed type,
11753 since the signed type will only be chosen if it can represent
11754 all the values of the unsigned type. */
11755 if (!TYPE_UNSIGNED (result_type))
11756 /* OK */;
11757 /* Do not warn if both operands are unsigned. */
11758 else if (op0_signed == op1_signed)
11759 /* OK */;
11760 else
11761 {
ead51d36 11762 tree sop, uop, base_type;
2d12797c 11763 bool ovf;
ead51d36 11764
2d12797c
MLI		 11765 if (op0_signed)
11766 sop = orig_op0, uop = orig_op1;
b8698a0f 11767 else
2d12797c
MLI		 11768 sop = orig_op1, uop = orig_op0;
11769
b8698a0f 11770 STRIP_TYPE_NOPS (sop);
2d12797c 11771 STRIP_TYPE_NOPS (uop);
ead51d36
JJ		 11772 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
11773 ? TREE_TYPE (result_type) : result_type);
2d12797c
MLI		 11774
11775 /* Do not warn if the signed quantity is an unsuffixed integer
11776 literal (or some static constant expression involving such
11777 literals or a conditional expression involving such literals)
11778 and it is non-negative. */
11779 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
11780 /* OK */;
11781 /* Do not warn if the comparison is an equality operation, the
11782 unsigned quantity is an integral constant, and it would fit
11783 in the result if the result were signed. */
11784 else if (TREE_CODE (uop) == INTEGER_CST
11785 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
ead51d36 11786 && int_fits_type_p (uop, c_common_signed_type (base_type)))
2d12797c
MLI		 11787 /* OK */;
11788 /* In C, do not warn if the unsigned quantity is an enumeration
11789 constant and its maximum value would fit in the result if the
11790 result were signed. */
11791 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
11792 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
11793 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
ead51d36 11794 c_common_signed_type (base_type)))
2d12797c 11795 /* OK */;
b8698a0f 11796 else
ba47d38d 11797 warning_at (location,
b8698a0f 11798 OPT_Wsign_compare,
ba47d38d 11799 "comparison between signed and unsigned integer expressions");
2d12797c 11800 }
b8698a0f 11801
2d12797c
MLI		 11802 /* Warn if two unsigned values are being compared in a size larger
11803 than their original size, and one (and only one) is the result of
11804 a `~' operator. This comparison will always fail.
b8698a0f 11805
2d12797c
MLI		 11806 Also warn if one operand is a constant, and the constant does not
11807 have all bits set that are set in the ~ operand when it is
11808 extended. */
11809
828fb3ba
JM		 11810 op0 = c_common_get_narrower (op0, &unsignedp0);
11811 op1 = c_common_get_narrower (op1, &unsignedp1);
b8698a0f 11812
2d12797c
MLI		 11813 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
11814 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
11815 {
11816 if (TREE_CODE (op0) == BIT_NOT_EXPR)
828fb3ba 11817 op0 = c_common_get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
2d12797c 11818 if (TREE_CODE (op1) == BIT_NOT_EXPR)
828fb3ba 11819 op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
2d12797c 11820
9541ffee 11821 if (tree_fits_shwi_p (op0) || tree_fits_shwi_p (op1))
2d12797c
MLI		 11822 {
11823 tree primop;
11824 HOST_WIDE_INT constant, mask;
11825 int unsignedp;
11826 unsigned int bits;
b8698a0f 11827
9541ffee 11828 if (tree_fits_shwi_p (op0))
2d12797c
MLI		 11829 {
11830 primop = op1;
11831 unsignedp = unsignedp1;
9439e9a1 11832 constant = tree_to_shwi (op0);
2d12797c
MLI		 11833 }
11834 else
11835 {
11836 primop = op0;
11837 unsignedp = unsignedp0;
9439e9a1 11838 constant = tree_to_shwi (op1);
2d12797c 11839 }
b8698a0f 11840
2d12797c
MLI		 11841 bits = TYPE_PRECISION (TREE_TYPE (primop));
11842 if (bits < TYPE_PRECISION (result_type)
11843 && bits < HOST_BITS_PER_LONG && unsignedp)
11844 {
aa256c4a 11845 mask = (~ (unsigned HOST_WIDE_INT) 0) << bits;
2d12797c
MLI		 11846 if ((mask & constant) != mask)
11847 {
11848 if (constant == 0)
0a756a3f
MP		 11849 warning_at (location, OPT_Wsign_compare,
11850 "promoted ~unsigned is always non-zero");
2d12797c 11851 else
b8698a0f 11852 warning_at (location, OPT_Wsign_compare,
ba47d38d 11853 "comparison of promoted ~unsigned with constant");
2d12797c
MLI		 11854 }
11855 }
11856 }
11857 else if (unsignedp0 && unsignedp1
11858 && (TYPE_PRECISION (TREE_TYPE (op0))
11859 < TYPE_PRECISION (result_type))
11860 && (TYPE_PRECISION (TREE_TYPE (op1))
11861 < TYPE_PRECISION (result_type)))
ba47d38d 11862 warning_at (location, OPT_Wsign_compare,
2d12797c
MLI		 11863 "comparison of promoted ~unsigned with unsigned");
11864 }
11865}
11866
c5ee1358
MM		 11867/* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11868 type via c_common_type. If -Wdouble-promotion is in use, and the
11869 conditions for warning have been met, issue a warning. GMSGID is
11870 the warning message. It must have two %T specifiers for the type
11871 that was converted (generally "float") and the type to which it was
11872 converted (generally "double), respectively. LOC is the location
11873 to which the awrning should refer. */
11874
11875void
11876do_warn_double_promotion (tree result_type, tree type1, tree type2,
11877 const char *gmsgid, location_t loc)
11878{
11879 tree source_type;
11880
11881 if (!warn_double_promotion)
11882 return;
11883 /* If the conversion will not occur at run-time, there is no need to
11884 warn about it. */
11885 if (c_inhibit_evaluation_warnings)
11886 return;
11887 if (TYPE_MAIN_VARIANT (result_type) != double_type_node
11888 && TYPE_MAIN_VARIANT (result_type) != complex_double_type_node)
11889 return;
11890 if (TYPE_MAIN_VARIANT (type1) == float_type_node
11891 || TYPE_MAIN_VARIANT (type1) == complex_float_type_node)
11892 source_type = type1;
11893 else if (TYPE_MAIN_VARIANT (type2) == float_type_node
11894 || TYPE_MAIN_VARIANT (type2) == complex_float_type_node)
11895 source_type = type2;
11896 else
11897 return;
11898 warning_at (loc, OPT_Wdouble_promotion, gmsgid, source_type, result_type);
11899}
11900
da2e71c9
MLI		 11901/* Possibly warn about unused parameters. */
11902
11903void
11904do_warn_unused_parameter (tree fn)
11905{
11906 tree decl;
11907
11908 for (decl = DECL_ARGUMENTS (fn);
11909 decl; decl = DECL_CHAIN (decl))
11910 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
11911 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl)
11912 && !TREE_NO_WARNING (decl))
11913 warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wunused_parameter,
11914 "unused parameter %qD", decl);
11915}
11916
11917
d0940d56
DS		 11918/* Setup a TYPE_DECL node as a typedef representation.
11919
11920 X is a TYPE_DECL for a typedef statement. Create a brand new
11921 ..._TYPE node (which will be just a variant of the existing
11922 ..._TYPE node with identical properties) and then install X
11923 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11924
11925 The whole point here is to end up with a situation where each
11926 and every ..._TYPE node the compiler creates will be uniquely
11927 associated with AT MOST one node representing a typedef name.
11928 This way, even though the compiler substitutes corresponding
11929 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11930 early on, later parts of the compiler can always do the reverse
11931 translation and get back the corresponding typedef name. For
11932 example, given:
11933
11934 typedef struct S MY_TYPE;
11935 MY_TYPE object;
11936
11937 Later parts of the compiler might only know that `object' was of
11938 type `struct S' if it were not for code just below. With this
11939 code however, later parts of the compiler see something like:
11940
11941 struct S' == struct S
11942 typedef struct S' MY_TYPE;
11943 struct S' object;
11944
11945 And they can then deduce (from the node for type struct S') that
11946 the original object declaration was:
11947
11948 MY_TYPE object;
11949
11950 Being able to do this is important for proper support of protoize,
11951 and also for generating precise symbolic debugging information
11952 which takes full account of the programmer's (typedef) vocabulary.
11953
11954 Obviously, we don't want to generate a duplicate ..._TYPE node if
11955 the TYPE_DECL node that we are now processing really represents a
11956 standard built-in type. */
11957
11958void
11959set_underlying_type (tree x)
11960{
11961 if (x == error_mark_node)
11962 return;
11963 if (DECL_IS_BUILTIN (x))
11964 {
11965 if (TYPE_NAME (TREE_TYPE (x)) == 0)
11966 TYPE_NAME (TREE_TYPE (x)) = x;
11967 }
11968 else if (TREE_TYPE (x) != error_mark_node
11969 && DECL_ORIGINAL_TYPE (x) == NULL_TREE)
11970 {
11971 tree tt = TREE_TYPE (x);
11972 DECL_ORIGINAL_TYPE (x) = tt;
11973 tt = build_variant_type_copy (tt);
11974 TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
11975 TYPE_NAME (tt) = x;
11976 TREE_USED (tt) = TREE_USED (x);
11977 TREE_TYPE (x) = tt;
11978 }
11979}
11980
b646ba3f
DS		 11981/* Record the types used by the current global variable declaration
11982 being parsed, so that we can decide later to emit their debug info.
11983 Those types are in types_used_by_cur_var_decl, and we are going to
11984 store them in the types_used_by_vars_hash hash table.
11985 DECL is the declaration of the global variable that has been parsed. */
11986
11987void
11988record_types_used_by_current_var_decl (tree decl)
11989{
11990 gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl));
11991
9771b263 11992 while (types_used_by_cur_var_decl && !types_used_by_cur_var_decl->is_empty ())
b646ba3f 11993 {
9771b263 11994 tree type = types_used_by_cur_var_decl->pop ();
bc87224e 11995 types_used_by_var_decl_insert (type, decl);
b646ba3f
DS		 11996 }
11997}
11998
3797cb21
DS		 11999/* If DECL is a typedef that is declared in the current function,
12000 record it for the purpose of -Wunused-local-typedefs. */
12001
12002void
12003record_locally_defined_typedef (tree decl)
12004{
12005 struct c_language_function *l;
12006
12007 if (!warn_unused_local_typedefs
12008 || cfun == NULL
12009 /* if this is not a locally defined typedef then we are not
12010 interested. */
12011 || !is_typedef_decl (decl)
12012 || !decl_function_context (decl))
12013 return;
12014
12015 l = (struct c_language_function *) cfun->language;
9771b263 12016 vec_safe_push (l->local_typedefs, decl);
3797cb21
DS		 12017}
12018
12019/* If T is a TYPE_DECL declared locally, mark it as used. */
12020
12021void
12022maybe_record_typedef_use (tree t)
12023{
12024 if (!is_typedef_decl (t))
12025 return;
12026
12027 TREE_USED (t) = true;
12028}
12029
12030/* Warn if there are some unused locally defined typedefs in the
12031 current function. */
12032
12033void
12034maybe_warn_unused_local_typedefs (void)
12035{
12036 int i;
12037 tree decl;
12038 /* The number of times we have emitted -Wunused-local-typedefs
12039 warnings. If this is different from errorcount, that means some
12040 unrelated errors have been issued. In which case, we'll avoid
12041 emitting "unused-local-typedefs" warnings. */
12042 static int unused_local_typedefs_warn_count;
12043 struct c_language_function *l;
12044
12045 if (cfun == NULL)
12046 return;
12047
12048 if ((l = (struct c_language_function *) cfun->language) == NULL)
12049 return;
12050
12051 if (warn_unused_local_typedefs
12052 && errorcount == unused_local_typedefs_warn_count)
12053 {
9771b263 12054 FOR_EACH_VEC_SAFE_ELT (l->local_typedefs, i, decl)
3797cb21
DS		 12055 if (!TREE_USED (decl))
12056 warning_at (DECL_SOURCE_LOCATION (decl),
12057 OPT_Wunused_local_typedefs,
12058 "typedef %qD locally defined but not used", decl);
12059 unused_local_typedefs_warn_count = errorcount;
12060 }
12061
9771b263 12062 vec_free (l->local_typedefs);
3797cb21
DS		 12063}
12064
04159acf
MP		 12065/* Warn about boolean expression compared with an integer value different
12066 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12067 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12068 are the operands of the comparison. The caller must ensure that
12069 either operand is a boolean expression. */
12070
12071void
12072maybe_warn_bool_compare (location_t loc, enum tree_code code, tree op0,
12073 tree op1)
12074{
12075 if (TREE_CODE_CLASS (code) != tcc_comparison)
12076 return;
12077
f479b43d
JM		 12078 tree f, cst;
12079 if (f = fold_for_warn (op0),
12080 TREE_CODE (f) == INTEGER_CST)
12081 cst = op0 = f;
12082 else if (f = fold_for_warn (op1),
12083 TREE_CODE (f) == INTEGER_CST)
12084 cst = op1 = f;
12085 else
04159acf
MP		 12086 return;
12087
12088 if (!integer_zerop (cst) && !integer_onep (cst))
12089 {
716c0ba6
MP		 12090 int sign = (TREE_CODE (op0) == INTEGER_CST
12091 ? tree_int_cst_sgn (cst) : -tree_int_cst_sgn (cst));
04159acf
MP		 12092 if (code == EQ_EXPR
12093 || ((code == GT_EXPR || code == GE_EXPR) && sign < 0)
12094 || ((code == LT_EXPR || code == LE_EXPR) && sign > 0))
12095 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12096 "with boolean expression is always false", cst);
12097 else
12098 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12099 "with boolean expression is always true", cst);
12100 }
716c0ba6
MP		 12101 else if (integer_zerop (cst) || integer_onep (cst))
12102 {
577cd070
MP		 12103 /* If the non-constant operand isn't of a boolean type, we
12104 don't want to warn here. */
12105 tree noncst = TREE_CODE (op0) == INTEGER_CST ? op1 : op0;
12106 /* Handle booleans promoted to integers. */
12107 if (CONVERT_EXPR_P (noncst)
12108 && TREE_TYPE (noncst) == integer_type_node
12109 && TREE_CODE (TREE_TYPE (TREE_OPERAND (noncst, 0))) == BOOLEAN_TYPE)
12110 /* Warn. */;
12111 else if (TREE_CODE (TREE_TYPE (noncst)) != BOOLEAN_TYPE
12112 && !truth_value_p (TREE_CODE (noncst)))
12113 return;
716c0ba6
MP		 12114 /* Do some magic to get the right diagnostics. */
12115 bool flag = TREE_CODE (op0) == INTEGER_CST;
12116 flag = integer_zerop (cst) ? flag : !flag;
12117 if ((code == GE_EXPR && !flag) || (code == LE_EXPR && flag))
12118 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12119 "with boolean expression is always true", cst);
12120 else if ((code == LT_EXPR && !flag) || (code == GT_EXPR && flag))
12121 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12122 "with boolean expression is always false", cst);
12123 }
04159acf
MP		 12124}
12125
451b5e48
MP		 12126/* Warn if signed left shift overflows. We don't warn
12127 about left-shifting 1 into the sign bit in C++14; cf.
12128 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12129 LOC is a location of the shift; OP0 and OP1 are the operands.
12130 Return true if an overflow is detected, false otherwise. */
12131
12132bool
12133maybe_warn_shift_overflow (location_t loc, tree op0, tree op1)
12134{
12135 if (TREE_CODE (op0) != INTEGER_CST
12136 || TREE_CODE (op1) != INTEGER_CST)
12137 return false;
12138
12139 tree type0 = TREE_TYPE (op0);
12140 unsigned int prec0 = TYPE_PRECISION (type0);
12141
12142 /* Left-hand operand must be signed. */
12143 if (TYPE_UNSIGNED (type0))
12144 return false;
12145
b893e375
MP		 12146 unsigned int min_prec = (wi::min_precision (op0, SIGNED)
12147 + TREE_INT_CST_LOW (op1));
c5404f1c
PB		 12148 /* Handle the case of left-shifting 1 into the sign bit.
12149 * However, shifting 1 _out_ of the sign bit, as in
12150 * INT_MIN << 1, is considered an overflow.
12151 */
12152 if (!tree_int_cst_sign_bit(op0) && min_prec == prec0 + 1)
451b5e48
MP		 12153 {
12154 /* Never warn for C++14 onwards. */
12155 if (cxx_dialect >= cxx14)
12156 return false;
12157 /* Otherwise only if -Wshift-overflow=2. But return
12158 true to signal an overflow for the sake of integer
12159 constant expressions. */
12160 if (warn_shift_overflow < 2)
12161 return true;
12162 }
12163
451b5e48
MP		 12164 bool overflowed = min_prec > prec0;
12165 if (overflowed && c_inhibit_evaluation_warnings == 0)
12166 warning_at (loc, OPT_Wshift_overflow_,
12167 "result of %qE requires %u bits to represent, "
12168 "but %qT only has %u bits",
12169 build2_loc (loc, LSHIFT_EXPR, type0, op0, op1),
12170 min_prec, type0, prec0);
12171
12172 return overflowed;
12173}
12174
c166b898
ILT		 12175/* The C and C++ parsers both use vectors to hold function arguments.
12176 For efficiency, we keep a cache of unused vectors. This is the
12177 cache. */
12178
9771b263
DN		 12179typedef vec<tree, va_gc> *tree_gc_vec;
12180static GTY((deletable)) vec<tree_gc_vec, va_gc> *tree_vector_cache;
c166b898
ILT		 12181
12182/* Return a new vector from the cache. If the cache is empty,
12183 allocate a new vector. These vectors are GC'ed, so it is OK if the
12184 pointer is not released.. */
12185
9771b263 12186vec<tree, va_gc> *
c166b898
ILT		 12187make_tree_vector (void)
12188{
9771b263
DN		 12189 if (tree_vector_cache && !tree_vector_cache->is_empty ())
12190 return tree_vector_cache->pop ();
c166b898
ILT		 12191 else
12192 {
9771b263 12193 /* Passing 0 to vec::alloc returns NULL, and our callers require
c166b898
ILT		 12194 that we always return a non-NULL value. The vector code uses
12195 4 when growing a NULL vector, so we do too. */
9771b263
DN		 12196 vec<tree, va_gc> *v;
12197 vec_alloc (v, 4);
12198 return v;
c166b898
ILT		 12199 }
12200}
12201
12202/* Release a vector of trees back to the cache. */
12203
12204void
9771b263 12205release_tree_vector (vec<tree, va_gc> *vec)
c166b898
ILT		 12206{
12207 if (vec != NULL)
12208 {
9771b263
DN		 12209 vec->truncate (0);
12210 vec_safe_push (tree_vector_cache, vec);
c166b898
ILT		 12211 }
12212}
12213
12214/* Get a new tree vector holding a single tree. */
12215
9771b263 12216vec<tree, va_gc> *
c166b898
ILT		 12217make_tree_vector_single (tree t)
12218{
9771b263
DN		 12219 vec<tree, va_gc> *ret = make_tree_vector ();
12220 ret->quick_push (t);
c166b898
ILT		 12221 return ret;
12222}
12223
c12ff9d8
JM		 12224/* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12225
9771b263 12226vec<tree, va_gc> *
c12ff9d8
JM		 12227make_tree_vector_from_list (tree list)
12228{
9771b263 12229 vec<tree, va_gc> *ret = make_tree_vector ();
c12ff9d8 12230 for (; list; list = TREE_CHAIN (list))
9771b263 12231 vec_safe_push (ret, TREE_VALUE (list));
c12ff9d8
JM		 12232 return ret;
12233}
12234
c166b898
ILT		 12235/* Get a new tree vector which is a copy of an existing one. */
12236
9771b263
DN		 12237vec<tree, va_gc> *
12238make_tree_vector_copy (const vec<tree, va_gc> *orig)
c166b898 12239{
9771b263 12240 vec<tree, va_gc> *ret;
c166b898
ILT		 12241 unsigned int ix;
12242 tree t;
12243
12244 ret = make_tree_vector ();
9771b263
DN		 12245 vec_safe_reserve (ret, vec_safe_length (orig));
12246 FOR_EACH_VEC_SAFE_ELT (orig, ix, t)
12247 ret->quick_push (t);
c166b898
ILT		 12248 return ret;
12249}
12250
a9aa2c3a
NF		 12251/* Return true if KEYWORD starts a type specifier. */
12252
12253bool
12254keyword_begins_type_specifier (enum rid keyword)
12255{
12256 switch (keyword)
12257 {
38b7bc7f 12258 case RID_AUTO_TYPE:
a9aa2c3a
NF		 12259 case RID_INT:
12260 case RID_CHAR:
12261 case RID_FLOAT:
12262 case RID_DOUBLE:
12263 case RID_VOID:
a9aa2c3a
NF		 12264 case RID_UNSIGNED:
12265 case RID_LONG:
12266 case RID_SHORT:
12267 case RID_SIGNED:
12268 case RID_DFLOAT32:
12269 case RID_DFLOAT64:
12270 case RID_DFLOAT128:
12271 case RID_FRACT:
12272 case RID_ACCUM:
12273 case RID_BOOL:
12274 case RID_WCHAR:
12275 case RID_CHAR16:
12276 case RID_CHAR32:
12277 case RID_SAT:
12278 case RID_COMPLEX:
12279 case RID_TYPEOF:
12280 case RID_STRUCT:
12281 case RID_CLASS:
12282 case RID_UNION:
12283 case RID_ENUM:
12284 return true;
12285 default:
78a7c317
DD		 12286 if (keyword >= RID_FIRST_INT_N
12287 && keyword < RID_FIRST_INT_N + NUM_INT_N_ENTS
12288 && int_n_enabled_p[keyword-RID_FIRST_INT_N])
12289 return true;
a9aa2c3a
NF		 12290 return false;
12291 }
12292}
12293
12294/* Return true if KEYWORD names a type qualifier. */
12295
12296bool
12297keyword_is_type_qualifier (enum rid keyword)
12298{
12299 switch (keyword)
12300 {
12301 case RID_CONST:
12302 case RID_VOLATILE:
12303 case RID_RESTRICT:
267bac10 12304 case RID_ATOMIC:
a9aa2c3a
NF		 12305 return true;
12306 default:
12307 return false;
12308 }
12309}
12310
12311/* Return true if KEYWORD names a storage class specifier.
12312
12313 RID_TYPEDEF is not included in this list despite `typedef' being
12314 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12315 such for syntactic convenience only. */
12316
12317bool
12318keyword_is_storage_class_specifier (enum rid keyword)
12319{
12320 switch (keyword)
12321 {
12322 case RID_STATIC:
12323 case RID_EXTERN:
12324 case RID_REGISTER:
12325 case RID_AUTO:
12326 case RID_MUTABLE:
12327 case RID_THREAD:
12328 return true;
12329 default:
12330 return false;
12331 }
12332}
12333
ba9e6dd5
NF		 12334/* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12335
12336static bool
12337keyword_is_function_specifier (enum rid keyword)
12338{
12339 switch (keyword)
12340 {
12341 case RID_INLINE:
bbceee64 12342 case RID_NORETURN:
ba9e6dd5
NF		 12343 case RID_VIRTUAL:
12344 case RID_EXPLICIT:
12345 return true;
12346 default:
12347 return false;
12348 }
12349}
12350
12351/* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12352 declaration-specifier (C99 6.7). */
12353
12354bool
12355keyword_is_decl_specifier (enum rid keyword)
12356{
12357 if (keyword_is_storage_class_specifier (keyword)
12358 || keyword_is_type_qualifier (keyword)
12359 || keyword_is_function_specifier (keyword))
12360 return true;
12361
12362 switch (keyword)
12363 {
12364 case RID_TYPEDEF:
12365 case RID_FRIEND:
12366 case RID_CONSTEXPR:
12367 return true;
12368 default:
12369 return false;
12370 }
12371}
12372
81f653d6
NF		 12373/* Initialize language-specific-bits of tree_contains_struct. */
12374
12375void
12376c_common_init_ts (void)
12377{
12378 MARK_TS_TYPED (C_MAYBE_CONST_EXPR);
12379 MARK_TS_TYPED (EXCESS_PRECISION_EXPR);
36536d79 12380 MARK_TS_TYPED (ARRAY_NOTATION_REF);
81f653d6
NF		 12381}
12382
3ce4f9e4
ESR		 12383/* Build a user-defined numeric literal out of an integer constant type VALUE
12384 with identifier SUFFIX. */
12385
12386tree
2d7aa578
ESR		 12387build_userdef_literal (tree suffix_id, tree value,
12388 enum overflow_type overflow, tree num_string)
3ce4f9e4
ESR		 12389{
12390 tree literal = make_node (USERDEF_LITERAL);
12391 USERDEF_LITERAL_SUFFIX_ID (literal) = suffix_id;
12392 USERDEF_LITERAL_VALUE (literal) = value;
2d7aa578 12393 USERDEF_LITERAL_OVERFLOW (literal) = overflow;
3ce4f9e4
ESR		 12394 USERDEF_LITERAL_NUM_STRING (literal) = num_string;
12395 return literal;
12396}
12397
7edaa4d2 12398/* For vector[index], convert the vector to a
aa7da51a
JJ		 12399 pointer of the underlying type. Return true if the resulting
12400 ARRAY_REF should not be an lvalue. */
12401
12402bool
7edaa4d2 12403convert_vector_to_pointer_for_subscript (location_t loc,
aa7da51a 12404 tree *vecp, tree index)
7edaa4d2 12405{
aa7da51a 12406 bool ret = false;
31521951 12407 if (VECTOR_TYPE_P (TREE_TYPE (*vecp)))
7edaa4d2
MG		 12408 {
12409 tree type = TREE_TYPE (*vecp);
12410 tree type1;
12411
aa7da51a 12412 ret = !lvalue_p (*vecp);
7edaa4d2 12413 if (TREE_CODE (index) == INTEGER_CST)
cc269bb6 12414 if (!tree_fits_uhwi_p (index)
7d362f6c 12415 || tree_to_uhwi (index) >= TYPE_VECTOR_SUBPARTS (type))
7edaa4d2
MG		 12416 warning_at (loc, OPT_Warray_bounds, "index value is out of bound");
12417
aa7da51a
JJ		 12418 if (ret)
12419 {
b731b390 12420 tree tmp = create_tmp_var_raw (type);
aa7da51a
JJ		 12421 DECL_SOURCE_LOCATION (tmp) = loc;
12422 *vecp = c_save_expr (*vecp);
12423 if (TREE_CODE (*vecp) == C_MAYBE_CONST_EXPR)
12424 {
12425 bool non_const = C_MAYBE_CONST_EXPR_NON_CONST (*vecp);
12426 *vecp = C_MAYBE_CONST_EXPR_EXPR (*vecp);
12427 *vecp
12428 = c_wrap_maybe_const (build4 (TARGET_EXPR, type, tmp,
12429 *vecp, NULL_TREE, NULL_TREE),
12430 non_const);
12431 }
12432 else
12433 *vecp = build4 (TARGET_EXPR, type, tmp, *vecp,
12434 NULL_TREE, NULL_TREE);
12435 SET_EXPR_LOCATION (*vecp, loc);
12436 c_common_mark_addressable_vec (tmp);
12437 }
12438 else
12439 c_common_mark_addressable_vec (*vecp);
7edaa4d2 12440 type = build_qualified_type (TREE_TYPE (type), TYPE_QUALS (type));
7edaa4d2 12441 type1 = build_pointer_type (TREE_TYPE (*vecp));
b0f1bf36
RB		 12442 bool ref_all = TYPE_REF_CAN_ALIAS_ALL (type1);
12443 if (!ref_all
12444 && !DECL_P (*vecp))
12445 {
12446 /* If the original vector isn't declared may_alias and it
12447 isn't a bare vector look if the subscripting would
12448 alias the vector we subscript, and if not, force ref-all. */
12449 alias_set_type vecset = get_alias_set (*vecp);
12450 alias_set_type sset = get_alias_set (type);
12451 if (!alias_sets_must_conflict_p (sset, vecset)
12452 && !alias_set_subset_of (sset, vecset))
12453 ref_all = true;
12454 }
12455 type = build_pointer_type_for_mode (type, ptr_mode, ref_all);
7edaa4d2
MG		 12456 *vecp = build1 (ADDR_EXPR, type1, *vecp);
12457 *vecp = convert (type, *vecp);
12458 }
aa7da51a 12459 return ret;
7edaa4d2
MG		 12460}
12461
a212e43f
MG		 12462/* Determine which of the operands, if any, is a scalar that needs to be
12463 converted to a vector, for the range of operations. */
12464enum stv_conv
12465scalar_to_vector (location_t loc, enum tree_code code, tree op0, tree op1,
12466 bool complain)
12467{
12468 tree type0 = TREE_TYPE (op0);
12469 tree type1 = TREE_TYPE (op1);
12470 bool integer_only_op = false;
12471 enum stv_conv ret = stv_firstarg;
12472
31521951 12473 gcc_assert (VECTOR_TYPE_P (type0) || VECTOR_TYPE_P (type1));
a212e43f
MG		 12474 switch (code)
12475 {
12476 /* Most GENERIC binary expressions require homogeneous arguments.
12477 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12478 argument that is a vector and a second one that is a scalar, so
12479 we never return stv_secondarg for them. */
12480 case RSHIFT_EXPR:
12481 case LSHIFT_EXPR:
12482 if (TREE_CODE (type0) == INTEGER_TYPE
12483 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12484 {
68fca595 12485 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12486 {
12487 if (complain)
12488 error_at (loc, "conversion of scalar %qT to vector %qT "
12489 "involves truncation", type0, type1);
12490 return stv_error;
12491 }
12492 else
12493 return stv_firstarg;
12494 }
12495 break;
12496
12497 case BIT_IOR_EXPR:
12498 case BIT_XOR_EXPR:
12499 case BIT_AND_EXPR:
12500 integer_only_op = true;
12501 /* ... fall through ... */
12502
93100c6b
MG		 12503 case VEC_COND_EXPR:
12504
a212e43f
MG		 12505 case PLUS_EXPR:
12506 case MINUS_EXPR:
12507 case MULT_EXPR:
12508 case TRUNC_DIV_EXPR:
12509 case CEIL_DIV_EXPR:
12510 case FLOOR_DIV_EXPR:
12511 case ROUND_DIV_EXPR:
12512 case EXACT_DIV_EXPR:
12513 case TRUNC_MOD_EXPR:
12514 case FLOOR_MOD_EXPR:
12515 case RDIV_EXPR:
12516 case EQ_EXPR:
12517 case NE_EXPR:
12518 case LE_EXPR:
12519 case GE_EXPR:
12520 case LT_EXPR:
12521 case GT_EXPR:
12522 /* What about UNLT_EXPR? */
31521951 12523 if (VECTOR_TYPE_P (type0))
a212e43f 12524 {
a212e43f 12525 ret = stv_secondarg;
6b4db501
MM		 12526 std::swap (type0, type1);
12527 std::swap (op0, op1);
a212e43f
MG		 12528 }
12529
12530 if (TREE_CODE (type0) == INTEGER_TYPE
12531 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12532 {
68fca595 12533 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12534 {
12535 if (complain)
12536 error_at (loc, "conversion of scalar %qT to vector %qT "
12537 "involves truncation", type0, type1);
12538 return stv_error;
12539 }
12540 return ret;
12541 }
12542 else if (!integer_only_op
12543 /* Allow integer --> real conversion if safe. */
12544 && (TREE_CODE (type0) == REAL_TYPE
12545 || TREE_CODE (type0) == INTEGER_TYPE)
12546 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1)))
12547 {
68fca595 12548 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
a212e43f
MG		 12549 {
12550 if (complain)
12551 error_at (loc, "conversion of scalar %qT to vector %qT "
12552 "involves truncation", type0, type1);
12553 return stv_error;
12554 }
12555 return ret;
12556 }
12557 default:
12558 break;
12559 }
12560
12561 return stv_nothing;
12562}
12563
e28d52cf
DS		 12564/* Return true iff ALIGN is an integral constant that is a fundamental
12565 alignment, as defined by [basic.align] in the c++-11
12566 specifications.
12567
12568 That is:
12569
12570 [A fundamental alignment is represented by an alignment less than or
12571 equal to the greatest alignment supported by the implementation
12572 in all contexts, which is equal to
12573 alignof(max_align_t)]. */
12574
12575bool
12576cxx_fundamental_alignment_p (unsigned align)
12577{
12578 return (align <= MAX (TYPE_ALIGN (long_long_integer_type_node),
12579 TYPE_ALIGN (long_double_type_node)));
12580}
12581
f04dda30
MP		 12582/* Return true if T is a pointer to a zero-sized aggregate. */
12583
12584bool
12585pointer_to_zero_sized_aggr_p (tree t)
12586{
12587 if (!POINTER_TYPE_P (t))
12588 return false;
12589 t = TREE_TYPE (t);
12590 return (TYPE_SIZE (t) && integer_zerop (TYPE_SIZE (t)));
12591}
12592
1807ffc1
MS		 12593/* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12594 with no library fallback or for an ADDR_EXPR whose operand is such type
12595 issues an error pointing to the location LOC.
12596 Returns true when the expression has been diagnosed and false
12597 otherwise. */
12598bool
12599reject_gcc_builtin (const_tree expr, location_t loc /* = UNKNOWN_LOCATION */)
12600{
12601 if (TREE_CODE (expr) == ADDR_EXPR)
12602 expr = TREE_OPERAND (expr, 0);
12603
12604 if (TREE_TYPE (expr)
12605 && TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
12606 && DECL_P (expr)
12607 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12608 false positives for user-declared built-ins such as abs or
12609 strlen, and for C++ operators new and delete.
12610 The c_decl_implicit() test avoids false positives for implicitly
12611 declared built-ins with library fallbacks (such as abs). */
12612 && DECL_BUILT_IN (expr)
12613 && DECL_IS_BUILTIN (expr)
12614 && !c_decl_implicit (expr)
12615 && !DECL_ASSEMBLER_NAME_SET_P (expr))
12616 {
12617 if (loc == UNKNOWN_LOCATION)
12618 loc = EXPR_LOC_OR_LOC (expr, input_location);
12619
12620 /* Reject arguments that are built-in functions with
12621 no library fallback. */
12622 error_at (loc, "built-in function %qE must be directly called", expr);
12623
12624 return true;
12625 }
12626
12627 return false;
12628}
12629
3e3b8d63
MP		 12630/* If we're creating an if-else-if condition chain, first see if we
12631 already have this COND in the CHAIN. If so, warn and don't add COND
12632 into the vector, otherwise add the COND there. LOC is the location
12633 of COND. */
12634
12635void
12636warn_duplicated_cond_add_or_warn (location_t loc, tree cond, vec<tree> **chain)
12637{
12638 /* No chain has been created yet. Do nothing. */
12639 if (*chain == NULL)
12640 return;
12641
12642 if (TREE_SIDE_EFFECTS (cond))
12643 {
12644 /* Uh-oh! This condition has a side-effect, thus invalidates
12645 the whole chain. */
12646 delete *chain;
12647 *chain = NULL;
12648 return;
12649 }
12650
12651 unsigned int ix;
12652 tree t;
12653 bool found = false;
12654 FOR_EACH_VEC_ELT (**chain, ix, t)
12655 if (operand_equal_p (cond, t, 0))
12656 {
12657 if (warning_at (loc, OPT_Wduplicated_cond,
12658 "duplicated %<if%> condition"))
12659 inform (EXPR_LOCATION (t), "previously used here");
12660 found = true;
12661 break;
12662 }
12663
12664 if (!found
12665 && !CONSTANT_CLASS_P (cond)
12666 /* Don't infinitely grow the chain. */
12667 && (*chain)->length () < 512)
12668 (*chain)->safe_push (cond);
12669}
12670
e78bede6
MP		 12671/* Check if array size calculations overflow or if the array covers more
12672 than half of the address space. Return true if the size of the array
12673 is valid, false otherwise. TYPE is the type of the array and NAME is
12674 the name of the array, or NULL_TREE for unnamed arrays. */
12675
12676bool
12677valid_array_size_p (location_t loc, tree type, tree name)
12678{
12679 if (type != error_mark_node
12680 && COMPLETE_TYPE_P (type)
12681 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
12682 && !valid_constant_size_p (TYPE_SIZE_UNIT (type)))
12683 {
12684 if (name)
12685 error_at (loc, "size of array %qE is too large", name);
12686 else
12687 error_at (loc, "size of unnamed array is too large");
12688 return false;
12689 }
12690 return true;
12691}
12692
39dabefd 12693#include "gt-c-family-c-common.h"
Mirror of https://gcc.gnu.org/git/gcc.git